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

1767 lines
68KB
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 "mpegutils.h"

  37. #include "mpegvideo.h"

  38. 

  39. #undef NDEBUG

  40. #include <assert.h>

  41. 

  42. #define P_LEFT P[1]

  43. #define P_TOP P[2]

  44. #define P_TOPRIGHT P[3]

  45. #define P_MEDIAN P[4]

  46. #define P_MV1 P[9]

  47. 

  48. #define ME_MAP_SHIFT 3

  49. #define ME_MAP_MV_BITS 11

  50. 

  51. static int sad_hpel_motion_search(MpegEncContext * s,

  52.                                   int *mx_ptr, int *my_ptr, int dmin,

  53.                                   int src_index, int ref_index,

  54.                                   int size, int h);

  55. 

  56. static inline unsigned update_map_generation(MotionEstContext *c)

  57. {

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

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

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

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

  62.     }

  63.     return c->map_generation;

  64. }

  65. 

  66. /* shape adaptive search stuff */

  67. typedef struct Minima{

  68.     int height;

  69.     int x, y;

  70.     int checked;

  71. }Minima;

  72. 

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

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

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

  76. 

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

  78. }

  79. 

  80. #define FLAG_QPEL   1 //must be 1

  81. #define FLAG_CHROMA 2

  82. #define FLAG_DIRECT 4

  83. 

  84. 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){

  85.     const int offset[3]= {

  86.           y*c->  stride + x,

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

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

  89.     };

  90.     int i;

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

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

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

  94.     }

  95.     if(ref_index){

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

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

  98.         }

  99.     }

  100. }

  101. 

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

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

  104.            + (direct ? FLAG_DIRECT : 0)

  105.            + (chroma ? FLAG_CHROMA : 0);

  106. }

  107. 

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

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

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

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

  112.     const int stride= c->stride;

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

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

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

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

  117.     int d;

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

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

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

  121.             const int time_pp= s->pp_time;

  122.             const int time_pb= s->pb_time;

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

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

  125.                 int i;

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

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

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

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

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

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

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

  133. 

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

  135.                     if(qpel){

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

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

  138.                     }else{

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

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

  141.                     }

  142.                 }

  143.             }else{

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

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

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

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

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

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

  150. 

  151.                 if(qpel){

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

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

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

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

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

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

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

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

  160.                 }else{

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

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

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

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

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

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

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

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

  169. 

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

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

  172.                 }

  173.             }

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

  175.         }else

  176.             d= 256*256*256*32;

  177.     return d;

  178. }

  179. 

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

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

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

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

  184.     const int stride= c->stride;

  185.     const int uvstride= c->uvstride;

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

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

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

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

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

  191.     int d;

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

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

  194.         if(dxy){

  195.             if(qpel){

  196.                 if (h << size == 16) {

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

  198.                 } else if (size == 0 && h == 8) {

  199.                     c->qpel_put[1][dxy](c->temp    , ref[0] + x + y*stride    , stride);

  200.                     c->qpel_put[1][dxy](c->temp + 8, ref[0] + x + y*stride + 8, stride);

  201.                 } else

  202.                     av_assert2(0);

  203.                 if(chroma){

  204.                     int cx= hx/2;

  205.                     int cy= hy/2;

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

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

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

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

  210.                 }

  211.             }else{

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

  213.                 if(chroma)

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

  215.             }

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

  217.         }else{

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

  219.             if(chroma)

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

  221.         }

  222.         if(chroma){

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

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

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

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

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

  228.         }

  229.     return d;

  230. }

  231. 

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

  233.                       int ref_index, int src_index,

  234.                       me_cmp_func cmp_func, me_cmp_func chroma_cmp_func){

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

  236. }

  237. 

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

  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,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&FLAG_QPEL);

  243.     }else{

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

  245.     }

  246. }

  247. 

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

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

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

  251.     if(flags&FLAG_DIRECT){

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

  253.     }else{

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

  255.     }

  256. }

  257. 

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

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

  260.  */

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

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

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

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

  265.        && av_builtin_constant_p(subx) && av_builtin_constant_p(suby)

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

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

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

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

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

  271.     }else{

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

  273.     }

  274. }

  275. 

  276. static int cmp_hpel(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, 0);

  281.     }else{

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

  283.     }

  284. }

  285. 

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

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

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

  289.     if(flags&FLAG_DIRECT){

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

  291.     }else{

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

  293.     }

  294. }

  295. 

  296. #include "motion_est_template.c"

  297. 

  298. static int zero_cmp(MpegEncContext *s, uint8_t *a, uint8_t *b,

  299.                     ptrdiff_t stride, int h)

  300. {

  301.     return 0;

  302. }

  303. 

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

  305. }

  306. 

  307. int ff_init_me(MpegEncContext *s){

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

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

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

  311. 

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

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

  314.         return -1;

  315.     }

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

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

  318.         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");

  319.         return -1;

  320.     }

  321. 

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

  323. 

  324.     if(s->codec_id == AV_CODEC_ID_H261)

  325.         c->avctx->me_sub_cmp = c->avctx->me_cmp;

  326. 

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

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

  329.     }

  330. 

  331.     ff_set_cmp(&s->mecc, s->mecc.me_pre_cmp, c->avctx->me_pre_cmp);

  332.     ff_set_cmp(&s->mecc, s->mecc.me_cmp,     c->avctx->me_cmp);

  333.     ff_set_cmp(&s->mecc, s->mecc.me_sub_cmp, c->avctx->me_sub_cmp);

  334.     ff_set_cmp(&s->mecc, s->mecc.mb_cmp,     c->avctx->mb_cmp);

  335. 

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

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

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

  339. 

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

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

  342.         c->sub_motion_search= qpel_motion_search;

  343.         c->qpel_avg = s->qdsp.avg_qpel_pixels_tab;

  344.         if (s->no_rounding)

  345.             c->qpel_put = s->qdsp.put_no_rnd_qpel_pixels_tab;

  346.         else

  347.             c->qpel_put = s->qdsp.put_qpel_pixels_tab;

  348.     }else{

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

  350.             c->sub_motion_search= hpel_motion_search;

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

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

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

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

  355.         else

  356.             c->sub_motion_search= hpel_motion_search;

  357.     }

  358.     c->hpel_avg = s->hdsp.avg_pixels_tab;

  359.     if (s->no_rounding)

  360.         c->hpel_put = s->hdsp.put_no_rnd_pixels_tab;

  361.     else

  362.         c->hpel_put = s->hdsp.put_pixels_tab;

  363. 

  364.     if(s->linesize){

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

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

  367.     }else{

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

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

  370.     }

  371. 

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

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

  374.      * does not expect it. */

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

  376.         if ((c->avctx->me_cmp & FF_CMP_CHROMA) /* && !s->mecc.me_cmp[2] */)

  377.             s->mecc.me_cmp[2] = zero_cmp;

  378.         if ((c->avctx->me_sub_cmp & FF_CMP_CHROMA) && !s->mecc.me_sub_cmp[2])

  379.             s->mecc.me_sub_cmp[2] = zero_cmp;

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

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

  382.     }

  383. 

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

  385.         c->sub_motion_search= no_sub_motion_search;

  386.     }

  387. 

  388.     return 0;

  389. }

  390. 

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

  392. {\

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

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

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

  396. }

  397. 

  398. static int sad_hpel_motion_search(MpegEncContext * s,

  399.                                   int *mx_ptr, int *my_ptr, int dmin,

  400.                                   int src_index, int ref_index,

  401.                                   int size, int h)

  402. {

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

  404.     const int penalty_factor= c->sub_penalty_factor;

  405.     int mx, my, dminh;

  406.     uint8_t *pix, *ptr;

  407.     int stride= c->stride;

  408.     LOAD_COMMON

  409. 

  410.     av_assert2(c->sub_flags == 0);

  411. 

  412.     if(c->skip){

  413.         *mx_ptr = 0;

  414.         *my_ptr = 0;

  415.         return dmin;

  416.     }

  417. 

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

  419. 

  420.     mx = *mx_ptr;

  421.     my = *my_ptr;

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

  423. 

  424.     dminh = dmin;

  425. 

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

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

  428.         int dx=0, dy=0;

  429.         int d, pen_x, pen_y;

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

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

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

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

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

  435.         mx<<=1;

  436.         my<<=1;

  437. 

  438. 

  439.         pen_x= pred_x + mx;

  440.         pen_y= pred_y + my;

  441. 

  442.         ptr-= stride;

  443.         if(t<=b){

  444.             CHECK_SAD_HALF_MV(y2 , 0, -1)

  445.             if(l<=r){

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

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

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

  449.                     ptr+= stride;

  450.                 }else{

  451.                     ptr+= stride;

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

  453.                 }

  454.                 CHECK_SAD_HALF_MV(x2 , -1,  0)

  455.             }else{

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

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

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

  459.                     ptr+= stride;

  460.                 }else{

  461.                     ptr+= stride;

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

  463.                 }

  464.                 CHECK_SAD_HALF_MV(x2 , +1,  0)

  465.             }

  466.         }else{

  467.             if(l<=r){

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

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

  470.                     ptr+= stride;

  471.                 }else{

  472.                     ptr+= stride;

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

  474.                 }

  475.                 CHECK_SAD_HALF_MV(x2 , -1,  0)

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

  477.             }else{

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

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

  480.                     ptr+= stride;

  481.                 }else{

  482.                     ptr+= stride;

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

  484.                 }

  485.                 CHECK_SAD_HALF_MV(x2 , +1,  0)

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

  487.             }

  488.             CHECK_SAD_HALF_MV(y2 ,  0, +1)

  489.         }

  490.         mx+=dx;

  491.         my+=dy;

  492. 

  493.     }else{

  494.         mx<<=1;

  495.         my<<=1;

  496.     }

  497. 

  498.     *mx_ptr = mx;

  499.     *my_ptr = my;

  500.     return dminh;

  501. }

  502. 

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

  504. {

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

  506. 

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

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

  509. 

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

  511.     if(mv4){

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

  513. 

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

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

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

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

  518. 

  519.         mot_xy += s->b8_stride;

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

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

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

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

  524.     }

  525. }

  526. 

  527. /**

  528.  * get fullpel ME search limits.

  529.  */

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

  531. {

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

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

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

  535. /*

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

  537.     else                   c->range= 16;

  538. */

  539.     if (s->unrestricted_mv) {

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

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

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

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

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

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

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

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

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

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

  550.     } else {

  551.         c->xmin = - x;

  552.         c->ymin = - y;

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

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

  555.     }

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

  557.         range = max_range;

  558.     if(range){

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

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

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

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

  563.     }

  564. }

  565. 

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

  567.     const int stride= c->stride;

  568. 

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

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

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

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

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

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

  575. }

  576. 

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

  578. {

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

  580.     const int size= 1;

  581.     const int h=8;

  582.     int block;

  583.     int P[10][2];

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

  585.     int same=1;

  586.     const int stride= c->stride;

  587.     uint8_t *mv_penalty= c->current_mv_penalty;

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

  589. 

  590.     init_mv4_ref(c);

  591. 

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

  593.         int mx4, my4;

  594.         int pred_x4, pred_y4;

  595.         int dmin4;

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

  597.         const int mot_stride = s->b8_stride;

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

  599. 

  600.         if(saftey_cliping){

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

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

  603.         }

  604. 

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

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

  607. 

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

  609. 

  610.         /* special case for first line */

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

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

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

  614.         } else {

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

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

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

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

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

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

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

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

  623. 

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

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

  626. 

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

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

  629.         }

  630.         P_MV1[0]= mx;

  631.         P_MV1[1]= my;

  632.         if(saftey_cliping)

  633.             for(i=1; i<10; i++){

  634.                 if (s->first_slice_line && block<2 && i>1 && i<9)

  635.                     continue;

  636.                 if (i>4 && i<9)

  637.                     continue;

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

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

  640.             }

  641. 

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

  643. 

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

  645. 

  646.         if (s->mecc.me_sub_cmp[0] != s->mecc.mb_cmp[0]) {

  647.             int dxy;

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

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

  650.             if(s->quarter_sample){

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

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

  653. 

  654.                 if(s->no_rounding)

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

  656.                 else

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

  658.             }else{

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

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

  661. 

  662.                 if(s->no_rounding)

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

  664.                 else

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

  666.             }

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

  668.         }else

  669.             dmin_sum+= dmin4;

  670. 

  671.         if(s->quarter_sample){

  672.             mx4_sum+= mx4/2;

  673.             my4_sum+= my4/2;

  674.         }else{

  675.             mx4_sum+= mx4;

  676.             my4_sum+= my4;

  677.         }

  678. 

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

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

  681. 

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

  683.     }

  684. 

  685.     if(same)

  686.         return INT_MAX;

  687. 

  688.     if (s->mecc.me_sub_cmp[0] != s->mecc.mb_cmp[0]) {

  689.         dmin_sum += s->mecc.mb_cmp[0](s,

  690.                                       s->new_picture.f->data[0] +

  691.                                       s->mb_x * 16 + s->mb_y * 16 * stride,

  692.                                       c->scratchpad, stride, 16);

  693.     }

  694. 

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

  696.         int dxy;

  697.         int mx, my;

  698.         int offset;

  699. 

  700.         mx= ff_h263_round_chroma(mx4_sum);

  701.         my= ff_h263_round_chroma(my4_sum);

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

  703. 

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

  705. 

  706.         if(s->no_rounding){

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

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

  709.         }else{

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

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

  712.         }

  713. 

  714.         dmin_sum += s->mecc.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);

  715.         dmin_sum += s->mecc.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);

  716.     }

  717. 

  718.     c->pred_x= mx;

  719.     c->pred_y= my;

  720. 

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

  722.     /*case FF_CMP_SSE:

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

  724.     case FF_CMP_RD:

  725.         return dmin_sum;

  726.     default:

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

  728.     }

  729. }

  730. 

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

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

  733. 

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

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

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

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

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

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

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

  741.     }

  742. }

  743. 

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

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

  746. {

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

  748.     const int size=0;

  749.     const int h=8;

  750.     int block;

  751.     int P[10][2];

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

  753.     int same=1;

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

  755.     int dmin_sum= 0;

  756.     const int mot_stride= s->mb_stride;

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

  758. 

  759.     c->ymin>>=1;

  760.     c->ymax>>=1;

  761.     c->stride<<=1;

  762.     c->uvstride<<=1;

  763.     init_interlaced_ref(s, ref_index);

  764. 

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

  766.         int field_select;

  767.         int best_dmin= INT_MAX;

  768.         int best_field= -1;

  769. 

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

  771.             int dmin, mx_i, my_i;

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

  773. 

  774.             if(user_field_select){

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

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

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

  778.                     continue;

  779.             }

  780. 

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

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

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

  784. 

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

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

  787. 

  788.             if(!s->first_slice_line){

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

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

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

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

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

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

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

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

  797. 

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

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

  800.             }

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

  802.             P_MV1[1]= my / 2;

  803. 

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

  805. 

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

  807. 

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

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

  810. 

  811.             if (s->mecc.me_sub_cmp[0] != s->mecc.mb_cmp[0]) {

  812.                 int dxy;

  813. 

  814.                 //FIXME chroma ME

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

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

  817. 

  818.                 if(s->no_rounding){

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

  820.                 }else{

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

  822.                 }

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

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

  825.             }else

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

  827. 

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

  829. 

  830.             if(dmin < best_dmin){

  831.                 best_dmin= dmin;

  832.                 best_field= field_select;

  833.             }

  834.         }

  835.         {

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

  837. 

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

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

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

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

  842.         }

  843. 

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

  845.         dmin_sum += best_dmin;

  846.     }

  847. 

  848.     c->ymin<<=1;

  849.     c->ymax<<=1;

  850.     c->stride>>=1;

  851.     c->uvstride>>=1;

  852. 

  853.     if(same)

  854.         return INT_MAX;

  855. 

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

  857.     /*case FF_CMP_SSE:

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

  859.     case FF_CMP_RD:

  860.         return dmin_sum;

  861.     default:

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

  863.     }

  864. }

  865. 

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

  867.     switch(type&0xFF){

  868.     default:

  869.     case FF_CMP_SAD:

  870.         return lambda>>FF_LAMBDA_SHIFT;

  871.     case FF_CMP_DCT:

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

  873.     case FF_CMP_W53:

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

  875.     case FF_CMP_W97:

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

  877.     case FF_CMP_SATD:

  878.     case FF_CMP_DCT264:

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

  880.     case FF_CMP_RD:

  881.     case FF_CMP_PSNR:

  882.     case FF_CMP_SSE:

  883.     case FF_CMP_NSSE:

  884.         return lambda2>>FF_LAMBDA_SHIFT;

  885.     case FF_CMP_BIT:

  886.         return 1;

  887.     }

  888. }

  889. 

  890. void ff_estimate_p_frame_motion(MpegEncContext * s,

  891.                                 int mb_x, int mb_y)

  892. {

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

  894.     uint8_t *pix, *ppix;

  895.     int sum, mx, my, dmin;

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

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

  898.     int P[10][2];

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

  900.     int mb_type=0;

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

  902. 

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

  904. 

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

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

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

  908. 

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

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

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

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

  913. 

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

  915.     c->skip=0;

  916. 

  917.     /* intra / predictive decision */

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

  919.     sum  = s->mpvencdsp.pix_sum(pix, s->linesize);

  920.     varc = s->mpvencdsp.pix_norm1(pix, s->linesize) -

  921.            (((unsigned) sum * sum) >> 8) + 500;

  922. 

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

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

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

  926. 

  927.     switch(s->me_method) {

  928.     case ME_ZERO:

  929.     default:

  930.         mx   = 0;

  931.         my   = 0;

  932.         dmin = 0;

  933.         break;

  934.     case ME_X1:

  935.     case ME_EPZS:

  936.        {

  937.             const int mot_stride = s->b8_stride;

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

  939. 

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

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

  942. 

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

  944. 

  945.             if(!s->first_slice_line) {

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

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

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

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

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

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

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

  953. 

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

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

  956. 

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

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

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

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

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

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

  963.                 }

  964.             }else{

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

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

  967.             }

  968. 

  969.         }

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

  971. 

  972.         break;

  973.     }

  974. 

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

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

  977. 

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

  979. 

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

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

  982. 

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

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

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

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

  987. 

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

  989.             mb_type|= CANDIDATE_MB_TYPE_INTRA;

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

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

  992.             mb_type|= CANDIDATE_MB_TYPE_INTER;

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

  994.             if (s->mpv_flags & FF_MPV_FLAG_MV0)

  995.                 if(mx || my)

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

  997.         }else{

  998.             mx <<=shift;

  999.             my <<=shift;

  1000.         }

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

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

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

  1004.                 mb_type|=CANDIDATE_MB_TYPE_INTER4V;

  1005. 

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

  1007.         }else

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

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

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

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

  1012.                 mb_type |= CANDIDATE_MB_TYPE_INTER_I;

  1013.         }

  1014.     }else{

  1015.         int intra_score, i;

  1016.         mb_type= CANDIDATE_MB_TYPE_INTER;

  1017. 

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

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

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

  1021. 

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

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

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

  1025.             if(dmin4 < dmin){

  1026.                 mb_type= CANDIDATE_MB_TYPE_INTER4V;

  1027.                 dmin=dmin4;

  1028.             }

  1029.         }

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

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

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

  1033.             if(dmin_i < dmin){

  1034.                 mb_type = CANDIDATE_MB_TYPE_INTER_I;

  1035.                 dmin= dmin_i;

  1036.             }

  1037.         }

  1038. 

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

  1040. 

  1041.         /* get intra luma score */

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

  1043.             intra_score= varc - 500;

  1044.         }else{

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

  1046.             mean*= 0x01010101;

  1047. 

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

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

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

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

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

  1053.             }

  1054. 

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

  1056.         }

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

  1058. 

  1059.         if(intra_score < dmin){

  1060.             mb_type= CANDIDATE_MB_TYPE_INTRA;

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

  1062.         }else

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

  1064. 

  1065.         {

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

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

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

  1069.         }

  1070.     }

  1071. 

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

  1073. }

  1074. 

  1075. int ff_pre_estimate_p_frame_motion(MpegEncContext * s,

  1076.                                     int mb_x, int mb_y)

  1077. {

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

  1079.     int mx, my, dmin;

  1080.     int P[10][2];

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

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

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

  1084. 

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

  1086. 

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

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

  1089. 

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

  1091.     c->skip=0;

  1092. 

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

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

  1095. 

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

  1097. 

  1098.     /* special case for first line */

  1099.     if (s->first_slice_line) {

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

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

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

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

  1104.     } else {

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

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

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

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

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

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

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

  1112. 

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

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

  1115. 

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

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

  1118.     }

  1119. 

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

  1121. 

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

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

  1124. 

  1125.     return dmin;

  1126. }

  1127. 

  1128. static int estimate_motion_b(MpegEncContext *s, int mb_x, int mb_y,

  1129.                              int16_t (*mv_table)[2], int ref_index, int f_code)

  1130. {

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

  1132.     int mx, my, dmin;

  1133.     int P[10][2];

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

  1135.     const int mot_stride = s->mb_stride;

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

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

  1138.     int mv_scale;

  1139. 

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

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

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

  1143.     c->current_mv_penalty= mv_penalty;

  1144. 

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

  1146. 

  1147.     switch(s->me_method) {

  1148.     case ME_ZERO:

  1149.     default:

  1150.         mx   = 0;

  1151.         my   = 0;

  1152.         dmin = 0;

  1153.         break;

  1154.     case ME_X1:

  1155.     case ME_EPZS:

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

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

  1158. 

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

  1160. 

  1161.         /* special case for first line */

  1162.         if (!s->first_slice_line) {

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

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

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

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

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

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

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

  1170. 

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

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

  1173.         }

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

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

  1176. 

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

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

  1179.         }else{

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

  1181.         }

  1182. 

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

  1184. 

  1185.         break;

  1186.     }

  1187. 

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

  1189. 

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

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

  1192. 

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

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

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

  1196. 

  1197.     return dmin;

  1198. }

  1199. 

  1200. static inline int check_bidir_mv(MpegEncContext * s,

  1201.                    int motion_fx, int motion_fy,

  1202.                    int motion_bx, int motion_by,

  1203.                    int pred_fx, int pred_fy,

  1204.                    int pred_bx, int pred_by,

  1205.                    int size, int h)

  1206. {

  1207.     //FIXME optimize?

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

  1209.     //FIXME pointers

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

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

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

  1213.     int stride= c->stride;

  1214.     uint8_t *dest_y = c->scratchpad;

  1215.     uint8_t *ptr;

  1216.     int dxy;

  1217.     int src_x, src_y;

  1218.     int fbmin;

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

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

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

  1222. 

  1223.     if(s->quarter_sample){

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

  1225.         src_x = motion_fx >> 2;

  1226.         src_y = motion_fy >> 2;

  1227. 

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

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

  1230. 

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

  1232.         src_x = motion_bx >> 2;

  1233.         src_y = motion_by >> 2;

  1234. 

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

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

  1237.     }else{

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

  1239.         src_x = motion_fx >> 1;

  1240.         src_y = motion_fy >> 1;

  1241. 

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

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

  1244. 

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

  1246.         src_x = motion_bx >> 1;

  1247.         src_y = motion_by >> 1;

  1248. 

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

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

  1251.     }

  1252. 

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

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

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

  1256. 

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

  1258.     }

  1259.     //FIXME CHROMA !!!

  1260. 

  1261.     return fbmin;

  1262. }

  1263. 

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

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

  1266. {

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

  1268.     const int mot_stride = s->mb_stride;

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

  1270.     int fbmin;

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

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

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

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

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

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

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

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

  1279.     const int flags= c->sub_flags;

  1280.     const int qpel= flags&FLAG_QPEL;

  1281.     const int shift= 1+qpel;

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

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

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

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

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

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

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

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

  1290. 

  1291.     map[hashidx&255] = 1;

  1292. 

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

  1294.                           motion_bx, motion_by,

  1295.                           pred_fx, pred_fy,

  1296.                           pred_bx, pred_by,

  1297.                           0, 16);

  1298. 

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

  1300.         int end;

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

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

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

  1304. { 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},

  1305. 

  1306. { 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},

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

  1308. { 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},

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

  1310. 

  1311. { 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},

  1312. { 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},

  1313. { 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},

  1314. { 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},

  1315. 

  1316. { 1, 1, 1, 1}, {-1,-1,-1,-1},

  1317. { 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},

  1318. { 1, 1,-1,-1}, {-1,-1, 1, 1}, { 1,-1,-1, 1}, {-1, 1, 1,-1}, { 1,-1, 1,-1}, {-1, 1,-1, 1},

  1319.         };

  1320.         static const uint8_t hash[]={

  1321. 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),

  1322. 

  1323. 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),

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

  1325. 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),

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

  1327. 

  1328. 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),

  1329. 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),

  1330. 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),

  1331. 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),

  1332. 

  1333. HASH8( 1, 1, 1, 1), HASH8(-1,-1,-1,-1),

  1334. 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),

  1335. 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),

  1336. };

  1337. 

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

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

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

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

  1342.         int score;\

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

  1344.         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);\

  1345.         if(score < fbmin){\

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

  1347.             fbmin= score;\

  1348.             motion_fx+=fx;\

  1349.             motion_fy+=fy;\

  1350.             motion_bx+=bx;\

  1351.             motion_by+=by;\

  1352.             end=0;\

  1353.         }\

  1354.     }

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

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

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

  1358. 

  1359.         do{

  1360.             int i;

  1361.             int borderdist=0;

  1362.             end=1;

  1363. 

  1364.             CHECK_BIDIR2(0,0,0,1)

  1365.             CHECK_BIDIR2(0,0,1,0)

  1366.             CHECK_BIDIR2(0,1,0,0)

  1367.             CHECK_BIDIR2(1,0,0,0)

  1368. 

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

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

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

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

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

  1374.                 if(borderdist<=0){

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

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

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

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

  1379.                 }

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

  1381.                     int score;

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

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

  1384.                     if(score < fbmin){

  1385.                         hashidx += hash[i];

  1386.                         fbmin= score;

  1387.                         motion_fx=fx;

  1388.                         motion_fy=fy;

  1389.                         motion_bx=bx;

  1390.                         motion_by=by;

  1391.                         end=0;

  1392.                         borderdist--;

  1393.                         if(borderdist<=0){

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

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

  1396.                             borderdist= FFMIN(a,b);

  1397.                         }

  1398.                     }

  1399.                 }

  1400.             }

  1401.         }while(!end);

  1402.     }

  1403. 

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

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

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

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

  1408. 

  1409.     return fbmin;

  1410. }

  1411. 

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

  1413. {

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

  1415.     int P[10][2];

  1416.     const int mot_stride = s->mb_stride;

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

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

  1419.     int dmin, i;

  1420.     const int time_pp= s->pp_time;

  1421.     const int time_pb= s->pb_time;

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

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

  1424. 

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

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

  1427.     ymax= xmax=   31>>shift;

  1428. 

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

  1430.         s->mv_type= MV_TYPE_8X8;

  1431.     }else{

  1432.         s->mv_type= MV_TYPE_16X16;

  1433.     }

  1434. 

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

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

  1437.         int min, max;

  1438. 

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

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

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

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

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

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

  1445. 

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

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

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

  1449.         min+= 16*mb_x - 1;

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

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

  1452. 

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

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

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

  1456.         min+= 16*mb_y - 1;

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

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

  1459. 

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

  1461.     }

  1462. 

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

  1464. 

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

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

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

  1468. 

  1469.         return 256*256*256*64;

  1470.     }

  1471. 

  1472.     c->xmin= xmin;

  1473.     c->ymin= ymin;

  1474.     c->xmax= xmax;

  1475.     c->ymax= ymax;

  1476.     c->flags     |= FLAG_DIRECT;

  1477.     c->sub_flags |= FLAG_DIRECT;

  1478.     c->pred_x=0;

  1479.     c->pred_y=0;

  1480. 

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

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

  1483. 

  1484.     /* special case for first line */

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

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

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

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

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

  1490. 

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

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

  1493.     }

  1494. 

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

  1496.     if(c->sub_flags&FLAG_QPEL)

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

  1498.     else

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

  1500. 

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

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

  1503. 

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

  1505. 

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

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

  1508.     c->flags     &= ~FLAG_DIRECT;

  1509.     c->sub_flags &= ~FLAG_DIRECT;

  1510. 

  1511.     return dmin;

  1512. }

  1513. 

  1514. void ff_estimate_b_frame_motion(MpegEncContext * s,

  1515.                              int mb_x, int mb_y)

  1516. {

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

  1518.     const int penalty_factor= c->mb_penalty_factor;

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

  1520.     int type=0;

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

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

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

  1524. 

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

  1526. 

  1527.     c->skip=0;

  1528. 

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

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

  1531. 

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

  1533.         c->mc_mb_var_sum_temp += score;

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

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

  1536. 

  1537.         return;

  1538.     }

  1539. 

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

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

  1542.     else

  1543.         dmin= INT_MAX;

  1544. //FIXME penalty stuff for non mpeg4

  1545.     c->skip=0;

  1546.     fmin = estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, 0, s->f_code) +

  1547.            3 * penalty_factor;

  1548. 

  1549.     c->skip=0;

  1550.     bmin = estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, 2, s->b_code) +

  1551.            2 * penalty_factor;

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

  1553. 

  1554.     c->skip=0;

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

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

  1557. 

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

  1559. //FIXME mb type penalty

  1560.         c->skip=0;

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

  1562.         fimin= interlaced_search(s, 0,

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

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

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

  1566.         bimin= interlaced_search(s, 2,

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

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

  1569.     }else

  1570.         fimin= bimin= INT_MAX;

  1571. 

  1572.     {

  1573.         int score= fmin;

  1574.         type = CANDIDATE_MB_TYPE_FORWARD;

  1575. 

  1576.         if (dmin <= score){

  1577.             score = dmin;

  1578.             type = CANDIDATE_MB_TYPE_DIRECT;

  1579.         }

  1580.         if(bmin<score){

  1581.             score=bmin;

  1582.             type= CANDIDATE_MB_TYPE_BACKWARD;

  1583.         }

  1584.         if(fbmin<score){

  1585.             score=fbmin;

  1586.             type= CANDIDATE_MB_TYPE_BIDIR;

  1587.         }

  1588.         if(fimin<score){

  1589.             score=fimin;

  1590.             type= CANDIDATE_MB_TYPE_FORWARD_I;

  1591.         }

  1592.         if(bimin<score){

  1593.             score=bimin;

  1594.             type= CANDIDATE_MB_TYPE_BACKWARD_I;

  1595.         }

  1596. 

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

  1598.         c->mc_mb_var_sum_temp += score;

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

  1600.     }

  1601. 

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

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

  1604.         if(fimin < INT_MAX)

  1605.             type |= CANDIDATE_MB_TYPE_FORWARD_I;

  1606.         if(bimin < INT_MAX)

  1607.             type |= CANDIDATE_MB_TYPE_BACKWARD_I;

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

  1609.             type |= CANDIDATE_MB_TYPE_BIDIR_I;

  1610.         }

  1611.          //FIXME something smarter

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

  1613.         if (s->codec_id == AV_CODEC_ID_MPEG4 && type&CANDIDATE_MB_TYPE_DIRECT &&

  1614.             s->mpv_flags & FF_MPV_FLAG_MV0 && *(uint32_t*)s->b_direct_mv_table[xy])

  1615.             type |= CANDIDATE_MB_TYPE_DIRECT0;

  1616.     }

  1617. 

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

  1619. }

  1620. 

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

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

  1623. {

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

  1625.         int score[8];

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

  1627.         uint8_t * fcode_tab= s->fcode_tab;

  1628.         int best_fcode=-1;

  1629.         int best_score=-10000000;

  1630. 

  1631.         if(s->msmpeg4_version)

  1632.             range= FFMIN(range, 16);

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

  1634.             range= FFMIN(range, 256);

  1635. 

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

  1637. 

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

  1639.             int x;

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

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

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

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

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

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

  1646.                                      fcode_tab[my + MAX_MV]);

  1647.                     int j;

  1648. 

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

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

  1651.                             continue;

  1652. 

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

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

  1655.                             score[j]-= 170;

  1656.                     }

  1657.                 }

  1658.                 xy++;

  1659.             }

  1660.         }

  1661. 

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

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

  1664.                 best_score= score[i];

  1665.                 best_fcode= i;

  1666.             }

  1667.         }

  1668. 

  1669.         return best_fcode;

  1670.     }else{

  1671.         return 1;

  1672.     }

  1673. }

  1674. 

  1675. void ff_fix_long_p_mvs(MpegEncContext * s)

  1676. {

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

  1678.     const int f_code= s->f_code;

  1679.     int y, range;

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

  1681. 

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

  1683. 

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

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

  1686. 

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

  1688. 

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

  1690.         const int wrap= s->b8_stride;

  1691. 

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

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

  1694.             int xy= y*2*wrap;

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

  1696.             int x;

  1697. 

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

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

  1700.                     int block;

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

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

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

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

  1705. 

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

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

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

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

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

  1711.                         }

  1712.                     }

  1713.                 }

  1714.                 xy+=2;

  1715.                 i++;

  1716.             }

  1717.         }

  1718.     }

  1719. }

  1720. 

  1721. /**

  1722.  *

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

  1724.  */

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

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

  1727. {

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

  1729.     int y, h_range, v_range;

  1730. 

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

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

  1733. 

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

  1735. 

  1736.     h_range= range;

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

  1738. 

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

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

  1741.         int x;

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

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

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

  1745.                 if (!field_select_table || field_select_table[xy] == field_select) {

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

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

  1748. 

  1749.                         if(truncate){

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

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

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

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

  1754.                         }else{

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

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

  1757.                             mv_table[xy][0]=

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

  1759.                         }

  1760.                     }

  1761.                 }

  1762.             }

  1763.             xy++;

  1764.         }

  1765.     }

  1766. }