43 #define P_TOPRIGHT P[3]
48 int *mx_ptr,
int *my_ptr,
int dmin,
49 int src_index,
int ref_index,
76 #define FLAG_QPEL 1 //must be 1
88 c->
src[0][i]= src [i] + offset[i];
89 c->
ref[0][i]= ref [i] + offset[i];
93 c->
ref[ref_index][i]= ref2[i] + offset[i];
105 const int size,
const int h,
int ref_index,
int src_index,
109 const int hx= subx + (x<<(1+qpel));
110 const int hy= suby + (y<<(1+qpel));
111 uint8_t *
const *
const ref= c->
ref[ref_index];
112 uint8_t *
const *
const src= c->
src[src_index];
115 av_assert2(x >= c->
xmin && hx <= c->xmax<<(qpel+1) && y >= c->
ymin && hy <= c->ymax<<(qpel+1));
116 if(x >= c->
xmin && hx <= c->xmax<<(qpel+1) && y >= c->
ymin && hy <= c->ymax<<(qpel+1)){
119 const int mask= 2*qpel+1;
127 int fxy= (fx&
mask) + ((fy&mask)<<(qpel+1));
128 int bxy= (bx&
mask) + ((by&mask)<<(qpel+1));
144 int fxy= (fx&
mask) + ((fy&mask)<<(qpel+1));
145 int bxy= (bx&
mask) + ((by&mask)<<(qpel+1));
170 d = cmp_func(s, c->
temp, src[0], stride, 16);
177 const int size,
const int h,
int ref_index,
int src_index,
182 const int dxy= subx + (suby<<(1+qpel));
183 const int hx= subx + (x<<(1+qpel));
184 const int hy= suby + (y<<(1+qpel));
185 uint8_t *
const *
const ref= c->
ref[ref_index];
186 uint8_t *
const *
const src= c->
src[src_index];
192 if (h << size == 16) {
194 }
else if (size == 0 && h == 8) {
204 uvdxy= (cx&1) + 2*(cy&1);
210 uvdxy= dxy | (x&1) | (2*(y&1));
212 d = cmp_func(s, c->
temp, src[0], stride, h);
214 d = cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);
216 uvdxy= (x&1) + 2*(y&1);
220 c->
hpel_put[size+1][uvdxy](uvtemp , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
221 c->
hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
222 d += chroma_cmp_func(s, uvtemp , src[1], uvstride, h>>1);
223 d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);
229 int ref_index,
int src_index,
231 return cmp_inline(s,x,y,0,0,0,16,ref_index,src_index, cmp_func, chroma_cmp_func, 0, 0);
235 const int size,
const int h,
int ref_index,
int src_index,
238 return cmp_direct_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL);
240 return cmp_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&
FLAG_CHROMA);
245 const int size,
const int h,
int ref_index,
int src_index,
248 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL);
250 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);
258 const int size,
const int h,
int ref_index,
int src_index,
262 && flags==0 && h==16 && size==0 && subx==0 && suby==0){
263 return cmp_simple(s,x,y,ref_index,src_index, cmp_func, chroma_cmp_func);
265 && subx==0 && suby==0){
266 return cmp_fpel_internal(s,x,y,size,h,ref_index,src_index, cmp_func, chroma_cmp_func,flags);
268 return cmp_internal(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags);
273 const int size,
const int h,
int ref_index,
int src_index,
276 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0);
278 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&
FLAG_CHROMA);
283 const int size,
const int h,
int ref_index,
int src_index,
286 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1);
288 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1, flags&
FLAG_CHROMA);
312 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");
318 if(cache_size < 2*dia_size && !c->
stride){
380 #define CHECK_SAD_HALF_MV(suffix, x, y) \
382 d= s->dsp.pix_abs[size][(x?1:0)+(y?2:0)](NULL, pix, ptr+((x)>>1), stride, h);\
383 d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\
384 COPY3_IF_LT(dminh, d, dx, x, dy, y)\
388 int *mx_ptr,
int *my_ptr,
int dmin,
389 int src_index,
int ref_index,
408 pix = c->
src[src_index][0];
412 ptr = c->
ref[ref_index][0] + (my *
stride) + mx;
416 if (mx > xmin && mx < xmax &&
417 my > ymin && my < ymax) {
422 const int l= score_map[(index- 1 )&(
ME_MAP_SIZE-1)];
536 c->
xmin = (x > 15) ? - 15 : 0;
537 c->
ymin = (y > 15) ? - 15 : 0;
546 if(!range || range > max_range)
559 c->
ref[1][0] = c->
ref[0][0] + 8;
561 c->
ref[3][0] = c->
ref[2][0] + 8;
562 c->
src[1][0] = c->
src[0][0] + 8;
564 c->
src[3][0] = c->
src[2][0] + 8;
574 int dmin_sum=0, mx4_sum=0, my4_sum=0, i;
582 for(block=0; block<4; block++){
584 int pred_x4, pred_y4;
586 static const int off[4]= {2, 1, 1, -1};
625 if(P[i][1] > (c->
ymax<<shift)) P[i][1]= (c->
ymax<<shift);
638 dxy = ((my4 & 3) << 2) | (mx4 & 3);
646 dxy = ((my4 & 1) << 1) | (mx4 & 1);
653 dmin_sum+= (mv_penalty[mx4-pred_x4] + mv_penalty[my4-pred_y4])*c->
mb_penalty_factor;
668 if(mx4 != mx || my4 != my) same=0;
685 dxy = ((my & 1) << 1) | (mx & 1);
728 int16_t (*mv_tables[2][2])[2],
uint8_t *field_select_tables[2],
int mx,
int my,
int user_field_select)
740 const int xy= s->
mb_x + s->
mb_y*mot_stride;
748 for(block=0; block<2; block++){
750 int best_dmin= INT_MAX;
753 for(field_select=0; field_select<2; field_select++){
754 int dmin, mx_i, my_i;
755 int16_t (*mv_table)[2]= mv_tables[
block][field_select];
757 if(user_field_select){
758 av_assert1(field_select==0 || field_select==1);
759 av_assert1(field_select_tables[block][xy]==0 || field_select_tables[block][xy]==1);
760 if(field_select_tables[block][xy] != field_select)
764 P_LEFT[0] = mv_table[xy - 1][0];
765 P_LEFT[1] = mv_table[xy - 1][1];
772 P_TOP[0] = mv_table[xy - mot_stride][0];
773 P_TOP[1] = mv_table[xy - mot_stride][1];
774 P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];
775 P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];
787 dmin =
epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);
789 dmin= c->
sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);
791 mv_table[xy][0]= mx_i;
792 mv_table[xy][1]= my_i;
798 uint8_t *ref= c->
ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*
stride;
799 dxy = ((my_i & 1) << 1) | (mx_i & 1);
811 dmin += field_select !=
block;
813 if(dmin < best_dmin){
815 best_field= field_select;
819 int16_t (*mv_table)[2]= mv_tables[
block][best_field];
821 if(mv_table[xy][0] != mx) same=0;
822 if(mv_table[xy][1]&1) same=0;
823 if(mv_table[xy][1]*2 != my) same=0;
824 if(best_field != block) same=0;
827 field_select_tables[
block][xy]= best_field;
828 dmin_sum += best_dmin;
850 int ymax= s->
me.
ymax>>interlaced;
851 int ymin= s->
me.
ymin>>interlaced;
855 if(mv[1] < ymin) mv[1] = ymin;
856 if(mv[1] > ymax) mv[1] = ymax;
897 int field_select0= p->
f.
ref_index[0][4*mb_xy ];
898 int field_select1= p->
f.
ref_index[0][4*mb_xy+2];
899 av_assert0(field_select0==0 ||field_select0==1);
900 av_assert0(field_select1==0 ||field_select1==1);
919 d =
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select0, 0, cmpf, chroma_cmpf, flags);
922 d+=
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select1, 1, cmpf, chroma_cmpf, flags);
925 int field_select0 = p->
f.
ref_index[1][4 * mb_xy ];
926 int field_select1 = p->
f.
ref_index[1][4 * mb_xy + 2];
927 av_assert0(field_select0==0 ||field_select0==1);
928 av_assert0(field_select1==0 ||field_select1==1);
943 d =
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select0+2, 0, cmpf, chroma_cmpf, flags);
946 d+=
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select1+2, 1, cmpf, chroma_cmpf, flags);
951 }
else if(
IS_8X8(mb_type)){
957 chroma_cmpf= s->
dsp.
sse[1];
963 d+=
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 1, 8, i, i, cmpf, chroma_cmpf, flags);
981 d =
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 16, 0, 0, cmpf, chroma_cmpf, flags);
988 d =
cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 16, 2, 0, cmpf, chroma_cmpf, flags);
1001 return (3*lambda)>>(FF_LAMBDA_SHIFT+1);
1024 int sum, mx, my, dmin;
1151 if (vard*2 + 200*256 > varc)
1153 if (varc*2 + 200*256 > vard || s->
qscale > 24){
1165 && !c->
skip && varc>50<<8 && vard>10<<8){
1186 && !c->
skip && varc>50<<8 && vard>10<<8){
1206 intra_score= varc - 500;
1208 unsigned mean = (sum+128)>>8;
1211 for(i=0; i<16; i++){
1222 if(intra_score < dmin){
1292 int mb_x,
int mb_y, int16_t (*mv_table)[2],
int ref_index,
int f_code)
1299 const int mot_xy = mb_y*mot_stride + mb_x;
1319 P_LEFT[0] = mv_table[mot_xy - 1][0];
1320 P_LEFT[1] = mv_table[mot_xy - 1][1];
1326 P_TOP[0] = mv_table[mot_xy - mot_stride ][0];
1327 P_TOP[1] = mv_table[mot_xy - mot_stride ][1];
1328 P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1][0];
1329 P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1][1];
1357 mv_table[mot_xy][0]= mx;
1358 mv_table[mot_xy][1]= my;
1364 int motion_fx,
int motion_fy,
1365 int motion_bx,
int motion_by,
1366 int pred_fx,
int pred_fy,
1367 int pred_bx,
int pred_by,
1387 dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);
1388 src_x = motion_fx >> 2;
1389 src_y = motion_fy >> 2;
1391 ptr = ref_data[0] + (src_y *
stride) + src_x;
1394 dxy = ((motion_by & 3) << 2) | (motion_bx & 3);
1395 src_x = motion_bx >> 2;
1396 src_y = motion_by >> 2;
1398 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1401 dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);
1402 src_x = motion_fx >> 1;
1403 src_y = motion_fy >> 1;
1405 ptr = ref_data[0] + (src_y *
stride) + src_x;
1408 dxy = ((motion_by & 1) << 1) | (motion_bx & 1);
1409 src_x = motion_bx >> 1;
1410 src_y = motion_by >> 1;
1412 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1416 fbmin = (mv_penalty_f[motion_fx-pred_fx] + mv_penalty_f[motion_fy-pred_fy])*c->
mb_penalty_factor
1417 +(mv_penalty_b[motion_bx-pred_bx] + mv_penalty_b[motion_by-pred_by])*c->
mb_penalty_factor
1432 const int xy = mb_y *mot_stride + mb_x;
1444 const int shift= 1+qpel;
1449 #define HASH(fx,fy,bx,by) ((fx)+17*(fy)+63*(bx)+117*(by))
1450 #define HASH8(fx,fy,bx,by) ((uint8_t)HASH(fx,fy,bx,by))
1451 int hashidx=
HASH(motion_fx,motion_fy, motion_bx, motion_by);
1454 map[hashidx&255] = 1;
1457 motion_bx, motion_by,
1464 static const uint8_t limittab[5]={0,8,32,64,80};
1466 static const int8_t vect[][4]={
1467 { 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},
1469 { 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},
1470 { 0, 1, 0, 1}, { 0,-1, 0,-1}, { 1, 0, 1, 0}, {-1, 0,-1, 0},
1471 { 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},
1472 { 0,-1, 0, 1}, { 0, 1, 0,-1}, {-1, 0, 1, 0}, { 1, 0,-1, 0},
1474 { 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},
1475 { 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},
1476 { 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},
1477 { 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},
1479 { 1, 1, 1, 1}, {-1,-1,-1,-1},
1480 { 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},
1481 { 1, 1,-1,-1}, {-1,-1, 1, 1}, { 1,-1,-1, 1}, {-1, 1, 1,-1}, { 1,-1, 1,-1}, {-1, 1,-1, 1},
1484 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),
1486 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),
1487 HASH8( 0, 1, 0, 1),
HASH8( 0,-1, 0,-1),
HASH8( 1, 0, 1, 0),
HASH8(-1, 0,-1, 0),
1488 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),
1489 HASH8( 0,-1, 0, 1),
HASH8( 0, 1, 0,-1),
HASH8(-1, 0, 1, 0),
HASH8( 1, 0,-1, 0),
1491 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),
1492 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),
1493 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),
1494 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),
1497 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),
1498 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),
1501 #define CHECK_BIDIR(fx,fy,bx,by)\
1502 if( !map[(hashidx+HASH(fx,fy,bx,by))&255]\
1503 &&(fx<=0 || motion_fx+fx<=xmax) && (fy<=0 || motion_fy+fy<=ymax) && (bx<=0 || motion_bx+bx<=xmax) && (by<=0 || motion_by+by<=ymax)\
1504 &&(fx>=0 || motion_fx+fx>=xmin) && (fy>=0 || motion_fy+fy>=ymin) && (bx>=0 || motion_bx+bx>=xmin) && (by>=0 || motion_by+by>=ymin)){\
1506 map[(hashidx+HASH(fx,fy,bx,by))&255] = 1;\
1507 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);\
1509 hashidx += HASH(fx,fy,bx,by);\
1518 #define CHECK_BIDIR2(a,b,c,d)\
1519 CHECK_BIDIR(a,b,c,d)\
1520 CHECK_BIDIR(-(a),-(b),-(c),-(d))
1532 for(i=8; i<limit; i++){
1533 int fx= motion_fx+vect[i][0];
1534 int fy= motion_fy+vect[i][1];
1535 int bx= motion_bx+vect[i][2];
1536 int by= motion_by+vect[i][3];
1538 int a= (xmax -
FFMAX(fx,bx))|(
FFMIN(fx,bx) - xmin);
1539 int b= (ymax -
FFMAX(fy,by))|(
FFMIN(fy,by) - ymin);
1541 map[(hashidx+hash[i])&255] = 1;
1543 if(!map[(hashidx+hash[i])&255]){
1545 map[(hashidx+hash[i])&255] = 1;
1546 score=
check_bidir_mv(s, fx, fy, bx, by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);
1559 borderdist=
FFMIN(a,b);
1580 const int mot_xy = mb_y*mot_stride + mb_x;
1583 const int time_pp= s->
pp_time;
1584 const int time_pb= s->
pb_time;
1585 int mx, my, xmin, xmax, ymin, ymax;
1589 ymin= xmin=(-32)>>shift;
1590 ymax= xmax= 31>>
shift;
1614 xmin=
FFMAX(xmin, - 16 - min);
1621 ymin=
FFMAX(ymin, - 16 - min);
1626 av_assert2(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);
1628 if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){
1632 return 256*256*256*64;
1644 P_LEFT[0] = av_clip(mv_table[mot_xy - 1][0], xmin<<shift, xmax<<shift);
1645 P_LEFT[1] = av_clip(mv_table[mot_xy - 1][1], ymin<<shift, ymax<<shift);
1649 P_TOP[0] = av_clip(mv_table[mot_xy - mot_stride ][0], xmin<<shift, xmax<<shift);
1650 P_TOP[1] = av_clip(mv_table[mot_xy - mot_stride ][1], ymin<<shift, ymax<<shift);
1651 P_TOPRIGHT[0] = av_clip(mv_table[mot_xy - mot_stride + 1 ][0], xmin<<shift, xmax<<shift);
1652 P_TOPRIGHT[1] = av_clip(mv_table[mot_xy - mot_stride + 1 ][1], ymin<<shift, ymax<<shift);
1669 mv_table[mot_xy][0]= mx;
1670 mv_table[mot_xy][1]= my;
1682 int fmin, bmin, dmin, fbmin, bimin, fimin;
1684 const int xy = mb_y*s->
mb_stride + mb_x;
1695 score= ((unsigned)(score*score + 128*256))>>16;
1768 av_dlog(s,
"%d %d %d %d\n", dmin, fmin, bmin, fbmin);
1782 fimin= bimin= INT_MAX;
1809 score= ((unsigned)(score*score + 128*256))>>16;
1820 if(fimin < INT_MAX && bimin < INT_MAX){
1840 int best_score=-10000000;
1843 range=
FFMIN(range, 16);
1845 range=
FFMIN(range, 256);
1847 for(i=0; i<8; i++) score[i]= s->
mb_num*(8-i);
1854 int mx= mv_table[xy][0];
1855 int my= mv_table[xy][1];
1860 if(mx >= range || mx < -range ||
1861 my >= range || my < -range)
1864 for(j=0; j<fcode && j<8; j++){
1874 if(score[i] > best_score){
1875 best_score= score[i];
1889 const int f_code= s->
f_code;
1895 av_assert0(range <= 16 || !s->msmpeg4_version);
1912 for(block=0; block<4; block++){
1913 int off= (block& 1) + (block>>1)*
wrap;
1917 if( mx >=range || mx <-range
1918 || my >=range || my <-range){
1919 s->
mb_type[i] &= ~CANDIDATE_MB_TYPE_INTER4V;
1937 int16_t (*mv_table)[2],
int f_code,
int type,
int truncate)
1940 int y, h_range, v_range;
1948 v_range= field_select_table ? range>>1 : range;
1956 if(field_select_table==
NULL || field_select_table[xy] == field_select){
1957 if( mv_table[xy][0] >=h_range || mv_table[xy][0] <-h_range
1958 || mv_table[xy][1] >=v_range || mv_table[xy][1] <-v_range){
1961 if (mv_table[xy][0] > h_range-1) mv_table[xy][0]= h_range-1;
1962 else if(mv_table[xy][0] < -h_range ) mv_table[xy][0]= -h_range;
1963 if (mv_table[xy][1] > v_range-1) mv_table[xy][1]= v_range-1;
1964 else if(mv_table[xy][1] < -v_range ) mv_table[xy][1]= -v_range;