falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
88451 Commits
32 Branches
312MB
Tree: 4ca1bcdfca
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '4ca1bcdfca'
${ noResults }
FFmpeg/libavcodec/vc1_pred.c

942 lines
37KB
Raw Blame History 

  1. /*

  2.  * VC-1 and WMV3 decoder

  3.  * Copyright (c) 2011 Mashiat Sarker Shakkhar

  4.  * Copyright (c) 2006-2007 Konstantin Shishkov

  5.  * Partly based on vc9.c (c) 2005 Anonymous, Alex Beregszaszi, Michael Niedermayer

  6.  *

  7.  * This file is part of FFmpeg.

  8.  *

  9.  * FFmpeg is free software; you can redistribute it and/or

  10.  * modify it under the terms of the GNU Lesser General Public

  11.  * License as published by the Free Software Foundation; either

  12.  * version 2.1 of the License, or (at your option) any later version.

  13.  *

  14.  * FFmpeg is distributed in the hope that it will be useful,

  15.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  16.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  17.  * Lesser General Public License for more details.

  18.  *

  19.  * You should have received a copy of the GNU Lesser General Public

  20.  * License along with FFmpeg; if not, write to the Free Software

  21.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  22.  */

  23. 

  24. /**

  25.  * @file

  26.  * VC-1 and WMV3 block decoding routines

  27.  */

  28. 

  29. #include "mathops.h"

  30. #include "mpegutils.h"

  31. #include "mpegvideo.h"

  32. #include "vc1.h"

  33. #include "vc1_pred.h"

  34. #include "vc1data.h"

  35. 

  36. static av_always_inline int scaleforsame_x(VC1Context *v, int n /* MV */, int dir)

  37. {

  38.     int scaledvalue, refdist;

  39.     int scalesame1, scalesame2;

  40.     int scalezone1_x, zone1offset_x;

  41.     int table_index = dir ^ v->second_field;

  42. 

  43.     if (v->s.pict_type != AV_PICTURE_TYPE_B)

  44.         refdist = v->refdist;

  45.     else

  46.         refdist = dir ? v->brfd : v->frfd;

  47.     if (refdist > 3)

  48.         refdist = 3;

  49.     scalesame1    = ff_vc1_field_mvpred_scales[table_index][1][refdist];

  50.     scalesame2    = ff_vc1_field_mvpred_scales[table_index][2][refdist];

  51.     scalezone1_x  = ff_vc1_field_mvpred_scales[table_index][3][refdist];

  52.     zone1offset_x = ff_vc1_field_mvpred_scales[table_index][5][refdist];

  53. 

  54.     if (FFABS(n) > 255)

  55.         scaledvalue = n;

  56.     else {

  57.         if (FFABS(n) < scalezone1_x)

  58.             scaledvalue = (n * scalesame1) >> 8;

  59.         else {

  60.             if (n < 0)

  61.                 scaledvalue = ((n * scalesame2) >> 8) - zone1offset_x;

  62.             else

  63.                 scaledvalue = ((n * scalesame2) >> 8) + zone1offset_x;

  64.         }

  65.     }

  66.     return av_clip(scaledvalue, -v->range_x, v->range_x - 1);

  67. }

  68. 

  69. static av_always_inline int scaleforsame_y(VC1Context *v, int i, int n /* MV */, int dir)

  70. {

  71.     int scaledvalue, refdist;

  72.     int scalesame1, scalesame2;

  73.     int scalezone1_y, zone1offset_y;

  74.     int table_index = dir ^ v->second_field;

  75. 

  76.     if (v->s.pict_type != AV_PICTURE_TYPE_B)

  77.         refdist = v->refdist;

  78.     else

  79.         refdist = dir ? v->brfd : v->frfd;

  80.     if (refdist > 3)

  81.         refdist = 3;

  82.     scalesame1    = ff_vc1_field_mvpred_scales[table_index][1][refdist];

  83.     scalesame2    = ff_vc1_field_mvpred_scales[table_index][2][refdist];

  84.     scalezone1_y  = ff_vc1_field_mvpred_scales[table_index][4][refdist];

  85.     zone1offset_y = ff_vc1_field_mvpred_scales[table_index][6][refdist];

  86. 

  87.     if (FFABS(n) > 63)

  88.         scaledvalue = n;

  89.     else {

  90.         if (FFABS(n) < scalezone1_y)

  91.             scaledvalue = (n * scalesame1) >> 8;

  92.         else {

  93.             if (n < 0)

  94.                 scaledvalue = ((n * scalesame2) >> 8) - zone1offset_y;

  95.             else

  96.                 scaledvalue = ((n * scalesame2) >> 8) + zone1offset_y;

  97.         }

  98.     }

  99. 

  100.     if (v->cur_field_type && !v->ref_field_type[dir])

  101.         return av_clip(scaledvalue, -v->range_y / 2 + 1, v->range_y / 2);

  102.     else

  103.         return av_clip(scaledvalue, -v->range_y / 2, v->range_y / 2 - 1);

  104. }

  105. 

  106. static av_always_inline int scaleforopp_x(VC1Context *v, int n /* MV */)

  107. {

  108.     int scalezone1_x, zone1offset_x;

  109.     int scaleopp1, scaleopp2, brfd;

  110.     int scaledvalue;

  111. 

  112.     brfd = FFMIN(v->brfd, 3);

  113.     scalezone1_x  = ff_vc1_b_field_mvpred_scales[3][brfd];

  114.     zone1offset_x = ff_vc1_b_field_mvpred_scales[5][brfd];

  115.     scaleopp1     = ff_vc1_b_field_mvpred_scales[1][brfd];

  116.     scaleopp2     = ff_vc1_b_field_mvpred_scales[2][brfd];

  117. 

  118.     if (FFABS(n) > 255)

  119.         scaledvalue = n;

  120.     else {

  121.         if (FFABS(n) < scalezone1_x)

  122.             scaledvalue = (n * scaleopp1) >> 8;

  123.         else {

  124.             if (n < 0)

  125.                 scaledvalue = ((n * scaleopp2) >> 8) - zone1offset_x;

  126.             else

  127.                 scaledvalue = ((n * scaleopp2) >> 8) + zone1offset_x;

  128.         }

  129.     }

  130.     return av_clip(scaledvalue, -v->range_x, v->range_x - 1);

  131. }

  132. 

  133. static av_always_inline int scaleforopp_y(VC1Context *v, int n /* MV */, int dir)

  134. {

  135.     int scalezone1_y, zone1offset_y;

  136.     int scaleopp1, scaleopp2, brfd;

  137.     int scaledvalue;

  138. 

  139.     brfd = FFMIN(v->brfd, 3);

  140.     scalezone1_y  = ff_vc1_b_field_mvpred_scales[4][brfd];

  141.     zone1offset_y = ff_vc1_b_field_mvpred_scales[6][brfd];

  142.     scaleopp1     = ff_vc1_b_field_mvpred_scales[1][brfd];

  143.     scaleopp2     = ff_vc1_b_field_mvpred_scales[2][brfd];

  144. 

  145.     if (FFABS(n) > 63)

  146.         scaledvalue = n;

  147.     else {

  148.         if (FFABS(n) < scalezone1_y)

  149.             scaledvalue = (n * scaleopp1) >> 8;

  150.         else {

  151.             if (n < 0)

  152.                 scaledvalue = ((n * scaleopp2) >> 8) - zone1offset_y;

  153.             else

  154.                 scaledvalue = ((n * scaleopp2) >> 8) + zone1offset_y;

  155.         }

  156.     }

  157.     if (v->cur_field_type && !v->ref_field_type[dir]) {

  158.         return av_clip(scaledvalue, -v->range_y / 2 + 1, v->range_y / 2);

  159.     } else {

  160.         return av_clip(scaledvalue, -v->range_y / 2, v->range_y / 2 - 1);

  161.     }

  162. }

  163. 

  164. static av_always_inline int scaleforsame(VC1Context *v, int i, int n /* MV */,

  165.                                          int dim, int dir)

  166. {

  167.     int brfd, scalesame;

  168.     int hpel = 1 - v->s.quarter_sample;

  169. 

  170.     n >>= hpel;

  171.     if (v->s.pict_type != AV_PICTURE_TYPE_B || v->second_field || !dir) {

  172.         if (dim)

  173.             n = scaleforsame_y(v, i, n, dir) * (1 << hpel);

  174.         else

  175.             n = scaleforsame_x(v, n, dir) * (1 << hpel);

  176.         return n;

  177.     }

  178.     brfd      = FFMIN(v->brfd, 3);

  179.     scalesame = ff_vc1_b_field_mvpred_scales[0][brfd];

  180. 

  181.     n = (n * scalesame >> 8) * (1 << hpel);

  182.     return n;

  183. }

  184. 

  185. static av_always_inline int scaleforopp(VC1Context *v, int n /* MV */,

  186.                                         int dim, int dir)

  187. {

  188.     int refdist, scaleopp;

  189.     int hpel = 1 - v->s.quarter_sample;

  190. 

  191.     n >>= hpel;

  192.     if (v->s.pict_type == AV_PICTURE_TYPE_B && !v->second_field && dir == 1) {

  193.         if (dim)

  194.             n = scaleforopp_y(v, n, dir) * (1 << hpel);

  195.         else

  196.             n = scaleforopp_x(v, n)      * (1 << hpel);

  197.         return n;

  198.     }

  199.     if (v->s.pict_type != AV_PICTURE_TYPE_B)

  200.         refdist = v->refdist;

  201.     else

  202.         refdist = dir ? v->brfd : v->frfd;

  203.     refdist = FFMIN(refdist, 3);

  204.     scaleopp = ff_vc1_field_mvpred_scales[dir ^ v->second_field][0][refdist];

  205. 

  206.     n = (n * scaleopp >> 8) * (1 << hpel);

  207.     return n;

  208. }

  209. 

  210. /** Predict and set motion vector

  211.  */

  212. void ff_vc1_pred_mv(VC1Context *v, int n, int dmv_x, int dmv_y,

  213.                     int mv1, int r_x, int r_y, uint8_t* is_intra,

  214.                     int pred_flag, int dir)

  215. {

  216.     MpegEncContext *s = &v->s;

  217.     int xy, wrap, off = 0;

  218.     int16_t *A, *B, *C;

  219.     int px, py;

  220.     int sum;

  221.     int mixedmv_pic, num_samefield = 0, num_oppfield = 0;

  222.     int opposite, a_f, b_f, c_f;

  223.     int16_t field_predA[2];

  224.     int16_t field_predB[2];

  225.     int16_t field_predC[2];

  226.     int a_valid, b_valid, c_valid;

  227.     int hybridmv_thresh, y_bias = 0;

  228. 

  229.     if (v->mv_mode == MV_PMODE_MIXED_MV ||

  230.         ((v->mv_mode == MV_PMODE_INTENSITY_COMP) && (v->mv_mode2 == MV_PMODE_MIXED_MV)))

  231.         mixedmv_pic = 1;

  232.     else

  233.         mixedmv_pic = 0;

  234.     /* scale MV difference to be quad-pel */

  235.     if (!s->quarter_sample) {

  236.         dmv_x *= 2;

  237.         dmv_y *= 2;

  238.     }

  239. 

  240.     wrap = s->b8_stride;

  241.     xy   = s->block_index[n];

  242. 

  243.     if (s->mb_intra) {

  244.         s->mv[0][n][0] = s->current_picture.motion_val[0][xy + v->blocks_off][0] = 0;

  245.         s->mv[0][n][1] = s->current_picture.motion_val[0][xy + v->blocks_off][1] = 0;

  246.         s->current_picture.motion_val[1][xy + v->blocks_off][0] = 0;

  247.         s->current_picture.motion_val[1][xy + v->blocks_off][1] = 0;

  248.         if (mv1) { /* duplicate motion data for 1-MV block */

  249.             s->current_picture.motion_val[0][xy + 1 + v->blocks_off][0]        = 0;

  250.             s->current_picture.motion_val[0][xy + 1 + v->blocks_off][1]        = 0;

  251.             s->current_picture.motion_val[0][xy + wrap + v->blocks_off][0]     = 0;

  252.             s->current_picture.motion_val[0][xy + wrap + v->blocks_off][1]     = 0;

  253.             s->current_picture.motion_val[0][xy + wrap + 1 + v->blocks_off][0] = 0;

  254.             s->current_picture.motion_val[0][xy + wrap + 1 + v->blocks_off][1] = 0;

  255.             v->luma_mv[s->mb_x][0] = v->luma_mv[s->mb_x][1] = 0;

  256.             s->current_picture.motion_val[1][xy + 1 + v->blocks_off][0]        = 0;

  257.             s->current_picture.motion_val[1][xy + 1 + v->blocks_off][1]        = 0;

  258.             s->current_picture.motion_val[1][xy + wrap][0]                     = 0;

  259.             s->current_picture.motion_val[1][xy + wrap + v->blocks_off][1]     = 0;

  260.             s->current_picture.motion_val[1][xy + wrap + 1 + v->blocks_off][0] = 0;

  261.             s->current_picture.motion_val[1][xy + wrap + 1 + v->blocks_off][1] = 0;

  262.         }

  263.         return;

  264.     }

  265. 

  266.     C = s->current_picture.motion_val[dir][xy -    1 + v->blocks_off];

  267.     A = s->current_picture.motion_val[dir][xy - wrap + v->blocks_off];

  268.     if (mv1) {

  269.         if (v->field_mode && mixedmv_pic)

  270.             off = (s->mb_x == (s->mb_width - 1)) ? -2 : 2;

  271.         else

  272.             off = (s->mb_x == (s->mb_width - 1)) ? -1 : 2;

  273.     } else {

  274.         //in 4-MV mode different blocks have different B predictor position

  275.         switch (n) {

  276.         case 0:

  277.             off = (s->mb_x > 0) ? -1 : 1;

  278.             break;

  279.         case 1:

  280.             off = (s->mb_x == (s->mb_width - 1)) ? -1 : 1;

  281.             break;

  282.         case 2:

  283.             off = 1;

  284.             break;

  285.         case 3:

  286.             off = -1;

  287.         }

  288.     }

  289.     B = s->current_picture.motion_val[dir][xy - wrap + off + v->blocks_off];

  290. 

  291.     a_valid = !s->first_slice_line || (n == 2 || n == 3);

  292.     b_valid = a_valid && (s->mb_width > 1);

  293.     c_valid = s->mb_x || (n == 1 || n == 3);

  294.     if (v->field_mode) {

  295.         a_valid = a_valid && !is_intra[xy - wrap];

  296.         b_valid = b_valid && !is_intra[xy - wrap + off];

  297.         c_valid = c_valid && !is_intra[xy - 1];

  298.     }

  299. 

  300.     if (a_valid) {

  301.         a_f = v->mv_f[dir][xy - wrap + v->blocks_off];

  302.         num_oppfield  += a_f;

  303.         num_samefield += 1 - a_f;

  304.         field_predA[0] = A[0];

  305.         field_predA[1] = A[1];

  306.     } else {

  307.         field_predA[0] = field_predA[1] = 0;

  308.         a_f = 0;

  309.     }

  310.     if (b_valid) {

  311.         b_f = v->mv_f[dir][xy - wrap + off + v->blocks_off];

  312.         num_oppfield  += b_f;

  313.         num_samefield += 1 - b_f;

  314.         field_predB[0] = B[0];

  315.         field_predB[1] = B[1];

  316.     } else {

  317.         field_predB[0] = field_predB[1] = 0;

  318.         b_f = 0;

  319.     }

  320.     if (c_valid) {

  321.         c_f = v->mv_f[dir][xy - 1 + v->blocks_off];

  322.         num_oppfield  += c_f;

  323.         num_samefield += 1 - c_f;

  324.         field_predC[0] = C[0];

  325.         field_predC[1] = C[1];

  326.     } else {

  327.         field_predC[0] = field_predC[1] = 0;

  328.         c_f = 0;

  329.     }

  330. 

  331.     if (v->field_mode) {

  332.         if (!v->numref)

  333.             // REFFIELD determines if the last field or the second-last field is

  334.             // to be used as reference

  335.             opposite = 1 - v->reffield;

  336.         else {

  337.             if (num_samefield <= num_oppfield)

  338.                 opposite = 1 - pred_flag;

  339.             else

  340.                 opposite = pred_flag;

  341.         }

  342.     } else

  343.         opposite = 0;

  344.     if (opposite) {

  345.         if (a_valid && !a_f) {

  346.             field_predA[0] = scaleforopp(v, field_predA[0], 0, dir);

  347.             field_predA[1] = scaleforopp(v, field_predA[1], 1, dir);

  348.         }

  349.         if (b_valid && !b_f) {

  350.             field_predB[0] = scaleforopp(v, field_predB[0], 0, dir);

  351.             field_predB[1] = scaleforopp(v, field_predB[1], 1, dir);

  352.         }

  353.         if (c_valid && !c_f) {

  354.             field_predC[0] = scaleforopp(v, field_predC[0], 0, dir);

  355.             field_predC[1] = scaleforopp(v, field_predC[1], 1, dir);

  356.         }

  357.         v->mv_f[dir][xy + v->blocks_off] = 1;

  358.         v->ref_field_type[dir] = !v->cur_field_type;

  359.     } else {

  360.         if (a_valid && a_f) {

  361.             field_predA[0] = scaleforsame(v, n, field_predA[0], 0, dir);

  362.             field_predA[1] = scaleforsame(v, n, field_predA[1], 1, dir);

  363.         }

  364.         if (b_valid && b_f) {

  365.             field_predB[0] = scaleforsame(v, n, field_predB[0], 0, dir);

  366.             field_predB[1] = scaleforsame(v, n, field_predB[1], 1, dir);

  367.         }

  368.         if (c_valid && c_f) {

  369.             field_predC[0] = scaleforsame(v, n, field_predC[0], 0, dir);

  370.             field_predC[1] = scaleforsame(v, n, field_predC[1], 1, dir);

  371.         }

  372.         v->mv_f[dir][xy + v->blocks_off] = 0;

  373.         v->ref_field_type[dir] = v->cur_field_type;

  374.     }

  375. 

  376.     if (a_valid) {

  377.         px = field_predA[0];

  378.         py = field_predA[1];

  379.     } else if (c_valid) {

  380.         px = field_predC[0];

  381.         py = field_predC[1];

  382.     } else if (b_valid) {

  383.         px = field_predB[0];

  384.         py = field_predB[1];

  385.     } else {

  386.         px = 0;

  387.         py = 0;

  388.     }

  389. 

  390.     if (num_samefield + num_oppfield > 1) {

  391.         px = mid_pred(field_predA[0], field_predB[0], field_predC[0]);

  392.         py = mid_pred(field_predA[1], field_predB[1], field_predC[1]);

  393.     }

  394. 

  395.     /* Pullback MV as specified in 8.3.5.3.4 */

  396.     if (!v->field_mode) {

  397.         int qx, qy, X, Y;

  398.         int MV = mv1 ? -60 : -28;

  399.         qx = (s->mb_x << 6) + ((n == 1 || n == 3) ? 32 : 0);

  400.         qy = (s->mb_y << 6) + ((n == 2 || n == 3) ? 32 : 0);

  401.         X  = (s->mb_width  << 6) - 4;

  402.         Y  = (s->mb_height << 6) - 4;

  403.         if (qx + px < MV) px = MV - qx;

  404.         if (qy + py < MV) py = MV - qy;

  405.         if (qx + px > X) px = X - qx;

  406.         if (qy + py > Y) py = Y - qy;

  407.     }

  408. 

  409.     if (!v->field_mode || s->pict_type != AV_PICTURE_TYPE_B) {

  410.         /* Calculate hybrid prediction as specified in 8.3.5.3.5 (also 10.3.5.4.3.5) */

  411.         hybridmv_thresh = 32;

  412.         if (a_valid && c_valid) {

  413.             if (is_intra[xy - wrap])

  414.                 sum = FFABS(px) + FFABS(py);

  415.             else

  416.                 sum = FFABS(px - field_predA[0]) + FFABS(py - field_predA[1]);

  417.             if (sum > hybridmv_thresh) {

  418.                 if (get_bits1(&s->gb)) {     // read HYBRIDPRED bit

  419.                     px = field_predA[0];

  420.                     py = field_predA[1];

  421.                 } else {

  422.                     px = field_predC[0];

  423.                     py = field_predC[1];

  424.                 }

  425.             } else {

  426.                 if (is_intra[xy - 1])

  427.                     sum = FFABS(px) + FFABS(py);

  428.                 else

  429.                     sum = FFABS(px - field_predC[0]) + FFABS(py - field_predC[1]);

  430.                 if (sum > hybridmv_thresh) {

  431.                     if (get_bits1(&s->gb)) {

  432.                         px = field_predA[0];

  433.                         py = field_predA[1];

  434.                     } else {

  435.                         px = field_predC[0];

  436.                         py = field_predC[1];

  437.                     }

  438.                 }

  439.             }

  440.         }

  441.     }

  442. 

  443.     if (v->field_mode && v->numref)

  444.         r_y >>= 1;

  445.     if (v->field_mode && v->cur_field_type && v->ref_field_type[dir] == 0)

  446.         y_bias = 1;

  447.     /* store MV using signed modulus of MV range defined in 4.11 */

  448.     s->mv[dir][n][0] = s->current_picture.motion_val[dir][xy + v->blocks_off][0] = ((px + dmv_x + r_x) & ((r_x << 1) - 1)) - r_x;

  449.     s->mv[dir][n][1] = s->current_picture.motion_val[dir][xy + v->blocks_off][1] = ((py + dmv_y + r_y - y_bias) & ((r_y << 1) - 1)) - r_y + y_bias;

  450.     if (mv1) { /* duplicate motion data for 1-MV block */

  451.         s->current_picture.motion_val[dir][xy +    1 +     v->blocks_off][0] = s->current_picture.motion_val[dir][xy + v->blocks_off][0];

  452.         s->current_picture.motion_val[dir][xy +    1 +     v->blocks_off][1] = s->current_picture.motion_val[dir][xy + v->blocks_off][1];

  453.         s->current_picture.motion_val[dir][xy + wrap +     v->blocks_off][0] = s->current_picture.motion_val[dir][xy + v->blocks_off][0];

  454.         s->current_picture.motion_val[dir][xy + wrap +     v->blocks_off][1] = s->current_picture.motion_val[dir][xy + v->blocks_off][1];

  455.         s->current_picture.motion_val[dir][xy + wrap + 1 + v->blocks_off][0] = s->current_picture.motion_val[dir][xy + v->blocks_off][0];

  456.         s->current_picture.motion_val[dir][xy + wrap + 1 + v->blocks_off][1] = s->current_picture.motion_val[dir][xy + v->blocks_off][1];

  457.         v->mv_f[dir][xy +    1 + v->blocks_off] = v->mv_f[dir][xy +            v->blocks_off];

  458.         v->mv_f[dir][xy + wrap + v->blocks_off] = v->mv_f[dir][xy + wrap + 1 + v->blocks_off] = v->mv_f[dir][xy + v->blocks_off];

  459.     }

  460. }

  461. 

  462. /** Predict and set motion vector for interlaced frame picture MBs

  463.  */

  464. void ff_vc1_pred_mv_intfr(VC1Context *v, int n, int dmv_x, int dmv_y,

  465.                           int mvn, int r_x, int r_y, uint8_t* is_intra, int dir)

  466. {

  467.     MpegEncContext *s = &v->s;

  468.     int xy, wrap, off = 0;

  469.     int A[2], B[2], C[2];

  470.     int px = 0, py = 0;

  471.     int a_valid = 0, b_valid = 0, c_valid = 0;

  472.     int field_a, field_b, field_c; // 0: same, 1: opposite

  473.     int total_valid, num_samefield, num_oppfield;

  474.     int pos_c, pos_b, n_adj;

  475. 

  476.     wrap = s->b8_stride;

  477.     xy = s->block_index[n];

  478. 

  479.     if (s->mb_intra) {

  480.         s->mv[0][n][0] = s->current_picture.motion_val[0][xy][0] = 0;

  481.         s->mv[0][n][1] = s->current_picture.motion_val[0][xy][1] = 0;

  482.         s->current_picture.motion_val[1][xy][0] = 0;

  483.         s->current_picture.motion_val[1][xy][1] = 0;

  484.         if (mvn == 1) { /* duplicate motion data for 1-MV block */

  485.             s->current_picture.motion_val[0][xy + 1][0]        = 0;

  486.             s->current_picture.motion_val[0][xy + 1][1]        = 0;

  487.             s->current_picture.motion_val[0][xy + wrap][0]     = 0;

  488.             s->current_picture.motion_val[0][xy + wrap][1]     = 0;

  489.             s->current_picture.motion_val[0][xy + wrap + 1][0] = 0;

  490.             s->current_picture.motion_val[0][xy + wrap + 1][1] = 0;

  491.             v->luma_mv[s->mb_x][0] = v->luma_mv[s->mb_x][1] = 0;

  492.             s->current_picture.motion_val[1][xy + 1][0]        = 0;

  493.             s->current_picture.motion_val[1][xy + 1][1]        = 0;

  494.             s->current_picture.motion_val[1][xy + wrap][0]     = 0;

  495.             s->current_picture.motion_val[1][xy + wrap][1]     = 0;

  496.             s->current_picture.motion_val[1][xy + wrap + 1][0] = 0;

  497.             s->current_picture.motion_val[1][xy + wrap + 1][1] = 0;

  498.         }

  499.         return;

  500.     }

  501. 

  502.     off = ((n == 0) || (n == 1)) ? 1 : -1;

  503.     /* predict A */

  504.     if (s->mb_x || (n == 1) || (n == 3)) {

  505.         if ((v->blk_mv_type[xy]) // current block (MB) has a field MV

  506.             || (!v->blk_mv_type[xy] && !v->blk_mv_type[xy - 1])) { // or both have frame MV

  507.             A[0] = s->current_picture.motion_val[dir][xy - 1][0];

  508.             A[1] = s->current_picture.motion_val[dir][xy - 1][1];

  509.             a_valid = 1;

  510.         } else { // current block has frame mv and cand. has field MV (so average)

  511.             A[0] = (s->current_picture.motion_val[dir][xy - 1][0]

  512.                     + s->current_picture.motion_val[dir][xy - 1 + off * wrap][0] + 1) >> 1;

  513.             A[1] = (s->current_picture.motion_val[dir][xy - 1][1]

  514.                     + s->current_picture.motion_val[dir][xy - 1 + off * wrap][1] + 1) >> 1;

  515.             a_valid = 1;

  516.         }

  517.         if (!(n & 1) && v->is_intra[s->mb_x - 1]) {

  518.             a_valid = 0;

  519.             A[0] = A[1] = 0;

  520.         }

  521.     } else

  522.         A[0] = A[1] = 0;

  523.     /* Predict B and C */

  524.     B[0] = B[1] = C[0] = C[1] = 0;

  525.     if (n == 0 || n == 1 || v->blk_mv_type[xy]) {

  526.         if (!s->first_slice_line) {

  527.             if (!v->is_intra[s->mb_x - s->mb_stride]) {

  528.                 b_valid = 1;

  529.                 n_adj   = n | 2;

  530.                 pos_b   = s->block_index[n_adj] - 2 * wrap;

  531.                 if (v->blk_mv_type[pos_b] && v->blk_mv_type[xy]) {

  532.                     n_adj = (n & 2) | (n & 1);

  533.                 }

  534.                 B[0] = s->current_picture.motion_val[dir][s->block_index[n_adj] - 2 * wrap][0];

  535.                 B[1] = s->current_picture.motion_val[dir][s->block_index[n_adj] - 2 * wrap][1];

  536.                 if (v->blk_mv_type[pos_b] && !v->blk_mv_type[xy]) {

  537.                     B[0] = (B[0] + s->current_picture.motion_val[dir][s->block_index[n_adj ^ 2] - 2 * wrap][0] + 1) >> 1;

  538.                     B[1] = (B[1] + s->current_picture.motion_val[dir][s->block_index[n_adj ^ 2] - 2 * wrap][1] + 1) >> 1;

  539.                 }

  540.             }

  541.             if (s->mb_width > 1) {

  542.                 if (!v->is_intra[s->mb_x - s->mb_stride + 1]) {

  543.                     c_valid = 1;

  544.                     n_adj   = 2;

  545.                     pos_c   = s->block_index[2] - 2 * wrap + 2;

  546.                     if (v->blk_mv_type[pos_c] && v->blk_mv_type[xy]) {

  547.                         n_adj = n & 2;

  548.                     }

  549.                     C[0] = s->current_picture.motion_val[dir][s->block_index[n_adj] - 2 * wrap + 2][0];

  550.                     C[1] = s->current_picture.motion_val[dir][s->block_index[n_adj] - 2 * wrap + 2][1];

  551.                     if (v->blk_mv_type[pos_c] && !v->blk_mv_type[xy]) {

  552.                         C[0] = (1 + C[0] + (s->current_picture.motion_val[dir][s->block_index[n_adj ^ 2] - 2 * wrap + 2][0])) >> 1;

  553.                         C[1] = (1 + C[1] + (s->current_picture.motion_val[dir][s->block_index[n_adj ^ 2] - 2 * wrap + 2][1])) >> 1;

  554.                     }

  555.                     if (s->mb_x == s->mb_width - 1) {

  556.                         if (!v->is_intra[s->mb_x - s->mb_stride - 1]) {

  557.                             c_valid = 1;

  558.                             n_adj   = 3;

  559.                             pos_c   = s->block_index[3] - 2 * wrap - 2;

  560.                             if (v->blk_mv_type[pos_c] && v->blk_mv_type[xy]) {

  561.                                 n_adj = n | 1;

  562.                             }

  563.                             C[0] = s->current_picture.motion_val[dir][s->block_index[n_adj] - 2 * wrap - 2][0];

  564.                             C[1] = s->current_picture.motion_val[dir][s->block_index[n_adj] - 2 * wrap - 2][1];

  565.                             if (v->blk_mv_type[pos_c] && !v->blk_mv_type[xy]) {

  566.                                 C[0] = (1 + C[0] + s->current_picture.motion_val[dir][s->block_index[1] - 2 * wrap - 2][0]) >> 1;

  567.                                 C[1] = (1 + C[1] + s->current_picture.motion_val[dir][s->block_index[1] - 2 * wrap - 2][1]) >> 1;

  568.                             }

  569.                         } else

  570.                             c_valid = 0;

  571.                     }

  572.                 }

  573.             }

  574.         }

  575.     } else {

  576.         pos_b   = s->block_index[1];

  577.         b_valid = 1;

  578.         B[0]    = s->current_picture.motion_val[dir][pos_b][0];

  579.         B[1]    = s->current_picture.motion_val[dir][pos_b][1];

  580.         pos_c   = s->block_index[0];

  581.         c_valid = 1;

  582.         C[0]    = s->current_picture.motion_val[dir][pos_c][0];

  583.         C[1]    = s->current_picture.motion_val[dir][pos_c][1];

  584.     }

  585. 

  586.     total_valid = a_valid + b_valid + c_valid;

  587.     // check if predictor A is out of bounds

  588.     if (!s->mb_x && !(n == 1 || n == 3)) {

  589.         A[0] = A[1] = 0;

  590.     }

  591.     // check if predictor B is out of bounds

  592.     if ((s->first_slice_line && v->blk_mv_type[xy]) || (s->first_slice_line && !(n & 2))) {

  593.         B[0] = B[1] = C[0] = C[1] = 0;

  594.     }

  595.     if (!v->blk_mv_type[xy]) {

  596.         if (s->mb_width == 1) {

  597.             px = B[0];

  598.             py = B[1];

  599.         } else {

  600.             if (total_valid >= 2) {

  601.                 px = mid_pred(A[0], B[0], C[0]);

  602.                 py = mid_pred(A[1], B[1], C[1]);

  603.             } else if (total_valid) {

  604.                 if      (a_valid) { px = A[0]; py = A[1]; }

  605.                 else if (b_valid) { px = B[0]; py = B[1]; }

  606.                 else              { px = C[0]; py = C[1]; }

  607.             }

  608.         }

  609.     } else {

  610.         if (a_valid)

  611.             field_a = (A[1] & 4) ? 1 : 0;

  612.         else

  613.             field_a = 0;

  614.         if (b_valid)

  615.             field_b = (B[1] & 4) ? 1 : 0;

  616.         else

  617.             field_b = 0;

  618.         if (c_valid)

  619.             field_c = (C[1] & 4) ? 1 : 0;

  620.         else

  621.             field_c = 0;

  622. 

  623.         num_oppfield  = field_a + field_b + field_c;

  624.         num_samefield = total_valid - num_oppfield;

  625.         if (total_valid == 3) {

  626.             if ((num_samefield == 3) || (num_oppfield == 3)) {

  627.                 px = mid_pred(A[0], B[0], C[0]);

  628.                 py = mid_pred(A[1], B[1], C[1]);

  629.             } else if (num_samefield >= num_oppfield) {

  630.                 /* take one MV from same field set depending on priority

  631.                 the check for B may not be necessary */

  632.                 px = !field_a ? A[0] : B[0];

  633.                 py = !field_a ? A[1] : B[1];

  634.             } else {

  635.                 px =  field_a ? A[0] : B[0];

  636.                 py =  field_a ? A[1] : B[1];

  637.             }

  638.         } else if (total_valid == 2) {

  639.             if (num_samefield >= num_oppfield) {

  640.                 if (!field_a && a_valid) {

  641.                     px = A[0];

  642.                     py = A[1];

  643.                 } else if (!field_b && b_valid) {

  644.                     px = B[0];

  645.                     py = B[1];

  646.                 } else /*if (c_valid)*/ {

  647.                     av_assert1(c_valid);

  648.                     px = C[0];

  649.                     py = C[1];

  650.                 }

  651.             } else {

  652.                 if (field_a && a_valid) {

  653.                     px = A[0];

  654.                     py = A[1];

  655.                 } else /*if (field_b && b_valid)*/ {

  656.                     av_assert1(field_b && b_valid);

  657.                     px = B[0];

  658.                     py = B[1];

  659.                 }

  660.             }

  661.         } else if (total_valid == 1) {

  662.             px = (a_valid) ? A[0] : ((b_valid) ? B[0] : C[0]);

  663.             py = (a_valid) ? A[1] : ((b_valid) ? B[1] : C[1]);

  664.         }

  665.     }

  666. 

  667.     /* store MV using signed modulus of MV range defined in 4.11 */

  668.     s->mv[dir][n][0] = s->current_picture.motion_val[dir][xy][0] = ((px + dmv_x + r_x) & ((r_x << 1) - 1)) - r_x;

  669.     s->mv[dir][n][1] = s->current_picture.motion_val[dir][xy][1] = ((py + dmv_y + r_y) & ((r_y << 1) - 1)) - r_y;

  670.     if (mvn == 1) { /* duplicate motion data for 1-MV block */

  671.         s->current_picture.motion_val[dir][xy +    1    ][0] = s->current_picture.motion_val[dir][xy][0];

  672.         s->current_picture.motion_val[dir][xy +    1    ][1] = s->current_picture.motion_val[dir][xy][1];

  673.         s->current_picture.motion_val[dir][xy + wrap    ][0] = s->current_picture.motion_val[dir][xy][0];

  674.         s->current_picture.motion_val[dir][xy + wrap    ][1] = s->current_picture.motion_val[dir][xy][1];

  675.         s->current_picture.motion_val[dir][xy + wrap + 1][0] = s->current_picture.motion_val[dir][xy][0];

  676.         s->current_picture.motion_val[dir][xy + wrap + 1][1] = s->current_picture.motion_val[dir][xy][1];

  677.     } else if (mvn == 2) { /* duplicate motion data for 2-Field MV block */

  678.         s->current_picture.motion_val[dir][xy + 1][0] = s->current_picture.motion_val[dir][xy][0];

  679.         s->current_picture.motion_val[dir][xy + 1][1] = s->current_picture.motion_val[dir][xy][1];

  680.         s->mv[dir][n + 1][0] = s->mv[dir][n][0];

  681.         s->mv[dir][n + 1][1] = s->mv[dir][n][1];

  682.     }

  683. }

  684. 

  685. void ff_vc1_pred_b_mv(VC1Context *v, int dmv_x[2], int dmv_y[2],

  686.                       int direct, int mvtype)

  687. {

  688.     MpegEncContext *s = &v->s;

  689.     int xy, wrap, off = 0;

  690.     int16_t *A, *B, *C;

  691.     int px, py;

  692.     int sum;

  693.     int r_x, r_y;

  694.     const uint8_t *is_intra = v->mb_type[0];

  695. 

  696.     av_assert0(!v->field_mode);

  697. 

  698.     r_x = v->range_x;

  699.     r_y = v->range_y;

  700.     /* scale MV difference to be quad-pel */

  701.     if (!s->quarter_sample) {

  702.         dmv_x[0] *= 2;

  703.         dmv_y[0] *= 2;

  704.         dmv_x[1] *= 2;

  705.         dmv_y[1] *= 2;

  706.     }

  707. 

  708.     wrap = s->b8_stride;

  709.     xy = s->block_index[0];

  710. 

  711.     if (s->mb_intra) {

  712.         s->current_picture.motion_val[0][xy][0] =

  713.         s->current_picture.motion_val[0][xy][1] =

  714.         s->current_picture.motion_val[1][xy][0] =

  715.         s->current_picture.motion_val[1][xy][1] = 0;

  716.         return;

  717.     }

  718.         if (direct && s->next_picture_ptr->field_picture)

  719.             av_log(s->avctx, AV_LOG_WARNING, "Mixed frame/field direct mode not supported\n");

  720. 

  721.         s->mv[0][0][0] = scale_mv(s->next_picture.motion_val[1][xy][0], v->bfraction, 0, s->quarter_sample);

  722.         s->mv[0][0][1] = scale_mv(s->next_picture.motion_val[1][xy][1], v->bfraction, 0, s->quarter_sample);

  723.         s->mv[1][0][0] = scale_mv(s->next_picture.motion_val[1][xy][0], v->bfraction, 1, s->quarter_sample);

  724.         s->mv[1][0][1] = scale_mv(s->next_picture.motion_val[1][xy][1], v->bfraction, 1, s->quarter_sample);

  725. 

  726.         /* Pullback predicted motion vectors as specified in 8.4.5.4 */

  727.         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));

  728.         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));

  729.         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));

  730.         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));

  731.     if (direct) {

  732.         s->current_picture.motion_val[0][xy][0] = s->mv[0][0][0];

  733.         s->current_picture.motion_val[0][xy][1] = s->mv[0][0][1];

  734.         s->current_picture.motion_val[1][xy][0] = s->mv[1][0][0];

  735.         s->current_picture.motion_val[1][xy][1] = s->mv[1][0][1];

  736.         return;

  737.     }

  738. 

  739.     if ((mvtype == BMV_TYPE_FORWARD) || (mvtype == BMV_TYPE_INTERPOLATED)) {

  740.         C   = s->current_picture.motion_val[0][xy - 2];

  741.         A   = s->current_picture.motion_val[0][xy - wrap * 2];

  742.         off = (s->mb_x == (s->mb_width - 1)) ? -2 : 2;

  743.         B   = s->current_picture.motion_val[0][xy - wrap * 2 + off];

  744. 

  745.         if (!s->mb_x) C[0] = C[1] = 0;

  746.         if (!s->first_slice_line) { // predictor A is not out of bounds

  747.             if (s->mb_width == 1) {

  748.                 px = A[0];

  749.                 py = A[1];

  750.             } else {

  751.                 px = mid_pred(A[0], B[0], C[0]);

  752.                 py = mid_pred(A[1], B[1], C[1]);

  753.             }

  754.         } else if (s->mb_x) { // predictor C is not out of bounds

  755.             px = C[0];

  756.             py = C[1];

  757.         } else {

  758.             px = py = 0;

  759.         }

  760.         /* Pullback MV as specified in 8.3.5.3.4 */

  761.         {

  762.             int qx, qy, X, Y;

  763.             int sh = v->profile < PROFILE_ADVANCED ? 5 : 6;

  764.             int MV = 4 - (1 << sh);

  765.             qx = (s->mb_x << sh);

  766.             qy = (s->mb_y << sh);

  767.             X  = (s->mb_width  << sh) - 4;

  768.             Y  = (s->mb_height << sh) - 4;

  769.             if (qx + px < MV) px = MV - qx;

  770.             if (qy + py < MV) py = MV - qy;

  771.             if (qx + px > X) px = X - qx;

  772.             if (qy + py > Y) py = Y - qy;

  773.         }

  774.         /* Calculate hybrid prediction as specified in 8.3.5.3.5 */

  775.         if (0 && !s->first_slice_line && s->mb_x) {

  776.             if (is_intra[xy - wrap])

  777.                 sum = FFABS(px) + FFABS(py);

  778.             else

  779.                 sum = FFABS(px - A[0]) + FFABS(py - A[1]);

  780.             if (sum > 32) {

  781.                 if (get_bits1(&s->gb)) {

  782.                     px = A[0];

  783.                     py = A[1];

  784.                 } else {

  785.                     px = C[0];

  786.                     py = C[1];

  787.                 }

  788.             } else {

  789.                 if (is_intra[xy - 2])

  790.                     sum = FFABS(px) + FFABS(py);

  791.                 else

  792.                     sum = FFABS(px - C[0]) + FFABS(py - C[1]);

  793.                 if (sum > 32) {

  794.                     if (get_bits1(&s->gb)) {

  795.                         px = A[0];

  796.                         py = A[1];

  797.                     } else {

  798.                         px = C[0];

  799.                         py = C[1];

  800.                     }

  801.                 }

  802.             }

  803.         }

  804.         /* store MV using signed modulus of MV range defined in 4.11 */

  805.         s->mv[0][0][0] = ((px + dmv_x[0] + r_x) & ((r_x << 1) - 1)) - r_x;

  806.         s->mv[0][0][1] = ((py + dmv_y[0] + r_y) & ((r_y << 1) - 1)) - r_y;

  807.     }

  808.     if ((mvtype == BMV_TYPE_BACKWARD) || (mvtype == BMV_TYPE_INTERPOLATED)) {

  809.         C   = s->current_picture.motion_val[1][xy - 2];

  810.         A   = s->current_picture.motion_val[1][xy - wrap * 2];

  811.         off = (s->mb_x == (s->mb_width - 1)) ? -2 : 2;

  812.         B   = s->current_picture.motion_val[1][xy - wrap * 2 + off];

  813. 

  814.         if (!s->mb_x)

  815.             C[0] = C[1] = 0;

  816.         if (!s->first_slice_line) { // predictor A is not out of bounds

  817.             if (s->mb_width == 1) {

  818.                 px = A[0];

  819.                 py = A[1];

  820.             } else {

  821.                 px = mid_pred(A[0], B[0], C[0]);

  822.                 py = mid_pred(A[1], B[1], C[1]);

  823.             }

  824.         } else if (s->mb_x) { // predictor C is not out of bounds

  825.             px = C[0];

  826.             py = C[1];

  827.         } else {

  828.             px = py = 0;

  829.         }

  830.         /* Pullback MV as specified in 8.3.5.3.4 */

  831.         {

  832.             int qx, qy, X, Y;

  833.             int sh = v->profile < PROFILE_ADVANCED ? 5 : 6;

  834.             int MV = 4 - (1 << sh);

  835.             qx = (s->mb_x << sh);

  836.             qy = (s->mb_y << sh);

  837.             X  = (s->mb_width  << sh) - 4;

  838.             Y  = (s->mb_height << sh) - 4;

  839.             if (qx + px < MV) px = MV - qx;

  840.             if (qy + py < MV) py = MV - qy;

  841.             if (qx + px > X) px = X - qx;

  842.             if (qy + py > Y) py = Y - qy;

  843.         }

  844.         /* Calculate hybrid prediction as specified in 8.3.5.3.5 */

  845.         if (0 && !s->first_slice_line && s->mb_x) {

  846.             if (is_intra[xy - wrap])

  847.                 sum = FFABS(px) + FFABS(py);

  848.             else

  849.                 sum = FFABS(px - A[0]) + FFABS(py - A[1]);

  850.             if (sum > 32) {

  851.                 if (get_bits1(&s->gb)) {

  852.                     px = A[0];

  853.                     py = A[1];

  854.                 } else {

  855.                     px = C[0];

  856.                     py = C[1];

  857.                 }

  858.             } else {

  859.                 if (is_intra[xy - 2])

  860.                     sum = FFABS(px) + FFABS(py);

  861.                 else

  862.                     sum = FFABS(px - C[0]) + FFABS(py - C[1]);

  863.                 if (sum > 32) {

  864.                     if (get_bits1(&s->gb)) {

  865.                         px = A[0];

  866.                         py = A[1];

  867.                     } else {

  868.                         px = C[0];

  869.                         py = C[1];

  870.                     }

  871.                 }

  872.             }

  873.         }

  874.         /* store MV using signed modulus of MV range defined in 4.11 */

  875. 

  876.         s->mv[1][0][0] = ((px + dmv_x[1] + r_x) & ((r_x << 1) - 1)) - r_x;

  877.         s->mv[1][0][1] = ((py + dmv_y[1] + r_y) & ((r_y << 1) - 1)) - r_y;

  878.     }

  879.     s->current_picture.motion_val[0][xy][0] = s->mv[0][0][0];

  880.     s->current_picture.motion_val[0][xy][1] = s->mv[0][0][1];

  881.     s->current_picture.motion_val[1][xy][0] = s->mv[1][0][0];

  882.     s->current_picture.motion_val[1][xy][1] = s->mv[1][0][1];

  883. }

  884. 

  885. void ff_vc1_pred_b_mv_intfi(VC1Context *v, int n, int *dmv_x, int *dmv_y,

  886.                             int mv1, int *pred_flag)

  887. {

  888.     int dir = (v->bmvtype == BMV_TYPE_BACKWARD) ? 1 : 0;

  889.     MpegEncContext *s = &v->s;

  890.     int mb_pos = s->mb_x + s->mb_y * s->mb_stride;

  891. 

  892.     if (v->bmvtype == BMV_TYPE_DIRECT) {

  893.         int total_opp, k, f;

  894.         if (s->next_picture.mb_type[mb_pos + v->mb_off] != MB_TYPE_INTRA) {

  895.             s->mv[0][0][0] = scale_mv(s->next_picture.motion_val[1][s->block_index[0] + v->blocks_off][0],

  896.                                       v->bfraction, 0, s->quarter_sample);

  897.             s->mv[0][0][1] = scale_mv(s->next_picture.motion_val[1][s->block_index[0] + v->blocks_off][1],

  898.                                       v->bfraction, 0, s->quarter_sample);

  899.             s->mv[1][0][0] = scale_mv(s->next_picture.motion_val[1][s->block_index[0] + v->blocks_off][0],

  900.                                       v->bfraction, 1, s->quarter_sample);

  901.             s->mv[1][0][1] = scale_mv(s->next_picture.motion_val[1][s->block_index[0] + v->blocks_off][1],

  902.                                       v->bfraction, 1, s->quarter_sample);

  903. 

  904.             total_opp = v->mv_f_next[0][s->block_index[0] + v->blocks_off]

  905.                       + v->mv_f_next[0][s->block_index[1] + v->blocks_off]

  906.                       + v->mv_f_next[0][s->block_index[2] + v->blocks_off]

  907.                       + v->mv_f_next[0][s->block_index[3] + v->blocks_off];

  908.             f = (total_opp > 2) ? 1 : 0;

  909.         } else {

  910.             s->mv[0][0][0] = s->mv[0][0][1] = 0;

  911.             s->mv[1][0][0] = s->mv[1][0][1] = 0;

  912.             f = 0;

  913.         }

  914.         v->ref_field_type[0] = v->ref_field_type[1] = v->cur_field_type ^ f;

  915.         for (k = 0; k < 4; k++) {

  916.             s->current_picture.motion_val[0][s->block_index[k] + v->blocks_off][0] = s->mv[0][0][0];

  917.             s->current_picture.motion_val[0][s->block_index[k] + v->blocks_off][1] = s->mv[0][0][1];

  918.             s->current_picture.motion_val[1][s->block_index[k] + v->blocks_off][0] = s->mv[1][0][0];

  919.             s->current_picture.motion_val[1][s->block_index[k] + v->blocks_off][1] = s->mv[1][0][1];

  920.             v->mv_f[0][s->block_index[k] + v->blocks_off] = f;

  921.             v->mv_f[1][s->block_index[k] + v->blocks_off] = f;

  922.         }

  923.         return;

  924.     }

  925.     if (v->bmvtype == BMV_TYPE_INTERPOLATED) {

  926.         ff_vc1_pred_mv(v, 0, dmv_x[0], dmv_y[0],   1, v->range_x, v->range_y, v->mb_type[0], pred_flag[0], 0);

  927.         ff_vc1_pred_mv(v, 0, dmv_x[1], dmv_y[1],   1, v->range_x, v->range_y, v->mb_type[0], pred_flag[1], 1);

  928.         return;

  929.     }

  930.     if (dir) { // backward

  931.         ff_vc1_pred_mv(v, n, dmv_x[1], dmv_y[1], mv1, v->range_x, v->range_y, v->mb_type[0], pred_flag[1], 1);

  932.         if (n == 3 || mv1) {

  933.             ff_vc1_pred_mv(v, 0, dmv_x[0], dmv_y[0],   1, v->range_x, v->range_y, v->mb_type[0], 0, 0);

  934.         }

  935.     } else { // forward

  936.         ff_vc1_pred_mv(v, n, dmv_x[0], dmv_y[0], mv1, v->range_x, v->range_y, v->mb_type[0], pred_flag[0], 0);

  937.         if (n == 3 || mv1) {

  938.             ff_vc1_pred_mv(v, 0, dmv_x[1], dmv_y[1],   1, v->range_x, v->range_y, v->mb_type[0], 0, 1);

  939.         }

  940.     }

  941. }