1 /*
2 * Motion estimation
3 * Copyright (c) 2000,2001 Fabrice Bellard
4 * Copyright (c) 2002-2004 Michael Niedermayer
5 *
6 * new motion estimation (X1/EPZS) by Michael Niedermayer <michaelni@gmx.at>
7 *
8 * This file is part of FFmpeg.
9 *
10 * FFmpeg is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public
12 * License as published by the Free Software Foundation; either
13 * version 2.1 of the License, or (at your option) any later version.
14 *
15 * FFmpeg is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Lesser General Public License for more details.
19 *
20 * You should have received a copy of the GNU Lesser General Public
21 * License along with FFmpeg; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
23 */
24
25 /**
26 * @file
27 * Motion estimation.
28 */
29
30 #include <stdlib.h>
31 #include <stdio.h>
33
38
41 #define P_TOPRIGHT P[3]
44
45 #define ME_MAP_SHIFT 3
46 #define ME_MAP_MV_BITS 11
47
49 int *mx_ptr, int *my_ptr, int dmin,
50 int src_index, int ref_index,
52
54 {
59 }
61 }
62
63 /* shape adaptive search stuff */
69
73
75 }
76
77 #define FLAG_QPEL 1 //must be 1
80
86 };
87 int i;
88 for(i=0; i<3; i++){
89 c->
src[0][i]= src [i] + offset[i];
90 c->
ref[0][i]= ref [i] + offset[i];
91 }
92 if(ref_index){
93 for(i=0; i<3; i++){
94 c->
ref[ref_index][i]= ref2[i] + offset[i];
95 }
96 }
97 }
98
103 }
104
106 const int size,
const int h,
int ref_index,
int src_index,
110 const int hx= subx + (x<<(1+qpel));
111 const int hy= suby + (y<<(1+qpel));
112 uint8_t *
const *
const ref= c->
ref[ref_index];
114 int d;
115 //FIXME check chroma 4mv, (no crashes ...)
116 av_assert2(x >= c->
xmin && hx <= c->xmax<<(qpel+1) && y >= c->
ymin && hy <= c->ymax<<(qpel+1));
117 if(x >= c->
xmin && hx <= c->xmax<<(qpel+1) && y >= c->
ymin && hy <= c->ymax<<(qpel+1)){
120 const int mask= 2*qpel+1;
122 int i;
123 for(i=0; i<4; i++){
128 int fxy= (fx&
mask) + ((fy&mask)<<(qpel+1));
129 int bxy= (bx&
mask) + ((by&mask)<<(qpel+1));
130
132 if(qpel){
133 c->
qpel_put[1][fxy](dst, ref[0] + (fx>>2) + (fy>>2)*stride, stride);
134 c->
qpel_avg[1][bxy](dst, ref[8] + (bx>>2) + (by>>2)*stride, stride);
135 }else{
136 c->
hpel_put[1][fxy](dst, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 8);
137 c->
hpel_avg[1][bxy](dst, ref[8] + (bx>>1) + (by>>1)*stride, stride, 8);
138 }
139 }
140 }else{
145 int fxy= (fx&
mask) + ((fy&mask)<<(qpel+1));
146 int bxy= (bx&
mask) + ((by&mask)<<(qpel+1));
147
148 if(qpel){
149 c->
qpel_put[1][fxy](c->
temp , ref[0] + (fx>>2) + (fy>>2)*stride , stride);
150 c->
qpel_put[1][fxy](c->
temp + 8 , ref[0] + (fx>>2) + (fy>>2)*stride + 8 , stride);
151 c->
qpel_put[1][fxy](c->
temp + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8*stride, stride);
152 c->
qpel_put[1][fxy](c->
temp + 8 + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8 + 8*stride, stride);
153 c->
qpel_avg[1][bxy](c->
temp , ref[8] + (bx>>2) + (by>>2)*stride , stride);
154 c->
qpel_avg[1][bxy](c->
temp + 8 , ref[8] + (bx>>2) + (by>>2)*stride + 8 , stride);
155 c->
qpel_avg[1][bxy](c->
temp + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8*stride, stride);
156 c->
qpel_avg[1][bxy](c->
temp + 8 + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8 + 8*stride, stride);
157 }else{
166
167 c->
hpel_put[0][fxy](c->
temp, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 16);
168 c->
hpel_avg[0][bxy](c->
temp, ref[8] + (bx>>1) + (by>>1)*stride, stride, 16);
169 }
170 }
172 }else
173 d= 256*256*256*32;
174 return d;
175 }
176
178 const int size,
const int h,
int ref_index,
int src_index,
183 const int dxy= subx + (suby<<(1+qpel)); //FIXME log2_subpel?
184 const int hx= subx + (x<<(1+qpel));
185 const int hy= suby + (y<<(1+qpel));
186 uint8_t *
const *
const ref= c->
ref[ref_index];
188 int d;
189 //FIXME check chroma 4mv, (no crashes ...)
190 int uvdxy; /* no, it might not be used uninitialized */
191 if(dxy){
192 if(qpel){
193 if (h << size == 16) {
194 c->
qpel_put[
size][dxy](c->
temp, ref[0] + x + y*stride, stride);
//FIXME prototype (add h)
195 } else if (size == 0 && h == 8) {
196 c->
qpel_put[1][dxy](c->
temp , ref[0] + x + y*stride , stride);
197 c->
qpel_put[1][dxy](c->
temp + 8, ref[0] + x + y*stride + 8, stride);
198 } else
200 if(chroma){
201 int cx= hx/2;
202 int cy= hy/2;
203 cx= (cx>>1)|(cx&1);
204 cy= (cy>>1)|(cy&1);
205 uvdxy= (cx&1) + 2*(cy&1);
206 //FIXME x/y wrong, but mpeg4 qpel is sick anyway, we should drop as much of it as possible in favor for h264
207 }
208 }else{
210 if(chroma)
211 uvdxy= dxy | (x&1) | (2*(y&1));
212 }
214 }else{
215 d =
cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);
216 if(chroma)
217 uvdxy= (x&1) + 2*(y&1);
218 }
219 if(chroma){
221 c->
hpel_put[size+1][uvdxy](uvtemp , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
222 c->
hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
223 d += chroma_cmp_func(s, uvtemp , src[1], uvstride, h>>1);
224 d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);
225 }
226 return d;
227 }
228
230 int ref_index, int src_index,
232 return cmp_inline(s,x,y,0,0,0,16,ref_index,src_index, cmp_func, chroma_cmp_func, 0, 0);
233 }
234
236 const int size,
const int h,
int ref_index,
int src_index,
239 return cmp_direct_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL);
240 }else{
241 return cmp_inline(s,x,y,0,0,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&
FLAG_CHROMA);
242 }
243 }
244
246 const int size,
const int h,
int ref_index,
int src_index,
249 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags&
FLAG_QPEL);
250 }else{
251 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 }
253 }
254
255 /** @brief compares a block (either a full macroblock or a partition thereof)
256 against a proposed motion-compensated prediction of that block
257 */
259 const int size,
const int h,
int ref_index,
int src_index,
263 && flags==0 && h==16 && size==0 && subx==0 && suby==0){
264 return cmp_simple(s,x,y,ref_index,src_index, cmp_func, chroma_cmp_func);
266 && subx==0 && suby==0){
267 return cmp_fpel_internal(s,x,y,size,h,ref_index,src_index, cmp_func, chroma_cmp_func,flags);
268 }else{
269 return cmp_internal(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, flags);
270 }
271 }
272
274 const int size,
const int h,
int ref_index,
int src_index,
277 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0);
278 }else{
279 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 0, flags&
FLAG_CHROMA);
280 }
281 }
282
284 const int size,
const int h,
int ref_index,
int src_index,
287 return cmp_direct_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1);
288 }else{
289 return cmp_inline(s,x,y,subx,suby,size,h,ref_index,src_index, cmp_func, chroma_cmp_func, 1, flags&
FLAG_CHROMA);
290 }
291 }
292
294
297 {
298 return 0;
299 }
300
302 }
303
308
311 return -1;
312 }
313 //special case of snow is needed because snow uses its own iterative ME code
315 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");
316 return -1;
317 }
318
320
323
324 if(cache_size < 2*dia_size && !c->
stride){
326 }
327
332
336
337 /*FIXME s->no_rounding b_type*/
343 else
345 }else{
352 else
354 }
358 else
360
364 }else{
367 }
368
369 /* 8x8 fullpel search would need a 4x4 chroma compare, which we do
370 * not have yet, and even if we had, the motion estimation code
371 * does not expect it. */
379 }
380
383 }
384
385 return 0;
386 }
387
388 #define CHECK_SAD_HALF_MV(suffix, x, y) \
389 {\
390 d = s->mecc.pix_abs[size][(x ? 1 : 0) + (y ? 2 : 0)](NULL, pix, ptr + ((x) >> 1), stride, h); \
391 d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\
392 COPY3_IF_LT(dminh, d, dx, x, dy, y)\
393 }
394
396 int *mx_ptr, int *my_ptr, int dmin,
397 int src_index, int ref_index,
399 {
402 int mx, my, dminh;
406
408
410 *mx_ptr = 0;
411 *my_ptr = 0;
412 return dmin;
413 }
414
415 pix = c->
src[src_index][0];
416
417 mx = *mx_ptr;
418 my = *my_ptr;
419 ptr = c->
ref[ref_index][0] + (my * stride) + mx;
420
421 dminh = dmin;
422
423 if (mx > xmin && mx < xmax &&
424 my > ymin && my < ymax) {
425 int dx=0, dy=0;
426 int d, pen_x, pen_y;
429 const int l= score_map[(index- 1 )&(
ME_MAP_SIZE-1)];
432 mx<<=1;
433 my<<=1;
434
435
436 pen_x= pred_x + mx;
437 pen_y= pred_y + my;
438
439 ptr-= stride;
440 if(t<=b){
442 if(l<=r){
444 if(t+r<=b+l){
446 ptr+= stride;
447 }else{
448 ptr+= stride;
450 }
452 }else{
454 if(t+l<=b+r){
456 ptr+= stride;
457 }else{
458 ptr+= stride;
460 }
462 }
463 }else{
464 if(l<=r){
465 if(t+l<=b+r){
467 ptr+= stride;
468 }else{
469 ptr+= stride;
471 }
474 }else{
475 if(t+r<=b+l){
477 ptr+= stride;
478 }else{
479 ptr+= stride;
481 }
484 }
486 }
487 mx+=dx;
488 my+=dy;
489
490 }else{
491 mx<<=1;
492 my<<=1;
493 }
494
495 *mx_ptr = mx;
496 *my_ptr = my;
497 return dminh;
498 }
499
501 {
503
506
507 /* has already been set to the 4 MV if 4MV is done */
508 if(mv4){
510
515
521 }
522 }
523
524 /**
525 * get fullpel ME search limits.
526 */
528 {
532 /*
533 if(c->avctx->me_range) c->range= c->avctx->me_range >> 1;
534 else c->range= 16;
535 */
542 // Search range of H261 is different from other codec standards
543 c->
xmin = (x > 15) ? - 15 : 0;
544 c->
ymin = (y > 15) ? - 15 : 0;
547 } else {
552 }
553 if(!range || range > max_range)
554 range = max_range;
555 if(range){
560 }
561 }
562
565
566 c->
ref[1][0] = c->
ref[0][0] + 8;
567 c->
ref[2][0] = c->
ref[0][0] + 8*stride;
568 c->
ref[3][0] = c->
ref[2][0] + 8;
569 c->
src[1][0] = c->
src[0][0] + 8;
570 c->
src[2][0] = c->
src[0][0] + 8*stride;
571 c->
src[3][0] = c->
src[2][0] + 8;
572 }
573
575 {
578 const int h=8;
581 int dmin_sum=0, mx4_sum=0, my4_sum=0, i;
582 int same=1;
586
588
589 for(block=0; block<4; block++){
590 int mx4, my4;
591 int pred_x4, pred_y4;
592 int dmin4;
593 static const int off[4]= {2, 1, 1, -1};
596
597 if(saftey_cliping){
600 }
601
604
606
607 /* special case for first line */
611 } else {
620
623
626 }
629 if(saftey_cliping)
630 for(i=1; i<10; i++){
632 continue;
633 if (i>4 && i<9)
634 continue;
636 if(P[i][1] > (c->
ymax<<shift)) P[i][1]= (c->
ymax<<shift);
637 }
638
640
642
644 int dxy;
645 const int offset= ((block&1) + (block>>1)*stride)*8;
649 dxy = ((my4 & 3) << 2) | (mx4 & 3);
650
653 else
655 }else{
657 dxy = ((my4 & 1) << 1) | (mx4 & 1);
658
661 else
663 }
664 dmin_sum+= (mv_penalty[mx4-pred_x4] + mv_penalty[my4-pred_y4])*c->
mb_penalty_factor;
665 }else
666 dmin_sum+= dmin4;
667
669 mx4_sum+= mx4/2;
670 my4_sum+= my4/2;
671 }else{
672 mx4_sum+= mx4;
673 my4_sum+= my4;
674 }
675
678
679 if(mx4 != mx || my4 != my) same=0;
680 }
681
682 if(same)
683 return INT_MAX;
684
688 s->
mb_x * 16 + s->
mb_y * 16 * stride,
690 }
691
693 int dxy;
694 int mx, my;
696
699 dxy = ((my & 1) << 1) | (mx & 1);
700
702
706 }else{
709 }
710
713 }
714
717
719 /*case FF_CMP_SSE:
720 return dmin_sum+ 32*s->qscale*s->qscale;*/
722 return dmin_sum;
723 default:
725 }
726 }
727
730
738 }
739 }
740
742 int16_t (*mv_tables[2][2])[2],
uint8_t *field_select_tables[2],
int mx,
int my,
int user_field_select)
743 {
746 const int h=8;
750 int same=1;
752 int dmin_sum= 0;
754 const int xy= s->
mb_x + s->
mb_y*mot_stride;
755
761
762 for(block=0; block<2; block++){
763 int field_select;
764 int best_dmin= INT_MAX;
765 int best_field= -1;
766
767 for(field_select=0; field_select<2; field_select++){
768 int dmin, mx_i, my_i;
769 int16_t (*mv_table)[2]= mv_tables[
block][field_select];
770
771 if(user_field_select){
772 av_assert1(field_select==0 || field_select==1);
773 av_assert1(field_select_tables[block][xy]==0 || field_select_tables[block][xy]==1);
774 if(field_select_tables[block][xy] != field_select)
775 continue;
776 }
777
778 P_LEFT[0] = mv_table[xy - 1][0];
779 P_LEFT[1] = mv_table[xy - 1][1];
781
784
786 P_TOP[0] = mv_table[xy - mot_stride][0];
787 P_TOP[1] = mv_table[xy - mot_stride][1];
788 P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];
789 P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];
794
797 }
798 P_MV1[0]= mx;
//FIXME not correct if block != field_select
800
801 dmin =
epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);
802
803 dmin= c->
sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);
804
805 mv_table[xy][0]= mx_i;
806 mv_table[xy][1]= my_i;
807
809 int dxy;
810
811 //FIXME chroma ME
812 uint8_t *ref= c->
ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*stride;
813 dxy = ((my_i & 1) << 1) | (mx_i & 1);
814
817 }else{
819 }
822 }else
824
825 dmin += field_select !=
block;
//slightly prefer same field
826
827 if(dmin < best_dmin){
828 best_dmin= dmin;
829 best_field= field_select;
830 }
831 }
832 {
833 int16_t (*mv_table)[2]= mv_tables[
block][best_field];
834
835 if(mv_table[xy][0] != mx) same=0; //FIXME check if these checks work and are any good at all
836 if(mv_table[xy][1]&1) same=0;
837 if(mv_table[xy][1]*2 != my) same=0;
838 if(best_field != block) same=0;
839 }
840
841 field_select_tables[
block][xy]= best_field;
842 dmin_sum += best_dmin;
843 }
844
849
850 if(same)
851 return INT_MAX;
852
854 /*case FF_CMP_SSE:
855 return dmin_sum+ 32*s->qscale*s->qscale;*/
857 return dmin_sum;
858 default:
860 }
861 }
862
864 switch(type&0xFF){
865 default:
869 return (3*lambda)>>(FF_LAMBDA_SHIFT+1);
883 return 1;
884 }
885 }
886
888 int mb_x, int mb_y)
889 {
892 int sum, mx, my, dmin;
893 int varc; ///< the variance of the block (sum of squared (p[y][x]-average))
894 int vard; ///< sum of squared differences with the estimated motion vector
897 int mb_type=0;
899
901
905
910
913
914 /* intra / predictive decision */
918 (((unsigned) sum * sum) >> 8) + 500;
919
923
926 default:
927 mx = 0;
928 my = 0;
929 dmin = 0;
930 break;
933 {
936
939
941
950
953
957 }else { /* mpeg1 at least */
960 }
961 }else{
964 }
965
966 }
968
969 break;
970 }
971
972 /* At this point (mx,my) are full-pell and the relative displacement */
974
976
979
984
985 if (vard*2 + 200*256 > varc)
987 if (varc*2 + 200*256 > vard || s->
qscale > 24){
988 // if (varc*2 + 200*256 + 50*(s->lambda2>>FF_LAMBDA_SHIFT) > vard){
992 if(mx || my)
994 }else{
997 }
999 && !c->
skip && varc>50<<8 && vard>10<<8){
1002
1004 }else
1007 && !c->
skip){
//FIXME varc/d checks
1010 }
1011 }else{
1012 int intra_score, i;
1014
1018
1020 && !c->
skip && varc>50<<8 && vard>10<<8){
1022 if(dmin4 < dmin){
1024 dmin=dmin4;
1025 }
1026 }
1028 && !c->
skip){
//FIXME varc/d checks
1030 if(dmin_i < dmin){
1032 dmin= dmin_i;
1033 }
1034 }
1035
1037
1038 /* get intra luma score */
1040 intra_score= varc - 500;
1041 }else{
1042 unsigned mean = (sum+128)>>8;
1043 mean*= 0x01010101;
1044
1045 for(i=0; i<16; i++){
1050 }
1051
1053 }
1055
1056 if(intra_score < dmin){
1059 }else
1061
1062 {
1066 }
1067 }
1068
1070 }
1071
1073 int mb_x, int mb_y)
1074 {
1076 int mx, my, dmin;
1081
1083
1086
1089
1092
1094
1095 /* special case for first line */
1101 } else {
1109
1112
1115 }
1116
1118
1121
1122 return dmin;
1123 }
1124
1126 int16_t (*mv_table)[2], int ref_index, int f_code)
1127 {
1129 int mx, my, dmin;
1133 const int mot_xy = mb_y*mot_stride + mb_x;
1136
1141
1143
1146 default:
1147 mx = 0;
1148 my = 0;
1149 dmin = 0;
1150 break;
1153 P_LEFT[0] = mv_table[mot_xy - 1][0];
1154 P_LEFT[1] = mv_table[mot_xy - 1][1];
1155
1157
1158 /* special case for first line */
1160 P_TOP[0] = mv_table[mot_xy - mot_stride ][0];
1161 P_TOP[1] = mv_table[mot_xy - mot_stride ][1];
1162 P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1][0];
1163 P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1][1];
1167
1170 }
1173
1176 }else{
1178 }
1179
1181
1182 break;
1183 }
1184
1186
1189
1190 // s->mb_type[mb_y*s->mb_width + mb_x]= mb_type;
1191 mv_table[mot_xy][0]= mx;
1192 mv_table[mot_xy][1]= my;
1193
1194 return dmin;
1195 }
1196
1198 int motion_fx, int motion_fy,
1199 int motion_bx, int motion_by,
1200 int pred_fx, int pred_fy,
1201 int pred_bx, int pred_by,
1203 {
1204 //FIXME optimize?
1205 //FIXME better f_code prediction (max mv & distance)
1206 //FIXME pointers
1213 int dxy;
1214 int src_x, src_y;
1215 int fbmin;
1219
1221 dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);
1222 src_x = motion_fx >> 2;
1223 src_y = motion_fy >> 2;
1224
1225 ptr = ref_data[0] + (src_y * stride) + src_x;
1227
1228 dxy = ((motion_by & 3) << 2) | (motion_bx & 3);
1229 src_x = motion_bx >> 2;
1230 src_y = motion_by >> 2;
1231
1232 ptr = ref2_data[0] + (src_y * stride) + src_x;
1234 }else{
1235 dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);
1236 src_x = motion_fx >> 1;
1237 src_y = motion_fy >> 1;
1238
1239 ptr = ref_data[0] + (src_y * stride) + src_x;
1241
1242 dxy = ((motion_by & 1) << 1) | (motion_bx & 1);
1243 src_x = motion_bx >> 1;
1244 src_y = motion_by >> 1;
1245
1246 ptr = ref2_data[0] + (src_y * stride) + src_x;
1248 }
1249
1250 fbmin = (mv_penalty_f[motion_fx-pred_fx] + mv_penalty_f[motion_fy-pred_fy])*c->
mb_penalty_factor
1251 +(mv_penalty_b[motion_bx-pred_bx] + mv_penalty_b[motion_by-pred_by])*c->
mb_penalty_factor
1252 + s->
mecc.
mb_cmp[
size](
s, src_data[0], dest_y, stride, h);
// FIXME new_pic
1253
1255 }
1256 //FIXME CHROMA !!!
1257
1258 return fbmin;
1259 }
1260
1261 /* refine the bidir vectors in hq mode and return the score in both lq & hq mode*/
1263 {
1266 const int xy = mb_y *mot_stride + mb_x;
1267 int fbmin;
1278 const int shift= 1+qpel;
1283 #define HASH(fx,fy,bx,by) ((fx)+17*(fy)+63*(bx)+117*(by))
1284 #define HASH8(fx,fy,bx,by) ((uint8_t)HASH(fx,fy,bx,by))
1285 int hashidx=
HASH(motion_fx,motion_fy, motion_bx, motion_by);
1287
1288 map[hashidx&255] = 1;
1289
1291 motion_bx, motion_by,
1292 pred_fx, pred_fy,
1293 pred_bx, pred_by,
1294 0, 16);
1295
1298 static const uint8_t limittab[5]={0,8,32,64,80};
1300 static const int8_t vect[][4]={
1301 { 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},
1302
1303 { 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},
1304 { 0, 1, 0, 1}, { 0,-1, 0,-1}, { 1, 0, 1, 0}, {-1, 0,-1, 0},
1305 { 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},
1306 { 0,-1, 0, 1}, { 0, 1, 0,-1}, {-1, 0, 1, 0}, { 1, 0,-1, 0},
1307
1308 { 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},
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
1313 { 1, 1, 1, 1}, {-1,-1,-1,-1},
1314 { 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},
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},
1316 };
1318 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),
1319
1320 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),
1321 HASH8( 0, 1, 0, 1),
HASH8( 0,-1, 0,-1),
HASH8( 1, 0, 1, 0),
HASH8(-1, 0,-1, 0),
1322 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),
1323 HASH8( 0,-1, 0, 1),
HASH8( 0, 1, 0,-1),
HASH8(-1, 0, 1, 0),
HASH8( 1, 0,-1, 0),
1324
1325 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),
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
1331 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),
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),
1333 };
1334
1335 #define CHECK_BIDIR(fx,fy,bx,by)\
1336 if( !map[(hashidx+HASH(fx,fy,bx,by))&255]\
1337 &&(fx<=0 || motion_fx+fx<=xmax) && (fy<=0 || motion_fy+fy<=ymax) && (bx<=0 || motion_bx+bx<=xmax) && (by<=0 || motion_by+by<=ymax)\
1338 &&(fx>=0 || motion_fx+fx>=xmin) && (fy>=0 || motion_fy+fy>=ymin) && (bx>=0 || motion_bx+bx>=xmin) && (by>=0 || motion_by+by>=ymin)){\
1339 int score;\
1340 map[(hashidx+HASH(fx,fy,bx,by))&255] = 1;\
1341 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);\
1342 if(score < fbmin){\
1343 hashidx += HASH(fx,fy,bx,by);\
1344 fbmin= score;\
1345 motion_fx+=fx;\
1346 motion_fy+=fy;\
1347 motion_bx+=bx;\
1348 motion_by+=by;\
1349 end=0;\
1350 }\
1351 }
1352 #define CHECK_BIDIR2(a,b,c,d)\
1353 CHECK_BIDIR(a,b,c,d)\
1354 CHECK_BIDIR(-(a),-(b),-(c),-(d))
1355
1356 do{
1357 int i;
1358 int borderdist=0;
1359 end=1;
1360
1365
1366 for(i=8; i<limit; i++){
1367 int fx= motion_fx+vect[i][0];
1368 int fy= motion_fy+vect[i][1];
1369 int bx= motion_bx+vect[i][2];
1370 int by= motion_by+vect[i][3];
1371 if(borderdist<=0){
1372 int a= (xmax -
FFMAX(fx,bx))|(
FFMIN(fx,bx) - xmin);
1373 int b= (ymax -
FFMAX(fy,by))|(
FFMIN(fy,by) - ymin);
1374 if((a|b) < 0)
1375 map[(hashidx+hash[i])&255] = 1;
1376 }
1377 if(!map[(hashidx+hash[i])&255]){
1378 int score;
1379 map[(hashidx+hash[i])&255] = 1;
1380 score=
check_bidir_mv(s, fx, fy, bx, by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);
1381 if(score < fbmin){
1382 hashidx += hash[i];
1383 fbmin= score;
1384 motion_fx=fx;
1385 motion_fy=fy;
1386 motion_bx=bx;
1387 motion_by=by;
1388 end=0;
1389 borderdist--;
1390 if(borderdist<=0){
1393 borderdist=
FFMIN(a,b);
1394 }
1395 }
1396 }
1397 }
1398 }while(!end);
1399 }
1400
1405
1406 return fbmin;
1407 }
1408
1410 {
1414 const int mot_xy = mb_y*mot_stride + mb_x;
1416 int dmin, i;
1417 const int time_pp= s->
pp_time;
1418 const int time_pb= s->
pb_time;
1419 int mx, my, xmin, xmax, ymin, ymax;
1421
1423 ymin= xmin=(-32)>>shift;
1424 ymax= xmax= 31>>
shift;
1425
1428 }else{
1430 }
1431
1432 for(i=0; i<4; i++){
1435
1440 // c->direct_basis_mv[1][i][0]= c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(shift+3);
1441 // c->direct_basis_mv[1][i][1]= c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(shift+3);
1442
1445 max+= 16*mb_x + 1; // +-1 is for the simpler rounding
1446 min+= 16*mb_x - 1;
1448 xmin=
FFMAX(xmin, - 16 - min);
1449
1452 max+= 16*mb_y + 1; // +-1 is for the simpler rounding
1453 min+= 16*mb_y - 1;
1455 ymin=
FFMAX(ymin, - 16 - min);
1456
1458 }
1459
1460 av_assert2(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);
1461
1462 if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){
1465
1466 return 256*256*256*64;
1467 }
1468
1477
1478 P_LEFT[0] = av_clip(mv_table[mot_xy - 1][0], xmin<<shift, xmax<<shift);
1479 P_LEFT[1] = av_clip(mv_table[mot_xy - 1][1], ymin<<shift, ymax<<shift);
1480
1481 /* special case for first line */
1482 if (!s->
first_slice_line) {
//FIXME maybe allow this over thread boundary as it is clipped
1483 P_TOP[0] = av_clip(mv_table[mot_xy - mot_stride ][0], xmin<<shift, xmax<<shift);
1484 P_TOP[1] = av_clip(mv_table[mot_xy - mot_stride ][1], ymin<<shift, ymax<<shift);
1485 P_TOPRIGHT[0] = av_clip(mv_table[mot_xy - mot_stride + 1 ][0], xmin<<shift, xmax<<shift);
1486 P_TOPRIGHT[1] = av_clip(mv_table[mot_xy - mot_stride + 1 ][1], ymin<<shift, ymax<<shift);
1487
1490 }
1491
1495 else
1497
1500
1501 get_limits(s, 16*mb_x, 16*mb_y);
//restore c->?min/max, maybe not needed
1502
1503 mv_table[mot_xy][0]= mx;
1504 mv_table[mot_xy][1]= my;
1507
1508 return dmin;
1509 }
1510
1512 int mb_x, int mb_y)
1513 {
1516 int fmin, bmin, dmin, fbmin, bimin, fimin;
1518 const int xy = mb_y*s->
mb_stride + mb_x;
1521
1523
1525
1527 int score=
direct_search(s, mb_x, mb_y);
//FIXME just check 0,0
1528
1529 score= ((unsigned)(score*score + 128*256))>>16;
1533
1534 return;
1535 }
1536
1539 else
1540 dmin= INT_MAX;
1541 //FIXME penalty stuff for non mpeg4
1544 3 * penalty_factor;
1545
1548 2 * penalty_factor;
1550
1553 av_dlog(s,
"%d %d %d %d\n", dmin, fmin, bmin, fbmin);
1554
1556 //FIXME mb type penalty
1566 }else
1567 fimin= bimin= INT_MAX;
1568
1569 {
1570 int score= fmin;
1572
1573 if (dmin <= score){
1574 score = dmin;
1576 }
1577 if(bmin<score){
1578 score=bmin;
1580 }
1581 if(fbmin<score){
1582 score=fbmin;
1584 }
1585 if(fimin<score){
1586 score=fimin;
1588 }
1589 if(bimin<score){
1590 score=bimin;
1592 }
1593
1594 score= ((unsigned)(score*score + 128*256))>>16;
1597 }
1598
1601 if(fimin < INT_MAX)
1603 if(bimin < INT_MAX)
1605 if(fimin < INT_MAX && bimin < INT_MAX){
1607 }
1608 //FIXME something smarter
1613 }
1614
1616 }
1617
1618 /* find best f_code for ME which do unlimited searches */
1620 {
1622 int score[8];
1625 int best_fcode=-1;
1626 int best_score=-10000000;
1627
1629 range=
FFMIN(range, 16);
1631 range=
FFMIN(range, 256);
1632
1633 for(i=0; i<8; i++) score[i]= s->
mb_num*(8-i);
1634
1636 int x;
1640 int mx= mv_table[xy][0];
1641 int my= mv_table[xy][1];
1644 int j;
1645
1646 if(mx >= range || mx < -range ||
1647 my >= range || my < -range)
1648 continue;
1649
1650 for(j=0; j<fcode && j<8; j++){
1652 score[j]-= 170;
1653 }
1654 }
1655 xy++;
1656 }
1657 }
1658
1659 for(i=1; i<8; i++){
1660 if(score[i] > best_score){
1661 best_score= score[i];
1662 best_fcode= i;
1663 }
1664 }
1665
1666 return best_fcode;
1667 }else{
1668 return 1;
1669 }
1670 }
1671
1673 {
1675 const int f_code= s->
f_code;
1678
1680
1681 av_assert0(range <= 16 || !s->msmpeg4_version);
1683
1685
1688
1689 /* clip / convert to intra 8x8 type MVs */
1693 int x;
1694
1698 for(block=0; block<4; block++){
1699 int off= (block& 1) + (block>>1)*
wrap;
1702
1703 if( mx >=range || mx <-range
1704 || my >=range || my <-range){
1705 s->
mb_type[i] &= ~CANDIDATE_MB_TYPE_INTER4V;
1708 }
1709 }
1710 }
1711 xy+=2;
1712 i++;
1713 }
1714 }
1715 }
1716 }
1717
1718 /**
1719 *
1720 * @param truncate 1 for truncation, 0 for using intra
1721 */
1723 int16_t (*mv_table)[2],
int f_code,
int type,
int truncate)
1724 {
1726 int y, h_range, v_range;
1727
1728 // RAL: 8 in MPEG-1, 16 in MPEG-4
1730
1732
1733 h_range= range;
1734 v_range= field_select_table ? range>>1 : range;
1735
1736 /* clip / convert to intra 16x16 type MVs */
1738 int x;
1741 if (s->
mb_type[xy] & type){
// RAL: "type" test added...
1742 if (!field_select_table || 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){
1745
1746 if(truncate){
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;
1751 }else{
1754 mv_table[xy][0]=
1755 mv_table[xy][1]= 0;
1756 }
1757 }
1758 }
1759 }
1760 xy++;
1761 }
1762 }
1763 }