46 #define MB_INTRA_VLC_BITS 9
52 0, 520, 552, 616, 1128, 1160, 1224, 1740, 1772, 1836, 1900, 2436,
53 2986, 3050, 3610, 4154, 4218, 4746, 5326, 5390, 5902, 6554, 7658, 8342,
54 9304, 9988, 10630, 11234, 12174, 13006, 13560, 14232, 14786, 15432, 16350, 17522,
55 20372, 21818, 22330, 22394, 23166, 23678, 23742, 24820, 25332, 25396, 26460, 26980,
56 27048, 27592, 27600, 27608, 27616, 27624, 28224, 28258, 28290, 28802, 28834, 28866,
57 29378, 29412, 29444, 29960, 29994, 30026, 30538, 30572, 30604, 31120, 31154, 31186,
58 31714, 31746, 31778, 32306, 32340, 32372
63 static const int offset_table2[9] = { 0, 1, 3, 7, 15, 31, 63, 127, 255 };
92 for (i = 0; i < 3; i++) {
109 for (i = 0; i < 4; i++) {
126 for (i = 0; i < 8; i++) {
139 for (i = 0; i < 4; i++) {
159 for (i = 0; i < 4; i++) {
167 for (i = 0; i < 8; i++) {
224 int topleft_mb_pos, top_mb_pos;
225 int stride_y, fieldtx;
240 v_dist = (16 - fieldtx) >> (fieldtx == 0);
264 v_dist = fieldtx ? 15 : 8;
286 #define inc_blk_idx(idx) do { \
288 if (idx >= v->n_allocated_blks) \
307 for (j = 0; j < 2; j++) {
340 for (j = 0; j < 2; j++) {
357 for (j = 0; j < 2; j++) {
373 for (j = 0; j < 2; j++) {
384 for (j = 0; j < 2; j++) {
477 uint8_t *srcY, *srcU, *srcV;
478 int dxy, mx, my, uvmx, uvmy, src_x, src_y, uvsrc_x, uvsrc_y;
487 mx = s->
mv[dir][0][0];
488 my = s->
mv[dir][0][1];
496 uvmx = (mx + ((mx & 3) == 3)) >> 1;
497 uvmy = (my + ((my & 3) == 3)) >> 1;
509 uvmx = uvmx + ((uvmx < 0) ? (uvmx & 1) : -(uvmx & 1));
510 uvmy = uvmy + ((uvmy < 0) ? (uvmy & 1) : -(uvmy & 1));
540 src_x = s->
mb_x * 16 + (mx >> 2);
541 src_y = s->
mb_y * 16 + (my >> 2);
542 uvsrc_x = s->
mb_x * 8 + (uvmx >> 2);
543 uvsrc_y = s->
mb_y * 8 + (uvmy >> 2);
546 src_x = av_clip( src_x, -16, s->
mb_width * 16);
547 src_y = av_clip( src_y, -16, s->
mb_height * 16);
548 uvsrc_x = av_clip(uvsrc_x, -8, s->
mb_width * 8);
549 uvsrc_y = av_clip(uvsrc_y, -8, s->
mb_height * 8);
557 srcY += src_y * s->
linesize + src_x;
576 || (
unsigned)(src_y - s->
mspel) > v_edge_pos - (my&3) - 16 - s->
mspel * 3) {
586 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
588 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
597 for (j = 0; j < 17 + s->
mspel * 2; j++) {
598 for (i = 0; i < 17 + s->
mspel * 2; i++)
599 src[i] = ((src[i] - 128) >> 1) + 128;
604 for (j = 0; j < 9; j++) {
605 for (i = 0; i < 9; i++) {
606 src[i] = ((src[i] - 128) >> 1) + 128;
607 src2[i] = ((src2[i] - 128) >> 1) + 128;
619 for (j = 0; j < 17 + s->
mspel * 2; j++) {
620 for (i = 0; i < 17 + s->
mspel * 2; i++)
621 src[i] = v->
luty[src[i]];
626 for (j = 0; j < 9; j++) {
627 for (i = 0; i < 9; i++) {
628 src[i] = v->
lutuv[src[i]];
629 src2[i] = v->
lutuv[src2[i]];
646 dxy = ((my & 3) << 2) | (mx & 3);
653 dxy = (my & 2) | ((mx & 2) >> 1);
662 uvmx = (uvmx & 3) << 1;
663 uvmy = (uvmy & 3) << 1;
673 static inline int median4(
int a,
int b,
int c,
int d)
676 if (c < d)
return (
FFMIN(b, d) +
FFMAX(a, c)) / 2;
679 if (c < d)
return (
FFMIN(a, d) +
FFMAX(b, c)) / 2;
691 int dxy, mx, my, src_x, src_y;
701 mx = s->
mv[dir][n][0];
702 my = s->
mv[dir][n][1];
721 int same_count = 0, opp_count = 0, k;
722 int chosen_mv[2][4][2],
f;
724 for (k = 0; k < 4; k++) {
726 chosen_mv[
f][f ? opp_count : same_count][0] = s->
mv[0][k][0];
727 chosen_mv[
f][f ? opp_count : same_count][1] = s->
mv[0][k][1];
731 f = opp_count > same_count;
732 switch (f ? opp_count : same_count) {
734 tx =
median4(chosen_mv[f][0][0], chosen_mv[f][1][0],
735 chosen_mv[f][2][0], chosen_mv[f][3][0]);
736 ty =
median4(chosen_mv[f][0][1], chosen_mv[f][1][1],
737 chosen_mv[f][2][1], chosen_mv[f][3][1]);
740 tx =
mid_pred(chosen_mv[f][0][0], chosen_mv[f][1][0], chosen_mv[f][2][0]);
741 ty =
mid_pred(chosen_mv[f][0][1], chosen_mv[f][1][1], chosen_mv[f][2][1]);
744 tx = (chosen_mv[
f][0][0] + chosen_mv[
f][1][0]) / 2;
745 ty = (chosen_mv[
f][0][1] + chosen_mv[
f][1][1]) / 2;
750 for (k = 0; k < 4; k++)
758 qx = (s->
mb_x * 16) + (mx >> 2);
759 qy = (s->
mb_y * 8) + (my >> 3);
764 mx -= 4 * (qx -
width);
767 else if (qy > height + 1)
768 my -= 8 * (qy - height - 1);
772 off = ((n > 1) ? s->
linesize : 0) + (n & 1) * 8;
774 off = s->
linesize * 4 * (n & 2) + (n & 1) * 8;
778 src_x = s->
mb_x * 16 + (n & 1) * 8 + (mx >> 2);
780 src_y = s->
mb_y * 16 + (n & 2) * 4 + (my >> 2);
782 src_y = s->
mb_y * 16 + ((n > 1) ? 1 : 0) + (my >> 2);
785 src_x = av_clip(src_x, -16, s->
mb_width * 16);
786 src_y = av_clip(src_y, -16, s->
mb_height * 16);
799 srcY += src_y * s->
linesize + src_x;
803 if (fieldmv && !(src_y & 1))
805 if (fieldmv && (src_y & 1) && src_y < 4)
810 || (
unsigned)(src_y - (s->
mspel << fieldmv)) > v_edge_pos - (my & 3) - ((8 + s->
mspel * 2) << fieldmv)) {
814 9 + s->
mspel * 2, (9 + s->
mspel * 2) << fieldmv,
815 src_x - s->
mspel, src_y - (s->
mspel << fieldmv),
824 for (j = 0; j < 9 + s->
mspel * 2; j++) {
825 for (i = 0; i < 9 + s->
mspel * 2; i++)
826 src[i] = ((src[i] - 128) >> 1) + 128;
836 for (j = 0; j < 9 + s->
mspel * 2; j++) {
837 for (i = 0; i < 9 + s->
mspel * 2; i++)
838 src[i] = v->
luty[src[i]];
846 dxy = ((my & 3) << 2) | (mx & 3);
849 dxy = (my & 2) | ((mx & 2) >> 1);
860 static const int count[16] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4};
862 idx = ((a[3] != flag) << 3)
863 | ((a[2] != flag) << 2)
864 | ((a[1] != flag) << 1)
867 *tx =
median4(mvx[0], mvx[1], mvx[2], mvx[3]);
868 *ty =
median4(mvy[0], mvy[1], mvy[2], mvy[3]);
870 }
else if (count[idx] == 1) {
873 *tx =
mid_pred(mvx[1], mvx[2], mvx[3]);
874 *ty =
mid_pred(mvy[1], mvy[2], mvy[3]);
877 *tx =
mid_pred(mvx[0], mvx[2], mvx[3]);
878 *ty =
mid_pred(mvy[0], mvy[2], mvy[3]);
881 *tx =
mid_pred(mvx[0], mvx[1], mvx[3]);
882 *ty =
mid_pred(mvy[0], mvy[1], mvy[3]);
885 *tx =
mid_pred(mvx[0], mvx[1], mvx[2]);
886 *ty =
mid_pred(mvy[0], mvy[1], mvy[2]);
889 }
else if (count[idx] == 2) {
891 for (i = 0; i < 3; i++)
896 for (i = t1 + 1; i < 4; i++)
901 *tx = (mvx[
t1] + mvx[
t2]) / 2;
902 *ty = (mvy[
t1] + mvy[
t2]) / 2;
916 uint8_t *srcU, *srcV;
917 int uvmx, uvmy, uvsrc_x, uvsrc_y;
918 int k, tx = 0, ty = 0;
919 int mvx[4], mvy[4], intra[4], mv_f[4];
929 for (k = 0; k < 4; k++) {
930 mvx[k] = s->
mv[dir][k][0];
931 mvy[k] = s->
mv[dir][k][1];
948 if (mv_f[0] + mv_f[1] + mv_f[2] + mv_f[3] > 2)
950 valid_count =
get_chroma_mv(mvx, mvy, mv_f, dominant, &tx, &ty);
958 uvmx = (tx + ((tx & 3) == 3)) >> 1;
959 uvmy = (ty + ((ty & 3) == 3)) >> 1;
965 uvmx = uvmx + ((uvmx < 0) ? (uvmx & 1) : -(uvmx & 1));
966 uvmy = uvmy + ((uvmy < 0) ? (uvmy & 1) : -(uvmy & 1));
970 uvmy += 2 - 4 * chroma_ref_type;
972 uvsrc_x = s->
mb_x * 8 + (uvmx >> 2);
973 uvsrc_y = s->
mb_y * 8 + (uvmy >> 2);
976 uvsrc_x = av_clip(uvsrc_x, -8, s->
mb_width * 8);
977 uvsrc_y = av_clip(uvsrc_y, -8, s->
mb_height * 8);
1002 if (chroma_ref_type) {
1011 || (
unsigned)uvsrc_x > (s->
h_edge_pos >> 1) - 9
1012 || (
unsigned)uvsrc_y > (v_edge_pos >> 1) - 9) {
1014 8 + 1, 8 + 1, uvsrc_x, uvsrc_y,
1017 8 + 1, 8 + 1, uvsrc_x, uvsrc_y,
1025 uint8_t *src, *src2;
1029 for (j = 0; j < 9; j++) {
1030 for (i = 0; i < 9; i++) {
1031 src[i] = ((src[i] - 128) >> 1) + 128;
1032 src2[i] = ((src2[i] - 128) >> 1) + 128;
1041 uint8_t *src, *src2;
1045 for (j = 0; j < 9; j++) {
1046 for (i = 0; i < 9; i++) {
1047 src[i] = v->
lutuv[src[i]];
1048 src2[i] = v->
lutuv[src2[i]];
1057 uvmx = (uvmx & 3) << 1;
1058 uvmy = (uvmy & 3) << 1;
1074 uint8_t *srcU, *srcV;
1075 int uvsrc_x, uvsrc_y;
1076 int uvmx_field[4], uvmy_field[4];
1079 static const int s_rndtblfield[16] = { 0, 0, 1, 2, 4, 4, 5, 6, 2, 2, 3, 8, 6, 6, 7, 12 };
1080 int v_dist = fieldmv ? 1 : 4;
1088 for (i = 0; i < 4; i++) {
1089 tx = s->
mv[0][i][0];
1090 uvmx_field[i] = (tx + ((tx & 3) == 3)) >> 1;
1091 ty = s->
mv[0][i][1];
1093 uvmy_field[i] = (ty >> 4) * 8 + s_rndtblfield[ty & 0xF];
1095 uvmy_field[i] = (ty + ((ty & 3) == 3)) >> 1;
1098 for (i = 0; i < 4; i++) {
1099 off = (i & 1) * 4 + ((i & 2) ? v_dist * s->
uvlinesize : 0);
1100 uvsrc_x = s->
mb_x * 8 + (i & 1) * 4 + (uvmx_field[i] >> 2);
1101 uvsrc_y = s->
mb_y * 8 + ((i & 2) ? v_dist : 0) + (uvmy_field[i] >> 2);
1107 uvmx_field[i] = (uvmx_field[i] & 3) << 1;
1108 uvmy_field[i] = (uvmy_field[i] & 3) << 1;
1110 if (fieldmv && !(uvsrc_y & 1))
1112 if (fieldmv && (uvsrc_y & 1) && uvsrc_y < 2)
1115 || s->
h_edge_pos < 10 || v_edge_pos < (5 << fieldmv)
1116 || (
unsigned)uvsrc_x > (s->
h_edge_pos >> 1) - 5
1117 || (
unsigned)uvsrc_y > v_edge_pos - (5 << fieldmv)) {
1119 5, (5 << fieldmv), uvsrc_x, uvsrc_y,
1122 5, (5 << fieldmv), uvsrc_x, uvsrc_y,
1130 uint8_t *src, *src2;
1134 for (j = 0; j < 5; j++) {
1135 for (i = 0; i < 5; i++) {
1136 src[i] = v->
lutuv[src[i]];
1137 src2[i] = v->
lutuv[src2[i]];
1165 #define GET_MQUANT() \
1166 if (v->dquantfrm) { \
1168 if (v->dqprofile == DQPROFILE_ALL_MBS) { \
1169 if (v->dqbilevel) { \
1170 mquant = (get_bits1(gb)) ? v->altpq : v->pq; \
1172 mqdiff = get_bits(gb, 3); \
1174 mquant = v->pq + mqdiff; \
1176 mquant = get_bits(gb, 5); \
1179 if (v->dqprofile == DQPROFILE_SINGLE_EDGE) \
1180 edges = 1 << v->dqsbedge; \
1181 else if (v->dqprofile == DQPROFILE_DOUBLE_EDGES) \
1182 edges = (3 << v->dqsbedge) % 15; \
1183 else if (v->dqprofile == DQPROFILE_FOUR_EDGES) \
1185 if ((edges&1) && !s->mb_x) \
1186 mquant = v->altpq; \
1187 if ((edges&2) && s->first_slice_line) \
1188 mquant = v->altpq; \
1189 if ((edges&4) && s->mb_x == (s->mb_width - 1)) \
1190 mquant = v->altpq; \
1191 if ((edges&8) && s->mb_y == (s->mb_height - 1)) \
1192 mquant = v->altpq; \
1202 #define GET_MVDATA(_dmv_x, _dmv_y) \
1203 index = 1 + get_vlc2(gb, ff_vc1_mv_diff_vlc[s->mv_table_index].table, \
1204 VC1_MV_DIFF_VLC_BITS, 2); \
1206 mb_has_coeffs = 1; \
1209 mb_has_coeffs = 0; \
1212 _dmv_x = _dmv_y = 0; \
1213 } else if (index == 35) { \
1214 _dmv_x = get_bits(gb, v->k_x - 1 + s->quarter_sample); \
1215 _dmv_y = get_bits(gb, v->k_y - 1 + s->quarter_sample); \
1216 } else if (index == 36) { \
1221 index1 = index % 6; \
1222 if (!s->quarter_sample && index1 == 5) val = 1; \
1224 if (size_table[index1] - val > 0) \
1225 val = get_bits(gb, size_table[index1] - val); \
1227 sign = 0 - (val&1); \
1228 _dmv_x = (sign ^ ((val>>1) + offset_table[index1])) - sign; \
1230 index1 = index / 6; \
1231 if (!s->quarter_sample && index1 == 5) val = 1; \
1233 if (size_table[index1] - val > 0) \
1234 val = get_bits(gb, size_table[index1] - val); \
1236 sign = 0 - (val & 1); \
1237 _dmv_y = (sign ^ ((val >> 1) + offset_table[index1])) - sign; \
1241 int *dmv_y,
int *pred_flag)
1244 int extend_x = 0, extend_y = 0;
1248 const int* offs_tab;
1265 extend_x = extend_y = 1;
1273 *pred_flag = *dmv_y & 1;
1274 *dmv_y = (*dmv_y + *pred_flag) >> 1;
1282 index1 = (index + 1) % 9;
1284 val =
get_bits(gb, index1 + extend_x);
1285 sign = 0 -(val & 1);
1286 *dmv_x = (sign ^ ((val >> 1) + offs_tab[index1])) - sign;
1293 index1 = (index + 1) / 9;
1294 if (index1 > v->
numref) {
1296 sign = 0 - (val & 1);
1297 *dmv_y = (sign ^ ((val >> 1) + offs_tab[index1 >> v->
numref])) - sign;
1301 *pred_flag = index1 & 1;
1307 int scaledvalue, refdist;
1308 int scalesame1, scalesame2;
1309 int scalezone1_x, zone1offset_x;
1326 if (
FFABS(n) < scalezone1_x)
1327 scaledvalue = (n * scalesame1) >> 8;
1330 scaledvalue = ((n * scalesame2) >> 8) - zone1offset_x;
1332 scaledvalue = ((n * scalesame2) >> 8) + zone1offset_x;
1340 int scaledvalue, refdist;
1341 int scalesame1, scalesame2;
1342 int scalezone1_y, zone1offset_y;
1359 if (
FFABS(n) < scalezone1_y)
1360 scaledvalue = (n * scalesame1) >> 8;
1363 scaledvalue = ((n * scalesame2) >> 8) - zone1offset_y;
1365 scaledvalue = ((n * scalesame2) >> 8) + zone1offset_y;
1370 return av_clip(scaledvalue, -v->
range_y / 2 + 1, v->
range_y / 2);
1372 return av_clip(scaledvalue, -v->
range_y / 2, v->
range_y / 2 - 1);
1377 int scalezone1_x, zone1offset_x;
1378 int scaleopp1, scaleopp2, brfd;
1390 if (
FFABS(n) < scalezone1_x)
1391 scaledvalue = (n * scaleopp1) >> 8;
1394 scaledvalue = ((n * scaleopp2) >> 8) - zone1offset_x;
1396 scaledvalue = ((n * scaleopp2) >> 8) + zone1offset_x;
1404 int scalezone1_y, zone1offset_y;
1405 int scaleopp1, scaleopp2, brfd;
1417 if (
FFABS(n) < scalezone1_y)
1418 scaledvalue = (n * scaleopp1) >> 8;
1421 scaledvalue = ((n * scaleopp2) >> 8) - zone1offset_y;
1423 scaledvalue = ((n * scaleopp2) >> 8) + zone1offset_y;
1427 return av_clip(scaledvalue, -v->
range_y / 2 + 1, v->
range_y / 2);
1429 return av_clip(scaledvalue, -v->
range_y / 2, v->
range_y / 2 - 1);
1436 int brfd, scalesame;
1450 n = (n * scalesame >> 8) << hpel;
1457 int refdist, scaleopp;
1474 n = (n * scaleopp >> 8) << hpel;
1481 int mv1,
int r_x,
int r_y, uint8_t* is_intra,
1482 int pred_flag,
int dir)
1489 int mixedmv_pic, num_samefield = 0, num_oppfield = 0;
1490 int opposit, a_f, b_f, c_f;
1491 int16_t field_predA[2];
1492 int16_t field_predB[2];
1493 int16_t field_predC[2];
1494 int a_valid, b_valid, c_valid;
1495 int hybridmv_thresh, y_bias = 0;
1543 off = (s->
mb_x > 0) ? -1 : 1;
1558 b_valid = a_valid && (s->
mb_width > 1);
1559 c_valid = s->
mb_x || (n == 1 || n == 3);
1561 a_valid = a_valid && !is_intra[xy -
wrap];
1562 b_valid = b_valid && !is_intra[xy - wrap +
off];
1563 c_valid = c_valid && !is_intra[xy - 1];
1568 num_oppfield += a_f;
1569 num_samefield += 1 - a_f;
1570 field_predA[0] = A[0];
1571 field_predA[1] = A[1];
1573 field_predA[0] = field_predA[1] = 0;
1578 num_oppfield += b_f;
1579 num_samefield += 1 - b_f;
1580 field_predB[0] = B[0];
1581 field_predB[1] = B[1];
1583 field_predB[0] = field_predB[1] = 0;
1588 num_oppfield += c_f;
1589 num_samefield += 1 - c_f;
1590 field_predC[0] = C[0];
1591 field_predC[1] = C[1];
1593 field_predC[0] = field_predC[1] = 0;
1598 if (num_samefield <= num_oppfield)
1599 opposit = 1 - pred_flag;
1601 opposit = pred_flag;
1605 if (a_valid && !a_f) {
1606 field_predA[0] =
scaleforopp(v, field_predA[0], 0, dir);
1607 field_predA[1] =
scaleforopp(v, field_predA[1], 1, dir);
1609 if (b_valid && !b_f) {
1610 field_predB[0] =
scaleforopp(v, field_predB[0], 0, dir);
1611 field_predB[1] =
scaleforopp(v, field_predB[1], 1, dir);
1613 if (c_valid && !c_f) {
1614 field_predC[0] =
scaleforopp(v, field_predC[0], 0, dir);
1615 field_predC[1] =
scaleforopp(v, field_predC[1], 1, dir);
1620 if (a_valid && a_f) {
1621 field_predA[0] =
scaleforsame(v, n, field_predA[0], 0, dir);
1622 field_predA[1] =
scaleforsame(v, n, field_predA[1], 1, dir);
1624 if (b_valid && b_f) {
1625 field_predB[0] =
scaleforsame(v, n, field_predB[0], 0, dir);
1626 field_predB[1] =
scaleforsame(v, n, field_predB[1], 1, dir);
1628 if (c_valid && c_f) {
1629 field_predC[0] =
scaleforsame(v, n, field_predC[0], 0, dir);
1630 field_predC[1] =
scaleforsame(v, n, field_predC[1], 1, dir);
1637 px = field_predA[0];
1638 py = field_predA[1];
1639 }
else if (c_valid) {
1640 px = field_predC[0];
1641 py = field_predC[1];
1642 }
else if (b_valid) {
1643 px = field_predB[0];
1644 py = field_predB[1];
1650 if (num_samefield + num_oppfield > 1) {
1651 px =
mid_pred(field_predA[0], field_predB[0], field_predC[0]);
1652 py =
mid_pred(field_predA[1], field_predB[1], field_predC[1]);
1658 qx = (s->
mb_x << 6) + ((n == 1 || n == 3) ? 32 : 0);
1659 qy = (s->
mb_y << 6) + ((n == 2 || n == 3) ? 32 : 0);
1663 if (qx + px < -60) px = -60 - qx;
1664 if (qy + py < -60) py = -60 - qy;
1666 if (qx + px < -28) px = -28 - qx;
1667 if (qy + py < -28) py = -28 - qy;
1669 if (qx + px > X) px = X - qx;
1670 if (qy + py > Y) py = Y - qy;
1675 hybridmv_thresh = 32;
1676 if (a_valid && c_valid) {
1677 if (is_intra[xy - wrap])
1680 sum =
FFABS(px - field_predA[0]) +
FFABS(py - field_predA[1]);
1681 if (sum > hybridmv_thresh) {
1683 px = field_predA[0];
1684 py = field_predA[1];
1686 px = field_predC[0];
1687 py = field_predC[1];
1690 if (is_intra[xy - 1])
1693 sum =
FFABS(px - field_predC[0]) +
FFABS(py - field_predC[1]);
1694 if (sum > hybridmv_thresh) {
1696 px = field_predA[0];
1697 py = field_predA[1];
1699 px = field_predC[0];
1700 py = field_predC[1];
1733 int mvn,
int r_x,
int r_y, uint8_t* is_intra)
1737 int A[2],
B[2], C[2];
1739 int a_valid = 0, b_valid = 0, c_valid = 0;
1740 int field_a, field_b, field_c;
1741 int total_valid, num_samefield, num_oppfield;
1742 int pos_c, pos_b, n_adj;
1770 off = ((n == 0) || (n == 1)) ? 1 : -1;
1772 if (s->
mb_x || (n == 1) || (n == 3)) {
1792 B[0] = B[1] = C[0] = C[1] = 0;
1800 n_adj = (n & 2) | (n & 1);
1854 total_valid = a_valid + b_valid + c_valid;
1856 if (!s->
mb_x && !(n == 1 || n == 3)) {
1861 B[0] = B[1] = C[0] = C[1] = 0;
1868 if (total_valid >= 2) {
1871 }
else if (total_valid) {
1872 if (a_valid) { px = A[0]; py = A[1]; }
1873 if (b_valid) { px = B[0]; py = B[1]; }
1874 if (c_valid) { px = C[0]; py = C[1]; }
1880 field_a = (A[1] & 4) ? 1 : 0;
1884 field_b = (B[1] & 4) ? 1 : 0;
1888 field_c = (C[1] & 4) ? 1 : 0;
1892 num_oppfield = field_a + field_b + field_c;
1893 num_samefield = total_valid - num_oppfield;
1894 if (total_valid == 3) {
1895 if ((num_samefield == 3) || (num_oppfield == 3)) {
1898 }
else if (num_samefield >= num_oppfield) {
1901 px = !field_a ? A[0] : B[0];
1902 py = !field_a ? A[1] : B[1];
1904 px = field_a ? A[0] : B[0];
1905 py = field_a ? A[1] : B[1];
1907 }
else if (total_valid == 2) {
1908 if (num_samefield >= num_oppfield) {
1909 if (!field_a && a_valid) {
1912 }
else if (!field_b && b_valid) {
1915 }
else if (c_valid) {
1920 if (field_a && a_valid) {
1923 }
else if (field_b && b_valid) {
1926 }
else if (c_valid) {
1931 }
else if (total_valid == 1) {
1932 px = (a_valid) ? A[0] : ((b_valid) ? B[0] : C[0]);
1933 py = (a_valid) ? A[1] : ((b_valid) ? B[1] : C[1]);
1948 }
else if (mvn == 2) {
1951 s->
mv[0][n + 1][0] = s->
mv[0][n][0];
1952 s->
mv[0][n + 1][1] = s->
mv[0][n][1];
1962 uint8_t *srcY, *srcU, *srcV;
1963 int dxy, mx, my, uvmx, uvmy, src_x, src_y, uvsrc_x, uvsrc_y;
1970 mx = s->
mv[1][0][0];
1971 my = s->
mv[1][0][1];
1972 uvmx = (mx + ((mx & 3) == 3)) >> 1;
1973 uvmy = (my + ((my & 3) == 3)) >> 1;
1980 uvmx = uvmx + ((uvmx < 0) ? -(uvmx & 1) : (uvmx & 1));
1981 uvmy = uvmy + ((uvmy < 0) ? -(uvmy & 1) : (uvmy & 1));
1987 src_x = s->
mb_x * 16 + (mx >> 2);
1988 src_y = s->
mb_y * 16 + (my >> 2);
1989 uvsrc_x = s->
mb_x * 8 + (uvmx >> 2);
1990 uvsrc_y = s->
mb_y * 8 + (uvmy >> 2);
1993 src_x = av_clip( src_x, -16, s->
mb_width * 16);
1994 src_y = av_clip( src_y, -16, s->
mb_height * 16);
1995 uvsrc_x = av_clip(uvsrc_x, -8, s->
mb_width * 8);
1996 uvsrc_y = av_clip(uvsrc_y, -8, s->
mb_height * 8);
2004 srcY += src_y * s->
linesize + src_x;
2022 || (
unsigned)(src_y - s->
mspel) > v_edge_pos - (my & 3) - 16 - s->
mspel * 3) {
2032 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
2034 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
2040 uint8_t *src, *src2;
2043 for (j = 0; j < 17 + s->
mspel * 2; j++) {
2044 for (i = 0; i < 17 + s->
mspel * 2; i++)
2045 src[i] = ((src[i] - 128) >> 1) + 128;
2050 for (j = 0; j < 9; j++) {
2051 for (i = 0; i < 9; i++) {
2052 src[i] = ((src[i] - 128) >> 1) + 128;
2053 src2[i] = ((src2[i] - 128) >> 1) + 128;
2071 dxy = ((my & 3) << 2) | (mx & 3);
2078 dxy = (my & 2) | ((mx & 2) >> 1);
2088 uvmx = (uvmx & 3) << 1;
2089 uvmy = (uvmy & 3) << 1;
2103 #if B_FRACTION_DEN==256
2107 return 2 * ((value * n + 255) >> 9);
2108 return (value * n + 128) >> 8;
2119 int qs,
int qs_last)
2127 return (value * n + 255) >> 9;
2129 return (value * n + 128) >> 8;
2135 int direct,
int mode)
2164 int direct,
int mvtype)
2172 const uint8_t *is_intra = v->
mb_type[0];
2199 s->
mv[0][0][0] = av_clip(s->
mv[0][0][0], -60 - (s->
mb_x << 6), (s->
mb_width << 6) - 4 - (s->
mb_x << 6));
2200 s->
mv[0][0][1] = av_clip(s->
mv[0][0][1], -60 - (s->
mb_y << 6), (s->
mb_height << 6) - 4 - (s->
mb_y << 6));
2201 s->
mv[1][0][0] = av_clip(s->
mv[1][0][0], -60 - (s->
mb_x << 6), (s->
mb_width << 6) - 4 - (s->
mb_x << 6));
2202 s->
mv[1][0][1] = av_clip(s->
mv[1][0][1], -60 - (s->
mb_y << 6), (s->
mb_height << 6) - 4 - (s->
mb_y << 6));
2218 if (!s->
mb_x) C[0] = C[1] = 0;
2227 }
else if (s->
mb_x) {
2237 qx = (s->
mb_x << 5);
2238 qy = (s->
mb_y << 5);
2241 if (qx + px < -28) px = -28 - qx;
2242 if (qy + py < -28) py = -28 - qy;
2243 if (qx + px > X) px = X - qx;
2244 if (qy + py > Y) py = Y - qy;
2246 qx = (s->
mb_x << 6);
2247 qy = (s->
mb_y << 6);
2250 if (qx + px < -60) px = -60 - qx;
2251 if (qy + py < -60) py = -60 - qy;
2252 if (qx + px > X) px = X - qx;
2253 if (qy + py > Y) py = Y - qy;
2258 if (is_intra[xy - wrap])
2271 if (is_intra[xy - 2])
2287 s->
mv[0][0][0] = ((px + dmv_x[0] + r_x) & ((r_x << 1) - 1)) - r_x;
2288 s->
mv[0][0][1] = ((py + dmv_y[0] + r_y) & ((r_y << 1) - 1)) - r_y;
2306 }
else if (s->
mb_x) {
2316 qx = (s->
mb_x << 5);
2317 qy = (s->
mb_y << 5);
2320 if (qx + px < -28) px = -28 - qx;
2321 if (qy + py < -28) py = -28 - qy;
2322 if (qx + px > X) px = X - qx;
2323 if (qy + py > Y) py = Y - qy;
2325 qx = (s->
mb_x << 6);
2326 qy = (s->
mb_y << 6);
2329 if (qx + px < -60) px = -60 - qx;
2330 if (qy + py < -60) py = -60 - qy;
2331 if (qx + px > X) px = X - qx;
2332 if (qy + py > Y) py = Y - qy;
2337 if (is_intra[xy - wrap])
2350 if (is_intra[xy - 2])
2367 s->
mv[1][0][0] = ((px + dmv_x[1] + r_x) & ((r_x << 1) - 1)) - r_x;
2368 s->
mv[1][0][1] = ((py + dmv_y[1] + r_y) & ((r_y << 1) - 1)) - r_y;
2383 int total_opp, k,
f;
2398 f = (total_opp > 2) ? 1 : 0;
2400 s->
mv[0][0][0] = s->
mv[0][0][1] = 0;
2401 s->
mv[1][0][0] = s->
mv[1][0][1] = 0;
2405 for (k = 0; k < 4; k++) {
2422 if (n == 3 || mv1) {
2427 if (n == 3 || mv1) {
2443 int16_t **dc_val_ptr,
int *dir_ptr)
2447 static const uint16_t dcpred[32] = {
2448 -1, 1024, 512, 341, 256, 205, 171, 146, 128,
2449 114, 102, 93, 85, 79, 73, 68, 64,
2450 60, 57, 54, 51, 49, 47, 45, 43,
2451 41, 39, 38, 37, 35, 34, 33
2465 b = dc_val[ - 1 -
wrap];
2466 a = dc_val[ -
wrap];
2468 if (pq < 9 || !overlap) {
2471 b = a = dcpred[
scale];
2472 if (s->
mb_x == 0 && (n != 1 && n != 3))
2473 b = c = dcpred[
scale];
2478 if (s->
mb_x == 0 && (n != 1 && n != 3))
2482 if (abs(a - b) <= abs(b - c)) {
2491 *dc_val_ptr = &dc_val[0];
2508 int a_avail,
int c_avail,
2509 int16_t **dc_val_ptr,
int *dir_ptr)
2524 b = dc_val[ - 1 -
wrap];
2525 a = dc_val[ -
wrap];
2529 if (dqscale_index < 0)
2531 if (c_avail && (n != 1 && n != 3)) {
2536 if (a_avail && (n != 2 && n != 3)) {
2541 if (a_avail && c_avail && (n != 3)) {
2552 if (a_avail && c_avail) {
2553 if (abs(a - b) <= abs(b - c)) {
2560 }
else if (a_avail) {
2563 }
else if (c_avail) {
2572 *dc_val_ptr = &dc_val[0];
2585 uint8_t **coded_block_ptr)
2621 int *value,
int codingset)
2687 int coded,
int codingset)
2691 int dc_pred_dir = 0;
2694 int16_t *ac_val, *ac_val2;
2708 if (dcdiff == 119 ) {
2711 else if (v->
pq == 2) dcdiff =
get_bits(gb, 9);
2715 dcdiff = (dcdiff << 2) +
get_bits(gb, 2) - 3;
2716 else if (v->
pq == 2)
2717 dcdiff = (dcdiff << 1) +
get_bits1(gb) - 1;
2742 int last = 0, skip, value;
2743 const uint8_t *zz_table;
2769 block[zz_table[i++]] = value;
2775 for (k = 1; k < 8; k++)
2778 for (k = 1; k < 8; k++)
2783 for (k = 1; k < 8; k++) {
2789 for (k = 1; k < 64; k++)
2793 block[k] += (block[k] < 0) ? -v->
pq : v->
pq;
2807 memset(ac_val2, 0, 16 * 2);
2811 memcpy(ac_val2, ac_val, 8 * 2);
2815 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
2821 for (k = 1; k < 8; k++) {
2827 for (k = 1; k < 8; k++) {
2850 int coded,
int codingset,
int mquant)
2854 int dc_pred_dir = 0;
2857 int16_t *ac_val, *ac_val2;
2876 if (dcdiff == 119 ) {
2878 if (mquant == 1) dcdiff =
get_bits(gb, 10);
2879 else if (mquant == 2) dcdiff =
get_bits(gb, 9);
2883 dcdiff = (dcdiff << 2) +
get_bits(gb, 2) - 3;
2884 else if (mquant == 2)
2885 dcdiff = (dcdiff << 1) +
get_bits1(gb) - 1;
2906 if (!a_avail && !c_avail)
2911 scale = mquant * 2 + ((mquant == v->
pq) ? v->
halfpq : 0);
2919 if ( dc_pred_dir && c_avail && mb_pos)
2921 if (!dc_pred_dir && a_avail && mb_pos >= s->
mb_stride)
2923 if ( dc_pred_dir && n == 1)
2925 if (!dc_pred_dir && n == 2)
2931 int last = 0, skip, value;
2932 const uint8_t *zz_table;
2956 block[zz_table[i++]] = value;
2962 if (q2 && q1 != q2) {
2963 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
2964 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
2969 for (k = 1; k < 8; k++)
2972 for (k = 1; k < 8; k++)
2977 for (k = 1; k < 8; k++)
2980 for (k = 1; k < 8; k++)
2986 for (k = 1; k < 8; k++) {
2992 for (k = 1; k < 64; k++)
2996 block[k] += (block[k] < 0) ? -mquant : mquant;
2999 if (use_pred) i = 63;
3003 memset(ac_val2, 0, 16 * 2);
3006 memcpy(ac_val2, ac_val, 8 * 2);
3007 if (q2 && q1 != q2) {
3008 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3009 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3012 for (k = 1; k < 8; k++)
3013 ac_val2[k] = (ac_val2[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
3018 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
3019 if (q2 && q1 != q2) {
3020 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3021 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3024 for (k = 1; k < 8; k++)
3025 ac_val2[k + 8] = (ac_val2[k + 8] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
3033 for (k = 1; k < 8; k++) {
3039 for (k = 1; k < 8; k++) {
3062 int coded,
int mquant,
int codingset)
3066 int dc_pred_dir = 0;
3069 int16_t *ac_val, *ac_val2;
3080 mquant = (mquant < 1) ? 0 : ((mquant > 31) ? 31 : mquant);
3097 if (dcdiff == 119 ) {
3099 if (mquant == 1) dcdiff =
get_bits(gb, 10);
3100 else if (mquant == 2) dcdiff =
get_bits(gb, 9);
3104 dcdiff = (dcdiff << 2) +
get_bits(gb, 2) - 3;
3105 else if (mquant == 2)
3106 dcdiff = (dcdiff << 1) +
get_bits1(gb) - 1;
3113 dcdiff +=
vc1_pred_dc(&v->
s, v->
overlap, mquant, n, a_avail, c_avail, &dc_val, &dc_pred_dir);
3128 if (!a_avail) dc_pred_dir = 1;
3129 if (!c_avail) dc_pred_dir = 0;
3130 if (!a_avail && !c_avail) use_pred = 0;
3134 scale = mquant * 2 + v->
halfpq;
3142 if (dc_pred_dir && c_avail && mb_pos)
3144 if (!dc_pred_dir && a_avail && mb_pos >= s->
mb_stride)
3146 if ( dc_pred_dir && n == 1)
3148 if (!dc_pred_dir && n == 2)
3150 if (n == 3) q2 = q1;
3153 int last = 0, skip, value;
3162 block[v->
zz_8x8[0][i++]] = value;
3166 block[v->
zz_8x8[2][i++]] = value;
3168 block[v->
zz_8x8[3][i++]] = value;
3170 block[v->
zzi_8x8[i++]] = value;
3178 if (q2 && q1 != q2) {
3179 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3180 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3185 for (k = 1; k < 8; k++)
3188 for (k = 1; k < 8; k++)
3193 for (k = 1; k < 8; k++)
3196 for (k = 1; k < 8; k++)
3202 for (k = 1; k < 8; k++) {
3208 for (k = 1; k < 64; k++)
3212 block[k] += (block[k] < 0) ? -mquant : mquant;
3215 if (use_pred) i = 63;
3219 memset(ac_val2, 0, 16 * 2);
3222 memcpy(ac_val2, ac_val, 8 * 2);
3223 if (q2 && q1 != q2) {
3224 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3225 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3228 for (k = 1; k < 8; k++)
3229 ac_val2[k] = (ac_val2[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
3234 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
3235 if (q2 && q1 != q2) {
3236 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3237 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3240 for (k = 1; k < 8; k++)
3241 ac_val2[k + 8] = (ac_val2[k + 8] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
3249 for (k = 1; k < 8; k++) {
3255 for (k = 1; k < 8; k++) {
3272 int mquant,
int ttmb,
int first_block,
3273 uint8_t *dst,
int linesize,
int skip_block,
3280 int scale,
off, idx, last, skip, value;
3281 int ttblk = ttmb & 7;
3293 && ((v->
ttmbf || (ttmb != -1 && (ttmb & 8) && !first_block))
3303 scale = 2 * mquant + ((v->
pq == mquant) ? v->
halfpq : 0);
3328 block[idx] = value *
scale;
3330 block[idx] += (block[idx] < 0) ? -mquant : mquant;
3342 pat = ~subblkpat & 0xF;
3343 for (j = 0; j < 4; j++) {
3344 last = subblkpat & (1 << (3 - j));
3346 off = (j & 1) * 4 + (j & 2) * 16;
3358 block[idx +
off] += (block[idx +
off] < 0) ? -mquant : mquant;
3360 if (!(subblkpat & (1 << (3 - j))) && !skip_block) {
3369 pat = ~((subblkpat & 2) * 6 + (subblkpat & 1) * 3) & 0xF;
3370 for (j = 0; j < 2; j++) {
3371 last = subblkpat & (1 << (1 - j));
3383 block[idx] = value *
scale;
3385 block[idx] += (block[idx] < 0) ? -mquant : mquant;
3387 if (!(subblkpat & (1 << (1 - j))) && !skip_block) {
3396 pat = ~(subblkpat * 5) & 0xF;
3397 for (j = 0; j < 2; j++) {
3398 last = subblkpat & (1 << (1 - j));
3410 block[idx] = value *
scale;
3412 block[idx] += (block[idx] < 0) ? -mquant : mquant;
3414 if (!(subblkpat & (1 << (1 - j))) && !skip_block) {
3424 *ttmb_out |= ttblk << (n * 4);
3437 block_cbp = mb_cbp >> (block_num * 4), bottom_cbp,
3439 block_is_intra = mb_is_intra >> (block_num * 4), bottom_is_intra;
3443 if (block_num > 3) {
3444 dst = s->
dest[block_num - 3];
3446 dst = s->
dest[0] + (block_num & 1) * 8 + ((block_num & 2) * 4 - 8) * linesize;
3452 if (block_num > 3) {
3453 bottom_cbp = v->
cbp[s->
mb_x] >> (block_num * 4);
3454 bottom_is_intra = v->
is_intra[s->
mb_x] >> (block_num * 4);
3458 bottom_cbp = (block_num < 2) ? (mb_cbp >> ((block_num + 2) * 4))
3459 : (v->
cbp[s->
mb_x] >> ((block_num - 2) * 4));
3460 bottom_is_intra = (block_num < 2) ? (mb_is_intra >> ((block_num + 2) * 4))
3466 if (bottom_is_intra & 1 || block_is_intra & 1 ||
3467 mv[0][0] !=
mv[mv_stride][0] ||
mv[0][1] !=
mv[mv_stride][1]) {
3470 idx = ((bottom_cbp >> 2) | block_cbp) & 3;
3482 dst -= 4 * linesize;
3485 idx = (block_cbp | (block_cbp >> 2)) & 3;
3501 block_cbp = mb_cbp >> (block_num * 4), right_cbp,
3503 block_is_intra = mb_is_intra >> (block_num * 4), right_is_intra;
3507 if (block_num > 3) {
3508 dst = s->
dest[block_num - 3] - 8 * linesize;
3510 dst = s->
dest[0] + (block_num & 1) * 8 + ((block_num & 2) * 4 - 16) * linesize - 8;
3516 if (block_num > 3) {
3521 right_cbp = (block_num & 1) ? (v->
cbp[s->
mb_x - s->
mb_stride] >> ((block_num - 1) * 4))
3522 : (mb_cbp >> ((block_num + 1) * 4));
3524 : (mb_is_intra >> ((block_num + 1) * 4));
3527 if (block_is_intra & 1 || right_is_intra & 1 ||
mv[0][0] !=
mv[1][0] ||
mv[0][1] !=
mv[1][1]) {
3530 idx = ((right_cbp >> 1) | block_cbp) & 5;
3545 idx = (block_cbp | (block_cbp >> 1)) & 5;
3562 for (i = 0; i < 6; i++) {
3569 for (i = 0; i < 6; i++) {
3575 for (i = 0; i < 6; i++) {
3592 int ttmb = v->
ttfrm;
3594 int mb_has_coeffs = 1;
3598 int first_block = 1;
3600 int skipped, fourmv;
3601 int block_cbp = 0, pat, block_tt = 0, block_intra = 0;
3626 if (s->
mb_intra && !mb_has_coeffs) {
3630 }
else if (mb_has_coeffs) {
3646 for (i = 0; i < 6; i++) {
3649 val = ((cbp >> (5 - i)) & 1);
3650 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
3657 if (i == 1 || i == 3 || s->
mb_x)
3666 for (j = 0; j < 64; j++)
3667 s->
block[i][j] <<= 1;
3675 block_cbp |= 0xF << (i << 2);
3676 block_intra |= 1 << i;
3681 block_cbp |= pat << (i << 2);
3682 if (!v->
ttmbf && ttmb < 8)
3689 for (i = 0; i < 6; i++) {
3700 int intra_count = 0, coded_inter = 0;
3701 int is_intra[6], is_coded[6];
3704 for (i = 0; i < 6; i++) {
3705 val = ((cbp >> (5 - i)) & 1);
3720 is_coded[i] = mb_has_coeffs;
3723 is_intra[i] = (intra_count >= 3);
3730 coded_inter = !is_intra[i] & is_coded[i];
3734 if (!intra_count && !coded_inter)
3741 for (i = 0; i < 6; i++)
3754 if (!v->
ttmbf && coded_inter)
3756 for (i = 0; i < 6; i++) {
3758 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
3765 if (i == 1 || i == 3 || s->
mb_x)
3774 for (j = 0; j < 64; j++)
3775 s->
block[i][j] <<= 1;
3784 block_cbp |= 0xF << (i << 2);
3785 block_intra |= 1 << i;
3786 }
else if (is_coded[i]) {
3788 first_block, s->
dest[dst_idx] + off,
3792 block_cbp |= pat << (i << 2);
3793 if (!v->
ttmbf && ttmb < 8)
3801 for (i = 0; i < 6; i++) {
3805 for (i = 0; i < 4; i++) {
3831 int ttmb = v->
ttfrm;
3833 int mb_has_coeffs = 1;
3836 int first_block = 1;
3838 int skipped, fourmv = 0, twomv = 0;
3839 int block_cbp = 0, pat, block_tt = 0;
3840 int idx_mbmode = 0, mvbp;
3841 int stride_y, fieldtx;
3889 for (i = 0; i < 6; i++)
3902 for (i = 0; i < 6; i++) {
3905 val = ((cbp >> (5 - i)) & 1);
3910 if (i == 1 || i == 3 || s->
mb_x)
3919 off = (fieldtx) ? ((i & 1) * 8) + ((i & 2) >> 1) * s->
linesize : (i & 1) * 8 + 4 * (i & 2) * s->
linesize;
3941 for (i = 0; i < 6; i++)
3948 for (i = 0; i < 6; i++) {
3951 val = ((mvbp >> (3 - i)) & 1);
3957 }
else if (i == 4) {
3989 if (!v->
ttmbf && cbp)
3991 for (i = 0; i < 6; i++) {
3994 val = ((cbp >> (5 - i)) & 1);
3996 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
3998 off = (i & 4) ? 0 : ((i & 1) * 8 + ((i > 1) * s->
linesize));
4001 first_block, s->
dest[dst_idx] + off,
4004 block_cbp |= pat << (i << 2);
4005 if (!v->
ttmbf && ttmb < 8)
4013 for (i = 0; i < 6; i++) {
4039 int ttmb = v->
ttfrm;
4041 int mb_has_coeffs = 1;
4044 int first_block = 1;
4047 int block_cbp = 0, pat, block_tt = 0;
4053 if (idx_mbmode <= 1) {
4064 mb_has_coeffs = idx_mbmode & 1;
4068 for (i = 0; i < 6; i++) {
4072 val = ((cbp >> (5 - i)) & 1);
4076 if (i == 1 || i == 3 || s->
mb_x)
4084 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
4093 if (idx_mbmode <= 5) {
4095 if (idx_mbmode & 1) {
4100 mb_has_coeffs = !(idx_mbmode & 2);
4103 for (i = 0; i < 6; i++) {
4105 dmv_x = dmv_y = pred_flag = 0;
4106 val = ((v->
fourmvbp >> (3 - i)) & 1);
4115 mb_has_coeffs = idx_mbmode & 1;
4123 if (!v->
ttmbf && cbp) {
4127 for (i = 0; i < 6; i++) {
4130 val = ((cbp >> (5 - i)) & 1);
4131 off = (i & 4) ? 0 : (i & 1) * 8 + (i & 2) * 4 * s->
linesize;
4136 first_block, s->
dest[dst_idx] + off,
4140 block_cbp |= pat << (i << 2);
4141 if (!v->
ttmbf && ttmb < 8) ttmb = -1;
4161 int ttmb = v->
ttfrm;
4162 int mb_has_coeffs = 0;
4165 int first_block = 1;
4167 int skipped, direct;
4168 int dmv_x[2], dmv_y[2];
4183 dmv_x[0] = dmv_x[1] = dmv_y[0] = dmv_y[1] = 0;
4184 for (i = 0; i < 6; i++) {
4193 dmv_x[1] = dmv_x[0];
4194 dmv_y[1] = dmv_y[0];
4207 dmv_x[0] = dmv_y[0] = 0;
4211 for (i = 0; i < 6; i++)
4218 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4228 dmv_x[0] = dmv_y[0] = dmv_x[1] = dmv_y[1] = 0;
4230 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4232 if (!mb_has_coeffs && !s->
mb_intra) {
4235 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4238 if (s->
mb_intra && !mb_has_coeffs) {
4247 if (!mb_has_coeffs) {
4250 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4256 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4268 for (i = 0; i < 6; i++) {
4271 val = ((cbp >> (5 - i)) & 1);
4272 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
4279 if (i == 1 || i == 3 || s->
mb_x)
4288 for (j = 0; j < 64; j++)
4289 s->
block[i][j] <<= 1;
4293 first_block, s->
dest[dst_idx] + off,
4296 if (!v->
ttmbf && ttmb < 8)
4313 int ttmb = v->
ttfrm;
4314 int mb_has_coeffs = 0;
4316 int first_block = 1;
4319 int dmv_x[2], dmv_y[2], pred_flag[2];
4321 int idx_mbmode, interpmvp;
4327 if (idx_mbmode <= 1) {
4338 mb_has_coeffs = idx_mbmode & 1;
4342 for (i = 0; i < 6; i++) {
4345 val = ((cbp >> (5 - i)) & 1);
4350 if (i == 1 || i == 3 || s->
mb_x)
4359 for (j = 0; j < 64; j++)
4360 s->
block[i][j] <<= 1;
4361 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
4374 if (idx_mbmode <= 5) {
4375 dmv_x[0] = dmv_x[1] = dmv_y[0] = dmv_y[1] = 0;
4376 pred_flag[0] = pred_flag[1] = 0;
4401 dmv_x[0] = dmv_y[0] = pred_flag[0] = 0;
4402 dmv_x[1] = dmv_y[1] = pred_flag[0] = 0;
4406 mb_has_coeffs = !(idx_mbmode & 2);
4412 for (i = 0; i < 6; i++) {
4414 dmv_x[0] = dmv_y[0] = pred_flag[0] = 0;
4415 dmv_x[1] = dmv_y[1] = pred_flag[1] = 0;
4416 val = ((v->
fourmvbp >> (3 - i)) & 1);
4427 mb_has_coeffs = idx_mbmode & 1;
4435 if (!v->
ttmbf && cbp) {
4439 for (i = 0; i < 6; i++) {
4442 val = ((cbp >> (5 - i)) & 1);
4443 off = (i & 4) ? 0 : (i & 1) * 8 + (i & 2) * 4 * s->
linesize;
4448 first_block, s->
dest[dst_idx] + off,
4451 if (!v->
ttmbf && ttmb < 8)
4508 dst[0] = s->
dest[0];
4509 dst[1] = dst[0] + 8;
4511 dst[3] = dst[2] + 8;
4512 dst[4] = s->
dest[1];
4513 dst[5] = s->
dest[2];
4525 for (k = 0; k < 6; k++) {
4526 val = ((cbp >> (5 - k)) & 1);
4533 cbp |= val << (5 - k);
4542 for (j = 0; j < 64; j++)
4543 s->
block[k][j] <<= 1;
4547 for (j = 0; j < 64; j++)
4676 for (k = 0; k < 6; k++) {
4677 val = ((cbp >> (5 - k)) & 1);
4684 cbp |= val << (5 - k);
4792 if (apply_loop_filter) {
4923 #if CONFIG_WMV3IMAGE_DECODER || CONFIG_VC1IMAGE_DECODER
4939 int effect_type, effect_flag;
4940 int effect_pcount1, effect_pcount2;
4941 int effect_params1[15], effect_params2[10];
4949 static void vc1_sprite_parse_transform(
GetBitContext* gb,
int c[7])
4956 c[2] = get_fp_val(gb);
4960 c[0] = c[4] = get_fp_val(gb);
4961 c[2] = get_fp_val(gb);
4964 c[0] = get_fp_val(gb);
4965 c[2] = get_fp_val(gb);
4966 c[4] = get_fp_val(gb);
4969 c[0] = get_fp_val(gb);
4970 c[1] = get_fp_val(gb);
4971 c[2] = get_fp_val(gb);
4972 c[3] = get_fp_val(gb);
4973 c[4] = get_fp_val(gb);
4976 c[5] = get_fp_val(gb);
4978 c[6] = get_fp_val(gb);
4988 for (sprite = 0; sprite <= v->
two_sprites; sprite++) {
4989 vc1_sprite_parse_transform(gb, sd->coefs[sprite]);
4990 if (sd->coefs[sprite][1] || sd->coefs[sprite][3])
4993 for (i = 0; i < 7; i++)
4995 sd->coefs[sprite][i] / (1<<16),
4996 (abs(sd->coefs[sprite][i]) & 0xFFFF) * 1000 / (1 << 16));
5002 switch (sd->effect_pcount1 =
get_bits(gb, 4)) {
5004 vc1_sprite_parse_transform(gb, sd->effect_params1);
5007 vc1_sprite_parse_transform(gb, sd->effect_params1);
5008 vc1_sprite_parse_transform(gb, sd->effect_params1 + 7);
5011 for (i = 0; i < sd->effect_pcount1; i++)
5012 sd->effect_params1[i] = get_fp_val(gb);
5014 if (sd->effect_type != 13 || sd->effect_params1[0] != sd->coefs[0][6]) {
5017 for (i = 0; i < sd->effect_pcount1; i++)
5019 sd->effect_params1[i] / (1 << 16),
5020 (abs(sd->effect_params1[i]) & 0xFFFF) * 1000 / (1 << 16));
5024 sd->effect_pcount2 =
get_bits(gb, 16);
5025 if (sd->effect_pcount2 > 10) {
5028 }
else if (sd->effect_pcount2) {
5031 while (++i < sd->effect_pcount2) {
5032 sd->effect_params2[i] = get_fp_val(gb);
5034 sd->effect_params2[i] / (1 << 16),
5035 (abs(sd->effect_params2[i]) & 0xFFFF) * 1000 / (1 << 16));
5050 static void vc1_draw_sprites(
VC1Context *v, SpriteData* sd)
5052 int i, plane, row, sprite;
5053 int sr_cache[2][2] = { { -1, -1 }, { -1, -1 } };
5054 uint8_t* src_h[2][2];
5055 int xoff[2], xadv[2], yoff[2], yadv[2], alpha;
5059 for (i = 0; i < 2; i++) {
5060 xoff[i] = av_clip(sd->coefs[i][2], 0, v->
sprite_width-1 << 16);
5061 xadv[i] = sd->coefs[i][0];
5065 yoff[i] = av_clip(sd->coefs[i][5], 0, v->
sprite_height-1 << 16);
5068 alpha = av_clip(sd->coefs[1][6], 0, (1<<16) - 1);
5077 for (sprite = 0; sprite <= v->
two_sprites; sprite++) {
5080 int ycoord = yoff[sprite] + yadv[sprite] * row;
5081 int yline = ycoord >> 16;
5082 ysub[sprite] = ycoord & 0xFFFF;
5087 if (!(xoff[sprite] & 0xFFFF) && xadv[sprite] == 1 << 16) {
5088 src_h[sprite][0] = iplane + (xoff[sprite] >> 16) + yline * iline;
5090 src_h[sprite][1] = iplane + (xoff[sprite] >> 16) + (yline + 1) * iline;
5092 if (sr_cache[sprite][0] != yline) {
5093 if (sr_cache[sprite][1] == yline) {
5095 FFSWAP(
int, sr_cache[sprite][0], sr_cache[sprite][1]);
5097 v->
vc1dsp.
sprite_h(v->
sr_rows[sprite][0], iplane + yline * iline, xoff[sprite], xadv[sprite], width);
5098 sr_cache[sprite][0] = yline;
5101 if (ysub[sprite] && sr_cache[sprite][1] != yline + 1) {
5102 v->
vc1dsp.
sprite_h(v->
sr_rows[sprite][1], iplane + (yline + 1) * iline, xoff[sprite], xadv[sprite], width);
5103 sr_cache[sprite][1] = yline + 1;
5105 src_h[sprite][0] = v->
sr_rows[sprite][0];
5106 src_h[sprite][1] = v->
sr_rows[sprite][1];
5114 memcpy(dst, src_h[0][0], width);
5117 if (ysub[0] && ysub[1]) {
5119 src_h[1][0], src_h[1][1], ysub[1], alpha, width);
5120 }
else if (ysub[0]) {
5122 src_h[1][0], alpha, width);
5123 }
else if (ysub[1]) {
5125 src_h[0][0], (1<<16)-1-alpha, width);
5133 for (i = 0; i < 2; i++) {
5149 vc1_parse_sprites(v, gb, &sd);
5171 vc1_draw_sprites(v, &sd);
5191 plane ? 128 : 0, f->
linesize[plane]);
5250 for (i = 0; i < 4; i++)
5313 }
else if (count < 0) {
5317 const uint8_t *start = avctx->
extradata;
5319 const uint8_t *next;
5320 int size, buf2_size;
5321 uint8_t *buf2 =
NULL;
5322 int seq_initialized = 0, ep_initialized = 0;
5332 for (; next < end; start = next) {
5334 size = next - start - 4;
5345 seq_initialized = 1;
5357 if (!seq_initialized || !ep_initialized) {
5374 for (i = 0; i < 64; i++) {
5375 #define transpose(x) ((x >> 3) | ((x & 7) << 3))
5417 for (i = 0; i < 4; i++)
5449 const uint8_t *buf = avpkt->
data;
5450 int buf_size = avpkt->
size, n_slices = 0, i;
5454 uint8_t *buf2 =
NULL;
5455 const uint8_t *buf_start = buf;
5456 int mb_height, n_slices1;
5461 } *slices =
NULL, *tmp;
5489 const uint8_t *start, *end, *next;
5493 for (start = buf, end = buf + buf_size; next < end; start = next) {
5495 size = next - start - 4;
5496 if (size <= 0)
continue;
5506 slices =
av_realloc(slices,
sizeof(*slices) * (n_slices+1));
5510 if (!slices[n_slices].buf)
5513 slices[n_slices].buf);
5518 slices[n_slices].mby_start = s->
mb_height >> 1;
5519 n_slices1 = n_slices - 1;
5530 slices =
av_realloc(slices,
sizeof(*slices) * (n_slices+1));
5534 if (!slices[n_slices].buf)
5537 slices[n_slices].buf);
5540 slices[n_slices].mby_start =
get_bits(&slices[n_slices].gb, 9);
5546 }
else if (v->
interlace && ((buf[0] & 0xC0) == 0xC0)) {
5547 const uint8_t *divider;
5555 tmp =
av_realloc(slices,
sizeof(*slices) * (n_slices+1));
5560 if (!slices[n_slices].buf)
5562 buf_size3 =
vc1_unescape_buffer(divider + 4, buf + buf_size - divider - 4, slices[n_slices].buf);
5565 slices[n_slices].mby_start = s->
mb_height >> 1;
5566 n_slices1 = n_slices - 1;
5693 v->
bits = buf_size * 8;
5707 v->
mv_f[0] = tmp[0];
5708 v->
mv_f[1] = tmp[1];
5711 for (i = 0; i <= n_slices; i++) {
5712 if (i > 0 && slices[i - 1].mby_start >= mb_height) {
5730 s->
start_mb_y = (i == 0) ? 0 :
FFMAX(0, slices[i-1].mby_start % mb_height);
5732 s->
end_mb_y = (i == n_slices ) ? mb_height :
FFMIN(mb_height, slices[i].mby_start % mb_height);
5734 s->
end_mb_y = (i <= n_slices1 + 1) ? mb_height :
FFMIN(mb_height, slices[i].mby_start % mb_height);
5737 s->
gb = slices[i].gb;
5765 #if CONFIG_WMV3IMAGE_DECODER || CONFIG_VC1IMAGE_DECODER
5766 if (vc1_decode_sprites(v, &s->
gb))
5785 for (i = 0; i < n_slices; i++)
5792 for (i = 0; i < n_slices; i++)
5821 #if CONFIG_WMV3_DECODER
5837 #if CONFIG_WMV3_VDPAU_DECODER
5838 AVCodec ff_wmv3_vdpau_decoder = {
5839 .
name =
"wmv3_vdpau",
5853 #if CONFIG_VC1_VDPAU_DECODER
5854 AVCodec ff_vc1_vdpau_decoder = {
5855 .
name =
"vc1_vdpau",
5869 #if CONFIG_WMV3IMAGE_DECODER
5870 AVCodec ff_wmv3image_decoder = {
5871 .
name =
"wmv3image",
5879 .
flush = vc1_sprite_flush,
5885 #if CONFIG_VC1IMAGE_DECODER
5886 AVCodec ff_vc1image_decoder = {
5895 .
flush = vc1_sprite_flush,