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
39
42 #define P_TOPRIGHT P[3]
45
46 #define ME_MAP_SHIFT 3
47 #define ME_MAP_MV_BITS 11
48
50 int *mx_ptr, int *my_ptr, int dmin,
51 int src_index, int ref_index,
53
55 {
57 if(
c->map_generation==0){
60 }
61 return c->map_generation;
62 }
63
64 /* shape adaptive search stuff */
70
74
76 }
77
78 #define FLAG_QPEL 1 //must be 1
81
85 ((y*
c->uvstride + x)>>1),
86 ((y*
c->uvstride + x)>>1),
87 };
92 }
93 if(ref_index){
96 }
97 }
98 }
99
104 }
105
107 const int size,
const int h,
int ref_index,
int src_index,
111 const int hx = subx + x * (1 << (1 + qpel));
112 const int hy = suby + y * (1 << (1 + qpel));
113 uint8_t *
const *
const ref=
c->ref[ref_index];
114 uint8_t *
const *
const src=
c->src[src_index];
116 //FIXME check chroma 4mv, (no crashes ...)
117 av_assert2(x >=
c->xmin && hx <= c->xmax<<(qpel+1) && y >=
c->ymin && hy <= c->ymax<<(qpel+1));
118 if(x >=
c->xmin && hx <= c->xmax<<(qpel+1) && y >=
c->ymin && hy <= c->ymax<<(qpel+1)){
119 const int time_pp=
s->pp_time;
120 const int time_pb=
s->pb_time;
121 const int mask= 2*qpel+1;
125 int fx =
c->direct_basis_mv[
i][0] + hx;
126 int fy =
c->direct_basis_mv[
i][1] + hy;
127 int bx = hx ? fx -
c->co_located_mv[
i][0] :
c->co_located_mv[
i][0]*(time_pb - time_pp)/time_pp + ((
i &1)<<(qpel+4));
128 int by = hy ? fy -
c->co_located_mv[
i][1] :
c->co_located_mv[
i][1]*(time_pb - time_pp)/time_pp + ((
i>>1)<<(qpel+4));
129 int fxy= (fx&
mask) + ((fy&
mask)<<(qpel+1));
130 int bxy= (bx&
mask) + ((by&
mask)<<(qpel+1));
131
132 uint8_t *dst=
c->temp + 8*(
i&1) + 8*
stride*(
i>>1);
133 if(qpel){
136 }else{
139 }
140 }
141 }else{
142 int fx =
c->direct_basis_mv[0][0] + hx;
143 int fy =
c->direct_basis_mv[0][1] + hy;
144 int bx = hx ? fx -
c->co_located_mv[0][0] : (
c->co_located_mv[0][0]*(time_pb - time_pp)/time_pp);
145 int by = hy ? fy -
c->co_located_mv[0][1] : (
c->co_located_mv[0][1]*(time_pb - time_pp)/time_pp);
146 int fxy= (fx&
mask) + ((fy&
mask)<<(qpel+1));
147 int bxy= (bx&
mask) + ((by&
mask)<<(qpel+1));
148
149 if(qpel){
151 c->qpel_put[1][fxy](
c->temp + 8 ,
ref[0] + (fx>>2) + (fy>>2)*
stride + 8 ,
stride);
155 c->qpel_avg[1][bxy](
c->temp + 8 ,
ref[8] + (bx>>2) + (by>>2)*
stride + 8 ,
stride);
158 }else{
167
170 }
171 }
173 }else
176 }
177
179 const int size,
const int h,
int ref_index,
int src_index,
183 const int uvstride=
c->uvstride;
184 const int dxy= subx + (suby<<(1+qpel)); //FIXME log2_subpel?
185 const int hx= subx + x*(1<<(1+qpel));
186 const int hy= suby + y*(1<<(1+qpel));
187 uint8_t *
const *
const ref=
c->ref[ref_index];
188 uint8_t *
const *
const src=
c->src[src_index];
190 //FIXME check chroma 4mv, (no crashes ...)
191 int uvdxy; /* no, it might not be used uninitialized */
192 if(dxy){
193 if(qpel){
194 if (
h <<
size == 16) {
196 }
else if (
size == 0 &&
h == 8) {
199 } else
202 int cx= hx/2;
203 int cy= hy/2;
204 cx= (cx>>1)|(cx&1);
205 cy= (cy>>1)|(cy&1);
206 uvdxy= (cx&1) + 2*(cy&1);
207 // FIXME x/y wrong, but MPEG-4 qpel is sick anyway, we should drop as much of it as possible in favor for H.264
208 }
209 }else{
212 uvdxy= dxy | (x&1) | (2*(y&1));
213 }
215 }else{
218 uvdxy= (x&1) + 2*(y&1);
219 }
221 uint8_t *
const uvtemp=
c->temp + 16*
stride;
222 c->hpel_put[
size+1][uvdxy](uvtemp ,
ref[1] + (x>>1) + (y>>1)*uvstride, uvstride,
h>>1);
223 c->hpel_put[
size+1][uvdxy](uvtemp+8,
ref[2] + (x>>1) + (y>>1)*uvstride, uvstride,
h>>1);
224 d += chroma_cmp_func(
s, uvtemp ,
src[1], uvstride,
h>>1);
225 d += chroma_cmp_func(
s, uvtemp+8,
src[2], uvstride,
h>>1);
226 }
228 }
229
231 int ref_index, int src_index,
233 return cmp_inline(
s,x,y,0,0,0,16,ref_index,src_index,
cmp_func, chroma_cmp_func, 0, 0);
234 }
235
237 const int size,
const int h,
int ref_index,
int src_index,
240 return cmp_direct_inline(
s,x,y,0,0,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func,
flags&
FLAG_QPEL);
241 }else{
242 return cmp_inline(
s,x,y,0,0,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 0,
flags&
FLAG_CHROMA);
243 }
244 }
245
247 const int size,
const int h,
int ref_index,
int src_index,
250 return cmp_direct_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func,
flags&
FLAG_QPEL);
251 }else{
252 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);
253 }
254 }
255
256 /** @brief compares a block (either a full macroblock or a partition thereof)
257 against a proposed motion-compensated prediction of that block
258 */
260 const int size,
const int h,
int ref_index,
int src_index,
264 &&
flags==0 &&
h==16 &&
size==0 && subx==0 && suby==0){
267 && subx==0 && suby==0){
269 }else{
270 return cmp_internal(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func,
flags);
271 }
272 }
273
275 const int size,
const int h,
int ref_index,
int src_index,
278 return cmp_direct_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 0);
279 }else{
280 return cmp_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 0,
flags&
FLAG_CHROMA);
281 }
282 }
283
285 const int size,
const int h,
int ref_index,
int src_index,
288 return cmp_direct_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 1);
289 }else{
290 return cmp_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 1,
flags&
FLAG_CHROMA);
291 }
292 }
293
295
298 {
299 return 0;
300 }
301
303 }
304
308 int dia_size=
FFMAX(
FFABS(
s->avctx->dia_size)&255,
FFABS(
s->avctx->pre_dia_size)&255);
309
312 return -1;
313 }
314
316
318 c->avctx->me_sub_cmp =
c->avctx->me_cmp;
319
320 if(cache_size < 2*dia_size && !c->
stride){
321 av_log(
s->avctx,
AV_LOG_INFO,
"ME_MAP size may be a little small for the selected diamond size\n");
322 }
323
324 ff_set_cmp(&
s->mecc,
s->mecc.me_pre_cmp,
c->avctx->me_pre_cmp);
326 ff_set_cmp(&
s->mecc,
s->mecc.me_sub_cmp,
c->avctx->me_sub_cmp);
328
332
333 /*FIXME s->no_rounding b_type*/
336 c->qpel_avg =
s->qdsp.avg_qpel_pixels_tab;
338 c->qpel_put =
s->qdsp.put_no_rnd_qpel_pixels_tab;
339 else
340 c->qpel_put =
s->qdsp.put_qpel_pixels_tab;
341 }else{
348 else
350 }
351 c->hpel_avg =
s->hdsp.avg_pixels_tab;
353 c->hpel_put =
s->hdsp.put_no_rnd_pixels_tab;
354 else
355 c->hpel_put =
s->hdsp.put_pixels_tab;
356
358 c->stride =
s->linesize;
359 c->uvstride=
s->uvlinesize;
360 }else{
361 c->stride = 16*
s->mb_width + 32;
362 c->uvstride= 8*
s->mb_width + 16;
363 }
364
365 /* 8x8 fullpel search would need a 4x4 chroma compare, which we do
366 * not have yet, and even if we had, the motion estimation code
367 * does not expect it. */
369 if ((
c->avctx->me_cmp &
FF_CMP_CHROMA)
/* && !s->mecc.me_cmp[2] */)
373 c->hpel_put[2][0]=
c->hpel_put[2][1]=
375 }
376
379 }
380
381 return 0;
382 }
383
384 #define CHECK_SAD_HALF_MV(suffix, x, y) \
385 {\
386 d = s->mecc.pix_abs[size][(x ? 1 : 0) + (y ? 2 : 0)](NULL, pix, ptr + ((x) >> 1), stride, h); \
387 d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\
388 COPY3_IF_LT(dminh, d, dx, x, dy, y)\
389 }
390
392 int *mx_ptr, int *my_ptr, int dmin,
393 int src_index, int ref_index,
395 {
397 const int penalty_factor=
c->sub_penalty_factor;
398 int mx, my, dminh;
399 uint8_t *pix, *ptr;
402
404
406 *mx_ptr = 0;
407 *my_ptr = 0;
408 return dmin;
409 }
410
411 pix =
c->src[src_index][0];
412
413 mx = *mx_ptr;
414 my = *my_ptr;
415 ptr =
c->ref[ref_index][0] + (my *
stride) + mx;
416
417 dminh = dmin;
418
419 if (mx > xmin && mx < xmax &&
420 my > ymin && my < ymax) {
421 int dx=0, dy=0;
428 mx += mx;
429 my += my;
430
431
432 pen_x= pred_x + mx;
433 pen_y= pred_y + my;
434
443 }else{
446 }
448 }else{
453 }else{
456 }
458 }
459 }else{
464 }else{
467 }
470 }else{
474 }else{
477 }
480 }
482 }
483 mx+=dx;
484 my+=dy;
485
486 }else{
487 mx += mx;
488 my += my;
489 }
490
491 *mx_ptr = mx;
492 *my_ptr = my;
493 return dminh;
494 }
495
497 {
498 const int xy=
s->mb_x +
s->mb_y*
s->mb_stride;
499
500 s->p_mv_table[xy][0] = mx;
501 s->p_mv_table[xy][1] = my;
502
503 /* has already been set to the 4 MV if 4MV is done */
504 if(mv4){
505 int mot_xy=
s->block_index[0];
506
507 s->current_picture.motion_val[0][mot_xy ][0] = mx;
508 s->current_picture.motion_val[0][mot_xy ][1] = my;
509 s->current_picture.motion_val[0][mot_xy + 1][0] = mx;
510 s->current_picture.motion_val[0][mot_xy + 1][1] = my;
511
512 mot_xy +=
s->b8_stride;
513 s->current_picture.motion_val[0][mot_xy ][0] = mx;
514 s->current_picture.motion_val[0][mot_xy ][1] = my;
515 s->current_picture.motion_val[0][mot_xy + 1][0] = mx;
516 s->current_picture.motion_val[0][mot_xy + 1][1] = my;
517 }
518 }
519
520 /**
521 * get fullpel ME search limits.
522 */
524 {
526 int range=
c->avctx->me_range >> (1 + !!(
c->flags&
FLAG_QPEL));
528 /*
529 if(c->avctx->me_range) c->range= c->avctx->me_range >> 1;
530 else c->range= 16;
531 */
532 if (
s->unrestricted_mv) {
535 c->xmax = - x +
s->width;
536 c->ymax = - y +
s->height;
538 // Search range of H.261 is different from other codec standards
539 c->xmin = (x > 15) ? - 15 : 0;
540 c->ymin = (y > 15) ? - 15 : 0;
541 c->xmax = (x <
s->mb_width * 16 - 16) ? 15 : 0;
542 c->ymax = (y <
s->mb_height * 16 - 16) ? 15 : 0;
543 } else {
546 c->xmax = - x +
s->mb_width *16 - 16;
547 c->ymax = - y +
s->mb_height*16 - 16;
548 }
549 if(!range || range > max_range)
550 range = max_range;
551 if(range){
552 c->xmin =
FFMAX(
c->xmin,-range);
553 c->xmax =
FFMIN(
c->xmax, range);
554 c->ymin =
FFMAX(
c->ymin,-range);
555 c->ymax =
FFMIN(
c->ymax, range);
556 }
557 }
558
561
562 c->ref[1][0] =
c->ref[0][0] + 8;
563 c->ref[2][0] =
c->ref[0][0] + 8*
stride;
564 c->ref[3][0] =
c->ref[2][0] + 8;
565 c->src[1][0] =
c->src[0][0] + 8;
566 c->src[2][0] =
c->src[0][0] + 8*
stride;
567 c->src[3][0] =
c->src[2][0] + 8;
568 }
569
571 {
577 int dmin_sum=0, mx4_sum=0, my4_sum=0,
i;
578 int same=1;
581 int safety_clipping=
s->unrestricted_mv && (
s->width&15) && (
s->height&15);
582
584
586 int mx4, my4;
587 int pred_x4, pred_y4;
588 int dmin4;
589 static const int off[4]= {2, 1, 1, -1};
590 const int mot_stride =
s->b8_stride;
591 const int mot_xy =
s->block_index[
block];
592
593 if(safety_clipping){
594 c->xmax = - 16*
s->mb_x +
s->width - 8*(
block &1);
595 c->ymax = - 16*
s->mb_y +
s->height - 8*(
block>>1);
596 }
597
598 P_LEFT[0] =
s->current_picture.motion_val[0][mot_xy - 1][0];
599 P_LEFT[1] =
s->current_picture.motion_val[0][mot_xy - 1][1];
600
602
603 /* special case for first line */
604 if (
s->first_slice_line &&
block<2) {
607 } else {
608 P_TOP[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][0];
609 P_TOP[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][1];
610 P_TOPRIGHT[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride + off[
block]][0];
611 P_TOPRIGHT[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride + off[
block]][1];
616
619
622 }
625 if(safety_clipping)
627 if (
s->first_slice_line && block<2 && i>1 &&
i<9)
628 continue;
630 continue;
633 }
634
636
638
639 if (
s->mecc.me_sub_cmp[0] !=
s->mecc.mb_cmp[0]) {
640 int dxy;
642 uint8_t *dest_y =
c->scratchpad +
offset;
643 if(
s->quarter_sample){
645 dxy = ((my4 & 3) << 2) | (mx4 & 3);
646
648 s->qdsp.put_no_rnd_qpel_pixels_tab[1][dxy](dest_y,
ref,
stride);
649 else
650 s->qdsp.put_qpel_pixels_tab[1][dxy](dest_y,
ref,
stride);
651 }else{
653 dxy = ((my4 & 1) << 1) | (mx4 & 1);
654
656 s->hdsp.put_no_rnd_pixels_tab[1][dxy](dest_y ,
ref ,
stride,
h);
657 else
658 s->hdsp.put_pixels_tab [1][dxy](dest_y ,
ref ,
stride,
h);
659 }
661 }else
662 dmin_sum+= dmin4;
663
664 if(
s->quarter_sample){
665 mx4_sum+= mx4/2;
666 my4_sum+= my4/2;
667 }else{
668 mx4_sum+= mx4;
669 my4_sum+= my4;
670 }
671
672 s->current_picture.motion_val[0][
s->block_index[
block]][0] = mx4;
673 s->current_picture.motion_val[0][
s->block_index[
block]][1] = my4;
674
675 if(mx4 != mx || my4 != my) same=0;
676 }
677
678 if(same)
679 return INT_MAX;
680
681 if (
s->mecc.me_sub_cmp[0] !=
s->mecc.mb_cmp[0]) {
682 dmin_sum +=
s->mecc.mb_cmp[0](
s,
683 s->new_picture->data[0] +
684 s->mb_x * 16 +
s->mb_y * 16 *
stride,
686 }
687
689 int dxy;
690 int mx, my;
692
695 dxy = ((my & 1) << 1) | (mx & 1);
696
697 offset= (
s->mb_x*8 + (mx>>1)) + (
s->mb_y*8 + (my>>1))*
s->uvlinesize;
698
700 s->hdsp.put_no_rnd_pixels_tab[1][dxy](
c->scratchpad ,
s->last_picture.f->data[1] +
offset,
s->uvlinesize, 8);
701 s->hdsp.put_no_rnd_pixels_tab[1][dxy](
c->scratchpad + 8,
s->last_picture.f->data[2] +
offset,
s->uvlinesize, 8);
702 }else{
703 s->hdsp.put_pixels_tab [1][dxy](
c->scratchpad ,
s->last_picture.f->data[1] +
offset,
s->uvlinesize, 8);
704 s->hdsp.put_pixels_tab [1][dxy](
c->scratchpad + 8,
s->last_picture.f->data[2] +
offset,
s->uvlinesize, 8);
705 }
706
707 dmin_sum +=
s->mecc.mb_cmp[1](
s,
s->new_picture->data[1] +
s->mb_x * 8 +
s->mb_y * 8 *
s->uvlinesize,
c->scratchpad,
s->uvlinesize, 8);
708 dmin_sum +=
s->mecc.mb_cmp[1](
s,
s->new_picture->data[2] +
s->mb_x * 8 +
s->mb_y * 8 *
s->uvlinesize,
c->scratchpad + 8,
s->uvlinesize, 8);
709 }
710
713
714 switch(
c->avctx->mb_cmp&0xFF){
715 /*case FF_CMP_SSE:
716 return dmin_sum+ 32*s->qscale*s->qscale;*/
718 return dmin_sum;
719 default:
720 return dmin_sum+ 11*
c->mb_penalty_factor;
721 }
722 }
723
726
727 c->ref[1+ref_index][0] =
c->ref[0+ref_index][0] +
s->linesize;
728 c->src[1][0] =
c->src[0][0] +
s->linesize;
730 c->ref[1+ref_index][1] =
c->ref[0+ref_index][1] +
s->uvlinesize;
731 c->ref[1+ref_index][2] =
c->ref[0+ref_index][2] +
s->uvlinesize;
732 c->src[1][1] =
c->src[0][1] +
s->uvlinesize;
733 c->src[1][2] =
c->src[0][2] +
s->uvlinesize;
734 }
735 }
736
738 int16_t (*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)
739 {
745 const uint8_t *
const mv_penalty =
c->current_mv_penalty;
746 int same=1;
747 const int stride= 2*
s->linesize;
748 int dmin_sum= 0;
749 const int mot_stride=
s->mb_stride;
750 const int xy=
s->mb_x +
s->mb_y*mot_stride;
751
757
759 int field_select;
760 int best_dmin= INT_MAX;
761 int best_field= -1;
762
763 for(field_select=0; field_select<2; field_select++){
764 int dmin, mx_i, my_i;
765 int16_t (*mv_table)[2]= mv_tables[
block][field_select];
766
767 if(user_field_select){
768 av_assert1(field_select==0 || field_select==1);
770 if(field_select_tables[
block][xy] != field_select)
771 continue;
772 }
773
774 P_LEFT[0] = mv_table[xy - 1][0];
775 P_LEFT[1] = mv_table[xy - 1][1];
777
780
781 if(!
s->first_slice_line){
782 P_TOP[0] = mv_table[xy - mot_stride][0];
783 P_TOP[1] = mv_table[xy - mot_stride][1];
784 P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];
785 P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];
790
793 }
794 P_MV1[0]= mx;
//FIXME not correct if block != field_select
796
798
799 dmin=
c->sub_motion_search(
s, &mx_i, &my_i, dmin,
block, field_select+ref_index,
size,
h);
800
801 mv_table[xy][0]= mx_i;
802 mv_table[xy][1]= my_i;
803
804 if (
s->mecc.me_sub_cmp[0] !=
s->mecc.mb_cmp[0]) {
805 int dxy;
806
807 //FIXME chroma ME
808 uint8_t *
ref=
c->ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*
stride;
809 dxy = ((my_i & 1) << 1) | (mx_i & 1);
810
813 }else{
815 }
818 }else
819 dmin+=
c->mb_penalty_factor;
//field_select bits
820
821 dmin += field_select !=
block;
//slightly prefer same field
822
823 if(dmin < best_dmin){
824 best_dmin= dmin;
825 best_field= field_select;
826 }
827 }
828 {
829 int16_t (*mv_table)[2]= mv_tables[
block][best_field];
830
831 if(mv_table[xy][0] != mx) same=0; //FIXME check if these checks work and are any good at all
832 if(mv_table[xy][1]&1) same=0;
833 if(mv_table[xy][1]*2 != my) same=0;
834 if(best_field !=
block) same=0;
835 }
836
837 field_select_tables[
block][xy]= best_field;
838 dmin_sum += best_dmin;
839 }
840
845
846 if(same)
847 return INT_MAX;
848
849 switch(
c->avctx->mb_cmp&0xFF){
850 /*case FF_CMP_SSE:
851 return dmin_sum+ 32*s->qscale*s->qscale;*/
853 return dmin_sum;
854 default:
855 return dmin_sum+ 11*
c->mb_penalty_factor;
856 }
857 }
858
861 default:
880 return 1;
881 }
882 }
883
885 int mb_x, int mb_y)
886 {
888 uint8_t *pix, *ppix;
889 int sum, mx = 0, my = 0, dmin = 0;
890 int varc; ///< the variance of the block (sum of squared (p[y][x]-average))
891 int vard; ///< sum of squared differences with the estimated motion vector
893 const int shift= 1+
s->quarter_sample;
894 int mb_type=0;
895 Picture *
const pic= &
s->current_picture;
896
897 init_ref(
c,
s->new_picture->data,
s->last_picture.f->data,
NULL, 16*mb_x, 16*mb_y, 0);
898
899 av_assert0(
s->quarter_sample==0 ||
s->quarter_sample==1);
902
906 c->current_mv_penalty=
c->mv_penalty[
s->f_code] +
MAX_DMV;
907
910
911 /* intra / predictive decision */
913 sum =
s->mpvencdsp.pix_sum(pix,
s->linesize);
914 varc =
s->mpvencdsp.pix_norm1(pix,
s->linesize) -
915 (((unsigned) sum * sum) >> 8) + 500;
916
917 pic->
mb_mean[
s->mb_stride * mb_y + mb_x] = (sum+128)>>8;
918 pic->
mb_var [
s->mb_stride * mb_y + mb_x] = (varc+128)>>8;
919 c->mb_var_sum_temp += (varc+128)>>8;
920
922 const int mot_stride =
s->b8_stride;
923 const int mot_xy =
s->block_index[0];
924
925 P_LEFT[0] =
s->current_picture.motion_val[0][mot_xy - 1][0];
926 P_LEFT[1] =
s->current_picture.motion_val[0][mot_xy - 1][1];
927
930
931 if (!
s->first_slice_line) {
932 P_TOP[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][0];
933 P_TOP[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][1];
934 P_TOPRIGHT[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride + 2][0];
935 P_TOPRIGHT[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride + 2][1];
942
945
949 } else { /* MPEG-1 at least */
952 }
953 } else {
956 }
958 }
959
960 /* At this point (mx,my) are full-pell and the relative displacement */
961 ppix =
c->ref[0][0] + (my *
s->linesize) + mx;
962
963 vard =
s->mecc.sse[0](
NULL, pix, ppix,
s->linesize, 16);
964
965 pic->
mc_mb_var[
s->mb_stride * mb_y + mb_x] = (vard+128)>>8;
966 c->mc_mb_var_sum_temp += (vard+128)>>8;
967
972
973 if (vard*2 + 200*256 > varc && !
s->intra_penalty)
975 if (varc*2 + 200*256 > vard ||
s->qscale > 24){
976 // if (varc*2 + 200*256 + 50*(s->lambda2>>FF_LAMBDA_SHIFT) > vard){
978 c->sub_motion_search(
s, &mx, &my, dmin, 0, 0, 0, 16);
980 if(mx || my)
982 }else{
985 }
987 && !
c->skip && varc>50<<8 && vard>10<<8){
990
992 }else
995 && !
c->skip){
//FIXME varc/d checks
998 }
999 }else{
1002
1003 dmin=
c->sub_motion_search(
s, &mx, &my, dmin, 0, 0, 0, 16);
1004 if(
c->avctx->me_sub_cmp !=
c->avctx->mb_cmp && !
c->skip)
1006
1008 && !
c->skip && varc>50<<8 && vard>10<<8){
1010 if(dmin4 < dmin){
1012 dmin=dmin4;
1013 }
1014 }
1016 && !
c->skip){
//FIXME varc/d checks
1018 if(dmin_i < dmin){
1020 dmin= dmin_i;
1021 }
1022 }
1023
1025
1026 /* get intra luma score */
1028 intra_score= varc - 500;
1029 }else{
1030 unsigned mean = (sum+128)>>8;
1032
1033 for(
i=0;
i<16;
i++){
1034 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+ 0]) =
mean;
1035 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+ 4]) =
mean;
1036 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+ 8]) =
mean;
1037 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+12]) =
mean;
1038 }
1039
1040 intra_score=
s->mecc.mb_cmp[0](
s,
c->scratchpad, pix,
s->linesize, 16);
1041 }
1042 intra_score +=
c->mb_penalty_factor*16 +
s->intra_penalty;
1043
1044 if(intra_score < dmin){
1047 }else
1048 s->current_picture.mb_type[mb_y*
s->mb_stride + mb_x] = 0;
1049
1050 {
1054 }
1055 }
1056
1057 s->mb_type[mb_y*
s->mb_stride + mb_x]= mb_type;
1058 }
1059
1061 int mb_x, int mb_y)
1062 {
1064 int mx, my, dmin;
1066 const int shift= 1+
s->quarter_sample;
1067 const int xy= mb_x + mb_y*
s->mb_stride;
1068 init_ref(
c,
s->new_picture->data,
s->last_picture.f->data,
NULL, 16*mb_x, 16*mb_y, 0);
1069
1070 av_assert0(
s->quarter_sample==0 ||
s->quarter_sample==1);
1071
1073 c->current_mv_penalty=
c->mv_penalty[
s->f_code] +
MAX_DMV;
1074
1077
1078 P_LEFT[0] =
s->p_mv_table[xy + 1][0];
1079 P_LEFT[1] =
s->p_mv_table[xy + 1][1];
1080
1082
1083 /* special case for first line */
1084 if (
s->first_slice_line) {
1089 } else {
1090 P_TOP[0] =
s->p_mv_table[xy +
s->mb_stride ][0];
1091 P_TOP[1] =
s->p_mv_table[xy +
s->mb_stride ][1];
1092 P_TOPRIGHT[0] =
s->p_mv_table[xy +
s->mb_stride - 1][0];
1093 P_TOPRIGHT[1] =
s->p_mv_table[xy +
s->mb_stride - 1][1];
1097
1100
1103 }
1104
1106
1107 s->p_mv_table[xy][0] = mx<<
shift;
1108 s->p_mv_table[xy][1] = my<<
shift;
1109
1110 return dmin;
1111 }
1112
1114 int16_t (*mv_table)[2], int ref_index, int f_code)
1115 {
1117 int mx = 0, my = 0, dmin = 0;
1119 const int shift= 1+
s->quarter_sample;
1120 const int mot_stride =
s->mb_stride;
1121 const int mot_xy = mb_y*mot_stride + mb_x;
1124
1129
1131
1133 P_LEFT[0] = mv_table[mot_xy - 1][0];
1134 P_LEFT[1] = mv_table[mot_xy - 1][1];
1135
1137
1138 /* special case for first line */
1139 if (!
s->first_slice_line) {
1140 P_TOP[0] = mv_table[mot_xy - mot_stride ][0];
1141 P_TOP[1] = mv_table[mot_xy - mot_stride ][1];
1142 P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1][0];
1143 P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1][1];
1147
1150 }
1153
1154 if(mv_table ==
s->b_forw_mv_table){
1156 }else{
1158 }
1159
1161 }
1162
1163 dmin=
c->sub_motion_search(
s, &mx, &my, dmin, 0, ref_index, 0, 16);
1164
1165 if(
c->avctx->me_sub_cmp !=
c->avctx->mb_cmp && !
c->skip)
1167
1168 // s->mb_type[mb_y*s->mb_width + mb_x]= mb_type;
1169 mv_table[mot_xy][0]= mx;
1170 mv_table[mot_xy][1]= my;
1171
1172 return dmin;
1173 }
1174
1176 int motion_fx, int motion_fy,
1177 int motion_bx, int motion_by,
1178 int pred_fx, int pred_fy,
1179 int pred_bx, int pred_by,
1181 {
1182 //FIXME optimize?
1183 //FIXME better f_code prediction (max mv & distance)
1184 //FIXME pointers
1186 const uint8_t *
const mv_penalty_f =
c->mv_penalty[
s->f_code] +
MAX_DMV;
// f_code of the prev frame
1187 const uint8_t *
const mv_penalty_b =
c->mv_penalty[
s->b_code] +
MAX_DMV;
// f_code of the prev frame
1189 uint8_t *dest_y =
c->scratchpad;
1190 uint8_t *ptr;
1191 int dxy;
1192 int src_x, src_y;
1193 int fbmin;
1194 uint8_t **src_data=
c->src[0];
1195 uint8_t **ref_data=
c->ref[0];
1196 uint8_t **ref2_data=
c->ref[2];
1197
1198 if(
s->quarter_sample){
1199 dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);
1200 src_x = motion_fx >> 2;
1201 src_y = motion_fy >> 2;
1202
1203 ptr = ref_data[0] + (src_y *
stride) + src_x;
1204 s->qdsp.put_qpel_pixels_tab[0][dxy](dest_y, ptr,
stride);
1205
1206 dxy = ((motion_by & 3) << 2) | (motion_bx & 3);
1207 src_x = motion_bx >> 2;
1208 src_y = motion_by >> 2;
1209
1210 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1211 s->qdsp.avg_qpel_pixels_tab[
size][dxy](dest_y, ptr,
stride);
1212 }else{
1213 dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);
1214 src_x = motion_fx >> 1;
1215 src_y = motion_fy >> 1;
1216
1217 ptr = ref_data[0] + (src_y *
stride) + src_x;
1218 s->hdsp.put_pixels_tab[
size][dxy](dest_y , ptr ,
stride,
h);
1219
1220 dxy = ((motion_by & 1) << 1) | (motion_bx & 1);
1221 src_x = motion_bx >> 1;
1222 src_y = motion_by >> 1;
1223
1224 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1225 s->hdsp.avg_pixels_tab[
size][dxy](dest_y , ptr ,
stride,
h);
1226 }
1227
1228 fbmin = (mv_penalty_f[motion_fx-pred_fx] + mv_penalty_f[motion_fy-pred_fy])*
c->mb_penalty_factor
1229 +(mv_penalty_b[motion_bx-pred_bx] + mv_penalty_b[motion_by-pred_by])*
c->mb_penalty_factor
1230 +
s->mecc.mb_cmp[
size](
s, src_data[0], dest_y,
stride,
h);
// FIXME new_pic
1231
1233 }
1234 //FIXME CHROMA !!!
1235
1236 return fbmin;
1237 }
1238
1239 /* refine the bidir vectors in hq mode and return the score in both lq & hq mode*/
1241 {
1243 const int mot_stride =
s->mb_stride;
1244 const int xy = mb_y *mot_stride + mb_x;
1245 int fbmin;
1246 int pred_fx=
s->b_bidir_forw_mv_table[xy-1][0];
1247 int pred_fy=
s->b_bidir_forw_mv_table[xy-1][1];
1248 int pred_bx=
s->b_bidir_back_mv_table[xy-1][0];
1249 int pred_by=
s->b_bidir_back_mv_table[xy-1][1];
1250 int motion_fx=
s->b_bidir_forw_mv_table[xy][0]=
s->b_forw_mv_table[xy][0];
1251 int motion_fy=
s->b_bidir_forw_mv_table[xy][1]=
s->b_forw_mv_table[xy][1];
1252 int motion_bx=
s->b_bidir_back_mv_table[xy][0]=
s->b_back_mv_table[xy][0];
1253 int motion_by=
s->b_bidir_back_mv_table[xy][1]=
s->b_back_mv_table[xy][1];
1254 const int flags=
c->sub_flags;
1256 const int shift= 1+qpel;
1257 const int xmin=
c->xmin * (1 <<
shift);
1258 const int ymin=
c->ymin * (1 <<
shift);
1259 const int xmax=
c->xmax<<
shift;
1260 const int ymax=
c->ymax<<
shift;
1261 #define HASH(fx,fy,bx,by) ((fx)+17*(fy)+63*(bx)+117*(by))
1262 #define HASH8(fx,fy,bx,by) ((uint8_t)HASH(fx,fy,bx,by))
1263 int hashidx=
HASH(motion_fx,motion_fy, motion_bx, motion_by);
1264 uint8_t
map[256] = { 0 };
1265
1266 map[hashidx&255] = 1;
1267
1269 motion_bx, motion_by,
1270 pred_fx, pred_fy,
1271 pred_bx, pred_by,
1272 0, 16);
1273
1274 if(
s->avctx->bidir_refine){
1275 int end;
1276 static const uint8_t limittab[5]={0,8,32,64,80};
1277 const int limit= limittab[
s->avctx->bidir_refine];
1278 static const int8_t vect[][4]={
1279 { 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},
1280
1281 { 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},
1282 { 0, 1, 0, 1}, { 0,-1, 0,-1}, { 1, 0, 1, 0}, {-1, 0,-1, 0},
1283 { 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},
1284 { 0,-1, 0, 1}, { 0, 1, 0,-1}, {-1, 0, 1, 0}, { 1, 0,-1, 0},
1285
1286 { 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},
1287 { 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},
1288 { 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},
1289 { 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},
1290
1291 { 1, 1, 1, 1}, {-1,-1,-1,-1},
1292 { 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},
1293 { 1, 1,-1,-1}, {-1,-1, 1, 1}, { 1,-1,-1, 1}, {-1, 1, 1,-1}, { 1,-1, 1,-1}, {-1, 1,-1, 1},
1294 };
1295 static const uint8_t
hash[]={
1296 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),
1297
1298 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),
1299 HASH8( 0, 1, 0, 1),
HASH8( 0,-1, 0,-1),
HASH8( 1, 0, 1, 0),
HASH8(-1, 0,-1, 0),
1300 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),
1301 HASH8( 0,-1, 0, 1),
HASH8( 0, 1, 0,-1),
HASH8(-1, 0, 1, 0),
HASH8( 1, 0,-1, 0),
1302
1303 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),
1304 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),
1305 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),
1306 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),
1307
1309 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),
1310 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),
1311 };
1312
1313 #define CHECK_BIDIR(fx,fy,bx,by)\
1314 if( !map[(hashidx+HASH(fx,fy,bx,by))&255]\
1315 &&(fx<=0 || motion_fx+fx<=xmax) && (fy<=0 || motion_fy+fy<=ymax) && (bx<=0 || motion_bx+bx<=xmax) && (by<=0 || motion_by+by<=ymax)\
1316 &&(fx>=0 || motion_fx+fx>=xmin) && (fy>=0 || motion_fy+fy>=ymin) && (bx>=0 || motion_bx+bx>=xmin) && (by>=0 || motion_by+by>=ymin)){\
1317 int score;\
1318 map[(hashidx+HASH(fx,fy,bx,by))&255] = 1;\
1319 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);\
1320 if(score < fbmin){\
1321 hashidx += HASH(fx,fy,bx,by);\
1322 fbmin= score;\
1323 motion_fx+=fx;\
1324 motion_fy+=fy;\
1325 motion_bx+=bx;\
1326 motion_by+=by;\
1327 end=0;\
1328 }\
1329 }
1330 #define CHECK_BIDIR2(a,b,c,d)\
1331 CHECK_BIDIR(a,b,c,d)\
1332 CHECK_BIDIR(-(a),-(b),-(c),-(d))
1333
1334 do{
1336 int borderdist=0;
1337 end=1;
1338
1343
1345 int fx= motion_fx+vect[
i][0];
1346 int fy= motion_fy+vect[
i][1];
1347 int bx= motion_bx+vect[
i][2];
1348 int by= motion_by+vect[
i][3];
1349 if(borderdist<=0){
1350 int a= (xmax -
FFMAX(fx,bx))|(
FFMIN(fx,bx) - xmin);
1351 int b= (ymax -
FFMAX(fy,by))|(
FFMIN(fy,by) - ymin);
1354 }
1356 int score;
1358 score=
check_bidir_mv(
s, fx, fy, bx, by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);
1359 if(score < fbmin){
1361 fbmin= score;
1362 motion_fx=fx;
1363 motion_fy=fy;
1364 motion_bx=bx;
1365 motion_by=by;
1366 end=0;
1367 borderdist--;
1368 if(borderdist<=0){
1372 }
1373 }
1374 }
1375 }
1376 }while(!end);
1377 }
1378
1379 s->b_bidir_forw_mv_table[xy][0]= motion_fx;
1380 s->b_bidir_forw_mv_table[xy][1]= motion_fy;
1381 s->b_bidir_back_mv_table[xy][0]= motion_bx;
1382 s->b_bidir_back_mv_table[xy][1]= motion_by;
1383
1384 return fbmin;
1385 }
1386
1388 {
1391 const int mot_stride =
s->mb_stride;
1392 const int mot_xy = mb_y*mot_stride + mb_x;
1393 const int shift= 1+
s->quarter_sample;
1395 const int time_pp=
s->pp_time;
1396 const int time_pb=
s->pb_time;
1397 int mx, my, xmin, xmax, ymin, ymax;
1398 int16_t (*mv_table)[2]=
s->b_direct_mv_table;
1399
1400 c->current_mv_penalty=
c->mv_penalty[1] +
MAX_DMV;
1401 ymin= xmin=(-32)>>
shift;
1402 ymax= xmax= 31>>
shift;
1403
1404 if (
IS_8X8(
s->next_picture.mb_type[mot_xy])) {
1406 }else{
1408 }
1409
1413
1414 c->co_located_mv[
i][0] =
s->next_picture.motion_val[0][
index][0];
1415 c->co_located_mv[
i][1] =
s->next_picture.motion_val[0][
index][1];
1416 c->direct_basis_mv[
i][0]=
c->co_located_mv[
i][0]*time_pb/time_pp + ((
i& 1)<<(
shift+3));
1417 c->direct_basis_mv[
i][1]=
c->co_located_mv[
i][1]*time_pb/time_pp + ((
i>>1)<<(
shift+3));
1418 // c->direct_basis_mv[1][i][0]= c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(shift+3);
1419 // c->direct_basis_mv[1][i][1]= c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(shift+3);
1420
1421 max=
FFMAX(
c->direct_basis_mv[
i][0],
c->direct_basis_mv[
i][0] -
c->co_located_mv[
i][0])>>
shift;
1422 min=
FFMIN(
c->direct_basis_mv[
i][0],
c->direct_basis_mv[
i][0] -
c->co_located_mv[
i][0])>>
shift;
1423 max+= 16*mb_x + 1;
// +-1 is for the simpler rounding
1427
1428 max=
FFMAX(
c->direct_basis_mv[
i][1],
c->direct_basis_mv[
i][1] -
c->co_located_mv[
i][1])>>
shift;
1429 min=
FFMIN(
c->direct_basis_mv[
i][1],
c->direct_basis_mv[
i][1] -
c->co_located_mv[
i][1])>>
shift;
1430 max+= 16*mb_y + 1;
// +-1 is for the simpler rounding
1434
1436 }
1437
1438 av_assert2(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);
1439
1440 if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){
1441 s->b_direct_mv_table[mot_xy][0]= 0;
1442 s->b_direct_mv_table[mot_xy][1]= 0;
1443
1444 return 256*256*256*64;
1445 }
1446
1455
1458
1459 /* special case for first line */
1460 if (!
s->first_slice_line) {
//FIXME maybe allow this over thread boundary as it is clipped
1465
1468 }
1469
1473 else
1475
1476 if(
c->avctx->me_sub_cmp !=
c->avctx->mb_cmp && !
c->skip)
1478
1479 get_limits(
s, 16*mb_x, 16*mb_y);
//restore c->?min/max, maybe not needed
1480
1481 mv_table[mot_xy][0]= mx;
1482 mv_table[mot_xy][1]= my;
1485
1486 return dmin;
1487 }
1488
1490 int mb_x, int mb_y)
1491 {
1493 const int penalty_factor=
c->mb_penalty_factor;
1494 int fmin, bmin, dmin, fbmin, bimin, fimin;
1496 const int xy = mb_y*
s->mb_stride + mb_x;
1497 init_ref(
c,
s->new_picture->data,
s->last_picture.f->data,
1498 s->next_picture.f->data, 16 * mb_x, 16 * mb_y, 2);
1499
1501
1503
1506
1507 score= ((unsigned)(score*score + 128*256))>>16;
1508 c->mc_mb_var_sum_temp += score;
1509 s->current_picture.mc_mb_var[mb_y*
s->mb_stride + mb_x] = score;
//FIXME use SSE
1511
1512 return;
1513 }
1514
1517 else
1518 dmin= INT_MAX;
1519 // FIXME penalty stuff for non-MPEG-4
1522 3 * penalty_factor;
1523
1526 2 * penalty_factor;
1527 ff_dlog(
s,
" %d %d ",
s->b_forw_mv_table[xy][0],
s->b_forw_mv_table[xy][1]);
1528
1532
1534 //FIXME mb type penalty
1536 c->current_mv_penalty=
c->mv_penalty[
s->f_code] +
MAX_DMV;
1538 s->b_field_mv_table[0],
s->b_field_select_table[0],
1539 s->b_forw_mv_table[xy][0],
s->b_forw_mv_table[xy][1], 0);
1540 c->current_mv_penalty=
c->mv_penalty[
s->b_code] +
MAX_DMV;
1542 s->b_field_mv_table[1],
s->b_field_select_table[1],
1543 s->b_back_mv_table[xy][0],
s->b_back_mv_table[xy][1], 0);
1544 }else
1545 fimin= bimin= INT_MAX;
1546
1547 {
1550
1551 if (dmin <= score){
1552 score = dmin;
1554 }
1555 if(bmin<score){
1556 score=bmin;
1558 }
1559 if(fbmin<score){
1560 score=fbmin;
1562 }
1563 if(fimin<score){
1564 score=fimin;
1566 }
1567 if(bimin<score){
1568 score=bimin;
1570 }
1571
1572 score= ((unsigned)(score*score + 128*256))>>16;
1573 c->mc_mb_var_sum_temp += score;
1574 s->current_picture.mc_mb_var[mb_y*
s->mb_stride + mb_x] = score;
//FIXME use SSE
1575 }
1576
1579 if(fimin < INT_MAX)
1581 if(bimin < INT_MAX)
1583 if(fimin < INT_MAX && bimin < INT_MAX){
1585 }
1586 //FIXME something smarter
1591 }
1592
1593 s->mb_type[mb_y*
s->mb_stride + mb_x]=
type;
1594 }
1595
1596 /* find best f_code for ME which do unlimited searches */
1598 {
1600 int score[8];
1601 int i, y, range=
s->avctx->me_range ?
s->avctx->me_range : (INT_MAX/2);
1603 int best_fcode=-1;
1604 int best_score=-10000000;
1605
1606 if(
s->msmpeg4_version)
1607 range=
FFMIN(range, 16);
1609 range=
FFMIN(range, 256);
1610
1611 for(
i=0;
i<8;
i++) score[
i]=
s->mb_num*(8-
i);
1612
1613 for(y=0; y<
s->mb_height; y++){
1614 int x;
1615 int xy= y*
s->mb_stride;
1616 for(x=0; x<
s->mb_width; x++, xy++){
1617 if(
s->mb_type[xy] &
type){
1618 int mx= mv_table[xy][0];
1619 int my= mv_table[xy][1];
1622 int j;
1623
1624 if (mx >= range || mx < -range ||
1625 my >= range || my < -range)
1626 continue;
1627
1628 for(j=0; j<fcode && j<8; j++){
1629 if(
s->pict_type==
AV_PICTURE_TYPE_B ||
s->current_picture.mc_mb_var[xy] <
s->current_picture.mb_var[xy])
1630 score[j]-= 170;
1631 }
1632 }
1633 }
1634 }
1635
1637 if(score[
i] > best_score){
1638 best_score= score[
i];
1640 }
1641 }
1642
1643 return best_fcode;
1644 }else{
1645 return 1;
1646 }
1647 }
1648
1650 {
1652 const int f_code=
s->f_code;
1653 int y, range;
1655
1656 range = (((
s->out_format ==
FMT_MPEG1 ||
s->msmpeg4_version) ? 8 : 16) << f_code);
1657
1658 av_assert0(range <= 16 || !s->msmpeg4_version);
1660
1661 if(
c->avctx->me_range && range >
c->avctx->me_range) range=
c->avctx->me_range;
1662
1664 const int wrap=
s->b8_stride;
1665
1666 /* clip / convert to intra 8x8 type MVs */
1667 for(y=0; y<
s->mb_height; y++){
1669 int i= y*
s->mb_stride;
1670 int x;
1671
1672 for(x=0; x<
s->mb_width; x++){
1677 int mx =
s->current_picture.motion_val[0][ xy + off ][0];
1678 int my =
s->current_picture.motion_val[0][ xy + off ][1];
1679
1680 if( mx >=range || mx <-range
1681 || my >=range || my <-range){
1684 s->current_picture.mb_type[
i] =
type;
1685 }
1686 }
1687 }
1688 xy+=2;
1690 }
1691 }
1692 }
1693 }
1694
1695 /**
1696 * @param truncate 1 for truncation, 0 for using intra
1697 */
1699 int16_t (*mv_table)[2],
int f_code,
int type,
int truncate)
1700 {
1702 int y, h_range, v_range;
1703
1704 // RAL: 8 in MPEG-1, 16 in MPEG-4
1705 int range = (((
s->out_format ==
FMT_MPEG1 ||
s->msmpeg4_version) ? 8 : 16) << f_code);
1706
1707 if(
c->avctx->me_range && range >
c->avctx->me_range) range=
c->avctx->me_range;
1708
1709 h_range= range;
1710 v_range= field_select_table ? range>>1 : range;
1711
1712 /* clip / convert to intra 16x16 type MVs */
1713 for(y=0; y<
s->mb_height; y++){
1714 int x;
1715 int xy= y*
s->mb_stride;
1716 for(x=0; x<
s->mb_width; x++){
1717 if (
s->mb_type[xy] &
type){
// RAL: "type" test added...
1718 if (!field_select_table || field_select_table[xy] == field_select) {
1719 if( mv_table[xy][0] >=h_range || mv_table[xy][0] <-h_range
1720 || mv_table[xy][1] >=v_range || mv_table[xy][1] <-v_range){
1721
1722 if(truncate){
1723 if (mv_table[xy][0] > h_range-1) mv_table[xy][0]= h_range-1;
1724 else if(mv_table[xy][0] < -h_range ) mv_table[xy][0]= -h_range;
1725 if (mv_table[xy][1] > v_range-1) mv_table[xy][1]= v_range-1;
1726 else if(mv_table[xy][1] < -v_range ) mv_table[xy][1]= -v_range;
1727 }else{
1728 s->mb_type[xy] &= ~
type;
1730 mv_table[xy][0]=
1731 mv_table[xy][1]= 0;
1732 }
1733 }
1734 }
1735 }
1736 xy++;
1737 }
1738 }
1739 }