Mercurial > libavcodec.hg
annotate motion_est.c @ 1528:ca634e47065c libavcodec
alignment 10l
author | michael |
---|---|
date | Mon, 13 Oct 2003 18:17:58 +0000 |
parents | 3ee63c12ea30 |
children | 932d306bf1dc |
rev | line source |
---|---|
0 | 1 /* |
2 * Motion estimation | |
429 | 3 * Copyright (c) 2000,2001 Fabrice Bellard. |
1011 | 4 * Copyright (c) 2002-2003 Michael Niedermayer |
0 | 5 * |
6 * | |
429 | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Lesser General Public | |
9 * License as published by the Free Software Foundation; either | |
10 * version 2 of the License, or (at your option) any later version. | |
0 | 11 * |
429 | 12 * This library is distributed in the hope that it will be useful, |
0 | 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
429 | 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
15 * Lesser General Public License for more details. | |
0 | 16 * |
429 | 17 * You should have received a copy of the GNU Lesser General Public |
18 * License along with this library; if not, write to the Free Software | |
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
20 * |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
21 * new Motion Estimation (X1/EPZS) by Michael Niedermayer <michaelni@gmx.at> |
0 | 22 */ |
1106 | 23 |
24 /** | |
25 * @file motion_est.c | |
26 * Motion estimation. | |
27 */ | |
28 | |
0 | 29 #include <stdlib.h> |
30 #include <stdio.h> | |
1426 | 31 #include <limits.h> |
0 | 32 #include "avcodec.h" |
33 #include "dsputil.h" | |
34 #include "mpegvideo.h" | |
35 | |
1422
efeed6e29f9b
oooooops, having 2 Eterms open and doing cvs diff in one and cvs commit in the other sucks, especially if they are in different directories (MPlayer/main/libavcodec vs. ffmpeg/libavcodec)
michaelni
parents:
1421
diff
changeset
|
36 //#undef NDEBUG |
efeed6e29f9b
oooooops, having 2 Eterms open and doing cvs diff in one and cvs commit in the other sucks, especially if they are in different directories (MPlayer/main/libavcodec vs. ffmpeg/libavcodec)
michaelni
parents:
1421
diff
changeset
|
37 //#include <assert.h> |
936 | 38 |
455 | 39 #define SQ(a) ((a)*(a)) |
284 | 40 |
455 | 41 #define P_LEFT P[1] |
42 #define P_TOP P[2] | |
43 #define P_TOPRIGHT P[3] | |
44 #define P_MEDIAN P[4] | |
45 #define P_MV1 P[9] | |
46 | |
936 | 47 static inline int sad_hpel_motion_search(MpegEncContext * s, |
48 int *mx_ptr, int *my_ptr, int dmin, | |
49 int xmin, int ymin, int xmax, int ymax, | |
50 int pred_x, int pred_y, Picture *picture, | |
1162 | 51 int n, int size, uint8_t * const mv_penalty); |
0 | 52 |
936 | 53 static inline int update_map_generation(MpegEncContext * s) |
54 { | |
55 s->me.map_generation+= 1<<(ME_MAP_MV_BITS*2); | |
56 if(s->me.map_generation==0){ | |
57 s->me.map_generation= 1<<(ME_MAP_MV_BITS*2); | |
58 memset(s->me.map, 0, sizeof(uint32_t)*ME_MAP_SIZE); | |
59 } | |
60 return s->me.map_generation; | |
61 } | |
62 | |
948 | 63 /* shape adaptive search stuff */ |
64 typedef struct Minima{ | |
65 int height; | |
66 int x, y; | |
67 int checked; | |
68 }Minima; | |
936 | 69 |
948 | 70 static int minima_cmp(const void *a, const void *b){ |
1057 | 71 const Minima *da = (const Minima *) a; |
72 const Minima *db = (const Minima *) b; | |
948 | 73 |
74 return da->height - db->height; | |
75 } | |
936 | 76 |
77 /* SIMPLE */ | |
78 #define RENAME(a) simple_ ## a | |
79 | |
80 #define CMP(d, x, y, size)\ | |
81 d = cmp(s, src_y, (ref_y) + (x) + (y)*(stride), stride); | |
82 | |
83 #define CMP_HPEL(d, dx, dy, x, y, size)\ | |
84 {\ | |
85 const int dxy= (dx) + 2*(dy);\ | |
86 hpel_put[0][dxy](s->me.scratchpad, (ref_y) + (x) + (y)*(stride), stride, (16>>size));\ | |
87 d = cmp_sub(s, s->me.scratchpad, src_y, stride);\ | |
88 } | |
89 | |
90 #define CMP_QPEL(d, dx, dy, x, y, size)\ | |
91 {\ | |
92 const int dxy= (dx) + 4*(dy);\ | |
93 qpel_put[0][dxy](s->me.scratchpad, (ref_y) + (x) + (y)*(stride), stride);\ | |
94 d = cmp_sub(s, s->me.scratchpad, src_y, stride);\ | |
95 } | |
96 | |
97 #include "motion_est_template.c" | |
98 #undef RENAME | |
99 #undef CMP | |
100 #undef CMP_HPEL | |
101 #undef CMP_QPEL | |
102 #undef INIT | |
103 | |
104 /* SIMPLE CHROMA */ | |
105 #define RENAME(a) simple_chroma_ ## a | |
106 | |
107 #define CMP(d, x, y, size)\ | |
108 d = cmp(s, src_y, (ref_y) + (x) + (y)*(stride), stride);\ | |
109 if(chroma_cmp){\ | |
110 int dxy= ((x)&1) + 2*((y)&1);\ | |
111 int c= ((x)>>1) + ((y)>>1)*uvstride;\ | |
112 \ | |
113 chroma_hpel_put[0][dxy](s->me.scratchpad, ref_u + c, uvstride, 8);\ | |
114 d += chroma_cmp(s, s->me.scratchpad, src_u, uvstride);\ | |
115 chroma_hpel_put[0][dxy](s->me.scratchpad, ref_v + c, uvstride, 8);\ | |
116 d += chroma_cmp(s, s->me.scratchpad, src_v, uvstride);\ | |
117 } | |
118 | |
119 #define CMP_HPEL(d, dx, dy, x, y, size)\ | |
120 {\ | |
121 const int dxy= (dx) + 2*(dy);\ | |
122 hpel_put[0][dxy](s->me.scratchpad, (ref_y) + (x) + (y)*(stride), stride, (16>>size));\ | |
123 d = cmp_sub(s, s->me.scratchpad, src_y, stride);\ | |
124 if(chroma_cmp_sub){\ | |
125 int cxy= (dxy) | ((x)&1) | (2*((y)&1));\ | |
126 int c= ((x)>>1) + ((y)>>1)*uvstride;\ | |
127 chroma_hpel_put[0][cxy](s->me.scratchpad, ref_u + c, uvstride, 8);\ | |
128 d += chroma_cmp_sub(s, s->me.scratchpad, src_u, uvstride);\ | |
129 chroma_hpel_put[0][cxy](s->me.scratchpad, ref_v + c, uvstride, 8);\ | |
130 d += chroma_cmp_sub(s, s->me.scratchpad, src_v, uvstride);\ | |
131 }\ | |
132 } | |
133 | |
134 #define CMP_QPEL(d, dx, dy, x, y, size)\ | |
135 {\ | |
136 const int dxy= (dx) + 4*(dy);\ | |
137 qpel_put[0][dxy](s->me.scratchpad, (ref_y) + (x) + (y)*(stride), stride);\ | |
138 d = cmp_sub(s, s->me.scratchpad, src_y, stride);\ | |
139 if(chroma_cmp_sub){\ | |
140 int cxy, c;\ | |
141 int cx= (4*(x) + (dx))/2;\ | |
142 int cy= (4*(y) + (dy))/2;\ | |
143 cx= (cx>>1)|(cx&1);\ | |
144 cy= (cy>>1)|(cy&1);\ | |
145 cxy= (cx&1) + 2*(cy&1);\ | |
146 c= ((cx)>>1) + ((cy)>>1)*uvstride;\ | |
147 chroma_hpel_put[0][cxy](s->me.scratchpad, ref_u + c, uvstride, 8);\ | |
148 d += chroma_cmp_sub(s, s->me.scratchpad, src_u, uvstride);\ | |
149 chroma_hpel_put[0][cxy](s->me.scratchpad, ref_v + c, uvstride, 8);\ | |
150 d += chroma_cmp_sub(s, s->me.scratchpad, src_v, uvstride);\ | |
151 }\ | |
152 } | |
153 | |
154 #include "motion_est_template.c" | |
155 #undef RENAME | |
156 #undef CMP | |
157 #undef CMP_HPEL | |
158 #undef CMP_QPEL | |
159 #undef INIT | |
160 | |
161 /* SIMPLE DIRECT HPEL */ | |
162 #define RENAME(a) simple_direct_hpel_ ## a | |
163 //FIXME precalc divisions stuff | |
164 | |
165 #define CMP_DIRECT(d, dx, dy, x, y, size, cmp_func)\ | |
166 if((x) >= xmin && 2*(x) + (dx) <= 2*xmax && (y) >= ymin && 2*(y) + (dy) <= 2*ymax){\ | |
167 const int hx= 2*(x) + (dx);\ | |
168 const int hy= 2*(y) + (dy);\ | |
169 if(s->mv_type==MV_TYPE_8X8){\ | |
170 int i;\ | |
171 for(i=0; i<4; i++){\ | |
172 int fx = s->me.direct_basis_mv[i][0] + hx;\ | |
173 int fy = s->me.direct_basis_mv[i][1] + hy;\ | |
174 int bx = hx ? fx - s->me.co_located_mv[i][0] : s->me.co_located_mv[i][0]*(time_pb - time_pp)/time_pp + (i &1)*16;\ | |
175 int by = hy ? fy - s->me.co_located_mv[i][1] : s->me.co_located_mv[i][1]*(time_pb - time_pp)/time_pp + (i>>1)*16;\ | |
176 int fxy= (fx&1) + 2*(fy&1);\ | |
177 int bxy= (bx&1) + 2*(by&1);\ | |
178 \ | |
179 uint8_t *dst= s->me.scratchpad + 8*(i&1) + 8*stride*(i>>1);\ | |
180 hpel_put[1][fxy](dst, (ref_y ) + (fx>>1) + (fy>>1)*(stride), stride, 8);\ | |
181 hpel_avg[1][bxy](dst, (ref2_y) + (bx>>1) + (by>>1)*(stride), stride, 8);\ | |
182 }\ | |
183 }else{\ | |
184 int fx = s->me.direct_basis_mv[0][0] + hx;\ | |
185 int fy = s->me.direct_basis_mv[0][1] + hy;\ | |
1050 | 186 int bx = hx ? fx - s->me.co_located_mv[0][0] : (s->me.co_located_mv[0][0]*(time_pb - time_pp)/time_pp);\ |
187 int by = hy ? fy - s->me.co_located_mv[0][1] : (s->me.co_located_mv[0][1]*(time_pb - time_pp)/time_pp);\ | |
936 | 188 int fxy= (fx&1) + 2*(fy&1);\ |
189 int bxy= (bx&1) + 2*(by&1);\ | |
1050 | 190 \ |
191 assert((fx>>1) + 16*s->mb_x >= -16);\ | |
192 assert((fy>>1) + 16*s->mb_y >= -16);\ | |
193 assert((fx>>1) + 16*s->mb_x <= s->width);\ | |
194 assert((fy>>1) + 16*s->mb_y <= s->height);\ | |
195 assert((bx>>1) + 16*s->mb_x >= -16);\ | |
196 assert((by>>1) + 16*s->mb_y >= -16);\ | |
197 assert((bx>>1) + 16*s->mb_x <= s->width);\ | |
198 assert((by>>1) + 16*s->mb_y <= s->height);\ | |
936 | 199 \ |
200 hpel_put[0][fxy](s->me.scratchpad, (ref_y ) + (fx>>1) + (fy>>1)*(stride), stride, 16);\ | |
201 hpel_avg[0][bxy](s->me.scratchpad, (ref2_y) + (bx>>1) + (by>>1)*(stride), stride, 16);\ | |
202 }\ | |
203 d = cmp_func(s, s->me.scratchpad, src_y, stride);\ | |
204 }else\ | |
205 d= 256*256*256*32; | |
206 | |
207 | |
208 #define CMP_HPEL(d, dx, dy, x, y, size)\ | |
209 CMP_DIRECT(d, dx, dy, x, y, size, cmp_sub) | |
210 | |
211 #define CMP(d, x, y, size)\ | |
212 CMP_DIRECT(d, 0, 0, x, y, size, cmp) | |
213 | |
214 #include "motion_est_template.c" | |
215 #undef RENAME | |
216 #undef CMP | |
217 #undef CMP_HPEL | |
218 #undef CMP_QPEL | |
219 #undef INIT | |
220 #undef CMP_DIRECT | |
221 | |
222 /* SIMPLE DIRECT QPEL */ | |
223 #define RENAME(a) simple_direct_qpel_ ## a | |
224 | |
225 #define CMP_DIRECT(d, dx, dy, x, y, size, cmp_func)\ | |
226 if((x) >= xmin && 4*(x) + (dx) <= 4*xmax && (y) >= ymin && 4*(y) + (dy) <= 4*ymax){\ | |
227 const int qx= 4*(x) + (dx);\ | |
228 const int qy= 4*(y) + (dy);\ | |
229 if(s->mv_type==MV_TYPE_8X8){\ | |
230 int i;\ | |
231 for(i=0; i<4; i++){\ | |
232 int fx = s->me.direct_basis_mv[i][0] + qx;\ | |
233 int fy = s->me.direct_basis_mv[i][1] + qy;\ | |
234 int bx = qx ? fx - s->me.co_located_mv[i][0] : s->me.co_located_mv[i][0]*(time_pb - time_pp)/time_pp + (i &1)*16;\ | |
235 int by = qy ? fy - s->me.co_located_mv[i][1] : s->me.co_located_mv[i][1]*(time_pb - time_pp)/time_pp + (i>>1)*16;\ | |
236 int fxy= (fx&3) + 4*(fy&3);\ | |
237 int bxy= (bx&3) + 4*(by&3);\ | |
238 \ | |
239 uint8_t *dst= s->me.scratchpad + 8*(i&1) + 8*stride*(i>>1);\ | |
240 qpel_put[1][fxy](dst, (ref_y ) + (fx>>2) + (fy>>2)*(stride), stride);\ | |
241 qpel_avg[1][bxy](dst, (ref2_y) + (bx>>2) + (by>>2)*(stride), stride);\ | |
242 }\ | |
243 }else{\ | |
244 int fx = s->me.direct_basis_mv[0][0] + qx;\ | |
245 int fy = s->me.direct_basis_mv[0][1] + qy;\ | |
246 int bx = qx ? fx - s->me.co_located_mv[0][0] : s->me.co_located_mv[0][0]*(time_pb - time_pp)/time_pp;\ | |
247 int by = qy ? fy - s->me.co_located_mv[0][1] : s->me.co_located_mv[0][1]*(time_pb - time_pp)/time_pp;\ | |
248 int fxy= (fx&3) + 4*(fy&3);\ | |
249 int bxy= (bx&3) + 4*(by&3);\ | |
250 \ | |
1053
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
251 qpel_put[1][fxy](s->me.scratchpad , (ref_y ) + (fx>>2) + (fy>>2)*(stride) , stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
252 qpel_put[1][fxy](s->me.scratchpad + 8 , (ref_y ) + (fx>>2) + (fy>>2)*(stride) + 8 , stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
253 qpel_put[1][fxy](s->me.scratchpad + 8*stride, (ref_y ) + (fx>>2) + (fy>>2)*(stride) + 8*stride, stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
254 qpel_put[1][fxy](s->me.scratchpad + 8 + 8*stride, (ref_y ) + (fx>>2) + (fy>>2)*(stride) + 8 + 8*stride, stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
255 qpel_avg[1][bxy](s->me.scratchpad , (ref2_y) + (bx>>2) + (by>>2)*(stride) , stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
256 qpel_avg[1][bxy](s->me.scratchpad + 8 , (ref2_y) + (bx>>2) + (by>>2)*(stride) + 8 , stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
257 qpel_avg[1][bxy](s->me.scratchpad + 8*stride, (ref2_y) + (bx>>2) + (by>>2)*(stride) + 8*stride, stride);\ |
f07fd48c23d4
direct blocksize in bframes fix (might fix qpel+bframe bug)
michaelni
parents:
1051
diff
changeset
|
258 qpel_avg[1][bxy](s->me.scratchpad + 8 + 8*stride, (ref2_y) + (bx>>2) + (by>>2)*(stride) + 8 + 8*stride, stride);\ |
936 | 259 }\ |
260 d = cmp_func(s, s->me.scratchpad, src_y, stride);\ | |
261 }else\ | |
262 d= 256*256*256*32; | |
263 | |
264 | |
265 #define CMP_QPEL(d, dx, dy, x, y, size)\ | |
266 CMP_DIRECT(d, dx, dy, x, y, size, cmp_sub) | |
267 | |
268 #define CMP(d, x, y, size)\ | |
269 CMP_DIRECT(d, 0, 0, x, y, size, cmp) | |
270 | |
271 #include "motion_est_template.c" | |
272 #undef RENAME | |
273 #undef CMP | |
274 #undef CMP_HPEL | |
275 #undef CMP_QPEL | |
276 #undef INIT | |
277 #undef CMP__DIRECT | |
278 | |
279 | |
280 static int zero_cmp(void *s, uint8_t *a, uint8_t *b, int stride){ | |
281 return 0; | |
282 } | |
283 | |
284 static void set_cmp(MpegEncContext *s, me_cmp_func *cmp, int type){ | |
285 DSPContext* c= &s->dsp; | |
286 int i; | |
287 | |
288 memset(cmp, 0, sizeof(void*)*11); | |
289 | |
290 switch(type&0xFF){ | |
291 case FF_CMP_SAD: | |
292 cmp[0]= c->sad[0]; | |
293 cmp[1]= c->sad[1]; | |
294 break; | |
295 case FF_CMP_SATD: | |
296 cmp[0]= c->hadamard8_diff[0]; | |
297 cmp[1]= c->hadamard8_diff[1]; | |
298 break; | |
299 case FF_CMP_SSE: | |
300 cmp[0]= c->sse[0]; | |
301 cmp[1]= c->sse[1]; | |
302 break; | |
303 case FF_CMP_DCT: | |
304 cmp[0]= c->dct_sad[0]; | |
305 cmp[1]= c->dct_sad[1]; | |
306 break; | |
307 case FF_CMP_PSNR: | |
308 cmp[0]= c->quant_psnr[0]; | |
309 cmp[1]= c->quant_psnr[1]; | |
310 break; | |
1007 | 311 case FF_CMP_BIT: |
312 cmp[0]= c->bit[0]; | |
313 cmp[1]= c->bit[1]; | |
314 break; | |
315 case FF_CMP_RD: | |
316 cmp[0]= c->rd[0]; | |
317 cmp[1]= c->rd[1]; | |
318 break; | |
936 | 319 case FF_CMP_ZERO: |
320 for(i=0; i<7; i++){ | |
321 cmp[i]= zero_cmp; | |
322 } | |
323 break; | |
324 default: | |
325 fprintf(stderr,"internal error in cmp function selection\n"); | |
326 } | |
1014
48349e11c9b2
C99 initializers and kill warnings patch by (mru at users dot sourceforge dot net (M¸«©ns Rullg¸«©rd))
michaelni
parents:
1013
diff
changeset
|
327 } |
936 | 328 |
329 static inline int get_penalty_factor(MpegEncContext *s, int type){ | |
1013 | 330 switch(type&0xFF){ |
936 | 331 default: |
332 case FF_CMP_SAD: | |
1013 | 333 return s->qscale*2; |
936 | 334 case FF_CMP_DCT: |
1013 | 335 return s->qscale*3; |
936 | 336 case FF_CMP_SATD: |
1013 | 337 return s->qscale*6; |
1007 | 338 case FF_CMP_SSE: |
1013 | 339 return s->qscale*s->qscale*2; |
1007 | 340 case FF_CMP_BIT: |
341 return 1; | |
342 case FF_CMP_RD: | |
1013 | 343 case FF_CMP_PSNR: |
344 return (s->qscale*s->qscale*185 + 64)>>7; | |
936 | 345 } |
346 } | |
347 | |
348 void ff_init_me(MpegEncContext *s){ | |
954 | 349 set_cmp(s, s->dsp.me_pre_cmp, s->avctx->me_pre_cmp); |
936 | 350 set_cmp(s, s->dsp.me_cmp, s->avctx->me_cmp); |
351 set_cmp(s, s->dsp.me_sub_cmp, s->avctx->me_sub_cmp); | |
352 set_cmp(s, s->dsp.mb_cmp, s->avctx->mb_cmp); | |
353 | |
354 if(s->flags&CODEC_FLAG_QPEL){ | |
355 if(s->avctx->me_sub_cmp&FF_CMP_CHROMA) | |
356 s->me.sub_motion_search= simple_chroma_qpel_motion_search; | |
357 else | |
358 s->me.sub_motion_search= simple_qpel_motion_search; | |
359 }else{ | |
360 if(s->avctx->me_sub_cmp&FF_CMP_CHROMA) | |
361 s->me.sub_motion_search= simple_chroma_hpel_motion_search; | |
1013 | 362 else if( s->avctx->me_sub_cmp == FF_CMP_SAD |
363 && s->avctx-> me_cmp == FF_CMP_SAD | |
364 && s->avctx-> mb_cmp == FF_CMP_SAD) | |
936 | 365 s->me.sub_motion_search= sad_hpel_motion_search; |
366 else | |
367 s->me.sub_motion_search= simple_hpel_motion_search; | |
368 } | |
369 | |
370 if(s->avctx->me_cmp&FF_CMP_CHROMA){ | |
371 s->me.motion_search[0]= simple_chroma_epzs_motion_search; | |
372 s->me.motion_search[1]= simple_chroma_epzs_motion_search4; | |
373 }else{ | |
374 s->me.motion_search[0]= simple_epzs_motion_search; | |
375 s->me.motion_search[1]= simple_epzs_motion_search4; | |
376 } | |
954 | 377 |
378 if(s->avctx->me_pre_cmp&FF_CMP_CHROMA){ | |
379 s->me.pre_motion_search= simple_chroma_epzs_motion_search; | |
380 }else{ | |
381 s->me.pre_motion_search= simple_epzs_motion_search; | |
382 } | |
1013 | 383 |
384 if(s->flags&CODEC_FLAG_QPEL){ | |
385 if(s->avctx->mb_cmp&FF_CMP_CHROMA) | |
386 s->me.get_mb_score= simple_chroma_qpel_get_mb_score; | |
387 else | |
388 s->me.get_mb_score= simple_qpel_get_mb_score; | |
389 }else{ | |
390 if(s->avctx->mb_cmp&FF_CMP_CHROMA) | |
391 s->me.get_mb_score= simple_chroma_hpel_get_mb_score; | |
392 else | |
393 s->me.get_mb_score= simple_hpel_get_mb_score; | |
394 } | |
936 | 395 } |
396 | |
1419 | 397 #if 0 |
1064 | 398 static int pix_dev(uint8_t * pix, int line_size, int mean) |
284 | 399 { |
400 int s, i, j; | |
401 | |
402 s = 0; | |
403 for (i = 0; i < 16; i++) { | |
404 for (j = 0; j < 16; j += 8) { | |
405 s += ABS(pix[0]-mean); | |
406 s += ABS(pix[1]-mean); | |
407 s += ABS(pix[2]-mean); | |
408 s += ABS(pix[3]-mean); | |
409 s += ABS(pix[4]-mean); | |
410 s += ABS(pix[5]-mean); | |
411 s += ABS(pix[6]-mean); | |
412 s += ABS(pix[7]-mean); | |
413 pix += 8; | |
414 } | |
415 pix += line_size - 16; | |
416 } | |
417 return s; | |
418 } | |
1419 | 419 #endif |
284 | 420 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
421 static inline void no_motion_search(MpegEncContext * s, |
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
422 int *mx_ptr, int *my_ptr) |
0 | 423 { |
424 *mx_ptr = 16 * s->mb_x; | |
425 *my_ptr = 16 * s->mb_y; | |
426 } | |
427 | |
428 static int full_motion_search(MpegEncContext * s, | |
429 int *mx_ptr, int *my_ptr, int range, | |
324 | 430 int xmin, int ymin, int xmax, int ymax, uint8_t *ref_picture) |
0 | 431 { |
432 int x1, y1, x2, y2, xx, yy, x, y; | |
433 int mx, my, dmin, d; | |
1064 | 434 uint8_t *pix; |
0 | 435 |
436 xx = 16 * s->mb_x; | |
437 yy = 16 * s->mb_y; | |
438 x1 = xx - range + 1; /* we loose one pixel to avoid boundary pb with half pixel pred */ | |
439 if (x1 < xmin) | |
440 x1 = xmin; | |
441 x2 = xx + range - 1; | |
442 if (x2 > xmax) | |
443 x2 = xmax; | |
444 y1 = yy - range + 1; | |
445 if (y1 < ymin) | |
446 y1 = ymin; | |
447 y2 = yy + range - 1; | |
448 if (y2 > ymax) | |
449 y2 = ymax; | |
903 | 450 pix = s->new_picture.data[0] + (yy * s->linesize) + xx; |
0 | 451 dmin = 0x7fffffff; |
452 mx = 0; | |
453 my = 0; | |
454 for (y = y1; y <= y2; y++) { | |
455 for (x = x1; x <= x2; x++) { | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
456 d = s->dsp.pix_abs16x16(pix, ref_picture + (y * s->linesize) + x, |
294 | 457 s->linesize); |
0 | 458 if (d < dmin || |
459 (d == dmin && | |
460 (abs(x - xx) + abs(y - yy)) < | |
461 (abs(mx - xx) + abs(my - yy)))) { | |
462 dmin = d; | |
463 mx = x; | |
464 my = y; | |
465 } | |
466 } | |
467 } | |
468 | |
469 *mx_ptr = mx; | |
470 *my_ptr = my; | |
471 | |
472 #if 0 | |
473 if (*mx_ptr < -(2 * range) || *mx_ptr >= (2 * range) || | |
474 *my_ptr < -(2 * range) || *my_ptr >= (2 * range)) { | |
475 fprintf(stderr, "error %d %d\n", *mx_ptr, *my_ptr); | |
476 } | |
477 #endif | |
478 return dmin; | |
479 } | |
480 | |
481 | |
482 static int log_motion_search(MpegEncContext * s, | |
483 int *mx_ptr, int *my_ptr, int range, | |
324 | 484 int xmin, int ymin, int xmax, int ymax, uint8_t *ref_picture) |
0 | 485 { |
486 int x1, y1, x2, y2, xx, yy, x, y; | |
487 int mx, my, dmin, d; | |
1064 | 488 uint8_t *pix; |
0 | 489 |
490 xx = s->mb_x << 4; | |
491 yy = s->mb_y << 4; | |
492 | |
493 /* Left limit */ | |
494 x1 = xx - range; | |
495 if (x1 < xmin) | |
496 x1 = xmin; | |
497 | |
498 /* Right limit */ | |
499 x2 = xx + range; | |
500 if (x2 > xmax) | |
501 x2 = xmax; | |
502 | |
503 /* Upper limit */ | |
504 y1 = yy - range; | |
505 if (y1 < ymin) | |
506 y1 = ymin; | |
507 | |
508 /* Lower limit */ | |
509 y2 = yy + range; | |
510 if (y2 > ymax) | |
511 y2 = ymax; | |
512 | |
903 | 513 pix = s->new_picture.data[0] + (yy * s->linesize) + xx; |
0 | 514 dmin = 0x7fffffff; |
515 mx = 0; | |
516 my = 0; | |
517 | |
518 do { | |
519 for (y = y1; y <= y2; y += range) { | |
520 for (x = x1; x <= x2; x += range) { | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
521 d = s->dsp.pix_abs16x16(pix, ref_picture + (y * s->linesize) + x, s->linesize); |
0 | 522 if (d < dmin || (d == dmin && (abs(x - xx) + abs(y - yy)) < (abs(mx - xx) + abs(my - yy)))) { |
523 dmin = d; | |
524 mx = x; | |
525 my = y; | |
526 } | |
527 } | |
528 } | |
529 | |
530 range = range >> 1; | |
531 | |
532 x1 = mx - range; | |
533 if (x1 < xmin) | |
534 x1 = xmin; | |
535 | |
536 x2 = mx + range; | |
537 if (x2 > xmax) | |
538 x2 = xmax; | |
539 | |
540 y1 = my - range; | |
541 if (y1 < ymin) | |
542 y1 = ymin; | |
543 | |
544 y2 = my + range; | |
545 if (y2 > ymax) | |
546 y2 = ymax; | |
547 | |
548 } while (range >= 1); | |
549 | |
550 #ifdef DEBUG | |
551 fprintf(stderr, "log - MX: %d\tMY: %d\n", mx, my); | |
552 #endif | |
553 *mx_ptr = mx; | |
554 *my_ptr = my; | |
555 return dmin; | |
556 } | |
557 | |
558 static int phods_motion_search(MpegEncContext * s, | |
559 int *mx_ptr, int *my_ptr, int range, | |
324 | 560 int xmin, int ymin, int xmax, int ymax, uint8_t *ref_picture) |
0 | 561 { |
562 int x1, y1, x2, y2, xx, yy, x, y, lastx, d; | |
563 int mx, my, dminx, dminy; | |
1064 | 564 uint8_t *pix; |
0 | 565 |
566 xx = s->mb_x << 4; | |
567 yy = s->mb_y << 4; | |
568 | |
569 /* Left limit */ | |
570 x1 = xx - range; | |
571 if (x1 < xmin) | |
572 x1 = xmin; | |
573 | |
574 /* Right limit */ | |
575 x2 = xx + range; | |
576 if (x2 > xmax) | |
577 x2 = xmax; | |
578 | |
579 /* Upper limit */ | |
580 y1 = yy - range; | |
581 if (y1 < ymin) | |
582 y1 = ymin; | |
583 | |
584 /* Lower limit */ | |
585 y2 = yy + range; | |
586 if (y2 > ymax) | |
587 y2 = ymax; | |
588 | |
903 | 589 pix = s->new_picture.data[0] + (yy * s->linesize) + xx; |
0 | 590 mx = 0; |
591 my = 0; | |
592 | |
593 x = xx; | |
594 y = yy; | |
595 do { | |
596 dminx = 0x7fffffff; | |
597 dminy = 0x7fffffff; | |
598 | |
599 lastx = x; | |
600 for (x = x1; x <= x2; x += range) { | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
601 d = s->dsp.pix_abs16x16(pix, ref_picture + (y * s->linesize) + x, s->linesize); |
0 | 602 if (d < dminx || (d == dminx && (abs(x - xx) + abs(y - yy)) < (abs(mx - xx) + abs(my - yy)))) { |
603 dminx = d; | |
604 mx = x; | |
605 } | |
606 } | |
607 | |
608 x = lastx; | |
609 for (y = y1; y <= y2; y += range) { | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
610 d = s->dsp.pix_abs16x16(pix, ref_picture + (y * s->linesize) + x, s->linesize); |
0 | 611 if (d < dminy || (d == dminy && (abs(x - xx) + abs(y - yy)) < (abs(mx - xx) + abs(my - yy)))) { |
612 dminy = d; | |
613 my = y; | |
614 } | |
615 } | |
616 | |
617 range = range >> 1; | |
618 | |
619 x = mx; | |
620 y = my; | |
621 x1 = mx - range; | |
622 if (x1 < xmin) | |
623 x1 = xmin; | |
624 | |
625 x2 = mx + range; | |
626 if (x2 > xmax) | |
627 x2 = xmax; | |
628 | |
629 y1 = my - range; | |
630 if (y1 < ymin) | |
631 y1 = ymin; | |
632 | |
633 y2 = my + range; | |
634 if (y2 > ymax) | |
635 y2 = ymax; | |
636 | |
637 } while (range >= 1); | |
638 | |
639 #ifdef DEBUG | |
640 fprintf(stderr, "phods - MX: %d\tMY: %d\n", mx, my); | |
641 #endif | |
642 | |
643 /* half pixel search */ | |
644 *mx_ptr = mx; | |
645 *my_ptr = my; | |
646 return dminy; | |
647 } | |
648 | |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
649 |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
650 #define Z_THRESHOLD 256 |
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
651 |
936 | 652 #define CHECK_SAD_HALF_MV(suffix, x, y) \ |
455 | 653 {\ |
654 d= pix_abs_ ## suffix(pix, ptr+((x)>>1), s->linesize);\ | |
936 | 655 d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\ |
455 | 656 COPY3_IF_LT(dminh, d, dx, x, dy, y)\ |
657 } | |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
658 |
936 | 659 static inline int sad_hpel_motion_search(MpegEncContext * s, |
0 | 660 int *mx_ptr, int *my_ptr, int dmin, |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
661 int xmin, int ymin, int xmax, int ymax, |
936 | 662 int pred_x, int pred_y, Picture *picture, |
1162 | 663 int n, int size, uint8_t * const mv_penalty) |
0 | 664 { |
936 | 665 uint8_t *ref_picture= picture->data[0]; |
666 uint32_t *score_map= s->me.score_map; | |
667 const int penalty_factor= s->me.sub_penalty_factor; | |
455 | 668 int mx, my, xx, yy, dminh; |
1064 | 669 uint8_t *pix, *ptr; |
936 | 670 op_pixels_abs_func pix_abs_x2; |
671 op_pixels_abs_func pix_abs_y2; | |
672 op_pixels_abs_func pix_abs_xy2; | |
673 | |
674 if(size==0){ | |
675 pix_abs_x2 = s->dsp.pix_abs16x16_x2; | |
676 pix_abs_y2 = s->dsp.pix_abs16x16_y2; | |
677 pix_abs_xy2= s->dsp.pix_abs16x16_xy2; | |
678 }else{ | |
679 pix_abs_x2 = s->dsp.pix_abs8x8_x2; | |
680 pix_abs_y2 = s->dsp.pix_abs8x8_y2; | |
681 pix_abs_xy2= s->dsp.pix_abs8x8_xy2; | |
863 | 682 } |
455 | 683 |
936 | 684 if(s->me.skip){ |
455 | 685 // printf("S"); |
686 *mx_ptr = 0; | |
687 *my_ptr = 0; | |
688 return dmin; | |
689 } | |
690 // printf("N"); | |
691 | |
692 xx = 16 * s->mb_x + 8*(n&1); | |
693 yy = 16 * s->mb_y + 8*(n>>1); | |
903 | 694 pix = s->new_picture.data[0] + (yy * s->linesize) + xx; |
455 | 695 |
294 | 696 mx = *mx_ptr; |
697 my = *my_ptr; | |
455 | 698 ptr = ref_picture + ((yy + my) * s->linesize) + (xx + mx); |
699 | |
294 | 700 dminh = dmin; |
701 | |
702 if (mx > xmin && mx < xmax && | |
703 my > ymin && my < ymax) { | |
455 | 704 int dx=0, dy=0; |
705 int d, pen_x, pen_y; | |
706 const int index= (my<<ME_MAP_SHIFT) + mx; | |
707 const int t= score_map[(index-(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)]; | |
708 const int l= score_map[(index- 1 )&(ME_MAP_SIZE-1)]; | |
709 const int r= score_map[(index+ 1 )&(ME_MAP_SIZE-1)]; | |
710 const int b= score_map[(index+(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)]; | |
711 mx<<=1; | |
712 my<<=1; | |
294 | 713 |
714 | |
715 pen_x= pred_x + mx; | |
716 pen_y= pred_y + my; | |
717 | |
718 ptr-= s->linesize; | |
455 | 719 if(t<=b){ |
936 | 720 CHECK_SAD_HALF_MV(y2 , 0, -1) |
455 | 721 if(l<=r){ |
936 | 722 CHECK_SAD_HALF_MV(xy2, -1, -1) |
455 | 723 if(t+r<=b+l){ |
936 | 724 CHECK_SAD_HALF_MV(xy2, +1, -1) |
455 | 725 ptr+= s->linesize; |
726 }else{ | |
727 ptr+= s->linesize; | |
936 | 728 CHECK_SAD_HALF_MV(xy2, -1, +1) |
455 | 729 } |
936 | 730 CHECK_SAD_HALF_MV(x2 , -1, 0) |
455 | 731 }else{ |
936 | 732 CHECK_SAD_HALF_MV(xy2, +1, -1) |
455 | 733 if(t+l<=b+r){ |
936 | 734 CHECK_SAD_HALF_MV(xy2, -1, -1) |
455 | 735 ptr+= s->linesize; |
736 }else{ | |
737 ptr+= s->linesize; | |
936 | 738 CHECK_SAD_HALF_MV(xy2, +1, +1) |
455 | 739 } |
936 | 740 CHECK_SAD_HALF_MV(x2 , +1, 0) |
455 | 741 } |
742 }else{ | |
743 if(l<=r){ | |
744 if(t+l<=b+r){ | |
936 | 745 CHECK_SAD_HALF_MV(xy2, -1, -1) |
455 | 746 ptr+= s->linesize; |
747 }else{ | |
748 ptr+= s->linesize; | |
936 | 749 CHECK_SAD_HALF_MV(xy2, +1, +1) |
455 | 750 } |
936 | 751 CHECK_SAD_HALF_MV(x2 , -1, 0) |
752 CHECK_SAD_HALF_MV(xy2, -1, +1) | |
455 | 753 }else{ |
754 if(t+r<=b+l){ | |
936 | 755 CHECK_SAD_HALF_MV(xy2, +1, -1) |
455 | 756 ptr+= s->linesize; |
757 }else{ | |
758 ptr+= s->linesize; | |
936 | 759 CHECK_SAD_HALF_MV(xy2, -1, +1) |
455 | 760 } |
936 | 761 CHECK_SAD_HALF_MV(x2 , +1, 0) |
762 CHECK_SAD_HALF_MV(xy2, +1, +1) | |
455 | 763 } |
936 | 764 CHECK_SAD_HALF_MV(y2 , 0, +1) |
455 | 765 } |
766 mx+=dx; | |
767 my+=dy; | |
294 | 768 |
769 }else{ | |
455 | 770 mx<<=1; |
771 my<<=1; | |
294 | 772 } |
773 | |
774 *mx_ptr = mx; | |
775 *my_ptr = my; | |
455 | 776 return dminh; |
294 | 777 } |
778 | |
455 | 779 static inline void set_p_mv_tables(MpegEncContext * s, int mx, int my, int mv4) |
294 | 780 { |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
781 const int xy= s->mb_x + s->mb_y*s->mb_stride; |
294 | 782 |
324 | 783 s->p_mv_table[xy][0] = mx; |
784 s->p_mv_table[xy][1] = my; | |
294 | 785 |
786 /* has allready been set to the 4 MV if 4MV is done */ | |
455 | 787 if(mv4){ |
294 | 788 int mot_xy= s->block_index[0]; |
789 | |
790 s->motion_val[mot_xy ][0]= mx; | |
791 s->motion_val[mot_xy ][1]= my; | |
792 s->motion_val[mot_xy+1][0]= mx; | |
793 s->motion_val[mot_xy+1][1]= my; | |
794 | |
795 mot_xy += s->block_wrap[0]; | |
796 s->motion_val[mot_xy ][0]= mx; | |
797 s->motion_val[mot_xy ][1]= my; | |
798 s->motion_val[mot_xy+1][0]= mx; | |
799 s->motion_val[mot_xy+1][1]= my; | |
800 } | |
801 } | |
802 | |
1086 | 803 /** |
804 * get fullpel ME search limits. | |
805 * @param range the approximate search range for the old ME code, unused for EPZS and newer | |
806 */ | |
807 static inline void get_limits(MpegEncContext *s, int *range, int *xmin, int *ymin, int *xmax, int *ymax) | |
324 | 808 { |
1086 | 809 if(s->avctx->me_range) *range= s->avctx->me_range >> 1; |
810 else *range= 16; | |
0 | 811 |
324 | 812 if (s->unrestricted_mv) { |
813 *xmin = -16; | |
814 *ymin = -16; | |
1367 | 815 *xmax = s->mb_width*16; |
816 *ymax = s->mb_height*16; | |
324 | 817 } else { |
818 *xmin = 0; | |
819 *ymin = 0; | |
820 *xmax = s->mb_width*16 - 16; | |
821 *ymax = s->mb_height*16 - 16; | |
822 } | |
1086 | 823 |
824 //FIXME try to limit x/y min/max if me_range is set | |
324 | 825 } |
826 | |
1013 | 827 static inline int h263_mv4_search(MpegEncContext *s, int xmin, int ymin, int xmax, int ymax, int mx, int my, int shift) |
455 | 828 { |
829 int block; | |
830 int P[10][2]; | |
1013 | 831 int dmin_sum=0, mx4_sum=0, my4_sum=0; |
1162 | 832 uint8_t * const mv_penalty= s->me.mv_penalty[s->f_code] + MAX_MV; |
1494
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
833 int same=1; |
455 | 834 |
835 for(block=0; block<4; block++){ | |
836 int mx4, my4; | |
837 int pred_x4, pred_y4; | |
838 int dmin4; | |
839 static const int off[4]= {2, 1, 1, -1}; | |
840 const int mot_stride = s->block_wrap[0]; | |
841 const int mot_xy = s->block_index[block]; | |
842 // const int block_x= (block&1); | |
843 // const int block_y= (block>>1); | |
844 #if 1 // this saves us a bit of cliping work and shouldnt affect compression in a negative way | |
845 const int rel_xmin4= xmin; | |
846 const int rel_xmax4= xmax; | |
847 const int rel_ymin4= ymin; | |
848 const int rel_ymax4= ymax; | |
849 #else | |
850 const int rel_xmin4= xmin - block_x*8; | |
851 const int rel_xmax4= xmax - block_x*8 + 8; | |
852 const int rel_ymin4= ymin - block_y*8; | |
853 const int rel_ymax4= ymax - block_y*8 + 8; | |
854 #endif | |
855 P_LEFT[0] = s->motion_val[mot_xy - 1][0]; | |
856 P_LEFT[1] = s->motion_val[mot_xy - 1][1]; | |
857 | |
858 if(P_LEFT[0] > (rel_xmax4<<shift)) P_LEFT[0] = (rel_xmax4<<shift); | |
859 | |
860 /* special case for first line */ | |
952 | 861 if (s->mb_y == 0 && block<2) { |
455 | 862 pred_x4= P_LEFT[0]; |
863 pred_y4= P_LEFT[1]; | |
864 } else { | |
865 P_TOP[0] = s->motion_val[mot_xy - mot_stride ][0]; | |
866 P_TOP[1] = s->motion_val[mot_xy - mot_stride ][1]; | |
867 P_TOPRIGHT[0] = s->motion_val[mot_xy - mot_stride + off[block]][0]; | |
868 P_TOPRIGHT[1] = s->motion_val[mot_xy - mot_stride + off[block]][1]; | |
869 if(P_TOP[1] > (rel_ymax4<<shift)) P_TOP[1] = (rel_ymax4<<shift); | |
870 if(P_TOPRIGHT[0] < (rel_xmin4<<shift)) P_TOPRIGHT[0]= (rel_xmin4<<shift); | |
871 if(P_TOPRIGHT[0] > (rel_xmax4<<shift)) P_TOPRIGHT[0]= (rel_xmax4<<shift); | |
872 if(P_TOPRIGHT[1] > (rel_ymax4<<shift)) P_TOPRIGHT[1]= (rel_ymax4<<shift); | |
873 | |
874 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]); | |
875 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]); | |
876 | |
1013 | 877 // if(s->out_format == FMT_H263){ |
455 | 878 pred_x4 = P_MEDIAN[0]; |
879 pred_y4 = P_MEDIAN[1]; | |
1013 | 880 #if 0 |
455 | 881 }else { /* mpeg1 at least */ |
882 pred_x4= P_LEFT[0]; | |
883 pred_y4= P_LEFT[1]; | |
884 } | |
1013 | 885 #endif |
455 | 886 } |
887 P_MV1[0]= mx; | |
888 P_MV1[1]= my; | |
889 | |
936 | 890 dmin4 = s->me.motion_search[1](s, block, &mx4, &my4, P, pred_x4, pred_y4, rel_xmin4, rel_ymin4, rel_xmax4, rel_ymax4, |
948 | 891 &s->last_picture, s->p_mv_table, (1<<16)>>shift, mv_penalty); |
455 | 892 |
936 | 893 dmin4= s->me.sub_motion_search(s, &mx4, &my4, dmin4, rel_xmin4, rel_ymin4, rel_xmax4, rel_ymax4, |
894 pred_x4, pred_y4, &s->last_picture, block, 1, mv_penalty); | |
1038 | 895 |
896 if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){ | |
1013 | 897 int dxy; |
898 const int offset= ((block&1) + (block>>1)*s->linesize)*8; | |
899 uint8_t *dest_y = s->me.scratchpad + offset; | |
900 | |
901 if(s->quarter_sample){ | |
902 uint8_t *ref= s->last_picture.data[0] + (s->mb_x*16 + (mx4>>2)) + (s->mb_y*16 + (my4>>2))*s->linesize + offset; | |
903 dxy = ((my4 & 3) << 2) | (mx4 & 3); | |
904 | |
905 if(s->no_rounding) | |
1038 | 906 s->dsp.put_no_rnd_qpel_pixels_tab[1][dxy](dest_y , ref , s->linesize); |
1013 | 907 else |
1038 | 908 s->dsp.put_qpel_pixels_tab [1][dxy](dest_y , ref , s->linesize); |
1013 | 909 }else{ |
910 uint8_t *ref= s->last_picture.data[0] + (s->mb_x*16 + (mx4>>1)) + (s->mb_y*16 + (my4>>1))*s->linesize + offset; | |
911 dxy = ((my4 & 1) << 1) | (mx4 & 1); | |
912 | |
913 if(s->no_rounding) | |
1038 | 914 s->dsp.put_no_rnd_pixels_tab[1][dxy](dest_y , ref , s->linesize, 8); |
1013 | 915 else |
1038 | 916 s->dsp.put_pixels_tab [1][dxy](dest_y , ref , s->linesize, 8); |
1013 | 917 } |
918 dmin_sum+= (mv_penalty[mx4-pred_x4] + mv_penalty[my4-pred_y4])*s->me.mb_penalty_factor; | |
919 }else | |
920 dmin_sum+= dmin4; | |
921 | |
922 if(s->quarter_sample){ | |
923 mx4_sum+= mx4/2; | |
924 my4_sum+= my4/2; | |
925 }else{ | |
926 mx4_sum+= mx4; | |
927 my4_sum+= my4; | |
928 } | |
929 | |
455 | 930 s->motion_val[ s->block_index[block] ][0]= mx4; |
931 s->motion_val[ s->block_index[block] ][1]= my4; | |
1494
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
932 |
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
933 if(mx4 != mx || my4 != my) same=0; |
1013 | 934 } |
935 | |
1494
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
936 if(same) |
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
937 return INT_MAX; |
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
938 |
1038 | 939 if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){ |
1013 | 940 dmin_sum += s->dsp.mb_cmp[0](s, s->new_picture.data[0] + s->mb_x*16 + s->mb_y*16*s->linesize, s->me.scratchpad, s->linesize); |
455 | 941 } |
1013 | 942 |
943 if(s->avctx->mb_cmp&FF_CMP_CHROMA){ | |
944 int dxy; | |
945 int mx, my; | |
946 int offset; | |
947 | |
948 mx= ff_h263_round_chroma(mx4_sum); | |
949 my= ff_h263_round_chroma(my4_sum); | |
950 dxy = ((my & 1) << 1) | (mx & 1); | |
951 | |
952 offset= (s->mb_x*8 + (mx>>1)) + (s->mb_y*8 + (my>>1))*s->uvlinesize; | |
953 | |
954 if(s->no_rounding){ | |
955 s->dsp.put_no_rnd_pixels_tab[1][dxy](s->me.scratchpad , s->last_picture.data[1] + offset, s->uvlinesize, 8); | |
956 s->dsp.put_no_rnd_pixels_tab[1][dxy](s->me.scratchpad+8 , s->last_picture.data[2] + offset, s->uvlinesize, 8); | |
957 }else{ | |
958 s->dsp.put_pixels_tab [1][dxy](s->me.scratchpad , s->last_picture.data[1] + offset, s->uvlinesize, 8); | |
959 s->dsp.put_pixels_tab [1][dxy](s->me.scratchpad+8 , s->last_picture.data[2] + offset, s->uvlinesize, 8); | |
960 } | |
961 | |
962 dmin_sum += s->dsp.mb_cmp[1](s, s->new_picture.data[1] + s->mb_x*8 + s->mb_y*8*s->uvlinesize, s->me.scratchpad , s->uvlinesize); | |
963 dmin_sum += s->dsp.mb_cmp[1](s, s->new_picture.data[2] + s->mb_x*8 + s->mb_y*8*s->uvlinesize, s->me.scratchpad+8, s->uvlinesize); | |
964 } | |
965 | |
966 switch(s->avctx->mb_cmp&0xFF){ | |
967 /*case FF_CMP_SSE: | |
968 return dmin_sum+ 32*s->qscale*s->qscale;*/ | |
969 case FF_CMP_RD: | |
970 return dmin_sum; | |
971 default: | |
972 return dmin_sum+ 11*s->me.mb_penalty_factor; | |
973 } | |
455 | 974 } |
975 | |
324 | 976 void ff_estimate_p_frame_motion(MpegEncContext * s, |
977 int mb_x, int mb_y) | |
0 | 978 { |
1064 | 979 uint8_t *pix, *ppix; |
0 | 980 int sum, varc, vard, mx, my, range, dmin, xx, yy; |
981 int xmin, ymin, xmax, ymax; | |
280 | 982 int rel_xmin, rel_ymin, rel_xmax, rel_ymax; |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
983 int pred_x=0, pred_y=0; |
455 | 984 int P[10][2]; |
280 | 985 const int shift= 1+s->quarter_sample; |
294 | 986 int mb_type=0; |
903 | 987 uint8_t *ref_picture= s->last_picture.data[0]; |
988 Picture * const pic= &s->current_picture; | |
1162 | 989 uint8_t * const mv_penalty= s->me.mv_penalty[s->f_code] + MAX_MV; |
936 | 990 |
991 assert(s->quarter_sample==0 || s->quarter_sample==1); | |
992 | |
993 s->me.penalty_factor = get_penalty_factor(s, s->avctx->me_cmp); | |
994 s->me.sub_penalty_factor= get_penalty_factor(s, s->avctx->me_sub_cmp); | |
1013 | 995 s->me.mb_penalty_factor = get_penalty_factor(s, s->avctx->mb_cmp); |
0 | 996 |
1086 | 997 get_limits(s, &range, &xmin, &ymin, &xmax, &ymax); |
455 | 998 rel_xmin= xmin - mb_x*16; |
999 rel_xmax= xmax - mb_x*16; | |
1000 rel_ymin= ymin - mb_y*16; | |
1001 rel_ymax= ymax - mb_y*16; | |
936 | 1002 s->me.skip=0; |
324 | 1003 |
320
cda7d0857baf
- ME setting moved to AVCodecContext/MpegEncContext, no longer a global.
pulento
parents:
304
diff
changeset
|
1004 switch(s->me_method) { |
0 | 1005 case ME_ZERO: |
1006 default: | |
1007 no_motion_search(s, &mx, &my); | |
455 | 1008 mx-= mb_x*16; |
1009 my-= mb_y*16; | |
0 | 1010 dmin = 0; |
1011 break; | |
1012 case ME_FULL: | |
324 | 1013 dmin = full_motion_search(s, &mx, &my, range, xmin, ymin, xmax, ymax, ref_picture); |
455 | 1014 mx-= mb_x*16; |
1015 my-= mb_y*16; | |
0 | 1016 break; |
1017 case ME_LOG: | |
324 | 1018 dmin = log_motion_search(s, &mx, &my, range / 2, xmin, ymin, xmax, ymax, ref_picture); |
455 | 1019 mx-= mb_x*16; |
1020 my-= mb_y*16; | |
0 | 1021 break; |
1022 case ME_PHODS: | |
324 | 1023 dmin = phods_motion_search(s, &mx, &my, range / 2, xmin, ymin, xmax, ymax, ref_picture); |
455 | 1024 mx-= mb_x*16; |
1025 my-= mb_y*16; | |
0 | 1026 break; |
288 | 1027 case ME_X1: |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
1028 case ME_EPZS: |
288 | 1029 { |
294 | 1030 const int mot_stride = s->block_wrap[0]; |
1031 const int mot_xy = s->block_index[0]; | |
288 | 1032 |
455 | 1033 P_LEFT[0] = s->motion_val[mot_xy - 1][0]; |
1034 P_LEFT[1] = s->motion_val[mot_xy - 1][1]; | |
288 | 1035 |
455 | 1036 if(P_LEFT[0] > (rel_xmax<<shift)) P_LEFT[0] = (rel_xmax<<shift); |
280 | 1037 |
952 | 1038 if(mb_y) { |
455 | 1039 P_TOP[0] = s->motion_val[mot_xy - mot_stride ][0]; |
1040 P_TOP[1] = s->motion_val[mot_xy - mot_stride ][1]; | |
1041 P_TOPRIGHT[0] = s->motion_val[mot_xy - mot_stride + 2][0]; | |
1042 P_TOPRIGHT[1] = s->motion_val[mot_xy - mot_stride + 2][1]; | |
1043 if(P_TOP[1] > (rel_ymax<<shift)) P_TOP[1] = (rel_ymax<<shift); | |
1044 if(P_TOPRIGHT[0] < (rel_xmin<<shift)) P_TOPRIGHT[0]= (rel_xmin<<shift); | |
1045 if(P_TOPRIGHT[1] > (rel_ymax<<shift)) P_TOPRIGHT[1]= (rel_ymax<<shift); | |
280 | 1046 |
455 | 1047 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]); |
1048 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]); | |
1049 | |
1050 if(s->out_format == FMT_H263){ | |
1051 pred_x = P_MEDIAN[0]; | |
1052 pred_y = P_MEDIAN[1]; | |
1053 }else { /* mpeg1 at least */ | |
1054 pred_x= P_LEFT[0]; | |
1055 pred_y= P_LEFT[1]; | |
1056 } | |
952 | 1057 }else{ |
1058 pred_x= P_LEFT[0]; | |
1059 pred_y= P_LEFT[1]; | |
288 | 1060 } |
952 | 1061 |
280 | 1062 } |
936 | 1063 dmin = s->me.motion_search[0](s, 0, &mx, &my, P, pred_x, pred_y, rel_xmin, rel_ymin, rel_xmax, rel_ymax, |
948 | 1064 &s->last_picture, s->p_mv_table, (1<<16)>>shift, mv_penalty); |
281
1fc96b02142e
mpeg4 aspect_ratio_info in AVCodecContext (requested by alex)
michaelni
parents:
280
diff
changeset
|
1065 |
277
5cb2978e701f
new motion estimation (epzs) not complete yet but allready pretty good :)
michaelni
parents:
275
diff
changeset
|
1066 break; |
0 | 1067 } |
1068 | |
1069 /* intra / predictive decision */ | |
1070 xx = mb_x * 16; | |
1071 yy = mb_y * 16; | |
1072 | |
903 | 1073 pix = s->new_picture.data[0] + (yy * s->linesize) + xx; |
455 | 1074 /* At this point (mx,my) are full-pell and the relative displacement */ |
1075 ppix = ref_picture + ((yy+my) * s->linesize) + (xx+mx); | |
289
648e9245546d
seems the old intra/inter decission is slightly better with a threshold, than the new one
michaelni
parents:
288
diff
changeset
|
1076 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1077 sum = s->dsp.pix_sum(pix, s->linesize); |
455 | 1078 |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1079 varc = (s->dsp.pix_norm1(pix, s->linesize) - (((unsigned)(sum*sum))>>8) + 500 + 128)>>8; |
936 | 1080 vard = (s->dsp.sse[0](NULL, pix, ppix, s->linesize)+128)>>8; |
608 | 1081 |
455 | 1082 //printf("%d %d %d %X %X %X\n", s->mb_width, mb_x, mb_y,(int)s, (int)s->mb_var, (int)s->mc_mb_var); fflush(stdout); |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1083 pic->mb_var [s->mb_stride * mb_y + mb_x] = varc; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1084 pic->mc_mb_var[s->mb_stride * mb_y + mb_x] = vard; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1085 pic->mb_mean [s->mb_stride * mb_y + mb_x] = (sum+128)>>8; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1086 // pic->mb_cmp_score[s->mb_stride * mb_y + mb_x] = dmin; |
903 | 1087 pic->mb_var_sum += varc; |
1088 pic->mc_mb_var_sum += vard; | |
455 | 1089 //printf("E%d %d %d %X %X %X\n", s->mb_width, mb_x, mb_y,(int)s, (int)s->mb_var, (int)s->mc_mb_var); fflush(stdout); |
320
cda7d0857baf
- ME setting moved to AVCodecContext/MpegEncContext, no longer a global.
pulento
parents:
304
diff
changeset
|
1090 |
0 | 1091 #if 0 |
233
3f5b72726118
- More work on preliminary bit rate control, just to be able to get an
pulento
parents:
232
diff
changeset
|
1092 printf("varc=%4d avg_var=%4d (sum=%4d) vard=%4d mx=%2d my=%2d\n", |
3f5b72726118
- More work on preliminary bit rate control, just to be able to get an
pulento
parents:
232
diff
changeset
|
1093 varc, s->avg_mb_var, sum, vard, mx - xx, my - yy); |
0 | 1094 #endif |
1389 | 1095 if(s->avctx->mb_decision > FF_MB_DECISION_SIMPLE){ |
608 | 1096 if (vard <= 64 || vard < varc) |
1097 s->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc); | |
1098 else | |
913 | 1099 s->scene_change_score+= s->qscale; |
608 | 1100 |
294 | 1101 if (vard*2 + 200 > varc) |
1102 mb_type|= MB_TYPE_INTRA; | |
1103 if (varc*2 + 200 > vard){ | |
1104 mb_type|= MB_TYPE_INTER; | |
936 | 1105 s->me.sub_motion_search(s, &mx, &my, dmin, rel_xmin, rel_ymin, rel_xmax, rel_ymax, |
1106 pred_x, pred_y, &s->last_picture, 0, 0, mv_penalty); | |
1494
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
1107 if(s->flags&CODEC_FLAG_MV0) |
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
1108 if(mx || my) |
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
1109 mb_type |= MB_TYPE_SKIPED; //FIXME check difference |
304 | 1110 }else{ |
936 | 1111 mx <<=shift; |
1112 my <<=shift; | |
0 | 1113 } |
455 | 1114 if((s->flags&CODEC_FLAG_4MV) |
936 | 1115 && !s->me.skip && varc>50 && vard>10){ |
1494
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
1116 if(h263_mv4_search(s, rel_xmin, rel_ymin, rel_xmax, rel_ymax, mx, my, shift) < INT_MAX) |
3ee63c12ea30
optionally try to encode each MB with MV=<0,0> and choose the one with better RD
michaelni
parents:
1426
diff
changeset
|
1117 mb_type|=MB_TYPE_INTER4V; |
455 | 1118 |
1119 set_p_mv_tables(s, mx, my, 0); | |
1120 }else | |
1121 set_p_mv_tables(s, mx, my, 1); | |
294 | 1122 }else{ |
1013 | 1123 mb_type= MB_TYPE_INTER; |
1124 | |
1125 dmin= s->me.sub_motion_search(s, &mx, &my, dmin, rel_xmin, rel_ymin, rel_xmax, rel_ymax, | |
1126 pred_x, pred_y, &s->last_picture, 0, 0, mv_penalty); | |
1127 | |
1128 if(s->avctx->me_sub_cmp != s->avctx->mb_cmp && !s->me.skip) | |
1129 dmin= s->me.get_mb_score(s, mx, my, pred_x, pred_y, &s->last_picture, mv_penalty); | |
1130 | |
1131 if((s->flags&CODEC_FLAG_4MV) | |
1132 && !s->me.skip && varc>50 && vard>10){ | |
1133 int dmin4= h263_mv4_search(s, rel_xmin, rel_ymin, rel_xmax, rel_ymax, mx, my, shift); | |
1134 if(dmin4 < dmin){ | |
1135 mb_type= MB_TYPE_INTER4V; | |
1136 dmin=dmin4; | |
1137 } | |
1138 } | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1139 pic->mb_cmp_score[s->mb_stride * mb_y + mb_x] = dmin; |
1013 | 1140 set_p_mv_tables(s, mx, my, mb_type!=MB_TYPE_INTER4V); |
1141 | |
294 | 1142 if (vard <= 64 || vard < varc) { |
608 | 1143 s->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc); |
294 | 1144 }else{ |
1011 | 1145 s->scene_change_score+= s->qscale; |
294 | 1146 } |
1147 } | |
284 | 1148 |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1149 s->mb_type[mb_y*s->mb_stride + mb_x]= mb_type; |
0 | 1150 } |
1151 | |
951 | 1152 int ff_pre_estimate_p_frame_motion(MpegEncContext * s, |
1153 int mb_x, int mb_y) | |
1154 { | |
1155 int mx, my, range, dmin; | |
1156 int xmin, ymin, xmax, ymax; | |
1157 int rel_xmin, rel_ymin, rel_xmax, rel_ymax; | |
1158 int pred_x=0, pred_y=0; | |
1159 int P[10][2]; | |
1160 const int shift= 1+s->quarter_sample; | |
1162 | 1161 uint8_t * const mv_penalty= s->me.mv_penalty[s->f_code] + MAX_MV; |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1162 const int xy= mb_x + mb_y*s->mb_stride; |
951 | 1163 |
1164 assert(s->quarter_sample==0 || s->quarter_sample==1); | |
1165 | |
954 | 1166 s->me.pre_penalty_factor = get_penalty_factor(s, s->avctx->me_pre_cmp); |
951 | 1167 |
1086 | 1168 get_limits(s, &range, &xmin, &ymin, &xmax, &ymax); |
951 | 1169 rel_xmin= xmin - mb_x*16; |
1170 rel_xmax= xmax - mb_x*16; | |
1171 rel_ymin= ymin - mb_y*16; | |
1172 rel_ymax= ymax - mb_y*16; | |
1173 s->me.skip=0; | |
1174 | |
1175 P_LEFT[0] = s->p_mv_table[xy + 1][0]; | |
1176 P_LEFT[1] = s->p_mv_table[xy + 1][1]; | |
1177 | |
1178 if(P_LEFT[0] < (rel_xmin<<shift)) P_LEFT[0] = (rel_xmin<<shift); | |
1179 | |
1180 /* special case for first line */ | |
1181 if (mb_y == s->mb_height-1) { | |
1182 pred_x= P_LEFT[0]; | |
1183 pred_y= P_LEFT[1]; | |
952 | 1184 P_TOP[0]= P_TOPRIGHT[0]= P_MEDIAN[0]= |
1185 P_TOP[1]= P_TOPRIGHT[1]= P_MEDIAN[1]= 0; //FIXME | |
951 | 1186 } else { |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1187 P_TOP[0] = s->p_mv_table[xy + s->mb_stride ][0]; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1188 P_TOP[1] = s->p_mv_table[xy + s->mb_stride ][1]; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1189 P_TOPRIGHT[0] = s->p_mv_table[xy + s->mb_stride - 1][0]; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1190 P_TOPRIGHT[1] = s->p_mv_table[xy + s->mb_stride - 1][1]; |
951 | 1191 if(P_TOP[1] < (rel_ymin<<shift)) P_TOP[1] = (rel_ymin<<shift); |
1192 if(P_TOPRIGHT[0] > (rel_xmax<<shift)) P_TOPRIGHT[0]= (rel_xmax<<shift); | |
1193 if(P_TOPRIGHT[1] < (rel_ymin<<shift)) P_TOPRIGHT[1]= (rel_ymin<<shift); | |
1194 | |
1195 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]); | |
1196 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]); | |
1197 | |
952 | 1198 pred_x = P_MEDIAN[0]; |
1199 pred_y = P_MEDIAN[1]; | |
951 | 1200 } |
954 | 1201 dmin = s->me.pre_motion_search(s, 0, &mx, &my, P, pred_x, pred_y, rel_xmin, rel_ymin, rel_xmax, rel_ymax, |
1202 &s->last_picture, s->p_mv_table, (1<<16)>>shift, mv_penalty); | |
952 | 1203 |
951 | 1204 s->p_mv_table[xy][0] = mx<<shift; |
1205 s->p_mv_table[xy][1] = my<<shift; | |
1206 | |
1207 return dmin; | |
1208 } | |
1209 | |
1057 | 1210 static int ff_estimate_motion_b(MpegEncContext * s, |
936 | 1211 int mb_x, int mb_y, int16_t (*mv_table)[2], Picture *picture, int f_code) |
0 | 1212 { |
327 | 1213 int mx, my, range, dmin; |
324 | 1214 int xmin, ymin, xmax, ymax; |
1215 int rel_xmin, rel_ymin, rel_xmax, rel_ymax; | |
1216 int pred_x=0, pred_y=0; | |
455 | 1217 int P[10][2]; |
324 | 1218 const int shift= 1+s->quarter_sample; |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1219 const int mot_stride = s->mb_stride; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1220 const int mot_xy = mb_y*mot_stride + mb_x; |
936 | 1221 uint8_t * const ref_picture= picture->data[0]; |
1162 | 1222 uint8_t * const mv_penalty= s->me.mv_penalty[f_code] + MAX_MV; |
948 | 1223 int mv_scale; |
936 | 1224 |
1225 s->me.penalty_factor = get_penalty_factor(s, s->avctx->me_cmp); | |
1226 s->me.sub_penalty_factor= get_penalty_factor(s, s->avctx->me_sub_cmp); | |
1013 | 1227 s->me.mb_penalty_factor = get_penalty_factor(s, s->avctx->mb_cmp); |
936 | 1228 |
1086 | 1229 get_limits(s, &range, &xmin, &ymin, &xmax, &ymax); |
455 | 1230 rel_xmin= xmin - mb_x*16; |
1231 rel_xmax= xmax - mb_x*16; | |
1232 rel_ymin= ymin - mb_y*16; | |
1233 rel_ymax= ymax - mb_y*16; | |
324 | 1234 |
1235 switch(s->me_method) { | |
1236 case ME_ZERO: | |
1237 default: | |
1238 no_motion_search(s, &mx, &my); | |
1239 dmin = 0; | |
455 | 1240 mx-= mb_x*16; |
1241 my-= mb_y*16; | |
324 | 1242 break; |
1243 case ME_FULL: | |
1244 dmin = full_motion_search(s, &mx, &my, range, xmin, ymin, xmax, ymax, ref_picture); | |
455 | 1245 mx-= mb_x*16; |
1246 my-= mb_y*16; | |
324 | 1247 break; |
1248 case ME_LOG: | |
1249 dmin = log_motion_search(s, &mx, &my, range / 2, xmin, ymin, xmax, ymax, ref_picture); | |
455 | 1250 mx-= mb_x*16; |
1251 my-= mb_y*16; | |
324 | 1252 break; |
1253 case ME_PHODS: | |
1254 dmin = phods_motion_search(s, &mx, &my, range / 2, xmin, ymin, xmax, ymax, ref_picture); | |
455 | 1255 mx-= mb_x*16; |
1256 my-= mb_y*16; | |
324 | 1257 break; |
1258 case ME_X1: | |
1259 case ME_EPZS: | |
1260 { | |
455 | 1261 P_LEFT[0] = mv_table[mot_xy - 1][0]; |
1262 P_LEFT[1] = mv_table[mot_xy - 1][1]; | |
324 | 1263 |
455 | 1264 if(P_LEFT[0] > (rel_xmax<<shift)) P_LEFT[0] = (rel_xmax<<shift); |
324 | 1265 |
1266 /* special case for first line */ | |
952 | 1267 if (mb_y) { |
455 | 1268 P_TOP[0] = mv_table[mot_xy - mot_stride ][0]; |
1269 P_TOP[1] = mv_table[mot_xy - mot_stride ][1]; | |
1270 P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1 ][0]; | |
1271 P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1 ][1]; | |
1272 if(P_TOP[1] > (rel_ymax<<shift)) P_TOP[1]= (rel_ymax<<shift); | |
1273 if(P_TOPRIGHT[0] < (rel_xmin<<shift)) P_TOPRIGHT[0]= (rel_xmin<<shift); | |
1274 if(P_TOPRIGHT[1] > (rel_ymax<<shift)) P_TOPRIGHT[1]= (rel_ymax<<shift); | |
324 | 1275 |
455 | 1276 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]); |
1277 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]); | |
324 | 1278 } |
455 | 1279 pred_x= P_LEFT[0]; |
1280 pred_y= P_LEFT[1]; | |
324 | 1281 } |
948 | 1282 |
1283 if(mv_table == s->b_forw_mv_table){ | |
1284 mv_scale= (s->pb_time<<16) / (s->pp_time<<shift); | |
1285 }else{ | |
1286 mv_scale= ((s->pb_time - s->pp_time)<<16) / (s->pp_time<<shift); | |
1287 } | |
1288 | |
936 | 1289 dmin = s->me.motion_search[0](s, 0, &mx, &my, P, pred_x, pred_y, rel_xmin, rel_ymin, rel_xmax, rel_ymax, |
948 | 1290 picture, s->p_mv_table, mv_scale, mv_penalty); |
324 | 1291 |
1292 break; | |
1293 } | |
1294 | |
936 | 1295 dmin= s->me.sub_motion_search(s, &mx, &my, dmin, rel_xmin, rel_ymin, rel_xmax, rel_ymax, |
1296 pred_x, pred_y, picture, 0, 0, mv_penalty); | |
1013 | 1297 |
1298 if(s->avctx->me_sub_cmp != s->avctx->mb_cmp && !s->me.skip) | |
1299 dmin= s->me.get_mb_score(s, mx, my, pred_x, pred_y, picture, mv_penalty); | |
1300 | |
455 | 1301 //printf("%d %d %d %d//", s->mb_x, s->mb_y, mx, my); |
324 | 1302 // s->mb_type[mb_y*s->mb_width + mb_x]= mb_type; |
1303 mv_table[mot_xy][0]= mx; | |
1304 mv_table[mot_xy][1]= my; | |
936 | 1305 |
327 | 1306 return dmin; |
324 | 1307 } |
1308 | |
327 | 1309 static inline int check_bidir_mv(MpegEncContext * s, |
1310 int mb_x, int mb_y, | |
1311 int motion_fx, int motion_fy, | |
1312 int motion_bx, int motion_by, | |
1313 int pred_fx, int pred_fy, | |
1314 int pred_bx, int pred_by) | |
1315 { | |
1316 //FIXME optimize? | |
936 | 1317 //FIXME move into template? |
1318 //FIXME better f_code prediction (max mv & distance) | |
1162 | 1319 uint8_t * const mv_penalty= s->me.mv_penalty[s->f_code] + MAX_MV; // f_code of the prev frame |
936 | 1320 uint8_t *dest_y = s->me.scratchpad; |
327 | 1321 uint8_t *ptr; |
1322 int dxy; | |
1323 int src_x, src_y; | |
1324 int fbmin; | |
1325 | |
936 | 1326 if(s->quarter_sample){ |
1327 dxy = ((motion_fy & 3) << 2) | (motion_fx & 3); | |
1328 src_x = mb_x * 16 + (motion_fx >> 2); | |
1329 src_y = mb_y * 16 + (motion_fy >> 2); | |
1389 | 1330 assert(src_x >=-16 && src_x<=s->h_edge_pos); |
1331 assert(src_y >=-16 && src_y<=s->v_edge_pos); | |
327 | 1332 |
936 | 1333 ptr = s->last_picture.data[0] + (src_y * s->linesize) + src_x; |
1334 s->dsp.put_qpel_pixels_tab[0][dxy](dest_y , ptr , s->linesize); | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1335 |
936 | 1336 dxy = ((motion_by & 3) << 2) | (motion_bx & 3); |
1337 src_x = mb_x * 16 + (motion_bx >> 2); | |
1338 src_y = mb_y * 16 + (motion_by >> 2); | |
1389 | 1339 assert(src_x >=-16 && src_x<=s->h_edge_pos); |
1340 assert(src_y >=-16 && src_y<=s->v_edge_pos); | |
936 | 1341 |
1342 ptr = s->next_picture.data[0] + (src_y * s->linesize) + src_x; | |
1343 s->dsp.avg_qpel_pixels_tab[0][dxy](dest_y , ptr , s->linesize); | |
1344 }else{ | |
1345 dxy = ((motion_fy & 1) << 1) | (motion_fx & 1); | |
1346 src_x = mb_x * 16 + (motion_fx >> 1); | |
1347 src_y = mb_y * 16 + (motion_fy >> 1); | |
1389 | 1348 assert(src_x >=-16 && src_x<=s->h_edge_pos); |
1349 assert(src_y >=-16 && src_y<=s->v_edge_pos); | |
327 | 1350 |
936 | 1351 ptr = s->last_picture.data[0] + (src_y * s->linesize) + src_x; |
1352 s->dsp.put_pixels_tab[0][dxy](dest_y , ptr , s->linesize, 16); | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1353 |
936 | 1354 dxy = ((motion_by & 1) << 1) | (motion_bx & 1); |
1355 src_x = mb_x * 16 + (motion_bx >> 1); | |
1356 src_y = mb_y * 16 + (motion_by >> 1); | |
1389 | 1357 assert(src_x >=-16 && src_x<=s->h_edge_pos); |
1358 assert(src_y >=-16 && src_y<=s->v_edge_pos); | |
936 | 1359 |
1360 ptr = s->next_picture.data[0] + (src_y * s->linesize) + src_x; | |
1361 s->dsp.avg_pixels_tab[0][dxy](dest_y , ptr , s->linesize, 16); | |
1362 } | |
853
eacc2dd8fd9d
* using DSPContext - so each codec could use its local (sub)set of CPU extension
kabi
parents:
847
diff
changeset
|
1363 |
1013 | 1364 fbmin = (mv_penalty[motion_fx-pred_fx] + mv_penalty[motion_fy-pred_fy])*s->me.mb_penalty_factor |
1365 +(mv_penalty[motion_bx-pred_bx] + mv_penalty[motion_by-pred_by])*s->me.mb_penalty_factor | |
1366 + s->dsp.mb_cmp[0](s, s->new_picture.data[0] + mb_x*16 + mb_y*16*s->linesize, dest_y, s->linesize); | |
1367 | |
1368 if(s->avctx->mb_cmp&FF_CMP_CHROMA){ | |
1369 } | |
1370 //FIXME CHROMA !!! | |
1371 | |
327 | 1372 return fbmin; |
1373 } | |
1374 | |
1375 /* refine the bidir vectors in hq mode and return the score in both lq & hq mode*/ | |
1376 static inline int bidir_refine(MpegEncContext * s, | |
1377 int mb_x, int mb_y) | |
1378 { | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1379 const int mot_stride = s->mb_stride; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1380 const int xy = mb_y *mot_stride + mb_x; |
327 | 1381 int fbmin; |
1382 int pred_fx= s->b_bidir_forw_mv_table[xy-1][0]; | |
1383 int pred_fy= s->b_bidir_forw_mv_table[xy-1][1]; | |
1384 int pred_bx= s->b_bidir_back_mv_table[xy-1][0]; | |
1385 int pred_by= s->b_bidir_back_mv_table[xy-1][1]; | |
1386 int motion_fx= s->b_bidir_forw_mv_table[xy][0]= s->b_forw_mv_table[xy][0]; | |
1387 int motion_fy= s->b_bidir_forw_mv_table[xy][1]= s->b_forw_mv_table[xy][1]; | |
1388 int motion_bx= s->b_bidir_back_mv_table[xy][0]= s->b_back_mv_table[xy][0]; | |
1389 int motion_by= s->b_bidir_back_mv_table[xy][1]= s->b_back_mv_table[xy][1]; | |
1390 | |
1391 //FIXME do refinement and add flag | |
1392 | |
1393 fbmin= check_bidir_mv(s, mb_x, mb_y, | |
1394 motion_fx, motion_fy, | |
1395 motion_bx, motion_by, | |
1396 pred_fx, pred_fy, | |
1397 pred_bx, pred_by); | |
1398 | |
1399 return fbmin; | |
1400 } | |
1401 | |
1402 static inline int direct_search(MpegEncContext * s, | |
1403 int mb_x, int mb_y) | |
324 | 1404 { |
455 | 1405 int P[10][2]; |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1406 const int mot_stride = s->mb_stride; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1407 const int mot_xy = mb_y*mot_stride + mb_x; |
936 | 1408 const int shift= 1+s->quarter_sample; |
1409 int dmin, i; | |
327 | 1410 const int time_pp= s->pp_time; |
664 | 1411 const int time_pb= s->pb_time; |
936 | 1412 int mx, my, xmin, xmax, ymin, ymax; |
327 | 1413 int16_t (*mv_table)[2]= s->b_direct_mv_table; |
1162 | 1414 uint8_t * const mv_penalty= s->me.mv_penalty[1] + MAX_MV; |
936 | 1415 |
1416 ymin= xmin=(-32)>>shift; | |
1417 ymax= xmax= 31>>shift; | |
1418 | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1419 if(IS_8X8(s->next_picture.mb_type[mot_xy])){ |
936 | 1420 s->mv_type= MV_TYPE_8X8; |
1421 }else{ | |
1422 s->mv_type= MV_TYPE_16X16; | |
327 | 1423 } |
936 | 1424 |
1425 for(i=0; i<4; i++){ | |
1426 int index= s->block_index[i]; | |
1427 int min, max; | |
1428 | |
1429 s->me.co_located_mv[i][0]= s->motion_val[index][0]; | |
1430 s->me.co_located_mv[i][1]= s->motion_val[index][1]; | |
1431 s->me.direct_basis_mv[i][0]= s->me.co_located_mv[i][0]*time_pb/time_pp + ((i& 1)<<(shift+3)); | |
1432 s->me.direct_basis_mv[i][1]= s->me.co_located_mv[i][1]*time_pb/time_pp + ((i>>1)<<(shift+3)); | |
1433 // s->me.direct_basis_mv[1][i][0]= s->me.co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(shift+3); | |
1434 // s->me.direct_basis_mv[1][i][1]= s->me.co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(shift+3); | |
1435 | |
1436 max= FFMAX(s->me.direct_basis_mv[i][0], s->me.direct_basis_mv[i][0] - s->me.co_located_mv[i][0])>>shift; | |
1437 min= FFMIN(s->me.direct_basis_mv[i][0], s->me.direct_basis_mv[i][0] - s->me.co_located_mv[i][0])>>shift; | |
1050 | 1438 max+= (2*mb_x + (i& 1))*8 + 1; // +-1 is for the simpler rounding |
1439 min+= (2*mb_x + (i& 1))*8 - 1; | |
960 | 1440 xmax= FFMIN(xmax, s->width - max); |
1441 xmin= FFMAX(xmin, - 16 - min); | |
936 | 1442 |
1443 max= FFMAX(s->me.direct_basis_mv[i][1], s->me.direct_basis_mv[i][1] - s->me.co_located_mv[i][1])>>shift; | |
1444 min= FFMIN(s->me.direct_basis_mv[i][1], s->me.direct_basis_mv[i][1] - s->me.co_located_mv[i][1])>>shift; | |
1050 | 1445 max+= (2*mb_y + (i>>1))*8 + 1; // +-1 is for the simpler rounding |
1446 min+= (2*mb_y + (i>>1))*8 - 1; | |
960 | 1447 ymax= FFMIN(ymax, s->height - max); |
1448 ymin= FFMAX(ymin, - 16 - min); | |
936 | 1449 |
1450 if(s->mv_type == MV_TYPE_16X16) break; | |
327 | 1451 } |
936 | 1452 |
1453 assert(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16); | |
1454 | |
1455 if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){ | |
1456 s->b_direct_mv_table[mot_xy][0]= 0; | |
1457 s->b_direct_mv_table[mot_xy][1]= 0; | |
1458 | |
1459 return 256*256*256*64; | |
1460 } | |
1461 | |
950 | 1462 P_LEFT[0] = clip(mv_table[mot_xy - 1][0], xmin<<shift, xmax<<shift); |
1463 P_LEFT[1] = clip(mv_table[mot_xy - 1][1], ymin<<shift, ymax<<shift); | |
1464 | |
1465 /* special case for first line */ | |
952 | 1466 if (mb_y) { |
950 | 1467 P_TOP[0] = clip(mv_table[mot_xy - mot_stride ][0], xmin<<shift, xmax<<shift); |
1468 P_TOP[1] = clip(mv_table[mot_xy - mot_stride ][1], ymin<<shift, ymax<<shift); | |
1469 P_TOPRIGHT[0] = clip(mv_table[mot_xy - mot_stride + 1 ][0], xmin<<shift, xmax<<shift); | |
1470 P_TOPRIGHT[1] = clip(mv_table[mot_xy - mot_stride + 1 ][1], ymin<<shift, ymax<<shift); | |
1471 | |
1472 P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]); | |
1473 P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]); | |
1474 } | |
1013 | 1475 |
1476 //FIXME direct_search ptr in context!!! (needed for chroma anyway or this will get messy) | |
936 | 1477 if(s->flags&CODEC_FLAG_QPEL){ |
1478 dmin = simple_direct_qpel_epzs_motion_search(s, 0, &mx, &my, P, 0, 0, xmin, ymin, xmax, ymax, | |
948 | 1479 &s->last_picture, mv_table, 1<<14, mv_penalty); |
936 | 1480 dmin = simple_direct_qpel_qpel_motion_search(s, &mx, &my, dmin, xmin, ymin, xmax, ymax, |
1481 0, 0, &s->last_picture, 0, 0, mv_penalty); | |
1013 | 1482 |
1483 if(s->avctx->me_sub_cmp != s->avctx->mb_cmp && !s->me.skip) | |
1484 dmin= simple_direct_qpel_qpel_get_mb_score(s, mx, my, 0, 0, &s->last_picture, mv_penalty); | |
936 | 1485 }else{ |
1486 dmin = simple_direct_hpel_epzs_motion_search(s, 0, &mx, &my, P, 0, 0, xmin, ymin, xmax, ymax, | |
948 | 1487 &s->last_picture, mv_table, 1<<15, mv_penalty); |
936 | 1488 dmin = simple_direct_hpel_hpel_motion_search(s, &mx, &my, dmin, xmin, ymin, xmax, ymax, |
1489 0, 0, &s->last_picture, 0, 0, mv_penalty); | |
1013 | 1490 |
1491 if(s->avctx->me_sub_cmp != s->avctx->mb_cmp && !s->me.skip) | |
1492 dmin= simple_direct_hpel_hpel_get_mb_score(s, mx, my, 0, 0, &s->last_picture, mv_penalty); | |
327 | 1493 } |
1494 | |
1495 s->b_direct_mv_table[mot_xy][0]= mx; | |
1496 s->b_direct_mv_table[mot_xy][1]= my; | |
1497 return dmin; | |
324 | 1498 } |
1499 | |
1500 void ff_estimate_b_frame_motion(MpegEncContext * s, | |
1501 int mb_x, int mb_y) | |
1502 { | |
1013 | 1503 const int penalty_factor= s->me.mb_penalty_factor; |
327 | 1504 int fmin, bmin, dmin, fbmin; |
1505 int type=0; | |
1506 | |
1426 | 1507 s->me.skip=0; |
1508 if (s->codec_id == CODEC_ID_MPEG4) | |
1509 dmin= direct_search(s, mb_x, mb_y); | |
1510 else | |
1511 dmin= INT_MAX; | |
324 | 1512 |
1426 | 1513 s->me.skip=0; |
1013 | 1514 fmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, &s->last_picture, s->f_code) + 3*penalty_factor; |
1426 | 1515 |
1516 s->me.skip=0; | |
1013 | 1517 bmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, &s->next_picture, s->b_code) + 2*penalty_factor; |
324 | 1518 //printf(" %d %d ", s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1]); |
327 | 1519 |
1426 | 1520 s->me.skip=0; |
1013 | 1521 fbmin= bidir_refine(s, mb_x, mb_y) + penalty_factor; |
1522 //printf("%d %d %d %d\n", dmin, fmin, bmin, fbmin); | |
612 | 1523 { |
1051
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1524 int score= fmin; |
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1525 type = MB_TYPE_FORWARD; |
327 | 1526 |
1426 | 1527 if (dmin <= score){ |
1051
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1528 score = dmin; |
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1529 type = MB_TYPE_DIRECT; |
327 | 1530 } |
1531 if(bmin<score){ | |
1532 score=bmin; | |
1533 type= MB_TYPE_BACKWARD; | |
1534 } | |
1535 if(fbmin<score){ | |
1536 score=fbmin; | |
1537 type= MB_TYPE_BIDIR; | |
1538 } | |
1013 | 1539 |
807
0e1d375c537f
fixing q>0.0 assert failure caused by overflow of variance for b frames
michaelni
parents:
765
diff
changeset
|
1540 score= ((unsigned)(score*score + 128*256))>>16; |
903 | 1541 s->current_picture.mc_mb_var_sum += score; |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1542 s->current_picture.mc_mb_var[mb_y*s->mb_stride + mb_x] = score; //FIXME use SSE |
327 | 1543 } |
612 | 1544 |
1389 | 1545 if(s->avctx->mb_decision > FF_MB_DECISION_SIMPLE){ |
612 | 1546 type= MB_TYPE_FORWARD | MB_TYPE_BACKWARD | MB_TYPE_BIDIR | MB_TYPE_DIRECT; //FIXME something smarter |
936 | 1547 if(dmin>256*256*16) type&= ~MB_TYPE_DIRECT; //dont try direct mode if its invalid for this MB |
612 | 1548 } |
1549 | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1550 s->mb_type[mb_y*s->mb_stride + mb_x]= type; |
324 | 1551 } |
0 | 1552 |
324 | 1553 /* find best f_code for ME which do unlimited searches */ |
1554 int ff_get_best_fcode(MpegEncContext * s, int16_t (*mv_table)[2], int type) | |
1555 { | |
1556 if(s->me_method>=ME_EPZS){ | |
455 | 1557 int score[8]; |
324 | 1558 int i, y; |
1064 | 1559 uint8_t * fcode_tab= s->fcode_tab; |
455 | 1560 int best_fcode=-1; |
1561 int best_score=-10000000; | |
324 | 1562 |
936 | 1563 for(i=0; i<8; i++) score[i]= s->mb_num*(8-i); |
324 | 1564 |
1565 for(y=0; y<s->mb_height; y++){ | |
1566 int x; | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1567 int xy= y*s->mb_stride; |
324 | 1568 for(x=0; x<s->mb_width; x++){ |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1569 if(s->mb_type[xy] & type){ |
847 | 1570 int fcode= FFMAX(fcode_tab[mv_table[xy][0] + MAX_MV], |
1571 fcode_tab[mv_table[xy][1] + MAX_MV]); | |
455 | 1572 int j; |
1573 | |
1574 for(j=0; j<fcode && j<8; j++){ | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1575 if(s->pict_type==B_TYPE || s->current_picture.mc_mb_var[xy] < s->current_picture.mb_var[xy]) |
455 | 1576 score[j]-= 170; |
1577 } | |
324 | 1578 } |
1579 xy++; | |
1580 } | |
1581 } | |
455 | 1582 |
1583 for(i=1; i<8; i++){ | |
1584 if(score[i] > best_score){ | |
1585 best_score= score[i]; | |
1586 best_fcode= i; | |
1587 } | |
1588 // printf("%d %d\n", i, score[i]); | |
1589 } | |
327 | 1590 |
324 | 1591 // printf("fcode: %d type: %d\n", i, s->pict_type); |
455 | 1592 return best_fcode; |
324 | 1593 /* for(i=0; i<=MAX_FCODE; i++){ |
1594 printf("%d ", mv_num[i]); | |
1595 } | |
1596 printf("\n");*/ | |
1597 }else{ | |
1598 return 1; | |
0 | 1599 } |
1600 } | |
1601 | |
324 | 1602 void ff_fix_long_p_mvs(MpegEncContext * s) |
1603 { | |
1604 const int f_code= s->f_code; | |
1086 | 1605 int y, range; |
1421 | 1606 assert(s->pict_type==P_TYPE); |
1086 | 1607 |
1421 | 1608 range = (((s->out_format == FMT_MPEG1) ? 8 : 16) << f_code); |
1086 | 1609 |
1610 if(s->msmpeg4_version) range= 16; | |
1611 | |
1612 if(s->avctx->me_range && range > s->avctx->me_range) range= s->avctx->me_range; | |
1613 | |
324 | 1614 /* clip / convert to intra 16x16 type MVs */ |
1615 for(y=0; y<s->mb_height; y++){ | |
1616 int x; | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1617 int xy= y*s->mb_stride; |
324 | 1618 for(x=0; x<s->mb_width; x++){ |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1619 if(s->mb_type[xy]&MB_TYPE_INTER){ |
1086 | 1620 if( s->p_mv_table[xy][0] >=range || s->p_mv_table[xy][0] <-range |
1621 || s->p_mv_table[xy][1] >=range || s->p_mv_table[xy][1] <-range){ | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1622 s->mb_type[xy] &= ~MB_TYPE_INTER; |
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1623 s->mb_type[xy] |= MB_TYPE_INTRA; |
324 | 1624 s->p_mv_table[xy][0] = 0; |
1625 s->p_mv_table[xy][1] = 0; | |
1626 } | |
1627 } | |
1628 xy++; | |
1629 } | |
1630 } | |
455 | 1631 //printf("%d no:%d %d//\n", clip, noclip, f_code); |
324 | 1632 if(s->flags&CODEC_FLAG_4MV){ |
1633 const int wrap= 2+ s->mb_width*2; | |
1634 | |
1635 /* clip / convert to intra 8x8 type MVs */ | |
1636 for(y=0; y<s->mb_height; y++){ | |
1637 int xy= (y*2 + 1)*wrap + 1; | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1638 int i= y*s->mb_stride; |
324 | 1639 int x; |
1640 | |
1641 for(x=0; x<s->mb_width; x++){ | |
1642 if(s->mb_type[i]&MB_TYPE_INTER4V){ | |
1643 int block; | |
1644 for(block=0; block<4; block++){ | |
1645 int off= (block& 1) + (block>>1)*wrap; | |
1646 int mx= s->motion_val[ xy + off ][0]; | |
1647 int my= s->motion_val[ xy + off ][1]; | |
1648 | |
1086 | 1649 if( mx >=range || mx <-range |
1650 || my >=range || my <-range){ | |
324 | 1651 s->mb_type[i] &= ~MB_TYPE_INTER4V; |
1652 s->mb_type[i] |= MB_TYPE_INTRA; | |
1653 } | |
1654 } | |
1655 } | |
502 | 1656 xy+=2; |
1657 i++; | |
324 | 1658 } |
1659 } | |
1660 } | |
1661 } | |
1662 | |
1663 void ff_fix_long_b_mvs(MpegEncContext * s, int16_t (*mv_table)[2], int f_code, int type) | |
1664 { | |
1665 int y; | |
1666 | |
1051
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1667 // RAL: 8 in MPEG-1, 16 in MPEG-4 |
1421 | 1668 int range = (((s->out_format == FMT_MPEG1) ? 8 : 16) << f_code); |
1086 | 1669 |
1670 if(s->avctx->me_range && range > s->avctx->me_range) range= s->avctx->me_range; | |
1051
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1671 |
324 | 1672 /* clip / convert to intra 16x16 type MVs */ |
1673 for(y=0; y<s->mb_height; y++){ | |
1674 int x; | |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1675 int xy= y*s->mb_stride; |
1086 | 1676 for(x=0; x<s->mb_width; x++){ |
1177
fea03d2c4946
simplified adressing of most mb based arrays (mb_x + mb_y*s->mb_stride) now instead of mb_x + mb_y*mb_width and 1+mb_x + (1+mb_y)*(mb_width+2) and ... mixture
michaelni
parents:
1162
diff
changeset
|
1677 if (s->mb_type[xy] & type){ // RAL: "type" test added... |
1086 | 1678 if( mv_table[xy][0] >=range || mv_table[xy][0] <-range |
1679 || mv_table[xy][1] >=range || mv_table[xy][1] <-range){ | |
1680 | |
1681 if(s->codec_id == CODEC_ID_MPEG1VIDEO && 0){ | |
1682 }else{ | |
1683 if (mv_table[xy][0] > range-1) mv_table[xy][0]= range-1; | |
1684 else if(mv_table[xy][0] < -range ) mv_table[xy][0]= -range; | |
1685 if (mv_table[xy][1] > range-1) mv_table[xy][1]= range-1; | |
1686 else if(mv_table[xy][1] < -range ) mv_table[xy][1]= -range; | |
1051
e5a9dbf597d4
mpeg1 bframe encoding patch by (Rapha¸«³l LEGRAND) with some modifications by me
michaelni
parents:
1050
diff
changeset
|
1687 } |
1086 | 1688 } |
324 | 1689 } |
1690 xy++; | |
1691 } | |
1692 } | |
1693 } |