37 |
#include "../prediction/mbprediction.h" |
#include "../prediction/mbprediction.h" |
38 |
#include "../global.h" |
#include "../global.h" |
39 |
#include "../utils/timer.h" |
#include "../utils/timer.h" |
40 |
|
#include "../image/interpolate8x8.h" |
41 |
#include "motion_est.h" |
#include "motion_est.h" |
42 |
#include "motion.h" |
#include "motion.h" |
43 |
#include "sad.h" |
#include "sad.h" |
52 |
#define CHECK_CANDIDATE(X,Y,D) { \ |
#define CHECK_CANDIDATE(X,Y,D) { \ |
53 |
(*CheckCandidate)((const int)(X),(const int)(Y), (D), &iDirection, data ); } |
(*CheckCandidate)((const int)(X),(const int)(Y), (D), &iDirection, data ); } |
54 |
|
|
55 |
|
#define GET_REFERENCE(X, Y, REF) { \ |
56 |
|
switch ( ((X&1)<<1) + (Y&1) ) \ |
57 |
|
{ \ |
58 |
|
case 0 : REF = data->Ref + (X)/2 + ((Y)/2)*(data->iEdgedWidth); break; \ |
59 |
|
case 1 : REF = data->RefV + (X)/2 + (((Y)-1)/2)*(data->iEdgedWidth); break; \ |
60 |
|
case 2 : REF = data->RefH + ((X)-1)/2 + ((Y)/2)*(data->iEdgedWidth); break; \ |
61 |
|
default : REF = data->RefHV + ((X)-1)/2 + (((Y)-1)/2)*(data->iEdgedWidth); break; \ |
62 |
|
} \ |
63 |
|
} |
64 |
|
|
65 |
#define iDiamondSize 2 |
#define iDiamondSize 2 |
66 |
|
|
67 |
static __inline int |
static __inline int |
150 |
|
|
151 |
sad = lambda_vec16[data->iQuant] * |
sad = lambda_vec16[data->iQuant] * |
152 |
d_mv_bits(x - data->predMV.x, y - data->predMV.y, data->iFcode); |
d_mv_bits(x - data->predMV.x, y - data->predMV.y, data->iFcode); |
153 |
sad += sad16(data->Cur, Reference, data->iEdgedWidth, 256*4096); |
sad += sad16(data->Cur, Reference, data->iEdgedWidth, MV_MAX_ERROR); |
154 |
|
|
155 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
156 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
159 |
} |
} |
160 |
|
|
161 |
static void |
static void |
162 |
|
CheckCandidate16_qpel(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
163 |
|
|
164 |
|
// CheckCandidate16 variant which expects x and y in quarter pixel resolution |
165 |
|
// Important: This is no general usable routine! x and y must be +/-1 (qpel resolution!) |
166 |
|
// around currentMV! |
167 |
|
{ |
168 |
|
int32_t * const sad = data->temp; |
169 |
|
int t; |
170 |
|
uint8_t * Reference = (uint8_t *) data->RefQ; |
171 |
|
const uint8_t *ref1, *ref2, *ref3, *ref4; |
172 |
|
VECTOR halfpelMV = *(data->currentMV); |
173 |
|
|
174 |
|
int32_t iEdgedWidth = data->iEdgedWidth; |
175 |
|
uint32_t rounding = data->rounding; |
176 |
|
|
177 |
|
if (( x > data->max_dx) || ( x < data->min_dx) |
178 |
|
|| ( y > data->max_dy) || (y < data->min_dy)) return; |
179 |
|
|
180 |
|
switch( ((x&1)<<1) + (y&1) ) |
181 |
|
{ |
182 |
|
case 0: // pure halfpel position - shouldn't happen during a refinement step |
183 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, (const uint8_t *) Reference); |
184 |
|
break; |
185 |
|
|
186 |
|
case 1: // x halfpel, y qpel - top or bottom during qpel refinement |
187 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
188 |
|
GET_REFERENCE(halfpelMV.x, y - halfpelMV.y, ref2); |
189 |
|
|
190 |
|
interpolate8x8_avg2(Reference, ref1, ref2, iEdgedWidth, rounding); |
191 |
|
interpolate8x8_avg2(Reference+8, ref1+8, ref2+8, iEdgedWidth, rounding); |
192 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth, ref1+8*iEdgedWidth, ref2+8*iEdgedWidth, iEdgedWidth, rounding); |
193 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, iEdgedWidth, rounding); |
194 |
|
break; |
195 |
|
|
196 |
|
case 2: // x qpel, y halfpel - left or right during qpel refinement |
197 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
198 |
|
GET_REFERENCE(x - halfpelMV.x, halfpelMV.y, ref2); |
199 |
|
|
200 |
|
interpolate8x8_avg2(Reference, ref1, ref2, iEdgedWidth, rounding); |
201 |
|
interpolate8x8_avg2(Reference+8, ref1+8, ref2+8, iEdgedWidth, rounding); |
202 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth, ref1+8*iEdgedWidth, ref2+8*iEdgedWidth, iEdgedWidth, rounding); |
203 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, iEdgedWidth, rounding); |
204 |
|
break; |
205 |
|
|
206 |
|
default: // x and y in qpel resolution - the "corners" (top left/right and |
207 |
|
// bottom left/right) during qpel refinement |
208 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
209 |
|
GET_REFERENCE(halfpelMV.x, y - halfpelMV.y, ref2); |
210 |
|
GET_REFERENCE(x - halfpelMV.x, halfpelMV.y, ref3); |
211 |
|
GET_REFERENCE(x - halfpelMV.x, y - halfpelMV.y, ref4); |
212 |
|
|
213 |
|
interpolate8x8_avg4(Reference, ref1, ref2, ref3, ref4, iEdgedWidth, rounding); |
214 |
|
interpolate8x8_avg4(Reference+8, ref1+8, ref2+8, ref3+8, ref4+8, iEdgedWidth, rounding); |
215 |
|
interpolate8x8_avg4(Reference+8*iEdgedWidth, ref1+8*iEdgedWidth, ref2+8*iEdgedWidth, ref3+8*iEdgedWidth, ref4+8*iEdgedWidth, iEdgedWidth, rounding); |
216 |
|
interpolate8x8_avg4(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, ref3+8*iEdgedWidth+8, ref4+8*iEdgedWidth+8, iEdgedWidth, rounding); |
217 |
|
break; |
218 |
|
} |
219 |
|
|
220 |
|
data->temp[0] = sad16v(data->Cur, Reference, data->iEdgedWidth, sad+1); |
221 |
|
|
222 |
|
t = d_mv_bits(x - data->predQMV.x, y - data->predQMV.y, data->iFcode); |
223 |
|
data->temp[0] += lambda_vec16[data->iQuant] * t; |
224 |
|
data->temp[1] += lambda_vec8[data->iQuant] * t; |
225 |
|
|
226 |
|
if (data->temp[0] < data->iMinSAD[0]) { |
227 |
|
data->iMinSAD[0] = data->temp[0]; |
228 |
|
data->currentQMV[0].x = x; data->currentQMV[0].y = y; |
229 |
|
*dir = Direction; } |
230 |
|
|
231 |
|
if (data->temp[1] < data->iMinSAD[1]) { |
232 |
|
data->iMinSAD[1] = data->temp[1]; data->currentQMV[1].x = x; data->currentQMV[1].y = y; } |
233 |
|
if (data->temp[2] < data->iMinSAD[2]) { |
234 |
|
data->iMinSAD[2] = data->temp[2]; data->currentQMV[2].x = x; data->currentQMV[2].y = y; } |
235 |
|
if (data->temp[3] < data->iMinSAD[3]) { |
236 |
|
data->iMinSAD[3] = data->temp[3]; data->currentQMV[3].x = x; data->currentQMV[3].y = y; } |
237 |
|
if (data->temp[4] < data->iMinSAD[4]) { |
238 |
|
data->iMinSAD[4] = data->temp[4]; data->currentQMV[4].x = x; data->currentQMV[4].y = y; } |
239 |
|
} |
240 |
|
|
241 |
|
static void |
242 |
|
CheckCandidate16no4v_qpel(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
243 |
|
|
244 |
|
// CheckCandidate16no4v variant which expects x and y in quarter pixel resolution |
245 |
|
// Important: This is no general usable routine! x and y must be +/-1 (qpel resolution!) |
246 |
|
// around currentMV! |
247 |
|
{ |
248 |
|
int32_t sad; |
249 |
|
uint8_t * Reference = (uint8_t *) data->RefQ; |
250 |
|
const uint8_t *ref1, *ref2, *ref3, *ref4; |
251 |
|
VECTOR halfpelMV = *(data->currentMV); |
252 |
|
|
253 |
|
int32_t iEdgedWidth = data->iEdgedWidth; |
254 |
|
uint32_t rounding = data->rounding; |
255 |
|
|
256 |
|
if (( x > data->max_dx) || ( x < data->min_dx) |
257 |
|
|| ( y > data->max_dy) || (y < data->min_dy)) return; |
258 |
|
|
259 |
|
switch( ((x&1)<<1) + (y&1) ) |
260 |
|
{ |
261 |
|
case 0: // pure halfpel position - shouldn't happen during a refinement step |
262 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, (const uint8_t *) Reference); |
263 |
|
break; |
264 |
|
|
265 |
|
case 1: // x halfpel, y qpel - top or bottom during qpel refinement |
266 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
267 |
|
GET_REFERENCE(halfpelMV.x, y - halfpelMV.y, ref2); |
268 |
|
|
269 |
|
interpolate8x8_avg2(Reference, ref1, ref2, iEdgedWidth, rounding); |
270 |
|
interpolate8x8_avg2(Reference+8, ref1+8, ref2+8, iEdgedWidth, rounding); |
271 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth, ref1+8*iEdgedWidth, ref2+8*iEdgedWidth, iEdgedWidth, rounding); |
272 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, iEdgedWidth, rounding); |
273 |
|
break; |
274 |
|
|
275 |
|
case 2: // x qpel, y halfpel - left or right during qpel refinement |
276 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
277 |
|
GET_REFERENCE(x - halfpelMV.x, halfpelMV.y, ref2); |
278 |
|
|
279 |
|
interpolate8x8_avg2(Reference, ref1, ref2, iEdgedWidth, rounding); |
280 |
|
interpolate8x8_avg2(Reference+8, ref1+8, ref2+8, iEdgedWidth, rounding); |
281 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth, ref1+8*iEdgedWidth, ref2+8*iEdgedWidth, iEdgedWidth, rounding); |
282 |
|
interpolate8x8_avg2(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, iEdgedWidth, rounding); |
283 |
|
break; |
284 |
|
|
285 |
|
default: // x and y in qpel resolution - the "corners" (top left/right and |
286 |
|
// bottom left/right) during qpel refinement |
287 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
288 |
|
GET_REFERENCE(halfpelMV.x, y - halfpelMV.y, ref2); |
289 |
|
GET_REFERENCE(x - halfpelMV.x, halfpelMV.y, ref3); |
290 |
|
GET_REFERENCE(x - halfpelMV.x, y - halfpelMV.y, ref4); |
291 |
|
|
292 |
|
interpolate8x8_avg4(Reference, ref1, ref2, ref3, ref4, iEdgedWidth, rounding); |
293 |
|
interpolate8x8_avg4(Reference+8, ref1+8, ref2+8, ref3+8, ref4+8, iEdgedWidth, rounding); |
294 |
|
interpolate8x8_avg4(Reference+8*iEdgedWidth, ref1+8*iEdgedWidth, ref2+8*iEdgedWidth, ref3+8*iEdgedWidth, ref4+8*iEdgedWidth, iEdgedWidth, rounding); |
295 |
|
interpolate8x8_avg4(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, ref3+8*iEdgedWidth+8, ref4+8*iEdgedWidth+8, iEdgedWidth, rounding); |
296 |
|
break; |
297 |
|
} |
298 |
|
|
299 |
|
sad = lambda_vec16[data->iQuant] * |
300 |
|
d_mv_bits(x - data->predQMV.x, y - data->predQMV.y, data->iFcode); |
301 |
|
sad += sad16(data->Cur, Reference, data->iEdgedWidth, MV_MAX_ERROR); |
302 |
|
|
303 |
|
if (sad < *(data->iMinSAD)) { |
304 |
|
*(data->iMinSAD) = sad; |
305 |
|
data->currentQMV[0].x = x; data->currentQMV[0].y = y; |
306 |
|
*dir = Direction; |
307 |
|
} |
308 |
|
} |
309 |
|
|
310 |
|
static void |
311 |
CheckCandidate16no4vI(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate16no4vI(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
312 |
{ |
{ |
313 |
int32_t sad; |
int32_t sad; |
429 |
const uint8_t *ReferenceB; |
const uint8_t *ReferenceB; |
430 |
VECTOR mvs, b_mvs; |
VECTOR mvs, b_mvs; |
431 |
|
|
432 |
if (( x > 31) || ( x < -31) || ( y > 31) || (y < -31)) return; |
if (( x > 31) || ( x < -32) || ( y > 31) || (y < -32)) return; |
433 |
|
|
434 |
sad = lambda_vec16[data->iQuant] * d_mv_bits(x, y, 1); |
sad = lambda_vec16[data->iQuant] * d_mv_bits(x, y, 1); |
435 |
|
|
496 |
*dir = Direction; } |
*dir = Direction; } |
497 |
} |
} |
498 |
|
|
499 |
|
static void |
500 |
|
CheckCandidate8_qpel(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
501 |
|
// CheckCandidate16no4v variant which expects x and y in quarter pixel resolution |
502 |
|
// Important: This is no general usable routine! x and y must be +/-1 (qpel resolution!) |
503 |
|
// around currentMV! |
504 |
|
|
505 |
|
{ |
506 |
|
int32_t sad; |
507 |
|
uint8_t *Reference = (uint8_t *) data->RefQ; |
508 |
|
const uint8_t *ref1, *ref2, *ref3, *ref4; |
509 |
|
VECTOR halfpelMV = *(data->currentMV); |
510 |
|
|
511 |
|
int32_t iEdgedWidth = data->iEdgedWidth; |
512 |
|
uint32_t rounding = data->rounding; |
513 |
|
|
514 |
|
if (( x > data->max_dx) || ( x < data->min_dx) |
515 |
|
|| ( y > data->max_dy) || (y < data->min_dy)) return; |
516 |
|
|
517 |
|
switch( ((x&1)<<1) + (y&1) ) |
518 |
|
{ |
519 |
|
case 0: // pure halfpel position - shouldn't happen during a refinement step |
520 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, (const uint8_t *) Reference); |
521 |
|
break; |
522 |
|
|
523 |
|
case 1: // x halfpel, y qpel - top or bottom during qpel refinement |
524 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
525 |
|
GET_REFERENCE(halfpelMV.x, y - halfpelMV.y, ref2); |
526 |
|
|
527 |
|
interpolate8x8_avg2(Reference, ref1, ref2, iEdgedWidth, rounding); |
528 |
|
break; |
529 |
|
|
530 |
|
case 2: // x qpel, y halfpel - left or right during qpel refinement |
531 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
532 |
|
GET_REFERENCE(x - halfpelMV.x, halfpelMV.y, ref2); |
533 |
|
|
534 |
|
interpolate8x8_avg2(Reference, ref1, ref2, iEdgedWidth, rounding); |
535 |
|
break; |
536 |
|
|
537 |
|
default: // x and y in qpel resolution - the "corners" (top left/right and |
538 |
|
// bottom left/right) during qpel refinement |
539 |
|
GET_REFERENCE(halfpelMV.x, halfpelMV.y, ref1); |
540 |
|
GET_REFERENCE(halfpelMV.x, y - halfpelMV.y, ref2); |
541 |
|
GET_REFERENCE(x - halfpelMV.x, halfpelMV.y, ref3); |
542 |
|
GET_REFERENCE(x - halfpelMV.x, y - halfpelMV.y, ref4); |
543 |
|
|
544 |
|
interpolate8x8_avg4(Reference, ref1, ref2, ref3, ref4, iEdgedWidth, rounding); |
545 |
|
break; |
546 |
|
} |
547 |
|
|
548 |
|
sad = sad8(data->Cur, Reference, data->iEdgedWidth); |
549 |
|
sad += lambda_vec8[data->iQuant] * d_mv_bits(x - data->predQMV.x, y - data->predQMV.y, data->iFcode); |
550 |
|
|
551 |
|
if (sad < *(data->iMinSAD)) { |
552 |
|
*(data->iMinSAD) = sad; |
553 |
|
data->currentQMV->x = x; data->currentQMV->y = y; |
554 |
|
*dir = Direction; } |
555 |
|
} |
556 |
|
|
557 |
/* CHECK_CANDIATE FUNCTIONS END */ |
/* CHECK_CANDIATE FUNCTIONS END */ |
558 |
|
|
559 |
/* MAINSEARCH FUNCTIONS START */ |
/* MAINSEARCH FUNCTIONS START */ |
722 |
CHECK_CANDIDATE(backupMV.x, backupMV.y - 1, 0); |
CHECK_CANDIDATE(backupMV.x, backupMV.y - 1, 0); |
723 |
} |
} |
724 |
|
|
725 |
|
|
726 |
|
static void |
727 |
|
QuarterpelRefine(const SearchData * const data) |
728 |
|
{ |
729 |
|
/* Perform quarter pixel refinement*/ |
730 |
|
|
731 |
|
VECTOR backupMV = *(data->currentQMV); |
732 |
|
int iDirection; //not needed |
733 |
|
|
734 |
|
CHECK_CANDIDATE(backupMV.x - 1, backupMV.y - 1, 0); |
735 |
|
CHECK_CANDIDATE(backupMV.x + 1, backupMV.y - 1, 0); |
736 |
|
CHECK_CANDIDATE(backupMV.x - 1, backupMV.y + 1, 0); |
737 |
|
CHECK_CANDIDATE(backupMV.x + 1, backupMV.y + 1, 0); |
738 |
|
|
739 |
|
CHECK_CANDIDATE(backupMV.x - 1, backupMV.y, 0); |
740 |
|
CHECK_CANDIDATE(backupMV.x + 1, backupMV.y, 0); |
741 |
|
|
742 |
|
CHECK_CANDIDATE(backupMV.x, backupMV.y + 1, 0); |
743 |
|
CHECK_CANDIDATE(backupMV.x, backupMV.y - 1, 0); |
744 |
|
|
745 |
|
} |
746 |
|
|
747 |
static __inline int |
static __inline int |
748 |
SkipDecisionP(const IMAGE * current, const IMAGE * reference, |
SkipDecisionP(const IMAGE * current, const IMAGE * reference, |
749 |
const int x, const int y, |
const int x, const int y, |
770 |
pMB->mode = MODE_NOT_CODED; |
pMB->mode = MODE_NOT_CODED; |
771 |
pMB->mvs[0].x = pMB->mvs[1].x = pMB->mvs[2].x = pMB->mvs[3].x = 0; |
pMB->mvs[0].x = pMB->mvs[1].x = pMB->mvs[2].x = pMB->mvs[3].x = 0; |
772 |
pMB->mvs[0].y = pMB->mvs[1].y = pMB->mvs[2].y = pMB->mvs[3].y = 0; |
pMB->mvs[0].y = pMB->mvs[1].y = pMB->mvs[2].y = pMB->mvs[3].y = 0; |
773 |
|
|
774 |
|
pMB->qmvs[0].x = pMB->qmvs[1].x = pMB->qmvs[2].x = pMB->qmvs[3].x = 0; |
775 |
|
pMB->qmvs[0].y = pMB->qmvs[1].y = pMB->qmvs[2].y = pMB->qmvs[3].y = 0; |
776 |
|
|
777 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = sad; |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = sad; |
778 |
} |
} |
779 |
|
|
794 |
|
|
795 |
uint32_t x, y; |
uint32_t x, y; |
796 |
uint32_t iIntra = 0; |
uint32_t iIntra = 0; |
797 |
int32_t InterBias; |
int32_t InterBias, quant = current->quant; |
798 |
|
uint8_t *qimage; |
799 |
|
|
800 |
// some pre-initialized thingies for SearchP |
// some pre-initialized thingies for SearchP |
801 |
int32_t temp[5]; |
int32_t temp[5]; |
802 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
803 |
|
VECTOR currentQMV[5]; |
804 |
int32_t iMinSAD[5]; |
int32_t iMinSAD[5]; |
805 |
SearchData Data; |
SearchData Data; |
806 |
Data.iEdgedWidth = pParam->edged_width; |
Data.iEdgedWidth = pParam->edged_width; |
807 |
Data.currentMV = currentMV; |
Data.currentMV = currentMV; |
808 |
|
Data.currentQMV = currentQMV; |
809 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
810 |
Data.temp = temp; |
Data.temp = temp; |
811 |
Data.iFcode = current->fcode; |
Data.iFcode = current->fcode; |
812 |
|
Data.rounding = pParam->m_rounding_type; |
813 |
|
|
814 |
|
if((qimage = (uint8_t *) malloc(32 * pParam->edged_width)) == NULL) |
815 |
|
return 0; // allocate some mem for qpel interpolated blocks |
816 |
|
// somehow this is dirty since I think we shouldn't use malloc outside |
817 |
|
// encoder_create() - so please fix me! |
818 |
|
|
819 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
820 |
|
|
830 |
if (!(current->global_flags & XVID_LUMIMASKING)) { |
if (!(current->global_flags & XVID_LUMIMASKING)) { |
831 |
pMB->dquant = NO_CHANGE; |
pMB->dquant = NO_CHANGE; |
832 |
pMB->quant = current->quant; } |
pMB->quant = current->quant; } |
833 |
|
else |
834 |
|
if (pMB->dquant != NO_CHANGE) { |
835 |
|
quant += DQtab[pMB->dquant]; |
836 |
|
if (quant > 31) quant = 31; |
837 |
|
else if (quant < 1) quant = 1; |
838 |
|
pMB->quant = quant; |
839 |
|
} |
840 |
|
|
841 |
//initial skip decision |
//initial skip decision |
842 |
|
|
845 |
if (pMB->sad16 < pMB->quant * INITIAL_SKIP_THRESH) { |
if (pMB->sad16 < pMB->quant * INITIAL_SKIP_THRESH) { |
846 |
SkipMacroblockP(pMB, sad00); |
SkipMacroblockP(pMB, sad00); |
847 |
continue; |
continue; |
848 |
|
sad00 = 256 * 4096; |
849 |
} |
} |
850 |
} else sad00 = 256*4096; // skip not allowed - for final skip decision |
} else sad00 = 256*4096; // skip not allowed - for final skip decision |
851 |
|
|
852 |
SearchP(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, x, |
SearchP(pRef->y, pRefH->y, pRefV->y, pRefHV->y, qimage, pCurrent, x, |
853 |
y, current->motion_flags, pMB->quant, |
y, current->motion_flags, pMB->quant, |
854 |
&Data, pParam, pMBs, reference->mbs, |
&Data, pParam, pMBs, reference->mbs, |
855 |
current->global_flags & XVID_INTER4V, pMB); |
current->global_flags & XVID_INTER4V, pMB); |
874 |
pParam->edged_width); |
pParam->edged_width); |
875 |
|
|
876 |
if (deviation < (pMB->sad16 - InterBias)) { |
if (deviation < (pMB->sad16 - InterBias)) { |
877 |
if (++iIntra >= iLimit) return 1; |
if (++iIntra >= iLimit) { free(qimage); return 1; } |
878 |
pMB->mode = MODE_INTRA; |
pMB->mode = MODE_INTRA; |
879 |
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = |
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = |
880 |
pMB->mvs[3] = zeroMV; |
pMB->mvs[3] = zeroMV; |
881 |
|
pMB->qmvs[0] = pMB->qmvs[1] = pMB->qmvs[2] = |
882 |
|
pMB->qmvs[3] = zeroMV; |
883 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = |
884 |
pMB->sad8[3] = 0; |
pMB->sad8[3] = 0; |
885 |
} |
} |
886 |
} |
} |
887 |
} |
} |
888 |
} |
} |
889 |
|
free(qimage); |
890 |
return 0; |
return 0; |
891 |
} |
} |
892 |
|
|
948 |
const uint8_t * const pRefH, |
const uint8_t * const pRefH, |
949 |
const uint8_t * const pRefV, |
const uint8_t * const pRefV, |
950 |
const uint8_t * const pRefHV, |
const uint8_t * const pRefHV, |
951 |
|
const uint8_t * const pRefQ, |
952 |
const IMAGE * const pCur, |
const IMAGE * const pCur, |
953 |
const int x, |
const int x, |
954 |
const int y, |
const int y, |
965 |
int i, iDirection = 255, mask, threshA; |
int i, iDirection = 255, mask, threshA; |
966 |
VECTOR pmv[7]; |
VECTOR pmv[7]; |
967 |
|
|
968 |
|
Data->predQMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
969 |
|
|
970 |
get_pmvdata2(pMBs, pParam->mb_width, 0, x, y, 0, pmv, Data->temp); //has to be changed to get_pmv(2)() |
get_pmvdata2(pMBs, pParam->mb_width, 0, x, y, 0, pmv, Data->temp); //has to be changed to get_pmv(2)() |
971 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
972 |
pParam->width, pParam->height, Data->iFcode); |
pParam->width, pParam->height, Data->iFcode, pParam->m_quarterpel); |
973 |
|
|
974 |
Data->predMV = pmv[0]; |
Data->predMV = pmv[0]; |
975 |
|
|
976 |
Data->Cur = pCur->y + (x + y * Data->iEdgedWidth) * 16; |
Data->Cur = pCur->y + (x + y * Data->iEdgedWidth) * 16; |
977 |
Data->Ref = pRef + (x + Data->iEdgedWidth*y)*16; |
Data->Ref = pRef + (x + Data->iEdgedWidth*y)*16; |
978 |
Data->RefH = pRefH + (x + Data->iEdgedWidth*y) * 16; |
Data->RefH = pRefH + (x + Data->iEdgedWidth*y) * 16; |
979 |
Data->RefV = pRefV + (x + Data->iEdgedWidth*y) * 16; |
Data->RefV = pRefV + (x + Data->iEdgedWidth*y) * 16; |
980 |
Data->RefHV = pRefHV + (x + Data->iEdgedWidth*y) * 16; |
Data->RefHV = pRefHV + (x + Data->iEdgedWidth*y) * 16; |
981 |
|
Data->RefQ = pRefQ; |
982 |
|
|
983 |
Data->iQuant = iQuant; |
Data->iQuant = iQuant; |
984 |
|
|
988 |
Data->min_dy = EVEN(Data->min_dy); |
Data->min_dy = EVEN(Data->min_dy); |
989 |
Data->max_dy = EVEN(Data->max_dy); } |
Data->max_dy = EVEN(Data->max_dy); } |
990 |
|
|
991 |
for(i = 0; i < 5; i++) Data->iMinSAD[i] = 256*4096; |
if (pMB->dquant != NO_CHANGE) inter4v = 0; |
992 |
|
|
993 |
if (inter4v) CheckCandidate = CheckCandidate16; |
if (inter4v) CheckCandidate = CheckCandidate16; |
994 |
else CheckCandidate = CheckCandidate16no4v; |
else CheckCandidate = CheckCandidate16no4v; |
995 |
|
|
996 |
(*CheckCandidate)(Data->predMV.x, Data->predMV.y, 0, &iDirection, Data); |
for(i = 0; i < 5; i++) |
997 |
|
Data->currentMV[i].x = Data->currentMV[i].y = 0; |
|
for(i = 0; i < 5; i++) Data->currentMV[i].x = Data->currentMV[i].y = 0; |
|
998 |
|
|
999 |
i = d_mv_bits(Data->predMV.x, Data->predMV.y, Data->iFcode); |
i = d_mv_bits(Data->predMV.x, Data->predMV.y, Data->iFcode); |
1000 |
Data->iMinSAD[0] = pMB->sad16 + lambda_vec16[iQuant] * i; |
Data->iMinSAD[0] = pMB->sad16 + lambda_vec16[iQuant] * i; |
1003 |
Data->iMinSAD[3] = pMB->sad8[2]; |
Data->iMinSAD[3] = pMB->sad8[2]; |
1004 |
Data->iMinSAD[4] = pMB->sad8[3]; |
Data->iMinSAD[4] = pMB->sad8[3]; |
1005 |
|
|
|
if (pMB->dquant != NO_CHANGE) inter4v = 0; |
|
|
|
|
1006 |
if ((x == 0) && (y == 0)) threshA = 512; |
if ((x == 0) && (y == 0)) threshA = 512; |
1007 |
else { |
else { |
1008 |
threshA = Data->temp[0] + 20; |
threshA = Data->temp[0]; // that's when we keep this SAD atm |
1009 |
if (threshA < 512) threshA = 512; |
if (threshA < 512) threshA = 512; |
1010 |
if (threshA > 1024) threshA = 1024; } |
if (threshA > 1024) threshA = 1024; } |
1011 |
|
|
1012 |
PreparePredictionsP(pmv, x, y, pParam->mb_width, pParam->mb_height, |
PreparePredictionsP(pmv, x, y, pParam->mb_width, pParam->mb_height, |
1013 |
prevMBs + x + y * pParam->mb_width); |
prevMBs + x + y * pParam->mb_width); |
1014 |
|
|
1015 |
|
if (inter4v) CheckCandidate = CheckCandidate16; |
1016 |
|
else CheckCandidate = CheckCandidate16no4v; |
1017 |
|
|
1018 |
|
|
1019 |
/* main loop. checking all predictions */ |
/* main loop. checking all predictions */ |
1020 |
|
|
1021 |
for (i = 1; i < 7; i++) { |
for (i = 1; i < 7; i++) { |
1022 |
if (!(mask = make_mask(pmv, i)) ) continue; |
if (!(mask = make_mask(pmv, i)) ) continue; |
1023 |
CheckCandidate16(pmv[i].x, pmv[i].y, mask, &iDirection, Data); |
(*CheckCandidate)(pmv[i].x, pmv[i].y, mask, &iDirection, Data); |
1024 |
if (Data->iMinSAD[0] <= threshA) break; |
if (Data->iMinSAD[0] <= threshA) break; |
1025 |
} |
} |
1026 |
|
|
1073 |
|
|
1074 |
if (MotionFlags & PMV_HALFPELREFINE16) HalfpelRefine(Data); |
if (MotionFlags & PMV_HALFPELREFINE16) HalfpelRefine(Data); |
1075 |
|
|
1076 |
|
for(i = 0; i < 5; i++) { |
1077 |
|
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; // initialize qpel vectors |
1078 |
|
Data->currentQMV[i].y = 2 * Data->currentMV[i].y; |
1079 |
|
} |
1080 |
|
|
1081 |
|
if((pParam->m_quarterpel) && (MotionFlags & PMV_QUARTERPELREFINE16)) { |
1082 |
|
|
1083 |
|
if(inter4v) |
1084 |
|
CheckCandidate = CheckCandidate16_qpel; |
1085 |
|
else |
1086 |
|
CheckCandidate = CheckCandidate16no4v_qpel; |
1087 |
|
|
1088 |
|
QuarterpelRefine(Data); |
1089 |
|
} |
1090 |
|
|
1091 |
if (inter4v) { |
if (inter4v) { |
1092 |
SearchData Data8; |
SearchData Data8; |
1093 |
Data8.iFcode = Data->iFcode; |
Data8.iFcode = Data->iFcode; |
1107 |
pMB->mvs[0] = pMB->mvs[1] |
pMB->mvs[0] = pMB->mvs[1] |
1108 |
= pMB->mvs[2] = pMB->mvs[3] = Data->currentMV[0]; |
= pMB->mvs[2] = pMB->mvs[3] = Data->currentMV[0]; |
1109 |
|
|
1110 |
|
pMB->qmvs[0] = pMB->qmvs[1] |
1111 |
|
= pMB->qmvs[2] = pMB->qmvs[3] = Data->currentQMV[0]; |
1112 |
|
|
1113 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = |
1114 |
pMB->sad8[2] = pMB->sad8[3] = Data->iMinSAD[0]; |
pMB->sad8[2] = pMB->sad8[3] = Data->iMinSAD[0]; |
1115 |
|
|
1116 |
|
if(pParam->m_quarterpel) { |
1117 |
|
pMB->pmvs[0].x = Data->currentQMV[0].x - Data->predQMV.x; |
1118 |
|
pMB->pmvs[0].y = Data->currentQMV[0].y - Data->predQMV.y; |
1119 |
|
} |
1120 |
|
else { |
1121 |
pMB->pmvs[0].x = Data->currentMV[0].x - Data->predMV.x; |
pMB->pmvs[0].x = Data->currentMV[0].x - Data->predMV.x; |
1122 |
pMB->pmvs[0].y = Data->currentMV[0].y - Data->predMV.y; |
pMB->pmvs[0].y = Data->currentMV[0].y - Data->predMV.y; |
1123 |
|
} |
1124 |
} else { |
} else { |
1125 |
// INTER4V MODE; all other things are already set in Search8 |
// INTER4V MODE; all other things are already set in Search8 |
1126 |
pMB->mode = MODE_INTER4V; |
pMB->mode = MODE_INTER4V; |
1127 |
pMB->sad16 = Data->iMinSAD[1] + Data->iMinSAD[2] + |
pMB->sad16 = Data->iMinSAD[1] + Data->iMinSAD[2] + |
1128 |
Data->iMinSAD[3] + Data->iMinSAD[4] + IMV16X16 * iQuant; |
Data->iMinSAD[3] + Data->iMinSAD[4] + IMV16X16 * iQuant; |
1129 |
} |
} |
|
|
|
1130 |
} |
} |
1131 |
|
|
1132 |
static void |
static void |
1140 |
SearchData * const Data) |
SearchData * const Data) |
1141 |
{ |
{ |
1142 |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x/2 , y/2, block); |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x/2 , y/2, block); |
1143 |
|
Data->predQMV = get_qpmv2(pMBs, pParam->mb_width, 0, x/2 , y/2, block); |
1144 |
Data->iMinSAD = OldData->iMinSAD + 1 + block; |
Data->iMinSAD = OldData->iMinSAD + 1 + block; |
1145 |
Data->currentMV = OldData->currentMV + 1 + block; |
Data->currentMV = OldData->currentMV + 1 + block; |
1146 |
|
Data->currentQMV = OldData->currentQMV + 1 + block; |
1147 |
|
|
1148 |
if (block != 0) |
if (block != 0) { |
1149 |
|
if(pParam->m_quarterpel) { |
1150 |
|
*(Data->iMinSAD) += lambda_vec8[Data->iQuant] * |
1151 |
|
d_mv_bits( Data->currentQMV->x - Data->predQMV.x, |
1152 |
|
Data->currentQMV->y - Data->predQMV.y, |
1153 |
|
Data->iFcode); |
1154 |
|
} |
1155 |
|
else { |
1156 |
*(Data->iMinSAD) += lambda_vec8[Data->iQuant] * |
*(Data->iMinSAD) += lambda_vec8[Data->iQuant] * |
1157 |
d_mv_bits( Data->currentMV->x - Data->predMV.x, |
d_mv_bits( Data->currentMV->x - Data->predMV.x, |
1158 |
Data->currentMV->y - Data->predMV.y, |
Data->currentMV->y - Data->predMV.y, |
1159 |
Data->iFcode); |
Data->iFcode); |
1160 |
|
} |
1161 |
|
} |
1162 |
|
|
1163 |
|
|
1164 |
if (MotionFlags & (PMV_EXTSEARCH8|PMV_HALFPELREFINE8)) { |
if (MotionFlags & (PMV_EXTSEARCH8|PMV_HALFPELREFINE8)) { |
1165 |
|
|
1167 |
Data->RefH = OldData->RefH + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
Data->RefH = OldData->RefH + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
1168 |
Data->RefV = OldData->RefV + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
Data->RefV = OldData->RefV + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
1169 |
Data->RefHV = OldData->RefHV + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
Data->RefHV = OldData->RefHV + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
1170 |
|
Data->RefQ = OldData->RefQ; |
1171 |
|
|
1172 |
Data->Cur = OldData->Cur + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
Data->Cur = OldData->Cur + 8 * ((block&1) + pParam->edged_width*(block>>1)); |
1173 |
|
|
1174 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 8, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 8, |
1175 |
pParam->width, pParam->height, OldData->iFcode); |
pParam->width, pParam->height, OldData->iFcode, pParam->m_quarterpel); |
1176 |
|
|
1177 |
CheckCandidate = CheckCandidate8; |
CheckCandidate = CheckCandidate8; |
1178 |
|
|
1179 |
if (MotionFlags & PMV_EXTSEARCH8) { |
if (MotionFlags & PMV_EXTSEARCH8) { |
1180 |
|
int32_t temp_sad = *(Data->iMinSAD); // store current MinSAD |
1181 |
|
|
1182 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
1183 |
if (MotionFlags & PMV_USESQUARES8) MainSearchPtr = SquareSearch; |
if (MotionFlags & PMV_USESQUARES8) MainSearchPtr = SquareSearch; |
1184 |
else if (MotionFlags & PMV_ADVANCEDDIAMOND8) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & PMV_ADVANCEDDIAMOND8) MainSearchPtr = AdvDiamondSearch; |
1185 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
1186 |
|
|
1187 |
(*MainSearchPtr)(Data->currentMV->x, Data->currentMV->y, Data, 255); } |
(*MainSearchPtr)(Data->currentMV->x, Data->currentMV->y, Data, 255); |
1188 |
|
|
1189 |
if (MotionFlags & PMV_HALFPELREFINE8) HalfpelRefine(Data); |
if(*(Data->iMinSAD) < temp_sad) { |
1190 |
|
Data->currentQMV->x = 2 * Data->currentMV->x; // update our qpel vector |
1191 |
|
Data->currentQMV->y = 2 * Data->currentMV->y; |
1192 |
|
} |
1193 |
} |
} |
1194 |
|
|
1195 |
|
if (MotionFlags & PMV_HALFPELREFINE8) { |
1196 |
|
int32_t temp_sad = *(Data->iMinSAD); // store current MinSAD |
1197 |
|
|
1198 |
|
HalfpelRefine(Data); // perform halfpel refine of current best vector |
1199 |
|
|
1200 |
|
if(*(Data->iMinSAD) < temp_sad) { // we have found a better match |
1201 |
|
Data->currentQMV->x = 2 * Data->currentMV->x; // update our qpel vector |
1202 |
|
Data->currentQMV->y = 2 * Data->currentMV->y; |
1203 |
|
} |
1204 |
|
} |
1205 |
|
|
1206 |
|
if(pParam->m_quarterpel) { |
1207 |
|
if((!(Data->currentQMV->x & 1)) && (!(Data->currentQMV->y & 1)) && |
1208 |
|
(MotionFlags & PMV_QUARTERPELREFINE8)) { |
1209 |
|
|
1210 |
|
CheckCandidate = CheckCandidate8_qpel; |
1211 |
|
QuarterpelRefine(Data); |
1212 |
|
} |
1213 |
|
} |
1214 |
|
} |
1215 |
|
|
1216 |
|
if(pParam->m_quarterpel) { |
1217 |
|
pMB->pmvs[block].x = Data->currentQMV->x - Data->predQMV.x; |
1218 |
|
pMB->pmvs[block].y = Data->currentQMV->y - Data->predQMV.y; |
1219 |
|
} |
1220 |
|
else { |
1221 |
pMB->pmvs[block].x = Data->currentMV->x - Data->predMV.x; |
pMB->pmvs[block].x = Data->currentMV->x - Data->predMV.x; |
1222 |
pMB->pmvs[block].y = Data->currentMV->y - Data->predMV.y; |
pMB->pmvs[block].y = Data->currentMV->y - Data->predMV.y; |
1223 |
|
} |
1224 |
|
|
1225 |
pMB->mvs[block] = *(Data->currentMV); |
pMB->mvs[block] = *(Data->currentMV); |
1226 |
pMB->sad8[block] = 4 * (*Data->iMinSAD); |
pMB->qmvs[block] = *(Data->currentQMV); |
1227 |
|
|
1228 |
|
pMB->sad8[block] = 4 * (*Data->iMinSAD); |
1229 |
} |
} |
1230 |
|
|
1231 |
/* B-frames code starts here */ |
/* B-frames code starts here */ |
1311 |
Data->predMV = *predMV; |
Data->predMV = *predMV; |
1312 |
|
|
1313 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
1314 |
pParam->width, pParam->height, iFcode); |
pParam->width, pParam->height, iFcode, pParam->m_quarterpel); |
1315 |
|
|
1316 |
pmv[0] = Data->predMV; |
pmv[0] = Data->predMV; |
1317 |
PreparePredictionsBF(pmv, x, y, pParam->mb_width, pMB, mode_current); |
PreparePredictionsBF(pmv, x, y, pParam->mb_width, pMB, mode_current); |
1548 |
|
|
1549 |
fData->currentMV[0] = pMB->mvs[0]; |
fData->currentMV[0] = pMB->mvs[0]; |
1550 |
fData->currentMV[1] = pMB->b_mvs[0]; |
fData->currentMV[1] = pMB->b_mvs[0]; |
1551 |
get_range(&fData->min_dx, &fData->max_dx, &fData->min_dy, &fData->max_dy, x, y, 16, pParam->width, pParam->height, fcode); |
get_range(&fData->min_dx, &fData->max_dx, &fData->min_dy, &fData->max_dy, x, y, 16, pParam->width, pParam->height, fcode, pParam->m_quarterpel); |
1552 |
get_range(&bData.min_dx, &bData.max_dx, &bData.min_dy, &bData.max_dy, x, y, 16, pParam->width, pParam->height, bcode); |
get_range(&bData.min_dx, &bData.max_dx, &bData.min_dy, &bData.max_dy, x, y, 16, pParam->width, pParam->height, bcode, pParam->m_quarterpel); |
1553 |
|
|
1554 |
if (fData->currentMV[0].x > fData->max_dx) fData->currentMV[0].x = fData->max_dx; |
if (fData->currentMV[0].x > fData->max_dx) fData->currentMV[0].x = fData->max_dx; |
1555 |
if (fData->currentMV[0].x < fData->min_dx) fData->currentMV[0].x = fData->min_dy; |
if (fData->currentMV[0].x < fData->min_dx) fData->currentMV[0].x = fData->min_dy; |
1771 |
|
|
1772 |
|
|
1773 |
get_range(&Data.min_dx, &Data.max_dx, &Data.min_dy, &Data.max_dy, x, y, 8, |
get_range(&Data.min_dx, &Data.max_dx, &Data.min_dy, &Data.max_dy, x, y, 8, |
1774 |
pParam->width, pParam->height, OldData->iFcode); |
pParam->width, pParam->height, OldData->iFcode, pParam->m_quarterpel); |
1775 |
|
|
1776 |
if (pMB->mode == MODE_INTER4V) { |
if (pMB->mode == MODE_INTER4V) { |
1777 |
int dummy; |
int dummy; |
1806 |
const MACROBLOCK * const pMBs, |
const MACROBLOCK * const pMBs, |
1807 |
int inter4v, |
int inter4v, |
1808 |
MACROBLOCK * const pMB, |
MACROBLOCK * const pMB, |
1809 |
SearchData * Data) |
SearchData * const Data) |
1810 |
{ |
{ |
1811 |
|
|
1812 |
const int32_t iEdgedWidth = pParam->edged_width; |
const int32_t iEdgedWidth = pParam->edged_width; |
1813 |
|
|
1814 |
int i; |
int i, t; |
1815 |
MainSearchFunc * MainSearchPtr; |
MainSearchFunc * MainSearchPtr; |
1816 |
|
|
1817 |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
1818 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
1819 |
pParam->width, pParam->height, Data->iFcode); |
pParam->width, pParam->height, Data->iFcode, pParam->m_quarterpel); |
1820 |
|
|
1821 |
Data->Cur = pCur->y + (x + y * iEdgedWidth) * 16; |
Data->Cur = pCur->y + (x + y * iEdgedWidth) * 16; |
1822 |
Data->Ref = pRef + (x + iEdgedWidth*y)*16; |
Data->Ref = pRef + (x + iEdgedWidth*y)*16; |
1848 |
if (pMB->mvs[0].y > Data->max_dy) pMB->mvs[0].y = Data->max_dy; |
if (pMB->mvs[0].y > Data->max_dy) pMB->mvs[0].y = Data->max_dy; |
1849 |
if (pMB->mvs[0].y < Data->min_dy) pMB->mvs[0].y = Data->min_dy; |
if (pMB->mvs[0].y < Data->min_dy) pMB->mvs[0].y = Data->min_dy; |
1850 |
|
|
1851 |
(*CheckCandidate)(pMB->mvs[0].x, pMB->mvs[0].y, 0, &i, Data); |
(*CheckCandidate)(pMB->mvs[0].x, pMB->mvs[0].y, 0, &t, Data); |
1852 |
|
|
1853 |
if (pMB->mode == MODE_INTER4V) |
if (pMB->mode == MODE_INTER4V) |
1854 |
for (i = 1; i < 4; i++) { // all four vectors will be used as four predictions for 16x16 search |
for (i = 1; i < 4; i++) { // all four vectors will be used as four predictions for 16x16 search |
1855 |
pMB->mvs[i].x = EVEN(pMB->mvs[i].x); |
pMB->mvs[i].x = EVEN(pMB->mvs[i].x); |
1856 |
pMB->mvs[i].y = EVEN(pMB->mvs[i].y); |
pMB->mvs[i].y = EVEN(pMB->mvs[i].y); |
1857 |
if (!(make_mask(pMB->mvs, i))) |
if (!(make_mask(pMB->mvs, i))) |
1858 |
(*CheckCandidate)(pMB->mvs[i].x, pMB->mvs[i].y, 0, &i, Data); |
(*CheckCandidate)(pMB->mvs[i].x, pMB->mvs[i].y, 0, &t, Data); |
1859 |
} |
} |
1860 |
|
|
1861 |
if (MotionFlags & PMV_USESQUARES16) |
if (MotionFlags & PMV_USESQUARES16) |
1908 |
const IMAGE *const pRef = &reference->image; |
const IMAGE *const pRef = &reference->image; |
1909 |
|
|
1910 |
uint32_t x, y; |
uint32_t x, y; |
1911 |
int32_t temp[5]; |
int32_t temp[5], quant = current->quant; |
1912 |
int32_t iMinSAD[5]; |
int32_t iMinSAD[5]; |
1913 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
1914 |
SearchData Data; |
SearchData Data; |
1928 |
//intra mode is copied from the first pass. At least for the time being |
//intra mode is copied from the first pass. At least for the time being |
1929 |
if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_NOT_CODED) ) continue; |
if ((pMB->mode == MODE_INTRA) || (pMB->mode == MODE_NOT_CODED) ) continue; |
1930 |
|
|
1931 |
|
|
1932 |
if (!(current->global_flags & XVID_LUMIMASKING)) { |
if (!(current->global_flags & XVID_LUMIMASKING)) { |
1933 |
pMB->dquant = NO_CHANGE; |
pMB->dquant = NO_CHANGE; |
1934 |
pMB->quant = current->quant; } |
pMB->quant = current->quant; } |
1935 |
|
else |
1936 |
|
if (pMB->dquant != NO_CHANGE) { |
1937 |
|
quant += DQtab[pMB->dquant]; |
1938 |
|
if (quant > 31) quant = 31; |
1939 |
|
else if (quant < 1) quant = 1; |
1940 |
|
pMB->quant = quant; |
1941 |
|
} |
1942 |
|
|
1943 |
SearchPhinted(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, x, |
SearchPhinted(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, x, |
1944 |
y, current->motion_flags, pMB->quant, |
y, current->motion_flags, pMB->quant, |
1966 |
*(Data->iMinSAD) = MV_MAX_ERROR; |
*(Data->iMinSAD) = MV_MAX_ERROR; |
1967 |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
1968 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
1969 |
pParam->width, pParam->height, Data->iFcode); |
pParam->width, pParam->height, Data->iFcode, pParam->m_quarterpel); |
1970 |
|
|
1971 |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
1972 |
Data->Ref = pRef + (x + y * pParam->edged_width) * 16; |
Data->Ref = pRef + (x + y * pParam->edged_width) * 16; |
2043 |
return 0; // B frame |
return 0; // B frame |
2044 |
|
|
2045 |
} |
} |
2046 |
|
|
2047 |
|
int |
2048 |
|
FindFcode( const MBParam * const pParam, |
2049 |
|
const FRAMEINFO * const current) |
2050 |
|
{ |
2051 |
|
uint32_t x, y; |
2052 |
|
int max = 0, min = 0, i; |
2053 |
|
|
2054 |
|
for (y = 0; y < pParam->mb_height; y++) { |
2055 |
|
for (x = 0; x < pParam->mb_width; x++) { |
2056 |
|
|
2057 |
|
MACROBLOCK *pMB = ¤t->mbs[x + y * pParam->mb_width]; |
2058 |
|
for(i = 0; i < (pMB->mode == MODE_INTER4V ? 4:1); i++) { |
2059 |
|
if (pMB->mvs[i].x > max) max = pMB->mvs[i].x; |
2060 |
|
if (pMB->mvs[i].y > max) max = pMB->mvs[i].y; |
2061 |
|
|
2062 |
|
if (pMB->mvs[i].x < min) min = pMB->mvs[i].x; |
2063 |
|
if (pMB->mvs[i].y < min) min = pMB->mvs[i].y; |
2064 |
|
} |
2065 |
|
} |
2066 |
|
} |
2067 |
|
|
2068 |
|
min = -min; |
2069 |
|
max += 1; |
2070 |
|
if (min > max) max = min; |
2071 |
|
|
2072 |
|
for (i = 1; (max > 32 << (i - 1)); i++); |
2073 |
|
return i; |
2074 |
|
} |