269 |
CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4); |
CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4); |
270 |
break; |
break; |
271 |
case 2 + 8: |
case 2 + 8: |
272 |
CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4); |
CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4); |
|
CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8); |
|
273 |
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
274 |
|
CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8); |
275 |
break; |
break; |
276 |
case 1 + 8: |
case 1 + 8: |
277 |
CHECK_CANDIDATE(x + iDiamondSize, y - iDiamondSize, 2 + 4); |
CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4); |
|
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
|
278 |
CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8); |
CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1 + 8); |
279 |
|
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
280 |
break; |
break; |
281 |
default: /* 1+2+4+8 == we didn't find anything at all */ |
default: /* 1+2+4+8 == we didn't find anything at all */ |
282 |
CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4); |
CHECK_CANDIDATE(x - iDiamondSize, y - iDiamondSize, 1 + 4); |
323 |
|
|
324 |
unsigned int * const iDirection = &data->dir; |
unsigned int * const iDirection = &data->dir; |
325 |
|
|
326 |
do { |
for (;;) { |
327 |
*iDirection = 0; |
*iDirection = 0; |
328 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
329 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
330 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
331 |
if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
332 |
|
|
333 |
|
if (*iDirection == 0) |
334 |
|
break; |
335 |
|
|
336 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
337 |
bDirection = *iDirection; |
bDirection = *iDirection; |
|
if (*iDirection) { /* checking if anything found */ |
|
|
*iDirection = 0; |
|
338 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
339 |
if (bDirection & 3) { /* our candidate is left or right */ |
if (bDirection & 3) { /* our candidate is left or right */ |
340 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
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 |
} |
} |
346 |
bDirection += *iDirection; |
bDirection |= *iDirection; |
347 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
348 |
} |
} |
349 |
} |
} |
|
while (bDirection); |
|
|
} |
|
350 |
|
|
351 |
void |
void |
352 |
xvid_me_SubpelRefine(VECTOR centerMV, SearchData * const data, CheckFunc * const CheckCandidate, int dir) |
xvid_me_SubpelRefine(VECTOR centerMV, SearchData * const data, CheckFunc * const CheckCandidate, int dir) |