70 |
#define MAX_CHROMA_SAD_FOR_SKIP (22) |
#define MAX_CHROMA_SAD_FOR_SKIP (22) |
71 |
|
|
72 |
#define CHECK_CANDIDATE(X,Y,D) { \ |
#define CHECK_CANDIDATE(X,Y,D) { \ |
73 |
CheckCandidate((X),(Y), (D), &iDirection, data ); } |
CheckCandidate((X),(Y), data, (D) ); } |
74 |
|
|
75 |
|
|
76 |
/***************************************************************************** |
/***************************************************************************** |
156 |
int sad; |
int sad; |
157 |
const uint32_t stride = data->iEdgedWidth/2; |
const uint32_t stride = data->iEdgedWidth/2; |
158 |
int offset = (dx>>1) + (dy>>1)*stride; |
int offset = (dx>>1) + (dy>>1)*stride; |
159 |
|
int next = 1; |
160 |
|
|
161 |
if (dx == data->temp[5] && dy == data->temp[6]) return data->temp[7]; /* it has been checked recently */ |
if (dx == data->temp[5] && dy == data->temp[6]) return data->temp[7]; /* it has been checked recently */ |
162 |
data->temp[5] = dx; data->temp[6] = dy; /* backup */ |
data->temp[5] = dx; data->temp[6] = dy; /* backup */ |
167 |
sad += sad8(data->CurV, data->RefP[5] + offset, stride); |
sad += sad8(data->CurV, data->RefP[5] + offset, stride); |
168 |
break; |
break; |
169 |
case 1: |
case 1: |
170 |
sad = sad8bi(data->CurU, data->RefP[4] + offset, data->RefP[4] + offset + stride, stride); |
next = stride; |
|
sad += sad8bi(data->CurV, data->RefP[5] + offset, data->RefP[5] + offset + stride, stride); |
|
|
break; |
|
171 |
case 2: |
case 2: |
172 |
sad = sad8bi(data->CurU, data->RefP[4] + offset, data->RefP[4] + offset + 1, stride); |
sad = sad8bi(data->CurU, data->RefP[4] + offset, data->RefP[4] + offset + next, stride); |
173 |
sad += sad8bi(data->CurV, data->RefP[5] + offset, data->RefP[5] + offset + 1, stride); |
sad += sad8bi(data->CurV, data->RefP[5] + offset, data->RefP[5] + offset + next, stride); |
174 |
break; |
break; |
175 |
default: |
default: |
176 |
interpolate8x8_halfpel_hv(data->RefQ, data->RefP[4] + offset, stride, data->rounding); |
interpolate8x8_halfpel_hv(data->RefQ, data->RefP[4] + offset, stride, data->rounding); |
300 |
/* CHECK_CANDIATE FUNCTIONS START */ |
/* CHECK_CANDIATE FUNCTIONS START */ |
301 |
|
|
302 |
static void |
static void |
303 |
CheckCandidate16(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate16(const int x, const int y, const SearchData * const data, const int Direction) |
304 |
{ |
{ |
305 |
int xc, yc; |
int xc, yc; |
306 |
const uint8_t * Reference; |
const uint8_t * Reference; |
320 |
current = data->currentQMV; |
current = data->currentQMV; |
321 |
} |
} |
322 |
|
|
323 |
sad = sad16v(data->Cur, Reference, data->iEdgedWidth, data->temp + 1); |
sad = sad16v(data->Cur, Reference, data->iEdgedWidth, data->temp); |
324 |
t = d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
t = d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
325 |
|
|
326 |
sad += (data->lambda16 * t * sad)>>10; |
sad += (data->lambda16 * t * sad)>>10; |
327 |
data->temp[1] += (data->lambda8 * t * (data->temp[1] + NEIGH_8X8_BIAS))>>10; |
data->temp[0] += (data->lambda8 * t * (data->temp[0] + NEIGH_8X8_BIAS))>>10; |
328 |
|
|
329 |
if (data->chroma && sad < data->iMinSAD[0]) |
if (data->chroma && sad < data->iMinSAD[0]) |
330 |
sad += ChromaSAD((xc >> 1) + roundtab_79[xc & 0x3], |
sad += ChromaSAD((xc >> 1) + roundtab_79[xc & 0x3], |
333 |
if (sad < data->iMinSAD[0]) { |
if (sad < data->iMinSAD[0]) { |
334 |
data->iMinSAD[0] = sad; |
data->iMinSAD[0] = sad; |
335 |
current[0].x = x; current[0].y = y; |
current[0].x = x; current[0].y = y; |
336 |
*dir = Direction; |
*data->dir = Direction; |
337 |
} |
} |
338 |
|
|
339 |
if (data->temp[1] < data->iMinSAD[1]) { |
if (data->temp[0] < data->iMinSAD[1]) { |
340 |
data->iMinSAD[1] = data->temp[1]; current[1].x = x; current[1].y = y; } |
data->iMinSAD[1] = data->temp[0]; current[1].x = x; current[1].y = y; } |
341 |
if (data->temp[2] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
342 |
data->iMinSAD[2] = data->temp[2]; current[2].x = x; current[2].y = y; } |
data->iMinSAD[2] = data->temp[1]; current[2].x = x; current[2].y = y; } |
343 |
if (data->temp[3] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
344 |
data->iMinSAD[3] = data->temp[3]; current[3].x = x; current[3].y = y; } |
data->iMinSAD[3] = data->temp[2]; current[3].x = x; current[3].y = y; } |
345 |
if (data->temp[4] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
346 |
data->iMinSAD[4] = data->temp[4]; current[4].x = x; current[4].y = y; } |
data->iMinSAD[4] = data->temp[3]; current[4].x = x; current[4].y = y; } |
347 |
} |
} |
348 |
|
|
349 |
static void |
static void |
350 |
CheckCandidate8(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate8(const int x, const int y, const SearchData * const data, const int Direction) |
351 |
{ |
{ |
352 |
int32_t sad; uint32_t t; |
int32_t sad; uint32_t t; |
353 |
const uint8_t * Reference; |
const uint8_t * Reference; |
372 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
373 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
374 |
current->x = x; current->y = y; |
current->x = x; current->y = y; |
375 |
*dir = Direction; |
*data->dir = Direction; |
376 |
} |
} |
377 |
} |
} |
378 |
|
|
379 |
static void |
static void |
380 |
CheckCandidate32(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate32(const int x, const int y, const SearchData * const data, const int Direction) |
381 |
{ |
{ |
382 |
uint32_t t; |
uint32_t t; |
383 |
const uint8_t * Reference; |
const uint8_t * Reference; |
384 |
|
int sad; |
385 |
|
|
386 |
if ( (!(x&1) && x !=0) || (!(y&1) && y !=0) || /* non-zero even value */ |
if ( (!(x&1) && x !=0) || (!(y&1) && y !=0) || /* non-zero even value */ |
387 |
(x > data->max_dx) || (x < data->min_dx) |
(x > data->max_dx) || (x < data->min_dx) |
390 |
Reference = GetReference(x, y, data); |
Reference = GetReference(x, y, data); |
391 |
t = d_mv_bits(x, y, data->predMV, data->iFcode, 0, 1); |
t = d_mv_bits(x, y, data->predMV, data->iFcode, 0, 1); |
392 |
|
|
393 |
data->temp[0] = sad32v_c(data->Cur, Reference, data->iEdgedWidth, data->temp + 1); |
sad = sad32v_c(data->Cur, Reference, data->iEdgedWidth, data->temp); |
394 |
|
|
395 |
data->temp[0] += (data->lambda16 * t * data->temp[0]) >> 10; |
sad += (data->lambda16 * t * sad) >> 10; |
396 |
data->temp[1] += (data->lambda8 * t * (data->temp[1] + NEIGH_8X8_BIAS))>>10; |
data->temp[0] += (data->lambda8 * t * (data->temp[0] + NEIGH_8X8_BIAS))>>10; |
397 |
|
|
398 |
if (data->temp[0] < data->iMinSAD[0]) { |
if (sad < data->iMinSAD[0]) { |
399 |
data->iMinSAD[0] = data->temp[0]; |
data->iMinSAD[0] = sad; |
400 |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
401 |
*dir = Direction; } |
*data->dir = Direction; |
402 |
|
} |
403 |
|
|
404 |
if (data->temp[1] < data->iMinSAD[1]) { |
if (data->temp[0] < data->iMinSAD[1]) { |
405 |
data->iMinSAD[1] = data->temp[1]; data->currentMV[1].x = x; data->currentMV[1].y = y; } |
data->iMinSAD[1] = data->temp[0]; data->currentMV[1].x = x; data->currentMV[1].y = y; } |
406 |
if (data->temp[2] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
407 |
data->iMinSAD[2] = data->temp[2]; data->currentMV[2].x = x; data->currentMV[2].y = y; } |
data->iMinSAD[2] = data->temp[1]; data->currentMV[2].x = x; data->currentMV[2].y = y; } |
408 |
if (data->temp[3] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
409 |
data->iMinSAD[3] = data->temp[3]; data->currentMV[3].x = x; data->currentMV[3].y = y; } |
data->iMinSAD[3] = data->temp[2]; data->currentMV[3].x = x; data->currentMV[3].y = y; } |
410 |
if (data->temp[4] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
411 |
data->iMinSAD[4] = data->temp[4]; data->currentMV[4].x = x; data->currentMV[4].y = y; } |
data->iMinSAD[4] = data->temp[3]; data->currentMV[4].x = x; data->currentMV[4].y = y; } |
412 |
} |
} |
413 |
|
|
414 |
static void |
static void |
415 |
CheckCandidate16no4v(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate16no4v(const int x, const int y, const SearchData * const data, const int Direction) |
416 |
{ |
{ |
417 |
int32_t sad, xc, yc; |
int32_t sad, xc, yc; |
418 |
const uint8_t * Reference; |
const uint8_t * Reference; |
446 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
447 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
448 |
current->x = x; current->y = y; |
current->x = x; current->y = y; |
449 |
*dir = Direction; |
*data->dir = Direction; |
450 |
} |
} |
451 |
} |
} |
452 |
|
|
453 |
static void |
static void |
454 |
CheckCandidate16I(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate16I(const int x, const int y, const SearchData * const data, const int Direction) |
455 |
{ |
{ |
456 |
int sad; |
int sad; |
457 |
// int xc, yc; |
// int xc, yc; |
474 |
if (sad < data->iMinSAD[0]) { |
if (sad < data->iMinSAD[0]) { |
475 |
data->iMinSAD[0] = sad; |
data->iMinSAD[0] = sad; |
476 |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
477 |
*dir = Direction; |
*data->dir = Direction; |
478 |
} |
} |
479 |
} |
} |
480 |
|
|
481 |
static void |
static void |
482 |
CheckCandidate32I(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidate32I(const int x, const int y, const SearchData * const data, const int Direction) |
483 |
{ |
{ |
484 |
/* maximum speed - for P/B/I decision */ |
/* maximum speed - for P/B/I decision */ |
485 |
int32_t sad; |
int32_t sad; |
488 |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
489 |
|
|
490 |
sad = sad32v_c(data->Cur, data->RefP[0] + (x>>1) + (y>>1)*((int)data->iEdgedWidth), |
sad = sad32v_c(data->Cur, data->RefP[0] + (x>>1) + (y>>1)*((int)data->iEdgedWidth), |
491 |
data->iEdgedWidth, data->temp+1); |
data->iEdgedWidth, data->temp); |
492 |
|
|
493 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
494 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
495 |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
496 |
*dir = Direction; |
*data->dir = Direction; |
497 |
} |
} |
498 |
if (data->temp[1] < data->iMinSAD[1]) { |
if (data->temp[0] < data->iMinSAD[1]) { |
499 |
data->iMinSAD[1] = data->temp[1]; data->currentMV[1].x = x; data->currentMV[1].y = y; } |
data->iMinSAD[1] = data->temp[0]; data->currentMV[1].x = x; data->currentMV[1].y = y; } |
500 |
if (data->temp[2] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
501 |
data->iMinSAD[2] = data->temp[2]; data->currentMV[2].x = x; data->currentMV[2].y = y; } |
data->iMinSAD[2] = data->temp[1]; data->currentMV[2].x = x; data->currentMV[2].y = y; } |
502 |
if (data->temp[3] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
503 |
data->iMinSAD[3] = data->temp[3]; data->currentMV[3].x = x; data->currentMV[3].y = y; } |
data->iMinSAD[3] = data->temp[2]; data->currentMV[3].x = x; data->currentMV[3].y = y; } |
504 |
if (data->temp[4] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
505 |
data->iMinSAD[4] = data->temp[4]; data->currentMV[4].x = x; data->currentMV[4].y = y; } |
data->iMinSAD[4] = data->temp[3]; data->currentMV[4].x = x; data->currentMV[4].y = y; } |
506 |
|
|
507 |
} |
} |
508 |
|
|
509 |
static void |
static void |
510 |
CheckCandidateInt(const int xf, const int yf, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateInt(const int xf, const int yf, const SearchData * const data, const int Direction) |
511 |
{ |
{ |
512 |
int32_t sad, xb, yb, xcf, ycf, xcb, ycb; |
int32_t sad, xb, yb, xcf, ycf, xcb, ycb; |
513 |
uint32_t t; |
uint32_t t; |
549 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
550 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
551 |
current->x = xf; current->y = yf; |
current->x = xf; current->y = yf; |
552 |
*dir = Direction; |
*data->dir = Direction; |
553 |
} |
} |
554 |
} |
} |
555 |
|
|
556 |
static void |
static void |
557 |
CheckCandidateDirect(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateDirect(const int x, const int y, const SearchData * const data, const int Direction) |
558 |
{ |
{ |
559 |
int32_t sad = 0, xcf = 0, ycf = 0, xcb = 0, ycb = 0; |
int32_t sad = 0, xcf = 0, ycf = 0, xcb = 0, ycb = 0; |
560 |
uint32_t k; |
uint32_t k; |
610 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
611 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
612 |
data->currentMV->x = x; data->currentMV->y = y; |
data->currentMV->x = x; data->currentMV->y = y; |
613 |
*dir = Direction; |
*data->dir = Direction; |
614 |
} |
} |
615 |
} |
} |
616 |
|
|
617 |
static void |
static void |
618 |
CheckCandidateDirectno4v(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateDirectno4v(const int x, const int y, const SearchData * const data, const int Direction) |
619 |
{ |
{ |
620 |
int32_t sad, xcf, ycf, xcb, ycb; |
int32_t sad, xcf, ycf, xcb, ycb; |
621 |
const uint8_t *ReferenceF; |
const uint8_t *ReferenceF; |
663 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
664 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
665 |
data->currentMV->x = x; data->currentMV->y = y; |
data->currentMV->x = x; data->currentMV->y = y; |
666 |
*dir = Direction; |
*data->dir = Direction; |
667 |
} |
} |
668 |
} |
} |
669 |
|
|
670 |
|
|
671 |
static void |
static void |
672 |
CheckCandidateRD16(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateRD16(const int x, const int y, const SearchData * const data, const int Direction) |
673 |
{ |
{ |
674 |
|
|
675 |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
732 |
if (rd < data->iMinSAD[0]) { |
if (rd < data->iMinSAD[0]) { |
733 |
data->iMinSAD[0] = rd; |
data->iMinSAD[0] = rd; |
734 |
current[0].x = x; current[0].y = y; |
current[0].x = x; current[0].y = y; |
735 |
*dir = Direction; |
*data->dir = Direction; |
736 |
*data->cbp = cbp; |
*data->cbp = cbp; |
737 |
} |
} |
738 |
} |
} |
739 |
|
|
740 |
static void |
static void |
741 |
CheckCandidateRD8(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateRD8(const int x, const int y, const SearchData * const data, const int Direction) |
742 |
{ |
{ |
743 |
|
|
744 |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
766 |
*data->cbp = cbp; |
*data->cbp = cbp; |
767 |
data->iMinSAD[0] = rd; |
data->iMinSAD[0] = rd; |
768 |
current[0].x = x; current[0].y = y; |
current[0].x = x; current[0].y = y; |
769 |
*dir = Direction; |
*data->dir = Direction; |
770 |
} |
} |
771 |
} |
} |
772 |
|
|
775 |
/* MAINSEARCH FUNCTIONS START */ |
/* MAINSEARCH FUNCTIONS START */ |
776 |
|
|
777 |
static void |
static void |
778 |
AdvDiamondSearch(int x, int y, const SearchData * const data, int bDirection) |
AdvDiamondSearch(int x, int y, const SearchData * const data, int bDirection, CheckFunc * const CheckCandidate) |
779 |
{ |
{ |
780 |
|
|
781 |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
782 |
|
|
783 |
int iDirection; |
unsigned int * const iDirection = data->dir; |
784 |
|
|
785 |
for(;;) { /* forever */ |
for(;;) { /* forever */ |
786 |
iDirection = 0; |
*iDirection = 0; |
787 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
788 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
789 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
791 |
|
|
792 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
793 |
|
|
794 |
if (iDirection) { /* if anything found */ |
if (*iDirection) { /* if anything found */ |
795 |
bDirection = iDirection; |
bDirection = *iDirection; |
796 |
iDirection = 0; |
*iDirection = 0; |
797 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
798 |
if (bDirection & 3) { /* our candidate is left or right */ |
if (bDirection & 3) { /* our candidate is left or right */ |
799 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
803 |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
804 |
} |
} |
805 |
|
|
806 |
if (iDirection) { |
if (*iDirection) { |
807 |
bDirection += iDirection; |
bDirection += *iDirection; |
808 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
809 |
} |
} |
810 |
} else { /* about to quit, eh? not so fast.... */ |
} else { /* about to quit, eh? not so fast.... */ |
852 |
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
853 |
break; |
break; |
854 |
} |
} |
855 |
if (!iDirection) break; /* ok, the end. really */ |
if (!*iDirection) break; /* ok, the end. really */ |
856 |
bDirection = iDirection; |
bDirection = *iDirection; |
857 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
858 |
} |
} |
859 |
} |
} |
860 |
} |
} |
861 |
|
|
862 |
static void |
static void |
863 |
SquareSearch(int x, int y, const SearchData * const data, int bDirection) |
SquareSearch(int x, int y, const SearchData * const data, int bDirection, CheckFunc * const CheckCandidate) |
864 |
{ |
{ |
865 |
int iDirection; |
unsigned int * const iDirection = data->dir; |
866 |
|
|
867 |
do { |
do { |
868 |
iDirection = 0; |
*iDirection = 0; |
869 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1+16+64); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1+16+64); |
870 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2+32+128); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2+32+128); |
871 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4+16+32); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4+16+32); |
875 |
if (bDirection & 64) CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1+8+16+64+128); |
if (bDirection & 64) CHECK_CANDIDATE(x - iDiamondSize, y + iDiamondSize, 1+8+16+64+128); |
876 |
if (bDirection & 128) CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2+8+32+64+128); |
if (bDirection & 128) CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2+8+32+64+128); |
877 |
|
|
878 |
bDirection = iDirection; |
bDirection = *iDirection; |
879 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
880 |
} while (iDirection); |
} while (*iDirection); |
881 |
} |
} |
882 |
|
|
883 |
static void |
static void |
884 |
DiamondSearch(int x, int y, const SearchData * const data, int bDirection) |
DiamondSearch(int x, int y, const SearchData * const data, int bDirection, CheckFunc * const CheckCandidate) |
885 |
{ |
{ |
886 |
|
|
887 |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
/* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ |
888 |
|
|
889 |
int iDirection; |
unsigned int * const iDirection = data->dir; |
890 |
|
|
891 |
do { |
do { |
892 |
iDirection = 0; |
*iDirection = 0; |
893 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
894 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
895 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
897 |
|
|
898 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
899 |
|
|
900 |
if (iDirection) { /* checking if anything found */ |
if (*iDirection) { /* checking if anything found */ |
901 |
bDirection = iDirection; |
bDirection = *iDirection; |
902 |
iDirection = 0; |
*iDirection = 0; |
903 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
904 |
if (bDirection & 3) { /* our candidate is left or right */ |
if (bDirection & 3) { /* our candidate is left or right */ |
905 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
908 |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
909 |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
910 |
} |
} |
911 |
bDirection += iDirection; |
bDirection += *iDirection; |
912 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
913 |
} |
} |
914 |
} |
} |
915 |
while (iDirection); |
while (*iDirection); |
916 |
} |
} |
917 |
|
|
918 |
/* MAINSEARCH FUNCTIONS END */ |
/* MAINSEARCH FUNCTIONS END */ |
919 |
|
|
920 |
static void |
static void |
921 |
SubpelRefine(const SearchData * const data) |
SubpelRefine(const SearchData * const data, CheckFunc * const CheckCandidate) |
922 |
{ |
{ |
923 |
/* Do a half-pel or q-pel refinement */ |
/* Do a half-pel or q-pel refinement */ |
924 |
const VECTOR centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV; |
const VECTOR centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV; |
|
int iDirection; /* only needed because macro expects it */ |
|
925 |
|
|
926 |
CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0); |
CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0); |
927 |
CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0); |
CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0); |
1171 |
(current->vop_flags & XVID_VOP_MODEDECISION_RD ? 2:1); |
(current->vop_flags & XVID_VOP_MODEDECISION_RD ? 2:1); |
1172 |
|
|
1173 |
/* some pre-initialized thingies for SearchP */ |
/* some pre-initialized thingies for SearchP */ |
1174 |
int32_t temp[8]; |
int32_t temp[8]; uint32_t dir; |
1175 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
1176 |
VECTOR currentQMV[5]; |
VECTOR currentQMV[5]; |
1177 |
int32_t iMinSAD[5]; |
int32_t iMinSAD[5]; |
1183 |
Data.currentQMV = currentQMV; |
Data.currentQMV = currentQMV; |
1184 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
1185 |
Data.temp = temp; |
Data.temp = temp; |
1186 |
|
Data.dir = &dir; |
1187 |
Data.iFcode = current->fcode; |
Data.iFcode = current->fcode; |
1188 |
Data.rounding = pParam->m_rounding_type; |
Data.rounding = pParam->m_rounding_type; |
1189 |
Data.qpel = (current->vol_flags & XVID_VOL_QUARTERPEL ? 1:0); |
Data.qpel = (current->vol_flags & XVID_VOL_QUARTERPEL ? 1:0); |
1258 |
return 0; |
return 0; |
1259 |
} |
} |
1260 |
|
|
1261 |
|
/* check if given vector is equal to any vector checked before */ |
1262 |
|
static __inline int |
1263 |
|
vector_repeats(const VECTOR * const pmv, const int i) |
1264 |
|
{ |
1265 |
|
unsigned int j; |
1266 |
|
for (j = 0; j < i; j++) |
1267 |
|
if (MVequal(pmv[i], pmv[j])) return 1; /* same vector has been checked already */ |
1268 |
|
return 0; |
1269 |
|
} |
1270 |
|
|
1271 |
|
/* make a binary mask that prevents diamonds/squares |
1272 |
|
from checking a vector which has been checked as a prediction */ |
1273 |
static __inline int |
static __inline int |
1274 |
make_mask(const VECTOR * const pmv, const int i) |
make_mask(const VECTOR * const pmv, const int i, const int current) |
1275 |
{ |
{ |
1276 |
int mask = 255, j; |
unsigned int mask = 255, j; |
1277 |
for (j = 0; j < i; j++) { |
for (j = 0; j < i; j++) { |
1278 |
if (MVequal(pmv[i], pmv[j])) return 0; /* same vector has been checked already */ |
if (pmv[current].x == pmv[j].x) { |
1279 |
if (pmv[i].x == pmv[j].x) { |
if (pmv[current].y == pmv[j].y + iDiamondSize) mask &= ~4; |
1280 |
if (pmv[i].y == pmv[j].y + iDiamondSize) mask &= ~4; |
else if (pmv[current].y == pmv[j].y - iDiamondSize) mask &= ~8; |
|
else if (pmv[i].y == pmv[j].y - iDiamondSize) mask &= ~8; |
|
1281 |
} else |
} else |
1282 |
if (pmv[i].y == pmv[j].y) { |
if (pmv[current].y == pmv[j].y) { |
1283 |
if (pmv[i].x == pmv[j].x + iDiamondSize) mask &= ~1; |
if (pmv[current].x == pmv[j].x + iDiamondSize) mask &= ~1; |
1284 |
else if (pmv[i].x == pmv[j].x - iDiamondSize) mask &= ~2; |
else if (pmv[current].x == pmv[j].x - iDiamondSize) mask &= ~2; |
1285 |
} |
} |
1286 |
} |
} |
1287 |
return mask; |
return mask; |
1345 |
MACROBLOCK * const pMB) |
MACROBLOCK * const pMB) |
1346 |
{ |
{ |
1347 |
|
|
1348 |
int i, iDirection = 255, mask, threshA; |
int i, threshA; |
1349 |
VECTOR pmv[7]; |
VECTOR pmv[7]; |
1350 |
int inter4v = (VopFlags & XVID_VOP_INTER4V) && (pMB->dquant == 0); |
int inter4v = (VopFlags & XVID_VOP_INTER4V) && (pMB->dquant == 0); |
1351 |
|
CheckFunc * CheckCandidate; |
1352 |
|
|
1353 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
1354 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
1371 |
Data->lambda16 = lambda_vec16[pMB->quant]; |
Data->lambda16 = lambda_vec16[pMB->quant]; |
1372 |
Data->lambda8 = lambda_vec8[pMB->quant]; |
Data->lambda8 = lambda_vec8[pMB->quant]; |
1373 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
1374 |
|
*Data->dir = 0; |
1375 |
|
|
1376 |
memset(Data->currentMV, 0, 5*sizeof(VECTOR)); |
memset(Data->currentMV, 0, 5*sizeof(VECTOR)); |
1377 |
|
|
1396 |
prevMBs + x + y * pParam->mb_width, Data->rrv); |
prevMBs + x + y * pParam->mb_width, Data->rrv); |
1397 |
|
|
1398 |
if (!Data->rrv) { |
if (!Data->rrv) { |
1399 |
if (inter4v | Data->chroma) CheckCandidate = CheckCandidate16; |
if (inter4v) CheckCandidate = CheckCandidate16; |
1400 |
else CheckCandidate = CheckCandidate16no4v; /* for extra speed */ |
else CheckCandidate = CheckCandidate16no4v; /* for extra speed */ |
1401 |
} else CheckCandidate = CheckCandidate32; |
} else CheckCandidate = CheckCandidate32; |
1402 |
|
|
1403 |
/* main loop. checking all predictions (but first, which is 0,0 and has been checked in MotionEstimation())*/ |
/* main loop. checking all predictions (but first, which is 0,0 and has been checked in MotionEstimation())*/ |
1404 |
|
|
1405 |
for (i = 1; i < 7; i++) { |
for (i = 1; i < 7; i++) |
1406 |
if (!(mask = make_mask(pmv, i)) ) continue; |
if (!vector_repeats(pmv, i)) { |
1407 |
CheckCandidate(pmv[i].x, pmv[i].y, mask, &iDirection, Data); |
CheckCandidate(pmv[i].x, pmv[i].y, Data, i); |
1408 |
if (Data->iMinSAD[0] <= threshA) break; |
if (Data->iMinSAD[0] <= threshA) { i++; break; } |
1409 |
} |
} |
1410 |
|
|
1411 |
if ((Data->iMinSAD[0] <= threshA) || |
if ((Data->iMinSAD[0] <= threshA) || |
1415 |
else { |
else { |
1416 |
|
|
1417 |
MainSearchFunc * MainSearchPtr; |
MainSearchFunc * MainSearchPtr; |
1418 |
|
int mask = make_mask(pmv, i, *Data->dir); // all vectors pmv[0..i-1] have been checked |
1419 |
|
|
1420 |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
1421 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
1422 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
1423 |
|
|
1424 |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate); |
1425 |
|
|
1426 |
/* extended search, diamond starting in 0,0 and in prediction. |
/* extended search, diamond starting in 0,0 and in prediction. |
1427 |
note that this search is/might be done in halfpel positions, |
note that this search is/might be done in halfpel positions, |
1437 |
if (!(MVequal(startMV, backupMV))) { |
if (!(MVequal(startMV, backupMV))) { |
1438 |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
1439 |
|
|
1440 |
CheckCandidate(startMV.x, startMV.y, 255, &iDirection, Data); |
CheckCandidate(startMV.x, startMV.y, Data, 255); |
1441 |
MainSearchPtr(startMV.x, startMV.y, Data, 255); |
MainSearchPtr(startMV.x, startMV.y, Data, 255, CheckCandidate); |
1442 |
if (bSAD < Data->iMinSAD[0]) { |
if (bSAD < Data->iMinSAD[0]) { |
1443 |
Data->currentMV[0] = backupMV; |
Data->currentMV[0] = backupMV; |
1444 |
Data->iMinSAD[0] = bSAD; } |
Data->iMinSAD[0] = bSAD; } |
1449 |
if (!(MVequal(startMV, backupMV))) { |
if (!(MVequal(startMV, backupMV))) { |
1450 |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
1451 |
|
|
1452 |
CheckCandidate(startMV.x, startMV.y, 255, &iDirection, Data); |
CheckCandidate(startMV.x, startMV.y, Data, 255); |
1453 |
MainSearchPtr(startMV.x, startMV.y, Data, 255); |
MainSearchPtr(startMV.x, startMV.y, Data, 255, CheckCandidate); |
1454 |
if (bSAD < Data->iMinSAD[0]) { |
if (bSAD < Data->iMinSAD[0]) { |
1455 |
Data->currentMV[0] = backupMV; |
Data->currentMV[0] = backupMV; |
1456 |
Data->iMinSAD[0] = bSAD; } |
Data->iMinSAD[0] = bSAD; |
1457 |
|
} |
1458 |
} |
} |
1459 |
} |
} |
1460 |
} |
} |
1461 |
|
|
1462 |
if (MotionFlags & XVID_ME_HALFPELREFINE16) |
if (MotionFlags & XVID_ME_HALFPELREFINE16) |
1463 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
1464 |
|
|
1465 |
for(i = 0; i < 5; i++) { |
for(i = 0; i < 5; i++) { |
1466 |
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; /* initialize qpel vectors */ |
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; /* initialize qpel vectors */ |
1472 |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
1473 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
1474 |
if (MotionFlags & XVID_ME_QUARTERPELREFINE16) |
if (MotionFlags & XVID_ME_QUARTERPELREFINE16) |
1475 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
1476 |
} |
} |
1477 |
|
|
1478 |
if (Data->iMinSAD[0] < (int32_t)pMB->quant * 30) |
if (Data->iMinSAD[0] < (int32_t)pMB->quant * 30) |
1519 |
SearchData * const Data) |
SearchData * const Data) |
1520 |
{ |
{ |
1521 |
int i = 0; |
int i = 0; |
1522 |
|
CheckFunc * CheckCandidate; |
1523 |
Data->iMinSAD = OldData->iMinSAD + 1 + block; |
Data->iMinSAD = OldData->iMinSAD + 1 + block; |
1524 |
Data->currentMV = OldData->currentMV + 1 + block; |
Data->currentMV = OldData->currentMV + 1 + block; |
1525 |
Data->currentQMV = OldData->currentQMV + 1 + block; |
Data->currentQMV = OldData->currentQMV + 1 + block; |
1562 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND8) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND8) MainSearchPtr = AdvDiamondSearch; |
1563 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
1564 |
|
|
1565 |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, 255); |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, 255, CheckCandidate); |
1566 |
|
|
1567 |
if(*(Data->iMinSAD) < temp_sad) { |
if(*(Data->iMinSAD) < temp_sad) { |
1568 |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
1573 |
if (MotionFlags & XVID_ME_HALFPELREFINE8) { |
if (MotionFlags & XVID_ME_HALFPELREFINE8) { |
1574 |
int32_t temp_sad = *(Data->iMinSAD); /* store current MinSAD */ |
int32_t temp_sad = *(Data->iMinSAD); /* store current MinSAD */ |
1575 |
|
|
1576 |
SubpelRefine(Data); /* perform halfpel refine of current best vector */ |
SubpelRefine(Data, CheckCandidate); /* perform halfpel refine of current best vector */ |
1577 |
|
|
1578 |
if(*(Data->iMinSAD) < temp_sad) { /* we have found a better match */ |
if(*(Data->iMinSAD) < temp_sad) { /* we have found a better match */ |
1579 |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
1585 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
1586 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 3, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 3, |
1587 |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
1588 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
1589 |
} |
} |
1590 |
} |
} |
1591 |
|
|
1671 |
SearchData * const Data) |
SearchData * const Data) |
1672 |
{ |
{ |
1673 |
|
|
1674 |
int i, iDirection = 255, mask; |
int i, mask; |
1675 |
VECTOR pmv[7]; |
VECTOR pmv[7]; |
1676 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
1677 |
*Data->iMinSAD = MV_MAX_ERROR; |
*Data->iMinSAD = MV_MAX_ERROR; |
1697 |
PreparePredictionsBF(pmv, x, y, pParam->mb_width, pMB, mode_current); |
PreparePredictionsBF(pmv, x, y, pParam->mb_width, pMB, mode_current); |
1698 |
|
|
1699 |
Data->currentMV->x = Data->currentMV->y = 0; |
Data->currentMV->x = Data->currentMV->y = 0; |
|
CheckCandidate = CheckCandidate16no4v; |
|
1700 |
|
|
1701 |
/* main loop. checking all predictions */ |
/* main loop. checking all predictions */ |
1702 |
for (i = 0; i < 7; i++) { |
for (i = 0; i < 7; i++) |
1703 |
if (!(mask = make_mask(pmv, i)) ) continue; |
if (!vector_repeats(pmv, i) ) |
1704 |
CheckCandidate16no4v(pmv[i].x, pmv[i].y, mask, &iDirection, Data); |
CheckCandidate16no4v(pmv[i].x, pmv[i].y, Data, i); |
|
} |
|
1705 |
|
|
1706 |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
1707 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
1708 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
1709 |
|
|
1710 |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
mask = make_mask(pmv, 7, *Data->dir); |
1711 |
|
|
1712 |
SubpelRefine(Data); |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate16no4v); |
1713 |
|
|
1714 |
|
SubpelRefine(Data, CheckCandidate16no4v); |
1715 |
|
|
1716 |
if (Data->qpel && *Data->iMinSAD < *best_sad + 300) { |
if (Data->qpel && *Data->iMinSAD < *best_sad + 300) { |
1717 |
Data->currentQMV->x = 2*Data->currentMV->x; |
Data->currentQMV->x = 2*Data->currentMV->x; |
1719 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
1720 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
1721 |
pParam->width, pParam->height, iFcode, 2, 0); |
pParam->width, pParam->height, iFcode, 2, 0); |
1722 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16no4v); |
1723 |
} |
} |
1724 |
|
|
1725 |
/* three bits are needed to code backward mode. four for forward */ |
/* three bits are needed to code backward mode. four for forward */ |
1820 |
int32_t skip_sad; |
int32_t skip_sad; |
1821 |
int k = (x + Data->iEdgedWidth*y) * 16; |
int k = (x + Data->iEdgedWidth*y) * 16; |
1822 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
1823 |
|
CheckFunc * CheckCandidate; |
1824 |
|
|
1825 |
*Data->iMinSAD = 256*4096; |
*Data->iMinSAD = 256*4096; |
1826 |
Data->RefP[0] = f_Ref->y + k; |
Data->RefP[0] = f_Ref->y + k; |
1870 |
|
|
1871 |
CheckCandidate = b_mb->mode == MODE_INTER4V ? CheckCandidateDirect : CheckCandidateDirectno4v; |
CheckCandidate = b_mb->mode == MODE_INTER4V ? CheckCandidateDirect : CheckCandidateDirectno4v; |
1872 |
|
|
1873 |
CheckCandidate(0, 0, 255, &k, Data); |
CheckCandidate(0, 0, Data, 255); |
1874 |
|
|
1875 |
/* initial (fast) skip decision */ |
/* initial (fast) skip decision */ |
1876 |
if (*Data->iMinSAD < pMB->quant * INITIAL_SKIP_THRESH * (Data->chroma?3:2)) { |
if (*Data->iMinSAD < pMB->quant * INITIAL_SKIP_THRESH * (Data->chroma?3:2)) { |
1896 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
1897 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
1898 |
|
|
1899 |
MainSearchPtr(0, 0, Data, 255); |
MainSearchPtr(0, 0, Data, 255, CheckCandidate); |
1900 |
|
|
1901 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
1902 |
|
|
1903 |
*best_sad = *Data->iMinSAD; |
*best_sad = *Data->iMinSAD; |
1904 |
|
|
1957 |
|
|
1958 |
{ |
{ |
1959 |
|
|
1960 |
int iDirection, i, j; |
int i, j; |
1961 |
SearchData bData; |
SearchData bData; |
1962 |
|
|
1963 |
fData->qpel_precision = 0; |
fData->qpel_precision = 0; |
1980 |
bData.b_RefP[5] = fData->RefP[5] = f_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
bData.b_RefP[5] = fData->RefP[5] = f_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
1981 |
bData.RefP[4] = fData->b_RefP[4] = b_Ref->u + (x + (fData->iEdgedWidth/2) * y) * 8; |
bData.RefP[4] = fData->b_RefP[4] = b_Ref->u + (x + (fData->iEdgedWidth/2) * y) * 8; |
1982 |
bData.RefP[5] = fData->b_RefP[5] = b_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
bData.RefP[5] = fData->b_RefP[5] = b_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
1983 |
|
bData.dir = fData->dir; |
1984 |
|
|
1985 |
bData.bpredMV = fData->predMV = *f_predMV; |
bData.bpredMV = fData->predMV = *f_predMV; |
1986 |
fData->bpredMV = bData.predMV = *b_predMV; |
fData->bpredMV = bData.predMV = *b_predMV; |
1999 |
if (fData->currentMV[1].y > bData.max_dy) fData->currentMV[1].y = bData.max_dy; |
if (fData->currentMV[1].y > bData.max_dy) fData->currentMV[1].y = bData.max_dy; |
2000 |
if (fData->currentMV[1].y < bData.min_dy) fData->currentMV[1].y = bData.min_dy; |
if (fData->currentMV[1].y < bData.min_dy) fData->currentMV[1].y = bData.min_dy; |
2001 |
|
|
2002 |
CheckCandidateInt(fData->currentMV[0].x, fData->currentMV[0].y, 255, &iDirection, fData); |
CheckCandidateInt(fData->currentMV[0].x, fData->currentMV[0].y, fData, 255); |
2003 |
|
|
2004 |
/* diamond */ |
/* diamond */ |
2005 |
do { |
do { |
2006 |
iDirection = 255; |
*fData->dir = 255; |
2007 |
/* forward MV moves */ |
/* forward MV moves */ |
2008 |
i = fData->currentMV[0].x; j = fData->currentMV[0].y; |
i = fData->currentMV[0].x; j = fData->currentMV[0].y; |
2009 |
|
|
2010 |
CheckCandidateInt(i + 1, j, 0, &iDirection, fData); |
CheckCandidateInt(i + 1, j, fData, 0); |
2011 |
CheckCandidateInt(i, j + 1, 0, &iDirection, fData); |
CheckCandidateInt(i, j + 1, fData, 0); |
2012 |
CheckCandidateInt(i - 1, j, 0, &iDirection, fData); |
CheckCandidateInt(i - 1, j, fData, 0); |
2013 |
CheckCandidateInt(i, j - 1, 0, &iDirection, fData); |
CheckCandidateInt(i, j - 1, fData, 0); |
2014 |
|
|
2015 |
/* backward MV moves */ |
/* backward MV moves */ |
2016 |
i = fData->currentMV[1].x; j = fData->currentMV[1].y; |
i = fData->currentMV[1].x; j = fData->currentMV[1].y; |
2017 |
fData->currentMV[2] = fData->currentMV[0]; |
fData->currentMV[2] = fData->currentMV[0]; |
2018 |
CheckCandidateInt(i + 1, j, 0, &iDirection, &bData); |
CheckCandidateInt(i + 1, j, &bData, 0); |
2019 |
CheckCandidateInt(i, j + 1, 0, &iDirection, &bData); |
CheckCandidateInt(i, j + 1, &bData, 0); |
2020 |
CheckCandidateInt(i - 1, j, 0, &iDirection, &bData); |
CheckCandidateInt(i - 1, j, &bData, 0); |
2021 |
CheckCandidateInt(i, j - 1, 0, &iDirection, &bData); |
CheckCandidateInt(i, j - 1, &bData, 0); |
2022 |
|
|
2023 |
} while (!(iDirection)); |
} while (!(*fData->dir)); |
2024 |
|
|
2025 |
/* qpel refinement */ |
/* qpel refinement */ |
2026 |
if (fData->qpel) { |
if (fData->qpel) { |
2027 |
if (*fData->iMinSAD > *best_sad + 500) return; |
if (*fData->iMinSAD > *best_sad + 500) return; |
|
CheckCandidate = CheckCandidateInt; |
|
2028 |
fData->qpel_precision = bData.qpel_precision = 1; |
fData->qpel_precision = bData.qpel_precision = 1; |
2029 |
get_range(&fData->min_dx, &fData->max_dx, &fData->min_dy, &fData->max_dy, x, y, 4, pParam->width, pParam->height, fcode, 2, 0); |
get_range(&fData->min_dx, &fData->max_dx, &fData->min_dy, &fData->max_dy, x, y, 4, pParam->width, pParam->height, fcode, 2, 0); |
2030 |
get_range(&bData.min_dx, &bData.max_dx, &bData.min_dy, &bData.max_dy, x, y, 4, pParam->width, pParam->height, bcode, 2, 0); |
get_range(&bData.min_dx, &bData.max_dx, &bData.min_dy, &bData.max_dy, x, y, 4, pParam->width, pParam->height, bcode, 2, 0); |
2032 |
fData->currentQMV[2].y = fData->currentQMV[0].y = 2 * fData->currentMV[0].y; |
fData->currentQMV[2].y = fData->currentQMV[0].y = 2 * fData->currentMV[0].y; |
2033 |
fData->currentQMV[1].x = 2 * fData->currentMV[1].x; |
fData->currentQMV[1].x = 2 * fData->currentMV[1].x; |
2034 |
fData->currentQMV[1].y = 2 * fData->currentMV[1].y; |
fData->currentQMV[1].y = 2 * fData->currentMV[1].y; |
2035 |
SubpelRefine(fData); |
SubpelRefine(fData, CheckCandidateInt); |
2036 |
if (*fData->iMinSAD > *best_sad + 300) return; |
if (*fData->iMinSAD > *best_sad + 300) return; |
2037 |
fData->currentQMV[2] = fData->currentQMV[0]; |
fData->currentQMV[2] = fData->currentQMV[0]; |
2038 |
SubpelRefine(&bData); |
SubpelRefine(&bData, CheckCandidateInt); |
2039 |
} |
} |
2040 |
|
|
2041 |
*fData->iMinSAD += (2+3) * fData->lambda16; /* two bits are needed to code interpolate mode. */ |
*fData->iMinSAD += (2+3) * fData->lambda16; /* two bits are needed to code interpolate mode. */ |
2094 |
|
|
2095 |
SearchData Data; |
SearchData Data; |
2096 |
int32_t iMinSAD; |
int32_t iMinSAD; |
2097 |
|
uint32_t dir; |
2098 |
VECTOR currentMV[3]; |
VECTOR currentMV[3]; |
2099 |
VECTOR currentQMV[3]; |
VECTOR currentQMV[3]; |
2100 |
int32_t temp[8]; |
int32_t temp[8]; |
2107 |
Data.rounding = 0; |
Data.rounding = 0; |
2108 |
Data.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
Data.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
2109 |
Data.temp = temp; |
Data.temp = temp; |
2110 |
|
Data.dir = &dir; |
2111 |
|
|
2112 |
Data.RefQ = f_refV->u; /* a good place, also used in MC (for similar purpose) */ |
Data.RefQ = f_refV->u; /* a good place, also used in MC (for similar purpose) */ |
2113 |
|
|
2214 |
SearchData * const Data) |
SearchData * const Data) |
2215 |
{ |
{ |
2216 |
|
|
2217 |
int i, mask; |
int i; |
|
int quarterpel = (pParam->vol_flags & XVID_VOL_QUARTERPEL)? 1: 0; |
|
2218 |
VECTOR pmv[3]; |
VECTOR pmv[3]; |
2219 |
MACROBLOCK * const pMB = &pMBs[x + y * pParam->mb_width]; |
MACROBLOCK * const pMB = &pMBs[x + y * pParam->mb_width]; |
2220 |
|
|
2230 |
else Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); /* else median */ |
else Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); /* else median */ |
2231 |
|
|
2232 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2233 |
pParam->width, pParam->height, Data->iFcode - quarterpel, 1, 0); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, 0); |
2234 |
|
|
2235 |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
2236 |
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
2241 |
pmv[2].y = EVEN(Data->predMV.y); |
pmv[2].y = EVEN(Data->predMV.y); |
2242 |
pmv[0].x = pmv[0].y = 0; |
pmv[0].x = pmv[0].y = 0; |
2243 |
|
|
2244 |
CheckCandidate32I(0, 0, 255, &i, Data); |
CheckCandidate32I(0, 0, Data, 0); |
2245 |
|
|
2246 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
2247 |
|
|
2248 |
if (!(mask = make_mask(pmv, 1))) |
// if (!vector_repeats(pmv, 1)) |
2249 |
CheckCandidate32I(pmv[1].x, pmv[1].y, mask, &i, Data); |
CheckCandidate32I(pmv[1].x, pmv[1].y, Data, 1); |
2250 |
if (!(mask = make_mask(pmv, 2))) |
// if (!vector_repeats(pmv, 2)) |
2251 |
CheckCandidate32I(pmv[2].x, pmv[2].y, mask, &i, Data); |
CheckCandidate32I(pmv[2].x, pmv[2].y, Data, 2); |
2252 |
|
|
2253 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) /* diamond only if needed */ |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { /* diamond only if needed */ |
2254 |
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, i); |
// unsigned int mask = make_mask(pmv, 3, *Data->dir); |
2255 |
|
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, 255/*mask*/, CheckCandidate32I); |
2256 |
|
} |
2257 |
} |
} |
2258 |
|
|
2259 |
for (i = 0; i < 4; i++) { |
for (i = 0; i < 4; i++) { |
2286 |
int complexity = 0; |
int complexity = 0; |
2287 |
|
|
2288 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
2289 |
|
uint32_t dir; |
2290 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
2291 |
SearchData Data; |
SearchData Data; |
2292 |
Data.iEdgedWidth = pParam->edged_width; |
Data.iEdgedWidth = pParam->edged_width; |
2294 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
2295 |
Data.iFcode = Current->fcode; |
Data.iFcode = Current->fcode; |
2296 |
Data.temp = temp; |
Data.temp = temp; |
2297 |
CheckCandidate = CheckCandidate32I; |
Data.dir = &dir; |
2298 |
|
Data.qpel = (pParam->vol_flags & XVID_VOL_QUARTERPEL)? 1: 0; |
2299 |
|
|
2300 |
if (intraCount != 0) { |
if (intraCount != 0) { |
2301 |
if (intraCount < 10) // we're right after an I frame |
if (intraCount < 10) // we're right after an I frame |
2364 |
const MBParam * const pParam, |
const MBParam * const pParam, |
2365 |
const uint32_t MotionFlags) |
const uint32_t MotionFlags) |
2366 |
{ |
{ |
2367 |
int i, iDirection; |
int i; |
2368 |
int32_t bsad[5]; |
int32_t bsad[5]; |
2369 |
|
|
|
CheckCandidate = CheckCandidateRD16; |
|
|
|
|
2370 |
if (Data->qpel) { |
if (Data->qpel) { |
2371 |
for(i = 0; i < 5; i++) { |
for(i = 0; i < 5; i++) { |
2372 |
Data->currentMV[i].x = Data->currentQMV[i].x/2; |
Data->currentMV[i].x = Data->currentQMV[i].x/2; |
2373 |
Data->currentMV[i].y = Data->currentQMV[i].y/2; |
Data->currentMV[i].y = Data->currentQMV[i].y/2; |
2374 |
} |
} |
2375 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2376 |
CheckCandidateRD16(Data->currentQMV[0].x, Data->currentQMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentQMV[0].x, Data->currentQMV[0].y, Data, 255); |
2377 |
|
|
2378 |
if (MotionFlags & (XVID_ME_HALFPELREFINE16_RD | XVID_ME_EXTSEARCH_RD)) { /* we have to prepare for halfpixel-precision search */ |
if (MotionFlags & (XVID_ME_HALFPELREFINE16_RD | XVID_ME_EXTSEARCH_RD)) { /* we have to prepare for halfpixel-precision search */ |
2379 |
for(i = 0; i < 5; i++) bsad[i] = Data->iMinSAD[i]; |
for(i = 0; i < 5; i++) bsad[i] = Data->iMinSAD[i]; |
2381 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
2382 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
2383 |
if (Data->currentQMV->x & 1 || Data->currentQMV->y & 1) |
if (Data->currentQMV->x & 1 || Data->currentQMV->y & 1) |
2384 |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
2385 |
} |
} |
2386 |
|
|
2387 |
} else { /* not qpel */ |
} else { /* not qpel */ |
2388 |
|
|
2389 |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
2390 |
} |
} |
2391 |
|
|
2392 |
if (MotionFlags&XVID_ME_EXTSEARCH_RD) SquareSearch(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
if (MotionFlags&XVID_ME_EXTSEARCH_RD) |
2393 |
|
SquareSearch(Data->currentMV->x, Data->currentMV->y, Data, 255, CheckCandidateRD16); |
2394 |
|
|
2395 |
if (MotionFlags&XVID_ME_HALFPELREFINE16_RD) SubpelRefine(Data); |
if (MotionFlags&XVID_ME_HALFPELREFINE16_RD) |
2396 |
|
SubpelRefine(Data, CheckCandidateRD16); |
2397 |
|
|
2398 |
if (Data->qpel) { |
if (Data->qpel) { |
2399 |
if (MotionFlags&(XVID_ME_EXTSEARCH_RD | XVID_ME_HALFPELREFINE16_RD)) { /* there was halfpel-precision search */ |
if (MotionFlags&(XVID_ME_EXTSEARCH_RD | XVID_ME_HALFPELREFINE16_RD)) { /* there was halfpel-precision search */ |
2407 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2408 |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
2409 |
} |
} |
2410 |
if (MotionFlags&XVID_ME_QUARTERPELREFINE16_RD) SubpelRefine(Data); |
if (MotionFlags&XVID_ME_QUARTERPELREFINE16_RD) |
2411 |
|
SubpelRefine(Data, CheckCandidateRD16); |
2412 |
} |
} |
2413 |
|
|
2414 |
if (MotionFlags&XVID_ME_CHECKPREDICTION_RD) { /* let's check vector equal to prediction */ |
if (MotionFlags&XVID_ME_CHECKPREDICTION_RD) { /* let's check vector equal to prediction */ |
2415 |
VECTOR * v = Data->qpel ? Data->currentQMV : Data->currentMV; |
VECTOR * v = Data->qpel ? Data->currentQMV : Data->currentMV; |
2416 |
if (!(Data->predMV.x == v->x && Data->predMV.y == v->y)) |
if (!(Data->predMV.x == v->x && Data->predMV.y == v->y)) |
2417 |
CheckCandidateRD16(Data->predMV.x, Data->predMV.y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->predMV.x, Data->predMV.y, Data, 255); |
2418 |
} |
} |
2419 |
return Data->iMinSAD[0]; |
return Data->iMinSAD[0]; |
2420 |
} |
} |
2427 |
const VECTOR * const backup) |
const VECTOR * const backup) |
2428 |
{ |
{ |
2429 |
|
|
2430 |
int cbp = 0, bits = 0, t = 0, i, iDirection; |
int cbp = 0, bits = 0, t = 0, i; |
2431 |
SearchData Data2, *Data8 = &Data2; |
SearchData Data2, *Data8 = &Data2; |
2432 |
int sumx = 0, sumy = 0; |
int sumx = 0, sumy = 0; |
2433 |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
2434 |
uint8_t * ptr; |
uint8_t * ptr; |
2435 |
|
|
2436 |
memcpy(Data8, Data, sizeof(SearchData)); |
memcpy(Data8, Data, sizeof(SearchData)); |
|
CheckCandidate = CheckCandidateRD8; |
|
2437 |
|
|
2438 |
for (i = 0; i < 4; i++) { /* for all luma blocks */ |
for (i = 0; i < 4; i++) { /* for all luma blocks */ |
2439 |
|
|
2467 |
{ |
{ |
2468 |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
2469 |
if (!MVequal (*v, backup[i+1]) ) |
if (!MVequal (*v, backup[i+1]) ) |
2470 |
CheckCandidateRD8(backup[i+1].x, backup[i+1].y, 255, &iDirection, Data8); |
CheckCandidateRD8(backup[i+1].x, backup[i+1].y, Data8, 255); |
2471 |
} |
} |
2472 |
|
|
2473 |
if (Data8->qpel) { |
if (Data8->qpel) { |
2480 |
pParam->width, pParam->height, Data8->iFcode - 1, 1, 0); |
pParam->width, pParam->height, Data8->iFcode - 1, 1, 0); |
2481 |
|
|
2482 |
if (Data8->currentQMV->x & 1 || Data8->currentQMV->y & 1) |
if (Data8->currentQMV->x & 1 || Data8->currentQMV->y & 1) |
2483 |
CheckCandidateRD8(Data8->currentMV->x, Data8->currentMV->y, 255, &iDirection, Data8); |
CheckCandidateRD8(Data8->currentMV->x, Data8->currentMV->y, Data8, 255); |
2484 |
|
|
2485 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) |
2486 |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255); |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255, CheckCandidateRD8); |
2487 |
|
|
2488 |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
2489 |
SubpelRefine(Data8); |
SubpelRefine(Data8, CheckCandidateRD8); |
2490 |
|
|
2491 |
if(s > *Data8->iMinSAD) { /* we have found a better match */ |
if(s > *Data8->iMinSAD) { /* we have found a better match */ |
2492 |
Data8->currentQMV->x = 2*Data8->currentMV->x; |
Data8->currentQMV->x = 2*Data8->currentMV->x; |
2498 |
pParam->width, pParam->height, Data8->iFcode, 2, 0); |
pParam->width, pParam->height, Data8->iFcode, 2, 0); |
2499 |
|
|
2500 |
} |
} |
2501 |
if (MotionFlags & XVID_ME_QUARTERPELREFINE8_RD) SubpelRefine(Data8); |
if (MotionFlags & XVID_ME_QUARTERPELREFINE8_RD) |
2502 |
|
SubpelRefine(Data8, CheckCandidateRD8); |
2503 |
|
|
2504 |
} else { /* not qpel */ |
} else { /* not qpel */ |
2505 |
|
|
2506 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) /* extsearch */ |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) /* extsearch */ |
2507 |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255); |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255, CheckCandidateRD8); |
2508 |
|
|
2509 |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
2510 |
SubpelRefine(Data8); /* halfpel refinement */ |
SubpelRefine(Data8, CheckCandidateRD8); /* halfpel refinement */ |
2511 |
} |
} |
2512 |
|
|
2513 |
/* checking vector equal to predicion */ |
/* checking vector equal to predicion */ |
2514 |
if (i != 0 && MotionFlags & XVID_ME_CHECKPREDICTION_RD) { |
if (i != 0 && MotionFlags & XVID_ME_CHECKPREDICTION_RD) { |
2515 |
const VECTOR * v = Data->qpel ? Data8->currentQMV : Data8->currentMV; |
const VECTOR * v = Data->qpel ? Data8->currentQMV : Data8->currentMV; |
2516 |
if (!MVequal(*v, Data8->predMV)) |
if (!MVequal(*v, Data8->predMV)) |
2517 |
CheckCandidateRD8(Data8->predMV.x, Data8->predMV.y, 255, &iDirection, Data8); |
CheckCandidateRD8(Data8->predMV.x, Data8->predMV.y, Data8, 255); |
2518 |
} |
} |
2519 |
|
|
2520 |
bits += *Data8->iMinSAD; |
bits += *Data8->iMinSAD; |
2661 |
Data->RefP[3] = pRefHV + 16*(x + y * pParam->edged_width); |
Data->RefP[3] = pRefHV + 16*(x + y * pParam->edged_width); |
2662 |
|
|
2663 |
Data->currentMV[0].x = Data->currentMV[0].y = 0; |
Data->currentMV[0].x = Data->currentMV[0].y = 0; |
2664 |
CheckCandidate16I(0, 0, 255, &i, Data); |
CheckCandidate16I(0, 0, Data, 255); |
2665 |
|
|
2666 |
if ( (Data->predMV.x !=0) || (Data->predMV.y != 0) ) |
if ( (Data->predMV.x !=0) || (Data->predMV.y != 0) ) |
2667 |
CheckCandidate16I(Data->predMV.x, Data->predMV.y, 255, &i, Data); |
CheckCandidate16I(Data->predMV.x, Data->predMV.y, Data, 255); |
2668 |
|
|
2669 |
AdvDiamondSearch(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
DiamondSearch(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255, CheckCandidate16I); |
2670 |
|
|
2671 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16I); |
2672 |
|
|
2673 |
|
|
2674 |
/* for QPel halfpel positions are worse than in halfpel mode :( */ |
/* for QPel halfpel positions are worse than in halfpel mode :( */ |
2704 |
|
|
2705 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
2706 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
2707 |
|
uint32_t dir; |
2708 |
SearchData Data; |
SearchData Data; |
2709 |
memset(&Data, 0, sizeof(SearchData)); |
memset(&Data, 0, sizeof(SearchData)); |
2710 |
|
|
2715 |
Data.iMinSAD = &iMinSAD[0]; |
Data.iMinSAD = &iMinSAD[0]; |
2716 |
Data.iFcode = current->fcode; |
Data.iFcode = current->fcode; |
2717 |
Data.temp = temp; |
Data.temp = temp; |
2718 |
|
Data.dir = &dir; |
|
CheckCandidate = CheckCandidate16I; |
|
2719 |
|
|
2720 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
2721 |
|
|
2722 |
for (y = 0; y < pParam->mb_height; y ++) { |
for (y = 0; y < pParam->mb_height; y ++) { |
2723 |
for (x = 0; x < pParam->mb_width; x ++) { |
for (x = 0; x < pParam->mb_width; x ++) { |
|
|
|
2724 |
GMEanalyzeMB(pCurrent->y, pReference->y, pRefH->y, pRefV->y, pRefHV->y, x, y, pParam, pMBs, &Data); |
GMEanalyzeMB(pCurrent->y, pReference->y, pRefH->y, pRefV->y, pRefHV->y, x, y, pParam, pMBs, &Data); |
2725 |
} |
} |
2726 |
} |
} |