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];
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];
198 uvdxy= (cx&1) + 2*(cy&1);
204 uvdxy= dxy | (x&1) | (2*(y&1));
206 d = cmp_func(s, c->
temp, src[0], stride, h);
208 d = cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);
210 uvdxy= (x&1) + 2*(y&1);
214 c->
hpel_put[size+1][uvdxy](uvtemp , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
215 c->
hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
216 d += chroma_cmp_func(s, uvtemp , src[1], uvstride, h>>1);
217 d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);
223 int ref_index,
int src_index,
225 return cmp_inline(s,x,y,0,0,0,16,ref_index,src_index, cmp_func, chroma_cmp_func, 0, 0);
229 const int size,
const int h,
int ref_index,
int src_index,
232 return cmp_direct_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL);
234 return cmp_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&
FLAG_CHROMA);
239 const int size,
const int h,
int ref_index,
int src_index,
242 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL);
244 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL, flags&
FLAG_CHROMA);
252 const int size,
const int h,
int ref_index,
int src_index,
256 && flags==0 && h==16 && size==0 && subx==0 && suby==0){
257 return cmp_simple(s,x,y,ref_index,src_index, cmp_func, chroma_cmp_func);
259 && subx==0 && suby==0){
260 return cmp_fpel_internal(s,x,y,size,h,ref_index,src_index, cmp_func, chroma_cmp_func,flags);
262 return cmp_internal(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags);
267 const int size,
const int h,
int ref_index,
int src_index,
270 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0);
272 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&
FLAG_CHROMA);
277 const int size,
const int h,
int ref_index,
int src_index,
280 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1);
282 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1, flags&
FLAG_CHROMA);
306 av_log(s->
avctx,
AV_LOG_ERROR,
"me_method is only allowed to be set to zero and epzs; for hex,umh,full and others see dia_size\n");
312 if(cache_size < 2*dia_size && !c->
stride){
376 #define CHECK_SAD_HALF_MV(suffix, x, y) \
378 d= s->dsp.pix_abs[size][(x?1:0)+(y?2:0)](NULL, pix, ptr+((x)>>1), stride, h);\
379 d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\
380 COPY3_IF_LT(dminh, d, dx, x, dy, y)\
384 int *mx_ptr,
int *my_ptr,
int dmin,
385 int src_index,
int ref_index,
404 pix = c->
src[src_index][0];
408 ptr = c->
ref[ref_index][0] + (my *
stride) + mx;
412 if (mx > xmin && mx < xmax &&
413 my > ymin && my < ymax) {
418 const int l= score_map[(index- 1 )&(
ME_MAP_SIZE-1)];
532 c->
xmin = (x > 15) ? - 15 : 0;
533 c->
ymin = (y > 15) ? - 15 : 0;
542 if(!range || range > max_range)
555 c->
ref[1][0] = c->
ref[0][0] + 8;
557 c->
ref[3][0] = c->
ref[2][0] + 8;
558 c->
src[1][0] = c->
src[0][0] + 8;
560 c->
src[3][0] = c->
src[2][0] + 8;
570 int dmin_sum=0, mx4_sum=0, my4_sum=0, i;
578 for(block=0; block<4; block++){
580 int pred_x4, pred_y4;
582 static const int off[4]= {2, 1, 1, -1};
621 if(P[i][1] > (c->
ymax<<shift)) P[i][1]= (c->
ymax<<shift);
634 dxy = ((my4 & 3) << 2) | (mx4 & 3);
642 dxy = ((my4 & 1) << 1) | (mx4 & 1);
649 dmin_sum+= (mv_penalty[mx4-pred_x4] + mv_penalty[my4-pred_y4])*c->
mb_penalty_factor;
664 if(mx4 != mx || my4 != my) same=0;
681 dxy = ((my & 1) << 1) | (mx & 1);
724 int16_t (*mv_tables[2][2])[2],
uint8_t *field_select_tables[2],
int mx,
int my,
int user_field_select)
736 const int xy= s->
mb_x + s->
mb_y*mot_stride;
744 for(block=0; block<2; block++){
746 int best_dmin= INT_MAX;
749 for(field_select=0; field_select<2; field_select++){
750 int dmin, mx_i, my_i;
751 int16_t (*mv_table)[2]= mv_tables[
block][field_select];
753 if(user_field_select){
754 av_assert1(field_select==0 || field_select==1);
755 av_assert1(field_select_tables[block][xy]==0 || field_select_tables[block][xy]==1);
756 if(field_select_tables[block][xy] != field_select)
760 P_LEFT[0] = mv_table[xy - 1][0];
761 P_LEFT[1] = mv_table[xy - 1][1];
768 P_TOP[0] = mv_table[xy - mot_stride][0];
769 P_TOP[1] = mv_table[xy - mot_stride][1];
770 P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];
771 P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];
783 dmin =
epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);
785 dmin= c->
sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);
787 mv_table[xy][0]= mx_i;
788 mv_table[xy][1]= my_i;
794 uint8_t *ref= c->
ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*
stride;
795 dxy = ((my_i & 1) << 1) | (mx_i & 1);
807 dmin += field_select !=
block;
809 if(dmin < best_dmin){
811 best_field= field_select;
815 int16_t (*mv_table)[2]= mv_tables[
block][best_field];
817 if(mv_table[xy][0] != mx) same=0;
818 if(mv_table[xy][1]&1) same=0;
819 if(mv_table[xy][1]*2 != my) same=0;
820 if(best_field != block) same=0;
823 field_select_tables[
block][xy]= best_field;
824 dmin_sum += best_dmin;
851 return (3*lambda)>>(FF_LAMBDA_SHIFT+1);
874 int sum, mx, my, dmin;
986 if (vard*2 + 200*256 > varc)
988 if (varc*2 + 200*256 > vard || s->
qscale > 24){
1000 && !c->
skip && varc>50<<8 && vard>10<<8){
1021 && !c->
skip && varc>50<<8 && vard>10<<8){
1041 intra_score= varc - 500;
1043 unsigned mean = (sum+128)>>8;
1046 for(i=0; i<16; i++){
1057 if(intra_score < dmin){
1127 int16_t (*mv_table)[2],
int ref_index,
int f_code)
1134 const int mot_xy = mb_y*mot_stride + mb_x;
1154 P_LEFT[0] = mv_table[mot_xy - 1][0];
1155 P_LEFT[1] = mv_table[mot_xy - 1][1];
1161 P_TOP[0] = mv_table[mot_xy - mot_stride ][0];
1162 P_TOP[1] = mv_table[mot_xy - mot_stride ][1];
1163 P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1][0];
1164 P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1][1];
1192 mv_table[mot_xy][0]= mx;
1193 mv_table[mot_xy][1]= my;
1199 int motion_fx,
int motion_fy,
1200 int motion_bx,
int motion_by,
1201 int pred_fx,
int pred_fy,
1202 int pred_bx,
int pred_by,
1222 dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);
1223 src_x = motion_fx >> 2;
1224 src_y = motion_fy >> 2;
1226 ptr = ref_data[0] + (src_y *
stride) + src_x;
1229 dxy = ((motion_by & 3) << 2) | (motion_bx & 3);
1230 src_x = motion_bx >> 2;
1231 src_y = motion_by >> 2;
1233 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1236 dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);
1237 src_x = motion_fx >> 1;
1238 src_y = motion_fy >> 1;
1240 ptr = ref_data[0] + (src_y *
stride) + src_x;
1243 dxy = ((motion_by & 1) << 1) | (motion_bx & 1);
1244 src_x = motion_bx >> 1;
1245 src_y = motion_by >> 1;
1247 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1251 fbmin = (mv_penalty_f[motion_fx-pred_fx] + mv_penalty_f[motion_fy-pred_fy])*c->
mb_penalty_factor
1252 +(mv_penalty_b[motion_bx-pred_bx] + mv_penalty_b[motion_by-pred_by])*c->
mb_penalty_factor
1267 const int xy = mb_y *mot_stride + mb_x;
1279 const int shift= 1+qpel;
1284 #define HASH(fx,fy,bx,by) ((fx)+17*(fy)+63*(bx)+117*(by))
1285 #define HASH8(fx,fy,bx,by) ((uint8_t)HASH(fx,fy,bx,by))
1286 int hashidx=
HASH(motion_fx,motion_fy, motion_bx, motion_by);
1289 map[hashidx&255] = 1;
1292 motion_bx, motion_by,
1299 static const uint8_t limittab[5]={0,8,32,64,80};
1301 static const int8_t vect[][4]={
1302 { 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},
1304 { 0, 0, 1, 1}, { 0, 0,-1,-1}, { 0, 1, 1, 0}, { 0,-1,-1, 0}, { 1, 1, 0, 0}, {-1,-1, 0, 0}, { 1, 0, 0, 1}, {-1, 0, 0,-1},
1305 { 0, 1, 0, 1}, { 0,-1, 0,-1}, { 1, 0, 1, 0}, {-1, 0,-1, 0},
1306 { 0, 0,-1, 1}, { 0, 0, 1,-1}, { 0,-1, 1, 0}, { 0, 1,-1, 0}, {-1, 1, 0, 0}, { 1,-1, 0, 0}, { 1, 0, 0,-1}, {-1, 0, 0, 1},
1307 { 0,-1, 0, 1}, { 0, 1, 0,-1}, {-1, 0, 1, 0}, { 1, 0,-1, 0},
1309 { 0, 1, 1, 1}, { 0,-1,-1,-1}, { 1, 1, 1, 0}, {-1,-1,-1, 0}, { 1, 1, 0, 1}, {-1,-1, 0,-1}, { 1, 0, 1, 1}, {-1, 0,-1,-1},
1310 { 0,-1, 1, 1}, { 0, 1,-1,-1}, {-1, 1, 1, 0}, { 1,-1,-1, 0}, { 1, 1, 0,-1}, {-1,-1, 0, 1}, { 1, 0,-1, 1}, {-1, 0, 1,-1},
1311 { 0, 1,-1, 1}, { 0,-1, 1,-1}, { 1,-1, 1, 0}, {-1, 1,-1, 0}, {-1, 1, 0, 1}, { 1,-1, 0,-1}, { 1, 0, 1,-1}, {-1, 0,-1, 1},
1312 { 0, 1, 1,-1}, { 0,-1,-1, 1}, { 1, 1,-1, 0}, {-1,-1, 1, 0}, { 1,-1, 0, 1}, {-1, 1, 0,-1}, {-1, 0, 1, 1}, { 1, 0,-1,-1},
1314 { 1, 1, 1, 1}, {-1,-1,-1,-1},
1315 { 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},
1316 { 1, 1,-1,-1}, {-1,-1, 1, 1}, { 1,-1,-1, 1}, {-1, 1, 1,-1}, { 1,-1, 1,-1}, {-1, 1,-1, 1},
1319 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),
1321 HASH8( 0, 0, 1, 1),
HASH8( 0, 0,-1,-1),
HASH8( 0, 1, 1, 0),
HASH8( 0,-1,-1, 0),
HASH8( 1, 1, 0, 0),
HASH8(-1,-1, 0, 0),
HASH8( 1, 0, 0, 1),
HASH8(-1, 0, 0,-1),
1322 HASH8( 0, 1, 0, 1),
HASH8( 0,-1, 0,-1),
HASH8( 1, 0, 1, 0),
HASH8(-1, 0,-1, 0),
1323 HASH8( 0, 0,-1, 1),
HASH8( 0, 0, 1,-1),
HASH8( 0,-1, 1, 0),
HASH8( 0, 1,-1, 0),
HASH8(-1, 1, 0, 0),
HASH8( 1,-1, 0, 0),
HASH8( 1, 0, 0,-1),
HASH8(-1, 0, 0, 1),
1324 HASH8( 0,-1, 0, 1),
HASH8( 0, 1, 0,-1),
HASH8(-1, 0, 1, 0),
HASH8( 1, 0,-1, 0),
1326 HASH8( 0, 1, 1, 1),
HASH8( 0,-1,-1,-1),
HASH8( 1, 1, 1, 0),
HASH8(-1,-1,-1, 0),
HASH8( 1, 1, 0, 1),
HASH8(-1,-1, 0,-1),
HASH8( 1, 0, 1, 1),
HASH8(-1, 0,-1,-1),
1327 HASH8( 0,-1, 1, 1),
HASH8( 0, 1,-1,-1),
HASH8(-1, 1, 1, 0),
HASH8( 1,-1,-1, 0),
HASH8( 1, 1, 0,-1),
HASH8(-1,-1, 0, 1),
HASH8( 1, 0,-1, 1),
HASH8(-1, 0, 1,-1),
1328 HASH8( 0, 1,-1, 1),
HASH8( 0,-1, 1,-1),
HASH8( 1,-1, 1, 0),
HASH8(-1, 1,-1, 0),
HASH8(-1, 1, 0, 1),
HASH8( 1,-1, 0,-1),
HASH8( 1, 0, 1,-1),
HASH8(-1, 0,-1, 1),
1329 HASH8( 0, 1, 1,-1),
HASH8( 0,-1,-1, 1),
HASH8( 1, 1,-1, 0),
HASH8(-1,-1, 1, 0),
HASH8( 1,-1, 0, 1),
HASH8(-1, 1, 0,-1),
HASH8(-1, 0, 1, 1),
HASH8( 1, 0,-1,-1),
1332 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),
1333 HASH8( 1, 1,-1,-1),
HASH8(-1,-1, 1, 1),
HASH8( 1,-1,-1, 1),
HASH8(-1, 1, 1,-1),
HASH8( 1,-1, 1,-1),
HASH8(-1, 1,-1, 1),
1336 #define CHECK_BIDIR(fx,fy,bx,by)\
1337 if( !map[(hashidx+HASH(fx,fy,bx,by))&255]\
1338 &&(fx<=0 || motion_fx+fx<=xmax) && (fy<=0 || motion_fy+fy<=ymax) && (bx<=0 || motion_bx+bx<=xmax) && (by<=0 || motion_by+by<=ymax)\
1339 &&(fx>=0 || motion_fx+fx>=xmin) && (fy>=0 || motion_fy+fy>=ymin) && (bx>=0 || motion_bx+bx>=xmin) && (by>=0 || motion_by+by>=ymin)){\
1341 map[(hashidx+HASH(fx,fy,bx,by))&255] = 1;\
1342 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);\
1344 hashidx += HASH(fx,fy,bx,by);\
1353 #define CHECK_BIDIR2(a,b,c,d)\
1354 CHECK_BIDIR(a,b,c,d)\
1355 CHECK_BIDIR(-(a),-(b),-(c),-(d))
1367 for(i=8; i<limit; i++){
1368 int fx= motion_fx+vect[i][0];
1369 int fy= motion_fy+vect[i][1];
1370 int bx= motion_bx+vect[i][2];
1371 int by= motion_by+vect[i][3];
1373 int a= (xmax -
FFMAX(fx,bx))|(
FFMIN(fx,bx) - xmin);
1374 int b= (ymax -
FFMAX(fy,by))|(
FFMIN(fy,by) - ymin);
1376 map[(hashidx+hash[i])&255] = 1;
1378 if(!map[(hashidx+hash[i])&255]){
1380 map[(hashidx+hash[i])&255] = 1;
1381 score=
check_bidir_mv(s, fx, fy, bx, by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);
1394 borderdist=
FFMIN(a,b);
1415 const int mot_xy = mb_y*mot_stride + mb_x;
1418 const int time_pp= s->
pp_time;
1419 const int time_pb= s->
pb_time;
1420 int mx, my, xmin, xmax, ymin, ymax;
1424 ymin= xmin=(-32)>>shift;
1425 ymax= xmax= 31>>
shift;
1449 xmin=
FFMAX(xmin, - 16 - min);
1456 ymin=
FFMAX(ymin, - 16 - min);
1461 av_assert2(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);
1463 if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){
1467 return 256*256*256*64;
1479 P_LEFT[0] = av_clip(mv_table[mot_xy - 1][0], xmin<<shift, xmax<<shift);
1480 P_LEFT[1] = av_clip(mv_table[mot_xy - 1][1], ymin<<shift, ymax<<shift);
1484 P_TOP[0] = av_clip(mv_table[mot_xy - mot_stride ][0], xmin<<shift, xmax<<shift);
1485 P_TOP[1] = av_clip(mv_table[mot_xy - mot_stride ][1], ymin<<shift, ymax<<shift);
1486 P_TOPRIGHT[0] = av_clip(mv_table[mot_xy - mot_stride + 1 ][0], xmin<<shift, xmax<<shift);
1487 P_TOPRIGHT[1] = av_clip(mv_table[mot_xy - mot_stride + 1 ][1], ymin<<shift, ymax<<shift);
1504 mv_table[mot_xy][0]= mx;
1505 mv_table[mot_xy][1]= my;
1517 int fmin, bmin, dmin, fbmin, bimin, fimin;
1519 const int xy = mb_y*s->
mb_stride + mb_x;
1530 score= ((unsigned)(score*score + 128*256))>>16;
1554 av_dlog(s,
"%d %d %d %d\n", dmin, fmin, bmin, fbmin);
1568 fimin= bimin= INT_MAX;
1595 score= ((unsigned)(score*score + 128*256))>>16;
1606 if(fimin < INT_MAX && bimin < INT_MAX){
1626 int best_score=-10000000;
1629 range=
FFMIN(range, 16);
1631 range=
FFMIN(range, 256);
1633 for(i=0; i<8; i++) score[i]= s->
mb_num*(8-i);
1640 int mx= mv_table[xy][0];
1641 int my= mv_table[xy][1];
1646 if(mx >= range || mx < -range ||
1647 my >= range || my < -range)
1650 for(j=0; j<fcode && j<8; j++){
1660 if(score[i] > best_score){
1661 best_score= score[i];
1675 const int f_code= s->
f_code;
1681 av_assert0(range <= 16 || !s->msmpeg4_version);
1698 for(block=0; block<4; block++){
1699 int off= (block& 1) + (block>>1)*
wrap;
1703 if( mx >=range || mx <-range
1704 || my >=range || my <-range){
1705 s->
mb_type[i] &= ~CANDIDATE_MB_TYPE_INTER4V;
1723 int16_t (*mv_table)[2],
int f_code,
int type,
int truncate)
1726 int y, h_range, v_range;
1734 v_range= field_select_table ? range>>1 : range;
1742 if(field_select_table==NULL || field_select_table[xy] == field_select){
1743 if( mv_table[xy][0] >=h_range || mv_table[xy][0] <-h_range
1744 || mv_table[xy][1] >=v_range || mv_table[xy][1] <-v_range){
1747 if (mv_table[xy][0] > h_range-1) mv_table[xy][0]= h_range-1;
1748 else if(mv_table[xy][0] < -h_range ) mv_table[xy][0]= -h_range;
1749 if (mv_table[xy][1] > v_range-1) mv_table[xy][1]= v_range-1;
1750 else if(mv_table[xy][1] < -v_range ) mv_table[xy][1]= -v_range;
uint8_t * scratchpad
data area for the ME algo, so that the ME does not need to malloc/free
static int minima_cmp(const void *a, const void *b)
static int cmp_qpel(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags)
static unsigned update_map_generation(MotionEstContext *c)
void ff_estimate_b_frame_motion(MpegEncContext *s, int mb_x, int mb_y)
static int shift(int a, int b)
static av_always_inline void mv_scale(Mv *dst, Mv *src, int td, int tb)
static int epzs_motion_search2(MpegEncContext *s, int *mx_ptr, int *my_ptr, int P[10][2], int src_index, int ref_index, int16_t(*last_mv)[2], int ref_mv_scale)
static int check_bidir_mv(MpegEncContext *s, int motion_fx, int motion_fy, int motion_bx, int motion_by, int pred_fx, int pred_fy, int pred_bx, int pred_by, int size, int h)
int skip
set if ME is skipped for the current MB
int16_t(* p_mv_table)[2]
MV table (1MV per MB) p-frame encoding.
static void get_limits(MpegEncContext *s, int x, int y)
get fullpel ME search limits.
uint8_t * fcode_tab
smallest fcode needed for each MV
void ff_estimate_p_frame_motion(MpegEncContext *s, int mb_x, int mb_y)
uint8_t * mb_mean
Table for MB luminance.
op_pixels_func avg_pixels_tab[4][4]
Halfpel motion compensation with rounding (a+b+1)>>1.
static void init_mv4_ref(MotionEstContext *c)
#define CANDIDATE_MB_TYPE_BACKWARD_I
static struct AVHashContext * hash
uint16_t * mb_var
Table for MB variances.
#define CANDIDATE_MB_TYPE_BIDIR
uint8_t * current_mv_penalty
#define CANDIDATE_MB_TYPE_INTRA
int msmpeg4_version
0=not msmpeg4, 1=mp41, 2=mp42, 3=mp43/divx3 4=wmv1/7 5=wmv2/8
int(* me_cmp_func)(void *s, uint8_t *blk1, uint8_t *blk2, int line_size, int h)
enhanced predictive zonal search
static int cmp_simple(MpegEncContext *s, const int x, const int y, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func)
void av_log(void *avcl, int level, const char *fmt,...) av_printf_format(3
Send the specified message to the log if the level is less than or equal to the current av_log_level...
int16_t(*[2][2] p_field_mv_table)[2]
MV table (2MV per MB) interlaced p-frame encoding.
static int bidir_refine(MpegEncContext *s, int mb_x, int mb_y)
av_dlog(ac->avr,"%d samples - audio_convert: %s to %s (%s)\n", len, av_get_sample_fmt_name(ac->in_fmt), av_get_sample_fmt_name(ac->out_fmt), use_generic?ac->func_descr_generic:ac->func_descr)
int mb_num
number of MBs of a picture
int16_t(* b_back_mv_table)[2]
MV table (1MV per MB) backward mode b-frame encoding.
#define CODEC_FLAG_QPEL
Use qpel MC.
int(* pix_sum)(uint8_t *pix, int line_size)
static int cmp_internal(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags)
op_pixels_func(* hpel_put)[4]
enum OutputFormat out_format
output format
int me_range
maximum motion estimation search range in subpel units If 0 then no limit.
static const uint8_t offset[511][2]
static av_cold int end(AVCodecContext *avctx)
int pre_dia_size
ME prepass diamond size & shape.
Motion estimation context.
qpel_mc_func(* qpel_put)[16]
me_cmp_func me_pre_cmp[6]
int no_rounding
apply no rounding to motion compensation (MPEG4, msmpeg4, ...) for b-frames rounding mode is always 0...
int me_cmp
motion estimation comparison function
Picture current_picture
copy of the current picture structure.
int16_t(* b_bidir_forw_mv_table)[2]
MV table (1MV per MB) bidir mode b-frame encoding.
uint8_t(* mv_penalty)[MAX_MV *2+1]
amount of bits needed to encode a MV
static int get_flags(MotionEstContext *c, int direct, int chroma)
void ff_set_cmp(DSPContext *c, me_cmp_func *cmp, int type)
uint16_t pp_time
time distance between the last 2 p,s,i frames
#define CODEC_FLAG_MV0
Always try a MB with MV=<0,0>.
op_pixels_func(* hpel_avg)[4]
int ff_epzs_motion_search(MpegEncContext *s, int *mx_ptr, int *my_ptr, int P[10][2], int src_index, int ref_index, int16_t(*last_mv)[2], int ref_mv_scale, int size, int h)
int mb_height
number of MBs horizontally & vertically
#define CHECK_BIDIR2(a, b, c, d)
qpel_mc_func put_qpel_pixels_tab[2][16]
#define CANDIDATE_MB_TYPE_FORWARD
#define av_builtin_constant_p(x)
no search, that is use 0,0 vector whenever one is needed
#define FF_COMPLIANCE_NORMAL
#define CANDIDATE_MB_TYPE_DIRECT
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
static int ff_h263_round_chroma(int x)
#define CODEC_FLAG_INTERLACED_ME
interlaced motion estimation
static const uint16_t mask[17]
static int epzs_motion_search4(MpegEncContext *s, int *mx_ptr, int *my_ptr, int P[10][2], int src_index, int ref_index, int16_t(*last_mv)[2], int ref_mv_scale)
static int no_sub_motion_search(MpegEncContext *s, int *mx_ptr, int *my_ptr, int dmin, int src_index, int ref_index, int size, int h)
qpel_mc_func avg_qpel_pixels_tab[2][16]
int me_sub_cmp
subpixel motion estimation comparison function
static uint8_t fcode_tab[MAX_MV *2+1]
Minimal fcode that a motion vector component would need.
int unrestricted_mv
mv can point outside of the coded picture
static int get_penalty_factor(int lambda, int lambda2, int type)
static void init_interlaced_ref(MpegEncContext *s, int ref_index)
#define CANDIDATE_MB_TYPE_INTER
int quarter_sample
1->qpel, 0->half pel ME/MC
uint16_t * mb_type
Table for candidate MB types for encoding.
uint8_t *[2][2] b_field_select_table
Libavcodec external API header.
Motion estimation template.
int me_method
ME algorithm.
static int cmp_fpel_internal(MpegEncContext *s, const int x, const int y, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags)
Picture new_picture
copy of the source picture structure for encoding.
static int hpel_motion_search(MpegEncContext *s, int *mx_ptr, int *my_ptr, int dmin, int src_index, int ref_index, int size, int h)
int16_t(*[2] motion_val)[2]
#define CANDIDATE_MB_TYPE_INTER4V
static int interlaced_search(MpegEncContext *s, int ref_index, int16_t(*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)
static av_always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags)
compares a block (either a full macroblock or a partition thereof) against a proposed motion-compensa...
int mb_decision
macroblock decision mode
#define CANDIDATE_MB_TYPE_BACKWARD
#define CANDIDATE_MB_TYPE_SKIPPED
static int get_mb_score(MpegEncContext *s, int mx, int my, int src_index, int ref_index, int size, int h, int add_rate)
preferred ID for MPEG-1/2 video decoding
int block_index[6]
index to current MB in block based arrays with edges
static int qpel_motion_search(MpegEncContext *s, int *mx_ptr, int *my_ptr, int dmin, int src_index, int ref_index, int size, int h)
int penalty_factor
an estimate of the bits required to code a given mv value, e.g.
static int estimate_motion_b(MpegEncContext *s, int mb_x, int mb_y, int16_t(*mv_table)[2], int ref_index, int f_code)
#define HASH8(fx, fy, bx, by)
#define MV_TYPE_16X16
1 vector for the whole mb
int first_slice_line
used in mpeg4 too to handle resync markers
uint16_t * mc_mb_var
Table for motion compensated MB variances.
#define AV_LOG_INFO
Standard information.
unsigned int lambda2
(lambda*lambda) >> FF_LAMBDA_SHIFT
ptrdiff_t linesize
line size, in bytes, may be different from width
static av_const unsigned int ff_sqrt(unsigned int a)
#define CHECK_SAD_HALF_MV(suffix, x, y)
int height
picture size. must be a multiple of 16
op_pixels_func put_pixels_tab[4][4]
Halfpel motion compensation with rounding (a+b+1)>>1.
static int direct_search(MpegEncContext *s, int mb_x, int mb_y)
void ff_fix_long_p_mvs(MpegEncContext *s)
op_pixels_func put_no_rnd_pixels_tab[4][4]
Halfpel motion compensation with no rounding (a+b)>>1.
int16_t(*[2][2][2] b_field_mv_table)[2]
MV table (4MV per MB) interlaced b-frame encoding.
static av_always_inline int cmp_direct_inline(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, int qpel)
ptrdiff_t uvlinesize
line size, for chroma in bytes, may be different from width
DSPContext dsp
pointers for accelerated dsp functions
int(* pix_norm1)(uint8_t *pix, int line_size)
int f_code
forward MV resolution
int ff_pre_estimate_p_frame_motion(MpegEncContext *s, int mb_x, int mb_y)
#define CANDIDATE_MB_TYPE_BIDIR_I
int pict_type
AV_PICTURE_TYPE_I, AV_PICTURE_TYPE_P, AV_PICTURE_TYPE_B, ...
static void set_p_mv_tables(MpegEncContext *s, int mx, int my, int mv4)
#define av_assert1(cond)
assert() equivalent, that does not lie in speed critical code.
#define CANDIDATE_MB_TYPE_FORWARD_I
static int sad_hpel_motion_search(MpegEncContext *s, int *mx_ptr, int *my_ptr, int dmin, int src_index, int ref_index, int size, int h)
int16_t(* b_bidir_back_mv_table)[2]
MV table (1MV per MB) bidir mode b-frame encoding.
int ff_init_me(MpegEncContext *s)
uint8_t *[2] p_field_select_table
int16_t(* b_direct_mv_table)[2]
MV table (1MV per MB) direct mode b-frame encoding.
qpel_mc_func(* qpel_avg)[16]
int16_t(* b_forw_mv_table)[2]
MV table (1MV per MB) forward mode b-frame encoding.
static void zero_hpel(uint8_t *a, const uint8_t *b, ptrdiff_t stride, int h)
int b8_stride
2*mb_width+1 used for some 8x8 block arrays to allow simple addressing
struct AVCodecContext * avctx
static uint8_t mv_penalty[MAX_FCODE+1][MAX_MV *2+1]
Table of number of bits a motion vector component needs.
int mb_cmp
macroblock comparison function (not supported yet)
int direct_basis_mv[4][2]
int mb_stride
mb_width+1 used for some arrays to allow simple addressing of left & top MBs without sig11 ...
#define FF_MB_DECISION_SIMPLE
uses mb_cmp
Picture last_picture
copy of the previous picture structure.
int co_located_mv[4][2]
mv from last P-frame for direct mode ME
uint32_t * map
map to avoid duplicate evaluations
static int h263_mv4_search(MpegEncContext *s, int mx, int my, int shift)
#define CANDIDATE_MB_TYPE_DIRECT0
int dia_size
ME diamond size & shape.
static void init_ref(MotionEstContext *c, uint8_t *src[3], uint8_t *ref[3], uint8_t *ref2[3], int x, int y, int ref_index)
static int cmp_hpel(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags)
int ff_get_best_fcode(MpegEncContext *s, int16_t(*mv_table)[2], int type)
static int zero_cmp(void *s, uint8_t *a, uint8_t *b, int stride, int h)
Picture next_picture
copy of the next picture structure.
void ff_fix_long_mvs(MpegEncContext *s, uint8_t *field_select_table, int field_select, int16_t(*mv_table)[2], int f_code, int type, int truncate)
int flags
AVCodecContext.flags (HQ, MV4, ...)
qpel_mc_func put_no_rnd_qpel_pixels_tab[2][16]
#define av_assert0(cond)
assert() equivalent, that is always enabled.
static av_always_inline int cmp_inline(MpegEncContext *s, const int x, const int y, const int subx, const int suby, const int size, const int h, int ref_index, int src_index, me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, int qpel, int chroma)
me_cmp_func me_sub_cmp[6]
#define MV_TYPE_8X8
4 vectors (h263, mpeg4 4MV)
int b_code
backward MV resolution for B Frames (mpeg4)
#define CODEC_FLAG_4MV
4 MV per MB allowed / advanced prediction for H.263.
int me_pre_cmp
motion estimation prepass comparison function
int(* sub_motion_search)(struct MpegEncContext *s, int *mx_ptr, int *my_ptr, int dmin, int src_index, int ref_index, int size, int h)
int strict_std_compliance
strictly follow the standard (MPEG4, ...).
uint8_t * data[AV_NUM_DATA_POINTERS]
pointer to the picture/channel planes.
#define CANDIDATE_MB_TYPE_INTER_I
unsigned int lambda
lagrange multipler used in rate distortion
#define HASH(fx, fy, bx, by)
uint16_t pb_time
time distance between the last b and p,s,i frame
#define av_assert2(cond)
assert() equivalent, that does lie in speed critical code.