--- estimation_common.c 2003/09/10 22:18:59 1.1.2.1 +++ estimation_common.c 2004/10/03 14:37:18 1.7 @@ -21,7 +21,7 @@ * along with this program ; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * - * $Id: estimation_common.c,v 1.1.2.1 2003/09/10 22:18:59 edgomez Exp $ + * $Id: estimation_common.c,v 1.7 2004/10/03 14:37:18 chl Exp $ * ****************************************************************************/ @@ -78,15 +78,16 @@ ****************************************************************************/ int32_t -xvid_me_ChromaSAD(const int dx, const int dy, const SearchData * const data) +xvid_me_ChromaSAD(const int dx, const int dy, SearchData * const data) { int sad; const uint32_t stride = data->iEdgedWidth/2; int offset = (dx>>1) + (dy>>1)*stride; int next = 1; - if (dx == data->temp[5] && dy == data->temp[6]) return data->temp[7]; /* it has been checked recently */ - data->temp[5] = dx; data->temp[6] = dy; /* backup */ + if (dx == data->chromaX && dy == data->chromaY) + return data->chromaSAD; /* it has been checked recently */ + data->chromaX = dx; data->chromaY = dy; /* backup */ switch (((dx & 1) << 1) | (dy & 1)) { case 0: @@ -107,7 +108,7 @@ sad += sad8(data->CurV, data->RefQ, stride); break; } - data->temp[7] = sad; /* backup, part 2 */ + data->chromaSAD = sad; /* backup, part 2 */ return sad; } @@ -206,13 +207,13 @@ } void -xvid_me_AdvDiamondSearch(int x, int y, const SearchData * const data, +xvid_me_AdvDiamondSearch(int x, int y, SearchData * const data, int bDirection, CheckFunc * const CheckCandidate) { /* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ - unsigned int * const iDirection = data->dir; + unsigned int * const iDirection = &data->dir; for(;;) { /* forever */ *iDirection = 0; @@ -292,10 +293,10 @@ } void -xvid_me_SquareSearch(int x, int y, const SearchData * const data, +xvid_me_SquareSearch(int x, int y, SearchData * const data, int bDirection, CheckFunc * const CheckCandidate) { - unsigned int * const iDirection = data->dir; + unsigned int * const iDirection = &data->dir; do { *iDirection = 0; @@ -314,13 +315,13 @@ } void -xvid_me_DiamondSearch(int x, int y, const SearchData * const data, +xvid_me_DiamondSearch(int x, int y, SearchData * const data, int bDirection, CheckFunc * const CheckCandidate) { /* directions: 1 - left (x-1); 2 - right (x+1), 4 - up (y-1); 8 - down (y+1) */ - unsigned int * const iDirection = data->dir; + unsigned int * const iDirection = &data->dir; do { *iDirection = 0; @@ -330,15 +331,15 @@ if (bDirection & 8) CHECK_CANDIDATE(x, y + iDiamondSize, 8); /* now we're doing diagonal checks near our candidate */ - + bDirection = *iDirection; if (*iDirection) { /* checking if anything found */ - bDirection = *iDirection; - *iDirection = 0; x = data->currentMV->x; y = data->currentMV->y; if (bDirection & 3) { /* our candidate is left or right */ + *iDirection=4+8; CHECK_CANDIDATE(x, y + iDiamondSize, 8); CHECK_CANDIDATE(x, y - iDiamondSize, 4); } else { /* what remains here is up or down */ + *iDirection=1+2; CHECK_CANDIDATE(x + iDiamondSize, y, 2); CHECK_CANDIDATE(x - iDiamondSize, y, 1); } @@ -346,22 +347,153 @@ x = data->currentMV->x; y = data->currentMV->y; } } - while (*iDirection); + while (bDirection); } void -xvid_me_SubpelRefine(const SearchData * const data, CheckFunc * const CheckCandidate) +xvid_me_SubpelRefine(VECTOR centerMV, SearchData * const data, CheckFunc * const CheckCandidate, int dir) { /* Do a half-pel or q-pel refinement */ - const VECTOR centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV; - CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0); - CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0); - CHECK_CANDIDATE(centerMV.x + 1, centerMV.y, 0); - CHECK_CANDIDATE(centerMV.x + 1, centerMV.y + 1, 0); - CHECK_CANDIDATE(centerMV.x, centerMV.y + 1, 0); - CHECK_CANDIDATE(centerMV.x - 1, centerMV.y + 1, 0); - CHECK_CANDIDATE(centerMV.x - 1, centerMV.y, 0); - CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, 0); + CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, dir); + CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, dir); + CHECK_CANDIDATE(centerMV.x + 1, centerMV.y, dir); + CHECK_CANDIDATE(centerMV.x + 1, centerMV.y + 1, dir); + CHECK_CANDIDATE(centerMV.x, centerMV.y + 1, dir); + CHECK_CANDIDATE(centerMV.x - 1, centerMV.y + 1, dir); + CHECK_CANDIDATE(centerMV.x - 1, centerMV.y, dir); + CHECK_CANDIDATE(centerMV.x - 1, centerMV.y - 1, dir); +} + +#define CHECK_CANDIDATE_2ndBEST(X, Y, DIR) { \ + *data->iMinSAD = s_best2; \ + CheckCandidate((X),(Y), data, direction); \ + if (data->iMinSAD[0] < s_best) { \ + s_best2 = s_best; \ + s_best = data->iMinSAD[0]; \ + v_best2 = v_best; \ + v_best.x = X; v_best.y = Y; \ + dir = DIR; \ + } else if (data->iMinSAD[0] < s_best2) { \ + s_best2 = data->iMinSAD[0]; \ + v_best2.x = X; v_best2.y = Y; \ + } \ } +void +FullRefine_Fast(SearchData * data, CheckFunc * CheckCandidate, int direction) +{ +/* Do a fast h-pel and then q-pel refinement */ + + int32_t s_best = data->iMinSAD[0], s_best2 = 256*4096; + VECTOR v_best, v_best2; + int dir = 0, xo2, yo2, best_halfpel, b_cbp; + + int xo = 2*data->currentMV[0].x, yo = 2*data->currentMV[0].y; + + data->currentQMV[0].x = v_best.x = xo; + data->currentQMV[0].y = v_best.y = yo; + + data->qpel_precision = 1; + + /* halfpel refinement: check 8 neighbours, but keep the second best SAD as well */ + CHECK_CANDIDATE_2ndBEST(xo - 2, yo, 1+16+64); + CHECK_CANDIDATE_2ndBEST(xo + 2, yo, 2+32+128); + CHECK_CANDIDATE_2ndBEST(xo, yo - 2, 4+16+32); + CHECK_CANDIDATE_2ndBEST(xo, yo + 2, 8+64+128); + CHECK_CANDIDATE_2ndBEST(xo - 2, yo - 2, 1+4+16+32+64); + CHECK_CANDIDATE_2ndBEST(xo + 2, yo - 2, 2+4+16+32+128); + CHECK_CANDIDATE_2ndBEST(xo - 2, yo + 2, 1+8+16+64+128); + CHECK_CANDIDATE_2ndBEST(xo + 2, yo + 2, 2+8+32+64+128); + + xo = v_best.x; yo = v_best.y, b_cbp = data->cbp[0]; + + /* we need all 8 neighbours *of best hpel position found above* checked for 2nd best + let's check the missing ones */ + + /* on rare occasions, 1st best and 2nd best are far away, and 2nd best is not 1st best's neighbour. + to simplify stuff, we'll forget that evil 2nd best and make a full search for a new 2nd best */ + /* todo. we should check the missing neighbours first, maybe they'll give us 2nd best which is even better + than the infamous one. in that case, we will not have to re-check the other neighbours */ + + if (abs(v_best.x - v_best2.x) > 2 || abs(v_best.y - v_best2.y) > 2) { /* v_best2 is useless */ + data->iMinSAD[0] = 256*4096; + dir = ~0; /* all */ + } else { + data->iMinSAD[0] = s_best2; + data->currentQMV[0] = v_best2; + } + + if (dir & 1) CHECK_CANDIDATE( xo - 2, yo, direction); + if (dir & 2) CHECK_CANDIDATE( xo + 2, yo, direction); + if (dir & 4) CHECK_CANDIDATE( xo, yo - 2, direction); + if (dir & 8) CHECK_CANDIDATE( xo, yo + 2, direction); + if (dir & 16) CHECK_CANDIDATE( xo - 2, yo - 2, direction); + if (dir & 32) CHECK_CANDIDATE( xo + 2, yo - 2, direction); + if (dir & 64) CHECK_CANDIDATE( xo - 2, yo + 2, direction); + if (dir & 128) CHECK_CANDIDATE( xo + 2, yo + 2, direction); + + /* read the position of 2nd best */ + v_best2 = data->currentQMV[0]; + + /* after second_best has been found, go back to best vector */ + + data->currentQMV[0].x = xo; + data->currentQMV[0].y = yo; + data->cbp[0] = b_cbp; + + data->currentMV[0].x = xo/2; + data->currentMV[0].y = yo/2; + data->iMinSAD[0] = best_halfpel = s_best; + + xo2 = v_best2.x; + yo2 = v_best2.y; + s_best2 = 256*4096; + + if (yo == yo2) { + CHECK_CANDIDATE_2ndBEST((xo+xo2)>>1, yo, 0); + CHECK_CANDIDATE_2ndBEST(xo, yo-1, 0); + CHECK_CANDIDATE_2ndBEST(xo, yo+1, 0); + data->currentQMV[0] = v_best; + data->iMinSAD[0] = s_best; + + if(best_halfpel <= s_best2) return; + + if(data->currentQMV[0].x == v_best2.x) { + CHECK_CANDIDATE((xo+xo2)>>1, yo-1, direction); + CHECK_CANDIDATE((xo+xo2)>>1, yo+1, direction); + } else { + CHECK_CANDIDATE((xo+xo2)>>1, + (data->currentQMV[0].x == xo) ? data->currentQMV[0].y : v_best2.y, direction); + } + return; + } + + if (xo == xo2) { + CHECK_CANDIDATE_2ndBEST(xo, (yo+yo2)>>1, 0); + CHECK_CANDIDATE_2ndBEST(xo-1, yo, 0); + CHECK_CANDIDATE_2ndBEST(xo+1, yo, 0); + data->currentQMV[0] = v_best; + data->iMinSAD[0] = s_best; + + if(best_halfpel <= s_best2) return; + + if(data->currentQMV[0].y == v_best2.y) { + CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, direction); + CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, direction); + } else { + CHECK_CANDIDATE((data->currentQMV[0].y == yo) ? data->currentQMV[0].x : v_best2.x, (yo+yo2)>>1, direction); + } + return; + } + + CHECK_CANDIDATE_2ndBEST(xo, (yo+yo2)>>1, 0); + CHECK_CANDIDATE_2ndBEST((xo+xo2)>>1, yo, 0); + data->currentQMV[0] = v_best; + data->iMinSAD[0] = s_best; + + if(best_halfpel <= s_best2) return; + + CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, direction); + +}