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.
50790 Commits
32 Branches
1006MB
Tree: ff3e8564c4
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'ff3e8564c4'
${ noResults }
FFmpeg/libavcodec/motion_est.c

1760 lines
67KB
Raw Blame History 

  1. /*

  2.  * Motion estimation

  3.  * Copyright (c) 2000,2001 Fabrice Bellard

  4.  * Copyright (c) 2002-2004 Michael Niedermayer

  5.  *

  6.  * new motion estimation (X1/EPZS) by Michael Niedermayer <michaelni@gmx.at>

  7.  *

  8.  * This file is part of FFmpeg.

  9.  *

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

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

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

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

  14.  *

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

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

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

  18.  * Lesser General Public License for more details.

  19.  *

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

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

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

  23.  */

  24. 

  25. /**

  26.  * @file

  27.  * Motion estimation.

  28.  */

  29. 

  30. #include <stdlib.h>

  31. #include <stdio.h>

  32. #include <limits.h>

  33. 

  34. #include "avcodec.h"

  35. #include "mathops.h"

  36. #include "mpegvideo.h"

  37. 

  38. #undef NDEBUG

  39. #include <assert.h>

  40. 

  41. #define P_LEFT P[1]

  42. #define P_TOP P[2]

  43. #define P_TOPRIGHT P[3]

  44. #define P_MEDIAN P[4]

  45. #define P_MV1 P[9]

  46. 

  47. static int sad_hpel_motion_search(MpegEncContext * s,

  48.                                   int *mx_ptr, int *my_ptr, int dmin,

  49.                                   int src_index, int ref_index,

  50.                                   int size, int h);

  51. 

  52. static inline unsigned update_map_generation(MotionEstContext *c)

  53. {

  54.     c->map_generation+= 1<<(ME_MAP_MV_BITS*2);

  55.     if(c->map_generation==0){

  56.         c->map_generation= 1<<(ME_MAP_MV_BITS*2);

  57.         memset(c->map, 0, sizeof(uint32_t)*ME_MAP_SIZE);

  58.     }

  59.     return c->map_generation;

  60. }

  61. 

  62. /* shape adaptive search stuff */

  63. typedef struct Minima{

  64.     int height;

  65.     int x, y;

  66.     int checked;

  67. }Minima;

  68. 

  69. static int minima_cmp(const void *a, const void *b){

  70.     const Minima *da = (const Minima *) a;

  71.     const Minima *db = (const Minima *) b;

  72. 

  73.     return da->height - db->height;

  74. }

  75. 

  76. #define FLAG_QPEL   1 //must be 1

  77. #define FLAG_CHROMA 2

  78. #define FLAG_DIRECT 4

  79. 

  80. static inline void init_ref(MotionEstContext *c, uint8_t *src[3], uint8_t *ref[3], uint8_t *ref2[3], int x, int y, int ref_index){

  81.     const int offset[3]= {

  82.           y*c->  stride + x,

  83.         ((y*c->uvstride + x)>>1),

  84.         ((y*c->uvstride + x)>>1),

  85.     };

  86.     int i;

  87.     for(i=0; i<3; i++){

  88.         c->src[0][i]= src [i] + offset[i];

  89.         c->ref[0][i]= ref [i] + offset[i];

  90.     }

  91.     if(ref_index){

  92.         for(i=0; i<3; i++){

  93.             c->ref[ref_index][i]= ref2[i] + offset[i];

  94.         }

  95.     }

  96. }

  97. 

  98. static int get_flags(MotionEstContext *c, int direct, int chroma){

  99.     return   ((c->avctx->flags&CODEC_FLAG_QPEL) ? FLAG_QPEL : 0)

  100.            + (direct ? FLAG_DIRECT : 0)

  101.            + (chroma ? FLAG_CHROMA : 0);

  102. }

  103. 

  104. static av_always_inline int cmp_direct_inline(MpegEncContext *s, const int x, const int y, const int subx, const int suby,

  105.                       const int size, const int h, int ref_index, int src_index,

  106.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, int qpel){

  107.     MotionEstContext * const c= &s->me;

  108.     const int stride= c->stride;

  109.     const int hx= subx + (x<<(1+qpel));

  110.     const int hy= suby + (y<<(1+qpel));

  111.     uint8_t * const * const ref= c->ref[ref_index];

  112.     uint8_t * const * const src= c->src[src_index];

  113.     int d;

  114.     //FIXME check chroma 4mv, (no crashes ...)

  115.         av_assert2(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1));

  116.         if(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1)){

  117.             const int time_pp= s->pp_time;

  118.             const int time_pb= s->pb_time;

  119.             const int mask= 2*qpel+1;

  120.             if(s->mv_type==MV_TYPE_8X8){

  121.                 int i;

  122.                 for(i=0; i<4; i++){

  123.                     int fx = c->direct_basis_mv[i][0] + hx;

  124.                     int fy = c->direct_basis_mv[i][1] + hy;

  125.                     int bx = hx ? fx - c->co_located_mv[i][0] : c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(qpel+4));

  126.                     int by = hy ? fy - c->co_located_mv[i][1] : c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(qpel+4));

  127.                     int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));

  128.                     int bxy= (bx&mask) + ((by&mask)<<(qpel+1));

  129. 

  130.                     uint8_t *dst= c->temp + 8*(i&1) + 8*stride*(i>>1);

  131.                     if(qpel){

  132.                         c->qpel_put[1][fxy](dst, ref[0] + (fx>>2) + (fy>>2)*stride, stride);

  133.                         c->qpel_avg[1][bxy](dst, ref[8] + (bx>>2) + (by>>2)*stride, stride);

  134.                     }else{

  135.                         c->hpel_put[1][fxy](dst, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 8);

  136.                         c->hpel_avg[1][bxy](dst, ref[8] + (bx>>1) + (by>>1)*stride, stride, 8);

  137.                     }

  138.                 }

  139.             }else{

  140.                 int fx = c->direct_basis_mv[0][0] + hx;

  141.                 int fy = c->direct_basis_mv[0][1] + hy;

  142.                 int bx = hx ? fx - c->co_located_mv[0][0] : (c->co_located_mv[0][0]*(time_pb - time_pp)/time_pp);

  143.                 int by = hy ? fy - c->co_located_mv[0][1] : (c->co_located_mv[0][1]*(time_pb - time_pp)/time_pp);

  144.                 int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));

  145.                 int bxy= (bx&mask) + ((by&mask)<<(qpel+1));

  146. 

  147.                 if(qpel){

  148.                     c->qpel_put[1][fxy](c->temp               , ref[0] + (fx>>2) + (fy>>2)*stride               , stride);

  149.                     c->qpel_put[1][fxy](c->temp + 8           , ref[0] + (fx>>2) + (fy>>2)*stride + 8           , stride);

  150.                     c->qpel_put[1][fxy](c->temp     + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride     + 8*stride, stride);

  151.                     c->qpel_put[1][fxy](c->temp + 8 + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8 + 8*stride, stride);

  152.                     c->qpel_avg[1][bxy](c->temp               , ref[8] + (bx>>2) + (by>>2)*stride               , stride);

  153.                     c->qpel_avg[1][bxy](c->temp + 8           , ref[8] + (bx>>2) + (by>>2)*stride + 8           , stride);

  154.                     c->qpel_avg[1][bxy](c->temp     + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride     + 8*stride, stride);

  155.                     c->qpel_avg[1][bxy](c->temp + 8 + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8 + 8*stride, stride);

  156.                 }else{

  157.                     av_assert2((fx>>1) + 16*s->mb_x >= -16);

  158.                     av_assert2((fy>>1) + 16*s->mb_y >= -16);

  159.                     av_assert2((fx>>1) + 16*s->mb_x <= s->width);

  160.                     av_assert2((fy>>1) + 16*s->mb_y <= s->height);

  161.                     av_assert2((bx>>1) + 16*s->mb_x >= -16);

  162.                     av_assert2((by>>1) + 16*s->mb_y >= -16);

  163.                     av_assert2((bx>>1) + 16*s->mb_x <= s->width);

  164.                     av_assert2((by>>1) + 16*s->mb_y <= s->height);

  165. 

  166.                     c->hpel_put[0][fxy](c->temp, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 16);

  167.                     c->hpel_avg[0][bxy](c->temp, ref[8] + (bx>>1) + (by>>1)*stride, stride, 16);

  168.                 }

  169.             }

  170.             d = cmp_func(s, c->temp, src[0], stride, 16);

  171.         }else

  172.             d= 256*256*256*32;

  173.     return d;

  174. }

  175. 

  176. static av_always_inline int cmp_inline(MpegEncContext *s, const int x, const int y, const int subx, const int suby,

  177.                       const int size, const int h, int ref_index, int src_index,

  178.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, int qpel, int chroma){

  179.     MotionEstContext * const c= &s->me;

  180.     const int stride= c->stride;

  181.     const int uvstride= c->uvstride;

  182.     const int dxy= subx + (suby<<(1+qpel)); //FIXME log2_subpel?

  183.     const int hx= subx + (x<<(1+qpel));

  184.     const int hy= suby + (y<<(1+qpel));

  185.     uint8_t * const * const ref= c->ref[ref_index];

  186.     uint8_t * const * const src= c->src[src_index];

  187.     int d;

  188.     //FIXME check chroma 4mv, (no crashes ...)

  189.         int uvdxy;              /* no, it might not be used uninitialized */

  190.         if(dxy){

  191.             if(qpel){

  192.                 c->qpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride); //FIXME prototype (add h)

  193.                 if(chroma){

  194.                     int cx= hx/2;

  195.                     int cy= hy/2;

  196.                     cx= (cx>>1)|(cx&1);

  197.                     cy= (cy>>1)|(cy&1);

  198.                     uvdxy= (cx&1) + 2*(cy&1);

  199.                     //FIXME x/y wrong, but mpeg4 qpel is sick anyway, we should drop as much of it as possible in favor for h264

  200.                 }

  201.             }else{

  202.                 c->hpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride, h);

  203.                 if(chroma)

  204.                     uvdxy= dxy | (x&1) | (2*(y&1));

  205.             }

  206.             d = cmp_func(s, c->temp, src[0], stride, h);

  207.         }else{

  208.             d = cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);

  209.             if(chroma)

  210.                 uvdxy= (x&1) + 2*(y&1);

  211.         }

  212.         if(chroma){

  213.             uint8_t * const uvtemp= c->temp + 16*stride;

  214.             c->hpel_put[size+1][uvdxy](uvtemp  , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);

  215.             c->hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);

  216.             d += chroma_cmp_func(s, uvtemp  , src[1], uvstride, h>>1);

  217.             d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);

  218.         }

  219.     return d;

  220. }

  221. 

  222. static int cmp_simple(MpegEncContext *s, const int x, const int y,

  223.                       int ref_index, int src_index,

  224.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func){

  225.     return cmp_inline(s,x,y,0,0,0,16,ref_index,src_index, cmp_func, chroma_cmp_func, 0, 0);

  226. }

  227. 

  228. static int cmp_fpel_internal(MpegEncContext *s, const int x, const int y,

  229.                       const int size, const int h, int ref_index, int src_index,

  230.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

  231.     if(flags&FLAG_DIRECT){

  232.         return cmp_direct_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&FLAG_QPEL);

  233.     }else{

  234.         return cmp_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&FLAG_CHROMA);

  235.     }

  236. }

  237. 

  238. static int cmp_internal(MpegEncContext *s, const int x, const int y, const int subx, const int suby,

  239.                       const int size, const int h, int ref_index, int src_index,

  240.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

  241.     if(flags&FLAG_DIRECT){

  242.         return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&FLAG_QPEL);

  243.     }else{

  244.         return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&FLAG_QPEL, flags&FLAG_CHROMA);

  245.     }

  246. }

  247. 

  248. /** @brief compares a block (either a full macroblock or a partition thereof)

  249.     against a proposed motion-compensated prediction of that block

  250.  */

  251. static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby,

  252.                       const int size, const int h, int ref_index, int src_index,

  253.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

  254.     if(av_builtin_constant_p(flags) && av_builtin_constant_p(h) && av_builtin_constant_p(size)

  255.        && av_builtin_constant_p(subx) && av_builtin_constant_p(suby)

  256.        && flags==0 && h==16 && size==0 && subx==0 && suby==0){

  257.         return cmp_simple(s,x,y,ref_index,src_index, cmp_func, chroma_cmp_func);

  258.     }else if(av_builtin_constant_p(subx) && av_builtin_constant_p(suby)

  259.        && subx==0 && suby==0){

  260.         return cmp_fpel_internal(s,x,y,size,h,ref_index,src_index, cmp_func, chroma_cmp_func,flags);

  261.     }else{

  262.         return cmp_internal(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags);

  263.     }

  264. }

  265. 

  266. static int cmp_hpel(MpegEncContext *s, const int x, const int y, const int subx, const int suby,

  267.                       const int size, const int h, int ref_index, int src_index,

  268.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

  269.     if(flags&FLAG_DIRECT){

  270.         return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0);

  271.     }else{

  272.         return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&FLAG_CHROMA);

  273.     }

  274. }

  275. 

  276. static int cmp_qpel(MpegEncContext *s, const int x, const int y, const int subx, const int suby,

  277.                       const int size, const int h, int ref_index, int src_index,

  278.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){

  279.     if(flags&FLAG_DIRECT){

  280.         return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1);

  281.     }else{

  282.         return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1, flags&FLAG_CHROMA);

  283.     }

  284. }

  285. 

  286. #include "motion_est_template.c"

  287. 

  288. static int zero_cmp(void *s, uint8_t *a, uint8_t *b, int stride, int h){

  289.     return 0;

  290. }

  291. 

  292. static void zero_hpel(uint8_t *a, const uint8_t *b, ptrdiff_t stride, int h){

  293. }

  294. 

  295. int ff_init_me(MpegEncContext *s){

  296.     MotionEstContext * const c= &s->me;

  297.     int cache_size= FFMIN(ME_MAP_SIZE>>ME_MAP_SHIFT, 1<<ME_MAP_SHIFT);

  298.     int dia_size= FFMAX(FFABS(s->avctx->dia_size)&255, FFABS(s->avctx->pre_dia_size)&255);

  299. 

  300.     if(FFMIN(s->avctx->dia_size, s->avctx->pre_dia_size) < -FFMIN(ME_MAP_SIZE, MAX_SAB_SIZE)){

  301.         av_log(s->avctx, AV_LOG_ERROR, "ME_MAP size is too small for SAB diamond\n");

  302.         return -1;

  303.     }

  304.     //special case of snow is needed because snow uses its own iterative ME code

  305.     if(s->me_method!=ME_ZERO && s->me_method!=ME_EPZS && s->me_method!=ME_X1 && s->avctx->codec_id != AV_CODEC_ID_SNOW){

  306.         av_log(s->avctx, AV_LOG_ERROR, "me_method is only allowed to be set to zero and epzs; for hex,umh,full and others see dia_size\n");

  307.         return -1;

  308.     }

  309. 

  310.     c->avctx= s->avctx;

  311. 

  312.     if(cache_size < 2*dia_size && !c->stride){

  313.         av_log(s->avctx, AV_LOG_INFO, "ME_MAP size may be a little small for the selected diamond size\n");

  314.     }

  315. 

  316.     ff_set_cmp(&s->dsp, s->dsp.me_pre_cmp, c->avctx->me_pre_cmp);

  317.     ff_set_cmp(&s->dsp, s->dsp.me_cmp, c->avctx->me_cmp);

  318.     ff_set_cmp(&s->dsp, s->dsp.me_sub_cmp, c->avctx->me_sub_cmp);

  319.     ff_set_cmp(&s->dsp, s->dsp.mb_cmp, c->avctx->mb_cmp);

  320. 

  321.     c->flags    = get_flags(c, 0, c->avctx->me_cmp    &FF_CMP_CHROMA);

  322.     c->sub_flags= get_flags(c, 0, c->avctx->me_sub_cmp&FF_CMP_CHROMA);

  323.     c->mb_flags = get_flags(c, 0, c->avctx->mb_cmp    &FF_CMP_CHROMA);

  324. 

  325. /*FIXME s->no_rounding b_type*/

  326.     if(s->flags&CODEC_FLAG_QPEL){

  327.         c->sub_motion_search= qpel_motion_search;

  328.         c->qpel_avg= s->dsp.avg_qpel_pixels_tab;

  329.         if(s->no_rounding) c->qpel_put= s->dsp.put_no_rnd_qpel_pixels_tab;

  330.         else               c->qpel_put= s->dsp.put_qpel_pixels_tab;

  331.     }else{

  332.         if(c->avctx->me_sub_cmp&FF_CMP_CHROMA)

  333.             c->sub_motion_search= hpel_motion_search;

  334.         else if(   c->avctx->me_sub_cmp == FF_CMP_SAD

  335.                 && c->avctx->    me_cmp == FF_CMP_SAD

  336.                 && c->avctx->    mb_cmp == FF_CMP_SAD)

  337.             c->sub_motion_search= sad_hpel_motion_search; // 2050 vs. 2450 cycles

  338.         else

  339.             c->sub_motion_search= hpel_motion_search;

  340.     }

  341.     c->hpel_avg= s->dsp.avg_pixels_tab;

  342.     if(s->no_rounding) c->hpel_put= s->dsp.put_no_rnd_pixels_tab;

  343.     else               c->hpel_put= s->dsp.put_pixels_tab;

  344. 

  345.     if(s->linesize){

  346.         c->stride  = s->linesize;

  347.         c->uvstride= s->uvlinesize;

  348.     }else{

  349.         c->stride  = 16*s->mb_width + 32;

  350.         c->uvstride=  8*s->mb_width + 16;

  351.     }

  352. 

  353.     /* 8x8 fullpel search would need a 4x4 chroma compare, which we do

  354.      * not have yet, and even if we had, the motion estimation code

  355.      * does not expect it. */

  356.     if(s->codec_id != AV_CODEC_ID_SNOW){

  357.         if((c->avctx->me_cmp&FF_CMP_CHROMA)/* && !s->dsp.me_cmp[2]*/){

  358.             s->dsp.me_cmp[2]= zero_cmp;

  359.         }

  360.         if((c->avctx->me_sub_cmp&FF_CMP_CHROMA) && !s->dsp.me_sub_cmp[2]){

  361.             s->dsp.me_sub_cmp[2]= zero_cmp;

  362.         }

  363.         c->hpel_put[2][0]= c->hpel_put[2][1]=

  364.         c->hpel_put[2][2]= c->hpel_put[2][3]= zero_hpel;

  365.     }

  366. 

  367.     if(s->codec_id == AV_CODEC_ID_H261){

  368.         c->sub_motion_search= no_sub_motion_search;

  369.     }

  370. 

  371.     return 0;

  372. }

  373. 

  374. #define CHECK_SAD_HALF_MV(suffix, x, y) \

  375. {\

  376.     d= s->dsp.pix_abs[size][(x?1:0)+(y?2:0)](NULL, pix, ptr+((x)>>1), stride, h);\

  377.     d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\

  378.     COPY3_IF_LT(dminh, d, dx, x, dy, y)\

  379. }

  380. 

  381. static int sad_hpel_motion_search(MpegEncContext * s,

  382.                                   int *mx_ptr, int *my_ptr, int dmin,

  383.                                   int src_index, int ref_index,

  384.                                   int size, int h)

  385. {

  386.     MotionEstContext * const c= &s->me;

  387.     const int penalty_factor= c->sub_penalty_factor;

  388.     int mx, my, dminh;

  389.     uint8_t *pix, *ptr;

  390.     int stride= c->stride;

  391.     const int flags= c->sub_flags;

  392.     LOAD_COMMON

  393. 

  394.     av_assert2(flags == 0);

  395. 

  396.     if(c->skip){

  397.         *mx_ptr = 0;

  398.         *my_ptr = 0;

  399.         return dmin;

  400.     }

  401. 

  402.     pix = c->src[src_index][0];

  403. 

  404.     mx = *mx_ptr;

  405.     my = *my_ptr;

  406.     ptr = c->ref[ref_index][0] + (my * stride) + mx;

  407. 

  408.     dminh = dmin;

  409. 

  410.     if (mx > xmin && mx < xmax &&

  411.         my > ymin && my < ymax) {

  412.         int dx=0, dy=0;

  413.         int d, pen_x, pen_y;

  414.         const int index= (my<<ME_MAP_SHIFT) + mx;

  415.         const int t= score_map[(index-(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)];

  416.         const int l= score_map[(index- 1               )&(ME_MAP_SIZE-1)];

  417.         const int r= score_map[(index+ 1               )&(ME_MAP_SIZE-1)];

  418.         const int b= score_map[(index+(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)];

  419.         mx<<=1;

  420.         my<<=1;

  421. 

  422. 

  423.         pen_x= pred_x + mx;

  424.         pen_y= pred_y + my;

  425. 

  426.         ptr-= stride;

  427.         if(t<=b){

  428.             CHECK_SAD_HALF_MV(y2 , 0, -1)

  429.             if(l<=r){

  430.                 CHECK_SAD_HALF_MV(xy2, -1, -1)

  431.                 if(t+r<=b+l){

  432.                     CHECK_SAD_HALF_MV(xy2, +1, -1)

  433.                     ptr+= stride;

  434.                 }else{

  435.                     ptr+= stride;

  436.                     CHECK_SAD_HALF_MV(xy2, -1, +1)

  437.                 }

  438.                 CHECK_SAD_HALF_MV(x2 , -1,  0)

  439.             }else{

  440.                 CHECK_SAD_HALF_MV(xy2, +1, -1)

  441.                 if(t+l<=b+r){

  442.                     CHECK_SAD_HALF_MV(xy2, -1, -1)

  443.                     ptr+= stride;

  444.                 }else{

  445.                     ptr+= stride;

  446.                     CHECK_SAD_HALF_MV(xy2, +1, +1)

  447.                 }

  448.                 CHECK_SAD_HALF_MV(x2 , +1,  0)

  449.             }

  450.         }else{

  451.             if(l<=r){

  452.                 if(t+l<=b+r){

  453.                     CHECK_SAD_HALF_MV(xy2, -1, -1)

  454.                     ptr+= stride;

  455.                 }else{

  456.                     ptr+= stride;

  457.                     CHECK_SAD_HALF_MV(xy2, +1, +1)

  458.                 }

  459.                 CHECK_SAD_HALF_MV(x2 , -1,  0)

  460.                 CHECK_SAD_HALF_MV(xy2, -1, +1)

  461.             }else{

  462.                 if(t+r<=b+l){

  463.                     CHECK_SAD_HALF_MV(xy2, +1, -1)

  464.                     ptr+= stride;

  465.                 }else{

  466.                     ptr+= stride;

  467.                     CHECK_SAD_HALF_MV(xy2, -1, +1)

  468.                 }

  469.                 CHECK_SAD_HALF_MV(x2 , +1,  0)

  470.                 CHECK_SAD_HALF_MV(xy2, +1, +1)

  471.             }

  472.             CHECK_SAD_HALF_MV(y2 ,  0, +1)

  473.         }

  474.         mx+=dx;

  475.         my+=dy;

  476. 

  477.     }else{

  478.         mx<<=1;

  479.         my<<=1;

  480.     }

  481. 

  482.     *mx_ptr = mx;

  483.     *my_ptr = my;

  484.     return dminh;

  485. }

  486. 

  487. static inline void set_p_mv_tables(MpegEncContext * s, int mx, int my, int mv4)

  488. {

  489.     const int xy= s->mb_x + s->mb_y*s->mb_stride;

  490. 

  491.     s->p_mv_table[xy][0] = mx;

  492.     s->p_mv_table[xy][1] = my;

  493. 

  494.     /* has already been set to the 4 MV if 4MV is done */

  495.     if(mv4){

  496.         int mot_xy= s->block_index[0];

  497. 

  498.         s->current_picture.motion_val[0][mot_xy    ][0] = mx;

  499.         s->current_picture.motion_val[0][mot_xy    ][1] = my;

  500.         s->current_picture.motion_val[0][mot_xy + 1][0] = mx;

  501.         s->current_picture.motion_val[0][mot_xy + 1][1] = my;

  502. 

  503.         mot_xy += s->b8_stride;

  504.         s->current_picture.motion_val[0][mot_xy    ][0] = mx;

  505.         s->current_picture.motion_val[0][mot_xy    ][1] = my;

  506.         s->current_picture.motion_val[0][mot_xy + 1][0] = mx;

  507.         s->current_picture.motion_val[0][mot_xy + 1][1] = my;

  508.     }

  509. }

  510. 

  511. /**

  512.  * get fullpel ME search limits.

  513.  */

  514. static inline void get_limits(MpegEncContext *s, int x, int y)

  515. {

  516.     MotionEstContext * const c= &s->me;

  517.     int range= c->avctx->me_range >> (1 + !!(c->flags&FLAG_QPEL));

  518.     int max_range = MAX_MV >> (1 + !!(c->flags&FLAG_QPEL));

  519. /*

  520.     if(c->avctx->me_range) c->range= c->avctx->me_range >> 1;

  521.     else                   c->range= 16;

  522. */

  523.     if (s->unrestricted_mv) {

  524.         c->xmin = - x - 16;

  525.         c->ymin = - y - 16;

  526.         c->xmax = - x + s->width;

  527.         c->ymax = - y + s->height;

  528.     } else if (s->out_format == FMT_H261){

  529.         // Search range of H261 is different from other codec standards

  530.         c->xmin = (x > 15) ? - 15 : 0;

  531.         c->ymin = (y > 15) ? - 15 : 0;

  532.         c->xmax = (x < s->mb_width * 16 - 16) ? 15 : 0;

  533.         c->ymax = (y < s->mb_height * 16 - 16) ? 15 : 0;

  534.     } else {

  535.         c->xmin = - x;

  536.         c->ymin = - y;

  537.         c->xmax = - x + s->mb_width *16 - 16;

  538.         c->ymax = - y + s->mb_height*16 - 16;

  539.     }

  540.     if(!range || range > max_range)

  541.         range = max_range;

  542.     if(range){

  543.         c->xmin = FFMAX(c->xmin,-range);

  544.         c->xmax = FFMIN(c->xmax, range);

  545.         c->ymin = FFMAX(c->ymin,-range);

  546.         c->ymax = FFMIN(c->ymax, range);

  547.     }

  548. }

  549. 

  550. static inline void init_mv4_ref(MotionEstContext *c){

  551.     const int stride= c->stride;

  552. 

  553.     c->ref[1][0] = c->ref[0][0] + 8;

  554.     c->ref[2][0] = c->ref[0][0] + 8*stride;

  555.     c->ref[3][0] = c->ref[2][0] + 8;

  556.     c->src[1][0] = c->src[0][0] + 8;

  557.     c->src[2][0] = c->src[0][0] + 8*stride;

  558.     c->src[3][0] = c->src[2][0] + 8;

  559. }

  560. 

  561. static inline int h263_mv4_search(MpegEncContext *s, int mx, int my, int shift)

  562. {

  563.     MotionEstContext * const c= &s->me;

  564.     const int size= 1;

  565.     const int h=8;

  566.     int block;

  567.     int P[10][2];

  568.     int dmin_sum=0, mx4_sum=0, my4_sum=0, i;

  569.     int same=1;

  570.     const int stride= c->stride;

  571.     uint8_t *mv_penalty= c->current_mv_penalty;

  572.     int saftey_cliping= s->unrestricted_mv && (s->width&15) && (s->height&15);

  573. 

  574.     init_mv4_ref(c);

  575. 

  576.     for(block=0; block<4; block++){

  577.         int mx4, my4;

  578.         int pred_x4, pred_y4;

  579.         int dmin4;

  580.         static const int off[4]= {2, 1, 1, -1};

  581.         const int mot_stride = s->b8_stride;

  582.         const int mot_xy = s->block_index[block];

  583. 

  584.         if(saftey_cliping){

  585.             c->xmax = - 16*s->mb_x + s->width  - 8*(block &1);

  586.             c->ymax = - 16*s->mb_y + s->height - 8*(block>>1);

  587.         }

  588. 

  589.         P_LEFT[0] = s->current_picture.motion_val[0][mot_xy - 1][0];

  590.         P_LEFT[1] = s->current_picture.motion_val[0][mot_xy - 1][1];

  591. 

  592.         if(P_LEFT[0]       > (c->xmax<<shift)) P_LEFT[0]       = (c->xmax<<shift);

  593. 

  594.         /* special case for first line */

  595.         if (s->first_slice_line && block<2) {

  596.             c->pred_x= pred_x4= P_LEFT[0];

  597.             c->pred_y= pred_y4= P_LEFT[1];

  598.         } else {

  599.             P_TOP[0]      = s->current_picture.motion_val[0][mot_xy - mot_stride             ][0];

  600.             P_TOP[1]      = s->current_picture.motion_val[0][mot_xy - mot_stride             ][1];

  601.             P_TOPRIGHT[0] = s->current_picture.motion_val[0][mot_xy - mot_stride + off[block]][0];

  602.             P_TOPRIGHT[1] = s->current_picture.motion_val[0][mot_xy - mot_stride + off[block]][1];

  603.             if(P_TOP[1]      > (c->ymax<<shift)) P_TOP[1]     = (c->ymax<<shift);

  604.             if(P_TOPRIGHT[0] < (c->xmin<<shift)) P_TOPRIGHT[0]= (c->xmin<<shift);

  605.             if(P_TOPRIGHT[0] > (c->xmax<<shift)) P_TOPRIGHT[0]= (c->xmax<<shift);

  606.             if(P_TOPRIGHT[1] > (c->ymax<<shift)) P_TOPRIGHT[1]= (c->ymax<<shift);

  607. 

  608.             P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);

  609.             P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);

  610. 

  611.             c->pred_x= pred_x4 = P_MEDIAN[0];

  612.             c->pred_y= pred_y4 = P_MEDIAN[1];

  613.         }

  614.         P_MV1[0]= mx;

  615.         P_MV1[1]= my;

  616.         if(saftey_cliping)

  617.             for(i=0; i<10; i++){

  618.                 if(P[i][0] > (c->xmax<<shift)) P[i][0]= (c->xmax<<shift);

  619.                 if(P[i][1] > (c->ymax<<shift)) P[i][1]= (c->ymax<<shift);

  620.             }

  621. 

  622.         dmin4 = epzs_motion_search4(s, &mx4, &my4, P, block, block, s->p_mv_table, (1<<16)>>shift);

  623. 

  624.         dmin4= c->sub_motion_search(s, &mx4, &my4, dmin4, block, block, size, h);

  625. 

  626.         if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){

  627.             int dxy;

  628.             const int offset= ((block&1) + (block>>1)*stride)*8;

  629.             uint8_t *dest_y = c->scratchpad + offset;

  630.             if(s->quarter_sample){

  631.                 uint8_t *ref= c->ref[block][0] + (mx4>>2) + (my4>>2)*stride;

  632.                 dxy = ((my4 & 3) << 2) | (mx4 & 3);

  633. 

  634.                 if(s->no_rounding)

  635.                     s->dsp.put_no_rnd_qpel_pixels_tab[1][dxy](dest_y   , ref    , stride);

  636.                 else

  637.                     s->dsp.put_qpel_pixels_tab       [1][dxy](dest_y   , ref    , stride);

  638.             }else{

  639.                 uint8_t *ref= c->ref[block][0] + (mx4>>1) + (my4>>1)*stride;

  640.                 dxy = ((my4 & 1) << 1) | (mx4 & 1);

  641. 

  642.                 if(s->no_rounding)

  643.                     s->dsp.put_no_rnd_pixels_tab[1][dxy](dest_y    , ref    , stride, h);

  644.                 else

  645.                     s->dsp.put_pixels_tab       [1][dxy](dest_y    , ref    , stride, h);

  646.             }

  647.             dmin_sum+= (mv_penalty[mx4-pred_x4] + mv_penalty[my4-pred_y4])*c->mb_penalty_factor;

  648.         }else

  649.             dmin_sum+= dmin4;

  650. 

  651.         if(s->quarter_sample){

  652.             mx4_sum+= mx4/2;

  653.             my4_sum+= my4/2;

  654.         }else{

  655.             mx4_sum+= mx4;

  656.             my4_sum+= my4;

  657.         }

  658. 

  659.         s->current_picture.motion_val[0][s->block_index[block]][0] = mx4;

  660.         s->current_picture.motion_val[0][s->block_index[block]][1] = my4;

  661. 

  662.         if(mx4 != mx || my4 != my) same=0;

  663.     }

  664. 

  665.     if(same)

  666.         return INT_MAX;

  667. 

  668.     if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){

  669.         dmin_sum += s->dsp.mb_cmp[0](s, s->new_picture.f.data[0] + s->mb_x*16 + s->mb_y*16*stride, c->scratchpad, stride, 16);

  670.     }

  671. 

  672.     if(c->avctx->mb_cmp&FF_CMP_CHROMA){

  673.         int dxy;

  674.         int mx, my;

  675.         int offset;

  676. 

  677.         mx= ff_h263_round_chroma(mx4_sum);

  678.         my= ff_h263_round_chroma(my4_sum);

  679.         dxy = ((my & 1) << 1) | (mx & 1);

  680. 

  681.         offset= (s->mb_x*8 + (mx>>1)) + (s->mb_y*8 + (my>>1))*s->uvlinesize;

  682. 

  683.         if(s->no_rounding){

  684.             s->dsp.put_no_rnd_pixels_tab[1][dxy](c->scratchpad    , s->last_picture.f.data[1] + offset, s->uvlinesize, 8);

  685.             s->dsp.put_no_rnd_pixels_tab[1][dxy](c->scratchpad + 8, s->last_picture.f.data[2] + offset, s->uvlinesize, 8);

  686.         }else{

  687.             s->dsp.put_pixels_tab       [1][dxy](c->scratchpad    , s->last_picture.f.data[1] + offset, s->uvlinesize, 8);

  688.             s->dsp.put_pixels_tab       [1][dxy](c->scratchpad + 8, s->last_picture.f.data[2] + offset, s->uvlinesize, 8);

  689.         }

  690. 

  691.         dmin_sum += s->dsp.mb_cmp[1](s, s->new_picture.f.data[1] + s->mb_x*8 + s->mb_y*8*s->uvlinesize, c->scratchpad  , s->uvlinesize, 8);

  692.         dmin_sum += s->dsp.mb_cmp[1](s, s->new_picture.f.data[2] + s->mb_x*8 + s->mb_y*8*s->uvlinesize, c->scratchpad+8, s->uvlinesize, 8);

  693.     }

  694. 

  695.     c->pred_x= mx;

  696.     c->pred_y= my;

  697. 

  698.     switch(c->avctx->mb_cmp&0xFF){

  699.     /*case FF_CMP_SSE:

  700.         return dmin_sum+ 32*s->qscale*s->qscale;*/

  701.     case FF_CMP_RD:

  702.         return dmin_sum;

  703.     default:

  704.         return dmin_sum+ 11*c->mb_penalty_factor;

  705.     }

  706. }

  707. 

  708. static inline void init_interlaced_ref(MpegEncContext *s, int ref_index){

  709.     MotionEstContext * const c= &s->me;

  710. 

  711.     c->ref[1+ref_index][0] = c->ref[0+ref_index][0] + s->linesize;

  712.     c->src[1][0] = c->src[0][0] + s->linesize;

  713.     if(c->flags & FLAG_CHROMA){

  714.         c->ref[1+ref_index][1] = c->ref[0+ref_index][1] + s->uvlinesize;

  715.         c->ref[1+ref_index][2] = c->ref[0+ref_index][2] + s->uvlinesize;

  716.         c->src[1][1] = c->src[0][1] + s->uvlinesize;

  717.         c->src[1][2] = c->src[0][2] + s->uvlinesize;

  718.     }

  719. }

  720. 

  721. static int interlaced_search(MpegEncContext *s, int ref_index,

  722.                              int16_t (*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)

  723. {

  724.     MotionEstContext * const c= &s->me;

  725.     const int size=0;

  726.     const int h=8;

  727.     int block;

  728.     int P[10][2];

  729.     uint8_t * const mv_penalty= c->current_mv_penalty;

  730.     int same=1;

  731.     const int stride= 2*s->linesize;

  732.     int dmin_sum= 0;

  733.     const int mot_stride= s->mb_stride;

  734.     const int xy= s->mb_x + s->mb_y*mot_stride;

  735. 

  736.     c->ymin>>=1;

  737.     c->ymax>>=1;

  738.     c->stride<<=1;

  739.     c->uvstride<<=1;

  740.     init_interlaced_ref(s, ref_index);

  741. 

  742.     for(block=0; block<2; block++){

  743.         int field_select;

  744.         int best_dmin= INT_MAX;

  745.         int best_field= -1;

  746. 

  747.         for(field_select=0; field_select<2; field_select++){

  748.             int dmin, mx_i, my_i;

  749.             int16_t (*mv_table)[2]= mv_tables[block][field_select];

  750. 

  751.             if(user_field_select){

  752.                 av_assert1(field_select==0 || field_select==1);

  753.                 av_assert1(field_select_tables[block][xy]==0 || field_select_tables[block][xy]==1);

  754.                 if(field_select_tables[block][xy] != field_select)

  755.                     continue;

  756.             }

  757. 

  758.             P_LEFT[0] = mv_table[xy - 1][0];

  759.             P_LEFT[1] = mv_table[xy - 1][1];

  760.             if(P_LEFT[0]       > (c->xmax<<1)) P_LEFT[0]       = (c->xmax<<1);

  761. 

  762.             c->pred_x= P_LEFT[0];

  763.             c->pred_y= P_LEFT[1];

  764. 

  765.             if(!s->first_slice_line){

  766.                 P_TOP[0]      = mv_table[xy - mot_stride][0];

  767.                 P_TOP[1]      = mv_table[xy - mot_stride][1];

  768.                 P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];

  769.                 P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];

  770.                 if(P_TOP[1]      > (c->ymax<<1)) P_TOP[1]     = (c->ymax<<1);

  771.                 if(P_TOPRIGHT[0] < (c->xmin<<1)) P_TOPRIGHT[0]= (c->xmin<<1);

  772.                 if(P_TOPRIGHT[0] > (c->xmax<<1)) P_TOPRIGHT[0]= (c->xmax<<1);

  773.                 if(P_TOPRIGHT[1] > (c->ymax<<1)) P_TOPRIGHT[1]= (c->ymax<<1);

  774. 

  775.                 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);

  776.                 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);

  777.             }

  778.             P_MV1[0]= mx; //FIXME not correct if block != field_select

  779.             P_MV1[1]= my / 2;

  780. 

  781.             dmin = epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);

  782. 

  783.             dmin= c->sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);

  784. 

  785.             mv_table[xy][0]= mx_i;

  786.             mv_table[xy][1]= my_i;

  787. 

  788.             if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){

  789.                 int dxy;

  790. 

  791.                 //FIXME chroma ME

  792.                 uint8_t *ref= c->ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*stride;

  793.                 dxy = ((my_i & 1) << 1) | (mx_i & 1);

  794. 

  795.                 if(s->no_rounding){

  796.                     s->dsp.put_no_rnd_pixels_tab[size][dxy](c->scratchpad, ref    , stride, h);

  797.                 }else{

  798.                     s->dsp.put_pixels_tab       [size][dxy](c->scratchpad, ref    , stride, h);

  799.                 }

  800.                 dmin= s->dsp.mb_cmp[size](s, c->src[block][0], c->scratchpad, stride, h);

  801.                 dmin+= (mv_penalty[mx_i-c->pred_x] + mv_penalty[my_i-c->pred_y] + 1)*c->mb_penalty_factor;

  802.             }else

  803.                 dmin+= c->mb_penalty_factor; //field_select bits

  804. 

  805.             dmin += field_select != block; //slightly prefer same field

  806. 

  807.             if(dmin < best_dmin){

  808.                 best_dmin= dmin;

  809.                 best_field= field_select;

  810.             }

  811.         }

  812.         {

  813.             int16_t (*mv_table)[2]= mv_tables[block][best_field];

  814. 

  815.             if(mv_table[xy][0] != mx) same=0; //FIXME check if these checks work and are any good at all

  816.             if(mv_table[xy][1]&1) same=0;

  817.             if(mv_table[xy][1]*2 != my) same=0;

  818.             if(best_field != block) same=0;

  819.         }

  820. 

  821.         field_select_tables[block][xy]= best_field;

  822.         dmin_sum += best_dmin;

  823.     }

  824. 

  825.     c->ymin<<=1;

  826.     c->ymax<<=1;

  827.     c->stride>>=1;

  828.     c->uvstride>>=1;

  829. 

  830.     if(same)

  831.         return INT_MAX;

  832. 

  833.     switch(c->avctx->mb_cmp&0xFF){

  834.     /*case FF_CMP_SSE:

  835.         return dmin_sum+ 32*s->qscale*s->qscale;*/

  836.     case FF_CMP_RD:

  837.         return dmin_sum;

  838.     default:

  839.         return dmin_sum+ 11*c->mb_penalty_factor;

  840.     }

  841. }

  842. 

  843. static inline int get_penalty_factor(int lambda, int lambda2, int type){

  844.     switch(type&0xFF){

  845.     default:

  846.     case FF_CMP_SAD:

  847.         return lambda>>FF_LAMBDA_SHIFT;

  848.     case FF_CMP_DCT:

  849.         return (3*lambda)>>(FF_LAMBDA_SHIFT+1);

  850.     case FF_CMP_W53:

  851.         return (4*lambda)>>(FF_LAMBDA_SHIFT);

  852.     case FF_CMP_W97:

  853.         return (2*lambda)>>(FF_LAMBDA_SHIFT);

  854.     case FF_CMP_SATD:

  855.     case FF_CMP_DCT264:

  856.         return (2*lambda)>>FF_LAMBDA_SHIFT;

  857.     case FF_CMP_RD:

  858.     case FF_CMP_PSNR:

  859.     case FF_CMP_SSE:

  860.     case FF_CMP_NSSE:

  861.         return lambda2>>FF_LAMBDA_SHIFT;

  862.     case FF_CMP_BIT:

  863.         return 1;

  864.     }

  865. }

  866. 

  867. void ff_estimate_p_frame_motion(MpegEncContext * s,

  868.                                 int mb_x, int mb_y)

  869. {

  870.     MotionEstContext * const c= &s->me;

  871.     uint8_t *pix, *ppix;

  872.     int sum, mx, my, dmin;

  873.     int varc;            ///< the variance of the block (sum of squared (p[y][x]-average))

  874.     int vard;            ///< sum of squared differences with the estimated motion vector

  875.     int P[10][2];

  876.     const int shift= 1+s->quarter_sample;

  877.     int mb_type=0;

  878.     Picture * const pic= &s->current_picture;

  879. 

  880.     init_ref(c, s->new_picture.f.data, s->last_picture.f.data, NULL, 16*mb_x, 16*mb_y, 0);

  881. 

  882.     av_assert0(s->quarter_sample==0 || s->quarter_sample==1);

  883.     av_assert0(s->linesize == c->stride);

  884.     av_assert0(s->uvlinesize == c->uvstride);

  885. 

  886.     c->penalty_factor    = get_penalty_factor(s->lambda, s->lambda2, c->avctx->me_cmp);

  887.     c->sub_penalty_factor= get_penalty_factor(s->lambda, s->lambda2, c->avctx->me_sub_cmp);

  888.     c->mb_penalty_factor = get_penalty_factor(s->lambda, s->lambda2, c->avctx->mb_cmp);

  889.     c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;

  890. 

  891.     get_limits(s, 16*mb_x, 16*mb_y);

  892.     c->skip=0;

  893. 

  894.     /* intra / predictive decision */

  895.     pix = c->src[0][0];

  896.     sum = s->dsp.pix_sum(pix, s->linesize);

  897.     varc = s->dsp.pix_norm1(pix, s->linesize) - (((unsigned)sum*sum)>>8) + 500;

  898. 

  899.     pic->mb_mean[s->mb_stride * mb_y + mb_x] = (sum+128)>>8;

  900.     pic->mb_var [s->mb_stride * mb_y + mb_x] = (varc+128)>>8;

  901.     c->mb_var_sum_temp += (varc+128)>>8;

  902. 

  903.     switch(s->me_method) {

  904.     case ME_ZERO:

  905.     default:

  906.         mx   = 0;

  907.         my   = 0;

  908.         dmin = 0;

  909.         break;

  910.     case ME_X1:

  911.     case ME_EPZS:

  912.        {

  913.             const int mot_stride = s->b8_stride;

  914.             const int mot_xy = s->block_index[0];

  915. 

  916.             P_LEFT[0] = s->current_picture.motion_val[0][mot_xy - 1][0];

  917.             P_LEFT[1] = s->current_picture.motion_val[0][mot_xy - 1][1];

  918. 

  919.             if(P_LEFT[0]       > (c->xmax<<shift)) P_LEFT[0]       = (c->xmax<<shift);

  920. 

  921.             if(!s->first_slice_line) {

  922.                 P_TOP[0]      = s->current_picture.motion_val[0][mot_xy - mot_stride    ][0];

  923.                 P_TOP[1]      = s->current_picture.motion_val[0][mot_xy - mot_stride    ][1];

  924.                 P_TOPRIGHT[0] = s->current_picture.motion_val[0][mot_xy - mot_stride + 2][0];

  925.                 P_TOPRIGHT[1] = s->current_picture.motion_val[0][mot_xy - mot_stride + 2][1];

  926.                 if(P_TOP[1]      > (c->ymax<<shift)) P_TOP[1]     = (c->ymax<<shift);

  927.                 if(P_TOPRIGHT[0] < (c->xmin<<shift)) P_TOPRIGHT[0]= (c->xmin<<shift);

  928.                 if(P_TOPRIGHT[1] > (c->ymax<<shift)) P_TOPRIGHT[1]= (c->ymax<<shift);

  929. 

  930.                 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);

  931.                 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);

  932. 

  933.                 if(s->out_format == FMT_H263){

  934.                     c->pred_x = P_MEDIAN[0];

  935.                     c->pred_y = P_MEDIAN[1];

  936.                 }else { /* mpeg1 at least */

  937.                     c->pred_x= P_LEFT[0];

  938.                     c->pred_y= P_LEFT[1];

  939.                 }

  940.             }else{

  941.                 c->pred_x= P_LEFT[0];

  942.                 c->pred_y= P_LEFT[1];

  943.             }

  944. 

  945.         }

  946.         dmin = ff_epzs_motion_search(s, &mx, &my, P, 0, 0, s->p_mv_table, (1<<16)>>shift, 0, 16);

  947. 

  948.         break;

  949.     }

  950. 

  951.     /* At this point (mx,my) are full-pell and the relative displacement */

  952.     ppix = c->ref[0][0] + (my * s->linesize) + mx;

  953. 

  954.     vard = s->dsp.sse[0](NULL, pix, ppix, s->linesize, 16);

  955. 

  956.     pic->mc_mb_var[s->mb_stride * mb_y + mb_x] = (vard+128)>>8;

  957.     c->mc_mb_var_sum_temp += (vard+128)>>8;

  958. 

  959.     if(mb_type){

  960.         int p_score= FFMIN(vard, varc-500+(s->lambda2>>FF_LAMBDA_SHIFT)*100);

  961.         int i_score= varc-500+(s->lambda2>>FF_LAMBDA_SHIFT)*20;

  962.         c->scene_change_score+= ff_sqrt(p_score) - ff_sqrt(i_score);

  963. 

  964.         if(mb_type == CANDIDATE_MB_TYPE_INTER){

  965.             c->sub_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);

  966.             set_p_mv_tables(s, mx, my, 1);

  967.         }else{

  968.             mx <<=shift;

  969.             my <<=shift;

  970.         }

  971.         if(mb_type == CANDIDATE_MB_TYPE_INTER4V){

  972.             h263_mv4_search(s, mx, my, shift);

  973. 

  974.             set_p_mv_tables(s, mx, my, 0);

  975.         }

  976.         if(mb_type == CANDIDATE_MB_TYPE_INTER_I){

  977.             interlaced_search(s, 0, s->p_field_mv_table, s->p_field_select_table, mx, my, 1);

  978.         }

  979.     }else if(c->avctx->mb_decision > FF_MB_DECISION_SIMPLE){

  980.         int p_score= FFMIN(vard, varc-500+(s->lambda2>>FF_LAMBDA_SHIFT)*100);

  981.         int i_score= varc-500+(s->lambda2>>FF_LAMBDA_SHIFT)*20;

  982.         c->scene_change_score+= ff_sqrt(p_score) - ff_sqrt(i_score);

  983. 

  984.         if (vard*2 + 200*256 > varc)

  985.             mb_type|= CANDIDATE_MB_TYPE_INTRA;

  986.         if (varc*2 + 200*256 > vard || s->qscale > 24){

  987. //        if (varc*2 + 200*256 + 50*(s->lambda2>>FF_LAMBDA_SHIFT) > vard){

  988.             mb_type|= CANDIDATE_MB_TYPE_INTER;

  989.             c->sub_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);

  990.             if(s->flags&CODEC_FLAG_MV0)

  991.                 if(mx || my)

  992.                     mb_type |= CANDIDATE_MB_TYPE_SKIPPED; //FIXME check difference

  993.         }else{

  994.             mx <<=shift;

  995.             my <<=shift;

  996.         }

  997.         if((s->flags&CODEC_FLAG_4MV)

  998.            && !c->skip && varc>50<<8 && vard>10<<8){

  999.             if(h263_mv4_search(s, mx, my, shift) < INT_MAX)

  1000.                 mb_type|=CANDIDATE_MB_TYPE_INTER4V;

  1001. 

  1002.             set_p_mv_tables(s, mx, my, 0);

  1003.         }else

  1004.             set_p_mv_tables(s, mx, my, 1);

  1005.         if((s->flags&CODEC_FLAG_INTERLACED_ME)

  1006.            && !c->skip){ //FIXME varc/d checks

  1007.             if(interlaced_search(s, 0, s->p_field_mv_table, s->p_field_select_table, mx, my, 0) < INT_MAX)

  1008.                 mb_type |= CANDIDATE_MB_TYPE_INTER_I;

  1009.         }

  1010.     }else{

  1011.         int intra_score, i;

  1012.         mb_type= CANDIDATE_MB_TYPE_INTER;

  1013. 

  1014.         dmin= c->sub_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);

  1015.         if(c->avctx->me_sub_cmp != c->avctx->mb_cmp && !c->skip)

  1016.             dmin= get_mb_score(s, mx, my, 0, 0, 0, 16, 1);

  1017. 

  1018.         if((s->flags&CODEC_FLAG_4MV)

  1019.            && !c->skip && varc>50<<8 && vard>10<<8){

  1020.             int dmin4= h263_mv4_search(s, mx, my, shift);

  1021.             if(dmin4 < dmin){

  1022.                 mb_type= CANDIDATE_MB_TYPE_INTER4V;

  1023.                 dmin=dmin4;

  1024.             }

  1025.         }

  1026.         if((s->flags&CODEC_FLAG_INTERLACED_ME)

  1027.            && !c->skip){ //FIXME varc/d checks

  1028.             int dmin_i= interlaced_search(s, 0, s->p_field_mv_table, s->p_field_select_table, mx, my, 0);

  1029.             if(dmin_i < dmin){

  1030.                 mb_type = CANDIDATE_MB_TYPE_INTER_I;

  1031.                 dmin= dmin_i;

  1032.             }

  1033.         }

  1034. 

  1035.         set_p_mv_tables(s, mx, my, mb_type!=CANDIDATE_MB_TYPE_INTER4V);

  1036. 

  1037.         /* get intra luma score */

  1038.         if((c->avctx->mb_cmp&0xFF)==FF_CMP_SSE){

  1039.             intra_score= varc - 500;

  1040.         }else{

  1041.             unsigned mean = (sum+128)>>8;

  1042.             mean*= 0x01010101;

  1043. 

  1044.             for(i=0; i<16; i++){

  1045.                 *(uint32_t*)(&c->scratchpad[i*s->linesize+ 0]) = mean;

  1046.                 *(uint32_t*)(&c->scratchpad[i*s->linesize+ 4]) = mean;

  1047.                 *(uint32_t*)(&c->scratchpad[i*s->linesize+ 8]) = mean;

  1048.                 *(uint32_t*)(&c->scratchpad[i*s->linesize+12]) = mean;

  1049.             }

  1050. 

  1051.             intra_score= s->dsp.mb_cmp[0](s, c->scratchpad, pix, s->linesize, 16);

  1052.         }

  1053.         intra_score += c->mb_penalty_factor*16;

  1054. 

  1055.         if(intra_score < dmin){

  1056.             mb_type= CANDIDATE_MB_TYPE_INTRA;

  1057.             s->current_picture.mb_type[mb_y*s->mb_stride + mb_x] = CANDIDATE_MB_TYPE_INTRA; //FIXME cleanup

  1058.         }else

  1059.             s->current_picture.mb_type[mb_y*s->mb_stride + mb_x] = 0;

  1060. 

  1061.         {

  1062.             int p_score= FFMIN(vard, varc-500+(s->lambda2>>FF_LAMBDA_SHIFT)*100);

  1063.             int i_score= varc-500+(s->lambda2>>FF_LAMBDA_SHIFT)*20;

  1064.             c->scene_change_score+= ff_sqrt(p_score) - ff_sqrt(i_score);

  1065.         }

  1066.     }

  1067. 

  1068.     s->mb_type[mb_y*s->mb_stride + mb_x]= mb_type;

  1069. }

  1070. 

  1071. int ff_pre_estimate_p_frame_motion(MpegEncContext * s,

  1072.                                     int mb_x, int mb_y)

  1073. {

  1074.     MotionEstContext * const c= &s->me;

  1075.     int mx, my, dmin;

  1076.     int P[10][2];

  1077.     const int shift= 1+s->quarter_sample;

  1078.     const int xy= mb_x + mb_y*s->mb_stride;

  1079.     init_ref(c, s->new_picture.f.data, s->last_picture.f.data, NULL, 16*mb_x, 16*mb_y, 0);

  1080. 

  1081.     av_assert0(s->quarter_sample==0 || s->quarter_sample==1);

  1082. 

  1083.     c->pre_penalty_factor    = get_penalty_factor(s->lambda, s->lambda2, c->avctx->me_pre_cmp);

  1084.     c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;

  1085. 

  1086.     get_limits(s, 16*mb_x, 16*mb_y);

  1087.     c->skip=0;

  1088. 

  1089.     P_LEFT[0]       = s->p_mv_table[xy + 1][0];

  1090.     P_LEFT[1]       = s->p_mv_table[xy + 1][1];

  1091. 

  1092.     if(P_LEFT[0]       < (c->xmin<<shift)) P_LEFT[0]       = (c->xmin<<shift);

  1093. 

  1094.     /* special case for first line */

  1095.     if (s->first_slice_line) {

  1096.         c->pred_x= P_LEFT[0];

  1097.         c->pred_y= P_LEFT[1];

  1098.         P_TOP[0]= P_TOPRIGHT[0]= P_MEDIAN[0]=

  1099.         P_TOP[1]= P_TOPRIGHT[1]= P_MEDIAN[1]= 0; //FIXME

  1100.     } else {

  1101.         P_TOP[0]      = s->p_mv_table[xy + s->mb_stride    ][0];

  1102.         P_TOP[1]      = s->p_mv_table[xy + s->mb_stride    ][1];

  1103.         P_TOPRIGHT[0] = s->p_mv_table[xy + s->mb_stride - 1][0];

  1104.         P_TOPRIGHT[1] = s->p_mv_table[xy + s->mb_stride - 1][1];

  1105.         if(P_TOP[1]      < (c->ymin<<shift)) P_TOP[1]     = (c->ymin<<shift);

  1106.         if(P_TOPRIGHT[0] > (c->xmax<<shift)) P_TOPRIGHT[0]= (c->xmax<<shift);

  1107.         if(P_TOPRIGHT[1] < (c->ymin<<shift)) P_TOPRIGHT[1]= (c->ymin<<shift);

  1108. 

  1109.         P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);

  1110.         P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);

  1111. 

  1112.         c->pred_x = P_MEDIAN[0];

  1113.         c->pred_y = P_MEDIAN[1];

  1114.     }

  1115. 

  1116.     dmin = ff_epzs_motion_search(s, &mx, &my, P, 0, 0, s->p_mv_table, (1<<16)>>shift, 0, 16);

  1117. 

  1118.     s->p_mv_table[xy][0] = mx<<shift;

  1119.     s->p_mv_table[xy][1] = my<<shift;

  1120. 

  1121.     return dmin;

  1122. }

  1123. 

  1124. static int ff_estimate_motion_b(MpegEncContext * s,

  1125.                        int mb_x, int mb_y, int16_t (*mv_table)[2], int ref_index, int f_code)

  1126. {

  1127.     MotionEstContext * const c= &s->me;

  1128.     int mx, my, dmin;

  1129.     int P[10][2];

  1130.     const int shift= 1+s->quarter_sample;

  1131.     const int mot_stride = s->mb_stride;

  1132.     const int mot_xy = mb_y*mot_stride + mb_x;

  1133.     uint8_t * const mv_penalty= c->mv_penalty[f_code] + MAX_MV;

  1134.     int mv_scale;

  1135. 

  1136.     c->penalty_factor    = get_penalty_factor(s->lambda, s->lambda2, c->avctx->me_cmp);

  1137.     c->sub_penalty_factor= get_penalty_factor(s->lambda, s->lambda2, c->avctx->me_sub_cmp);

  1138.     c->mb_penalty_factor = get_penalty_factor(s->lambda, s->lambda2, c->avctx->mb_cmp);

  1139.     c->current_mv_penalty= mv_penalty;

  1140. 

  1141.     get_limits(s, 16*mb_x, 16*mb_y);

  1142. 

  1143.     switch(s->me_method) {

  1144.     case ME_ZERO:

  1145.     default:

  1146.         mx   = 0;

  1147.         my   = 0;

  1148.         dmin = 0;

  1149.         break;

  1150.     case ME_X1:

  1151.     case ME_EPZS:

  1152.         P_LEFT[0] = mv_table[mot_xy - 1][0];

  1153.         P_LEFT[1] = mv_table[mot_xy - 1][1];

  1154. 

  1155.         if (P_LEFT[0] > (c->xmax << shift)) P_LEFT[0] = (c->xmax << shift);

  1156. 

  1157.         /* special case for first line */

  1158.         if (!s->first_slice_line) {

  1159.             P_TOP[0]      = mv_table[mot_xy - mot_stride    ][0];

  1160.             P_TOP[1]      = mv_table[mot_xy - mot_stride    ][1];

  1161.             P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1][0];

  1162.             P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1][1];

  1163.             if (P_TOP[1] > (c->ymax << shift)) P_TOP[1] = (c->ymax << shift);

  1164.             if (P_TOPRIGHT[0] < (c->xmin << shift)) P_TOPRIGHT[0] = (c->xmin << shift);

  1165.             if (P_TOPRIGHT[1] > (c->ymax << shift)) P_TOPRIGHT[1] = (c->ymax << shift);

  1166. 

  1167.             P_MEDIAN[0] = mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);

  1168.             P_MEDIAN[1] = mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);

  1169.         }

  1170.         c->pred_x = P_LEFT[0];

  1171.         c->pred_y = P_LEFT[1];

  1172. 

  1173.         if(mv_table == s->b_forw_mv_table){

  1174.             mv_scale= (s->pb_time<<16) / (s->pp_time<<shift);

  1175.         }else{

  1176.             mv_scale= ((s->pb_time - s->pp_time)<<16) / (s->pp_time<<shift);

  1177.         }

  1178. 

  1179.         dmin = ff_epzs_motion_search(s, &mx, &my, P, 0, ref_index, s->p_mv_table, mv_scale, 0, 16);

  1180. 

  1181.         break;

  1182.     }

  1183. 

  1184.     dmin= c->sub_motion_search(s, &mx, &my, dmin, 0, ref_index, 0, 16);

  1185. 

  1186.     if(c->avctx->me_sub_cmp != c->avctx->mb_cmp && !c->skip)

  1187.         dmin= get_mb_score(s, mx, my, 0, ref_index, 0, 16, 1);

  1188. 

  1189. //    s->mb_type[mb_y*s->mb_width + mb_x]= mb_type;

  1190.     mv_table[mot_xy][0]= mx;

  1191.     mv_table[mot_xy][1]= my;

  1192. 

  1193.     return dmin;

  1194. }

  1195. 

  1196. static inline int check_bidir_mv(MpegEncContext * s,

  1197.                    int motion_fx, int motion_fy,

  1198.                    int motion_bx, int motion_by,

  1199.                    int pred_fx, int pred_fy,

  1200.                    int pred_bx, int pred_by,

  1201.                    int size, int h)

  1202. {

  1203.     //FIXME optimize?

  1204.     //FIXME better f_code prediction (max mv & distance)

  1205.     //FIXME pointers

  1206.     MotionEstContext * const c= &s->me;

  1207.     uint8_t * const mv_penalty_f= c->mv_penalty[s->f_code] + MAX_MV; // f_code of the prev frame

  1208.     uint8_t * const mv_penalty_b= c->mv_penalty[s->b_code] + MAX_MV; // f_code of the prev frame

  1209.     int stride= c->stride;

  1210.     uint8_t *dest_y = c->scratchpad;

  1211.     uint8_t *ptr;

  1212.     int dxy;

  1213.     int src_x, src_y;

  1214.     int fbmin;

  1215.     uint8_t **src_data= c->src[0];

  1216.     uint8_t **ref_data= c->ref[0];

  1217.     uint8_t **ref2_data= c->ref[2];

  1218. 

  1219.     if(s->quarter_sample){

  1220.         dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);

  1221.         src_x = motion_fx >> 2;

  1222.         src_y = motion_fy >> 2;

  1223. 

  1224.         ptr = ref_data[0] + (src_y * stride) + src_x;

  1225.         s->dsp.put_qpel_pixels_tab[0][dxy](dest_y    , ptr    , stride);

  1226. 

  1227.         dxy = ((motion_by & 3) << 2) | (motion_bx & 3);

  1228.         src_x = motion_bx >> 2;

  1229.         src_y = motion_by >> 2;

  1230. 

  1231.         ptr = ref2_data[0] + (src_y * stride) + src_x;

  1232.         s->dsp.avg_qpel_pixels_tab[size][dxy](dest_y    , ptr    , stride);

  1233.     }else{

  1234.         dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);

  1235.         src_x = motion_fx >> 1;

  1236.         src_y = motion_fy >> 1;

  1237. 

  1238.         ptr = ref_data[0] + (src_y * stride) + src_x;

  1239.         s->dsp.put_pixels_tab[size][dxy](dest_y    , ptr    , stride, h);

  1240. 

  1241.         dxy = ((motion_by & 1) << 1) | (motion_bx & 1);

  1242.         src_x = motion_bx >> 1;

  1243.         src_y = motion_by >> 1;

  1244. 

  1245.         ptr = ref2_data[0] + (src_y * stride) + src_x;

  1246.         s->dsp.avg_pixels_tab[size][dxy](dest_y    , ptr    , stride, h);

  1247.     }

  1248. 

  1249.     fbmin = (mv_penalty_f[motion_fx-pred_fx] + mv_penalty_f[motion_fy-pred_fy])*c->mb_penalty_factor

  1250.            +(mv_penalty_b[motion_bx-pred_bx] + mv_penalty_b[motion_by-pred_by])*c->mb_penalty_factor

  1251.            + s->dsp.mb_cmp[size](s, src_data[0], dest_y, stride, h); //FIXME new_pic

  1252. 

  1253.     if(c->avctx->mb_cmp&FF_CMP_CHROMA){

  1254.     }

  1255.     //FIXME CHROMA !!!

  1256. 

  1257.     return fbmin;

  1258. }

  1259. 

  1260. /* refine the bidir vectors in hq mode and return the score in both lq & hq mode*/

  1261. static inline int bidir_refine(MpegEncContext * s, int mb_x, int mb_y)

  1262. {

  1263.     MotionEstContext * const c= &s->me;

  1264.     const int mot_stride = s->mb_stride;

  1265.     const int xy = mb_y *mot_stride + mb_x;

  1266.     int fbmin;

  1267.     int pred_fx= s->b_bidir_forw_mv_table[xy-1][0];

  1268.     int pred_fy= s->b_bidir_forw_mv_table[xy-1][1];

  1269.     int pred_bx= s->b_bidir_back_mv_table[xy-1][0];

  1270.     int pred_by= s->b_bidir_back_mv_table[xy-1][1];

  1271.     int motion_fx= s->b_bidir_forw_mv_table[xy][0]= s->b_forw_mv_table[xy][0];

  1272.     int motion_fy= s->b_bidir_forw_mv_table[xy][1]= s->b_forw_mv_table[xy][1];

  1273.     int motion_bx= s->b_bidir_back_mv_table[xy][0]= s->b_back_mv_table[xy][0];

  1274.     int motion_by= s->b_bidir_back_mv_table[xy][1]= s->b_back_mv_table[xy][1];

  1275.     const int flags= c->sub_flags;

  1276.     const int qpel= flags&FLAG_QPEL;

  1277.     const int shift= 1+qpel;

  1278.     const int xmin= c->xmin<<shift;

  1279.     const int ymin= c->ymin<<shift;

  1280.     const int xmax= c->xmax<<shift;

  1281.     const int ymax= c->ymax<<shift;

  1282. #define HASH(fx,fy,bx,by) ((fx)+17*(fy)+63*(bx)+117*(by))

  1283. #define HASH8(fx,fy,bx,by) ((uint8_t)HASH(fx,fy,bx,by))

  1284.     int hashidx= HASH(motion_fx,motion_fy, motion_bx, motion_by);

  1285.     uint8_t map[256] = { 0 };

  1286. 

  1287.     map[hashidx&255] = 1;

  1288. 

  1289.     fbmin= check_bidir_mv(s, motion_fx, motion_fy,

  1290.                           motion_bx, motion_by,

  1291.                           pred_fx, pred_fy,

  1292.                           pred_bx, pred_by,

  1293.                           0, 16);

  1294. 

  1295.     if(s->avctx->bidir_refine){

  1296.         int end;

  1297.         static const uint8_t limittab[5]={0,8,32,64,80};

  1298.         const int limit= limittab[s->avctx->bidir_refine];

  1299.         static const int8_t vect[][4]={

  1300. { 0, 0, 0, 1}, { 0, 0, 0,-1}, { 0, 0, 1, 0}, { 0, 0,-1, 0}, { 0, 1, 0, 0}, { 0,-1, 0, 0}, { 1, 0, 0, 0}, {-1, 0, 0, 0},

  1301. 

  1302. { 0, 0, 1, 1}, { 0, 0,-1,-1}, { 0, 1, 1, 0}, { 0,-1,-1, 0}, { 1, 1, 0, 0}, {-1,-1, 0, 0}, { 1, 0, 0, 1}, {-1, 0, 0,-1},

  1303. { 0, 1, 0, 1}, { 0,-1, 0,-1}, { 1, 0, 1, 0}, {-1, 0,-1, 0},

  1304. { 0, 0,-1, 1}, { 0, 0, 1,-1}, { 0,-1, 1, 0}, { 0, 1,-1, 0}, {-1, 1, 0, 0}, { 1,-1, 0, 0}, { 1, 0, 0,-1}, {-1, 0, 0, 1},

  1305. { 0,-1, 0, 1}, { 0, 1, 0,-1}, {-1, 0, 1, 0}, { 1, 0,-1, 0},

  1306. 

  1307. { 0, 1, 1, 1}, { 0,-1,-1,-1}, { 1, 1, 1, 0}, {-1,-1,-1, 0}, { 1, 1, 0, 1}, {-1,-1, 0,-1}, { 1, 0, 1, 1}, {-1, 0,-1,-1},

  1308. { 0,-1, 1, 1}, { 0, 1,-1,-1}, {-1, 1, 1, 0}, { 1,-1,-1, 0}, { 1, 1, 0,-1}, {-1,-1, 0, 1}, { 1, 0,-1, 1}, {-1, 0, 1,-1},

  1309. { 0, 1,-1, 1}, { 0,-1, 1,-1}, { 1,-1, 1, 0}, {-1, 1,-1, 0}, {-1, 1, 0, 1}, { 1,-1, 0,-1}, { 1, 0, 1,-1}, {-1, 0,-1, 1},

  1310. { 0, 1, 1,-1}, { 0,-1,-1, 1}, { 1, 1,-1, 0}, {-1,-1, 1, 0}, { 1,-1, 0, 1}, {-1, 1, 0,-1}, {-1, 0, 1, 1}, { 1, 0,-1,-1},

  1311. 

  1312. { 1, 1, 1, 1}, {-1,-1,-1,-1},

  1313. { 1, 1, 1,-1}, {-1,-1,-1, 1}, { 1, 1,-1, 1}, {-1,-1, 1,-1}, { 1,-1, 1, 1}, {-1, 1,-1,-1}, {-1, 1, 1, 1}, { 1,-1,-1,-1},

  1314. { 1, 1,-1,-1}, {-1,-1, 1, 1}, { 1,-1,-1, 1}, {-1, 1, 1,-1}, { 1,-1, 1,-1}, {-1, 1,-1, 1},

  1315.         };

  1316.         static const uint8_t hash[]={

  1317. HASH8( 0, 0, 0, 1), HASH8( 0, 0, 0,-1), HASH8( 0, 0, 1, 0), HASH8( 0, 0,-1, 0), HASH8( 0, 1, 0, 0), HASH8( 0,-1, 0, 0), HASH8( 1, 0, 0, 0), HASH8(-1, 0, 0, 0),

  1318. 

  1319. HASH8( 0, 0, 1, 1), HASH8( 0, 0,-1,-1), HASH8( 0, 1, 1, 0), HASH8( 0,-1,-1, 0), HASH8( 1, 1, 0, 0), HASH8(-1,-1, 0, 0), HASH8( 1, 0, 0, 1), HASH8(-1, 0, 0,-1),

  1320. HASH8( 0, 1, 0, 1), HASH8( 0,-1, 0,-1), HASH8( 1, 0, 1, 0), HASH8(-1, 0,-1, 0),

  1321. HASH8( 0, 0,-1, 1), HASH8( 0, 0, 1,-1), HASH8( 0,-1, 1, 0), HASH8( 0, 1,-1, 0), HASH8(-1, 1, 0, 0), HASH8( 1,-1, 0, 0), HASH8( 1, 0, 0,-1), HASH8(-1, 0, 0, 1),

  1322. HASH8( 0,-1, 0, 1), HASH8( 0, 1, 0,-1), HASH8(-1, 0, 1, 0), HASH8( 1, 0,-1, 0),

  1323. 

  1324. HASH8( 0, 1, 1, 1), HASH8( 0,-1,-1,-1), HASH8( 1, 1, 1, 0), HASH8(-1,-1,-1, 0), HASH8( 1, 1, 0, 1), HASH8(-1,-1, 0,-1), HASH8( 1, 0, 1, 1), HASH8(-1, 0,-1,-1),

  1325. HASH8( 0,-1, 1, 1), HASH8( 0, 1,-1,-1), HASH8(-1, 1, 1, 0), HASH8( 1,-1,-1, 0), HASH8( 1, 1, 0,-1), HASH8(-1,-1, 0, 1), HASH8( 1, 0,-1, 1), HASH8(-1, 0, 1,-1),

  1326. HASH8( 0, 1,-1, 1), HASH8( 0,-1, 1,-1), HASH8( 1,-1, 1, 0), HASH8(-1, 1,-1, 0), HASH8(-1, 1, 0, 1), HASH8( 1,-1, 0,-1), HASH8( 1, 0, 1,-1), HASH8(-1, 0,-1, 1),

  1327. HASH8( 0, 1, 1,-1), HASH8( 0,-1,-1, 1), HASH8( 1, 1,-1, 0), HASH8(-1,-1, 1, 0), HASH8( 1,-1, 0, 1), HASH8(-1, 1, 0,-1), HASH8(-1, 0, 1, 1), HASH8( 1, 0,-1,-1),

  1328. 

  1329. HASH8( 1, 1, 1, 1), HASH8(-1,-1,-1,-1),

  1330. HASH8( 1, 1, 1,-1), HASH8(-1,-1,-1, 1), HASH8( 1, 1,-1, 1), HASH8(-1,-1, 1,-1), HASH8( 1,-1, 1, 1), HASH8(-1, 1,-1,-1), HASH8(-1, 1, 1, 1), HASH8( 1,-1,-1,-1),

  1331. HASH8( 1, 1,-1,-1), HASH8(-1,-1, 1, 1), HASH8( 1,-1,-1, 1), HASH8(-1, 1, 1,-1), HASH8( 1,-1, 1,-1), HASH8(-1, 1,-1, 1),

  1332. };

  1333. 

  1334. #define CHECK_BIDIR(fx,fy,bx,by)\

  1335.     if( !map[(hashidx+HASH(fx,fy,bx,by))&255]\

  1336.        &&(fx<=0 || motion_fx+fx<=xmax) && (fy<=0 || motion_fy+fy<=ymax) && (bx<=0 || motion_bx+bx<=xmax) && (by<=0 || motion_by+by<=ymax)\

  1337.        &&(fx>=0 || motion_fx+fx>=xmin) && (fy>=0 || motion_fy+fy>=ymin) && (bx>=0 || motion_bx+bx>=xmin) && (by>=0 || motion_by+by>=ymin)){\

  1338.         int score;\

  1339.         map[(hashidx+HASH(fx,fy,bx,by))&255] = 1;\

  1340.         score= check_bidir_mv(s, motion_fx+fx, motion_fy+fy, motion_bx+bx, motion_by+by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);\

  1341.         if(score < fbmin){\

  1342.             hashidx += HASH(fx,fy,bx,by);\

  1343.             fbmin= score;\

  1344.             motion_fx+=fx;\

  1345.             motion_fy+=fy;\

  1346.             motion_bx+=bx;\

  1347.             motion_by+=by;\

  1348.             end=0;\

  1349.         }\

  1350.     }

  1351. #define CHECK_BIDIR2(a,b,c,d)\

  1352. CHECK_BIDIR(a,b,c,d)\

  1353. CHECK_BIDIR(-(a),-(b),-(c),-(d))

  1354. 

  1355.         do{

  1356.             int i;

  1357.             int borderdist=0;

  1358.             end=1;

  1359. 

  1360.             CHECK_BIDIR2(0,0,0,1)

  1361.             CHECK_BIDIR2(0,0,1,0)

  1362.             CHECK_BIDIR2(0,1,0,0)

  1363.             CHECK_BIDIR2(1,0,0,0)

  1364. 

  1365.             for(i=8; i<limit; i++){

  1366.                 int fx= motion_fx+vect[i][0];

  1367.                 int fy= motion_fy+vect[i][1];

  1368.                 int bx= motion_bx+vect[i][2];

  1369.                 int by= motion_by+vect[i][3];

  1370.                 if(borderdist<=0){

  1371.                     int a= (xmax - FFMAX(fx,bx))|(FFMIN(fx,bx) - xmin);

  1372.                     int b= (ymax - FFMAX(fy,by))|(FFMIN(fy,by) - ymin);

  1373.                     if((a|b) < 0)

  1374.                         map[(hashidx+hash[i])&255] = 1;

  1375.                 }

  1376.                 if(!map[(hashidx+hash[i])&255]){

  1377.                     int score;

  1378.                     map[(hashidx+hash[i])&255] = 1;

  1379.                     score= check_bidir_mv(s, fx, fy, bx, by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);

  1380.                     if(score < fbmin){

  1381.                         hashidx += hash[i];

  1382.                         fbmin= score;

  1383.                         motion_fx=fx;

  1384.                         motion_fy=fy;

  1385.                         motion_bx=bx;

  1386.                         motion_by=by;

  1387.                         end=0;

  1388.                         borderdist--;

  1389.                         if(borderdist<=0){

  1390.                             int a= FFMIN(xmax - FFMAX(fx,bx), FFMIN(fx,bx) - xmin);

  1391.                             int b= FFMIN(ymax - FFMAX(fy,by), FFMIN(fy,by) - ymin);

  1392.                             borderdist= FFMIN(a,b);

  1393.                         }

  1394.                     }

  1395.                 }

  1396.             }

  1397.         }while(!end);

  1398.     }

  1399. 

  1400.     s->b_bidir_forw_mv_table[xy][0]= motion_fx;

  1401.     s->b_bidir_forw_mv_table[xy][1]= motion_fy;

  1402.     s->b_bidir_back_mv_table[xy][0]= motion_bx;

  1403.     s->b_bidir_back_mv_table[xy][1]= motion_by;

  1404. 

  1405.     return fbmin;

  1406. }

  1407. 

  1408. static inline int direct_search(MpegEncContext * s, int mb_x, int mb_y)

  1409. {

  1410.     MotionEstContext * const c= &s->me;

  1411.     int P[10][2];

  1412.     const int mot_stride = s->mb_stride;

  1413.     const int mot_xy = mb_y*mot_stride + mb_x;

  1414.     const int shift= 1+s->quarter_sample;

  1415.     int dmin, i;

  1416.     const int time_pp= s->pp_time;

  1417.     const int time_pb= s->pb_time;

  1418.     int mx, my, xmin, xmax, ymin, ymax;

  1419.     int16_t (*mv_table)[2]= s->b_direct_mv_table;

  1420. 

  1421.     c->current_mv_penalty= c->mv_penalty[1] + MAX_MV;

  1422.     ymin= xmin=(-32)>>shift;

  1423.     ymax= xmax=   31>>shift;

  1424. 

  1425.     if (IS_8X8(s->next_picture.mb_type[mot_xy])) {

  1426.         s->mv_type= MV_TYPE_8X8;

  1427.     }else{

  1428.         s->mv_type= MV_TYPE_16X16;

  1429.     }

  1430. 

  1431.     for(i=0; i<4; i++){

  1432.         int index= s->block_index[i];

  1433.         int min, max;

  1434. 

  1435.         c->co_located_mv[i][0] = s->next_picture.motion_val[0][index][0];

  1436.         c->co_located_mv[i][1] = s->next_picture.motion_val[0][index][1];

  1437.         c->direct_basis_mv[i][0]= c->co_located_mv[i][0]*time_pb/time_pp + ((i& 1)<<(shift+3));

  1438.         c->direct_basis_mv[i][1]= c->co_located_mv[i][1]*time_pb/time_pp + ((i>>1)<<(shift+3));

  1439. //        c->direct_basis_mv[1][i][0]= c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(shift+3);

  1440. //        c->direct_basis_mv[1][i][1]= c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(shift+3);

  1441. 

  1442.         max= FFMAX(c->direct_basis_mv[i][0], c->direct_basis_mv[i][0] - c->co_located_mv[i][0])>>shift;

  1443.         min= FFMIN(c->direct_basis_mv[i][0], c->direct_basis_mv[i][0] - c->co_located_mv[i][0])>>shift;

  1444.         max+= 16*mb_x + 1; // +-1 is for the simpler rounding

  1445.         min+= 16*mb_x - 1;

  1446.         xmax= FFMIN(xmax, s->width - max);

  1447.         xmin= FFMAX(xmin, - 16     - min);

  1448. 

  1449.         max= FFMAX(c->direct_basis_mv[i][1], c->direct_basis_mv[i][1] - c->co_located_mv[i][1])>>shift;

  1450.         min= FFMIN(c->direct_basis_mv[i][1], c->direct_basis_mv[i][1] - c->co_located_mv[i][1])>>shift;

  1451.         max+= 16*mb_y + 1; // +-1 is for the simpler rounding

  1452.         min+= 16*mb_y - 1;

  1453.         ymax= FFMIN(ymax, s->height - max);

  1454.         ymin= FFMAX(ymin, - 16      - min);

  1455. 

  1456.         if(s->mv_type == MV_TYPE_16X16) break;

  1457.     }

  1458. 

  1459.     av_assert2(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);

  1460. 

  1461.     if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){

  1462.         s->b_direct_mv_table[mot_xy][0]= 0;

  1463.         s->b_direct_mv_table[mot_xy][1]= 0;

  1464. 

  1465.         return 256*256*256*64;

  1466.     }

  1467. 

  1468.     c->xmin= xmin;

  1469.     c->ymin= ymin;

  1470.     c->xmax= xmax;

  1471.     c->ymax= ymax;

  1472.     c->flags     |= FLAG_DIRECT;

  1473.     c->sub_flags |= FLAG_DIRECT;

  1474.     c->pred_x=0;

  1475.     c->pred_y=0;

  1476. 

  1477.     P_LEFT[0]        = av_clip(mv_table[mot_xy - 1][0], xmin<<shift, xmax<<shift);

  1478.     P_LEFT[1]        = av_clip(mv_table[mot_xy - 1][1], ymin<<shift, ymax<<shift);

  1479. 

  1480.     /* special case for first line */

  1481.     if (!s->first_slice_line) { //FIXME maybe allow this over thread boundary as it is clipped

  1482.         P_TOP[0]      = av_clip(mv_table[mot_xy - mot_stride             ][0], xmin<<shift, xmax<<shift);

  1483.         P_TOP[1]      = av_clip(mv_table[mot_xy - mot_stride             ][1], ymin<<shift, ymax<<shift);

  1484.         P_TOPRIGHT[0] = av_clip(mv_table[mot_xy - mot_stride + 1         ][0], xmin<<shift, xmax<<shift);

  1485.         P_TOPRIGHT[1] = av_clip(mv_table[mot_xy - mot_stride + 1         ][1], ymin<<shift, ymax<<shift);

  1486. 

  1487.         P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);

  1488.         P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);

  1489.     }

  1490. 

  1491.     dmin = ff_epzs_motion_search(s, &mx, &my, P, 0, 0, mv_table, 1<<(16-shift), 0, 16);

  1492.     if(c->sub_flags&FLAG_QPEL)

  1493.         dmin = qpel_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);

  1494.     else

  1495.         dmin = hpel_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);

  1496. 

  1497.     if(c->avctx->me_sub_cmp != c->avctx->mb_cmp && !c->skip)

  1498.         dmin= get_mb_score(s, mx, my, 0, 0, 0, 16, 1);

  1499. 

  1500.     get_limits(s, 16*mb_x, 16*mb_y); //restore c->?min/max, maybe not needed

  1501. 

  1502.     mv_table[mot_xy][0]= mx;

  1503.     mv_table[mot_xy][1]= my;

  1504.     c->flags     &= ~FLAG_DIRECT;

  1505.     c->sub_flags &= ~FLAG_DIRECT;

  1506. 

  1507.     return dmin;

  1508. }

  1509. 

  1510. void ff_estimate_b_frame_motion(MpegEncContext * s,

  1511.                              int mb_x, int mb_y)

  1512. {

  1513.     MotionEstContext * const c= &s->me;

  1514.     const int penalty_factor= c->mb_penalty_factor;

  1515.     int fmin, bmin, dmin, fbmin, bimin, fimin;

  1516.     int type=0;

  1517.     const int xy = mb_y*s->mb_stride + mb_x;

  1518.     init_ref(c, s->new_picture.f.data, s->last_picture.f.data,

  1519.              s->next_picture.f.data, 16 * mb_x, 16 * mb_y, 2);

  1520. 

  1521.     get_limits(s, 16*mb_x, 16*mb_y);

  1522. 

  1523.     c->skip=0;

  1524. 

  1525.     if (s->codec_id == AV_CODEC_ID_MPEG4 && s->next_picture.mbskip_table[xy]) {

  1526.         int score= direct_search(s, mb_x, mb_y); //FIXME just check 0,0

  1527. 

  1528.         score= ((unsigned)(score*score + 128*256))>>16;

  1529.         c->mc_mb_var_sum_temp += score;

  1530.         s->current_picture.mc_mb_var[mb_y*s->mb_stride + mb_x] = score; //FIXME use SSE

  1531.         s->mb_type[mb_y*s->mb_stride + mb_x]= CANDIDATE_MB_TYPE_DIRECT0;

  1532. 

  1533.         return;

  1534.     }

  1535. 

  1536.     if (s->codec_id == AV_CODEC_ID_MPEG4)

  1537.         dmin= direct_search(s, mb_x, mb_y);

  1538.     else

  1539.         dmin= INT_MAX;

  1540. //FIXME penalty stuff for non mpeg4

  1541.     c->skip=0;

  1542.     fmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, 0, s->f_code) + 3*penalty_factor;

  1543. 

  1544.     c->skip=0;

  1545.     bmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, 2, s->b_code) + 2*penalty_factor;

  1546.     av_dlog(s, " %d %d ", s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1]);

  1547. 

  1548.     c->skip=0;

  1549.     fbmin= bidir_refine(s, mb_x, mb_y) + penalty_factor;

  1550.     av_dlog(s, "%d %d %d %d\n", dmin, fmin, bmin, fbmin);

  1551. 

  1552.     if(s->flags & CODEC_FLAG_INTERLACED_ME){

  1553. //FIXME mb type penalty

  1554.         c->skip=0;

  1555.         c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;

  1556.         fimin= interlaced_search(s, 0,

  1557.                                  s->b_field_mv_table[0], s->b_field_select_table[0],

  1558.                                  s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1], 0);

  1559.         c->current_mv_penalty= c->mv_penalty[s->b_code] + MAX_MV;

  1560.         bimin= interlaced_search(s, 2,

  1561.                                  s->b_field_mv_table[1], s->b_field_select_table[1],

  1562.                                  s->b_back_mv_table[xy][0], s->b_back_mv_table[xy][1], 0);

  1563.     }else

  1564.         fimin= bimin= INT_MAX;

  1565. 

  1566.     {

  1567.         int score= fmin;

  1568.         type = CANDIDATE_MB_TYPE_FORWARD;

  1569. 

  1570.         if (dmin <= score){

  1571.             score = dmin;

  1572.             type = CANDIDATE_MB_TYPE_DIRECT;

  1573.         }

  1574.         if(bmin<score){

  1575.             score=bmin;

  1576.             type= CANDIDATE_MB_TYPE_BACKWARD;

  1577.         }

  1578.         if(fbmin<score){

  1579.             score=fbmin;

  1580.             type= CANDIDATE_MB_TYPE_BIDIR;

  1581.         }

  1582.         if(fimin<score){

  1583.             score=fimin;

  1584.             type= CANDIDATE_MB_TYPE_FORWARD_I;

  1585.         }

  1586.         if(bimin<score){

  1587.             score=bimin;

  1588.             type= CANDIDATE_MB_TYPE_BACKWARD_I;

  1589.         }

  1590. 

  1591.         score= ((unsigned)(score*score + 128*256))>>16;

  1592.         c->mc_mb_var_sum_temp += score;

  1593.         s->current_picture.mc_mb_var[mb_y*s->mb_stride + mb_x] = score; //FIXME use SSE

  1594.     }

  1595. 

  1596.     if(c->avctx->mb_decision > FF_MB_DECISION_SIMPLE){

  1597.         type= CANDIDATE_MB_TYPE_FORWARD | CANDIDATE_MB_TYPE_BACKWARD | CANDIDATE_MB_TYPE_BIDIR | CANDIDATE_MB_TYPE_DIRECT;

  1598.         if(fimin < INT_MAX)

  1599.             type |= CANDIDATE_MB_TYPE_FORWARD_I;

  1600.         if(bimin < INT_MAX)

  1601.             type |= CANDIDATE_MB_TYPE_BACKWARD_I;

  1602.         if(fimin < INT_MAX && bimin < INT_MAX){

  1603.             type |= CANDIDATE_MB_TYPE_BIDIR_I;

  1604.         }

  1605.          //FIXME something smarter

  1606.         if(dmin>256*256*16) type&= ~CANDIDATE_MB_TYPE_DIRECT; //do not try direct mode if it is invalid for this MB

  1607.         if(s->codec_id == AV_CODEC_ID_MPEG4 && type&CANDIDATE_MB_TYPE_DIRECT && s->flags&CODEC_FLAG_MV0 && *(uint32_t*)s->b_direct_mv_table[xy])

  1608.             type |= CANDIDATE_MB_TYPE_DIRECT0;

  1609.     }

  1610. 

  1611.     s->mb_type[mb_y*s->mb_stride + mb_x]= type;

  1612. }

  1613. 

  1614. /* find best f_code for ME which do unlimited searches */

  1615. int ff_get_best_fcode(MpegEncContext * s, int16_t (*mv_table)[2], int type)

  1616. {

  1617.     if(s->me_method>=ME_EPZS){

  1618.         int score[8];

  1619.         int i, y, range= s->avctx->me_range ? s->avctx->me_range : (INT_MAX/2);

  1620.         uint8_t * fcode_tab= s->fcode_tab;

  1621.         int best_fcode=-1;

  1622.         int best_score=-10000000;

  1623. 

  1624.         if(s->msmpeg4_version)

  1625.             range= FFMIN(range, 16);

  1626.         else if(s->codec_id == AV_CODEC_ID_MPEG2VIDEO && s->avctx->strict_std_compliance >= FF_COMPLIANCE_NORMAL)

  1627.             range= FFMIN(range, 256);

  1628. 

  1629.         for(i=0; i<8; i++) score[i]= s->mb_num*(8-i);

  1630. 

  1631.         for(y=0; y<s->mb_height; y++){

  1632.             int x;

  1633.             int xy= y*s->mb_stride;

  1634.             for(x=0; x<s->mb_width; x++){

  1635.                 if(s->mb_type[xy] & type){

  1636.                     int mx= mv_table[xy][0];

  1637.                     int my= mv_table[xy][1];

  1638.                     int fcode= FFMAX(fcode_tab[mx + MAX_MV],

  1639.                                      fcode_tab[my + MAX_MV]);

  1640.                     int j;

  1641. 

  1642.                         if(mx >= range || mx < -range ||

  1643.                            my >= range || my < -range)

  1644.                             continue;

  1645. 

  1646.                     for(j=0; j<fcode && j<8; j++){

  1647.                         if(s->pict_type==AV_PICTURE_TYPE_B || s->current_picture.mc_mb_var[xy] < s->current_picture.mb_var[xy])

  1648.                             score[j]-= 170;

  1649.                     }

  1650.                 }

  1651.                 xy++;

  1652.             }

  1653.         }

  1654. 

  1655.         for(i=1; i<8; i++){

  1656.             if(score[i] > best_score){

  1657.                 best_score= score[i];

  1658.                 best_fcode= i;

  1659.             }

  1660.         }

  1661. 

  1662.         return best_fcode;

  1663.     }else{

  1664.         return 1;

  1665.     }

  1666. }

  1667. 

  1668. void ff_fix_long_p_mvs(MpegEncContext * s)

  1669. {

  1670.     MotionEstContext * const c= &s->me;

  1671.     const int f_code= s->f_code;

  1672.     int y, range;

  1673.     av_assert0(s->pict_type==AV_PICTURE_TYPE_P);

  1674. 

  1675.     range = (((s->out_format == FMT_MPEG1 || s->msmpeg4_version) ? 8 : 16) << f_code);

  1676. 

  1677.     av_assert0(range <= 16 || !s->msmpeg4_version);

  1678.     av_assert0(range <=256 || !(s->codec_id == AV_CODEC_ID_MPEG2VIDEO && s->avctx->strict_std_compliance >= FF_COMPLIANCE_NORMAL));

  1679. 

  1680.     if(c->avctx->me_range && range > c->avctx->me_range) range= c->avctx->me_range;

  1681. 

  1682.     if(s->flags&CODEC_FLAG_4MV){

  1683.         const int wrap= s->b8_stride;

  1684. 

  1685.         /* clip / convert to intra 8x8 type MVs */

  1686.         for(y=0; y<s->mb_height; y++){

  1687.             int xy= y*2*wrap;

  1688.             int i= y*s->mb_stride;

  1689.             int x;

  1690. 

  1691.             for(x=0; x<s->mb_width; x++){

  1692.                 if(s->mb_type[i]&CANDIDATE_MB_TYPE_INTER4V){

  1693.                     int block;

  1694.                     for(block=0; block<4; block++){

  1695.                         int off= (block& 1) + (block>>1)*wrap;

  1696.                         int mx = s->current_picture.motion_val[0][ xy + off ][0];

  1697.                         int my = s->current_picture.motion_val[0][ xy + off ][1];

  1698. 

  1699.                         if(   mx >=range || mx <-range

  1700.                            || my >=range || my <-range){

  1701.                             s->mb_type[i] &= ~CANDIDATE_MB_TYPE_INTER4V;

  1702.                             s->mb_type[i] |= CANDIDATE_MB_TYPE_INTRA;

  1703.                             s->current_picture.mb_type[i] = CANDIDATE_MB_TYPE_INTRA;

  1704.                         }

  1705.                     }

  1706.                 }

  1707.                 xy+=2;

  1708.                 i++;

  1709.             }

  1710.         }

  1711.     }

  1712. }

  1713. 

  1714. /**

  1715.  *

  1716.  * @param truncate 1 for truncation, 0 for using intra

  1717.  */

  1718. void ff_fix_long_mvs(MpegEncContext * s, uint8_t *field_select_table, int field_select,

  1719.                      int16_t (*mv_table)[2], int f_code, int type, int truncate)

  1720. {

  1721.     MotionEstContext * const c= &s->me;

  1722.     int y, h_range, v_range;

  1723. 

  1724.     // RAL: 8 in MPEG-1, 16 in MPEG-4

  1725.     int range = (((s->out_format == FMT_MPEG1 || s->msmpeg4_version) ? 8 : 16) << f_code);

  1726. 

  1727.     if(c->avctx->me_range && range > c->avctx->me_range) range= c->avctx->me_range;

  1728. 

  1729.     h_range= range;

  1730.     v_range= field_select_table ? range>>1 : range;

  1731. 

  1732.     /* clip / convert to intra 16x16 type MVs */

  1733.     for(y=0; y<s->mb_height; y++){

  1734.         int x;

  1735.         int xy= y*s->mb_stride;

  1736.         for(x=0; x<s->mb_width; x++){

  1737.             if (s->mb_type[xy] & type){    // RAL: "type" test added...

  1738.                 if(field_select_table==NULL || field_select_table[xy] == field_select){

  1739.                     if(   mv_table[xy][0] >=h_range || mv_table[xy][0] <-h_range

  1740.                        || mv_table[xy][1] >=v_range || mv_table[xy][1] <-v_range){

  1741. 

  1742.                         if(truncate){

  1743.                             if     (mv_table[xy][0] > h_range-1) mv_table[xy][0]=  h_range-1;

  1744.                             else if(mv_table[xy][0] < -h_range ) mv_table[xy][0]= -h_range;

  1745.                             if     (mv_table[xy][1] > v_range-1) mv_table[xy][1]=  v_range-1;

  1746.                             else if(mv_table[xy][1] < -v_range ) mv_table[xy][1]= -v_range;

  1747.                         }else{

  1748.                             s->mb_type[xy] &= ~type;

  1749.                             s->mb_type[xy] |= CANDIDATE_MB_TYPE_INTRA;

  1750.                             mv_table[xy][0]=

  1751.                             mv_table[xy][1]= 0;

  1752.                         }

  1753.                     }

  1754.                 }

  1755.             }

  1756.             xy++;

  1757.         }

  1758.     }

  1759. }