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.
22616 Commits
32 Branches
1.0GB
Tree: 0a8dca8765
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '0a8dca8765'
${ noResults }
FFmpeg/libavcodec/h264_direct.c

475 lines
20KB
Raw Blame History 

  1. /*

  2.  * H.26L/H.264/AVC/JVT/14496-10/... direct mb/block decoding

  3.  * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

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

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

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

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

  11.  *

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

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

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

  15.  * Lesser General Public License for more details.

  16.  *

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

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

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

  20.  */

  21. 

  22. /**

  23.  * @file libavcodec/h264_direct.c

  24.  * H.264 / AVC / MPEG4 part10 direct mb/block decoding.

  25.  * @author Michael Niedermayer <michaelni@gmx.at>

  26.  */

  27. 

  28. #include "internal.h"

  29. #include "dsputil.h"

  30. #include "avcodec.h"

  31. #include "mpegvideo.h"

  32. #include "h264.h"

  33. #include "h264_mvpred.h"

  34. #include "rectangle.h"

  35. 

  36. //#undef NDEBUG

  37. #include <assert.h>

  38. 

  39. 

  40. static int get_scale_factor(H264Context * const h, int poc, int poc1, int i){

  41.     int poc0 = h->ref_list[0][i].poc;

  42.     int td = av_clip(poc1 - poc0, -128, 127);

  43.     if(td == 0 || h->ref_list[0][i].long_ref){

  44.         return 256;

  45.     }else{

  46.         int tb = av_clip(poc - poc0, -128, 127);

  47.         int tx = (16384 + (FFABS(td) >> 1)) / td;

  48.         return av_clip((tb*tx + 32) >> 6, -1024, 1023);

  49.     }

  50. }

  51. 

  52. void ff_h264_direct_dist_scale_factor(H264Context * const h){

  53.     MpegEncContext * const s = &h->s;

  54.     const int poc = h->s.current_picture_ptr->field_poc[ s->picture_structure == PICT_BOTTOM_FIELD ];

  55.     const int poc1 = h->ref_list[1][0].poc;

  56.     int i, field;

  57.     for(field=0; field<2; field++){

  58.         const int poc  = h->s.current_picture_ptr->field_poc[field];

  59.         const int poc1 = h->ref_list[1][0].field_poc[field];

  60.         for(i=0; i < 2*h->ref_count[0]; i++)

  61.             h->dist_scale_factor_field[field][i^field] = get_scale_factor(h, poc, poc1, i+16);

  62.     }

  63. 

  64.     for(i=0; i<h->ref_count[0]; i++){

  65.         h->dist_scale_factor[i] = get_scale_factor(h, poc, poc1, i);

  66.     }

  67. }

  68. 

  69. static void fill_colmap(H264Context *h, int map[2][16+32], int list, int field, int colfield, int mbafi){

  70.     MpegEncContext * const s = &h->s;

  71.     Picture * const ref1 = &h->ref_list[1][0];

  72.     int j, old_ref, rfield;

  73.     int start= mbafi ? 16                      : 0;

  74.     int end  = mbafi ? 16+2*h->ref_count[0]    : h->ref_count[0];

  75.     int interl= mbafi || s->picture_structure != PICT_FRAME;

  76. 

  77.     /* bogus; fills in for missing frames */

  78.     memset(map[list], 0, sizeof(map[list]));

  79. 

  80.     for(rfield=0; rfield<2; rfield++){

  81.         for(old_ref=0; old_ref<ref1->ref_count[colfield][list]; old_ref++){

  82.             int poc = ref1->ref_poc[colfield][list][old_ref];

  83. 

  84.             if     (!interl)

  85.                 poc |= 3;

  86.             else if( interl && (poc&3) == 3) //FIXME store all MBAFF references so this isnt needed

  87.                 poc= (poc&~3) + rfield + 1;

  88. 

  89.             for(j=start; j<end; j++){

  90.                 if(4*h->ref_list[0][j].frame_num + (h->ref_list[0][j].reference&3) == poc){

  91.                     int cur_ref= mbafi ? (j-16)^field : j;

  92.                     map[list][2*old_ref + (rfield^field) + 16] = cur_ref;

  93.                     if(rfield == field || !interl)

  94.                         map[list][old_ref] = cur_ref;

  95.                     break;

  96.                 }

  97.             }

  98.         }

  99.     }

  100. }

  101. 

  102. void ff_h264_direct_ref_list_init(H264Context * const h){

  103.     MpegEncContext * const s = &h->s;

  104.     Picture * const ref1 = &h->ref_list[1][0];

  105.     Picture * const cur = s->current_picture_ptr;

  106.     int list, j, field;

  107.     int sidx= (s->picture_structure&1)^1;

  108.     int ref1sidx= (ref1->reference&1)^1;

  109. 

  110.     for(list=0; list<2; list++){

  111.         cur->ref_count[sidx][list] = h->ref_count[list];

  112.         for(j=0; j<h->ref_count[list]; j++)

  113.             cur->ref_poc[sidx][list][j] = 4*h->ref_list[list][j].frame_num + (h->ref_list[list][j].reference&3);

  114.     }

  115. 

  116.     if(s->picture_structure == PICT_FRAME){

  117.         memcpy(cur->ref_count[1], cur->ref_count[0], sizeof(cur->ref_count[0]));

  118.         memcpy(cur->ref_poc  [1], cur->ref_poc  [0], sizeof(cur->ref_poc  [0]));

  119.     }

  120. 

  121.     cur->mbaff= FRAME_MBAFF;

  122. 

  123.     h->col_fieldoff= 0;

  124.     if(s->picture_structure == PICT_FRAME){

  125.         int cur_poc = s->current_picture_ptr->poc;

  126.         int *col_poc = h->ref_list[1]->field_poc;

  127.         h->col_parity= (FFABS(col_poc[0] - cur_poc) >= FFABS(col_poc[1] - cur_poc));

  128.         ref1sidx=sidx= h->col_parity;

  129.     }else if(!(s->picture_structure & h->ref_list[1][0].reference) && !h->ref_list[1][0].mbaff){ // FL -> FL & differ parity

  130.         h->col_fieldoff= s->mb_stride*(2*(h->ref_list[1][0].reference) - 3);

  131.     }

  132. 

  133.     if(cur->pict_type != FF_B_TYPE || h->direct_spatial_mv_pred)

  134.         return;

  135. 

  136.     for(list=0; list<2; list++){

  137.         fill_colmap(h, h->map_col_to_list0, list, sidx, ref1sidx, 0);

  138.         if(FRAME_MBAFF)

  139.         for(field=0; field<2; field++)

  140.             fill_colmap(h, h->map_col_to_list0_field[field], list, field, field, 1);

  141.     }

  142. }

  143. 

  144. void ff_h264_pred_direct_motion(H264Context * const h, int *mb_type){

  145.     MpegEncContext * const s = &h->s;

  146.     int b8_stride = h->b8_stride;

  147.     int b4_stride = h->b_stride;

  148.     int mb_xy = h->mb_xy;

  149.     int mb_type_col[2];

  150.     const int16_t (*l1mv0)[2], (*l1mv1)[2];

  151.     const int8_t *l1ref0, *l1ref1;

  152.     const int is_b8x8 = IS_8X8(*mb_type);

  153.     unsigned int sub_mb_type;

  154.     int i8, i4;

  155. 

  156.     assert(h->ref_list[1][0].reference&3);

  157. 

  158. #define MB_TYPE_16x16_OR_INTRA (MB_TYPE_16x16|MB_TYPE_INTRA4x4|MB_TYPE_INTRA16x16|MB_TYPE_INTRA_PCM)

  159. 

  160.     if(IS_INTERLACED(h->ref_list[1][0].mb_type[mb_xy])){ // AFL/AFR/FR/FL -> AFL/FL

  161.         if(!IS_INTERLACED(*mb_type)){                    //     AFR/FR    -> AFL/FL

  162.             mb_xy= s->mb_x + ((s->mb_y&~1) + h->col_parity)*s->mb_stride;

  163.             b8_stride = 0;

  164.         }else{

  165.             mb_xy += h->col_fieldoff; // non zero for FL -> FL & differ parity

  166.         }

  167.         goto single_col;

  168.     }else{                                               // AFL/AFR/FR/FL -> AFR/FR

  169.         if(IS_INTERLACED(*mb_type)){                     // AFL       /FL -> AFR/FR

  170.             mb_xy= s->mb_x + (s->mb_y&~1)*s->mb_stride;

  171.             mb_type_col[0] = h->ref_list[1][0].mb_type[mb_xy];

  172.             mb_type_col[1] = h->ref_list[1][0].mb_type[mb_xy + s->mb_stride];

  173.             b8_stride *= 3;

  174.             b4_stride *= 6;

  175. 

  176.             sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */

  177.             if(    (mb_type_col[0] & MB_TYPE_16x16_OR_INTRA)

  178.                 && (mb_type_col[1] & MB_TYPE_16x16_OR_INTRA)

  179.                 && !is_b8x8){

  180.                 *mb_type   |= MB_TYPE_16x8 |MB_TYPE_L0L1|MB_TYPE_DIRECT2; /* B_16x8 */

  181.             }else{

  182.                 *mb_type   |= MB_TYPE_8x8|MB_TYPE_L0L1;

  183.             }

  184.         }else{                                           //     AFR/FR    -> AFR/FR

  185. single_col:

  186.             mb_type_col[0] =

  187.             mb_type_col[1] = h->ref_list[1][0].mb_type[mb_xy];

  188.             if(IS_8X8(mb_type_col[0]) && !h->sps.direct_8x8_inference_flag){

  189.                 /* FIXME save sub mb types from previous frames (or derive from MVs)

  190.                 * so we know exactly what block size to use */

  191.                 sub_mb_type = MB_TYPE_8x8|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_4x4 */

  192.                 *mb_type   |= MB_TYPE_8x8|MB_TYPE_L0L1;

  193.             }else if(!is_b8x8 && (mb_type_col[0] & MB_TYPE_16x16_OR_INTRA)){

  194.                 sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */

  195.                 *mb_type   |= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_16x16 */

  196.             }else if(!is_b8x8 && (mb_type_col[0] & (MB_TYPE_16x8|MB_TYPE_8x16))){

  197.                 sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */

  198.                 *mb_type   |= MB_TYPE_L0L1|MB_TYPE_DIRECT2 | (mb_type_col[0] & (MB_TYPE_16x8|MB_TYPE_8x16));

  199.             }else{

  200.                 sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */

  201.                 *mb_type   |= MB_TYPE_8x8|MB_TYPE_L0L1;

  202.             }

  203.         }

  204.     }

  205. 

  206.     l1mv0  = &h->ref_list[1][0].motion_val[0][h->mb2b_xy [mb_xy]];

  207.     l1mv1  = &h->ref_list[1][0].motion_val[1][h->mb2b_xy [mb_xy]];

  208.     l1ref0 = &h->ref_list[1][0].ref_index [0][h->mb2b8_xy[mb_xy]];

  209.     l1ref1 = &h->ref_list[1][0].ref_index [1][h->mb2b8_xy[mb_xy]];

  210.     if(!b8_stride){

  211.         if(s->mb_y&1){

  212.             l1ref0 += h->b8_stride;

  213.             l1ref1 += h->b8_stride;

  214.             l1mv0  +=  2*b4_stride;

  215.             l1mv1  +=  2*b4_stride;

  216.         }

  217.     }

  218. 

  219.     if(h->direct_spatial_mv_pred){

  220.         int ref[2];

  221.         int mv[2][2];

  222.         int list;

  223. 

  224.         /* FIXME interlacing + spatial direct uses wrong colocated block positions */

  225. 

  226.         /* ref = min(neighbors) */

  227.         for(list=0; list<2; list++){

  228.             int refa = h->ref_cache[list][scan8[0] - 1];

  229.             int refb = h->ref_cache[list][scan8[0] - 8];

  230.             int refc = h->ref_cache[list][scan8[0] - 8 + 4];

  231.             if(refc == PART_NOT_AVAILABLE)

  232.                 refc = h->ref_cache[list][scan8[0] - 8 - 1];

  233.             ref[list] = FFMIN3((unsigned)refa, (unsigned)refb, (unsigned)refc);

  234.             if(ref[list] < 0)

  235.                 ref[list] = -1;

  236.         }

  237. 

  238.         if(ref[0] < 0 && ref[1] < 0){

  239.             ref[0] = ref[1] = 0;

  240.             mv[0][0] = mv[0][1] =

  241.             mv[1][0] = mv[1][1] = 0;

  242.         }else{

  243.             for(list=0; list<2; list++){

  244.                 if(ref[list] >= 0)

  245.                     pred_motion(h, 0, 4, list, ref[list], &mv[list][0], &mv[list][1]);

  246.                 else

  247.                     mv[list][0] = mv[list][1] = 0;

  248.             }

  249.         }

  250. 

  251.         if(ref[1] < 0){

  252.             if(!is_b8x8)

  253.                 *mb_type &= ~MB_TYPE_L1;

  254.             sub_mb_type &= ~MB_TYPE_L1;

  255.         }else if(ref[0] < 0){

  256.             if(!is_b8x8)

  257.                 *mb_type &= ~MB_TYPE_L0;

  258.             sub_mb_type &= ~MB_TYPE_L0;

  259.         }

  260. 

  261.         if(IS_INTERLACED(*mb_type) != IS_INTERLACED(mb_type_col[0])){

  262.             for(i8=0; i8<4; i8++){

  263.                 int x8 = i8&1;

  264.                 int y8 = i8>>1;

  265.                 int xy8 = x8+y8*b8_stride;

  266.                 int xy4 = 3*x8+y8*b4_stride;

  267.                 int a=0, b=0;

  268. 

  269.                 if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  270.                     continue;

  271.                 h->sub_mb_type[i8] = sub_mb_type;

  272. 

  273.                 fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[0], 1);

  274.                 fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[1], 1);

  275.                 if(!IS_INTRA(mb_type_col[y8]) && !h->ref_list[1][0].long_ref

  276.                    && (   (l1ref0[xy8] == 0 && FFABS(l1mv0[xy4][0]) <= 1 && FFABS(l1mv0[xy4][1]) <= 1)

  277.                        || (l1ref0[xy8]  < 0 && l1ref1[xy8] == 0 && FFABS(l1mv1[xy4][0]) <= 1 && FFABS(l1mv1[xy4][1]) <= 1))){

  278.                     if(ref[0] > 0)

  279.                         a= pack16to32(mv[0][0],mv[0][1]);

  280.                     if(ref[1] > 0)

  281.                         b= pack16to32(mv[1][0],mv[1][1]);

  282.                 }else{

  283.                     a= pack16to32(mv[0][0],mv[0][1]);

  284.                     b= pack16to32(mv[1][0],mv[1][1]);

  285.                 }

  286.                 fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, a, 4);

  287.                 fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, b, 4);

  288.             }

  289.         }else if(IS_16X16(*mb_type)){

  290.             int a=0, b=0;

  291. 

  292.             fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, (uint8_t)ref[0], 1);

  293.             fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, (uint8_t)ref[1], 1);

  294.             if(!IS_INTRA(mb_type_col[0]) && !h->ref_list[1][0].long_ref

  295.                && (   (l1ref0[0] == 0 && FFABS(l1mv0[0][0]) <= 1 && FFABS(l1mv0[0][1]) <= 1)

  296.                    || (l1ref0[0]  < 0 && l1ref1[0] == 0 && FFABS(l1mv1[0][0]) <= 1 && FFABS(l1mv1[0][1]) <= 1

  297.                        && (h->x264_build>33 || !h->x264_build)))){

  298.                 if(ref[0] > 0)

  299.                     a= pack16to32(mv[0][0],mv[0][1]);

  300.                 if(ref[1] > 0)

  301.                     b= pack16to32(mv[1][0],mv[1][1]);

  302.             }else{

  303.                 a= pack16to32(mv[0][0],mv[0][1]);

  304.                 b= pack16to32(mv[1][0],mv[1][1]);

  305.             }

  306.             fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, a, 4);

  307.             fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, b, 4);

  308.         }else{

  309.             for(i8=0; i8<4; i8++){

  310.                 const int x8 = i8&1;

  311.                 const int y8 = i8>>1;

  312. 

  313.                 if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  314.                     continue;

  315.                 h->sub_mb_type[i8] = sub_mb_type;

  316. 

  317.                 fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mv[0][0],mv[0][1]), 4);

  318.                 fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mv[1][0],mv[1][1]), 4);

  319.                 fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[0], 1);

  320.                 fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[1], 1);

  321. 

  322.                 /* col_zero_flag */

  323.                 if(!IS_INTRA(mb_type_col[0]) && !h->ref_list[1][0].long_ref && (   l1ref0[x8 + y8*b8_stride] == 0

  324.                                               || (l1ref0[x8 + y8*b8_stride] < 0 && l1ref1[x8 + y8*b8_stride] == 0

  325.                                                   && (h->x264_build>33 || !h->x264_build)))){

  326.                     const int16_t (*l1mv)[2]= l1ref0[x8 + y8*b8_stride] == 0 ? l1mv0 : l1mv1;

  327.                     if(IS_SUB_8X8(sub_mb_type)){

  328.                         const int16_t *mv_col = l1mv[x8*3 + y8*3*b4_stride];

  329.                         if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){

  330.                             if(ref[0] == 0)

  331.                                 fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);

  332.                             if(ref[1] == 0)

  333.                                 fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);

  334.                         }

  335.                     }else

  336.                     for(i4=0; i4<4; i4++){

  337.                         const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*b4_stride];

  338.                         if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){

  339.                             if(ref[0] == 0)

  340.                                 *(uint32_t*)h->mv_cache[0][scan8[i8*4+i4]] = 0;

  341.                             if(ref[1] == 0)

  342.                                 *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] = 0;

  343.                         }

  344.                     }

  345.                 }

  346.             }

  347.         }

  348.     }else{ /* direct temporal mv pred */

  349.         const int *map_col_to_list0[2] = {h->map_col_to_list0[0], h->map_col_to_list0[1]};

  350.         const int *dist_scale_factor = h->dist_scale_factor;

  351.         int ref_offset= 0;

  352. 

  353.         if(FRAME_MBAFF && IS_INTERLACED(*mb_type)){

  354.             map_col_to_list0[0] = h->map_col_to_list0_field[s->mb_y&1][0];

  355.             map_col_to_list0[1] = h->map_col_to_list0_field[s->mb_y&1][1];

  356.             dist_scale_factor   =h->dist_scale_factor_field[s->mb_y&1];

  357.         }

  358.         if(h->ref_list[1][0].mbaff && IS_INTERLACED(mb_type_col[0]))

  359.             ref_offset += 16;

  360. 

  361.         if(IS_INTERLACED(*mb_type) != IS_INTERLACED(mb_type_col[0])){

  362.             int y_shift  = 2*!IS_INTERLACED(*mb_type);

  363.             assert(h->sps.direct_8x8_inference_flag);

  364. 

  365.             for(i8=0; i8<4; i8++){

  366.                 const int x8 = i8&1;

  367.                 const int y8 = i8>>1;

  368.                 int ref0, scale;

  369.                 const int16_t (*l1mv)[2]= l1mv0;

  370. 

  371.                 if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  372.                     continue;

  373.                 h->sub_mb_type[i8] = sub_mb_type;

  374. 

  375.                 fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);

  376.                 if(IS_INTRA(mb_type_col[y8])){

  377.                     fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);

  378.                     fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);

  379.                     fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);

  380.                     continue;

  381.                 }

  382. 

  383.                 ref0 = l1ref0[x8 + y8*b8_stride];

  384.                 if(ref0 >= 0)

  385.                     ref0 = map_col_to_list0[0][ref0 + ref_offset];

  386.                 else{

  387.                     ref0 = map_col_to_list0[1][l1ref1[x8 + y8*b8_stride] + ref_offset];

  388.                     l1mv= l1mv1;

  389.                 }

  390.                 scale = dist_scale_factor[ref0];

  391.                 fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);

  392. 

  393.                 {

  394.                     const int16_t *mv_col = l1mv[x8*3 + y8*b4_stride];

  395.                     int my_col = (mv_col[1]<<y_shift)/2;

  396.                     int mx = (scale * mv_col[0] + 128) >> 8;

  397.                     int my = (scale * my_col + 128) >> 8;

  398.                     fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);

  399.                     fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-my_col), 4);

  400.                 }

  401.             }

  402.             return;

  403.         }

  404. 

  405.         /* one-to-one mv scaling */

  406. 

  407.         if(IS_16X16(*mb_type)){

  408.             int ref, mv0, mv1;

  409. 

  410.             fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, 0, 1);

  411.             if(IS_INTRA(mb_type_col[0])){

  412.                 ref=mv0=mv1=0;

  413.             }else{

  414.                 const int ref0 = l1ref0[0] >= 0 ? map_col_to_list0[0][l1ref0[0] + ref_offset]

  415.                                                 : map_col_to_list0[1][l1ref1[0] + ref_offset];

  416.                 const int scale = dist_scale_factor[ref0];

  417.                 const int16_t *mv_col = l1ref0[0] >= 0 ? l1mv0[0] : l1mv1[0];

  418.                 int mv_l0[2];

  419.                 mv_l0[0] = (scale * mv_col[0] + 128) >> 8;

  420.                 mv_l0[1] = (scale * mv_col[1] + 128) >> 8;

  421.                 ref= ref0;

  422.                 mv0= pack16to32(mv_l0[0],mv_l0[1]);

  423.                 mv1= pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);

  424.             }

  425.             fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref, 1);

  426.             fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, mv0, 4);

  427.             fill_rectangle(&h-> mv_cache[1][scan8[0]], 4, 4, 8, mv1, 4);

  428.         }else{

  429.             for(i8=0; i8<4; i8++){

  430.                 const int x8 = i8&1;

  431.                 const int y8 = i8>>1;

  432.                 int ref0, scale;

  433.                 const int16_t (*l1mv)[2]= l1mv0;

  434. 

  435.                 if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  436.                     continue;

  437.                 h->sub_mb_type[i8] = sub_mb_type;

  438.                 fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);

  439.                 if(IS_INTRA(mb_type_col[0])){

  440.                     fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);

  441.                     fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);

  442.                     fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);

  443.                     continue;

  444.                 }

  445. 

  446.                 ref0 = l1ref0[x8 + y8*b8_stride];

  447.                 if(ref0 >= 0)

  448.                     ref0 = map_col_to_list0[0][ref0 + ref_offset];

  449.                 else{

  450.                     ref0 = map_col_to_list0[1][l1ref1[x8 + y8*b8_stride] + ref_offset];

  451.                     l1mv= l1mv1;

  452.                 }

  453.                 scale = dist_scale_factor[ref0];

  454. 

  455.                 fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);

  456.                 if(IS_SUB_8X8(sub_mb_type)){

  457.                     const int16_t *mv_col = l1mv[x8*3 + y8*3*b4_stride];

  458.                     int mx = (scale * mv_col[0] + 128) >> 8;

  459.                     int my = (scale * mv_col[1] + 128) >> 8;

  460.                     fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);

  461.                     fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-mv_col[1]), 4);

  462.                 }else

  463.                 for(i4=0; i4<4; i4++){

  464.                     const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*b4_stride];

  465.                     int16_t *mv_l0 = h->mv_cache[0][scan8[i8*4+i4]];

  466.                     mv_l0[0] = (scale * mv_col[0] + 128) >> 8;

  467.                     mv_l0[1] = (scale * mv_col[1] + 128) >> 8;

  468.                     *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] =

  469.                         pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);

  470.                 }

  471.             }

  472.         }

  473.     }

  474. }