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
40
43 #define P_TOPRIGHT P[3]
46
47 #define ME_MAP_SHIFT 3
48 #define ME_MAP_MV_BITS 11
49
51 int *mx_ptr, int *my_ptr, int dmin,
52 int src_index, int ref_index,
54
56 {
58 if(
c->map_generation==0){
61 }
62 return c->map_generation;
63 }
64
65 /* shape adaptive search stuff */
71
75
77 }
78
79 #define FLAG_QPEL 1 //must be 1
82
86 ((y*
c->uvstride + x)>>1),
87 ((y*
c->uvstride + x)>>1),
88 };
93 }
94 if(ref_index){
97 }
98 }
99 }
100
105 }
106
108 const int size,
const int h,
int ref_index,
int src_index,
112 const int hx = subx + x * (1 << (1 + qpel));
113 const int hy = suby + y * (1 << (1 + qpel));
114 uint8_t *
const *
const ref=
c->ref[ref_index];
115 uint8_t *
const *
const src=
c->src[src_index];
117 //FIXME check chroma 4mv, (no crashes ...)
118 av_assert2(x >=
c->xmin && hx <= c->xmax<<(qpel+1) && y >=
c->ymin && hy <= c->ymax<<(qpel+1));
119 if(x >=
c->xmin && hx <= c->xmax<<(qpel+1) && y >=
c->ymin && hy <= c->ymax<<(qpel+1)){
120 const int time_pp=
s->pp_time;
121 const int time_pb=
s->pb_time;
122 const int mask= 2*qpel+1;
126 int fx =
c->direct_basis_mv[
i][0] + hx;
127 int fy =
c->direct_basis_mv[
i][1] + hy;
128 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));
129 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));
130 int fxy= (fx&
mask) + ((fy&
mask)<<(qpel+1));
131 int bxy= (bx&
mask) + ((by&
mask)<<(qpel+1));
132
133 uint8_t *dst=
c->temp + 8*(
i&1) + 8*
stride*(
i>>1);
134 if(qpel){
137 }else{
140 }
141 }
142 }else{
143 int fx =
c->direct_basis_mv[0][0] + hx;
144 int fy =
c->direct_basis_mv[0][1] + hy;
145 int bx = hx ? fx -
c->co_located_mv[0][0] : (
c->co_located_mv[0][0]*(time_pb - time_pp)/time_pp);
146 int by = hy ? fy -
c->co_located_mv[0][1] : (
c->co_located_mv[0][1]*(time_pb - time_pp)/time_pp);
147 int fxy= (fx&
mask) + ((fy&
mask)<<(qpel+1));
148 int bxy= (bx&
mask) + ((by&
mask)<<(qpel+1));
149
150 if(qpel){
152 c->qpel_put[1][fxy](
c->temp + 8 ,
ref[0] + (fx>>2) + (fy>>2)*
stride + 8 ,
stride);
156 c->qpel_avg[1][bxy](
c->temp + 8 ,
ref[8] + (bx>>2) + (by>>2)*
stride + 8 ,
stride);
159 }else{
168
171 }
172 }
174 }else
177 }
178
180 const int size,
const int h,
int ref_index,
int src_index,
184 const int uvstride=
c->uvstride;
185 const int dxy= subx + (suby<<(1+qpel)); //FIXME log2_subpel?
186 const int hx= subx + x*(1<<(1+qpel));
187 const int hy= suby + y*(1<<(1+qpel));
188 uint8_t *
const *
const ref=
c->ref[ref_index];
189 uint8_t *
const *
const src=
c->src[src_index];
191 //FIXME check chroma 4mv, (no crashes ...)
192 int uvdxy; /* no, it might not be used uninitialized */
193 if(dxy){
194 if(qpel){
195 if (
h <<
size == 16) {
197 }
else if (
size == 0 &&
h == 8) {
200 } else
203 int cx= hx/2;
204 int cy= hy/2;
205 cx= (cx>>1)|(cx&1);
206 cy= (cy>>1)|(cy&1);
207 uvdxy= (cx&1) + 2*(cy&1);
208 // 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
209 }
210 }else{
213 uvdxy= dxy | (x&1) | (2*(y&1));
214 }
216 }else{
219 uvdxy= (x&1) + 2*(y&1);
220 }
222 uint8_t *
const uvtemp=
c->temp + 16*
stride;
223 c->hpel_put[
size+1][uvdxy](uvtemp ,
ref[1] + (x>>1) + (y>>1)*uvstride, uvstride,
h>>1);
224 c->hpel_put[
size+1][uvdxy](uvtemp+8,
ref[2] + (x>>1) + (y>>1)*uvstride, uvstride,
h>>1);
225 d += chroma_cmp_func(
s, uvtemp ,
src[1], uvstride,
h>>1);
226 d += chroma_cmp_func(
s, uvtemp+8,
src[2], uvstride,
h>>1);
227 }
229 }
230
232 int ref_index, int src_index,
234 return cmp_inline(
s,x,y,0,0,0,16,ref_index,src_index,
cmp_func, chroma_cmp_func, 0, 0);
235 }
236
238 const int size,
const int h,
int ref_index,
int src_index,
241 return cmp_direct_inline(
s,x,y,0,0,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func,
flags&
FLAG_QPEL);
242 }else{
243 return cmp_inline(
s,x,y,0,0,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 0,
flags&
FLAG_CHROMA);
244 }
245 }
246
248 const int size,
const int h,
int ref_index,
int src_index,
251 return cmp_direct_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func,
flags&
FLAG_QPEL);
252 }else{
253 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);
254 }
255 }
256
257 /** @brief compares a block (either a full macroblock or a partition thereof)
258 against a proposed motion-compensated prediction of that block
259 */
261 const int size,
const int h,
int ref_index,
int src_index,
265 &&
flags==0 &&
h==16 &&
size==0 && subx==0 && suby==0){
268 && subx==0 && suby==0){
270 }else{
271 return cmp_internal(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func,
flags);
272 }
273 }
274
276 const int size,
const int h,
int ref_index,
int src_index,
279 return cmp_direct_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 0);
280 }else{
281 return cmp_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 0,
flags&
FLAG_CHROMA);
282 }
283 }
284
286 const int size,
const int h,
int ref_index,
int src_index,
289 return cmp_direct_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 1);
290 }else{
291 return cmp_inline(
s,x,y,subx,suby,
size,
h,ref_index,src_index,
cmp_func, chroma_cmp_func, 1,
flags&
FLAG_CHROMA);
292 }
293 }
294
296
299 {
300 return 0;
301 }
302
304 }
305
309 int dia_size=
FFMAX(
FFABS(
s->avctx->dia_size)&255,
FFABS(
s->avctx->pre_dia_size)&255);
310
313 return -1;
314 }
315
317
319 c->avctx->me_sub_cmp =
c->avctx->me_cmp;
320
321 if(cache_size < 2*dia_size && !c->
stride){
322 av_log(
s->avctx,
AV_LOG_INFO,
"ME_MAP size may be a little small for the selected diamond size\n");
323 }
324
325 ff_set_cmp(&
s->mecc,
s->mecc.me_pre_cmp,
c->avctx->me_pre_cmp);
327 ff_set_cmp(&
s->mecc,
s->mecc.me_sub_cmp,
c->avctx->me_sub_cmp);
329
333
334 /*FIXME s->no_rounding b_type*/
337 c->qpel_avg =
s->qdsp.avg_qpel_pixels_tab;
339 c->qpel_put =
s->qdsp.put_no_rnd_qpel_pixels_tab;
340 else
341 c->qpel_put =
s->qdsp.put_qpel_pixels_tab;
342 }else{
349 else
351 }
352 c->hpel_avg =
s->hdsp.avg_pixels_tab;
354 c->hpel_put =
s->hdsp.put_no_rnd_pixels_tab;
355 else
356 c->hpel_put =
s->hdsp.put_pixels_tab;
357
359 c->stride =
s->linesize;
360 c->uvstride=
s->uvlinesize;
361 }else{
362 c->stride = 16*
s->mb_width + 32;
363 c->uvstride= 8*
s->mb_width + 16;
364 }
365
366 /* 8x8 fullpel search would need a 4x4 chroma compare, which we do
367 * not have yet, and even if we had, the motion estimation code
368 * does not expect it. */
370 if ((
c->avctx->me_cmp &
FF_CMP_CHROMA)
/* && !s->mecc.me_cmp[2] */)
374 c->hpel_put[2][0]=
c->hpel_put[2][1]=
376 }
377
380 }
381
382 return 0;
383 }
384
385 #define CHECK_SAD_HALF_MV(suffix, x, y) \
386 {\
387 d = s->mecc.pix_abs[size][(x ? 1 : 0) + (y ? 2 : 0)](NULL, pix, ptr + ((x) >> 1), stride, h); \
388 d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\
389 COPY3_IF_LT(dminh, d, dx, x, dy, y)\
390 }
391
393 int *mx_ptr, int *my_ptr, int dmin,
394 int src_index, int ref_index,
396 {
398 const int penalty_factor=
c->sub_penalty_factor;
399 int mx, my, dminh;
400 uint8_t *pix, *ptr;
403
405
407 *mx_ptr = 0;
408 *my_ptr = 0;
409 return dmin;
410 }
411
412 pix =
c->src[src_index][0];
413
414 mx = *mx_ptr;
415 my = *my_ptr;
416 ptr =
c->ref[ref_index][0] + (my *
stride) + mx;
417
418 dminh = dmin;
419
420 if (mx > xmin && mx < xmax &&
421 my > ymin && my < ymax) {
422 int dx=0, dy=0;
429 mx += mx;
430 my += my;
431
432
433 pen_x= pred_x + mx;
434 pen_y= pred_y + my;
435
444 }else{
447 }
449 }else{
454 }else{
457 }
459 }
460 }else{
465 }else{
468 }
471 }else{
475 }else{
478 }
481 }
483 }
484 mx+=dx;
485 my+=dy;
486
487 }else{
488 mx += mx;
489 my += my;
490 }
491
492 *mx_ptr = mx;
493 *my_ptr = my;
494 return dminh;
495 }
496
498 {
499 const int xy=
s->mb_x +
s->mb_y*
s->mb_stride;
500
501 s->p_mv_table[xy][0] = mx;
502 s->p_mv_table[xy][1] = my;
503
504 /* has already been set to the 4 MV if 4MV is done */
505 if(mv4){
506 int mot_xy=
s->block_index[0];
507
508 s->current_picture.motion_val[0][mot_xy ][0] = mx;
509 s->current_picture.motion_val[0][mot_xy ][1] = my;
510 s->current_picture.motion_val[0][mot_xy + 1][0] = mx;
511 s->current_picture.motion_val[0][mot_xy + 1][1] = my;
512
513 mot_xy +=
s->b8_stride;
514 s->current_picture.motion_val[0][mot_xy ][0] = mx;
515 s->current_picture.motion_val[0][mot_xy ][1] = my;
516 s->current_picture.motion_val[0][mot_xy + 1][0] = mx;
517 s->current_picture.motion_val[0][mot_xy + 1][1] = my;
518 }
519 }
520
521 /**
522 * get fullpel ME search limits.
523 */
525 {
527 int range=
c->avctx->me_range >> (1 + !!(
c->flags&
FLAG_QPEL));
529 /*
530 if(c->avctx->me_range) c->range= c->avctx->me_range >> 1;
531 else c->range= 16;
532 */
533 if (
s->unrestricted_mv) {
536 c->xmax = - x +
s->width;
537 c->ymax = - y +
s->height;
539 // Search range of H.261 is different from other codec standards
540 c->xmin = (x > 15) ? - 15 : 0;
541 c->ymin = (y > 15) ? - 15 : 0;
542 c->xmax = (x <
s->mb_width * 16 - 16) ? 15 : 0;
543 c->ymax = (y <
s->mb_height * 16 - 16) ? 15 : 0;
544 } else {
547 c->xmax = - x +
s->mb_width *16 - 16;
548 c->ymax = - y +
s->mb_height*16 - 16;
549 }
550 if(!range || range > max_range)
551 range = max_range;
552 if(range){
553 c->xmin =
FFMAX(
c->xmin,-range);
554 c->xmax =
FFMIN(
c->xmax, range);
555 c->ymin =
FFMAX(
c->ymin,-range);
556 c->ymax =
FFMIN(
c->ymax, range);
557 }
558 }
559
562
563 c->ref[1][0] =
c->ref[0][0] + 8;
564 c->ref[2][0] =
c->ref[0][0] + 8*
stride;
565 c->ref[3][0] =
c->ref[2][0] + 8;
566 c->src[1][0] =
c->src[0][0] + 8;
567 c->src[2][0] =
c->src[0][0] + 8*
stride;
568 c->src[3][0] =
c->src[2][0] + 8;
569 }
570
572 {
578 int dmin_sum=0, mx4_sum=0, my4_sum=0,
i;
579 int same=1;
582 int safety_clipping=
s->unrestricted_mv && (
s->width&15) && (
s->height&15);
583
585
587 int mx4, my4;
588 int pred_x4, pred_y4;
589 int dmin4;
590 static const int off[4]= {2, 1, 1, -1};
591 const int mot_stride =
s->b8_stride;
592 const int mot_xy =
s->block_index[
block];
593
594 if(safety_clipping){
595 c->xmax = - 16*
s->mb_x +
s->width - 8*(
block &1);
596 c->ymax = - 16*
s->mb_y +
s->height - 8*(
block>>1);
597 }
598
599 P_LEFT[0] =
s->current_picture.motion_val[0][mot_xy - 1][0];
600 P_LEFT[1] =
s->current_picture.motion_val[0][mot_xy - 1][1];
601
603
604 /* special case for first line */
605 if (
s->first_slice_line &&
block<2) {
608 } else {
609 P_TOP[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][0];
610 P_TOP[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][1];
611 P_TOPRIGHT[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride + off[
block]][0];
612 P_TOPRIGHT[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride + off[
block]][1];
617
620
623 }
626 if(safety_clipping)
628 if (
s->first_slice_line && block<2 && i>1 &&
i<9)
629 continue;
631 continue;
634 }
635
637
639
640 if (
s->mecc.me_sub_cmp[0] !=
s->mecc.mb_cmp[0]) {
641 int dxy;
643 uint8_t *dest_y =
c->scratchpad +
offset;
644 if(
s->quarter_sample){
646 dxy = ((my4 & 3) << 2) | (mx4 & 3);
647
649 s->qdsp.put_no_rnd_qpel_pixels_tab[1][dxy](dest_y,
ref,
stride);
650 else
651 s->qdsp.put_qpel_pixels_tab[1][dxy](dest_y,
ref,
stride);
652 }else{
654 dxy = ((my4 & 1) << 1) | (mx4 & 1);
655
657 s->hdsp.put_no_rnd_pixels_tab[1][dxy](dest_y ,
ref ,
stride,
h);
658 else
659 s->hdsp.put_pixels_tab [1][dxy](dest_y ,
ref ,
stride,
h);
660 }
662 }else
663 dmin_sum+= dmin4;
664
665 if(
s->quarter_sample){
666 mx4_sum+= mx4/2;
667 my4_sum+= my4/2;
668 }else{
669 mx4_sum+= mx4;
670 my4_sum+= my4;
671 }
672
673 s->current_picture.motion_val[0][
s->block_index[
block]][0] = mx4;
674 s->current_picture.motion_val[0][
s->block_index[
block]][1] = my4;
675
676 if(mx4 != mx || my4 != my) same=0;
677 }
678
679 if(same)
680 return INT_MAX;
681
682 if (
s->mecc.me_sub_cmp[0] !=
s->mecc.mb_cmp[0]) {
683 dmin_sum +=
s->mecc.mb_cmp[0](
s,
684 s->new_picture.f->data[0] +
685 s->mb_x * 16 +
s->mb_y * 16 *
stride,
687 }
688
690 int dxy;
691 int mx, my;
693
696 dxy = ((my & 1) << 1) | (mx & 1);
697
698 offset= (
s->mb_x*8 + (mx>>1)) + (
s->mb_y*8 + (my>>1))*
s->uvlinesize;
699
701 s->hdsp.put_no_rnd_pixels_tab[1][dxy](
c->scratchpad ,
s->last_picture.f->data[1] +
offset,
s->uvlinesize, 8);
702 s->hdsp.put_no_rnd_pixels_tab[1][dxy](
c->scratchpad + 8,
s->last_picture.f->data[2] +
offset,
s->uvlinesize, 8);
703 }else{
704 s->hdsp.put_pixels_tab [1][dxy](
c->scratchpad ,
s->last_picture.f->data[1] +
offset,
s->uvlinesize, 8);
705 s->hdsp.put_pixels_tab [1][dxy](
c->scratchpad + 8,
s->last_picture.f->data[2] +
offset,
s->uvlinesize, 8);
706 }
707
708 dmin_sum +=
s->mecc.mb_cmp[1](
s,
s->new_picture.f->data[1] +
s->mb_x * 8 +
s->mb_y * 8 *
s->uvlinesize,
c->scratchpad,
s->uvlinesize, 8);
709 dmin_sum +=
s->mecc.mb_cmp[1](
s,
s->new_picture.f->data[2] +
s->mb_x * 8 +
s->mb_y * 8 *
s->uvlinesize,
c->scratchpad + 8,
s->uvlinesize, 8);
710 }
711
714
715 switch(
c->avctx->mb_cmp&0xFF){
716 /*case FF_CMP_SSE:
717 return dmin_sum+ 32*s->qscale*s->qscale;*/
719 return dmin_sum;
720 default:
721 return dmin_sum+ 11*
c->mb_penalty_factor;
722 }
723 }
724
727
728 c->ref[1+ref_index][0] =
c->ref[0+ref_index][0] +
s->linesize;
729 c->src[1][0] =
c->src[0][0] +
s->linesize;
731 c->ref[1+ref_index][1] =
c->ref[0+ref_index][1] +
s->uvlinesize;
732 c->ref[1+ref_index][2] =
c->ref[0+ref_index][2] +
s->uvlinesize;
733 c->src[1][1] =
c->src[0][1] +
s->uvlinesize;
734 c->src[1][2] =
c->src[0][2] +
s->uvlinesize;
735 }
736 }
737
739 int16_t (*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)
740 {
746 const uint8_t *
const mv_penalty =
c->current_mv_penalty;
747 int same=1;
748 const int stride= 2*
s->linesize;
749 int dmin_sum= 0;
750 const int mot_stride=
s->mb_stride;
751 const int xy=
s->mb_x +
s->mb_y*mot_stride;
752
758
760 int field_select;
761 int best_dmin= INT_MAX;
762 int best_field= -1;
763
764 for(field_select=0; field_select<2; field_select++){
765 int dmin, mx_i, my_i;
766 int16_t (*mv_table)[2]= mv_tables[
block][field_select];
767
768 if(user_field_select){
769 av_assert1(field_select==0 || field_select==1);
771 if(field_select_tables[
block][xy] != field_select)
772 continue;
773 }
774
775 P_LEFT[0] = mv_table[xy - 1][0];
776 P_LEFT[1] = mv_table[xy - 1][1];
778
781
782 if(!
s->first_slice_line){
783 P_TOP[0] = mv_table[xy - mot_stride][0];
784 P_TOP[1] = mv_table[xy - mot_stride][1];
785 P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];
786 P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];
791
794 }
795 P_MV1[0]= mx;
//FIXME not correct if block != field_select
797
799
800 dmin=
c->sub_motion_search(
s, &mx_i, &my_i, dmin,
block, field_select+ref_index,
size,
h);
801
802 mv_table[xy][0]= mx_i;
803 mv_table[xy][1]= my_i;
804
805 if (
s->mecc.me_sub_cmp[0] !=
s->mecc.mb_cmp[0]) {
806 int dxy;
807
808 //FIXME chroma ME
809 uint8_t *
ref=
c->ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*
stride;
810 dxy = ((my_i & 1) << 1) | (mx_i & 1);
811
814 }else{
816 }
819 }else
820 dmin+=
c->mb_penalty_factor;
//field_select bits
821
822 dmin += field_select !=
block;
//slightly prefer same field
823
824 if(dmin < best_dmin){
825 best_dmin= dmin;
826 best_field= field_select;
827 }
828 }
829 {
830 int16_t (*mv_table)[2]= mv_tables[
block][best_field];
831
832 if(mv_table[xy][0] != mx) same=0; //FIXME check if these checks work and are any good at all
833 if(mv_table[xy][1]&1) same=0;
834 if(mv_table[xy][1]*2 != my) same=0;
835 if(best_field !=
block) same=0;
836 }
837
838 field_select_tables[
block][xy]= best_field;
839 dmin_sum += best_dmin;
840 }
841
846
847 if(same)
848 return INT_MAX;
849
850 switch(
c->avctx->mb_cmp&0xFF){
851 /*case FF_CMP_SSE:
852 return dmin_sum+ 32*s->qscale*s->qscale;*/
854 return dmin_sum;
855 default:
856 return dmin_sum+ 11*
c->mb_penalty_factor;
857 }
858 }
859
862 default:
881 return 1;
882 }
883 }
884
886 int mb_x, int mb_y)
887 {
889 uint8_t *pix, *ppix;
890 int sum, mx = 0, my = 0, dmin = 0;
891 int varc; ///< the variance of the block (sum of squared (p[y][x]-average))
892 int vard; ///< sum of squared differences with the estimated motion vector
894 const int shift= 1+
s->quarter_sample;
895 int mb_type=0;
896 Picture *
const pic= &
s->current_picture;
897
898 init_ref(
c,
s->new_picture.f->data,
s->last_picture.f->data,
NULL, 16*mb_x, 16*mb_y, 0);
899
900 av_assert0(
s->quarter_sample==0 ||
s->quarter_sample==1);
903
907 c->current_mv_penalty=
c->mv_penalty[
s->f_code] +
MAX_DMV;
908
911
912 /* intra / predictive decision */
914 sum =
s->mpvencdsp.pix_sum(pix,
s->linesize);
915 varc =
s->mpvencdsp.pix_norm1(pix,
s->linesize) -
916 (((unsigned) sum * sum) >> 8) + 500;
917
918 pic->
mb_mean[
s->mb_stride * mb_y + mb_x] = (sum+128)>>8;
919 pic->
mb_var [
s->mb_stride * mb_y + mb_x] = (varc+128)>>8;
920 c->mb_var_sum_temp += (varc+128)>>8;
921
923 const int mot_stride =
s->b8_stride;
924 const int mot_xy =
s->block_index[0];
925
926 P_LEFT[0] =
s->current_picture.motion_val[0][mot_xy - 1][0];
927 P_LEFT[1] =
s->current_picture.motion_val[0][mot_xy - 1][1];
928
931
932 if (!
s->first_slice_line) {
933 P_TOP[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][0];
934 P_TOP[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride ][1];
935 P_TOPRIGHT[0] =
s->current_picture.motion_val[0][mot_xy - mot_stride + 2][0];
936 P_TOPRIGHT[1] =
s->current_picture.motion_val[0][mot_xy - mot_stride + 2][1];
943
946
950 } else { /* MPEG-1 at least */
953 }
954 } else {
957 }
959 }
960
961 /* At this point (mx,my) are full-pell and the relative displacement */
962 ppix =
c->ref[0][0] + (my *
s->linesize) + mx;
963
964 vard =
s->mecc.sse[0](
NULL, pix, ppix,
s->linesize, 16);
965
966 pic->
mc_mb_var[
s->mb_stride * mb_y + mb_x] = (vard+128)>>8;
967 c->mc_mb_var_sum_temp += (vard+128)>>8;
968
973
974 if (vard*2 + 200*256 > varc && !
s->intra_penalty)
976 if (varc*2 + 200*256 > vard ||
s->qscale > 24){
977 // if (varc*2 + 200*256 + 50*(s->lambda2>>FF_LAMBDA_SHIFT) > vard){
979 c->sub_motion_search(
s, &mx, &my, dmin, 0, 0, 0, 16);
981 if(mx || my)
983 }else{
986 }
988 && !
c->skip && varc>50<<8 && vard>10<<8){
991
993 }else
996 && !
c->skip){
//FIXME varc/d checks
999 }
1000 }else{
1003
1004 dmin=
c->sub_motion_search(
s, &mx, &my, dmin, 0, 0, 0, 16);
1005 if(
c->avctx->me_sub_cmp !=
c->avctx->mb_cmp && !
c->skip)
1007
1009 && !
c->skip && varc>50<<8 && vard>10<<8){
1011 if(dmin4 < dmin){
1013 dmin=dmin4;
1014 }
1015 }
1017 && !
c->skip){
//FIXME varc/d checks
1019 if(dmin_i < dmin){
1021 dmin= dmin_i;
1022 }
1023 }
1024
1026
1027 /* get intra luma score */
1029 intra_score= varc - 500;
1030 }else{
1031 unsigned mean = (sum+128)>>8;
1033
1034 for(
i=0;
i<16;
i++){
1035 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+ 0]) =
mean;
1036 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+ 4]) =
mean;
1037 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+ 8]) =
mean;
1038 *(uint32_t*)(&
c->scratchpad[
i*
s->linesize+12]) =
mean;
1039 }
1040
1041 intra_score=
s->mecc.mb_cmp[0](
s,
c->scratchpad, pix,
s->linesize, 16);
1042 }
1043 intra_score +=
c->mb_penalty_factor*16 +
s->intra_penalty;
1044
1045 if(intra_score < dmin){
1048 }else
1049 s->current_picture.mb_type[mb_y*
s->mb_stride + mb_x] = 0;
1050
1051 {
1055 }
1056 }
1057
1058 s->mb_type[mb_y*
s->mb_stride + mb_x]= mb_type;
1059 }
1060
1062 int mb_x, int mb_y)
1063 {
1065 int mx, my, dmin;
1067 const int shift= 1+
s->quarter_sample;
1068 const int xy= mb_x + mb_y*
s->mb_stride;
1069 init_ref(
c,
s->new_picture.f->data,
s->last_picture.f->data,
NULL, 16*mb_x, 16*mb_y, 0);
1070
1071 av_assert0(
s->quarter_sample==0 ||
s->quarter_sample==1);
1072
1074 c->current_mv_penalty=
c->mv_penalty[
s->f_code] +
MAX_DMV;
1075
1078
1079 P_LEFT[0] =
s->p_mv_table[xy + 1][0];
1080 P_LEFT[1] =
s->p_mv_table[xy + 1][1];
1081
1083
1084 /* special case for first line */
1085 if (
s->first_slice_line) {
1090 } else {
1091 P_TOP[0] =
s->p_mv_table[xy +
s->mb_stride ][0];
1092 P_TOP[1] =
s->p_mv_table[xy +
s->mb_stride ][1];
1093 P_TOPRIGHT[0] =
s->p_mv_table[xy +
s->mb_stride - 1][0];
1094 P_TOPRIGHT[1] =
s->p_mv_table[xy +
s->mb_stride - 1][1];
1098
1101
1104 }
1105
1107
1108 s->p_mv_table[xy][0] = mx<<
shift;
1109 s->p_mv_table[xy][1] = my<<
shift;
1110
1111 return dmin;
1112 }
1113
1115 int16_t (*mv_table)[2], int ref_index, int f_code)
1116 {
1118 int mx = 0, my = 0, dmin = 0;
1120 const int shift= 1+
s->quarter_sample;
1121 const int mot_stride =
s->mb_stride;
1122 const int mot_xy = mb_y*mot_stride + mb_x;
1125
1130
1132
1134 P_LEFT[0] = mv_table[mot_xy - 1][0];
1135 P_LEFT[1] = mv_table[mot_xy - 1][1];
1136
1138
1139 /* special case for first line */
1140 if (!
s->first_slice_line) {
1141 P_TOP[0] = mv_table[mot_xy - mot_stride ][0];
1142 P_TOP[1] = mv_table[mot_xy - mot_stride ][1];
1143 P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1][0];
1144 P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1][1];
1148
1151 }
1154
1155 if(mv_table ==
s->b_forw_mv_table){
1157 }else{
1159 }
1160
1162 }
1163
1164 dmin=
c->sub_motion_search(
s, &mx, &my, dmin, 0, ref_index, 0, 16);
1165
1166 if(
c->avctx->me_sub_cmp !=
c->avctx->mb_cmp && !
c->skip)
1168
1169 // s->mb_type[mb_y*s->mb_width + mb_x]= mb_type;
1170 mv_table[mot_xy][0]= mx;
1171 mv_table[mot_xy][1]= my;
1172
1173 return dmin;
1174 }
1175
1177 int motion_fx, int motion_fy,
1178 int motion_bx, int motion_by,
1179 int pred_fx, int pred_fy,
1180 int pred_bx, int pred_by,
1182 {
1183 //FIXME optimize?
1184 //FIXME better f_code prediction (max mv & distance)
1185 //FIXME pointers
1187 const uint8_t *
const mv_penalty_f =
c->mv_penalty[
s->f_code] +
MAX_DMV;
// f_code of the prev frame
1188 const uint8_t *
const mv_penalty_b =
c->mv_penalty[
s->b_code] +
MAX_DMV;
// f_code of the prev frame
1190 uint8_t *dest_y =
c->scratchpad;
1191 uint8_t *ptr;
1192 int dxy;
1193 int src_x, src_y;
1194 int fbmin;
1195 uint8_t **src_data=
c->src[0];
1196 uint8_t **ref_data=
c->ref[0];
1197 uint8_t **ref2_data=
c->ref[2];
1198
1199 if(
s->quarter_sample){
1200 dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);
1201 src_x = motion_fx >> 2;
1202 src_y = motion_fy >> 2;
1203
1204 ptr = ref_data[0] + (src_y *
stride) + src_x;
1205 s->qdsp.put_qpel_pixels_tab[0][dxy](dest_y, ptr,
stride);
1206
1207 dxy = ((motion_by & 3) << 2) | (motion_bx & 3);
1208 src_x = motion_bx >> 2;
1209 src_y = motion_by >> 2;
1210
1211 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1212 s->qdsp.avg_qpel_pixels_tab[
size][dxy](dest_y, ptr,
stride);
1213 }else{
1214 dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);
1215 src_x = motion_fx >> 1;
1216 src_y = motion_fy >> 1;
1217
1218 ptr = ref_data[0] + (src_y *
stride) + src_x;
1219 s->hdsp.put_pixels_tab[
size][dxy](dest_y , ptr ,
stride,
h);
1220
1221 dxy = ((motion_by & 1) << 1) | (motion_bx & 1);
1222 src_x = motion_bx >> 1;
1223 src_y = motion_by >> 1;
1224
1225 ptr = ref2_data[0] + (src_y *
stride) + src_x;
1226 s->hdsp.avg_pixels_tab[
size][dxy](dest_y , ptr ,
stride,
h);
1227 }
1228
1229 fbmin = (mv_penalty_f[motion_fx-pred_fx] + mv_penalty_f[motion_fy-pred_fy])*
c->mb_penalty_factor
1230 +(mv_penalty_b[motion_bx-pred_bx] + mv_penalty_b[motion_by-pred_by])*
c->mb_penalty_factor
1231 +
s->mecc.mb_cmp[
size](
s, src_data[0], dest_y,
stride,
h);
// FIXME new_pic
1232
1234 }
1235 //FIXME CHROMA !!!
1236
1237 return fbmin;
1238 }
1239
1240 /* refine the bidir vectors in hq mode and return the score in both lq & hq mode*/
1242 {
1244 const int mot_stride =
s->mb_stride;
1245 const int xy = mb_y *mot_stride + mb_x;
1246 int fbmin;
1247 int pred_fx=
s->b_bidir_forw_mv_table[xy-1][0];
1248 int pred_fy=
s->b_bidir_forw_mv_table[xy-1][1];
1249 int pred_bx=
s->b_bidir_back_mv_table[xy-1][0];
1250 int pred_by=
s->b_bidir_back_mv_table[xy-1][1];
1251 int motion_fx=
s->b_bidir_forw_mv_table[xy][0]=
s->b_forw_mv_table[xy][0];
1252 int motion_fy=
s->b_bidir_forw_mv_table[xy][1]=
s->b_forw_mv_table[xy][1];
1253 int motion_bx=
s->b_bidir_back_mv_table[xy][0]=
s->b_back_mv_table[xy][0];
1254 int motion_by=
s->b_bidir_back_mv_table[xy][1]=
s->b_back_mv_table[xy][1];
1255 const int flags=
c->sub_flags;
1257 const int shift= 1+qpel;
1258 const int xmin=
c->xmin * (1 <<
shift);
1259 const int ymin=
c->ymin * (1 <<
shift);
1260 const int xmax=
c->xmax<<
shift;
1261 const int ymax=
c->ymax<<
shift;
1262 #define HASH(fx,fy,bx,by) ((fx)+17*(fy)+63*(bx)+117*(by))
1263 #define HASH8(fx,fy,bx,by) ((uint8_t)HASH(fx,fy,bx,by))
1264 int hashidx=
HASH(motion_fx,motion_fy, motion_bx, motion_by);
1265 uint8_t
map[256] = { 0 };
1266
1267 map[hashidx&255] = 1;
1268
1270 motion_bx, motion_by,
1271 pred_fx, pred_fy,
1272 pred_bx, pred_by,
1273 0, 16);
1274
1275 if(
s->avctx->bidir_refine){
1276 int end;
1277 static const uint8_t limittab[5]={0,8,32,64,80};
1278 const int limit= limittab[
s->avctx->bidir_refine];
1279 static const int8_t vect[][4]={
1280 { 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},
1281
1282 { 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},
1283 { 0, 1, 0, 1}, { 0,-1, 0,-1}, { 1, 0, 1, 0}, {-1, 0,-1, 0},
1284 { 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},
1285 { 0,-1, 0, 1}, { 0, 1, 0,-1}, {-1, 0, 1, 0}, { 1, 0,-1, 0},
1286
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 { 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},
1291
1292 { 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}, {-1, 1, 1, 1}, { 1,-1,-1,-1},
1294 { 1, 1,-1,-1}, {-1,-1, 1, 1}, { 1,-1,-1, 1}, {-1, 1, 1,-1}, { 1,-1, 1,-1}, {-1, 1,-1, 1},
1295 };
1296 static const uint8_t
hash[]={
1297 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),
1298
1299 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),
1300 HASH8( 0, 1, 0, 1),
HASH8( 0,-1, 0,-1),
HASH8( 1, 0, 1, 0),
HASH8(-1, 0,-1, 0),
1301 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),
1302 HASH8( 0,-1, 0, 1),
HASH8( 0, 1, 0,-1),
HASH8(-1, 0, 1, 0),
HASH8( 1, 0,-1, 0),
1303
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 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),
1308
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),
HASH8(-1, 1, 1, 1),
HASH8( 1,-1,-1,-1),
1311 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),
1312 };
1313
1314 #define CHECK_BIDIR(fx,fy,bx,by)\
1315 if( !map[(hashidx+HASH(fx,fy,bx,by))&255]\
1316 &&(fx<=0 || motion_fx+fx<=xmax) && (fy<=0 || motion_fy+fy<=ymax) && (bx<=0 || motion_bx+bx<=xmax) && (by<=0 || motion_by+by<=ymax)\
1317 &&(fx>=0 || motion_fx+fx>=xmin) && (fy>=0 || motion_fy+fy>=ymin) && (bx>=0 || motion_bx+bx>=xmin) && (by>=0 || motion_by+by>=ymin)){\
1318 int score;\
1319 map[(hashidx+HASH(fx,fy,bx,by))&255] = 1;\
1320 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);\
1321 if(score < fbmin){\
1322 hashidx += HASH(fx,fy,bx,by);\
1323 fbmin= score;\
1324 motion_fx+=fx;\
1325 motion_fy+=fy;\
1326 motion_bx+=bx;\
1327 motion_by+=by;\
1328 end=0;\
1329 }\
1330 }
1331 #define CHECK_BIDIR2(a,b,c,d)\
1332 CHECK_BIDIR(a,b,c,d)\
1333 CHECK_BIDIR(-(a),-(b),-(c),-(d))
1334
1335 do{
1337 int borderdist=0;
1338 end=1;
1339
1344
1346 int fx= motion_fx+vect[
i][0];
1347 int fy= motion_fy+vect[
i][1];
1348 int bx= motion_bx+vect[
i][2];
1349 int by= motion_by+vect[
i][3];
1350 if(borderdist<=0){
1351 int a= (xmax -
FFMAX(fx,bx))|(
FFMIN(fx,bx) - xmin);
1352 int b= (ymax -
FFMAX(fy,by))|(
FFMIN(fy,by) - ymin);
1355 }
1357 int score;
1359 score=
check_bidir_mv(
s, fx, fy, bx, by, pred_fx, pred_fy, pred_bx, pred_by, 0, 16);
1360 if(score < fbmin){
1362 fbmin= score;
1363 motion_fx=fx;
1364 motion_fy=fy;
1365 motion_bx=bx;
1366 motion_by=by;
1367 end=0;
1368 borderdist--;
1369 if(borderdist<=0){
1373 }
1374 }
1375 }
1376 }
1377 }while(!end);
1378 }
1379
1380 s->b_bidir_forw_mv_table[xy][0]= motion_fx;
1381 s->b_bidir_forw_mv_table[xy][1]= motion_fy;
1382 s->b_bidir_back_mv_table[xy][0]= motion_bx;
1383 s->b_bidir_back_mv_table[xy][1]= motion_by;
1384
1385 return fbmin;
1386 }
1387
1389 {
1392 const int mot_stride =
s->mb_stride;
1393 const int mot_xy = mb_y*mot_stride + mb_x;
1394 const int shift= 1+
s->quarter_sample;
1396 const int time_pp=
s->pp_time;
1397 const int time_pb=
s->pb_time;
1398 int mx, my, xmin, xmax, ymin, ymax;
1399 int16_t (*mv_table)[2]=
s->b_direct_mv_table;
1400
1401 c->current_mv_penalty=
c->mv_penalty[1] +
MAX_DMV;
1402 ymin= xmin=(-32)>>
shift;
1403 ymax= xmax= 31>>
shift;
1404
1405 if (
IS_8X8(
s->next_picture.mb_type[mot_xy])) {
1407 }else{
1409 }
1410
1414
1415 c->co_located_mv[
i][0] =
s->next_picture.motion_val[0][
index][0];
1416 c->co_located_mv[
i][1] =
s->next_picture.motion_val[0][
index][1];
1417 c->direct_basis_mv[
i][0]=
c->co_located_mv[
i][0]*time_pb/time_pp + ((
i& 1)<<(
shift+3));
1418 c->direct_basis_mv[
i][1]=
c->co_located_mv[
i][1]*time_pb/time_pp + ((
i>>1)<<(
shift+3));
1419 // c->direct_basis_mv[1][i][0]= c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(shift+3);
1420 // c->direct_basis_mv[1][i][1]= c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(shift+3);
1421
1422 max=
FFMAX(
c->direct_basis_mv[
i][0],
c->direct_basis_mv[
i][0] -
c->co_located_mv[
i][0])>>
shift;
1423 min=
FFMIN(
c->direct_basis_mv[
i][0],
c->direct_basis_mv[
i][0] -
c->co_located_mv[
i][0])>>
shift;
1424 max+= 16*mb_x + 1;
// +-1 is for the simpler rounding
1428
1429 max=
FFMAX(
c->direct_basis_mv[
i][1],
c->direct_basis_mv[
i][1] -
c->co_located_mv[
i][1])>>
shift;
1430 min=
FFMIN(
c->direct_basis_mv[
i][1],
c->direct_basis_mv[
i][1] -
c->co_located_mv[
i][1])>>
shift;
1431 max+= 16*mb_y + 1;
// +-1 is for the simpler rounding
1435
1437 }
1438
1439 av_assert2(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);
1440
1441 if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){
1442 s->b_direct_mv_table[mot_xy][0]= 0;
1443 s->b_direct_mv_table[mot_xy][1]= 0;
1444
1445 return 256*256*256*64;
1446 }
1447
1456
1459
1460 /* special case for first line */
1461 if (!
s->first_slice_line) {
//FIXME maybe allow this over thread boundary as it is clipped
1466
1469 }
1470
1474 else
1476
1477 if(
c->avctx->me_sub_cmp !=
c->avctx->mb_cmp && !
c->skip)
1479
1480 get_limits(
s, 16*mb_x, 16*mb_y);
//restore c->?min/max, maybe not needed
1481
1482 mv_table[mot_xy][0]= mx;
1483 mv_table[mot_xy][1]= my;
1486
1487 return dmin;
1488 }
1489
1491 int mb_x, int mb_y)
1492 {
1494 const int penalty_factor=
c->mb_penalty_factor;
1495 int fmin, bmin, dmin, fbmin, bimin, fimin;
1497 const int xy = mb_y*
s->mb_stride + mb_x;
1498 init_ref(
c,
s->new_picture.f->data,
s->last_picture.f->data,
1499 s->next_picture.f->data, 16 * mb_x, 16 * mb_y, 2);
1500
1502
1504
1507
1508 score= ((unsigned)(score*score + 128*256))>>16;
1509 c->mc_mb_var_sum_temp += score;
1510 s->current_picture.mc_mb_var[mb_y*
s->mb_stride + mb_x] = score;
//FIXME use SSE
1512
1513 return;
1514 }
1515
1518 else
1519 dmin= INT_MAX;
1520 // FIXME penalty stuff for non-MPEG-4
1523 3 * penalty_factor;
1524
1527 2 * penalty_factor;
1528 ff_dlog(
s,
" %d %d ",
s->b_forw_mv_table[xy][0],
s->b_forw_mv_table[xy][1]);
1529
1533
1535 //FIXME mb type penalty
1537 c->current_mv_penalty=
c->mv_penalty[
s->f_code] +
MAX_DMV;
1539 s->b_field_mv_table[0],
s->b_field_select_table[0],
1540 s->b_forw_mv_table[xy][0],
s->b_forw_mv_table[xy][1], 0);
1541 c->current_mv_penalty=
c->mv_penalty[
s->b_code] +
MAX_DMV;
1543 s->b_field_mv_table[1],
s->b_field_select_table[1],
1544 s->b_back_mv_table[xy][0],
s->b_back_mv_table[xy][1], 0);
1545 }else
1546 fimin= bimin= INT_MAX;
1547
1548 {
1551
1552 if (dmin <= score){
1553 score = dmin;
1555 }
1556 if(bmin<score){
1557 score=bmin;
1559 }
1560 if(fbmin<score){
1561 score=fbmin;
1563 }
1564 if(fimin<score){
1565 score=fimin;
1567 }
1568 if(bimin<score){
1569 score=bimin;
1571 }
1572
1573 score= ((unsigned)(score*score + 128*256))>>16;
1574 c->mc_mb_var_sum_temp += score;
1575 s->current_picture.mc_mb_var[mb_y*
s->mb_stride + mb_x] = score;
//FIXME use SSE
1576 }
1577
1580 if(fimin < INT_MAX)
1582 if(bimin < INT_MAX)
1584 if(fimin < INT_MAX && bimin < INT_MAX){
1586 }
1587 //FIXME something smarter
1592 }
1593
1594 s->mb_type[mb_y*
s->mb_stride + mb_x]=
type;
1595 }
1596
1597 /* find best f_code for ME which do unlimited searches */
1599 {
1601 int score[8];
1602 int i, y, range=
s->avctx->me_range ?
s->avctx->me_range : (INT_MAX/2);
1604 int best_fcode=-1;
1605 int best_score=-10000000;
1606
1607 if(
s->msmpeg4_version)
1608 range=
FFMIN(range, 16);
1610 range=
FFMIN(range, 256);
1611
1612 for(
i=0;
i<8;
i++) score[
i]=
s->mb_num*(8-
i);
1613
1614 for(y=0; y<
s->mb_height; y++){
1615 int x;
1616 int xy= y*
s->mb_stride;
1617 for(x=0; x<
s->mb_width; x++, xy++){
1618 if(
s->mb_type[xy] &
type){
1619 int mx= mv_table[xy][0];
1620 int my= mv_table[xy][1];
1623 int j;
1624
1625 if (mx >= range || mx < -range ||
1626 my >= range || my < -range)
1627 continue;
1628
1629 for(j=0; j<fcode && j<8; j++){
1630 if(
s->pict_type==
AV_PICTURE_TYPE_B ||
s->current_picture.mc_mb_var[xy] <
s->current_picture.mb_var[xy])
1631 score[j]-= 170;
1632 }
1633 }
1634 }
1635 }
1636
1638 if(score[
i] > best_score){
1639 best_score= score[
i];
1641 }
1642 }
1643
1644 return best_fcode;
1645 }else{
1646 return 1;
1647 }
1648 }
1649
1651 {
1653 const int f_code=
s->f_code;
1654 int y, range;
1656
1657 range = (((
s->out_format ==
FMT_MPEG1 ||
s->msmpeg4_version) ? 8 : 16) << f_code);
1658
1659 av_assert0(range <= 16 || !s->msmpeg4_version);
1661
1662 if(
c->avctx->me_range && range >
c->avctx->me_range) range=
c->avctx->me_range;
1663
1665 const int wrap=
s->b8_stride;
1666
1667 /* clip / convert to intra 8x8 type MVs */
1668 for(y=0; y<
s->mb_height; y++){
1670 int i= y*
s->mb_stride;
1671 int x;
1672
1673 for(x=0; x<
s->mb_width; x++){
1678 int mx =
s->current_picture.motion_val[0][ xy + off ][0];
1679 int my =
s->current_picture.motion_val[0][ xy + off ][1];
1680
1681 if( mx >=range || mx <-range
1682 || my >=range || my <-range){
1685 s->current_picture.mb_type[
i] =
type;
1686 }
1687 }
1688 }
1689 xy+=2;
1691 }
1692 }
1693 }
1694 }
1695
1696 /**
1697 * @param truncate 1 for truncation, 0 for using intra
1698 */
1700 int16_t (*mv_table)[2],
int f_code,
int type,
int truncate)
1701 {
1703 int y, h_range, v_range;
1704
1705 // RAL: 8 in MPEG-1, 16 in MPEG-4
1706 int range = (((
s->out_format ==
FMT_MPEG1 ||
s->msmpeg4_version) ? 8 : 16) << f_code);
1707
1708 if(
c->avctx->me_range && range >
c->avctx->me_range) range=
c->avctx->me_range;
1709
1710 h_range= range;
1711 v_range= field_select_table ? range>>1 : range;
1712
1713 /* clip / convert to intra 16x16 type MVs */
1714 for(y=0; y<
s->mb_height; y++){
1715 int x;
1716 int xy= y*
s->mb_stride;
1717 for(x=0; x<
s->mb_width; x++){
1718 if (
s->mb_type[xy] &
type){
// RAL: "type" test added...
1719 if (!field_select_table || field_select_table[xy] == field_select) {
1720 if( mv_table[xy][0] >=h_range || mv_table[xy][0] <-h_range
1721 || mv_table[xy][1] >=v_range || mv_table[xy][1] <-v_range){
1722
1723 if(truncate){
1724 if (mv_table[xy][0] > h_range-1) mv_table[xy][0]= h_range-1;
1725 else if(mv_table[xy][0] < -h_range ) mv_table[xy][0]= -h_range;
1726 if (mv_table[xy][1] > v_range-1) mv_table[xy][1]= v_range-1;
1727 else if(mv_table[xy][1] < -v_range ) mv_table[xy][1]= -v_range;
1728 }else{
1729 s->mb_type[xy] &= ~
type;
1731 mv_table[xy][0]=
1732 mv_table[xy][1]= 0;
1733 }
1734 }
1735 }
1736 }
1737 xy++;
1738 }
1739 }
1740 }