00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00027
00028 #define LOAD_COMMON\
00029 uint32_t av_unused * const score_map= c->score_map;\
00030 const int av_unused xmin= c->xmin;\
00031 const int av_unused ymin= c->ymin;\
00032 const int av_unused xmax= c->xmax;\
00033 const int av_unused ymax= c->ymax;\
00034 uint8_t *mv_penalty= c->current_mv_penalty;\
00035 const int pred_x= c->pred_x;\
00036 const int pred_y= c->pred_y;\
00037
00038 #define CHECK_HALF_MV(dx, dy, x, y)\
00039 {\
00040 const int hx= 2*(x)+(dx);\
00041 const int hy= 2*(y)+(dy);\
00042 d= cmp(s, x, y, dx, dy, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);\
00043 d += (mv_penalty[hx - pred_x] + mv_penalty[hy - pred_y])*penalty_factor;\
00044 COPY3_IF_LT(dmin, d, bx, hx, by, hy)\
00045 }
00046
00047 #if 0
00048 static int hpel_motion_search)(MpegEncContext * s,
00049 int *mx_ptr, int *my_ptr, int dmin,
00050 uint8_t *ref_data[3],
00051 int size)
00052 {
00053 const int xx = 16 * s->mb_x + 8*(n&1);
00054 const int yy = 16 * s->mb_y + 8*(n>>1);
00055 const int mx = *mx_ptr;
00056 const int my = *my_ptr;
00057 const int penalty_factor= c->sub_penalty_factor;
00058
00059 LOAD_COMMON
00060
00061
00062
00063 me_cmp_func cmp, chroma_cmp, cmp_sub, chroma_cmp_sub;
00064
00065 if(s->no_rounding ){
00066 hpel_put= &s->dsp.put_no_rnd_pixels_tab[size];
00067 chroma_hpel_put= &s->dsp.put_no_rnd_pixels_tab[size+1];
00068 }else{
00069 hpel_put=& s->dsp.put_pixels_tab[size];
00070 chroma_hpel_put= &s->dsp.put_pixels_tab[size+1];
00071 }
00072 cmpf= s->dsp.me_cmp[size];
00073 chroma_cmpf= s->dsp.me_cmp[size+1];
00074 cmp_sub= s->dsp.me_sub_cmp[size];
00075 chroma_cmp_sub= s->dsp.me_sub_cmp[size+1];
00076
00077 if(c->skip){
00078 *mx_ptr = 0;
00079 *my_ptr = 0;
00080 return dmin;
00081 }
00082
00083 if(c->avctx->me_cmp != c->avctx->me_sub_cmp){
00084 CMP_HPEL(dmin, 0, 0, mx, my, size);
00085 if(mx || my)
00086 dmin += (mv_penalty[2*mx - pred_x] + mv_penalty[2*my - pred_y])*penalty_factor;
00087 }
00088
00089 if (mx > xmin && mx < xmax &&
00090 my > ymin && my < ymax) {
00091 int bx=2*mx, by=2*my;
00092 int d= dmin;
00093
00094 CHECK_HALF_MV(1, 1, mx-1, my-1)
00095 CHECK_HALF_MV(0, 1, mx , my-1)
00096 CHECK_HALF_MV(1, 1, mx , my-1)
00097 CHECK_HALF_MV(1, 0, mx-1, my )
00098 CHECK_HALF_MV(1, 0, mx , my )
00099 CHECK_HALF_MV(1, 1, mx-1, my )
00100 CHECK_HALF_MV(0, 1, mx , my )
00101 CHECK_HALF_MV(1, 1, mx , my )
00102
00103 assert(bx >= xmin*2 || bx <= xmax*2 || by >= ymin*2 || by <= ymax*2);
00104
00105 *mx_ptr = bx;
00106 *my_ptr = by;
00107 }else{
00108 *mx_ptr =2*mx;
00109 *my_ptr =2*my;
00110 }
00111
00112 return dmin;
00113 }
00114
00115 #else
00116 static int hpel_motion_search(MpegEncContext * s,
00117 int *mx_ptr, int *my_ptr, int dmin,
00118 int src_index, int ref_index,
00119 int size, int h)
00120 {
00121 MotionEstContext * const c= &s->me;
00122 const int mx = *mx_ptr;
00123 const int my = *my_ptr;
00124 const int penalty_factor= c->sub_penalty_factor;
00125 me_cmp_func cmp_sub, chroma_cmp_sub;
00126 int bx=2*mx, by=2*my;
00127
00128 LOAD_COMMON
00129 int flags= c->sub_flags;
00130
00131
00132
00133 cmp_sub= s->dsp.me_sub_cmp[size];
00134 chroma_cmp_sub= s->dsp.me_sub_cmp[size+1];
00135
00136 if(c->skip){
00137 *mx_ptr = 0;
00138 *my_ptr = 0;
00139 return dmin;
00140 }
00141
00142 if(c->avctx->me_cmp != c->avctx->me_sub_cmp){
00143 dmin= cmp(s, mx, my, 0, 0, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);
00144 if(mx || my || size>0)
00145 dmin += (mv_penalty[2*mx - pred_x] + mv_penalty[2*my - pred_y])*penalty_factor;
00146 }
00147
00148 if (mx > xmin && mx < xmax &&
00149 my > ymin && my < ymax) {
00150 int d= dmin;
00151 const int index= (my<<ME_MAP_SHIFT) + mx;
00152 const int t= score_map[(index-(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)]
00153 + (mv_penalty[bx - pred_x] + mv_penalty[by-2 - pred_y])*c->penalty_factor;
00154 const int l= score_map[(index- 1 )&(ME_MAP_SIZE-1)]
00155 + (mv_penalty[bx-2 - pred_x] + mv_penalty[by - pred_y])*c->penalty_factor;
00156 const int r= score_map[(index+ 1 )&(ME_MAP_SIZE-1)]
00157 + (mv_penalty[bx+2 - pred_x] + mv_penalty[by - pred_y])*c->penalty_factor;
00158 const int b= score_map[(index+(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)]
00159 + (mv_penalty[bx - pred_x] + mv_penalty[by+2 - pred_y])*c->penalty_factor;
00160
00161 #if 1
00162 int key;
00163 int map_generation= c->map_generation;
00164 #ifndef NDEBUG
00165 uint32_t *map= c->map;
00166 #endif
00167 key= ((my-1)<<ME_MAP_MV_BITS) + (mx) + map_generation;
00168 assert(map[(index-(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)] == key);
00169 key= ((my+1)<<ME_MAP_MV_BITS) + (mx) + map_generation;
00170 assert(map[(index+(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)] == key);
00171 key= ((my)<<ME_MAP_MV_BITS) + (mx+1) + map_generation;
00172 assert(map[(index+1)&(ME_MAP_SIZE-1)] == key);
00173 key= ((my)<<ME_MAP_MV_BITS) + (mx-1) + map_generation;
00174 assert(map[(index-1)&(ME_MAP_SIZE-1)] == key);
00175 #endif
00176 if(t<=b){
00177 CHECK_HALF_MV(0, 1, mx ,my-1)
00178 if(l<=r){
00179 CHECK_HALF_MV(1, 1, mx-1, my-1)
00180 if(t+r<=b+l){
00181 CHECK_HALF_MV(1, 1, mx , my-1)
00182 }else{
00183 CHECK_HALF_MV(1, 1, mx-1, my )
00184 }
00185 CHECK_HALF_MV(1, 0, mx-1, my )
00186 }else{
00187 CHECK_HALF_MV(1, 1, mx , my-1)
00188 if(t+l<=b+r){
00189 CHECK_HALF_MV(1, 1, mx-1, my-1)
00190 }else{
00191 CHECK_HALF_MV(1, 1, mx , my )
00192 }
00193 CHECK_HALF_MV(1, 0, mx , my )
00194 }
00195 }else{
00196 if(l<=r){
00197 if(t+l<=b+r){
00198 CHECK_HALF_MV(1, 1, mx-1, my-1)
00199 }else{
00200 CHECK_HALF_MV(1, 1, mx , my )
00201 }
00202 CHECK_HALF_MV(1, 0, mx-1, my)
00203 CHECK_HALF_MV(1, 1, mx-1, my)
00204 }else{
00205 if(t+r<=b+l){
00206 CHECK_HALF_MV(1, 1, mx , my-1)
00207 }else{
00208 CHECK_HALF_MV(1, 1, mx-1, my)
00209 }
00210 CHECK_HALF_MV(1, 0, mx , my)
00211 CHECK_HALF_MV(1, 1, mx , my)
00212 }
00213 CHECK_HALF_MV(0, 1, mx , my)
00214 }
00215 assert(bx >= xmin*2 && bx <= xmax*2 && by >= ymin*2 && by <= ymax*2);
00216 }
00217
00218 *mx_ptr = bx;
00219 *my_ptr = by;
00220
00221 return dmin;
00222 }
00223 #endif
00224
00225 static int no_sub_motion_search(MpegEncContext * s,
00226 int *mx_ptr, int *my_ptr, int dmin,
00227 int src_index, int ref_index,
00228 int size, int h)
00229 {
00230 (*mx_ptr)<<=1;
00231 (*my_ptr)<<=1;
00232 return dmin;
00233 }
00234
00235 inline int ff_get_mb_score(MpegEncContext * s, int mx, int my, int src_index,
00236 int ref_index, int size, int h, int add_rate)
00237 {
00238
00239 MotionEstContext * const c= &s->me;
00240 const int penalty_factor= c->mb_penalty_factor;
00241 const int flags= c->mb_flags;
00242 const int qpel= flags & FLAG_QPEL;
00243 const int mask= 1+2*qpel;
00244 me_cmp_func cmp_sub, chroma_cmp_sub;
00245 int d;
00246
00247 LOAD_COMMON
00248
00249
00250
00251 cmp_sub= s->dsp.mb_cmp[size];
00252 chroma_cmp_sub= s->dsp.mb_cmp[size+1];
00253
00254
00255
00256
00257 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);
00258
00259 if(add_rate && (mx || my || size>0))
00260 d += (mv_penalty[mx - pred_x] + mv_penalty[my - pred_y])*penalty_factor;
00261
00262 return d;
00263 }
00264
00265 #define CHECK_QUARTER_MV(dx, dy, x, y)\
00266 {\
00267 const int hx= 4*(x)+(dx);\
00268 const int hy= 4*(y)+(dy);\
00269 d= cmp(s, x, y, dx, dy, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\
00270 d += (mv_penalty[hx - pred_x] + mv_penalty[hy - pred_y])*penalty_factor;\
00271 COPY3_IF_LT(dmin, d, bx, hx, by, hy)\
00272 }
00273
00274 static int qpel_motion_search(MpegEncContext * s,
00275 int *mx_ptr, int *my_ptr, int dmin,
00276 int src_index, int ref_index,
00277 int size, int h)
00278 {
00279 MotionEstContext * const c= &s->me;
00280 const int mx = *mx_ptr;
00281 const int my = *my_ptr;
00282 const int penalty_factor= c->sub_penalty_factor;
00283 const int map_generation= c->map_generation;
00284 const int subpel_quality= c->avctx->me_subpel_quality;
00285 uint32_t *map= c->map;
00286 me_cmp_func cmpf, chroma_cmpf;
00287 me_cmp_func cmp_sub, chroma_cmp_sub;
00288
00289 LOAD_COMMON
00290 int flags= c->sub_flags;
00291
00292 cmpf= s->dsp.me_cmp[size];
00293 chroma_cmpf= s->dsp.me_cmp[size+1];
00294
00295
00296 cmp_sub= s->dsp.me_sub_cmp[size];
00297 chroma_cmp_sub= s->dsp.me_sub_cmp[size+1];
00298
00299 if(c->skip){
00300 *mx_ptr = 0;
00301 *my_ptr = 0;
00302 return dmin;
00303 }
00304
00305 if(c->avctx->me_cmp != c->avctx->me_sub_cmp){
00306 dmin= cmp(s, mx, my, 0, 0, size, h, ref_index, src_index, cmp_sub, chroma_cmp_sub, flags);
00307 if(mx || my || size>0)
00308 dmin += (mv_penalty[4*mx - pred_x] + mv_penalty[4*my - pred_y])*penalty_factor;
00309 }
00310
00311 if (mx > xmin && mx < xmax &&
00312 my > ymin && my < ymax) {
00313 int bx=4*mx, by=4*my;
00314 int d= dmin;
00315 int i, nx, ny;
00316 const int index= (my<<ME_MAP_SHIFT) + mx;
00317 const int t= score_map[(index-(1<<ME_MAP_SHIFT) )&(ME_MAP_SIZE-1)];
00318 const int l= score_map[(index- 1 )&(ME_MAP_SIZE-1)];
00319 const int r= score_map[(index+ 1 )&(ME_MAP_SIZE-1)];
00320 const int b= score_map[(index+(1<<ME_MAP_SHIFT) )&(ME_MAP_SIZE-1)];
00321 const int c= score_map[(index )&(ME_MAP_SIZE-1)];
00322 int best[8];
00323 int best_pos[8][2];
00324
00325 memset(best, 64, sizeof(int)*8);
00326 #if 1
00327 if(s->me.dia_size>=2){
00328 const int tl= score_map[(index-(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)];
00329 const int bl= score_map[(index+(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)];
00330 const int tr= score_map[(index-(1<<ME_MAP_SHIFT)+1)&(ME_MAP_SIZE-1)];
00331 const int br= score_map[(index+(1<<ME_MAP_SHIFT)+1)&(ME_MAP_SIZE-1)];
00332
00333 for(ny= -3; ny <= 3; ny++){
00334 for(nx= -3; nx <= 3; nx++){
00335
00336 const int64_t t2= nx*nx*(tr + tl - 2*t) + 4*nx*(tr-tl) + 32*t;
00337 const int64_t c2= nx*nx*( r + l - 2*c) + 4*nx*( r- l) + 32*c;
00338 const int64_t b2= nx*nx*(br + bl - 2*b) + 4*nx*(br-bl) + 32*b;
00339 int score= (ny*ny*(b2 + t2 - 2*c2) + 4*ny*(b2 - t2) + 32*c2 + 512)>>10;
00340 int i;
00341
00342 if((nx&3)==0 && (ny&3)==0) continue;
00343
00344 score += (mv_penalty[4*mx + nx - pred_x] + mv_penalty[4*my + ny - pred_y])*penalty_factor;
00345
00346
00347
00348
00349 for(i=0; i<8; i++){
00350 if(score < best[i]){
00351 memmove(&best[i+1], &best[i], sizeof(int)*(7-i));
00352 memmove(&best_pos[i+1][0], &best_pos[i][0], sizeof(int)*2*(7-i));
00353 best[i]= score;
00354 best_pos[i][0]= nx + 4*mx;
00355 best_pos[i][1]= ny + 4*my;
00356 break;
00357 }
00358 }
00359 }
00360 }
00361 }else{
00362 int tl;
00363
00364 const int cx = 4*(r - l);
00365 const int cx2= r + l - 2*c;
00366 const int cy = 4*(b - t);
00367 const int cy2= b + t - 2*c;
00368 int cxy;
00369
00370 if(map[(index-(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)] == (my<<ME_MAP_MV_BITS) + mx + map_generation && 0){
00371 tl= score_map[(index-(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)];
00372 }else{
00373 tl= cmp(s, mx-1, my-1, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);
00374 }
00375
00376 cxy= 2*tl + (cx + cy)/4 - (cx2 + cy2) - 2*c;
00377
00378 assert(16*cx2 + 4*cx + 32*c == 32*r);
00379 assert(16*cx2 - 4*cx + 32*c == 32*l);
00380 assert(16*cy2 + 4*cy + 32*c == 32*b);
00381 assert(16*cy2 - 4*cy + 32*c == 32*t);
00382 assert(16*cxy + 16*cy2 + 16*cx2 - 4*cy - 4*cx + 32*c == 32*tl);
00383
00384 for(ny= -3; ny <= 3; ny++){
00385 for(nx= -3; nx <= 3; nx++){
00386
00387 int score= ny*nx*cxy + nx*nx*cx2 + ny*ny*cy2 + nx*cx + ny*cy + 32*c;
00388 int i;
00389
00390 if((nx&3)==0 && (ny&3)==0) continue;
00391
00392 score += 32*(mv_penalty[4*mx + nx - pred_x] + mv_penalty[4*my + ny - pred_y])*penalty_factor;
00393
00394
00395
00396 for(i=0; i<8; i++){
00397 if(score < best[i]){
00398 memmove(&best[i+1], &best[i], sizeof(int)*(7-i));
00399 memmove(&best_pos[i+1][0], &best_pos[i][0], sizeof(int)*2*(7-i));
00400 best[i]= score;
00401 best_pos[i][0]= nx + 4*mx;
00402 best_pos[i][1]= ny + 4*my;
00403 break;
00404 }
00405 }
00406 }
00407 }
00408 }
00409 for(i=0; i<subpel_quality; i++){
00410 nx= best_pos[i][0];
00411 ny= best_pos[i][1];
00412 CHECK_QUARTER_MV(nx&3, ny&3, nx>>2, ny>>2)
00413 }
00414
00415 #if 0
00416 const int tl= score_map[(index-(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)];
00417 const int bl= score_map[(index+(1<<ME_MAP_SHIFT)-1)&(ME_MAP_SIZE-1)];
00418 const int tr= score_map[(index-(1<<ME_MAP_SHIFT)+1)&(ME_MAP_SIZE-1)];
00419 const int br= score_map[(index+(1<<ME_MAP_SHIFT)+1)&(ME_MAP_SIZE-1)];
00420
00421 if(tl<br){
00422
00423
00424
00425
00426 static int stats[7][7], count;
00427 count++;
00428 stats[4*mx - bx + 3][4*my - by + 3]++;
00429 if(256*256*256*64 % count ==0){
00430 for(i=0; i<49; i++){
00431 if((i%7)==0) printf("\n");
00432 printf("%6d ", stats[0][i]);
00433 }
00434 printf("\n");
00435 }
00436 }
00437 #endif
00438 #else
00439
00440 CHECK_QUARTER_MV(2, 2, mx-1, my-1)
00441 CHECK_QUARTER_MV(0, 2, mx , my-1)
00442 CHECK_QUARTER_MV(2, 2, mx , my-1)
00443 CHECK_QUARTER_MV(2, 0, mx , my )
00444 CHECK_QUARTER_MV(2, 2, mx , my )
00445 CHECK_QUARTER_MV(0, 2, mx , my )
00446 CHECK_QUARTER_MV(2, 2, mx-1, my )
00447 CHECK_QUARTER_MV(2, 0, mx-1, my )
00448
00449 nx= bx;
00450 ny= by;
00451
00452 for(i=0; i<8; i++){
00453 int ox[8]= {0, 1, 1, 1, 0,-1,-1,-1};
00454 int oy[8]= {1, 1, 0,-1,-1,-1, 0, 1};
00455 CHECK_QUARTER_MV((nx + ox[i])&3, (ny + oy[i])&3, (nx + ox[i])>>2, (ny + oy[i])>>2)
00456 }
00457 #endif
00458 #if 0
00459
00460 CHECK_QUARTER_MV(1, 3, mx-1, my-1)
00461 CHECK_QUARTER_MV(1, 2, mx-1, my-1)
00462 CHECK_QUARTER_MV(1, 1, mx-1, my-1)
00463 CHECK_QUARTER_MV(2, 1, mx-1, my-1)
00464 CHECK_QUARTER_MV(3, 1, mx-1, my-1)
00465 CHECK_QUARTER_MV(0, 1, mx , my-1)
00466 CHECK_QUARTER_MV(1, 1, mx , my-1)
00467 CHECK_QUARTER_MV(2, 1, mx , my-1)
00468 CHECK_QUARTER_MV(3, 1, mx , my-1)
00469 CHECK_QUARTER_MV(3, 2, mx , my-1)
00470 CHECK_QUARTER_MV(3, 3, mx , my-1)
00471 CHECK_QUARTER_MV(3, 0, mx , my )
00472 CHECK_QUARTER_MV(3, 1, mx , my )
00473 CHECK_QUARTER_MV(3, 2, mx , my )
00474 CHECK_QUARTER_MV(3, 3, mx , my )
00475 CHECK_QUARTER_MV(2, 3, mx , my )
00476 CHECK_QUARTER_MV(1, 3, mx , my )
00477 CHECK_QUARTER_MV(0, 3, mx , my )
00478 CHECK_QUARTER_MV(3, 3, mx-1, my )
00479 CHECK_QUARTER_MV(2, 3, mx-1, my )
00480 CHECK_QUARTER_MV(1, 3, mx-1, my )
00481 CHECK_QUARTER_MV(1, 2, mx-1, my )
00482 CHECK_QUARTER_MV(1, 1, mx-1, my )
00483 CHECK_QUARTER_MV(1, 0, mx-1, my )
00484 #endif
00485 assert(bx >= xmin*4 && bx <= xmax*4 && by >= ymin*4 && by <= ymax*4);
00486
00487 *mx_ptr = bx;
00488 *my_ptr = by;
00489 }else{
00490 *mx_ptr =4*mx;
00491 *my_ptr =4*my;
00492 }
00493
00494 return dmin;
00495 }
00496
00497
00498 #define CHECK_MV(x,y)\
00499 {\
00500 const int key= ((y)<<ME_MAP_MV_BITS) + (x) + map_generation;\
00501 const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);\
00502 assert((x) >= xmin);\
00503 assert((x) <= xmax);\
00504 assert((y) >= ymin);\
00505 assert((y) <= ymax);\
00506 \
00507 if(map[index]!=key){\
00508 d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\
00509 map[index]= key;\
00510 score_map[index]= d;\
00511 d += (mv_penalty[((x)<<shift)-pred_x] + mv_penalty[((y)<<shift)-pred_y])*penalty_factor;\
00512 \
00513 COPY3_IF_LT(dmin, d, best[0], x, best[1], y)\
00514 }\
00515 }
00516
00517 #define CHECK_CLIPPED_MV(ax,ay)\
00518 {\
00519 const int Lx= ax;\
00520 const int Ly= ay;\
00521 const int Lx2= FFMAX(xmin, FFMIN(Lx, xmax));\
00522 const int Ly2= FFMAX(ymin, FFMIN(Ly, ymax));\
00523 CHECK_MV(Lx2, Ly2)\
00524 }
00525
00526 #define CHECK_MV_DIR(x,y,new_dir)\
00527 {\
00528 const int key= ((y)<<ME_MAP_MV_BITS) + (x) + map_generation;\
00529 const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);\
00530 \
00531 if(map[index]!=key){\
00532 d= cmp(s, x, y, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\
00533 map[index]= key;\
00534 score_map[index]= d;\
00535 d += (mv_penalty[((x)<<shift)-pred_x] + mv_penalty[((y)<<shift)-pred_y])*penalty_factor;\
00536 \
00537 if(d<dmin){\
00538 best[0]=x;\
00539 best[1]=y;\
00540 dmin=d;\
00541 next_dir= new_dir;\
00542 }\
00543 }\
00544 }
00545
00546 #define check(x,y,S,v)\
00547 if( (x)<(xmin<<(S)) ) printf("%d %d %d %d %d xmin" #v, xmin, (x), (y), s->mb_x, s->mb_y);\
00548 if( (x)>(xmax<<(S)) ) printf("%d %d %d %d %d xmax" #v, xmax, (x), (y), s->mb_x, s->mb_y);\
00549 if( (y)<(ymin<<(S)) ) printf("%d %d %d %d %d ymin" #v, ymin, (x), (y), s->mb_x, s->mb_y);\
00550 if( (y)>(ymax<<(S)) ) printf("%d %d %d %d %d ymax" #v, ymax, (x), (y), s->mb_x, s->mb_y);\
00551
00552 #define LOAD_COMMON2\
00553 uint32_t *map= c->map;\
00554 const int qpel= flags&FLAG_QPEL;\
00555 const int shift= 1+qpel;\
00556
00557 static av_always_inline int small_diamond_search(MpegEncContext * s, int *best, int dmin,
00558 int src_index, int ref_index, int const penalty_factor,
00559 int size, int h, int flags)
00560 {
00561 MotionEstContext * const c= &s->me;
00562 me_cmp_func cmpf, chroma_cmpf;
00563 int next_dir=-1;
00564 LOAD_COMMON
00565 LOAD_COMMON2
00566 int map_generation= c->map_generation;
00567
00568 cmpf= s->dsp.me_cmp[size];
00569 chroma_cmpf= s->dsp.me_cmp[size+1];
00570
00571 {
00572 const int key= (best[1]<<ME_MAP_MV_BITS) + best[0] + map_generation;
00573 const int index= ((best[1]<<ME_MAP_SHIFT) + best[0])&(ME_MAP_SIZE-1);
00574 if(map[index]!=key){
00575 score_map[index]= cmp(s, best[0], best[1], 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);
00576 map[index]= key;
00577 }
00578 }
00579
00580 for(;;){
00581 int d;
00582 const int dir= next_dir;
00583 const int x= best[0];
00584 const int y= best[1];
00585 next_dir=-1;
00586
00587
00588 if(dir!=2 && x>xmin) CHECK_MV_DIR(x-1, y , 0)
00589 if(dir!=3 && y>ymin) CHECK_MV_DIR(x , y-1, 1)
00590 if(dir!=0 && x<xmax) CHECK_MV_DIR(x+1, y , 2)
00591 if(dir!=1 && y<ymax) CHECK_MV_DIR(x , y+1, 3)
00592
00593 if(next_dir==-1){
00594 return dmin;
00595 }
00596 }
00597 }
00598
00599 static int funny_diamond_search(MpegEncContext * s, int *best, int dmin,
00600 int src_index, int ref_index, int const penalty_factor,
00601 int size, int h, int flags)
00602 {
00603 MotionEstContext * const c= &s->me;
00604 me_cmp_func cmpf, chroma_cmpf;
00605 int dia_size;
00606 LOAD_COMMON
00607 LOAD_COMMON2
00608 int map_generation= c->map_generation;
00609
00610 cmpf= s->dsp.me_cmp[size];
00611 chroma_cmpf= s->dsp.me_cmp[size+1];
00612
00613 for(dia_size=1; dia_size<=4; dia_size++){
00614 int dir;
00615 const int x= best[0];
00616 const int y= best[1];
00617
00618 if(dia_size&(dia_size-1)) continue;
00619
00620 if( x + dia_size > xmax
00621 || x - dia_size < xmin
00622 || y + dia_size > ymax
00623 || y - dia_size < ymin)
00624 continue;
00625
00626 for(dir= 0; dir<dia_size; dir+=2){
00627 int d;
00628
00629 CHECK_MV(x + dir , y + dia_size - dir);
00630 CHECK_MV(x + dia_size - dir, y - dir );
00631 CHECK_MV(x - dir , y - dia_size + dir);
00632 CHECK_MV(x - dia_size + dir, y + dir );
00633 }
00634
00635 if(x!=best[0] || y!=best[1])
00636 dia_size=0;
00637 #if 0
00638 {
00639 int dx, dy, i;
00640 static int stats[8*8];
00641 dx= FFABS(x-best[0]);
00642 dy= FFABS(y-best[1]);
00643 if(dy>dx){
00644 dx^=dy; dy^=dx; dx^=dy;
00645 }
00646 stats[dy*8 + dx] ++;
00647 if(256*256*256*64 % (stats[0]+1)==0){
00648 for(i=0; i<64; i++){
00649 if((i&7)==0) printf("\n");
00650 printf("%8d ", stats[i]);
00651 }
00652 printf("\n");
00653 }
00654 }
00655 #endif
00656 }
00657 return dmin;
00658 }
00659
00660 static int hex_search(MpegEncContext * s, int *best, int dmin,
00661 int src_index, int ref_index, int const penalty_factor,
00662 int size, int h, int flags, int dia_size)
00663 {
00664 MotionEstContext * const c= &s->me;
00665 me_cmp_func cmpf, chroma_cmpf;
00666 LOAD_COMMON
00667 LOAD_COMMON2
00668 int map_generation= c->map_generation;
00669 int x,y,d;
00670 const int dec= dia_size & (dia_size-1);
00671
00672 cmpf= s->dsp.me_cmp[size];
00673 chroma_cmpf= s->dsp.me_cmp[size+1];
00674
00675 for(;dia_size; dia_size= dec ? dia_size-1 : dia_size>>1){
00676 do{
00677 x= best[0];
00678 y= best[1];
00679
00680 CHECK_CLIPPED_MV(x -dia_size , y);
00681 CHECK_CLIPPED_MV(x+ dia_size , y);
00682 CHECK_CLIPPED_MV(x+( dia_size>>1), y+dia_size);
00683 CHECK_CLIPPED_MV(x+( dia_size>>1), y-dia_size);
00684 if(dia_size>1){
00685 CHECK_CLIPPED_MV(x+(-dia_size>>1), y+dia_size);
00686 CHECK_CLIPPED_MV(x+(-dia_size>>1), y-dia_size);
00687 }
00688 }while(best[0] != x || best[1] != y);
00689 }
00690
00691 return dmin;
00692 }
00693
00694 static int l2s_dia_search(MpegEncContext * s, int *best, int dmin,
00695 int src_index, int ref_index, int const penalty_factor,
00696 int size, int h, int flags)
00697 {
00698 MotionEstContext * const c= &s->me;
00699 me_cmp_func cmpf, chroma_cmpf;
00700 LOAD_COMMON
00701 LOAD_COMMON2
00702 int map_generation= c->map_generation;
00703 int x,y,i,d;
00704 int dia_size= c->dia_size&0xFF;
00705 const int dec= dia_size & (dia_size-1);
00706 static const int hex[8][2]={{-2, 0}, {-1,-1}, { 0,-2}, { 1,-1},
00707 { 2, 0}, { 1, 1}, { 0, 2}, {-1, 1}};
00708
00709 cmpf= s->dsp.me_cmp[size];
00710 chroma_cmpf= s->dsp.me_cmp[size+1];
00711
00712 for(; dia_size; dia_size= dec ? dia_size-1 : dia_size>>1){
00713 do{
00714 x= best[0];
00715 y= best[1];
00716 for(i=0; i<8; i++){
00717 CHECK_CLIPPED_MV(x+hex[i][0]*dia_size, y+hex[i][1]*dia_size);
00718 }
00719 }while(best[0] != x || best[1] != y);
00720 }
00721
00722 x= best[0];
00723 y= best[1];
00724 CHECK_CLIPPED_MV(x+1, y);
00725 CHECK_CLIPPED_MV(x, y+1);
00726 CHECK_CLIPPED_MV(x-1, y);
00727 CHECK_CLIPPED_MV(x, y-1);
00728
00729 return dmin;
00730 }
00731
00732 static int umh_search(MpegEncContext * s, int *best, int dmin,
00733 int src_index, int ref_index, int const penalty_factor,
00734 int size, int h, int flags)
00735 {
00736 MotionEstContext * const c= &s->me;
00737 me_cmp_func cmpf, chroma_cmpf;
00738 LOAD_COMMON
00739 LOAD_COMMON2
00740 int map_generation= c->map_generation;
00741 int x,y,x2,y2, i, j, d;
00742 const int dia_size= c->dia_size&0xFE;
00743 static const int hex[16][2]={{-4,-2}, {-4,-1}, {-4, 0}, {-4, 1}, {-4, 2},
00744 { 4,-2}, { 4,-1}, { 4, 0}, { 4, 1}, { 4, 2},
00745 {-2, 3}, { 0, 4}, { 2, 3},
00746 {-2,-3}, { 0,-4}, { 2,-3},};
00747
00748 cmpf= s->dsp.me_cmp[size];
00749 chroma_cmpf= s->dsp.me_cmp[size+1];
00750
00751 x= best[0];
00752 y= best[1];
00753 for(x2=FFMAX(x-dia_size+1, xmin); x2<=FFMIN(x+dia_size-1,xmax); x2+=2){
00754 CHECK_MV(x2, y);
00755 }
00756 for(y2=FFMAX(y-dia_size/2+1, ymin); y2<=FFMIN(y+dia_size/2-1,ymax); y2+=2){
00757 CHECK_MV(x, y2);
00758 }
00759
00760 x= best[0];
00761 y= best[1];
00762 for(y2=FFMAX(y-2, ymin); y2<=FFMIN(y+2,ymax); y2++){
00763 for(x2=FFMAX(x-2, xmin); x2<=FFMIN(x+2,xmax); x2++){
00764 CHECK_MV(x2, y2);
00765 }
00766 }
00767
00768
00769
00770 for(j=1; j<=dia_size/4; j++){
00771 for(i=0; i<16; i++){
00772 CHECK_CLIPPED_MV(x+hex[i][0]*j, y+hex[i][1]*j);
00773 }
00774 }
00775
00776 return hex_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags, 2);
00777 }
00778
00779 #define SAB_CHECK_MV(ax,ay)\
00780 {\
00781 const int key= ((ay)<<ME_MAP_MV_BITS) + (ax) + map_generation;\
00782 const int index= (((ay)<<ME_MAP_SHIFT) + (ax))&(ME_MAP_SIZE-1);\
00783 \
00784 if(map[index]!=key){\
00785 d= cmp(s, ax, ay, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);\
00786 map[index]= key;\
00787 score_map[index]= d;\
00788 d += (mv_penalty[((ax)<<shift)-pred_x] + mv_penalty[((ay)<<shift)-pred_y])*penalty_factor;\
00789 \
00790 if(d < minima[minima_count-1].height){\
00791 int j=0;\
00792 \
00793 while(d >= minima[j].height) j++;\
00794 \
00795 memmove(&minima [j+1], &minima [j], (minima_count - j - 1)*sizeof(Minima));\
00796 \
00797 minima[j].checked= 0;\
00798 minima[j].height= d;\
00799 minima[j].x= ax;\
00800 minima[j].y= ay;\
00801 \
00802 i=-1;\
00803 continue;\
00804 }\
00805 }\
00806 }
00807
00808 #define MAX_SAB_SIZE ME_MAP_SIZE
00809 static int sab_diamond_search(MpegEncContext * s, int *best, int dmin,
00810 int src_index, int ref_index, int const penalty_factor,
00811 int size, int h, int flags)
00812 {
00813 MotionEstContext * const c= &s->me;
00814 me_cmp_func cmpf, chroma_cmpf;
00815 Minima minima[MAX_SAB_SIZE];
00816 const int minima_count= FFABS(c->dia_size);
00817 int i, j;
00818 LOAD_COMMON
00819 LOAD_COMMON2
00820 int map_generation= c->map_generation;
00821
00822 cmpf= s->dsp.me_cmp[size];
00823 chroma_cmpf= s->dsp.me_cmp[size+1];
00824
00825
00826
00827
00828 for(j=i=0; i<ME_MAP_SIZE && j<MAX_SAB_SIZE; i++){
00829 uint32_t key= map[i];
00830
00831 key += (1<<(ME_MAP_MV_BITS-1)) + (1<<(2*ME_MAP_MV_BITS-1));
00832
00833 if((key&((-1)<<(2*ME_MAP_MV_BITS))) != map_generation) continue;
00834
00835 minima[j].height= score_map[i];
00836 minima[j].x= key & ((1<<ME_MAP_MV_BITS)-1); key>>=ME_MAP_MV_BITS;
00837 minima[j].y= key & ((1<<ME_MAP_MV_BITS)-1);
00838 minima[j].x-= (1<<(ME_MAP_MV_BITS-1));
00839 minima[j].y-= (1<<(ME_MAP_MV_BITS-1));
00840
00841
00842 if( minima[j].x > xmax || minima[j].x < xmin
00843 || minima[j].y > ymax || minima[j].y < ymin)
00844 continue;
00845
00846 minima[j].checked=0;
00847 if(minima[j].x || minima[j].y)
00848 minima[j].height+= (mv_penalty[((minima[j].x)<<shift)-pred_x] + mv_penalty[((minima[j].y)<<shift)-pred_y])*penalty_factor;
00849
00850 j++;
00851 }
00852
00853 qsort(minima, j, sizeof(Minima), minima_cmp);
00854
00855 for(; j<minima_count; j++){
00856 minima[j].height=256*256*256*64;
00857 minima[j].checked=0;
00858 minima[j].x= minima[j].y=0;
00859 }
00860
00861 for(i=0; i<minima_count; i++){
00862 const int x= minima[i].x;
00863 const int y= minima[i].y;
00864 int d;
00865
00866 if(minima[i].checked) continue;
00867
00868 if( x >= xmax || x <= xmin
00869 || y >= ymax || y <= ymin)
00870 continue;
00871
00872 SAB_CHECK_MV(x-1, y)
00873 SAB_CHECK_MV(x+1, y)
00874 SAB_CHECK_MV(x , y-1)
00875 SAB_CHECK_MV(x , y+1)
00876
00877 minima[i].checked= 1;
00878 }
00879
00880 best[0]= minima[0].x;
00881 best[1]= minima[0].y;
00882 dmin= minima[0].height;
00883
00884 if( best[0] < xmax && best[0] > xmin
00885 && best[1] < ymax && best[1] > ymin){
00886 int d;
00887
00888 CHECK_MV(best[0]-1, best[1])
00889 CHECK_MV(best[0]+1, best[1])
00890 CHECK_MV(best[0], best[1]-1)
00891 CHECK_MV(best[0], best[1]+1)
00892 }
00893 return dmin;
00894 }
00895
00896 static int var_diamond_search(MpegEncContext * s, int *best, int dmin,
00897 int src_index, int ref_index, int const penalty_factor,
00898 int size, int h, int flags)
00899 {
00900 MotionEstContext * const c= &s->me;
00901 me_cmp_func cmpf, chroma_cmpf;
00902 int dia_size;
00903 LOAD_COMMON
00904 LOAD_COMMON2
00905 int map_generation= c->map_generation;
00906
00907 cmpf= s->dsp.me_cmp[size];
00908 chroma_cmpf= s->dsp.me_cmp[size+1];
00909
00910 for(dia_size=1; dia_size<=c->dia_size; dia_size++){
00911 int dir, start, end;
00912 const int x= best[0];
00913 const int y= best[1];
00914
00915 start= FFMAX(0, y + dia_size - ymax);
00916 end = FFMIN(dia_size, xmax - x + 1);
00917 for(dir= start; dir<end; dir++){
00918 int d;
00919
00920
00921 CHECK_MV(x + dir , y + dia_size - dir);
00922 }
00923
00924 start= FFMAX(0, x + dia_size - xmax);
00925 end = FFMIN(dia_size, y - ymin + 1);
00926 for(dir= start; dir<end; dir++){
00927 int d;
00928
00929
00930 CHECK_MV(x + dia_size - dir, y - dir );
00931 }
00932
00933 start= FFMAX(0, -y + dia_size + ymin );
00934 end = FFMIN(dia_size, x - xmin + 1);
00935 for(dir= start; dir<end; dir++){
00936 int d;
00937
00938
00939 CHECK_MV(x - dir , y - dia_size + dir);
00940 }
00941
00942 start= FFMAX(0, -x + dia_size + xmin );
00943 end = FFMIN(dia_size, ymax - y + 1);
00944 for(dir= start; dir<end; dir++){
00945 int d;
00946
00947
00948 CHECK_MV(x - dia_size + dir, y + dir );
00949 }
00950
00951 if(x!=best[0] || y!=best[1])
00952 dia_size=0;
00953 #if 0
00954 {
00955 int dx, dy, i;
00956 static int stats[8*8];
00957 dx= FFABS(x-best[0]);
00958 dy= FFABS(y-best[1]);
00959 stats[dy*8 + dx] ++;
00960 if(256*256*256*64 % (stats[0]+1)==0){
00961 for(i=0; i<64; i++){
00962 if((i&7)==0) printf("\n");
00963 printf("%6d ", stats[i]);
00964 }
00965 printf("\n");
00966 }
00967 }
00968 #endif
00969 }
00970 return dmin;
00971 }
00972
00973 static av_always_inline int diamond_search(MpegEncContext * s, int *best, int dmin,
00974 int src_index, int ref_index, int const penalty_factor,
00975 int size, int h, int flags){
00976 MotionEstContext * const c= &s->me;
00977 if(c->dia_size==-1)
00978 return funny_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
00979 else if(c->dia_size<-1)
00980 return sab_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
00981 else if(c->dia_size<2)
00982 return small_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
00983 else if(c->dia_size>768)
00984 return umh_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
00985 else if(c->dia_size>512)
00986 return hex_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags, c->dia_size&0xFF);
00987 else if(c->dia_size>256)
00988 return l2s_dia_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
00989 else
00990 return var_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
00991 }
00992
00999 static av_always_inline int epzs_motion_search_internal(MpegEncContext * s, int *mx_ptr, int *my_ptr,
01000 int P[10][2], int src_index, int ref_index, int16_t (*last_mv)[2],
01001 int ref_mv_scale, int flags, int size, int h)
01002 {
01003 MotionEstContext * const c= &s->me;
01004 int best[2]={0, 0};
01008 int d;
01009 int dmin;
01011 int map_generation;
01012 int penalty_factor;
01013 const int ref_mv_stride= s->mb_stride;
01014 const int ref_mv_xy= s->mb_x + s->mb_y*ref_mv_stride;
01015 me_cmp_func cmpf, chroma_cmpf;
01016
01017 LOAD_COMMON
01018 LOAD_COMMON2
01019
01020 if(c->pre_pass){
01021 penalty_factor= c->pre_penalty_factor;
01022 cmpf= s->dsp.me_pre_cmp[size];
01023 chroma_cmpf= s->dsp.me_pre_cmp[size+1];
01024 }else{
01025 penalty_factor= c->penalty_factor;
01026 cmpf= s->dsp.me_cmp[size];
01027 chroma_cmpf= s->dsp.me_cmp[size+1];
01028 }
01029
01030 map_generation= update_map_generation(c);
01031
01032 assert(cmpf);
01033 dmin= cmp(s, 0, 0, 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);
01034 map[0]= map_generation;
01035 score_map[0]= dmin;
01036
01037
01038 if((s->pict_type == B_TYPE && !(c->flags & FLAG_DIRECT)) || s->flags&CODEC_FLAG_MV0)
01039 dmin += (mv_penalty[pred_x] + mv_penalty[pred_y])*penalty_factor;
01040
01041
01042 if (s->first_slice_line) {
01043 CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)
01044 CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,
01045 (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)
01046 }else{
01047 if(dmin<((h*h*s->avctx->mv0_threshold)>>8)
01048 && ( P_LEFT[0] |P_LEFT[1]
01049 |P_TOP[0] |P_TOP[1]
01050 |P_TOPRIGHT[0]|P_TOPRIGHT[1])==0){
01051 *mx_ptr= 0;
01052 *my_ptr= 0;
01053 c->skip=1;
01054 return dmin;
01055 }
01056 CHECK_MV( P_MEDIAN[0] >>shift , P_MEDIAN[1] >>shift)
01057 CHECK_CLIPPED_MV((P_MEDIAN[0]>>shift) , (P_MEDIAN[1]>>shift)-1)
01058 CHECK_CLIPPED_MV((P_MEDIAN[0]>>shift) , (P_MEDIAN[1]>>shift)+1)
01059 CHECK_CLIPPED_MV((P_MEDIAN[0]>>shift)-1, (P_MEDIAN[1]>>shift) )
01060 CHECK_CLIPPED_MV((P_MEDIAN[0]>>shift)+1, (P_MEDIAN[1]>>shift) )
01061 CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,
01062 (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)
01063 CHECK_MV(P_LEFT[0] >>shift, P_LEFT[1] >>shift)
01064 CHECK_MV(P_TOP[0] >>shift, P_TOP[1] >>shift)
01065 CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)
01066 }
01067 if(dmin>h*h*4){
01068 if(c->pre_pass){
01069 CHECK_CLIPPED_MV((last_mv[ref_mv_xy-1][0]*ref_mv_scale + (1<<15))>>16,
01070 (last_mv[ref_mv_xy-1][1]*ref_mv_scale + (1<<15))>>16)
01071 if(!s->first_slice_line)
01072 CHECK_CLIPPED_MV((last_mv[ref_mv_xy-ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16,
01073 (last_mv[ref_mv_xy-ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)
01074 }else{
01075 CHECK_CLIPPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16,
01076 (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)
01077 if(s->mb_y+1<s->end_mb_y)
01078 CHECK_CLIPPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16,
01079 (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)
01080 }
01081 }
01082
01083 if(c->avctx->last_predictor_count){
01084 const int count= c->avctx->last_predictor_count;
01085 const int xstart= FFMAX(0, s->mb_x - count);
01086 const int ystart= FFMAX(0, s->mb_y - count);
01087 const int xend= FFMIN(s->mb_width , s->mb_x + count + 1);
01088 const int yend= FFMIN(s->mb_height, s->mb_y + count + 1);
01089 int mb_y;
01090
01091 for(mb_y=ystart; mb_y<yend; mb_y++){
01092 int mb_x;
01093 for(mb_x=xstart; mb_x<xend; mb_x++){
01094 const int xy= mb_x + 1 + (mb_y + 1)*ref_mv_stride;
01095 int mx= (last_mv[xy][0]*ref_mv_scale + (1<<15))>>16;
01096 int my= (last_mv[xy][1]*ref_mv_scale + (1<<15))>>16;
01097
01098 if(mx>xmax || mx<xmin || my>ymax || my<ymin) continue;
01099 CHECK_MV(mx,my)
01100 }
01101 }
01102 }
01103
01104
01105 dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
01106
01107
01108 *mx_ptr= best[0];
01109 *my_ptr= best[1];
01110
01111
01112 return dmin;
01113 }
01114
01115
01116 inline int ff_epzs_motion_search(MpegEncContext * s, int *mx_ptr, int *my_ptr,
01117 int P[10][2], int src_index, int ref_index, int16_t (*last_mv)[2],
01118 int ref_mv_scale, int size, int h)
01119 {
01120 MotionEstContext * const c= &s->me;
01121
01122 if(c->flags==0 && h==16 && size==0){
01123 return epzs_motion_search_internal(s, mx_ptr, my_ptr, P, src_index, ref_index, last_mv, ref_mv_scale, 0, 0, 16);
01124
01125
01126 }else{
01127 return epzs_motion_search_internal(s, mx_ptr, my_ptr, P, src_index, ref_index, last_mv, ref_mv_scale, c->flags, size, h);
01128 }
01129 }
01130
01131 static int epzs_motion_search4(MpegEncContext * s,
01132 int *mx_ptr, int *my_ptr, int P[10][2],
01133 int src_index, int ref_index, int16_t (*last_mv)[2],
01134 int ref_mv_scale)
01135 {
01136 MotionEstContext * const c= &s->me;
01137 int best[2]={0, 0};
01138 int d, dmin;
01139 int map_generation;
01140 const int penalty_factor= c->penalty_factor;
01141 const int size=1;
01142 const int h=8;
01143 const int ref_mv_stride= s->mb_stride;
01144 const int ref_mv_xy= s->mb_x + s->mb_y *ref_mv_stride;
01145 me_cmp_func cmpf, chroma_cmpf;
01146 LOAD_COMMON
01147 int flags= c->flags;
01148 LOAD_COMMON2
01149
01150 cmpf= s->dsp.me_cmp[size];
01151 chroma_cmpf= s->dsp.me_cmp[size+1];
01152
01153 map_generation= update_map_generation(c);
01154
01155 dmin = 1000000;
01156
01157
01158 if (s->first_slice_line) {
01159 CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)
01160 CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,
01161 (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)
01162 CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)
01163 }else{
01164 CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)
01165
01166 CHECK_MV(P_MEDIAN[0]>>shift, P_MEDIAN[1]>>shift)
01167 CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)
01168 CHECK_MV(P_TOP[0]>>shift, P_TOP[1]>>shift)
01169 CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)
01170 CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,
01171 (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)
01172 }
01173 if(dmin>64*4){
01174 CHECK_CLIPPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16,
01175 (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)
01176 if(s->mb_y+1<s->end_mb_y)
01177 CHECK_CLIPPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16,
01178 (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)
01179 }
01180
01181 dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
01182
01183 *mx_ptr= best[0];
01184 *my_ptr= best[1];
01185
01186
01187 return dmin;
01188 }
01189
01190
01191 static int epzs_motion_search2(MpegEncContext * s,
01192 int *mx_ptr, int *my_ptr, int P[10][2],
01193 int src_index, int ref_index, int16_t (*last_mv)[2],
01194 int ref_mv_scale)
01195 {
01196 MotionEstContext * const c= &s->me;
01197 int best[2]={0, 0};
01198 int d, dmin;
01199 int map_generation;
01200 const int penalty_factor= c->penalty_factor;
01201 const int size=0;
01202 const int h=8;
01203 const int ref_mv_stride= s->mb_stride;
01204 const int ref_mv_xy= s->mb_x + s->mb_y *ref_mv_stride;
01205 me_cmp_func cmpf, chroma_cmpf;
01206 LOAD_COMMON
01207 int flags= c->flags;
01208 LOAD_COMMON2
01209
01210 cmpf= s->dsp.me_cmp[size];
01211 chroma_cmpf= s->dsp.me_cmp[size+1];
01212
01213 map_generation= update_map_generation(c);
01214
01215 dmin = 1000000;
01216
01217
01218 if (s->first_slice_line) {
01219 CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)
01220 CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,
01221 (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)
01222 CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)
01223 }else{
01224 CHECK_MV(P_MV1[0]>>shift, P_MV1[1]>>shift)
01225
01226 CHECK_MV(P_MEDIAN[0]>>shift, P_MEDIAN[1]>>shift)
01227 CHECK_MV(P_LEFT[0]>>shift, P_LEFT[1]>>shift)
01228 CHECK_MV(P_TOP[0]>>shift, P_TOP[1]>>shift)
01229 CHECK_MV(P_TOPRIGHT[0]>>shift, P_TOPRIGHT[1]>>shift)
01230 CHECK_CLIPPED_MV((last_mv[ref_mv_xy][0]*ref_mv_scale + (1<<15))>>16,
01231 (last_mv[ref_mv_xy][1]*ref_mv_scale + (1<<15))>>16)
01232 }
01233 if(dmin>64*4){
01234 CHECK_CLIPPED_MV((last_mv[ref_mv_xy+1][0]*ref_mv_scale + (1<<15))>>16,
01235 (last_mv[ref_mv_xy+1][1]*ref_mv_scale + (1<<15))>>16)
01236 if(s->mb_y+1<s->end_mb_y)
01237 CHECK_CLIPPED_MV((last_mv[ref_mv_xy+ref_mv_stride][0]*ref_mv_scale + (1<<15))>>16,
01238 (last_mv[ref_mv_xy+ref_mv_stride][1]*ref_mv_scale + (1<<15))>>16)
01239 }
01240
01241 dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
01242
01243 *mx_ptr= best[0];
01244 *my_ptr= best[1];
01245
01246
01247 return dmin;
01248 }