39 #define MB_INTRA_VLC_BITS 9
44 { 0, 1, 2, 4, 8, 16, 32, 64, 128 },
45 { 0, 1, 3, 7, 15, 31, 63, 127, 255 },
72 int topleft_mb_pos, top_mb_pos;
73 int stride_y, fieldtx = 0;
89 v_dist = (16 - fieldtx) >> (fieldtx == 0);
114 v_dist = fieldtx ? 15 : 8;
136 #define inc_blk_idx(idx) do { \
138 if (idx >= v->n_allocated_blks) \
159 #define GET_MQUANT() \
160 if (v->dquantfrm) { \
162 if (v->dqprofile == DQPROFILE_ALL_MBS) { \
163 if (v->dqbilevel) { \
164 mquant = (get_bits1(gb)) ? v->altpq : v->pq; \
166 mqdiff = get_bits(gb, 3); \
168 mquant = v->pq + mqdiff; \
170 mquant = get_bits(gb, 5); \
173 if (v->dqprofile == DQPROFILE_SINGLE_EDGE) \
174 edges = 1 << v->dqsbedge; \
175 else if (v->dqprofile == DQPROFILE_DOUBLE_EDGES) \
176 edges = (3 << v->dqsbedge) % 15; \
177 else if (v->dqprofile == DQPROFILE_FOUR_EDGES) \
179 if ((edges&1) && !s->mb_x) \
181 if ((edges&2) && s->first_slice_line) \
183 if ((edges&4) && s->mb_x == (s->mb_width - 1)) \
185 if ((edges&8) && s->mb_y == (s->mb_height - 1)) \
187 if (!mquant || mquant > 31) { \
188 av_log(v->s.avctx, AV_LOG_ERROR, \
189 "Overriding invalid mquant %d\n", mquant); \
201 #define GET_MVDATA(_dmv_x, _dmv_y) \
202 index = 1 + get_vlc2(gb, ff_vc1_mv_diff_vlc[s->mv_table_index].table, \
203 VC1_MV_DIFF_VLC_BITS, 2); \
211 _dmv_x = _dmv_y = 0; \
212 } else if (index == 35) { \
213 _dmv_x = get_bits(gb, v->k_x - 1 + s->quarter_sample); \
214 _dmv_y = get_bits(gb, v->k_y - 1 + s->quarter_sample); \
215 } else if (index == 36) { \
220 index1 = index % 6; \
221 _dmv_x = offset_table[1][index1]; \
222 val = size_table[index1] - (!s->quarter_sample && index1 == 5); \
224 val = get_bits(gb, val); \
225 sign = 0 - (val & 1); \
226 _dmv_x = (sign ^ ((val >> 1) + _dmv_x)) - sign; \
229 index1 = index / 6; \
230 _dmv_y = offset_table[1][index1]; \
231 val = size_table[index1] - (!s->quarter_sample && index1 == 5); \
233 val = get_bits(gb, val); \
234 sign = 0 - (val & 1); \
235 _dmv_y = (sign ^ ((val >> 1) + _dmv_y)) - sign; \
240 int *dmv_y,
int *pred_flag)
243 int extend_x, extend_y;
263 *pred_flag = *dmv_y & 1;
264 *dmv_y = (*dmv_y + (*dmv_y & 1)) >> 1;
269 index1 = (index + 1) % 9;
271 val =
get_bits(gb, index1 + extend_x);
272 sign = 0 - (val & 1);
273 *dmv_x = (sign ^ ((val >> 1) +
offset_table[extend_x][index1])) - sign;
276 index1 = (index + 1) / 9;
279 sign = 0 - (val & 1);
283 if (v->
numref && pred_flag)
284 *pred_flag = index1 & 1;
291 int direct,
int mode)
317 int16_t **dc_val_ptr,
int *dir_ptr)
321 static const uint16_t dcpred[32] = {
322 -1, 1024, 512, 341, 256, 205, 171, 146, 128,
323 114, 102, 93, 85, 79, 73, 68, 64,
324 60, 57, 54, 51, 49, 47, 45, 43,
325 41, 39, 38, 37, 35, 34, 33
339 b = dc_val[ - 1 -
wrap];
342 if (pq < 9 || !overlap) {
345 b = a = dcpred[scale];
346 if (s->
mb_x == 0 && (n != 1 && n != 3))
347 b = c = dcpred[scale];
352 if (s->
mb_x == 0 && (n != 1 && n != 3))
356 if (abs(a - b) <= abs(b - c)) {
365 *dc_val_ptr = &dc_val[0];
382 int a_avail,
int c_avail,
383 int16_t **dc_val_ptr,
int *dir_ptr)
394 if (dqscale_index < 0)
404 b = dc_val[ - 1 -
wrap];
407 if (c_avail && (n != 1 && n != 3)) {
412 if (a_avail && (n != 2 && n != 3)) {
417 if (a_avail && c_avail && (n != 3)) {
428 if (c_avail && (!a_avail || abs(a - b) <= abs(b - c))) {
431 }
else if (a_avail) {
440 *dc_val_ptr = &dc_val[0];
489 int *
value,
int codingset)
539 *value = (level ^ -sign) + sign;
550 int coded,
int codingset)
557 int16_t *ac_val, *ac_val2;
571 const int m = (v->
pq == 1 || v->
pq == 2) ? 3 - v->
pq : 0;
572 if (dcdiff == 119 ) {
576 dcdiff = (dcdiff <<
m) +
get_bits(gb, m) - ((1 <<
m) - 1);
591 block[0] = dcdiff * scale;
606 int last = 0, skip,
value;
623 block[zz_table[i++]] =
value;
635 for (k = 1; k < 8; k++)
636 block[k << sh] += ac_val[k];
639 for (k = 1; k < 8; k++) {
645 for (k = 1; k < 64; k++)
649 block[k] += (block[k] < 0) ? -v->
pq : v->
pq;
655 memset(ac_val2, 0, 16 * 2);
667 memcpy(ac_val2, ac_val, 8 * 2);
668 for (k = 1; k < 8; k++) {
669 block[k << sh] = ac_val[k] * scale;
671 block[k << sh] += (block[k << sh] < 0) ? -v->
pq : v->
pq;
690 int coded,
int codingset,
int mquant)
696 int16_t *dc_val =
NULL;
697 int16_t *ac_val, *ac_val2;
716 const int m = (mquant == 1 || mquant == 2) ? 3 - mquant : 0;
717 if (dcdiff == 119 ) {
721 dcdiff = (dcdiff <<
m) +
get_bits(gb, m) - ((1 <<
m) - 1);
736 block[0] = dcdiff * scale;
739 if (!a_avail && !c_avail)
742 scale = mquant * 2 + ((mquant == v->
pq) ? v->
halfpq : 0);
754 else if (dc_pred_dir) {
757 else if (c_avail && mb_pos)
762 else if (a_avail && mb_pos >= s->
mb_stride)
770 int last = 0, skip,
value;
795 block[zz_table[i++]] =
value;
808 if (q2 && q1 != q2) {
809 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
812 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
813 for (k = 1; k < 8; k++)
814 block[k << sh] += (ac_val[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
816 for (k = 1; k < 8; k++)
817 block[k << sh] += ac_val[k];
821 for (k = 1; k < 8; k++) {
827 for (k = 1; k < 64; k++)
831 block[k] += (block[k] < 0) ? -mquant : mquant;
837 memset(ac_val2, 0, 16 * 2);
849 memcpy(ac_val2, ac_val, 8 * 2);
850 if (q2 && q1 != q2) {
851 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
852 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
855 for (k = 1; k < 8; k++)
856 ac_val2[k] = (ac_val2[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
858 for (k = 1; k < 8; k++) {
859 block[k << sh] = ac_val2[k] * scale;
861 block[k << sh] += (block[k << sh] < 0) ? -mquant : mquant;
865 if (use_pred) i = 63;
880 int coded,
int mquant,
int codingset)
886 int16_t *dc_val =
NULL;
887 int16_t *ac_val, *ac_val2;
898 mquant = av_clip_uintp2(mquant, 5);
915 const int m = (mquant == 1 || mquant == 2) ? 3 - mquant : 0;
916 if (dcdiff == 119 ) {
920 dcdiff = (dcdiff <<
m) +
get_bits(gb, m) - ((1 <<
m) - 1);
942 if (!a_avail) dc_pred_dir = 1;
943 if (!c_avail) dc_pred_dir = 0;
944 if (!a_avail && !c_avail) use_pred = 0;
948 scale = mquant * 2 + v->
halfpq;
956 if (dc_pred_dir && c_avail && mb_pos)
958 if (!dc_pred_dir && a_avail && mb_pos >= s->
mb_stride)
960 if ( dc_pred_dir && n == 1)
962 if (!dc_pred_dir && n == 2)
967 int last = 0, skip,
value;
992 if (q2 && q1 != q2) {
993 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
994 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
999 for (k = 1; k < 8; k++)
1002 for (k = 1; k < 8; k++)
1007 for (k = 1; k < 8; k++)
1010 for (k = 1; k < 8; k++)
1016 for (k = 1; k < 8; k++) {
1022 for (k = 1; k < 64; k++)
1026 block[k] += (block[k] < 0) ? -mquant : mquant;
1029 if (use_pred) i = 63;
1033 memset(ac_val2, 0, 16 * 2);
1036 memcpy(ac_val2, ac_val, 8 * 2);
1037 if (q2 && q1 != q2) {
1038 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
1039 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
1042 for (k = 1; k < 8; k++)
1043 ac_val2[k] = (ac_val2[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
1048 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
1049 if (q2 && q1 != q2) {
1050 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
1051 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
1054 for (k = 1; k < 8; k++)
1055 ac_val2[k + 8] = (ac_val2[k + 8] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
1063 for (k = 1; k < 8; k++) {
1069 for (k = 1; k < 8; k++) {
1070 block[k << v->
top_blk_sh] = ac_val2[k + 8] * scale;
1086 int mquant,
int ttmb,
int first_block,
1087 uint8_t *dst,
int linesize,
int skip_block,
1094 int scale, off, idx, last, skip,
value;
1095 int ttblk = ttmb & 7;
1107 && ((v->
ttmbf || (ttmb != -1 && (ttmb & 8) && !first_block))
1117 scale = 2 * mquant + ((v->
pq == mquant) ? v->
halfpq : 0);
1142 block[idx] = value * scale;
1144 block[idx] += (block[idx] < 0) ? -mquant : mquant;
1156 pat = ~subblkpat & 0xF;
1157 for (j = 0; j < 4; j++) {
1158 last = subblkpat & (1 << (3 - j));
1160 off = (j & 1) * 4 + (j & 2) * 16;
1170 block[idx + off] = value * scale;
1172 block[idx + off] += (block[idx + off] < 0) ? -mquant : mquant;
1174 if (!(subblkpat & (1 << (3 - j))) && !skip_block) {
1183 pat = ~((subblkpat & 2) * 6 + (subblkpat & 1) * 3) & 0xF;
1184 for (j = 0; j < 2; j++) {
1185 last = subblkpat & (1 << (1 - j));
1194 idx = v->
zz_8x4[i++] + off;
1197 block[idx] = value * scale;
1199 block[idx] += (block[idx] < 0) ? -mquant : mquant;
1201 if (!(subblkpat & (1 << (1 - j))) && !skip_block) {
1210 pat = ~(subblkpat * 5) & 0xF;
1211 for (j = 0; j < 2; j++) {
1212 last = subblkpat & (1 << (1 - j));
1221 idx = v->
zz_4x8[i++] + off;
1224 block[idx] = value * scale;
1226 block[idx] += (block[idx] < 0) ? -mquant : mquant;
1228 if (!(subblkpat & (1 << (1 - j))) && !skip_block) {
1238 *ttmb_out |= ttblk << (n * 4);
1256 int ttmb = v->
ttfrm;
1258 int mb_has_coeffs = 1;
1262 int first_block = 1;
1264 int skipped, fourmv;
1265 int block_cbp = 0, pat, block_tt = 0, block_intra = 0;
1290 if (s->
mb_intra && !mb_has_coeffs) {
1294 }
else if (mb_has_coeffs) {
1310 for (i = 0; i < 6; i++) {
1313 val = ((cbp >> (5 - i)) & 1);
1314 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
1321 if (i == 1 || i == 3 || s->
mb_x)
1330 for (j = 0; j < 64; j++)
1331 s->
block[i][j] <<= 1;
1333 s->
dest[dst_idx] + off,
1342 block_cbp |= 0xF << (i << 2);
1343 block_intra |= 1 << i;
1348 block_cbp |= pat << (i << 2);
1349 if (!v->
ttmbf && ttmb < 8)
1356 for (i = 0; i < 6; i++) {
1367 int intra_count = 0, coded_inter = 0;
1368 int is_intra[6], is_coded[6];
1371 for (i = 0; i < 6; i++) {
1372 val = ((cbp >> (5 - i)) & 1);
1387 is_coded[i] = mb_has_coeffs;
1390 is_intra[i] = (intra_count >= 3);
1397 coded_inter = !is_intra[i] & is_coded[i];
1401 if (!intra_count && !coded_inter)
1408 for (i = 0; i < 6; i++)
1421 if (!v->
ttmbf && coded_inter)
1423 for (i = 0; i < 6; i++) {
1425 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
1432 if (i == 1 || i == 3 || s->
mb_x)
1441 for (j = 0; j < 64; j++)
1442 s->
block[i][j] <<= 1;
1444 s->
dest[dst_idx] + off,
1453 block_cbp |= 0xF << (i << 2);
1454 block_intra |= 1 << i;
1455 }
else if (is_coded[i]) {
1457 first_block, s->
dest[dst_idx] + off,
1461 block_cbp |= pat << (i << 2);
1462 if (!v->
ttmbf && ttmb < 8)
1470 for (i = 0; i < 6; i++) {
1474 for (i = 0; i < 4; i++) {
1500 int ttmb = v->
ttfrm;
1502 int mb_has_coeffs = 1;
1505 int first_block = 1;
1507 int skipped, fourmv = 0, twomv = 0;
1508 int block_cbp = 0, pat, block_tt = 0;
1509 int idx_mbmode = 0, mvbp;
1510 int stride_y, fieldtx;
1554 for (i = 0; i < 4; i++) {
1572 for (i = 0; i < 6; i++) {
1577 val = ((cbp >> (5 - i)) & 1);
1580 if (i == 1 || i == 3 || s->
mb_x)
1589 off = (fieldtx) ? ((i & 1) * 8) + ((i & 2) >> 1) * s->
linesize : (i & 1) * 8 + 4 * (i & 2) * s->
linesize;
1595 s->
dest[dst_idx] + off,
1613 for (i = 0; i < 6; i++)
1620 for (i = 0; i < 4; i++) {
1622 if (mvbp & (8 >> i))
1657 if (!v->
ttmbf && cbp)
1659 for (i = 0; i < 6; i++) {
1662 val = ((cbp >> (5 - i)) & 1);
1664 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
1666 off = (i & 4) ? 0 : ((i & 1) * 8 + ((i > 1) * s->
linesize));
1669 first_block, s->
dest[dst_idx] + off,
1672 block_cbp |= pat << (i << 2);
1673 if (!v->
ttmbf && ttmb < 8)
1681 for (i = 0; i < 6; i++) {
1707 int ttmb = v->
ttfrm;
1709 int mb_has_coeffs = 1;
1712 int first_block = 1;
1715 int block_cbp = 0, pat, block_tt = 0;
1721 if (idx_mbmode <= 1) {
1733 mb_has_coeffs = idx_mbmode & 1;
1737 for (i = 0; i < 6; i++) {
1742 val = ((cbp >> (5 - i)) & 1);
1745 if (i == 1 || i == 3 || s->
mb_x)
1753 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
1755 s->
dest[dst_idx] + off,
1763 for (i = 0; i < 6; i++)
1765 if (idx_mbmode <= 5) {
1766 dmv_x = dmv_y = pred_flag = 0;
1767 if (idx_mbmode & 1) {
1772 mb_has_coeffs = !(idx_mbmode & 2);
1775 for (i = 0; i < 4; i++) {
1776 dmv_x = dmv_y = pred_flag = 0;
1783 mb_has_coeffs = idx_mbmode & 1;
1791 if (!v->
ttmbf && cbp) {
1795 for (i = 0; i < 6; i++) {
1798 val = ((cbp >> (5 - i)) & 1);
1799 off = (i & 4) ? 0 : (i & 1) * 8 + (i & 2) * 4 * s->
linesize;
1802 first_block, s->
dest[dst_idx] + off,
1806 block_cbp |= pat << (i << 2);
1807 if (!v->
ttmbf && ttmb < 8)
1828 int ttmb = v->
ttfrm;
1829 int mb_has_coeffs = 0;
1832 int first_block = 1;
1834 int skipped, direct;
1835 int dmv_x[2], dmv_y[2];
1850 dmv_x[0] = dmv_x[1] = dmv_y[0] = dmv_y[1] = 0;
1851 for (i = 0; i < 6; i++) {
1860 dmv_x[1] = dmv_x[0];
1861 dmv_y[1] = dmv_y[0];
1874 dmv_x[0] = dmv_y[0] = 0;
1878 for (i = 0; i < 6; i++)
1885 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
1895 dmv_x[0] = dmv_y[0] = dmv_x[1] = dmv_y[1] = 0;
1897 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
1899 if (!mb_has_coeffs && !s->
mb_intra) {
1902 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
1905 if (s->
mb_intra && !mb_has_coeffs) {
1914 if (!mb_has_coeffs) {
1917 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
1923 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
1935 for (i = 0; i < 6; i++) {
1938 val = ((cbp >> (5 - i)) & 1);
1939 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
1946 if (i == 1 || i == 3 || s->
mb_x)
1955 for (j = 0; j < 64; j++)
1956 s->
block[i][j] <<= 1;
1958 s->
dest[dst_idx] + off,
1963 first_block, s->
dest[dst_idx] + off,
1966 if (!v->
ttmbf && ttmb < 8)
1983 int ttmb = v->
ttfrm;
1984 int mb_has_coeffs = 0;
1986 int first_block = 1;
1989 int dmv_x[2], dmv_y[2], pred_flag[2];
1997 if (idx_mbmode <= 1) {
2009 mb_has_coeffs = idx_mbmode & 1;
2013 for (i = 0; i < 6; i++) {
2018 val = ((cbp >> (5 - i)) & 1);
2021 if (i == 1 || i == 3 || s->
mb_x)
2030 for (j = 0; j < 64; j++)
2031 s->
block[i][j] <<= 1;
2032 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
2034 s->
dest[dst_idx] + off,
2042 for (i = 0; i < 6; i++)
2048 if (idx_mbmode <= 5) {
2050 dmv_x[0] = dmv_x[1] = dmv_y[0] = dmv_y[1] = 0;
2051 pred_flag[0] = pred_flag[1] = 0;
2076 dmv_x[0] = dmv_y[0] = pred_flag[0] = 0;
2077 dmv_x[1] = dmv_y[1] = pred_flag[0] = 0;
2085 mb_has_coeffs = !(idx_mbmode & 2);
2091 for (i = 0; i < 4; i++) {
2092 dmv_x[0] = dmv_y[0] = pred_flag[0] = 0;
2093 dmv_x[1] = dmv_y[1] = pred_flag[1] = 0;
2103 mb_has_coeffs = idx_mbmode & 1;
2111 if (!v->
ttmbf && cbp) {
2115 for (i = 0; i < 6; i++) {
2118 val = ((cbp >> (5 - i)) & 1);
2119 off = (i & 4) ? 0 : (i & 1) * 8 + (i & 2) * 4 * s->
linesize;
2122 first_block, s->
dest[dst_idx] + off,
2125 if (!v->
ttmbf && ttmb < 8)
2143 int ttmb = v->
ttfrm;
2145 int mb_has_coeffs = 1;
2148 int first_block = 1;
2150 int skipped, direct, twomv = 0;
2151 int block_cbp = 0, pat, block_tt = 0;
2152 int idx_mbmode = 0, mvbp;
2153 int stride_y, fieldtx;
2199 for (i = 1; i < 4; i += 2) {
2206 for (i = 1; i < 4; i++) {
2216 for (i = 0; i < 4; i++) {
2236 for (i = 0; i < 6; i++) {
2241 val = ((cbp >> (5 - i)) & 1);
2244 if (i == 1 || i == 3 || s->
mb_x)
2254 off = (fieldtx) ? ((i & 1) * 8) + ((i & 2) >> 1) * s->
linesize : (i & 1) * 8 + 4 * (i & 2) * s->
linesize;
2260 s->
dest[dst_idx] + off,
2296 for (i = 0; i < 6; i++)
2303 for (i = 0; i < 4; i++) {
2315 for (i = 0; i < 4; i++) {
2318 val = ((mvbp >> (3 - i)) & 1);
2361 for (i = 0; i < 2; i++) {
2391 for (i = 0; i < 2; i++) {
2401 if (!v->
ttmbf && cbp)
2403 for (i = 0; i < 6; i++) {
2406 val = ((cbp >> (5 - i)) & 1);
2408 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
2410 off = (i & 4) ? 0 : ((i & 1) * 8 + ((i > 1) * s->
linesize));
2413 first_block, s->
dest[dst_idx] + off,
2416 block_cbp |= pat << (i << 2);
2417 if (!v->
ttmbf && ttmb < 8)
2425 for (i = 0; i < 6; i++) {
2447 for (i = 0; i < 2; i++) {
2459 for (i = 0; i < 2; i++) {
2529 dst[0] = s->
dest[0];
2530 dst[1] = dst[0] + 8;
2532 dst[3] = dst[2] + 8;
2533 dst[4] = s->
dest[1];
2534 dst[5] = s->
dest[2];
2546 for (k = 0; k < 6; k++) {
2547 val = ((cbp >> (5 - k)) & 1);
2554 cbp |= val << (5 - k);
2563 for (j = 0; j < 64; j++)
2564 s->
block[k][j] <<= 1;
2570 for (j = 0; j < 64; j++)
2705 for (k = 0; k < 6; k++) {
2706 val = ((cbp >> (5 - k)) & 1);
2713 cbp |= val << (5 - k);
2824 if (apply_loop_filter) {