333 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
334 |
bDirection = *iDirection; |
bDirection = *iDirection; |
335 |
if (*iDirection) { /* checking if anything found */ |
if (*iDirection) { /* checking if anything found */ |
|
*iDirection = 0; |
|
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 |
|
*iDirection=4+8; |
339 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
340 |
CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
341 |
} else { /* what remains here is up or down */ |
} else { /* what remains here is up or down */ |
342 |
|
*iDirection=1+2; |
343 |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
344 |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
345 |
} |
} |