331 |
if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
332 |
|
|
333 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
|
|
|
|
if (*iDirection) { /* checking if anything found */ |
|
334 |
bDirection = *iDirection; |
bDirection = *iDirection; |
335 |
*iDirection = 0; |
if (*iDirection) { /* checking if anything found */ |
336 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
337 |
if (bDirection & 3) { /* our candidate is left or right */ |
if (bDirection & 3) { /* our candidate is left or right */ |
338 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
341 |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
342 |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
343 |
} |
} |
344 |
bDirection += *iDirection; |
bDirection |= *iDirection; |
345 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
346 |
} |
} |
347 |
} |
} |
348 |
while (*iDirection); |
while (bDirection); |
349 |
} |
} |
350 |
|
|
351 |
void |
void |
425 |
CHECK_CANDIDATE(xo-1, yo, 0); |
CHECK_CANDIDATE(xo-1, yo, 0); |
426 |
CHECK_CANDIDATE(xo+1, yo, 0); |
CHECK_CANDIDATE(xo+1, yo, 0); |
427 |
|
|
428 |
if(best_sad < data->iMinSAD2) return; |
if(best_sad <= data->iMinSAD2) return; |
429 |
|
|
430 |
if(data->currentQMV[0].y == data->currentQMV2.y) { |
if(data->currentQMV[0].y == data->currentQMV2.y) { |
431 |
CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, 0); |
CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, 0); |