47 #define MB_INTRA_VLC_BITS 9
53 static const int offset_table2[9] = { 0, 1, 3, 7, 15, 31, 63, 127, 255 };
93 int topleft_mb_pos, top_mb_pos;
94 int stride_y, fieldtx = 0;
110 v_dist = (16 - fieldtx) >> (fieldtx == 0);
135 v_dist = fieldtx ? 15 : 8;
157 #define inc_blk_idx(idx) do { \
159 if (idx >= v->n_allocated_blks) \
178 for (j = 0; j < 2; j++) {
211 for (j = 0; j < 2; j++) {
228 for (j = 0; j < 2; j++) {
244 for (j = 0; j < 2; j++) {
255 for (j = 0; j < 2; j++) {
349 int dxy, mx, my, uvmx, uvmy, src_x, src_y, uvsrc_x, uvsrc_y;
352 uint8_t (*luty)[256], (*lutuv)[256];
360 mx = s->
mv[dir][0][0];
361 my = s->
mv[dir][0][1];
365 for (i = 0; i < 4; i++) {
371 uvmx = (mx + ((mx & 3) == 3)) >> 1;
372 uvmy = (my + ((my & 3) == 3)) >> 1;
384 uvmx = uvmx + ((uvmx < 0) ? (uvmx & 1) : -(uvmx & 1));
385 uvmy = uvmy + ((uvmy < 0) ? (uvmy & 1) : -(uvmy & 1));
415 src_x = s->
mb_x * 16 + (mx >> 2);
416 src_y = s->
mb_y * 16 + (my >> 2);
417 uvsrc_x = s->
mb_x * 8 + (uvmx >> 2);
418 uvsrc_y = s->
mb_y * 8 + (uvmy >> 2);
421 src_x = av_clip( src_x, -16, s->
mb_width * 16);
422 src_y = av_clip( src_y, -16, s->
mb_height * 16);
423 uvsrc_x = av_clip(uvsrc_x, -8, s->
mb_width * 8);
424 uvsrc_y = av_clip(uvsrc_y, -8, s->
mb_height * 8);
432 srcY += src_y * s->
linesize + src_x;
451 || (
unsigned)(src_y - 1) > v_edge_pos - (my&3) - 16 - 3) {
461 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
463 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
472 for (j = 0; j < 17 + s->
mspel * 2; j++) {
473 for (i = 0; i < 17 + s->
mspel * 2; i++)
474 src[i] = ((src[i] - 128) >> 1) + 128;
479 for (j = 0; j < 9; j++) {
480 for (i = 0; i < 9; i++) {
481 src[i] = ((src[i] - 128) >> 1) + 128;
482 src2[i] = ((src2[i] - 128) >> 1) + 128;
494 for (j = 0; j < 17 + s->
mspel * 2; j++) {
496 for (i = 0; i < 17 + s->
mspel * 2; i++)
497 src[i] = luty[f][src[i]];
502 for (j = 0; j < 9; j++) {
504 for (i = 0; i < 9; i++) {
505 src[i] = lutuv[f][src[i]];
506 src2[i] = lutuv[f][src2[i]];
516 dxy = ((my & 3) << 2) | (mx & 3);
523 dxy = (my & 2) | ((mx & 2) >> 1);
532 uvmx = (uvmx & 3) << 1;
533 uvmy = (uvmy & 3) << 1;
546 if (c < d)
return (
FFMIN(b, d) +
FFMAX(a, c)) / 2;
549 if (c < d)
return (
FFMIN(a, d) +
FFMAX(b, c)) / 2;
560 int dxy, mx, my, src_x, src_y;
572 mx = s->
mv[dir][
n][0];
573 my = s->
mv[dir][
n][1];
600 int same_count = 0, opp_count = 0, k;
601 int chosen_mv[2][4][2], f;
603 for (k = 0; k < 4; k++) {
605 chosen_mv[f][f ? opp_count : same_count][0] = s->
mv[0][k][0];
606 chosen_mv[f][f ? opp_count : same_count][1] = s->
mv[0][k][1];
610 f = opp_count > same_count;
611 switch (f ? opp_count : same_count) {
613 tx =
median4(chosen_mv[f][0][0], chosen_mv[f][1][0],
614 chosen_mv[f][2][0], chosen_mv[f][3][0]);
615 ty =
median4(chosen_mv[f][0][1], chosen_mv[f][1][1],
616 chosen_mv[f][2][1], chosen_mv[f][3][1]);
619 tx =
mid_pred(chosen_mv[f][0][0], chosen_mv[f][1][0], chosen_mv[f][2][0]);
620 ty =
mid_pred(chosen_mv[f][0][1], chosen_mv[f][1][1], chosen_mv[f][2][1]);
623 tx = (chosen_mv[f][0][0] + chosen_mv[f][1][0]) / 2;
624 ty = (chosen_mv[f][0][1] + chosen_mv[f][1][1]) / 2;
631 for (k = 0; k < 4; k++)
643 qx = (s->
mb_x * 16) + (mx >> 2);
644 qy = (s->
mb_y * 8) + (my >> 3);
649 mx -= 4 * (qx -
width);
652 else if (qy > height + 1)
653 my -= 8 * (qy - height - 1);
657 off = ((n > 1) ? s->
linesize : 0) + (n & 1) * 8;
659 off = s->
linesize * 4 * (n & 2) + (n & 1) * 8;
661 src_x = s->
mb_x * 16 + (n & 1) * 8 + (mx >> 2);
663 src_y = s->
mb_y * 16 + (n & 2) * 4 + (my >> 2);
665 src_y = s->
mb_y * 16 + ((n > 1) ? 1 : 0) + (my >> 2);
668 src_x = av_clip(src_x, -16, s->
mb_width * 16);
669 src_y = av_clip(src_y, -16, s->
mb_height * 16);
682 srcY += src_y * s->
linesize + src_x;
686 if (fieldmv && !(src_y & 1))
688 if (fieldmv && (src_y & 1) && src_y < 4)
693 || (
unsigned)(src_y - (s->
mspel << fieldmv)) > v_edge_pos - (my & 3) - ((8 + s->
mspel * 2) << fieldmv)) {
697 9 + s->
mspel * 2, (9 + s->
mspel * 2) << fieldmv,
698 src_x - s->
mspel, src_y - (s->
mspel << fieldmv),
707 for (j = 0; j < 9 + s->
mspel * 2; j++) {
708 for (i = 0; i < 9 + s->
mspel * 2; i++)
709 src[i] = ((src[i] - 128) >> 1) + 128;
719 for (j = 0; j < 9 + s->
mspel * 2; j++) {
721 for (i = 0; i < 9 + s->
mspel * 2; i++)
722 src[i] = luty[f][src[i]];
730 dxy = ((my & 3) << 2) | (mx & 3);
736 dxy = (my & 2) | ((mx & 2) >> 1);
747 static const int count[16] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4};
749 idx = ((a[3] != flag) << 3)
750 | ((a[2] != flag) << 2)
751 | ((a[1] != flag) << 1)
754 *tx =
median4(mvx[0], mvx[1], mvx[2], mvx[3]);
755 *ty =
median4(mvy[0], mvy[1], mvy[2], mvy[3]);
757 }
else if (count[idx] == 1) {
760 *tx =
mid_pred(mvx[1], mvx[2], mvx[3]);
761 *ty =
mid_pred(mvy[1], mvy[2], mvy[3]);
764 *tx =
mid_pred(mvx[0], mvx[2], mvx[3]);
765 *ty =
mid_pred(mvy[0], mvy[2], mvy[3]);
768 *tx =
mid_pred(mvx[0], mvx[1], mvx[3]);
769 *ty =
mid_pred(mvy[0], mvy[1], mvy[3]);
772 *tx =
mid_pred(mvx[0], mvx[1], mvx[2]);
773 *ty =
mid_pred(mvy[0], mvy[1], mvy[2]);
776 }
else if (count[idx] == 2) {
778 for (i = 0; i < 3; i++)
783 for (i = t1 + 1; i < 4; i++)
788 *tx = (mvx[
t1] + mvx[
t2]) / 2;
789 *ty = (mvy[
t1] + mvy[
t2]) / 2;
804 int uvmx, uvmy, uvsrc_x, uvsrc_y;
805 int k, tx = 0, ty = 0;
806 int mvx[4], mvy[4], intra[4], mv_f[4];
818 for (k = 0; k < 4; k++) {
819 mvx[k] = s->
mv[dir][k][0];
820 mvy[k] = s->
mv[dir][k][1];
838 if (mv_f[0] + mv_f[1] + mv_f[2] + mv_f[3] > 2)
840 valid_count =
get_chroma_mv(mvx, mvy, mv_f, dominant, &tx, &ty);
848 uvmx = (tx + ((tx & 3) == 3)) >> 1;
849 uvmy = (ty + ((ty & 3) == 3)) >> 1;
855 uvmx = uvmx + ((uvmx < 0) ? (uvmx & 1) : -(uvmx & 1));
856 uvmy = uvmy + ((uvmy < 0) ? (uvmy & 1) : -(uvmy & 1));
860 uvmy += 2 - 4 * chroma_ref_type;
862 uvsrc_x = s->
mb_x * 8 + (uvmx >> 2);
863 uvsrc_y = s->
mb_y * 8 + (uvmy >> 2);
866 uvsrc_x = av_clip(uvsrc_x, -8, s->
mb_width * 8);
867 uvsrc_y = av_clip(uvsrc_y, -8, s->
mb_height * 8);
899 if (chroma_ref_type) {
907 || (
unsigned)uvsrc_x > (s->
h_edge_pos >> 1) - 9
908 || (
unsigned)uvsrc_y > (v_edge_pos >> 1) - 9) {
910 8 + 1, 8 + 1, uvsrc_x, uvsrc_y,
913 8 + 1, 8 + 1, uvsrc_x, uvsrc_y,
925 for (j = 0; j < 9; j++) {
926 for (i = 0; i < 9; i++) {
927 src[i] = ((src[i] - 128) >> 1) + 128;
928 src2[i] = ((src2[i] - 128) >> 1) + 128;
941 for (j = 0; j < 9; j++) {
942 int f = v->
field_mode ? chroma_ref_type : ((j + uvsrc_y)&1);
943 for (i = 0; i < 9; i++) {
944 src[i] = lutuv[f][src[i]];
945 src2[i] = lutuv[f][src2[i]];
954 uvmx = (uvmx & 3) << 1;
955 uvmy = (uvmy & 3) << 1;
972 int uvsrc_x, uvsrc_y;
973 int uvmx_field[4], uvmy_field[4];
976 static const int s_rndtblfield[16] = { 0, 0, 1, 2, 4, 4, 5, 6, 2, 2, 3, 8, 6, 6, 7, 12 };
977 int v_dist = fieldmv ? 1 : 4;
985 for (i = 0; i < 4; i++) {
986 int d = i<2 ? dir: dir2;
988 uvmx_field[i] = (tx + ((tx & 3) == 3)) >> 1;
991 uvmy_field[i] = (ty >> 4) * 8 + s_rndtblfield[ty & 0xF];
993 uvmy_field[i] = (ty + ((ty & 3) == 3)) >> 1;
996 for (i = 0; i < 4; i++) {
997 off = (i & 1) * 4 + ((i & 2) ? v_dist * s->
uvlinesize : 0);
998 uvsrc_x = s->
mb_x * 8 + (i & 1) * 4 + (uvmx_field[i] >> 2);
999 uvsrc_y = s->
mb_y * 8 + ((i & 2) ? v_dist : 0) + (uvmy_field[i] >> 2);
1003 if (i < 2 ? dir : dir2) {
1014 uvmx_field[i] = (uvmx_field[i] & 3) << 1;
1015 uvmy_field[i] = (uvmy_field[i] & 3) << 1;
1017 if (fieldmv && !(uvsrc_y & 1))
1020 if (fieldmv && (uvsrc_y & 1) && uvsrc_y < 2)
1023 || s->
h_edge_pos < 10 || v_edge_pos < (5 << fieldmv)
1024 || (
unsigned)uvsrc_x > (s->
h_edge_pos >> 1) - 5
1025 || (
unsigned)uvsrc_y > v_edge_pos - (5 << fieldmv)) {
1027 5, (5 << fieldmv), uvsrc_x, uvsrc_y,
1030 5, (5 << fieldmv), uvsrc_x, uvsrc_y,
1042 for (j = 0; j < 5; j++) {
1043 int f = (uvsrc_y + (j<<fieldmv))&1;
1044 for (i = 0; i < 5; i++) {
1045 src[i] = lutuv[f][src[i]];
1046 src2[i] = lutuv[f][src2[i]];
1084 #define GET_MQUANT() \
1085 if (v->dquantfrm) { \
1087 if (v->dqprofile == DQPROFILE_ALL_MBS) { \
1088 if (v->dqbilevel) { \
1089 mquant = (get_bits1(gb)) ? v->altpq : v->pq; \
1091 mqdiff = get_bits(gb, 3); \
1093 mquant = v->pq + mqdiff; \
1095 mquant = get_bits(gb, 5); \
1098 if (v->dqprofile == DQPROFILE_SINGLE_EDGE) \
1099 edges = 1 << v->dqsbedge; \
1100 else if (v->dqprofile == DQPROFILE_DOUBLE_EDGES) \
1101 edges = (3 << v->dqsbedge) % 15; \
1102 else if (v->dqprofile == DQPROFILE_FOUR_EDGES) \
1104 if ((edges&1) && !s->mb_x) \
1105 mquant = v->altpq; \
1106 if ((edges&2) && s->first_slice_line) \
1107 mquant = v->altpq; \
1108 if ((edges&4) && s->mb_x == (s->mb_width - 1)) \
1109 mquant = v->altpq; \
1110 if ((edges&8) && s->mb_y == (s->mb_height - 1)) \
1111 mquant = v->altpq; \
1112 if (!mquant || mquant > 31) { \
1113 av_log(v->s.avctx, AV_LOG_ERROR, \
1114 "Overriding invalid mquant %d\n", mquant); \
1126 #define GET_MVDATA(_dmv_x, _dmv_y) \
1127 index = 1 + get_vlc2(gb, ff_vc1_mv_diff_vlc[s->mv_table_index].table, \
1128 VC1_MV_DIFF_VLC_BITS, 2); \
1130 mb_has_coeffs = 1; \
1133 mb_has_coeffs = 0; \
1136 _dmv_x = _dmv_y = 0; \
1137 } else if (index == 35) { \
1138 _dmv_x = get_bits(gb, v->k_x - 1 + s->quarter_sample); \
1139 _dmv_y = get_bits(gb, v->k_y - 1 + s->quarter_sample); \
1140 } else if (index == 36) { \
1145 index1 = index % 6; \
1146 if (!s->quarter_sample && index1 == 5) val = 1; \
1148 if (size_table[index1] - val > 0) \
1149 val = get_bits(gb, size_table[index1] - val); \
1151 sign = 0 - (val&1); \
1152 _dmv_x = (sign ^ ((val>>1) + offset_table[index1])) - sign; \
1154 index1 = index / 6; \
1155 if (!s->quarter_sample && index1 == 5) val = 1; \
1157 if (size_table[index1] - val > 0) \
1158 val = get_bits(gb, size_table[index1] - val); \
1160 sign = 0 - (val & 1); \
1161 _dmv_y = (sign ^ ((val >> 1) + offset_table[index1])) - sign; \
1165 int *dmv_y,
int *pred_flag)
1168 int extend_x = 0, extend_y = 0;
1172 const int* offs_tab;
1189 extend_x = extend_y = 1;
1198 *pred_flag = *dmv_y & 1;
1199 *dmv_y = (*dmv_y + *pred_flag) >> 1;
1201 *dmv_y = (*dmv_y + (*dmv_y & 1)) >> 1;
1211 index1 = (index + 1) % 9;
1213 val =
get_bits(gb, index1 + extend_x);
1214 sign = 0 -(val & 1);
1215 *dmv_x = (sign ^ ((val >> 1) + offs_tab[index1])) - sign;
1222 index1 = (index + 1) / 9;
1223 if (index1 > v->
numref) {
1225 sign = 0 - (val & 1);
1226 *dmv_y = (sign ^ ((val >> 1) + offs_tab[index1 >> v->
numref])) - sign;
1229 if (v->
numref && pred_flag)
1230 *pred_flag = index1 & 1;
1236 int scaledvalue, refdist;
1237 int scalesame1, scalesame2;
1238 int scalezone1_x, zone1offset_x;
1255 if (
FFABS(n) < scalezone1_x)
1256 scaledvalue = (n * scalesame1) >> 8;
1259 scaledvalue = ((n * scalesame2) >> 8) - zone1offset_x;
1261 scaledvalue = ((n * scalesame2) >> 8) + zone1offset_x;
1269 int scaledvalue, refdist;
1270 int scalesame1, scalesame2;
1271 int scalezone1_y, zone1offset_y;
1288 if (
FFABS(n) < scalezone1_y)
1289 scaledvalue = (n * scalesame1) >> 8;
1292 scaledvalue = ((n * scalesame2) >> 8) - zone1offset_y;
1294 scaledvalue = ((n * scalesame2) >> 8) + zone1offset_y;
1299 return av_clip(scaledvalue, -v->
range_y / 2 + 1, v->
range_y / 2);
1301 return av_clip(scaledvalue, -v->
range_y / 2, v->
range_y / 2 - 1);
1306 int scalezone1_x, zone1offset_x;
1307 int scaleopp1, scaleopp2, brfd;
1319 if (
FFABS(n) < scalezone1_x)
1320 scaledvalue = (n * scaleopp1) >> 8;
1323 scaledvalue = ((n * scaleopp2) >> 8) - zone1offset_x;
1325 scaledvalue = ((n * scaleopp2) >> 8) + zone1offset_x;
1333 int scalezone1_y, zone1offset_y;
1334 int scaleopp1, scaleopp2, brfd;
1346 if (
FFABS(n) < scalezone1_y)
1347 scaledvalue = (n * scaleopp1) >> 8;
1350 scaledvalue = ((n * scaleopp2) >> 8) - zone1offset_y;
1352 scaledvalue = ((n * scaleopp2) >> 8) + zone1offset_y;
1356 return av_clip(scaledvalue, -v->
range_y / 2 + 1, v->
range_y / 2);
1358 return av_clip(scaledvalue, -v->
range_y / 2, v->
range_y / 2 - 1);
1365 int brfd, scalesame;
1379 n = (n * scalesame >> 8) << hpel;
1386 int refdist, scaleopp;
1403 n = (n * scaleopp >> 8) << hpel;
1410 int mv1,
int r_x,
int r_y,
uint8_t* is_intra,
1411 int pred_flag,
int dir)
1418 int mixedmv_pic, num_samefield = 0, num_oppfield = 0;
1419 int opposite, a_f, b_f, c_f;
1420 int16_t field_predA[2];
1421 int16_t field_predB[2];
1422 int16_t field_predC[2];
1423 int a_valid, b_valid, c_valid;
1424 int hybridmv_thresh, y_bias = 0;
1472 off = (s->
mb_x > 0) ? -1 : 1;
1487 b_valid = a_valid && (s->
mb_width > 1);
1488 c_valid = s->
mb_x || (n == 1 || n == 3);
1490 a_valid = a_valid && !is_intra[xy -
wrap];
1491 b_valid = b_valid && !is_intra[xy - wrap +
off];
1492 c_valid = c_valid && !is_intra[xy - 1];
1497 num_oppfield += a_f;
1498 num_samefield += 1 - a_f;
1499 field_predA[0] = A[0];
1500 field_predA[1] = A[1];
1502 field_predA[0] = field_predA[1] = 0;
1507 num_oppfield += b_f;
1508 num_samefield += 1 - b_f;
1509 field_predB[0] = B[0];
1510 field_predB[1] = B[1];
1512 field_predB[0] = field_predB[1] = 0;
1517 num_oppfield += c_f;
1518 num_samefield += 1 - c_f;
1519 field_predC[0] = C[0];
1520 field_predC[1] = C[1];
1522 field_predC[0] = field_predC[1] = 0;
1532 if (num_samefield <= num_oppfield)
1533 opposite = 1 - pred_flag;
1535 opposite = pred_flag;
1540 if (a_valid && !a_f) {
1541 field_predA[0] =
scaleforopp(v, field_predA[0], 0, dir);
1542 field_predA[1] =
scaleforopp(v, field_predA[1], 1, dir);
1544 if (b_valid && !b_f) {
1545 field_predB[0] =
scaleforopp(v, field_predB[0], 0, dir);
1546 field_predB[1] =
scaleforopp(v, field_predB[1], 1, dir);
1548 if (c_valid && !c_f) {
1549 field_predC[0] =
scaleforopp(v, field_predC[0], 0, dir);
1550 field_predC[1] =
scaleforopp(v, field_predC[1], 1, dir);
1555 if (a_valid && a_f) {
1556 field_predA[0] =
scaleforsame(v, n, field_predA[0], 0, dir);
1557 field_predA[1] =
scaleforsame(v, n, field_predA[1], 1, dir);
1559 if (b_valid && b_f) {
1560 field_predB[0] =
scaleforsame(v, n, field_predB[0], 0, dir);
1561 field_predB[1] =
scaleforsame(v, n, field_predB[1], 1, dir);
1563 if (c_valid && c_f) {
1564 field_predC[0] =
scaleforsame(v, n, field_predC[0], 0, dir);
1565 field_predC[1] =
scaleforsame(v, n, field_predC[1], 1, dir);
1572 px = field_predA[0];
1573 py = field_predA[1];
1574 }
else if (c_valid) {
1575 px = field_predC[0];
1576 py = field_predC[1];
1577 }
else if (b_valid) {
1578 px = field_predB[0];
1579 py = field_predB[1];
1585 if (num_samefield + num_oppfield > 1) {
1586 px =
mid_pred(field_predA[0], field_predB[0], field_predC[0]);
1587 py =
mid_pred(field_predA[1], field_predB[1], field_predC[1]);
1593 qx = (s->
mb_x << 6) + ((n == 1 || n == 3) ? 32 : 0);
1594 qy = (s->
mb_y << 6) + ((n == 2 || n == 3) ? 32 : 0);
1598 if (qx + px < -60) px = -60 - qx;
1599 if (qy + py < -60) py = -60 - qy;
1601 if (qx + px < -28) px = -28 - qx;
1602 if (qy + py < -28) py = -28 - qy;
1604 if (qx + px > X) px = X - qx;
1605 if (qy + py > Y) py = Y - qy;
1610 hybridmv_thresh = 32;
1611 if (a_valid && c_valid) {
1612 if (is_intra[xy - wrap])
1615 sum =
FFABS(px - field_predA[0]) +
FFABS(py - field_predA[1]);
1616 if (sum > hybridmv_thresh) {
1618 px = field_predA[0];
1619 py = field_predA[1];
1621 px = field_predC[0];
1622 py = field_predC[1];
1625 if (is_intra[xy - 1])
1628 sum =
FFABS(px - field_predC[0]) +
FFABS(py - field_predC[1]);
1629 if (sum > hybridmv_thresh) {
1631 px = field_predA[0];
1632 py = field_predA[1];
1634 px = field_predC[0];
1635 py = field_predC[1];
1664 int mvn,
int r_x,
int r_y,
uint8_t* is_intra,
int dir)
1668 int A[2],
B[2],
C[2];
1670 int a_valid = 0, b_valid = 0, c_valid = 0;
1671 int field_a, field_b, field_c;
1672 int total_valid, num_samefield, num_oppfield;
1673 int pos_c, pos_b, n_adj;
1701 off = ((n == 0) || (n == 1)) ? 1 : -1;
1703 if (s->
mb_x || (n == 1) || (n == 3)) {
1723 B[0] = B[1] = C[0] = C[1] = 0;
1731 n_adj = (n & 2) | (n & 1);
1785 total_valid = a_valid + b_valid + c_valid;
1787 if (!s->
mb_x && !(n == 1 || n == 3)) {
1792 B[0] = B[1] = C[0] = C[1] = 0;
1799 if (total_valid >= 2) {
1802 }
else if (total_valid) {
1803 if (a_valid) { px = A[0]; py = A[1]; }
1804 else if (b_valid) { px = B[0]; py = B[1]; }
1805 else if (c_valid) { px = C[0]; py = C[1]; }
1811 field_a = (A[1] & 4) ? 1 : 0;
1815 field_b = (B[1] & 4) ? 1 : 0;
1819 field_c = (C[1] & 4) ? 1 : 0;
1823 num_oppfield = field_a + field_b + field_c;
1824 num_samefield = total_valid - num_oppfield;
1825 if (total_valid == 3) {
1826 if ((num_samefield == 3) || (num_oppfield == 3)) {
1829 }
else if (num_samefield >= num_oppfield) {
1832 px = !field_a ? A[0] : B[0];
1833 py = !field_a ? A[1] : B[1];
1835 px = field_a ? A[0] : B[0];
1836 py = field_a ? A[1] : B[1];
1838 }
else if (total_valid == 2) {
1839 if (num_samefield >= num_oppfield) {
1840 if (!field_a && a_valid) {
1843 }
else if (!field_b && b_valid) {
1846 }
else if (c_valid) {
1851 if (field_a && a_valid) {
1854 }
else if (field_b && b_valid) {
1857 }
else if (c_valid) {
1862 }
else if (total_valid == 1) {
1863 px = (a_valid) ? A[0] : ((b_valid) ? B[0] : C[0]);
1864 py = (a_valid) ? A[1] : ((b_valid) ? B[1] : C[1]);
1878 }
else if (mvn == 2) {
1881 s->
mv[dir][n + 1][0] = s->
mv[dir][
n][0];
1882 s->
mv[dir][n + 1][1] = s->
mv[dir][
n][1];
1893 int dxy, mx, my, uvmx, uvmy, src_x, src_y, uvsrc_x, uvsrc_y;
1901 mx = s->
mv[1][0][0];
1902 my = s->
mv[1][0][1];
1903 uvmx = (mx + ((mx & 3) == 3)) >> 1;
1904 uvmy = (my + ((my & 3) == 3)) >> 1;
1911 uvmx = uvmx + ((uvmx < 0) ? -(uvmx & 1) : (uvmx & 1));
1912 uvmy = uvmy + ((uvmy < 0) ? -(uvmy & 1) : (uvmy & 1));
1918 src_x = s->
mb_x * 16 + (mx >> 2);
1919 src_y = s->
mb_y * 16 + (my >> 2);
1920 uvsrc_x = s->
mb_x * 8 + (uvmx >> 2);
1921 uvsrc_y = s->
mb_y * 8 + (uvmy >> 2);
1924 src_x = av_clip( src_x, -16, s->
mb_width * 16);
1925 src_y = av_clip( src_y, -16, s->
mb_height * 16);
1926 uvsrc_x = av_clip(uvsrc_x, -8, s->
mb_width * 8);
1927 uvsrc_y = av_clip(uvsrc_y, -8, s->
mb_height * 8);
1935 srcY += src_y * s->
linesize + src_x;
1952 || (
unsigned)(src_x - 1) > s->
h_edge_pos - (mx & 3) - 16 - 3
1953 || (
unsigned)(src_y - 1) > v_edge_pos - (my & 3) - 16 - 3) {
1963 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
1965 uvsrc_x, uvsrc_y, s->
h_edge_pos >> 1, v_edge_pos >> 1);
1974 for (j = 0; j < 17 + s->
mspel * 2; j++) {
1975 for (i = 0; i < 17 + s->
mspel * 2; i++)
1976 src[i] = ((src[i] - 128) >> 1) + 128;
1981 for (j = 0; j < 9; j++) {
1982 for (i = 0; i < 9; i++) {
1983 src[i] = ((src[i] - 128) >> 1) + 128;
1984 src2[i] = ((src2[i] - 128) >> 1) + 128;
1998 for (j = 0; j < 17 + s->
mspel * 2; j++) {
2000 for (i = 0; i < 17 + s->
mspel * 2; i++)
2001 src[i] = luty[f][src[i]];
2006 for (j = 0; j < 9; j++) {
2008 for (i = 0; i < 9; i++) {
2009 src[i] = lutuv[f][src[i]];
2010 src2[i] = lutuv[f][src2[i]];
2023 dxy = ((my & 3) << 2) | (mx & 3);
2030 dxy = (my & 2) | ((mx & 2) >> 1);
2040 uvmx = (uvmx & 3) << 1;
2041 uvmy = (uvmy & 3) << 1;
2055 #if B_FRACTION_DEN==256
2059 return 2 * ((value * n + 255) >> 9);
2060 return (value * n + 128) >> 8;
2073 int direct,
int mode)
2090 int direct,
int mvtype)
2125 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));
2126 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));
2127 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));
2128 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));
2144 if (!s->
mb_x) C[0] = C[1] = 0;
2153 }
else if (s->
mb_x) {
2163 qx = (s->
mb_x << 5);
2164 qy = (s->
mb_y << 5);
2167 if (qx + px < -28) px = -28 - qx;
2168 if (qy + py < -28) py = -28 - qy;
2169 if (qx + px > X) px = X - qx;
2170 if (qy + py > Y) py = Y - qy;
2172 qx = (s->
mb_x << 6);
2173 qy = (s->
mb_y << 6);
2176 if (qx + px < -60) px = -60 - qx;
2177 if (qy + py < -60) py = -60 - qy;
2178 if (qx + px > X) px = X - qx;
2179 if (qy + py > Y) py = Y - qy;
2184 if (is_intra[xy - wrap])
2197 if (is_intra[xy - 2])
2213 s->
mv[0][0][0] = ((px + dmv_x[0] + r_x) & ((r_x << 1) - 1)) - r_x;
2214 s->
mv[0][0][1] = ((py + dmv_y[0] + r_y) & ((r_y << 1) - 1)) - r_y;
2232 }
else if (s->
mb_x) {
2242 qx = (s->
mb_x << 5);
2243 qy = (s->
mb_y << 5);
2246 if (qx + px < -28) px = -28 - qx;
2247 if (qy + py < -28) py = -28 - qy;
2248 if (qx + px > X) px = X - qx;
2249 if (qy + py > Y) py = Y - qy;
2251 qx = (s->
mb_x << 6);
2252 qy = (s->
mb_y << 6);
2255 if (qx + px < -60) px = -60 - qx;
2256 if (qy + py < -60) py = -60 - qy;
2257 if (qx + px > X) px = X - qx;
2258 if (qy + py > Y) py = Y - qy;
2263 if (is_intra[xy - wrap])
2276 if (is_intra[xy - 2])
2293 s->
mv[1][0][0] = ((px + dmv_x[1] + r_x) & ((r_x << 1) - 1)) - r_x;
2294 s->
mv[1][0][1] = ((py + dmv_y[1] + r_y) & ((r_y << 1) - 1)) - r_y;
2309 int total_opp, k, f;
2324 f = (total_opp > 2) ? 1 : 0;
2326 s->
mv[0][0][0] = s->
mv[0][0][1] = 0;
2327 s->
mv[1][0][0] = s->
mv[1][0][1] = 0;
2331 for (k = 0; k < 4; k++) {
2348 if (n == 3 || mv1) {
2353 if (n == 3 || mv1) {
2369 int16_t **dc_val_ptr,
int *dir_ptr)
2373 static const uint16_t dcpred[32] = {
2374 -1, 1024, 512, 341, 256, 205, 171, 146, 128,
2375 114, 102, 93, 85, 79, 73, 68, 64,
2376 60, 57, 54, 51, 49, 47, 45, 43,
2377 41, 39, 38, 37, 35, 34, 33
2391 b = dc_val[ - 1 -
wrap];
2392 a = dc_val[ -
wrap];
2394 if (pq < 9 || !overlap) {
2397 b = a = dcpred[
scale];
2398 if (s->
mb_x == 0 && (n != 1 && n != 3))
2399 b = c = dcpred[
scale];
2404 if (s->
mb_x == 0 && (n != 1 && n != 3))
2408 if (abs(a - b) <= abs(b - c)) {
2417 *dc_val_ptr = &dc_val[0];
2434 int a_avail,
int c_avail,
2435 int16_t **dc_val_ptr,
int *dir_ptr)
2450 b = dc_val[ - 1 -
wrap];
2451 a = dc_val[ -
wrap];
2455 if (dqscale_index < 0)
2457 if (c_avail && (n != 1 && n != 3)) {
2462 if (a_avail && (n != 2 && n != 3)) {
2467 if (a_avail && c_avail && (n != 3)) {
2478 if (a_avail && c_avail) {
2479 if (abs(a - b) <= abs(b - c)) {
2486 }
else if (a_avail) {
2489 }
else if (c_avail) {
2498 *dc_val_ptr = &dc_val[0];
2547 int *
value,
int codingset)
2613 int coded,
int codingset)
2617 int dc_pred_dir = 0;
2620 int16_t *ac_val, *ac_val2;
2634 if (dcdiff == 119 ) {
2637 else if (v->
pq == 2) dcdiff =
get_bits(gb, 9);
2641 dcdiff = (dcdiff << 2) +
get_bits(gb, 2) - 3;
2642 else if (v->
pq == 2)
2643 dcdiff = (dcdiff << 1) +
get_bits1(gb) - 1;
2668 int last = 0, skip,
value;
2695 block[zz_table[i++]] =
value;
2701 for (k = 1; k < 8; k++)
2704 for (k = 1; k < 8; k++)
2709 for (k = 1; k < 8; k++) {
2715 for (k = 1; k < 64; k++)
2719 block[k] += (block[k] < 0) ? -v->
pq : v->
pq;
2733 memset(ac_val2, 0, 16 * 2);
2737 memcpy(ac_val2, ac_val, 8 * 2);
2741 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
2747 for (k = 1; k < 8; k++) {
2753 for (k = 1; k < 8; k++) {
2776 int coded,
int codingset,
int mquant)
2780 int dc_pred_dir = 0;
2782 int16_t *dc_val =
NULL;
2783 int16_t *ac_val, *ac_val2;
2802 if (dcdiff == 119 ) {
2804 if (mquant == 1) dcdiff =
get_bits(gb, 10);
2805 else if (mquant == 2) dcdiff =
get_bits(gb, 9);
2809 dcdiff = (dcdiff << 2) +
get_bits(gb, 2) - 3;
2810 else if (mquant == 2)
2811 dcdiff = (dcdiff << 1) +
get_bits1(gb) - 1;
2832 if (!a_avail && !c_avail)
2837 scale = mquant * 2 + ((mquant == v->
pq) ? v->
halfpq : 0);
2845 if ( dc_pred_dir && c_avail && mb_pos)
2847 if (!dc_pred_dir && a_avail && mb_pos >= s->
mb_stride)
2849 if ( dc_pred_dir && n == 1)
2851 if (!dc_pred_dir && n == 2)
2857 int last = 0, skip,
value;
2882 block[zz_table[i++]] =
value;
2888 if (q2 && q1 != q2) {
2889 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
2890 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
2895 for (k = 1; k < 8; k++)
2898 for (k = 1; k < 8; k++)
2903 for (k = 1; k < 8; k++)
2906 for (k = 1; k < 8; k++)
2912 for (k = 1; k < 8; k++) {
2918 for (k = 1; k < 64; k++)
2922 block[k] += (block[k] < 0) ? -mquant : mquant;
2925 if (use_pred) i = 63;
2929 memset(ac_val2, 0, 16 * 2);
2932 memcpy(ac_val2, ac_val, 8 * 2);
2933 if (q2 && q1 != q2) {
2934 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
2935 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
2938 for (k = 1; k < 8; k++)
2939 ac_val2[k] = (ac_val2[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
2944 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
2945 if (q2 && q1 != q2) {
2946 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
2947 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
2950 for (k = 1; k < 8; k++)
2951 ac_val2[k + 8] = (ac_val2[k + 8] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
2959 for (k = 1; k < 8; k++) {
2965 for (k = 1; k < 8; k++) {
2988 int coded,
int mquant,
int codingset)
2992 int dc_pred_dir = 0;
2994 int16_t *dc_val =
NULL;
2995 int16_t *ac_val, *ac_val2;
3006 mquant = (mquant < 1) ? 0 : ((mquant > 31) ? 31 : mquant);
3023 if (dcdiff == 119 ) {
3025 if (mquant == 1) dcdiff =
get_bits(gb, 10);
3026 else if (mquant == 2) dcdiff =
get_bits(gb, 9);
3030 dcdiff = (dcdiff << 2) +
get_bits(gb, 2) - 3;
3031 else if (mquant == 2)
3032 dcdiff = (dcdiff << 1) +
get_bits1(gb) - 1;
3039 dcdiff +=
vc1_pred_dc(&v->
s, v->
overlap, mquant, n, a_avail, c_avail, &dc_val, &dc_pred_dir);
3054 if (!a_avail) dc_pred_dir = 1;
3055 if (!c_avail) dc_pred_dir = 0;
3056 if (!a_avail && !c_avail) use_pred = 0;
3060 scale = mquant * 2 + v->
halfpq;
3068 if (dc_pred_dir && c_avail && mb_pos)
3070 if (!dc_pred_dir && a_avail && mb_pos >= s->
mb_stride)
3072 if ( dc_pred_dir && n == 1)
3074 if (!dc_pred_dir && n == 2)
3076 if (n == 3) q2 = q1;
3079 int last = 0, skip,
value;
3104 if (q2 && q1 != q2) {
3105 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3106 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3111 for (k = 1; k < 8; k++)
3114 for (k = 1; k < 8; k++)
3119 for (k = 1; k < 8; k++)
3122 for (k = 1; k < 8; k++)
3128 for (k = 1; k < 8; k++) {
3134 for (k = 1; k < 64; k++)
3138 block[k] += (block[k] < 0) ? -mquant : mquant;
3141 if (use_pred) i = 63;
3145 memset(ac_val2, 0, 16 * 2);
3148 memcpy(ac_val2, ac_val, 8 * 2);
3149 if (q2 && q1 != q2) {
3150 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3151 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3154 for (k = 1; k < 8; k++)
3155 ac_val2[k] = (ac_val2[k] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
3160 memcpy(ac_val2 + 8, ac_val + 8, 8 * 2);
3161 if (q2 && q1 != q2) {
3162 q1 = q1 * 2 + ((q1 == v->
pq) ? v->
halfpq : 0) - 1;
3163 q2 = q2 * 2 + ((q2 == v->
pq) ? v->
halfpq : 0) - 1;
3166 for (k = 1; k < 8; k++)
3167 ac_val2[k + 8] = (ac_val2[k + 8] * q2 *
ff_vc1_dqscale[q1 - 1] + 0x20000) >> 18;
3175 for (k = 1; k < 8; k++) {
3181 for (k = 1; k < 8; k++) {
3198 int mquant,
int ttmb,
int first_block,
3207 int ttblk = ttmb & 7;
3219 && ((v->
ttmbf || (ttmb != -1 && (ttmb & 8) && !first_block))
3229 scale = 2 * mquant + ((v->
pq == mquant) ? v->
halfpq : 0);
3254 block[idx] = value *
scale;
3256 block[idx] += (block[idx] < 0) ? -mquant : mquant;
3268 pat = ~subblkpat & 0xF;
3269 for (j = 0; j < 4; j++) {
3270 last = subblkpat & (1 << (3 - j));
3272 off = (j & 1) * 4 + (j & 2) * 16;
3284 block[idx +
off] += (block[idx +
off] < 0) ? -mquant : mquant;
3286 if (!(subblkpat & (1 << (3 - j))) && !skip_block) {
3295 pat = ~((subblkpat & 2) * 6 + (subblkpat & 1) * 3) & 0xF;
3296 for (j = 0; j < 2; j++) {
3297 last = subblkpat & (1 << (1 - j));
3309 block[idx] = value *
scale;
3311 block[idx] += (block[idx] < 0) ? -mquant : mquant;
3313 if (!(subblkpat & (1 << (1 - j))) && !skip_block) {
3322 pat = ~(subblkpat * 5) & 0xF;
3323 for (j = 0; j < 2; j++) {
3324 last = subblkpat & (1 << (1 - j));
3336 block[idx] = value *
scale;
3338 block[idx] += (block[idx] < 0) ? -mquant : mquant;
3340 if (!(subblkpat & (1 << (1 - j))) && !skip_block) {
3350 *ttmb_out |= ttblk << (n * 4);
3363 block_cbp = mb_cbp >> (block_num * 4), bottom_cbp,
3365 block_is_intra = mb_is_intra >> (block_num * 4), bottom_is_intra;
3369 if (block_num > 3) {
3370 dst = s->
dest[block_num - 3];
3372 dst = s->
dest[0] + (block_num & 1) * 8 + ((block_num & 2) * 4 - 8) * linesize;
3378 if (block_num > 3) {
3379 bottom_cbp = v->
cbp[s->
mb_x] >> (block_num * 4);
3380 bottom_is_intra = v->
is_intra[s->
mb_x] >> (block_num * 4);
3384 bottom_cbp = (block_num < 2) ? (mb_cbp >> ((block_num + 2) * 4))
3385 : (v->
cbp[s->
mb_x] >> ((block_num - 2) * 4));
3386 bottom_is_intra = (block_num < 2) ? (mb_is_intra >> ((block_num + 2) * 4))
3392 if (bottom_is_intra & 1 || block_is_intra & 1 ||
3393 mv[0][0] !=
mv[mv_stride][0] ||
mv[0][1] !=
mv[mv_stride][1]) {
3396 idx = ((bottom_cbp >> 2) | block_cbp) & 3;
3408 dst -= 4 * linesize;
3411 idx = (block_cbp | (block_cbp >> 2)) & 3;
3427 block_cbp = mb_cbp >> (block_num * 4), right_cbp,
3429 block_is_intra = mb_is_intra >> (block_num * 4), right_is_intra;
3433 if (block_num > 3) {
3434 dst = s->
dest[block_num - 3] - 8 * linesize;
3436 dst = s->
dest[0] + (block_num & 1) * 8 + ((block_num & 2) * 4 - 16) * linesize - 8;
3442 if (block_num > 3) {
3447 right_cbp = (block_num & 1) ? (v->
cbp[s->
mb_x - s->
mb_stride] >> ((block_num - 1) * 4))
3448 : (mb_cbp >> ((block_num + 1) * 4));
3450 : (mb_is_intra >> ((block_num + 1) * 4));
3453 if (block_is_intra & 1 || right_is_intra & 1 ||
mv[0][0] !=
mv[1][0] ||
mv[0][1] !=
mv[1][1]) {
3456 idx = ((right_cbp >> 1) | block_cbp) & 5;
3471 idx = (block_cbp | (block_cbp >> 1)) & 5;
3488 for (i = 0; i < 6; i++) {
3495 for (i = 0; i < 6; i++) {
3501 for (i = 0; i < 6; i++) {
3518 int ttmb = v->
ttfrm;
3520 int mb_has_coeffs = 1;
3524 int first_block = 1;
3526 int skipped, fourmv;
3527 int block_cbp = 0, pat, block_tt = 0, block_intra = 0;
3552 if (s->
mb_intra && !mb_has_coeffs) {
3556 }
else if (mb_has_coeffs) {
3572 for (i = 0; i < 6; i++) {
3575 val = ((cbp >> (5 - i)) & 1);
3576 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
3583 if (i == 1 || i == 3 || s->
mb_x)
3592 for (j = 0; j < 64; j++)
3593 s->
block[i][j] <<= 1;
3601 block_cbp |= 0xF << (i << 2);
3602 block_intra |= 1 << i;
3607 block_cbp |= pat << (i << 2);
3608 if (!v->
ttmbf && ttmb < 8)
3615 for (i = 0; i < 6; i++) {
3626 int intra_count = 0, coded_inter = 0;
3627 int is_intra[6], is_coded[6];
3630 for (i = 0; i < 6; i++) {
3631 val = ((cbp >> (5 - i)) & 1);
3646 is_coded[i] = mb_has_coeffs;
3649 is_intra[i] = (intra_count >= 3);
3656 coded_inter = !is_intra[i] & is_coded[i];
3660 if (!intra_count && !coded_inter)
3667 for (i = 0; i < 6; i++)
3680 if (!v->
ttmbf && coded_inter)
3682 for (i = 0; i < 6; i++) {
3684 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
3691 if (i == 1 || i == 3 || s->
mb_x)
3700 for (j = 0; j < 64; j++)
3701 s->
block[i][j] <<= 1;
3710 block_cbp |= 0xF << (i << 2);
3711 block_intra |= 1 << i;
3712 }
else if (is_coded[i]) {
3714 first_block, s->
dest[dst_idx] + off,
3718 block_cbp |= pat << (i << 2);
3719 if (!v->
ttmbf && ttmb < 8)
3727 for (i = 0; i < 6; i++) {
3731 for (i = 0; i < 4; i++) {
3757 int ttmb = v->
ttfrm;
3759 int mb_has_coeffs = 1;
3762 int first_block = 1;
3764 int skipped, fourmv = 0, twomv = 0;
3765 int block_cbp = 0, pat, block_tt = 0;
3766 int idx_mbmode = 0, mvbp;
3767 int stride_y, fieldtx;
3811 for (i = 0; i < 4; i++) {
3817 for (i = 0; i < 6; i++)
3830 for (i = 0; i < 6; i++) {
3833 val = ((cbp >> (5 - i)) & 1);
3838 if (i == 1 || i == 3 || s->
mb_x)
3847 off = (fieldtx) ? ((i & 1) * 8) + ((i & 2) >> 1) * s->
linesize : (i & 1) * 8 + 4 * (i & 2) * s->
linesize;
3869 for (i = 0; i < 6; i++)
3876 for (i = 0; i < 6; i++) {
3879 val = ((mvbp >> (3 - i)) & 1);
3885 }
else if (i == 4) {
3918 if (!v->
ttmbf && cbp)
3920 for (i = 0; i < 6; i++) {
3923 val = ((cbp >> (5 - i)) & 1);
3925 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
3927 off = (i & 4) ? 0 : ((i & 1) * 8 + ((i > 1) * s->
linesize));
3930 first_block, s->
dest[dst_idx] + off,
3933 block_cbp |= pat << (i << 2);
3934 if (!v->
ttmbf && ttmb < 8)
3942 for (i = 0; i < 6; i++) {
3968 int ttmb = v->
ttfrm;
3970 int mb_has_coeffs = 1;
3973 int first_block = 1;
3976 int block_cbp = 0, pat, block_tt = 0;
3982 if (idx_mbmode <= 1) {
3993 mb_has_coeffs = idx_mbmode & 1;
3997 for (i = 0; i < 6; i++) {
4001 val = ((cbp >> (5 - i)) & 1);
4005 if (i == 1 || i == 3 || s->
mb_x)
4013 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
4021 if (idx_mbmode <= 5) {
4022 dmv_x = dmv_y = pred_flag = 0;
4023 if (idx_mbmode & 1) {
4028 mb_has_coeffs = !(idx_mbmode & 2);
4031 for (i = 0; i < 6; i++) {
4033 dmv_x = dmv_y = pred_flag = 0;
4034 val = ((v->
fourmvbp >> (3 - i)) & 1);
4043 mb_has_coeffs = idx_mbmode & 1;
4051 if (!v->
ttmbf && cbp) {
4055 for (i = 0; i < 6; i++) {
4058 val = ((cbp >> (5 - i)) & 1);
4059 off = (i & 4) ? 0 : (i & 1) * 8 + (i & 2) * 4 * s->
linesize;
4062 first_block, s->
dest[dst_idx] + off,
4066 block_cbp |= pat << (i << 2);
4067 if (!v->
ttmbf && ttmb < 8) ttmb = -1;
4087 int ttmb = v->
ttfrm;
4088 int mb_has_coeffs = 0;
4091 int first_block = 1;
4093 int skipped, direct;
4094 int dmv_x[2], dmv_y[2];
4109 dmv_x[0] = dmv_x[1] = dmv_y[0] = dmv_y[1] = 0;
4110 for (i = 0; i < 6; i++) {
4119 dmv_x[1] = dmv_x[0];
4120 dmv_y[1] = dmv_y[0];
4133 dmv_x[0] = dmv_y[0] = 0;
4137 for (i = 0; i < 6; i++)
4144 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4154 dmv_x[0] = dmv_y[0] = dmv_x[1] = dmv_y[1] = 0;
4156 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4158 if (!mb_has_coeffs && !s->
mb_intra) {
4161 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4164 if (s->
mb_intra && !mb_has_coeffs) {
4173 if (!mb_has_coeffs) {
4176 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4182 vc1_b_mc(v, dmv_x, dmv_y, direct, bmvtype);
4194 for (i = 0; i < 6; i++) {
4197 val = ((cbp >> (5 - i)) & 1);
4198 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
4205 if (i == 1 || i == 3 || s->
mb_x)
4214 for (j = 0; j < 64; j++)
4215 s->
block[i][j] <<= 1;
4219 first_block, s->
dest[dst_idx] + off,
4222 if (!v->
ttmbf && ttmb < 8)
4239 int ttmb = v->
ttfrm;
4240 int mb_has_coeffs = 0;
4242 int first_block = 1;
4245 int dmv_x[2], dmv_y[2], pred_flag[2];
4253 if (idx_mbmode <= 1) {
4264 mb_has_coeffs = idx_mbmode & 1;
4268 for (i = 0; i < 6; i++) {
4271 val = ((cbp >> (5 - i)) & 1);
4276 if (i == 1 || i == 3 || s->
mb_x)
4285 for (j = 0; j < 64; j++)
4286 s->
block[i][j] <<= 1;
4287 off = (i & 4) ? 0 : ((i & 1) * 8 + (i & 2) * 4 * s->
linesize);
4299 if (idx_mbmode <= 5) {
4301 dmv_x[0] = dmv_x[1] = dmv_y[0] = dmv_y[1] = 0;
4302 pred_flag[0] = pred_flag[1] = 0;