54 |
#define MV16_THRESHOLD 192 |
#define MV16_THRESHOLD 192 |
55 |
#define MV8_THRESHOLD 56 |
#define MV8_THRESHOLD 56 |
56 |
|
|
57 |
|
#define NEIGH_MOVE_THRESH 0 |
58 |
|
// how much a block's MV must differ from his neighbour |
59 |
|
// to be search for INTER4V. The more, the faster... |
60 |
|
|
61 |
/* sad16(0,0) bias; mpeg4 spec suggests nb/2+1 */ |
/* sad16(0,0) bias; mpeg4 spec suggests nb/2+1 */ |
62 |
/* nb = vop pixels * 2^(bpp-8) */ |
/* nb = vop pixels * 2^(bpp-8) */ |
63 |
#define MV16_00_BIAS (128+1) |
#define MV16_00_BIAS (128+1) |
64 |
#define MV8_00_BIAS (0) |
#define MV8_00_BIAS (0) |
65 |
|
|
66 |
/* INTER bias for INTER/INTRA decision; mpeg4 spec suggests 2*nb */ |
/* INTER bias for INTER/INTRA decision; mpeg4 spec suggests 2*nb */ |
67 |
#define INTER_BIAS 512 |
#define MV16_INTER_BIAS 512 |
68 |
|
|
69 |
/* Parameters which control inter/inter4v decision */ |
/* Parameters which control inter/inter4v decision */ |
70 |
#define IMV16X16 5 |
#define IMV16X16 5 |
73 |
#define NEIGH_TEND_16X16 2 |
#define NEIGH_TEND_16X16 2 |
74 |
#define NEIGH_TEND_8X8 2 |
#define NEIGH_TEND_8X8 2 |
75 |
|
|
|
|
|
76 |
// fast ((A)/2)*2 |
// fast ((A)/2)*2 |
77 |
#define EVEN(A) (((A)<0?(A)+1:(A)) & ~1) |
#define EVEN(A) (((A)<0?(A)+1:(A)) & ~1) |
78 |
|
|
79 |
|
#define MVzero(A) ( ((A).x)==(0) && ((A).y)==(0) ) |
80 |
|
#define MVequal(A,B) ( ((A).x)==((B).x) && ((A).y)==((B).y) ) |
81 |
|
|
82 |
int32_t PMVfastSearch16( |
int32_t PMVfastSearch16( |
83 |
const uint8_t * const pRef, |
const uint8_t * const pRef, |
276 |
{ |
{ |
277 |
const uint32_t iWcount = pParam->mb_width; |
const uint32_t iWcount = pParam->mb_width; |
278 |
const uint32_t iHcount = pParam->mb_height; |
const uint32_t iHcount = pParam->mb_height; |
279 |
MACROBLOCK * pMBs = current->mbs; |
MACROBLOCK * const pMBs = current->mbs; |
280 |
IMAGE * pCurrent = ¤t->image; |
MACROBLOCK * const prevMBs = reference->mbs; // previous frame |
|
|
|
|
MACROBLOCK * prevMBs = reference->mbs; // previous frame |
|
|
IMAGE * pRef = &reference->image; |
|
281 |
|
|
282 |
|
const IMAGE * const pCurrent = ¤t->image; |
283 |
|
const IMAGE * const pRef = &reference->image; |
284 |
|
|
285 |
uint32_t i, j, iIntra = 0; |
const VECTOR zeroMV = {0,0}; |
286 |
|
|
287 |
VECTOR mv16; |
int32_t x, y; |
288 |
VECTOR pmv16; |
int32_t iIntra = 0; |
289 |
|
VECTOR pmv; |
|
int32_t sad8 = 0; |
|
|
int32_t sad16; |
|
|
int32_t deviation; |
|
290 |
|
|
291 |
if (sadInit) |
if (sadInit) |
292 |
(*sadInit)(); |
(*sadInit)(); |
293 |
|
|
294 |
|
for (y = 0; y < iHcount; y++) |
295 |
/* eventhough we have a seperate prevMBs, |
for (x = 0; x < iWcount; x++) |
|
pmvfast/epsz does something "funny" with the previous frames data */ |
|
|
|
|
|
/* for (i = 0; i < iHcount; i++) |
|
|
for (j = 0; j < iWcount; j++) |
|
296 |
{ |
{ |
297 |
pMBs[j + i * iWcount].mvs[0] = prevMBs[j + i * iWcount].mvs[0]; |
MACROBLOCK* const pMB = &pMBs[x + y * iWcount]; |
|
pMBs[j + i * iWcount].mvs[1] = prevMBs[j + i * iWcount].mvs[1]; |
|
|
pMBs[j + i * iWcount].mvs[2] = prevMBs[j + i * iWcount].mvs[2]; |
|
|
pMBs[j + i * iWcount].mvs[3] = prevMBs[j + i * iWcount].mvs[3]; |
|
|
} |
|
|
*/ |
|
|
/*dprintf("*** BEFORE ***"); |
|
|
for (i = 0; i < iHcount; i++) |
|
|
for (j = 0; j < iWcount; j++) |
|
|
{ |
|
|
dprintf(" [%i,%i] mode=%i dquant=%i mvs=(%i %i %i %i) sad8=(%i %i %i %i) sad16=(%i)", j,i, |
|
|
pMBs[j + i * iWcount].mode, |
|
|
pMBs[j + i * iWcount].dquant, |
|
|
pMBs[j + i * iWcount].mvs[0], |
|
|
pMBs[j + i * iWcount].mvs[1], |
|
|
pMBs[j + i * iWcount].mvs[2], |
|
|
pMBs[j + i * iWcount].mvs[3], |
|
|
prevMBs[j + i * iWcount].sad8[0], |
|
|
prevMBs[j + i * iWcount].sad8[1], |
|
|
prevMBs[j + i * iWcount].sad8[2], |
|
|
prevMBs[j + i * iWcount].sad8[3], |
|
|
prevMBs[j + i * iWcount].sad16); |
|
|
} |
|
|
*/ |
|
298 |
|
|
299 |
// note: i==horizontal, j==vertical |
pMB->sad16 = SEARCH16(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
300 |
for (i = 0; i < iHcount; i++) |
x, y, current->motion_flags, current->quant, current->fcode, |
301 |
for (j = 0; j < iWcount; j++) |
pParam, pMBs, prevMBs, &pMB->mv16, &pMB->pmvs[0]); |
|
{ |
|
|
MACROBLOCK *pMB = &pMBs[j + i * iWcount]; |
|
|
MACROBLOCK *prevMB = &prevMBs[j + i * iWcount]; |
|
|
|
|
|
sad16 = SEARCH16(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
|
|
j, i, current->motion_flags, current->quant, current->fcode, |
|
|
pParam, pMBs, prevMBs, &mv16, &pmv16); |
|
|
pMB->sad16=sad16; |
|
302 |
|
|
303 |
|
|
304 |
/* decide: MODE_INTER or MODE_INTRA |
if (0 < (pMB->sad16 - MV16_INTER_BIAS)) |
305 |
if (dev_intra < sad_inter - 2 * nb) use_intra |
{ |
306 |
*/ |
int32_t deviation; |
307 |
|
deviation = dev16(pCurrent->y + x*16 + y*16*pParam->edged_width, |
308 |
deviation = dev16(pCurrent->y + j*16 + i*16*pParam->edged_width, pParam->edged_width); |
pParam->edged_width); |
309 |
|
|
310 |
if (deviation < (sad16 - INTER_BIAS)) |
if (deviation < (pMB->sad16 - MV16_INTER_BIAS)) |
311 |
{ |
{ |
312 |
pMB->mode = MODE_INTRA; |
pMB->mode = MODE_INTRA; |
313 |
pMB->mvs[0].x = pMB->mvs[1].x = pMB->mvs[2].x = pMB->mvs[3].x = 0; |
pMB->mv16 = pMB->mvs[0] = pMB->mvs[1] |
314 |
pMB->mvs[0].y = pMB->mvs[1].y = pMB->mvs[2].y = pMB->mvs[3].y = 0; |
= pMB->mvs[2] = pMB->mvs[3] = zeroMV; |
315 |
|
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] |
316 |
pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = 0; |
= pMB->sad8[2] = pMB->sad8[3] = 0; |
317 |
|
|
318 |
iIntra++; |
iIntra++; |
319 |
if(iIntra >= iLimit) |
if(iIntra >= iLimit) |
321 |
|
|
322 |
continue; |
continue; |
323 |
} |
} |
324 |
|
} |
325 |
|
pMB->mode = MODE_INTER; |
326 |
|
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = pMB->mv16; |
327 |
|
pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = pMB->sad16; |
328 |
|
} |
329 |
|
|
330 |
|
// we try to do as few INTER4V-searches as possible. So we split ME in two parts, normal |
331 |
|
// SEARCH16 and only for special blocks SEARCH8. May this should be modified for quality |
332 |
|
// levels. |
333 |
|
|
334 |
|
|
335 |
|
|
336 |
if (current->global_flags & XVID_INTER4V) |
if (current->global_flags & XVID_INTER4V) |
337 |
|
for (y = 0; y < iHcount; y++) |
338 |
|
for (x = 0; x < iWcount; x++) |
339 |
|
{ |
340 |
|
MACROBLOCK* const pMB = &pMBs[x + y * iWcount]; |
341 |
|
|
342 |
|
if (pMB->mode == MODE_INTRA) |
343 |
|
continue; |
344 |
|
|
345 |
|
|
346 |
|
if ( (!(current->global_flags & XVID_LUMIMASKING) || pMB->dquant == NO_CHANGE) ) |
347 |
|
{ |
348 |
|
int32_t neigh=0; |
349 |
|
|
350 |
|
if (x>0) |
351 |
|
{ neigh += abs((pMB->mv16.x)-((pMB-1)->mv16.x)); |
352 |
|
neigh += abs((pMB->mv16.y)-((pMB-1)->mv16.y)); |
353 |
|
} |
354 |
|
if (y>0) |
355 |
|
{ neigh += abs((pMB->mv16.x)-((pMB-iWcount)->mv16.x)); |
356 |
|
neigh += abs((pMB->mv16.y)-((pMB-iWcount)->mv16.y)); |
357 |
|
} |
358 |
|
if (x<(iWcount-1)) |
359 |
|
{ neigh += abs((pMB->mv16.x)-((pMB+1)->mv16.x)); |
360 |
|
neigh += abs((pMB->mv16.y)-((pMB+1)->mv16.y)); |
361 |
|
} |
362 |
|
if (y<(iHcount-1)) |
363 |
|
{ neigh += abs((pMB->mv16.x)-((pMB+iHcount)->mv16.x)); |
364 |
|
neigh += abs((pMB->mv16.y)-((pMB+iHcount)->mv16.y)); |
365 |
|
} |
366 |
|
|
367 |
|
if (neigh > NEIGH_MOVE_THRESH) |
368 |
{ |
{ |
369 |
pMB->sad8[0] = SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
int32_t sad8 = IMV16X16 * current->quant; |
370 |
2 * j, 2 * i, mv16.x, mv16.y, |
|
371 |
|
if (sad8 < pMB->sad16) |
372 |
|
sad8 += pMB->sad8[0] |
373 |
|
= SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
374 |
|
2*x, 2*y, pMB->mv16.x, pMB->mv16.y, |
375 |
current->motion_flags, current->quant, current->fcode, |
current->motion_flags, current->quant, current->fcode, |
376 |
pParam, pMBs, prevMBs, &pMB->mvs[0], &pMB->pmvs[0]); |
pParam, pMBs, prevMBs, &pMB->mvs[0], &pMB->pmvs[0]); |
377 |
|
|
378 |
pMB->sad8[1] = SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
if (sad8 < pMB->sad16) |
379 |
2 * j + 1, 2 * i, mv16.x, mv16.y, |
sad8 += pMB->sad8[1] |
380 |
|
= SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
381 |
|
2*x+1, 2*y, pMB->mv16.x, pMB->mv16.y, |
382 |
current->motion_flags, current->quant, current->fcode, |
current->motion_flags, current->quant, current->fcode, |
383 |
pParam, pMBs, prevMBs, &pMB->mvs[1], &pMB->pmvs[1]); |
pParam, pMBs, prevMBs, &pMB->mvs[1], &pMB->pmvs[1]); |
384 |
|
|
385 |
pMB->sad8[2] = SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
if (sad8 < pMB->sad16) |
386 |
2 * j, 2 * i + 1, mv16.x, mv16.y, |
sad8 += pMB->sad8[2] |
387 |
|
= SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
388 |
|
2*x, 2*y+1, pMB->mv16.x, pMB->mv16.y, |
389 |
current->motion_flags, current->quant, current->fcode, |
current->motion_flags, current->quant, current->fcode, |
390 |
pParam, pMBs, prevMBs, &pMB->mvs[2], &pMB->pmvs[2]); |
pParam, pMBs, prevMBs, &pMB->mvs[2], &pMB->pmvs[2]); |
391 |
|
|
392 |
pMB->sad8[3] = SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
if (sad8 < pMB->sad16) |
393 |
2 * j + 1, 2 * i + 1, mv16.x, mv16.y, |
sad8 += pMB->sad8[3] |
394 |
|
= SEARCH8(pRef->y, pRefH->y, pRefV->y, pRefHV->y, pCurrent, |
395 |
|
2*x+1, 2*y+1, pMB->mv16.x, pMB->mv16.y, |
396 |
current->motion_flags, current->quant, current->fcode, |
current->motion_flags, current->quant, current->fcode, |
397 |
pParam, pMBs, prevMBs, &pMB->mvs[3], &pMB->pmvs[3]); |
pParam, pMBs, prevMBs, &pMB->mvs[3], &pMB->pmvs[3]); |
398 |
|
|
|
sad8 = pMB->sad8[0] + pMB->sad8[1] + pMB->sad8[2] + pMB->sad8[3]; |
|
|
} |
|
|
|
|
|
|
|
399 |
/* decide: MODE_INTER or MODE_INTER4V |
/* decide: MODE_INTER or MODE_INTER4V |
400 |
mpeg4: if (sad8 < sad16 - nb/2+1) use_inter4v |
mpeg4: if (sad8 < pMB->sad16 - nb/2+1) use_inter4v |
401 |
*/ |
*/ |
402 |
|
|
403 |
if (!(current->global_flags & XVID_LUMIMASKING) || pMB->dquant == NO_CHANGE) |
if (sad8 < pMB->sad16) |
404 |
{ |
{ |
|
if (((current->global_flags & XVID_INTER4V)==0) || |
|
|
(sad16 < (sad8 + (int32_t)(IMV16X16 * current->quant)))) |
|
|
{ |
|
|
|
|
|
sad8 = sad16; |
|
|
pMB->mode = MODE_INTER; |
|
|
pMB->mvs[0].x = pMB->mvs[1].x = pMB->mvs[2].x = pMB->mvs[3].x = mv16.x; |
|
|
pMB->mvs[0].y = pMB->mvs[1].y = pMB->mvs[2].y = pMB->mvs[3].y = mv16.y; |
|
|
pMB->pmvs[0].x = pmv16.x; |
|
|
pMB->pmvs[0].y = pmv16.y; |
|
|
} |
|
|
else |
|
405 |
pMB->mode = MODE_INTER4V; |
pMB->mode = MODE_INTER4V; |
406 |
} |
pMB->sad8[0] *= 4; |
407 |
else |
pMB->sad8[1] *= 4; |
408 |
{ |
pMB->sad8[2] *= 4; |
409 |
sad8 = sad16; |
pMB->sad8[3] *= 4; |
410 |
pMB->mode = MODE_INTER; |
continue; |
|
pMB->mvs[0].x = pMB->mvs[1].x = pMB->mvs[2].x = pMB->mvs[3].x = mv16.x; |
|
|
pMB->mvs[0].y = pMB->mvs[1].y = pMB->mvs[2].y = pMB->mvs[3].y = mv16.y; |
|
|
pMB->pmvs[0].x = pmv16.x; |
|
|
pMB->pmvs[0].y = pmv16.y; |
|
|
} |
|
411 |
} |
} |
412 |
|
|
413 |
/* dprintf("*** AFTER ***", pMBs[0].b_mvs[0].x); |
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = pMB->mv16; |
|
for (i = 0; i < iHcount; i++) |
|
|
for (j = 0; j < iWcount; j++) |
|
|
{ |
|
|
dprintf(" [%i,%i] mode=%i dquant=%i mvs=(%i %i %i %i) sad8=(%i %i %i %i) sad16=(%i)", j,i, |
|
|
pMBs[j + i * iWcount].mode, |
|
|
pMBs[j + i * iWcount].dquant, |
|
|
pMBs[j + i * iWcount].mvs[0], |
|
|
pMBs[j + i * iWcount].mvs[1], |
|
|
pMBs[j + i * iWcount].mvs[2], |
|
|
pMBs[j + i * iWcount].mvs[3], |
|
|
pMBs[j + i * iWcount].sad8[0], |
|
|
pMBs[j + i * iWcount].sad8[1], |
|
|
pMBs[j + i * iWcount].sad8[2], |
|
|
pMBs[j + i * iWcount].sad8[3], |
|
|
pMBs[j + i * iWcount].sad16); |
|
414 |
} |
} |
|
*/ |
|
415 |
|
|
|
return 0; |
|
416 |
} |
} |
417 |
|
|
418 |
#define MVzero(A) ( ((A).x)==(0) && ((A).y)==(0) ) |
// get_pmv has to be called again, because inter4v changes predictors |
419 |
|
|
420 |
#define MVequal(A,B) ( ((A).x)==((B).x) && ((A).y)==((B).y) ) |
pmv = get_pmv(pMBs, x, y, pParam->mb_width, 0); |
421 |
|
pMB->pmvs[0].x = pMB->mv16.x - pmv.x; /* the other pmvs are only needed in INTER4V-mode */ |
422 |
|
pMB->pmvs[0].y = pMB->mv16.y - pmv.y; |
423 |
|
|
424 |
|
} |
425 |
|
|
426 |
|
return 0; |
427 |
|
} |
428 |
|
|
429 |
#define CHECK_MV16_ZERO {\ |
#define CHECK_MV16_ZERO {\ |
430 |
if ( (0 <= max_dx) && (0 >= min_dx) \ |
if ( (0 <= max_dx) && (0 >= min_dx) \ |
889 |
VECTOR pmv[4]; |
VECTOR pmv[4]; |
890 |
int32_t psad[4]; |
int32_t psad[4]; |
891 |
|
|
892 |
const MACROBLOCK * const pMB = pMBs + x + y * iWcount; |
// const MACROBLOCK * const pMB = pMBs + x + y * iWcount; |
893 |
const MACROBLOCK * const prevMB = prevMBs + x + y * iWcount; |
const MACROBLOCK * const prevMB = prevMBs + x + y * iWcount; |
894 |
|
|
895 |
static int32_t threshA,threshB; |
static int32_t threshA,threshB; |
929 |
|
|
930 |
iFound=0; |
iFound=0; |
931 |
|
|
|
/* Step 2: Calculate Distance= |MedianMVX| + |MedianMVY| where MedianMV is the motion |
|
|
vector of the median. |
|
|
If PredEq=1 and MVpredicted = Previous Frame MV, set Found=2 |
|
|
*/ |
|
|
|
|
|
if ((bPredEq) && (MVequal(pmv[0],prevMB->mvs[0]) ) ) |
|
|
iFound=2; |
|
|
|
|
|
/* Step 3: If Distance>0 or thresb<1536 or PredEq=1 Select small Diamond Search. |
|
|
Otherwise select large Diamond Search. |
|
|
*/ |
|
|
|
|
|
if ( (pmv[0].x != 0) || (pmv[0].y != 0) || (threshB<1536) || (bPredEq) ) |
|
|
iDiamondSize=1; // halfpel! |
|
|
else |
|
|
iDiamondSize=2; // halfpel! |
|
|
|
|
|
if (!(MotionFlags & PMV_HALFPELDIAMOND16) ) |
|
|
iDiamondSize*=2; |
|
|
|
|
932 |
/* Step 4: Calculate SAD around the Median prediction. |
/* Step 4: Calculate SAD around the Median prediction. |
933 |
MinSAD=SAD |
MinSAD=SAD |
934 |
If Motion Vector equal to Previous frame motion vector |
If Motion Vector equal to Previous frame motion vector |
936 |
If SAD<=256 goto Step 10. |
If SAD<=256 goto Step 10. |
937 |
*/ |
*/ |
938 |
|
|
|
|
|
|
// Prepare for main loop |
|
|
|
|
939 |
*currMV=pmv[0]; /* current best := prediction */ |
*currMV=pmv[0]; /* current best := prediction */ |
940 |
if (!(MotionFlags & PMV_HALFPEL16 )) |
if (!(MotionFlags & PMV_HALFPEL16 )) |
941 |
{ /* This should NOT be necessary! */ |
{ /* This should NOT be necessary! */ |
967 |
|
|
968 |
if ( (iMinSAD < 256 ) || ( (MVequal(*currMV,prevMB->mvs[0])) && ((uint32_t)iMinSAD < prevMB->sad16) ) ) |
if ( (iMinSAD < 256 ) || ( (MVequal(*currMV,prevMB->mvs[0])) && ((uint32_t)iMinSAD < prevMB->sad16) ) ) |
969 |
{ |
{ |
970 |
|
if (iMinSAD < 2*iQuant) // high chances for SKIP-mode |
971 |
|
{ |
972 |
|
if (!MVzero(*currMV)) |
973 |
|
{ |
974 |
|
iMinSAD += MV16_00_BIAS; |
975 |
|
CHECK_MV16_ZERO; // (0,0) saves space for letterboxed pictures |
976 |
|
iMinSAD -= MV16_00_BIAS; |
977 |
|
} |
978 |
|
} |
979 |
|
|
980 |
if (MotionFlags & PMV_QUICKSTOP16) |
if (MotionFlags & PMV_QUICKSTOP16) |
981 |
goto PMVfast16_Terminate_without_Refine; |
goto PMVfast16_Terminate_without_Refine; |
983 |
goto PMVfast16_Terminate_with_Refine; |
goto PMVfast16_Terminate_with_Refine; |
984 |
} |
} |
985 |
|
|
986 |
|
|
987 |
|
/* Step 2 (lazy eval): Calculate Distance= |MedianMVX| + |MedianMVY| where MedianMV is the motion |
988 |
|
vector of the median. |
989 |
|
If PredEq=1 and MVpredicted = Previous Frame MV, set Found=2 |
990 |
|
*/ |
991 |
|
|
992 |
|
if ((bPredEq) && (MVequal(pmv[0],prevMB->mvs[0]) ) ) |
993 |
|
iFound=2; |
994 |
|
|
995 |
|
/* Step 3 (lazy eval): If Distance>0 or thresb<1536 or PredEq=1 Select small Diamond Search. |
996 |
|
Otherwise select large Diamond Search. |
997 |
|
*/ |
998 |
|
|
999 |
|
if ( (!MVzero(pmv[0])) || (threshB<1536) || (bPredEq) ) |
1000 |
|
iDiamondSize=1; // halfpel! |
1001 |
|
else |
1002 |
|
iDiamondSize=2; // halfpel! |
1003 |
|
|
1004 |
|
if (!(MotionFlags & PMV_HALFPELDIAMOND16) ) |
1005 |
|
iDiamondSize*=2; |
1006 |
|
|
1007 |
/* |
/* |
1008 |
Step 5: Calculate SAD for motion vectors taken from left block, top, top-right, and Previous frame block. |
Step 5: Calculate SAD for motion vectors taken from left block, top, top-right, and Previous frame block. |
1009 |
Also calculate (0,0) but do not subtract offset. |
Also calculate (0,0) but do not subtract offset. |
1013 |
|
|
1014 |
// (0,0) is always possible |
// (0,0) is always possible |
1015 |
|
|
1016 |
|
if (!MVzero(pmv[0])) |
1017 |
CHECK_MV16_ZERO; |
CHECK_MV16_ZERO; |
1018 |
|
|
1019 |
// previous frame MV is always possible |
// previous frame MV is always possible |
1020 |
|
|
1021 |
|
if (!MVzero(prevMB->mvs[0])) |
1022 |
|
if (!MVequal(prevMB->mvs[0],pmv[0])) |
1023 |
CHECK_MV16_CANDIDATE(prevMB->mvs[0].x,prevMB->mvs[0].y); |
CHECK_MV16_CANDIDATE(prevMB->mvs[0].x,prevMB->mvs[0].y); |
1024 |
|
|
1025 |
// left neighbour, if allowed |
// left neighbour, if allowed |
1026 |
if (x != 0) |
|
1027 |
|
if (!MVzero(pmv[1])) |
1028 |
|
if (!MVequal(pmv[1],prevMB->mvs[0])) |
1029 |
|
if (!MVequal(pmv[1],pmv[0])) |
1030 |
{ |
{ |
1031 |
if (!(MotionFlags & PMV_HALFPEL16 )) |
if (!(MotionFlags & PMV_HALFPEL16 )) |
1032 |
{ pmv[1].x = EVEN(pmv[1].x); |
{ pmv[1].x = EVEN(pmv[1].x); |
1033 |
pmv[1].y = EVEN(pmv[1].y); |
pmv[1].y = EVEN(pmv[1].y); |
1034 |
} |
} |
1035 |
|
|
1036 |
CHECK_MV16_CANDIDATE(pmv[1].x,pmv[1].y); |
CHECK_MV16_CANDIDATE(pmv[1].x,pmv[1].y); |
1037 |
} |
} |
1038 |
|
|
1039 |
// top neighbour, if allowed |
// top neighbour, if allowed |
1040 |
if (y != 0) |
if (!MVzero(pmv[2])) |
1041 |
|
if (!MVequal(pmv[2],prevMB->mvs[0])) |
1042 |
|
if (!MVequal(pmv[2],pmv[0])) |
1043 |
|
if (!MVequal(pmv[2],pmv[1])) |
1044 |
{ |
{ |
1045 |
if (!(MotionFlags & PMV_HALFPEL16 )) |
if (!(MotionFlags & PMV_HALFPEL16 )) |
1046 |
{ pmv[2].x = EVEN(pmv[2].x); |
{ pmv[2].x = EVEN(pmv[2].x); |
1049 |
CHECK_MV16_CANDIDATE(pmv[2].x,pmv[2].y); |
CHECK_MV16_CANDIDATE(pmv[2].x,pmv[2].y); |
1050 |
|
|
1051 |
// top right neighbour, if allowed |
// top right neighbour, if allowed |
1052 |
if ((uint32_t)x != (iWcount-1)) |
if (!MVzero(pmv[3])) |
1053 |
|
if (!MVequal(pmv[3],prevMB->mvs[0])) |
1054 |
|
if (!MVequal(pmv[3],pmv[0])) |
1055 |
|
if (!MVequal(pmv[3],pmv[1])) |
1056 |
|
if (!MVequal(pmv[3],pmv[2])) |
1057 |
{ |
{ |
1058 |
if (!(MotionFlags & PMV_HALFPEL16 )) |
if (!(MotionFlags & PMV_HALFPEL16 )) |
1059 |
{ pmv[3].x = EVEN(pmv[3].x); |
{ pmv[3].x = EVEN(pmv[3].x); |
1285 |
int32_t psad[4]; |
int32_t psad[4]; |
1286 |
VECTOR newMV; |
VECTOR newMV; |
1287 |
VECTOR backupMV; |
VECTOR backupMV; |
1288 |
|
VECTOR startMV; |
1289 |
|
|
1290 |
const MACROBLOCK * const pMB = pMBs + (x>>1) + (y>>1) * iWcount; |
// const MACROBLOCK * const pMB = pMBs + (x>>1) + (y>>1) * iWcount; |
1291 |
const MACROBLOCK * const prevMB = prevMBs + (x>>1) + (y>>1) * iWcount; |
const MACROBLOCK * const prevMB = prevMBs + (x>>1) + (y>>1) * iWcount; |
1292 |
|
|
1293 |
static int32_t threshA,threshB; |
static int32_t threshA,threshB; |
1294 |
int32_t iFound,bPredEq; |
int32_t iFound,bPredEq; |
1295 |
int32_t iMinSAD,iSAD; |
int32_t iMinSAD,iSAD; |
1296 |
|
|
1297 |
int32_t iSubBlock = ((y&1)<<1) + (x&1); |
int32_t iSubBlock = (y&1)+(y&1) + (x&1); |
1298 |
|
|
1299 |
|
/* Init variables */ |
1300 |
|
startMV.x = start_x; |
1301 |
|
startMV.y = start_y; |
1302 |
|
|
1303 |
/* Get maximum range */ |
/* Get maximum range */ |
1304 |
get_range(&min_dx, &max_dx, &min_dy, &max_dy, |
get_range(&min_dx, &max_dx, &min_dy, &max_dy, |
1331 |
|
|
1332 |
iFound=0; |
iFound=0; |
1333 |
|
|
|
/* Step 2: Calculate Distance= |MedianMVX| + |MedianMVY| where MedianMV is the motion |
|
|
vector of the median. |
|
|
If PredEq=1 and MVpredicted = Previous Frame MV, set Found=2 |
|
|
*/ |
|
|
|
|
|
if ((bPredEq) && (MVequal(pmv[0],prevMB->mvs[iSubBlock]) ) ) |
|
|
iFound=2; |
|
|
|
|
|
/* Step 3: If Distance>0 or thresb<1536 or PredEq=1 Select small Diamond Search. |
|
|
Otherwise select large Diamond Search. |
|
|
*/ |
|
|
|
|
|
if ( (pmv[0].x != 0) || (pmv[0].y != 0) || (threshB<1536/4) || (bPredEq) ) |
|
|
iDiamondSize=1; // 1 halfpel! |
|
|
else |
|
|
iDiamondSize=2; // 2 halfpel = 1 full pixel! |
|
|
|
|
|
if (!(MotionFlags & PMV_HALFPELDIAMOND8) ) |
|
|
iDiamondSize*=2; |
|
|
|
|
1334 |
/* Step 4: Calculate SAD around the Median prediction. |
/* Step 4: Calculate SAD around the Median prediction. |
1335 |
MinSAD=SAD |
MinSAD=SAD |
1336 |
If Motion Vector equal to Previous frame motion vector |
If Motion Vector equal to Previous frame motion vector |
1341 |
|
|
1342 |
// Prepare for main loop |
// Prepare for main loop |
1343 |
|
|
1344 |
currMV->x=start_x; /* start with mv16 */ |
*currMV = startMV; |
|
currMV->y=start_y; |
|
1345 |
|
|
1346 |
iMinSAD = sad8( cur, |
iMinSAD = sad8( cur, |
1347 |
get_ref_mv(pRef, pRefH, pRefV, pRefHV, x, y, 8, currMV, iEdgedWidth), |
get_ref_mv(pRef, pRefH, pRefV, pRefHV, x, y, 8, currMV, iEdgedWidth), |
1348 |
iEdgedWidth); |
iEdgedWidth); |
1349 |
iMinSAD += calc_delta_8(currMV->x - pmv[0].x, currMV->y - pmv[0].y, (uint8_t)iFcode, iQuant); |
iMinSAD += calc_delta_8(currMV->x - pmv[0].x, currMV->y - pmv[0].y, (uint8_t)iFcode, iQuant); |
1350 |
|
|
1351 |
if ( (iMinSAD < 256/4 ) || ( (MVequal(*currMV,prevMB->mvs[iSubBlock])) && ((uint32_t)iMinSAD < prevMB->sad8[iSubBlock]) ) ) |
if ( (iMinSAD < 256/4 ) || ( (MVequal(*currMV,prevMB->mvs[iSubBlock])) |
1352 |
|
&& ((uint32_t)iMinSAD < prevMB->sad8[iSubBlock]) ) ) |
1353 |
{ |
{ |
1354 |
if (MotionFlags & PMV_QUICKSTOP16) |
if (MotionFlags & PMV_QUICKSTOP16) |
1355 |
goto PMVfast8_Terminate_without_Refine; |
goto PMVfast8_Terminate_without_Refine; |
1357 |
goto PMVfast8_Terminate_with_Refine; |
goto PMVfast8_Terminate_with_Refine; |
1358 |
} |
} |
1359 |
|
|
1360 |
|
/* Step 2 (lazy eval): Calculate Distance= |MedianMVX| + |MedianMVY| where MedianMV is the motion |
1361 |
|
vector of the median. |
1362 |
|
If PredEq=1 and MVpredicted = Previous Frame MV, set Found=2 |
1363 |
|
*/ |
1364 |
|
|
1365 |
|
if ((bPredEq) && (MVequal(pmv[0],prevMB->mvs[iSubBlock]) ) ) |
1366 |
|
iFound=2; |
1367 |
|
|
1368 |
|
/* Step 3 (lazy eval): If Distance>0 or thresb<1536 or PredEq=1 Select small Diamond Search. |
1369 |
|
Otherwise select large Diamond Search. |
1370 |
|
*/ |
1371 |
|
|
1372 |
|
if ( (!MVzero(pmv[0])) || (threshB<1536/4) || (bPredEq) ) |
1373 |
|
iDiamondSize=1; // 1 halfpel! |
1374 |
|
else |
1375 |
|
iDiamondSize=2; // 2 halfpel = 1 full pixel! |
1376 |
|
|
1377 |
|
if (!(MotionFlags & PMV_HALFPELDIAMOND8) ) |
1378 |
|
iDiamondSize*=2; |
1379 |
|
|
1380 |
|
|
1381 |
/* |
/* |
1382 |
Step 5: Calculate SAD for motion vectors taken from left block, top, top-right, and Previous frame block. |
Step 5: Calculate SAD for motion vectors taken from left block, top, top-right, and Previous frame block. |
1385 |
If MV is (0,0) subtract offset. |
If MV is (0,0) subtract offset. |
1386 |
*/ |
*/ |
1387 |
|
|
1388 |
// the prediction might be even better than mv16 |
// the median prediction might be even better than mv16 |
1389 |
|
|
1390 |
|
if (!MVequal(pmv[0],startMV)) |
1391 |
CHECK_MV8_CANDIDATE(pmv[0].x,pmv[0].y); |
CHECK_MV8_CANDIDATE(pmv[0].x,pmv[0].y); |
1392 |
|
|
1393 |
// (0,0) is always possible |
// (0,0) if needed |
1394 |
|
if (!MVzero(pmv[0])) |
1395 |
|
if (!MVzero(startMV)) |
1396 |
CHECK_MV8_ZERO; |
CHECK_MV8_ZERO; |
1397 |
|
|
1398 |
// previous frame MV is always possible |
// previous frame MV if needed |
1399 |
|
if (!MVzero(prevMB->mvs[iSubBlock])) |
1400 |
|
if (!MVequal(prevMB->mvs[iSubBlock],startMV)) |
1401 |
|
if (!MVequal(prevMB->mvs[iSubBlock],pmv[0])) |
1402 |
CHECK_MV8_CANDIDATE(prevMB->mvs[iSubBlock].x,prevMB->mvs[iSubBlock].y); |
CHECK_MV8_CANDIDATE(prevMB->mvs[iSubBlock].x,prevMB->mvs[iSubBlock].y); |
1403 |
|
|
1404 |
// left neighbour, if allowed |
if ( (iMinSAD <= threshA) || ( MVequal(*currMV,prevMB->mvs[iSubBlock]) && ((uint32_t)iMinSAD < prevMB->sad8[iSubBlock]) ) ) |
1405 |
if (psad[1] != MV_MAX_ERROR) |
{ |
1406 |
|
if (MotionFlags & PMV_QUICKSTOP16) |
1407 |
|
goto PMVfast8_Terminate_without_Refine; |
1408 |
|
if (MotionFlags & PMV_EARLYSTOP16) |
1409 |
|
goto PMVfast8_Terminate_with_Refine; |
1410 |
|
} |
1411 |
|
|
1412 |
|
|
1413 |
|
// left neighbour, if allowed and needed |
1414 |
|
if (!MVzero(pmv[1])) |
1415 |
|
if (!MVequal(pmv[1],startMV)) |
1416 |
|
if (!MVequal(pmv[1],prevMB->mvs[iSubBlock])) |
1417 |
|
if (!MVequal(pmv[1],pmv[0])) |
1418 |
{ |
{ |
1419 |
if (!(MotionFlags & PMV_HALFPEL8 )) |
if (!(MotionFlags & PMV_HALFPEL8 )) |
1420 |
{ pmv[1].x = EVEN(pmv[1].x); |
{ pmv[1].x = EVEN(pmv[1].x); |
1423 |
CHECK_MV8_CANDIDATE(pmv[1].x,pmv[1].y); |
CHECK_MV8_CANDIDATE(pmv[1].x,pmv[1].y); |
1424 |
} |
} |
1425 |
|
|
1426 |
// top neighbour, if allowed |
// top neighbour, if allowed and needed |
1427 |
if (psad[2] != MV_MAX_ERROR) |
if (!MVzero(pmv[2])) |
1428 |
|
if (!MVequal(pmv[2],startMV)) |
1429 |
|
if (!MVequal(pmv[2],prevMB->mvs[iSubBlock])) |
1430 |
|
if (!MVequal(pmv[2],pmv[0])) |
1431 |
|
if (!MVequal(pmv[2],pmv[1])) |
1432 |
{ |
{ |
1433 |
if (!(MotionFlags & PMV_HALFPEL8 )) |
if (!(MotionFlags & PMV_HALFPEL8 )) |
1434 |
{ pmv[2].x = EVEN(pmv[2].x); |
{ pmv[2].x = EVEN(pmv[2].x); |
1436 |
} |
} |
1437 |
CHECK_MV8_CANDIDATE(pmv[2].x,pmv[2].y); |
CHECK_MV8_CANDIDATE(pmv[2].x,pmv[2].y); |
1438 |
|
|
1439 |
// top right neighbour, if allowed |
// top right neighbour, if allowed and needed |
1440 |
if (psad[3] != MV_MAX_ERROR) |
if (!MVzero(pmv[3])) |
1441 |
|
if (!MVequal(pmv[3],startMV)) |
1442 |
|
if (!MVequal(pmv[3],prevMB->mvs[iSubBlock])) |
1443 |
|
if (!MVequal(pmv[3],pmv[0])) |
1444 |
|
if (!MVequal(pmv[3],pmv[1])) |
1445 |
|
if (!MVequal(pmv[3],pmv[2])) |
1446 |
{ |
{ |
1447 |
if (!(MotionFlags & PMV_HALFPEL8 )) |
if (!(MotionFlags & PMV_HALFPEL8 )) |
1448 |
{ pmv[3].x = EVEN(pmv[3].x); |
{ pmv[3].x = EVEN(pmv[3].x); |
1579 |
int32_t psad[8]; |
int32_t psad[8]; |
1580 |
|
|
1581 |
static MACROBLOCK * oldMBs = NULL; |
static MACROBLOCK * oldMBs = NULL; |
1582 |
const MACROBLOCK * const pMB = pMBs + x + y * iWcount; |
// const MACROBLOCK * const pMB = pMBs + x + y * iWcount; |
1583 |
const MACROBLOCK * const prevMB = prevMBs + x + y * iWcount; |
const MACROBLOCK * const prevMB = prevMBs + x + y * iWcount; |
1584 |
MACROBLOCK * oldMB = NULL; |
MACROBLOCK * oldMB = NULL; |
1585 |
|
|
1866 |
|
|
1867 |
const int32_t iSubBlock = ((y&1)<<1) + (x&1); |
const int32_t iSubBlock = ((y&1)<<1) + (x&1); |
1868 |
|
|
1869 |
const MACROBLOCK * const pMB = pMBs + (x>>1) + (y>>1) * iWcount; |
// const MACROBLOCK * const pMB = pMBs + (x>>1) + (y>>1) * iWcount; |
1870 |
const MACROBLOCK * const prevMB = prevMBs + (x>>1) + (y>>1) * iWcount; |
const MACROBLOCK * const prevMB = prevMBs + (x>>1) + (y>>1) * iWcount; |
1871 |
|
|
1872 |
int32_t bPredEq; |
int32_t bPredEq; |