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.
3472 Commits
32 Branches
748MB
Tree: ae1dbde1cf
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'ae1dbde1cf'
${ noResults }
FFmpeg/libavcodec/motion_est_template.c

1086 lines
38KB
Raw Blame History 

  1. /*

  2.  * Motion estimation 

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

  4.  *

  5.  * This library is free software; you can redistribute it and/or

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

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

  8.  * version 2 of the License, or (at your option) any later version.

  9.  *

  10.  * This library is distributed in the hope that it will be useful,

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

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

  13.  * Lesser General Public License for more details.

  14.  *

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

  16.  * License along with this library; if not, write to the Free Software

  17.  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

  18.  *

  19.  */

  20.  

  21. /**

  22.  * @file motion_est_template.c

  23.  * Motion estimation template.

  24.  */

  25. 

  26. //lets hope gcc will remove the unused vars ...(gcc 3.2.2 seems to do it ...)

  27. #define LOAD_COMMON\

  28.     uint32_t * const score_map= c->score_map;\

  29.     const int xmin= c->xmin;\

  30.     const int ymin= c->ymin;\

  31.     const int xmax= c->xmax;\

  32.     const int ymax= c->ymax;\

  33.     uint8_t *mv_penalty= c->current_mv_penalty;\

  34.     const int pred_x= c->pred_x;\

  35.     const int pred_y= c->pred_y;\

  36. 

  37. #define CHECK_HALF_MV(dx, dy, x, y)\

  38. {\

  39.     const int hx= 2*(x)+(dx);\

  40.     const int hy= 2*(y)+(dy);\

  41.     d= cmp(s, x, y, dx, dy, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);\

  42.     d += (mv_penalty[hx - pred_x] + mv_penalty[hy - pred_y])*penalty_factor;\

  43.     COPY3_IF_LT(dmin, d, bx, hx, by, hy)\

  44. }

  45. 

  46. #if 0

  47. static int hpel_motion_search)(MpegEncContext * s,

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

  49.                                   uint8_t *ref_data[3], 

  50.                                   int size)

  51. {

  52.     const int xx = 16 * s->mb_x + 8*(n&1);

  53.     const int yy = 16 * s->mb_y + 8*(n>>1);

  54.     const int mx = *mx_ptr;

  55.     const int my = *my_ptr;

  56.     const int penalty_factor= c->sub_penalty_factor;

  57.     

  58.     LOAD_COMMON

  59.     

  60.  //   INIT;

  61.  //FIXME factorize

  62.     me_cmp_func cmp, chroma_cmp, cmp_sub, chroma_cmp_sub;

  63. 

  64.     if(s->no_rounding /*FIXME b_type*/){

  65.         hpel_put= &s->dsp.put_no_rnd_pixels_tab[size];

  66.         chroma_hpel_put= &s->dsp.put_no_rnd_pixels_tab[size+1];

  67.     }else{

  68.         hpel_put=& s->dsp.put_pixels_tab[size];

  69.         chroma_hpel_put= &s->dsp.put_pixels_tab[size+1];

  70.     }

  71.     cmpf= s->dsp.me_cmp[size];

  72.     chroma_cmpf= s->dsp.me_cmp[size+1];

  73.     cmp_sub= s->dsp.me_sub_cmp[size];

  74.     chroma_cmp_sub= s->dsp.me_sub_cmp[size+1];

  75. 

  76.     if(c->skip){ //FIXME somehow move up (benchmark)

  77.         *mx_ptr = 0;

  78.         *my_ptr = 0;

  79.         return dmin;

  80.     }

  81.         

  82.     if(c->avctx->me_cmp != c->avctx->me_sub_cmp){

  83.         CMP_HPEL(dmin, 0, 0, mx, my, size);

  84.         if(mx || my)

  85.             dmin += (mv_penalty[2*mx - pred_x] + mv_penalty[2*my - pred_y])*penalty_factor;

  86.     }

  87.         

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

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

  90.         int bx=2*mx, by=2*my;

  91.         int d= dmin;

  92.         

  93.         CHECK_HALF_MV(1, 1, mx-1, my-1)

  94.         CHECK_HALF_MV(0, 1, mx  , my-1)        

  95.         CHECK_HALF_MV(1, 1, mx  , my-1)

  96.         CHECK_HALF_MV(1, 0, mx-1, my  )

  97.         CHECK_HALF_MV(1, 0, mx  , my  )

  98.         CHECK_HALF_MV(1, 1, mx-1, my  )

  99.         CHECK_HALF_MV(0, 1, mx  , my  )        

  100.         CHECK_HALF_MV(1, 1, mx  , my  )

  101. 

  102.         assert(bx >= xmin*2 || bx <= xmax*2 || by >= ymin*2 || by <= ymax*2);

  103. 

  104.         *mx_ptr = bx;

  105.         *my_ptr = by;

  106.     }else{

  107.         *mx_ptr =2*mx;

  108.         *my_ptr =2*my;

  109.     }

  110. 

  111.     return dmin;

  112. }

  113. 

  114. #else

  115. static int hpel_motion_search(MpegEncContext * s,

  116. 				  int *mx_ptr, int *my_ptr, int dmin,

  117.                                   int src_index, int ref_index,

  118.                                   int size, int h)

  119. {

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

  121.     const int mx = *mx_ptr;

  122.     const int my = *my_ptr;   

  123.     const int penalty_factor= c->sub_penalty_factor;

  124.     me_cmp_func cmp_sub, chroma_cmp_sub;

  125.     int bx=2*mx, by=2*my;

  126. 

  127.     LOAD_COMMON

  128.     int flags= c->sub_flags;

  129.     

  130.  //FIXME factorize

  131. 

  132.     cmp_sub= s->dsp.me_sub_cmp[size];

  133.     chroma_cmp_sub= s->dsp.me_sub_cmp[size+1];

  134. 

  135.     if(c->skip){ //FIXME move out of hpel?

  136.         *mx_ptr = 0;

  137.         *my_ptr = 0;

  138.         return dmin;

  139.     }

  140.         

  141.     if(c->avctx->me_cmp != c->avctx->me_sub_cmp){

  142.         dmin= cmp(s, mx, my, 0, 0, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);

  143.         if(mx || my || size>0)

  144.             dmin += (mv_penalty[2*mx - pred_x] + mv_penalty[2*my - pred_y])*penalty_factor;

  145.     }

  146.         

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

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

  149.         int d= dmin;

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

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

  152.                      + (mv_penalty[bx   - pred_x] + mv_penalty[by-2 - pred_y])*c->penalty_factor;

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

  154.                      + (mv_penalty[bx-2 - pred_x] + mv_penalty[by   - pred_y])*c->penalty_factor;

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

  156.                      + (mv_penalty[bx+2 - pred_x] + mv_penalty[by   - pred_y])*c->penalty_factor;

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

  158.                      + (mv_penalty[bx   - pred_x] + mv_penalty[by+2 - pred_y])*c->penalty_factor;

  159.     

  160. #if 1

  161.         int key;

  162.         int map_generation= c->map_generation;

  163. #ifndef NDEBUG

  164.         uint32_t *map= c->map;

  165. #endif

  166.         key= ((my-1)<<ME_MAP_MV_BITS) + (mx) + map_generation;

  167.         assert(map[(index-(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)] == key);

  168.         key= ((my+1)<<ME_MAP_MV_BITS) + (mx) + map_generation;

  169.         assert(map[(index+(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)] == key);

  170.         key= ((my)<<ME_MAP_MV_BITS) + (mx+1) + map_generation;

  171.         assert(map[(index+1)&(ME_MAP_SIZE-1)] == key);

  172.         key= ((my)<<ME_MAP_MV_BITS) + (mx-1) + map_generation;

  173.         assert(map[(index-1)&(ME_MAP_SIZE-1)] == key);

  174. #endif                

  175.         if(t<=b){

  176.             CHECK_HALF_MV(0, 1, mx  ,my-1)

  177.             if(l<=r){

  178.                 CHECK_HALF_MV(1, 1, mx-1, my-1)

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

  180.                     CHECK_HALF_MV(1, 1, mx  , my-1)

  181.                 }else{

  182.                     CHECK_HALF_MV(1, 1, mx-1, my  )

  183.                 }

  184.                 CHECK_HALF_MV(1, 0, mx-1, my  )

  185.             }else{

  186.                 CHECK_HALF_MV(1, 1, mx  , my-1)

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

  188.                     CHECK_HALF_MV(1, 1, mx-1, my-1)

  189.                 }else{

  190.                     CHECK_HALF_MV(1, 1, mx  , my  )

  191.                 }

  192.                 CHECK_HALF_MV(1, 0, mx  , my  )

  193.             }

  194.         }else{

  195.             if(l<=r){

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

  197.                     CHECK_HALF_MV(1, 1, mx-1, my-1)

  198.                 }else{

  199.                     CHECK_HALF_MV(1, 1, mx  , my  )

  200.                 }

  201.                 CHECK_HALF_MV(1, 0, mx-1, my)

  202.                 CHECK_HALF_MV(1, 1, mx-1, my)

  203.             }else{

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

  205.                     CHECK_HALF_MV(1, 1, mx  , my-1)

  206.                 }else{

  207.                     CHECK_HALF_MV(1, 1, mx-1, my)

  208.                 }

  209.                 CHECK_HALF_MV(1, 0, mx  , my)

  210.                 CHECK_HALF_MV(1, 1, mx  , my)

  211.             }

  212.             CHECK_HALF_MV(0, 1, mx  , my)

  213.         }

  214.         assert(bx >= xmin*2 && bx <= xmax*2 && by >= ymin*2 && by <= ymax*2);

  215.     }

  216. 

  217.     *mx_ptr = bx;

  218.     *my_ptr = by;

  219.     

  220.     return dmin;

  221. }

  222. #endif

  223. 

  224. static int inline get_mb_score(MpegEncContext * s, int mx, int my, int src_index,

  225.                                int ref_index)

  226. {

  227. //    const int check_luma= s->dsp.me_sub_cmp != s->dsp.mb_cmp;

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

  229.     const int size= 0;

  230.     const int h= 16;

  231.     const int penalty_factor= c->mb_penalty_factor;

  232.     const int flags= c->mb_flags;

  233.     const int qpel= flags & FLAG_QPEL;

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

  235.     me_cmp_func cmp_sub, chroma_cmp_sub;

  236.     int d;

  237. 

  238.     LOAD_COMMON

  239.     

  240.  //FIXME factorize

  241. 

  242.     cmp_sub= s->dsp.mb_cmp[size];

  243.     chroma_cmp_sub= s->dsp.mb_cmp[size+1];

  244.     

  245.     assert(!c->skip);

  246.     assert(c->avctx->me_sub_cmp != c->avctx->mb_cmp);

  247. 

  248.     d= cmp(s, mx>>(qpel+1), my>>(qpel+1), mx&mask, my&mask, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);

  249.     //FIXME check cbp before adding penalty for (0,0) vector

  250.     if(mx || my || size>0)

  251.         d += (mv_penalty[mx - pred_x] + mv_penalty[my - pred_y])*penalty_factor;

  252.         

  253.     return d;

  254. }

  255. 

  256. #define CHECK_QUARTER_MV(dx, dy, x, y)\

  257. {\

  258.     const int hx= 4*(x)+(dx);\

  259.     const int hy= 4*(y)+(dy);\

  260.     d= cmp(s, x, y, dx, dy, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\

  261.     d += (mv_penalty[hx - pred_x] + mv_penalty[hy - pred_y])*penalty_factor;\

  262.     COPY3_IF_LT(dmin, d, bx, hx, by, hy)\

  263. }

  264. 

  265. static int qpel_motion_search(MpegEncContext * s,

  266. 				  int *mx_ptr, int *my_ptr, int dmin,

  267.                                   int src_index, int ref_index,                                  

  268.                                   int size, int h)

  269. {

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

  271.     const int mx = *mx_ptr;

  272.     const int my = *my_ptr;   

  273.     const int penalty_factor= c->sub_penalty_factor;

  274.     const int map_generation= c->map_generation;

  275.     const int subpel_quality= c->avctx->me_subpel_quality;

  276.     uint32_t *map= c->map;

  277.     me_cmp_func cmpf, chroma_cmpf;

  278.     me_cmp_func cmp_sub, chroma_cmp_sub;

  279. 

  280.     LOAD_COMMON

  281.     int flags= c->sub_flags;

  282.     

  283.     cmpf= s->dsp.me_cmp[size];

  284.     chroma_cmpf= s->dsp.me_cmp[size+1]; //factorize FIXME

  285.  //FIXME factorize

  286. 

  287.     cmp_sub= s->dsp.me_sub_cmp[size];

  288.     chroma_cmp_sub= s->dsp.me_sub_cmp[size+1];

  289. 

  290.     if(c->skip){ //FIXME somehow move up (benchmark)

  291.         *mx_ptr = 0;

  292.         *my_ptr = 0;

  293.         return dmin;

  294.     }

  295.         

  296.     if(c->avctx->me_cmp != c->avctx->me_sub_cmp){

  297.         dmin= cmp(s, mx, my, 0, 0, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);

  298.         if(mx || my || size>0)

  299.             dmin += (mv_penalty[4*mx - pred_x] + mv_penalty[4*my - pred_y])*penalty_factor;

  300.     }

  301.         

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

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

  304.         int bx=4*mx, by=4*my;

  305.         int d= dmin;

  306.         int i, nx, ny;

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

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

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

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

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

  312.         const int c= score_map[(index                    )&(ME_MAP_SIZE-1)];

  313.         int best[8];

  314.         int best_pos[8][2];

  315.         

  316.         memset(best, 64, sizeof(int)*8);

  317. #if 1

  318.         if(s->me.dia_size>=2){        

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

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

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

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

  323. 

  324.             for(ny= -3; ny <= 3; ny++){

  325.                 for(nx= -3; nx <= 3; nx++){

  326.                     const int t2= nx*nx*(tr + tl - 2*t) + 4*nx*(tr-tl) + 32*t;

  327.                     const int c2= nx*nx*( r +  l - 2*c) + 4*nx*( r- l) + 32*c;

  328.                     const int b2= nx*nx*(br + bl - 2*b) + 4*nx*(br-bl) + 32*b;

  329.                     int score= ny*ny*(b2 + t2 - 2*c2) + 4*ny*(b2 - t2) + 32*c2;

  330.                     int i;

  331.                     

  332.                     if((nx&3)==0 && (ny&3)==0) continue;

  333.                     

  334.                     score += 1024*(mv_penalty[4*mx + nx - pred_x] + mv_penalty[4*my + ny - pred_y])*penalty_factor;

  335.                     

  336. //                    if(nx&1) score-=1024*c->penalty_factor;

  337. //                    if(ny&1) score-=1024*c->penalty_factor;

  338.                     

  339.                     for(i=0; i<8; i++){

  340.                         if(score < best[i]){

  341.                             memmove(&best[i+1], &best[i], sizeof(int)*(7-i));

  342.                             memmove(&best_pos[i+1][0], &best_pos[i][0], sizeof(int)*2*(7-i));

  343.                             best[i]= score;

  344.                             best_pos[i][0]= nx + 4*mx;

  345.                             best_pos[i][1]= ny + 4*my;

  346.                             break;

  347.                         }

  348.                     }

  349.                 }

  350.             }

  351.         }else{

  352.             int tl;

  353.             const int cx = 4*(r - l);

  354.             const int cx2= r + l - 2*c; 

  355.             const int cy = 4*(b - t);

  356.             const int cy2= b + t - 2*c;

  357.             int cxy;

  358.               

  359.             if(map[(index-(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)] == (my<<ME_MAP_MV_BITS) + mx + map_generation && 0){ //FIXME

  360.                 tl= score_map[(index-(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)];

  361.             }else{

  362.                 tl= cmp(s, mx-1, my-1, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);//FIXME wrong if chroma me is different

  363.             }

  364.             

  365.             cxy= 2*tl + (cx + cy)/4 - (cx2 + cy2) - 2*c; 

  366.            

  367.             assert(16*cx2 + 4*cx + 32*c == 32*r);

  368.             assert(16*cx2 - 4*cx + 32*c == 32*l);

  369.             assert(16*cy2 + 4*cy + 32*c == 32*b);

  370.             assert(16*cy2 - 4*cy + 32*c == 32*t);

  371.             assert(16*cxy + 16*cy2 + 16*cx2 - 4*cy - 4*cx + 32*c == 32*tl);

  372.             

  373.             for(ny= -3; ny <= 3; ny++){

  374.                 for(nx= -3; nx <= 3; nx++){

  375.                     int score= ny*nx*cxy + nx*nx*cx2 + ny*ny*cy2 + nx*cx + ny*cy + 32*c; //FIXME factor

  376.                     int i;

  377.                     

  378.                     if((nx&3)==0 && (ny&3)==0) continue;

  379.                 

  380.                     score += 32*(mv_penalty[4*mx + nx - pred_x] + mv_penalty[4*my + ny - pred_y])*penalty_factor;

  381. //                    if(nx&1) score-=32*c->penalty_factor;

  382.   //                  if(ny&1) score-=32*c->penalty_factor;

  383.                     

  384.                     for(i=0; i<8; i++){

  385.                         if(score < best[i]){

  386.                             memmove(&best[i+1], &best[i], sizeof(int)*(7-i));

  387.                             memmove(&best_pos[i+1][0], &best_pos[i][0], sizeof(int)*2*(7-i));

  388.                             best[i]= score;

  389.                             best_pos[i][0]= nx + 4*mx;

  390.                             best_pos[i][1]= ny + 4*my;

  391.                             break;

  392.                         }

  393.                     }

  394.                 }

  395.             }            

  396.         }

  397.         for(i=0; i<subpel_quality; i++){

  398.             nx= best_pos[i][0];

  399.             ny= best_pos[i][1];

  400.             CHECK_QUARTER_MV(nx&3, ny&3, nx>>2, ny>>2)

  401.         }

  402. 

  403. #if 0

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

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

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

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

  408. //            if(l < r && l < t && l < b && l < tl && l < bl && l < tr && l < br && bl < tl){

  409.             if(tl<br){

  410. 

  411. //            nx= FFMAX(4*mx - bx, bx - 4*mx);

  412. //            ny= FFMAX(4*my - by, by - 4*my);

  413.             

  414.             static int stats[7][7], count;

  415.             count++;

  416.             stats[4*mx - bx + 3][4*my - by + 3]++;

  417.             if(256*256*256*64 % count ==0){

  418.                 for(i=0; i<49; i++){

  419.                     if((i%7)==0) printf("\n");

  420.                     printf("%6d ", stats[0][i]);

  421.                 }

  422.                 printf("\n");

  423.             }

  424.             }

  425. #endif

  426. #else

  427. 

  428.         CHECK_QUARTER_MV(2, 2, mx-1, my-1)

  429.         CHECK_QUARTER_MV(0, 2, mx  , my-1)        

  430.         CHECK_QUARTER_MV(2, 2, mx  , my-1)

  431.         CHECK_QUARTER_MV(2, 0, mx  , my  )

  432.         CHECK_QUARTER_MV(2, 2, mx  , my  )

  433.         CHECK_QUARTER_MV(0, 2, mx  , my  )

  434.         CHECK_QUARTER_MV(2, 2, mx-1, my  )

  435.         CHECK_QUARTER_MV(2, 0, mx-1, my  )

  436.         

  437.         nx= bx;

  438.         ny= by;

  439.         

  440.         for(i=0; i<8; i++){

  441.             int ox[8]= {0, 1, 1, 1, 0,-1,-1,-1};

  442.             int oy[8]= {1, 1, 0,-1,-1,-1, 0, 1};

  443.             CHECK_QUARTER_MV((nx + ox[i])&3, (ny + oy[i])&3, (nx + ox[i])>>2, (ny + oy[i])>>2)

  444.         }

  445. #endif

  446. #if 0

  447.         //outer ring

  448.         CHECK_QUARTER_MV(1, 3, mx-1, my-1)

  449.         CHECK_QUARTER_MV(1, 2, mx-1, my-1)

  450.         CHECK_QUARTER_MV(1, 1, mx-1, my-1)

  451.         CHECK_QUARTER_MV(2, 1, mx-1, my-1)

  452.         CHECK_QUARTER_MV(3, 1, mx-1, my-1)

  453.         CHECK_QUARTER_MV(0, 1, mx  , my-1)

  454.         CHECK_QUARTER_MV(1, 1, mx  , my-1)

  455.         CHECK_QUARTER_MV(2, 1, mx  , my-1)

  456.         CHECK_QUARTER_MV(3, 1, mx  , my-1)

  457.         CHECK_QUARTER_MV(3, 2, mx  , my-1)

  458.         CHECK_QUARTER_MV(3, 3, mx  , my-1)

  459.         CHECK_QUARTER_MV(3, 0, mx  , my  )

  460.         CHECK_QUARTER_MV(3, 1, mx  , my  )

  461.         CHECK_QUARTER_MV(3, 2, mx  , my  )

  462.         CHECK_QUARTER_MV(3, 3, mx  , my  )

  463.         CHECK_QUARTER_MV(2, 3, mx  , my  )

  464.         CHECK_QUARTER_MV(1, 3, mx  , my  )

  465.         CHECK_QUARTER_MV(0, 3, mx  , my  )

  466.         CHECK_QUARTER_MV(3, 3, mx-1, my  )

  467.         CHECK_QUARTER_MV(2, 3, mx-1, my  )

  468.         CHECK_QUARTER_MV(1, 3, mx-1, my  )

  469.         CHECK_QUARTER_MV(1, 2, mx-1, my  )

  470.         CHECK_QUARTER_MV(1, 1, mx-1, my  )

  471.         CHECK_QUARTER_MV(1, 0, mx-1, my  )

  472. #endif

  473.         assert(bx >= xmin*4 && bx <= xmax*4 && by >= ymin*4 && by <= ymax*4);

  474. 

  475.         *mx_ptr = bx;

  476.         *my_ptr = by;

  477.     }else{

  478.         *mx_ptr =4*mx;

  479.         *my_ptr =4*my;

  480.     }

  481. 

  482.     return dmin;

  483. }

  484. 

  485. 

  486. #define CHECK_MV(x,y)\

  487. {\

  488.     const int key= ((y)<<ME_MAP_MV_BITS) + (x) + map_generation;\

  489.     const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);\

  490.     assert((x) >= xmin);\

  491.     assert((x) <= xmax);\

  492.     assert((y) >= ymin);\

  493.     assert((y) <= ymax);\

  494. /*printf("check_mv %d %d\n", x, y);*/\

  495.     if(map[index]!=key){\

  496.         d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\

  497.         map[index]= key;\

  498.         score_map[index]= d;\

  499.         d += (mv_penalty[((x)<<shift)-pred_x] + mv_penalty[((y)<<shift)-pred_y])*penalty_factor;\

  500. /*printf("score:%d\n", d);*/\

  501.         COPY3_IF_LT(dmin, d, best[0], x, best[1], y)\

  502.     }\

  503. }

  504. 

  505. #define CHECK_CLIPED_MV(ax,ay)\

  506. {\

  507.     const int x= ax;\

  508.     const int y= ay;\

  509.     const int x2= FFMAX(xmin, FFMIN(x, xmax));\

  510.     const int y2= FFMAX(ymin, FFMIN(y, ymax));\

  511.     CHECK_MV(x2, y2)\

  512. }

  513. 

  514. #define CHECK_MV_DIR(x,y,new_dir)\

  515. {\

  516.     const int key= ((y)<<ME_MAP_MV_BITS) + (x) + map_generation;\

  517.     const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);\

  518. /*printf("check_mv_dir %d %d %d\n", x, y, new_dir);*/\

  519.     if(map[index]!=key){\

  520.         d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\

  521.         map[index]= key;\

  522.         score_map[index]= d;\

  523.         d += (mv_penalty[((x)<<shift)-pred_x] + mv_penalty[((y)<<shift)-pred_y])*penalty_factor;\

  524. /*printf("score:%d\n", d);*/\

  525.         if(d<dmin){\

  526.             best[0]=x;\

  527.             best[1]=y;\

  528.             dmin=d;\

  529.             next_dir= new_dir;\

  530.         }\

  531.     }\

  532. }

  533. 

  534. #define check(x,y,S,v)\

  535. if( (x)<(xmin<<(S)) ) printf("%d %d %d %d %d xmin" #v, xmin, (x), (y), s->mb_x, s->mb_y);\

  536. if( (x)>(xmax<<(S)) ) printf("%d %d %d %d %d xmax" #v, xmax, (x), (y), s->mb_x, s->mb_y);\

  537. if( (y)<(ymin<<(S)) ) printf("%d %d %d %d %d ymin" #v, ymin, (x), (y), s->mb_x, s->mb_y);\

  538. if( (y)>(ymax<<(S)) ) printf("%d %d %d %d %d ymax" #v, ymax, (x), (y), s->mb_x, s->mb_y);\

  539. 

  540. #define LOAD_COMMON2\

  541.     uint32_t *map= c->map;\

  542.     const int qpel= flags&FLAG_QPEL;\

  543.     const int shift= 1+qpel;\

  544. 

  545. static always_inline int small_diamond_search(MpegEncContext * s, int *best, int dmin,

  546.                                        int src_index, int ref_index, int const penalty_factor,

  547.                                        int size, int h, int flags)

  548. {

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

  550.     me_cmp_func cmpf, chroma_cmpf;

  551.     int next_dir=-1;

  552.     LOAD_COMMON

  553.     LOAD_COMMON2

  554.     int map_generation= c->map_generation;

  555.     

  556.     cmpf= s->dsp.me_cmp[size];

  557.     chroma_cmpf= s->dsp.me_cmp[size+1];

  558. 

  559.     { /* ensure that the best point is in the MAP as h/qpel refinement needs it */

  560.         const int key= (best[1]<<ME_MAP_MV_BITS) + best[0] + map_generation;

  561.         const int index= ((best[1]<<ME_MAP_SHIFT) + best[0])&(ME_MAP_SIZE-1);

  562.         if(map[index]!=key){ //this will be executed only very rarey

  563.             score_map[index]= cmp(s, best[0], best[1], 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);

  564.             map[index]= key;

  565.         }

  566.     }

  567. 

  568.     for(;;){

  569.         int d;

  570.         const int dir= next_dir;

  571.         const int x= best[0];

  572.         const int y= best[1];

  573.         next_dir=-1;

  574. 

  575. //printf("%d", dir);

  576.         if(dir!=2 && x>xmin) CHECK_MV_DIR(x-1, y  , 0)

  577.         if(dir!=3 && y>ymin) CHECK_MV_DIR(x  , y-1, 1)

  578.         if(dir!=0 && x<xmax) CHECK_MV_DIR(x+1, y  , 2)

  579.         if(dir!=1 && y<ymax) CHECK_MV_DIR(x  , y+1, 3)

  580. 

  581.         if(next_dir==-1){

  582.             return dmin;

  583.         }

  584.     }

  585. }

  586. 

  587. static int funny_diamond_search(MpegEncContext * s, int *best, int dmin,

  588.                                        int src_index, int ref_index, int const penalty_factor,

  589.                                        int size, int h, int flags)

  590. {

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

  592.     me_cmp_func cmpf, chroma_cmpf;

  593.     int dia_size;

  594.     LOAD_COMMON

  595.     LOAD_COMMON2

  596.     int map_generation= c->map_generation;

  597.     

  598.     cmpf= s->dsp.me_cmp[size];

  599.     chroma_cmpf= s->dsp.me_cmp[size+1];

  600. 

  601.     for(dia_size=1; dia_size<=4; dia_size++){

  602.         int dir;

  603.         const int x= best[0];

  604.         const int y= best[1];

  605.         

  606.         if(dia_size&(dia_size-1)) continue;

  607. 

  608.         if(   x + dia_size > xmax

  609.            || x - dia_size < xmin

  610.            || y + dia_size > ymax

  611.            || y - dia_size < ymin)

  612.            continue;

  613.         

  614.         for(dir= 0; dir<dia_size; dir+=2){

  615.             int d;

  616. 

  617.             CHECK_MV(x + dir           , y + dia_size - dir);

  618.             CHECK_MV(x + dia_size - dir, y - dir           );

  619.             CHECK_MV(x - dir           , y - dia_size + dir);

  620.             CHECK_MV(x - dia_size + dir, y + dir           );

  621.         }

  622. 

  623.         if(x!=best[0] || y!=best[1])

  624.             dia_size=0;

  625. #if 0

  626. {

  627. int dx, dy, i;

  628. static int stats[8*8];

  629. dx= ABS(x-best[0]);

  630. dy= ABS(y-best[1]);

  631. if(dy>dx){

  632.     dx^=dy; dy^=dx; dx^=dy;

  633. }

  634. stats[dy*8 + dx] ++;

  635. if(256*256*256*64 % (stats[0]+1)==0){

  636.     for(i=0; i<64; i++){

  637.         if((i&7)==0) printf("\n");

  638.         printf("%8d ", stats[i]);

  639.     }

  640.     printf("\n");

  641. }

  642. }

  643. #endif

  644.     }

  645.     return dmin;    

  646. }

  647. 

  648. #define SAB_CHECK_MV(ax,ay)\

  649. {\

  650.     const int key= ((ay)<<ME_MAP_MV_BITS) + (ax) + map_generation;\

  651.     const int index= (((ay)<<ME_MAP_SHIFT) + (ax))&(ME_MAP_SIZE-1);\

  652. /*printf("sab check %d %d\n", ax, ay);*/\

  653.     if(map[index]!=key){\

  654.         d= cmp(s, ax, ay, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\

  655.         map[index]= key;\

  656.         score_map[index]= d;\

  657.         d += (mv_penalty[((ax)<<shift)-pred_x] + mv_penalty[((ay)<<shift)-pred_y])*penalty_factor;\

  658. /*printf("score: %d\n", d);*/\

  659.         if(d < minima[minima_count-1].height){\

  660.             int j=0;\

  661.             \

  662.             while(d >= minima[j].height) j++;\

  663. \

  664.             memmove(&minima [j+1], &minima [j], (minima_count - j - 1)*sizeof(Minima));\

  665. \

  666.             minima[j].checked= 0;\

  667.             minima[j].height= d;\

  668.             minima[j].x= ax;\

  669.             minima[j].y= ay;\

  670.             \

  671.             i=-1;\

  672.             continue;\

  673.         }\

  674.     }\

  675. }

  676. 

  677. #define MAX_SAB_SIZE 16

  678. static int sab_diamond_search(MpegEncContext * s, int *best, int dmin,

  679.                                        int src_index, int ref_index, int const penalty_factor,

  680.                                        int size, int h, int flags)

  681. {

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

  683.     me_cmp_func cmpf, chroma_cmpf;

  684.     Minima minima[MAX_SAB_SIZE];

  685.     const int minima_count= ABS(c->dia_size);

  686.     int i, j;

  687.     LOAD_COMMON

  688.     LOAD_COMMON2

  689.     int map_generation= c->map_generation;

  690.     

  691.     cmpf= s->dsp.me_cmp[size];

  692.     chroma_cmpf= s->dsp.me_cmp[size+1];

  693.     

  694.     for(j=i=0; i<ME_MAP_SIZE; i++){

  695.         uint32_t key= map[i];

  696. 

  697.         key += (1<<(ME_MAP_MV_BITS-1)) + (1<<(2*ME_MAP_MV_BITS-1));

  698.         

  699.         if((key&((-1)<<(2*ME_MAP_MV_BITS))) != map_generation) continue;

  700.         

  701.         assert(j<MAX_SAB_SIZE); //max j = number of predictors

  702.         

  703.         minima[j].height= score_map[i];

  704.         minima[j].x= key & ((1<<ME_MAP_MV_BITS)-1); key>>=ME_MAP_MV_BITS;

  705.         minima[j].y= key & ((1<<ME_MAP_MV_BITS)-1);

  706.         minima[j].x-= (1<<(ME_MAP_MV_BITS-1));

  707.         minima[j].y-= (1<<(ME_MAP_MV_BITS-1));

  708.         minima[j].checked=0;

  709.         if(minima[j].x || minima[j].y)

  710.             minima[j].height+= (mv_penalty[((minima[j].x)<<shift)-pred_x] + mv_penalty[((minima[j].y)<<shift)-pred_y])*penalty_factor;

  711.         

  712.         j++;

  713.     }

  714.     

  715.     qsort(minima, j, sizeof(Minima), minima_cmp);

  716.     

  717.     for(; j<minima_count; j++){

  718.         minima[j].height=256*256*256*64;

  719.         minima[j].checked=0;

  720.         minima[j].x= minima[j].y=0;

  721.     }

  722.     

  723.     for(i=0; i<minima_count; i++){

  724.         const int x= minima[i].x;

  725.         const int y= minima[i].y;

  726.         int d;

  727.         

  728.         if(minima[i].checked) continue;

  729.         

  730.         if(   x >= xmax || x <= xmin

  731.            || y >= ymax || y <= ymin)

  732.            continue;

  733. 

  734.         SAB_CHECK_MV(x-1, y)

  735.         SAB_CHECK_MV(x+1, y)

  736.         SAB_CHECK_MV(x  , y-1)

  737.         SAB_CHECK_MV(x  , y+1)

  738.         

  739.         minima[i].checked= 1;

  740.     }

  741.     

  742.     best[0]= minima[0].x;

  743.     best[1]= minima[0].y;

  744.     dmin= minima[0].height;

  745.     

  746.     if(   best[0] < xmax && best[0] > xmin

  747.        && best[1] < ymax && best[1] > ymin){

  748.         int d;

  749.         //ensure that the refernece samples for hpel refinement are in the map

  750.         CHECK_MV(best[0]-1, best[1])

  751.         CHECK_MV(best[0]+1, best[1])

  752.         CHECK_MV(best[0], best[1]-1)

  753.         CHECK_MV(best[0], best[1]+1)

  754.     }

  755.     return dmin;    

  756. }

  757. 

  758. static int var_diamond_search(MpegEncContext * s, int *best, int dmin,

  759.                                        int src_index, int ref_index, int const penalty_factor,

  760.                                        int size, int h, int flags)

  761. {

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

  763.     me_cmp_func cmpf, chroma_cmpf;

  764.     int dia_size;

  765.     LOAD_COMMON

  766.     LOAD_COMMON2

  767.     int map_generation= c->map_generation;

  768.     

  769.     cmpf= s->dsp.me_cmp[size];

  770.     chroma_cmpf= s->dsp.me_cmp[size+1];

  771. 

  772.     for(dia_size=1; dia_size<=c->dia_size; dia_size++){

  773.         int dir, start, end;

  774.         const int x= best[0];

  775.         const int y= best[1];

  776. 

  777.         start= FFMAX(0, y + dia_size - ymax);

  778.         end  = FFMIN(dia_size, xmax - x + 1);

  779.         for(dir= start; dir<end; dir++){

  780.             int d;

  781. 

  782. //check(x + dir,y + dia_size - dir,0, a0)

  783.             CHECK_MV(x + dir           , y + dia_size - dir);

  784.         }

  785. 

  786.         start= FFMAX(0, x + dia_size - xmax);

  787.         end  = FFMIN(dia_size, y - ymin + 1);

  788.         for(dir= start; dir<end; dir++){

  789.             int d;

  790. 

  791. //check(x + dia_size - dir, y - dir,0, a1)

  792.             CHECK_MV(x + dia_size - dir, y - dir           );

  793.         }

  794. 

  795.         start= FFMAX(0, -y + dia_size + ymin );

  796.         end  = FFMIN(dia_size, x - xmin + 1);

  797.         for(dir= start; dir<end; dir++){

  798.             int d;

  799. 

  800. //check(x - dir,y - dia_size + dir,0, a2)

  801.             CHECK_MV(x - dir           , y - dia_size + dir);

  802.         }

  803. 

  804.         start= FFMAX(0, -x + dia_size + xmin );

  805.         end  = FFMIN(dia_size, ymax - y + 1);

  806.         for(dir= start; dir<end; dir++){

  807.             int d;

  808. 

  809. //check(x - dia_size + dir, y + dir,0, a3)

  810.             CHECK_MV(x - dia_size + dir, y + dir           );

  811.         }

  812. 

  813.         if(x!=best[0] || y!=best[1])

  814.             dia_size=0;

  815. #if 0

  816. {

  817. int dx, dy, i;

  818. static int stats[8*8];

  819. dx= ABS(x-best[0]);

  820. dy= ABS(y-best[1]);

  821. stats[dy*8 + dx] ++;

  822. if(256*256*256*64 % (stats[0]+1)==0){

  823.     for(i=0; i<64; i++){

  824.         if((i&7)==0) printf("\n");

  825.         printf("%6d ", stats[i]);

  826.     }

  827.     printf("\n");

  828. }

  829. }

  830. #endif

  831.     }

  832.     return dmin;    

  833. }

  834. 

  835. static always_inline int diamond_search(MpegEncContext * s, int *best, int dmin,

  836.                                        int src_index, int ref_index, int const penalty_factor,

  837.                                        int size, int h, int flags){

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

  839.     if(c->dia_size==-1)

  840.         return funny_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  841.     else if(c->dia_size<-1)

  842.         return   sab_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  843.     else if(c->dia_size<2)

  844.         return small_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  845.     else

  846.         return   var_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  847. }

  848. 

  849. static always_inline int epzs_motion_search_internal(MpegEncContext * s, int *mx_ptr, int *my_ptr,

  850.                              int P[10][2], int src_index, int ref_index, int16_t (*last_mv)[2], 

  851.                              int ref_mv_scale, int flags)

  852. {

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

  854.     int best[2]={0, 0};

  855.     int d, dmin;

  856.     int map_generation;

  857.     const int penalty_factor= c->penalty_factor;

  858.     const int size=0;

  859.     const int h=16;

  860.     const int ref_mv_stride= s->mb_stride; //pass as arg  FIXME

  861.     const int ref_mv_xy= s->mb_x + s->mb_y*ref_mv_stride; //add to last_mv beforepassing FIXME

  862.     me_cmp_func cmpf, chroma_cmpf;

  863.     

  864.     LOAD_COMMON

  865.     LOAD_COMMON2

  866.     

  867.     cmpf= s->dsp.me_cmp[size];

  868.     chroma_cmpf= s->dsp.me_cmp[size+1];

  869.     

  870.     map_generation= update_map_generation(c);

  871. 

  872.     dmin= cmp(s, 0, 0, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);

  873.     map[0]= map_generation;

  874.     score_map[0]= dmin;

  875. 

  876.     /* first line */

  877.     if (s->first_slice_line) {

  878.         CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)

  879.         CHECK_CLIPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16, 

  880.                         (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)

  881.     }else{

  882.         if(dmin<256 && ( P_LEFT[0]    |P_LEFT[1]

  883.                         |P_TOP[0]     |P_TOP[1]

  884.                         |P_TOPRIGHT[0]|P_TOPRIGHT[1])==0){

  885.             *mx_ptr= 0;

  886.             *my_ptr= 0;

  887.             c->skip=1;

  888.             return dmin;

  889.         }

  890.         CHECK_MV(P_MEDIAN[0]>>shift, P_MEDIAN[1]>>shift)

  891.         if(dmin>256*2){

  892.             CHECK_CLIPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16, 

  893.                             (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)

  894.             CHECK_MV(P_LEFT[0]    >>shift, P_LEFT[1]    >>shift)

  895.             CHECK_MV(P_TOP[0]     >>shift, P_TOP[1]     >>shift)

  896.             CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)

  897.         }

  898.     }

  899.     if(dmin>256*4){

  900.         if(c->pre_pass){

  901.             CHECK_CLIPED_MV((last_mv[ref_mv_xy-1][0]*ref_mv_scale + (1<<15))>>16, 

  902.                             (last_mv[ref_mv_xy-1][1]*ref_mv_scale + (1<<15))>>16)

  903.             if(!s->first_slice_line)

  904.                 CHECK_CLIPED_MV((last_mv[ref_mv_xy-ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16, 

  905.                                 (last_mv[ref_mv_xy-ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)

  906.         }else{

  907.             CHECK_CLIPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16, 

  908.                             (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)

  909.             if(s->mb_y+1<s->end_mb_y)  //FIXME replace at least with last_slice_line

  910.                 CHECK_CLIPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16, 

  911.                                 (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)

  912.         }

  913.     }

  914. 

  915.     if(c->avctx->last_predictor_count){

  916.         const int count= c->avctx->last_predictor_count;

  917.         const int xstart= FFMAX(0, s->mb_x - count);

  918.         const int ystart= FFMAX(0, s->mb_y - count);

  919.         const int xend= FFMIN(s->mb_width , s->mb_x + count + 1);

  920.         const int yend= FFMIN(s->mb_height, s->mb_y + count + 1);

  921.         int mb_y;

  922. 

  923.         for(mb_y=ystart; mb_y<yend; mb_y++){

  924.             int mb_x;

  925.             for(mb_x=xstart; mb_x<xend; mb_x++){

  926.                 const int xy= mb_x + 1 + (mb_y + 1)*ref_mv_stride;

  927.                 int mx= (last_mv[xy][0]*ref_mv_scale + (1<<15))>>16;

  928.                 int my= (last_mv[xy][1]*ref_mv_scale + (1<<15))>>16;

  929. 

  930.                 if(mx>xmax || mx<xmin || my>ymax || my<ymin) continue;

  931.                 CHECK_MV(mx,my)

  932.             }

  933.         }

  934.     }

  935. 

  936. //check(best[0],best[1],0, b0)

  937.     dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  938. 

  939. //check(best[0],best[1],0, b1)

  940.     *mx_ptr= best[0];

  941.     *my_ptr= best[1];    

  942. 

  943. //    printf("%d %d %d \n", best[0], best[1], dmin);

  944.     return dmin;

  945. }

  946. 

  947. //this function is dedicated to the braindamaged gcc

  948. static inline int epzs_motion_search(MpegEncContext * s, int *mx_ptr, int *my_ptr,

  949.                              int P[10][2], int src_index, int ref_index, int16_t (*last_mv)[2], 

  950.                              int ref_mv_scale)

  951. {

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

  953. //FIXME convert other functions in the same way if faster

  954.     switch(c->flags){

  955.     case 0:

  956.         return epzs_motion_search_internal(s, mx_ptr, my_ptr, P, src_index, ref_index, last_mv, ref_mv_scale, 0);

  957. //    case FLAG_QPEL:

  958. //        return epzs_motion_search_internal(s, mx_ptr, my_ptr, P, src_index, ref_index, last_mv, ref_mv_scale, FLAG_QPEL);

  959.     default:

  960.         return epzs_motion_search_internal(s, mx_ptr, my_ptr, P, src_index, ref_index, last_mv, ref_mv_scale, c->flags);

  961.     }

  962. }

  963. 

  964. static int epzs_motion_search4(MpegEncContext * s,

  965.                              int *mx_ptr, int *my_ptr, int P[10][2],

  966.                              int src_index, int ref_index, int16_t (*last_mv)[2], 

  967.                              int ref_mv_scale)

  968. {

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

  970.     int best[2]={0, 0};

  971.     int d, dmin; 

  972.     int map_generation;

  973.     const int penalty_factor= c->penalty_factor;

  974.     const int size=1;

  975.     const int h=8;

  976.     const int ref_mv_stride= s->mb_stride;

  977.     const int ref_mv_xy= s->mb_x + s->mb_y *ref_mv_stride;

  978.     me_cmp_func cmpf, chroma_cmpf;

  979.     LOAD_COMMON

  980.     int flags= c->flags;

  981.     LOAD_COMMON2

  982.     

  983.     cmpf= s->dsp.me_cmp[size];

  984.     chroma_cmpf= s->dsp.me_cmp[size+1];

  985. 

  986.     map_generation= update_map_generation(c);

  987. 

  988.     dmin = 1000000;

  989. //printf("%d %d %d %d //",xmin, ymin, xmax, ymax); 

  990.     /* first line */

  991.     if (s->first_slice_line) {

  992. 	CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)

  993.         CHECK_CLIPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16, 

  994.                         (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)

  995.         CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)

  996.     }else{

  997.         CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)

  998.         //FIXME try some early stop

  999.         if(dmin>64*2){

  1000.             CHECK_MV(P_MEDIAN[0]>>shift, P_MEDIAN[1]>>shift)

  1001.             CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)

  1002.             CHECK_MV(P_TOP[0]>>shift, P_TOP[1]>>shift)

  1003.             CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)

  1004.             CHECK_CLIPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16, 

  1005.                             (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)

  1006.         }

  1007.     }

  1008.     if(dmin>64*4){

  1009.         CHECK_CLIPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16, 

  1010.                         (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)

  1011.         if(s->mb_y+1<s->end_mb_y)  //FIXME replace at least with last_slice_line

  1012.             CHECK_CLIPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16, 

  1013.                             (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)

  1014.     }

  1015. 

  1016.     dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  1017. 

  1018.     *mx_ptr= best[0];

  1019.     *my_ptr= best[1];    

  1020. 

  1021. //    printf("%d %d %d \n", best[0], best[1], dmin);

  1022.     return dmin;

  1023. }

  1024. 

  1025. //try to merge with above FIXME (needs PSNR test)

  1026. static int epzs_motion_search2(MpegEncContext * s,

  1027.                              int *mx_ptr, int *my_ptr, int P[10][2],

  1028.                              int src_index, int ref_index, int16_t (*last_mv)[2], 

  1029.                              int ref_mv_scale)

  1030. {

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

  1032.     int best[2]={0, 0};

  1033.     int d, dmin; 

  1034.     int map_generation;

  1035.     const int penalty_factor= c->penalty_factor;

  1036.     const int size=0; //FIXME pass as arg

  1037.     const int h=8;

  1038.     const int ref_mv_stride= s->mb_stride;

  1039.     const int ref_mv_xy= s->mb_x + s->mb_y *ref_mv_stride;

  1040.     me_cmp_func cmpf, chroma_cmpf;

  1041.     LOAD_COMMON

  1042.     int flags= c->flags;

  1043.     LOAD_COMMON2

  1044.     

  1045.     cmpf= s->dsp.me_cmp[size];

  1046.     chroma_cmpf= s->dsp.me_cmp[size+1];

  1047. 

  1048.     map_generation= update_map_generation(c);

  1049. 

  1050.     dmin = 1000000;

  1051. //printf("%d %d %d %d //",xmin, ymin, xmax, ymax); 

  1052.     /* first line */

  1053.     if (s->first_slice_line) {

  1054. 	CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)

  1055.         CHECK_CLIPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16, 

  1056.                         (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)

  1057.         CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)

  1058.     }else{

  1059.         CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)

  1060.         //FIXME try some early stop

  1061.         if(dmin>64*2){

  1062.             CHECK_MV(P_MEDIAN[0]>>shift, P_MEDIAN[1]>>shift)

  1063.             CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)

  1064.             CHECK_MV(P_TOP[0]>>shift, P_TOP[1]>>shift)

  1065.             CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)

  1066.             CHECK_CLIPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16, 

  1067.                             (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)

  1068.         }

  1069.     }

  1070.     if(dmin>64*4){

  1071.         CHECK_CLIPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16, 

  1072.                         (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)

  1073.         if(s->mb_y+1<s->end_mb_y)  //FIXME replace at least with last_slice_line

  1074.             CHECK_CLIPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16, 

  1075.                             (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)

  1076.     }

  1077. 

  1078.     dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);

  1079. 

  1080.     *mx_ptr= best[0];

  1081.     *my_ptr= best[1];    

  1082. 

  1083. //    printf("%d %d %d \n", best[0], best[1], dmin);

  1084.     return dmin;

  1085. }