21 |
* along with this program ; if not, write to the Free Software |
* along with this program ; if not, write to the Free Software |
22 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
23 |
* |
* |
24 |
* $Id: motion_est.c,v 1.58.2.22 2003-07-13 09:58:44 syskin Exp $ |
* $Id: motion_est.c,v 1.58.2.32 2003-08-29 13:47:21 syskin Exp $ |
25 |
* |
* |
26 |
****************************************************************************/ |
****************************************************************************/ |
27 |
|
|
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 |
/***************************************************************************** |
/***************************************************************************** |
109 |
{ |
{ |
110 |
int sad; |
int sad; |
111 |
const uint32_t stride = data->iEdgedWidth/2; |
const uint32_t stride = data->iEdgedWidth/2; |
112 |
uint8_t * f_refu = data->RefQ, |
uint8_t *f_refu, *f_refv, *b_refu, *b_refv; |
113 |
* f_refv = data->RefQ + 8, |
|
114 |
* b_refu = data->RefQ + 16, |
const INTERPOLATE8X8_PTR interpolate8x8_halfpel[] = { |
115 |
* b_refv = data->RefQ + 24; |
NULL, |
116 |
|
interpolate8x8_halfpel_v, |
117 |
|
interpolate8x8_halfpel_h, |
118 |
|
interpolate8x8_halfpel_hv |
119 |
|
}; |
120 |
|
|
121 |
int offset = (fx>>1) + (fy>>1)*stride; |
int offset = (fx>>1) + (fy>>1)*stride; |
122 |
|
int filter = ((fx & 1) << 1) | (fy & 1); |
123 |
|
|
124 |
switch (((fx & 1) << 1) | (fy & 1)) { |
if (filter != 0) { |
125 |
case 0: |
f_refu = data->RefQ; |
126 |
|
f_refv = data->RefQ + 8; |
127 |
|
interpolate8x8_halfpel[filter](f_refu, data->RefP[4] + offset, stride, data->rounding); |
128 |
|
interpolate8x8_halfpel[filter](f_refv, data->RefP[5] + offset, stride, data->rounding); |
129 |
|
} else { |
130 |
f_refu = (uint8_t*)data->RefP[4] + offset; |
f_refu = (uint8_t*)data->RefP[4] + offset; |
131 |
f_refv = (uint8_t*)data->RefP[5] + offset; |
f_refv = (uint8_t*)data->RefP[5] + offset; |
|
break; |
|
|
case 1: |
|
|
interpolate8x8_halfpel_v(f_refu, data->RefP[4] + offset, stride, data->rounding); |
|
|
interpolate8x8_halfpel_v(f_refv, data->RefP[5] + offset, stride, data->rounding); |
|
|
break; |
|
|
case 2: |
|
|
interpolate8x8_halfpel_h(f_refu, data->RefP[4] + offset, stride, data->rounding); |
|
|
interpolate8x8_halfpel_h(f_refv, data->RefP[5] + offset, stride, data->rounding); |
|
|
break; |
|
|
default: |
|
|
interpolate8x8_halfpel_hv(f_refu, data->RefP[4] + offset, stride, data->rounding); |
|
|
interpolate8x8_halfpel_hv(f_refv, data->RefP[5] + offset, stride, data->rounding); |
|
|
break; |
|
132 |
} |
} |
133 |
|
|
134 |
offset = (bx>>1) + (by>>1)*stride; |
offset = (bx>>1) + (by>>1)*stride; |
135 |
switch (((bx & 1) << 1) | (by & 1)) { |
filter = ((bx & 1) << 1) | (by & 1); |
136 |
case 0: |
|
137 |
|
if (filter != 0) { |
138 |
|
b_refu = data->RefQ + 16; |
139 |
|
b_refv = data->RefQ + 24; |
140 |
|
interpolate8x8_halfpel[filter](b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
141 |
|
interpolate8x8_halfpel[filter](b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
142 |
|
} else { |
143 |
b_refu = (uint8_t*)data->b_RefP[4] + offset; |
b_refu = (uint8_t*)data->b_RefP[4] + offset; |
144 |
b_refv = (uint8_t*)data->b_RefP[5] + offset; |
b_refv = (uint8_t*)data->b_RefP[5] + offset; |
|
break; |
|
|
case 1: |
|
|
interpolate8x8_halfpel_v(b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
|
|
interpolate8x8_halfpel_v(b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
|
|
break; |
|
|
case 2: |
|
|
interpolate8x8_halfpel_h(b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
|
|
interpolate8x8_halfpel_h(b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
|
|
break; |
|
|
default: |
|
|
interpolate8x8_halfpel_hv(b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
|
|
interpolate8x8_halfpel_hv(b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
|
|
break; |
|
145 |
} |
} |
146 |
|
|
147 |
sad = sad8bi(data->CurU, b_refu, f_refu, stride); |
sad = sad8bi(data->CurU, b_refu, f_refu, stride); |
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); |
290 |
interpolate8x8_avg2(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, iEdgedWidth, rounding, 8); |
interpolate8x8_avg2(Reference+8*iEdgedWidth+8, ref1+8*iEdgedWidth+8, ref2+8*iEdgedWidth+8, iEdgedWidth, rounding, 8); |
291 |
break; |
break; |
292 |
|
|
293 |
|
|
294 |
default: /* pure halfpel position */ |
default: /* pure halfpel position */ |
295 |
return (uint8_t *) ref1; |
return (uint8_t *) ref1; |
296 |
} |
} |
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; |
487 |
if ( (x > data->max_dx) || (x < data->min_dx) |
if ( (x > data->max_dx) || (x < data->min_dx) |
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 + y*((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 |
CheckCandidateBits16(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; |
676 |
int32_t bits = 0; |
int32_t rd = 0; |
677 |
VECTOR * current; |
VECTOR * current; |
678 |
const uint8_t * ptr; |
const uint8_t * ptr; |
679 |
int i, cbp = 0, t, xc, yc; |
int i, cbp = 0, t, xc, yc; |
694 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
695 |
int s = 8*((i&1) + (i>>1)*data->iEdgedWidth); |
int s = 8*((i&1) + (i>>1)*data->iEdgedWidth); |
696 |
transfer_8to16subro(in, data->Cur + s, ptr + s, data->iEdgedWidth); |
transfer_8to16subro(in, data->Cur + s, ptr + s, data->iEdgedWidth); |
697 |
bits += data->temp[i] = Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, i); |
rd += data->temp[i] = Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, i); |
698 |
} |
} |
699 |
|
|
700 |
bits += t = BITS_MULT*d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
rd += t = BITS_MULT*d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
701 |
|
|
702 |
if (data->temp[0] + t < data->iMinSAD[1]) { |
if (data->temp[0] + t < data->iMinSAD[1]) { |
703 |
data->iMinSAD[1] = data->temp[0] + t; current[1].x = x; current[1].y = y; data->cbp[1] = (data->cbp[1]&~32) | cbp&32; } |
data->iMinSAD[1] = data->temp[0] + t; current[1].x = x; current[1].y = y; data->cbp[1] = (data->cbp[1]&~32) | (cbp&32); } |
704 |
if (data->temp[1] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
705 |
data->iMinSAD[2] = data->temp[1]; current[2].x = x; current[2].y = y; data->cbp[1] = (data->cbp[1]&~16) | cbp&16; } |
data->iMinSAD[2] = data->temp[1]; current[2].x = x; current[2].y = y; data->cbp[1] = (data->cbp[1]&~16) | (cbp&16); } |
706 |
if (data->temp[2] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
707 |
data->iMinSAD[3] = data->temp[2]; current[3].x = x; current[3].y = y; data->cbp[1] = (data->cbp[1]&~8) | cbp&8; } |
data->iMinSAD[3] = data->temp[2]; current[3].x = x; current[3].y = y; data->cbp[1] = (data->cbp[1]&~8) | (cbp&8); } |
708 |
if (data->temp[3] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
709 |
data->iMinSAD[4] = data->temp[3]; current[4].x = x; current[4].y = y; data->cbp[1] = (data->cbp[1]&~4) | cbp&4; } |
data->iMinSAD[4] = data->temp[3]; current[4].x = x; current[4].y = y; data->cbp[1] = (data->cbp[1]&~4) | (cbp&4); } |
710 |
|
|
711 |
bits += BITS_MULT*xvid_cbpy_tab[15-(cbp>>2)].len; |
rd += BITS_MULT*xvid_cbpy_tab[15-(cbp>>2)].len; |
712 |
|
|
713 |
if (bits >= data->iMinSAD[0]) return; |
if (rd >= data->iMinSAD[0]) return; |
714 |
|
|
715 |
/* chroma */ |
/* chroma */ |
716 |
xc = (xc >> 1) + roundtab_79[xc & 0x3]; |
xc = (xc >> 1) + roundtab_79[xc & 0x3]; |
719 |
/* chroma U */ |
/* chroma U */ |
720 |
ptr = interpolate8x8_switch2(data->RefQ, data->RefP[4], 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
ptr = interpolate8x8_switch2(data->RefQ, data->RefP[4], 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
721 |
transfer_8to16subro(in, data->CurU, ptr, data->iEdgedWidth/2); |
transfer_8to16subro(in, data->CurU, ptr, data->iEdgedWidth/2); |
722 |
bits += Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, 4); |
rd += Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, 4); |
723 |
if (bits >= data->iMinSAD[0]) return; |
if (rd >= data->iMinSAD[0]) return; |
724 |
|
|
725 |
/* chroma V */ |
/* chroma V */ |
726 |
ptr = interpolate8x8_switch2(data->RefQ, data->RefP[5], 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
ptr = interpolate8x8_switch2(data->RefQ, data->RefP[5], 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
727 |
transfer_8to16subro(in, data->CurV, ptr, data->iEdgedWidth/2); |
transfer_8to16subro(in, data->CurV, ptr, data->iEdgedWidth/2); |
728 |
bits += Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, 5); |
rd += Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, 5); |
729 |
|
|
730 |
bits += BITS_MULT*mcbpc_inter_tab[(MODE_INTER & 7) | ((cbp & 3) << 3)].len; |
rd += BITS_MULT*mcbpc_inter_tab[(MODE_INTER & 7) | ((cbp & 3) << 3)].len; |
731 |
|
|
732 |
if (bits < data->iMinSAD[0]) { |
if (rd < data->iMinSAD[0]) { |
733 |
data->iMinSAD[0] = bits; |
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 |
CheckCandidateBits8(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; |
745 |
int32_t bits; |
int32_t rd; |
746 |
VECTOR * current; |
VECTOR * current; |
747 |
const uint8_t * ptr; |
const uint8_t * ptr; |
748 |
int cbp = 0; |
int cbp = 0; |
759 |
} |
} |
760 |
|
|
761 |
transfer_8to16subro(in, data->Cur, ptr, data->iEdgedWidth); |
transfer_8to16subro(in, data->Cur, ptr, data->iEdgedWidth); |
762 |
bits = Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, 5); |
rd = Block_CalcBits(coeff, in, data->dctSpace + 128, data->iQuant, data->quant_type, &cbp, 5); |
763 |
bits += BITS_MULT*d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
rd += BITS_MULT*d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
764 |
|
|
765 |
if (bits < data->iMinSAD[0]) { |
if (rd < data->iMinSAD[0]) { |
766 |
*data->cbp = cbp; |
*data->cbp = cbp; |
767 |
data->iMinSAD[0] = bits; |
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); |
961 |
} |
} |
962 |
|
|
963 |
static __inline void |
static __inline void |
964 |
SkipMacroblockP(MACROBLOCK *pMB, const int32_t sad) |
ZeroMacroblockP(MACROBLOCK *pMB, const int32_t sad) |
965 |
{ |
{ |
966 |
pMB->mode = MODE_NOT_CODED; |
pMB->mode = MODE_INTER; |
967 |
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = zeroMV; |
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = zeroMV; |
968 |
pMB->qmvs[0] = pMB->qmvs[1] = pMB->qmvs[2] = pMB->qmvs[3] = zeroMV; |
pMB->qmvs[0] = pMB->qmvs[1] = pMB->qmvs[2] = pMB->qmvs[3] = zeroMV; |
969 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = sad; |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = sad; |
992 |
|
|
993 |
pMB->mcsel = 0; |
pMB->mcsel = 0; |
994 |
|
|
995 |
if (!(VopFlags & XVID_VOP_MODEDECISION_BITS)) { /* normal, fast, SAD-based mode decision */ |
if (!(VopFlags & XVID_VOP_MODEDECISION_RD)) { /* normal, fast, SAD-based mode decision */ |
996 |
int sad; |
int sad; |
997 |
int InterBias = MV16_INTER_BIAS; |
int InterBias = MV16_INTER_BIAS; |
998 |
if (inter4v == 0 || Data->iMinSAD[0] < Data->iMinSAD[1] + Data->iMinSAD[2] + |
if (inter4v == 0 || Data->iMinSAD[0] < Data->iMinSAD[1] + Data->iMinSAD[2] + |
1060 |
pMB->cbp = 63; |
pMB->cbp = 63; |
1061 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = sad; |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = sad; |
1062 |
|
|
1063 |
} else { /* BITS */ |
} else { /* Rate-Distortion */ |
1064 |
|
|
1065 |
int bits, intra, i, cbp, c[2] = {0, 0}; |
int min_rd, intra_rd, i, cbp, c[2] = {0, 0}; |
1066 |
VECTOR backup[5], *v; |
VECTOR backup[5], *v; |
1067 |
Data->iQuant = iQuant; |
Data->iQuant = iQuant; |
1068 |
Data->cbp = c; |
Data->cbp = c; |
1073 |
backup[i] = v[i]; |
backup[i] = v[i]; |
1074 |
} |
} |
1075 |
|
|
1076 |
bits = CountMBBitsInter(Data, pMBs, x, y, pParam, MotionFlags); |
min_rd = findRDinter(Data, pMBs, x, y, pParam, MotionFlags); |
1077 |
cbp = *Data->cbp; |
cbp = *Data->cbp; |
1078 |
|
|
1079 |
if (coding_type == S_VOP) { |
if (coding_type == S_VOP) { |
1080 |
int bits_gmc; |
int gmc_rd; |
1081 |
*Data->iMinSAD = bits += BITS_MULT*1; /* mcsel */ |
*Data->iMinSAD = min_rd += BITS_MULT*1; /* mcsel */ |
1082 |
bits_gmc = CountMBBitsGMC(Data, vGMC, x, y); |
gmc_rd = findRDgmc(Data, vGMC, x, y); |
1083 |
if (bits_gmc < bits) { |
if (gmc_rd < min_rd) { |
1084 |
mcsel = 1; |
mcsel = 1; |
1085 |
*Data->iMinSAD = bits = bits_gmc; |
*Data->iMinSAD = min_rd = gmc_rd; |
1086 |
mode = MODE_INTER; |
mode = MODE_INTER; |
1087 |
cbp = *Data->cbp; |
cbp = *Data->cbp; |
1088 |
} |
} |
1089 |
} |
} |
1090 |
|
|
1091 |
if (inter4v) { |
if (inter4v) { |
1092 |
int bits_4v; |
int v4_rd; |
1093 |
bits_4v = CountMBBitsInter4v(Data, pMB, pMBs, x, y, pParam, MotionFlags, backup); |
v4_rd = findRDinter4v(Data, pMB, pMBs, x, y, pParam, MotionFlags, backup); |
1094 |
if (bits_4v < bits) { |
if (v4_rd < min_rd) { |
1095 |
Data->iMinSAD[0] = bits = bits_4v; |
Data->iMinSAD[0] = min_rd = v4_rd; |
1096 |
mode = MODE_INTER4V; |
mode = MODE_INTER4V; |
1097 |
cbp = *Data->cbp; |
cbp = *Data->cbp; |
1098 |
} |
} |
1099 |
} |
} |
1100 |
|
|
1101 |
intra = CountMBBitsIntra(Data); |
intra_rd = findRDintra(Data); |
1102 |
if (intra < bits) { |
if (intra_rd < min_rd) { |
1103 |
*Data->iMinSAD = bits = intra; |
*Data->iMinSAD = min_rd = intra_rd; |
1104 |
mode = MODE_INTRA; |
mode = MODE_INTRA; |
1105 |
} |
} |
1106 |
|
|
1139 |
} else |
} else |
1140 |
if (mode == MODE_INTER4V) ; /* anything here? */ |
if (mode == MODE_INTER4V) ; /* anything here? */ |
1141 |
else /* INTRA, NOT_CODED */ |
else /* INTRA, NOT_CODED */ |
1142 |
SkipMacroblockP(pMB, 0); |
ZeroMacroblockP(pMB, 0); |
1143 |
|
|
1144 |
pMB->mode = mode; |
pMB->mode = mode; |
1145 |
} |
} |
1165 |
|
|
1166 |
uint32_t x, y; |
uint32_t x, y; |
1167 |
uint32_t iIntra = 0; |
uint32_t iIntra = 0; |
1168 |
int32_t quant = current->quant, sad00; |
int32_t sad00; |
1169 |
int skip_thresh = INITIAL_SKIP_THRESH * \ |
int skip_thresh = INITIAL_SKIP_THRESH * \ |
1170 |
(current->vop_flags & XVID_VOP_REDUCED ? 4:1) * \ |
(current->vop_flags & XVID_VOP_REDUCED ? 4:1) * \ |
1171 |
(current->vop_flags & XVID_VOP_MODEDECISION_BITS ? 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); |
1190 |
Data.chroma = MotionFlags & XVID_ME_CHROMA16; |
Data.chroma = MotionFlags & XVID_ME_CHROMA_PVOP; |
1191 |
Data.rrv = (current->vop_flags & XVID_VOP_REDUCED) ? 1:0; |
Data.rrv = (current->vop_flags & XVID_VOP_REDUCED) ? 1:0; |
1192 |
Data.dctSpace = dct_space; |
Data.dctSpace = dct_space; |
1193 |
Data.quant_type = !(pParam->vol_flags & XVID_VOL_MPEGQUANT); |
Data.quant_type = !(pParam->vol_flags & XVID_VOL_MPEGQUANT); |
1225 |
|
|
1226 |
sad00 = pMB->sad16; |
sad00 = pMB->sad16; |
1227 |
|
|
|
if (pMB->dquant != 0) { |
|
|
quant += DQtab[pMB->dquant]; |
|
|
if (quant > 31) quant = 31; |
|
|
else if (quant < 1) quant = 1; |
|
|
} |
|
|
pMB->quant = quant; |
|
|
|
|
1228 |
/* initial skip decision */ |
/* initial skip decision */ |
1229 |
/* no early skip for GMC (global vector = skip vector is unknown!) */ |
/* no early skip for GMC (global vector = skip vector is unknown!) */ |
1230 |
if (current->coding_type != S_VOP) { /* no fast SKIP for S(GMC)-VOPs */ |
if (current->coding_type != S_VOP) { /* no fast SKIP for S(GMC)-VOPs */ |
1231 |
if (pMB->dquant == 0 && sad00 < pMB->quant * skip_thresh) |
if (pMB->dquant == 0 && sad00 < pMB->quant * skip_thresh) |
1232 |
if (Data.chroma || SkipDecisionP(pCurrent, pRef, x, y, iEdgedWidth/2, pMB->quant, Data.rrv)) { |
if (Data.chroma || SkipDecisionP(pCurrent, pRef, x, y, iEdgedWidth/2, pMB->quant, Data.rrv)) { |
1233 |
SkipMacroblockP(pMB, sad00); |
ZeroMacroblockP(pMB, sad00); |
1234 |
|
pMB->mode = MODE_NOT_CODED; |
1235 |
continue; |
continue; |
1236 |
} |
} |
1237 |
} |
} |
1238 |
|
|
1239 |
|
if ((current->vop_flags & XVID_VOP_CARTOON) && |
1240 |
|
(sad00 < pMB->quant * 4 * skip_thresh)) { /* favorize (0,0) vector for cartoons */ |
1241 |
|
ZeroMacroblockP(pMB, sad00); |
1242 |
|
continue; |
1243 |
|
} |
1244 |
|
|
1245 |
SearchP(pRef, pRefH->y, pRefV->y, pRefHV->y, pCurrent, x, |
SearchP(pRef, pRefH->y, pRefV->y, pRefHV->y, pCurrent, x, |
1246 |
y, MotionFlags, current->vop_flags, current->vol_flags, |
y, MotionFlags, current->vop_flags, current->vol_flags, |
1247 |
&Data, pParam, pMBs, reference->mbs, pMB); |
&Data, pParam, pMBs, reference->mbs, pMB); |
1255 |
} |
} |
1256 |
} |
} |
1257 |
|
|
|
// if (current->vol_flags & XVID_VOL_GMC ) /* GMC only for S(GMC)-VOPs */ |
|
|
// { |
|
|
// current->warp = GlobalMotionEst( pMBs, pParam, current, reference, pRefH, pRefV, pRefHV); |
|
|
// } |
|
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, 16, |
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, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
1355 |
|
|
1356 |
get_pmvdata2(pMBs, pParam->mb_width, 0, x, y, 0, pmv, Data->temp); |
get_pmvdata2(pMBs, pParam->mb_width, 0, x, y, 0, pmv, Data->temp); |
1357 |
|
|
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 |
|
|
1385 |
Data->iMinSAD[3] = pMB->sad8[2]; |
Data->iMinSAD[3] = pMB->sad8[2]; |
1386 |
Data->iMinSAD[4] = pMB->sad8[3]; |
Data->iMinSAD[4] = pMB->sad8[3]; |
1387 |
|
|
1388 |
if ((!(VopFlags & XVID_VOP_MODEDECISION_BITS)) && (x | y)) { |
if ((!(VopFlags & XVID_VOP_MODEDECISION_RD)) && (x | y)) { |
1389 |
threshA = Data->temp[0]; /* that's where we keep this SAD atm */ |
threshA = Data->temp[0]; /* that's where we keep this SAD atm */ |
1390 |
if (threshA < 512) threshA = 512; |
if (threshA < 512) threshA = 512; |
1391 |
else if (threshA > 1024) threshA = 1024; |
else if (threshA > 1024) threshA = 1024; |
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 */ |
1468 |
} |
} |
1469 |
|
|
1470 |
if (Data->qpel) { |
if (Data->qpel) { |
1471 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
1472 |
pParam->width, pParam->height, Data->iFcode, 1, 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) |
1487 |
Search8(Data, 2*x, 2*y + 1, MotionFlags, pParam, pMB, pMBs, 2, &Data8); |
Search8(Data, 2*x, 2*y + 1, MotionFlags, pParam, pMB, pMBs, 2, &Data8); |
1488 |
Search8(Data, 2*x + 1, 2*y + 1, MotionFlags, pParam, pMB, pMBs, 3, &Data8); |
Search8(Data, 2*x + 1, 2*y + 1, MotionFlags, pParam, pMB, pMBs, 3, &Data8); |
1489 |
|
|
1490 |
if ((Data->chroma) && (!(VopFlags & XVID_VOP_MODEDECISION_BITS))) { |
if ((Data->chroma) && (!(VopFlags & XVID_VOP_MODEDECISION_RD))) { |
1491 |
/* chroma is only used for comparsion to INTER. if the comparsion will be done in BITS domain, it will not be used */ |
/* chroma is only used for comparsion to INTER. if the comparsion will be done in BITS domain, it will not be used */ |
1492 |
int sumx = 0, sumy = 0; |
int sumx = 0, sumy = 0; |
1493 |
|
|
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; |
1548 |
Data->Cur = OldData->Cur + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
Data->Cur = OldData->Cur + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
1549 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
1550 |
|
|
1551 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 8, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 3, |
1552 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
1553 |
|
|
1554 |
if (!Data->rrv) CheckCandidate = CheckCandidate8; |
if (!Data->rrv) CheckCandidate = CheckCandidate8; |
1555 |
else CheckCandidate = CheckCandidate16no4v; |
else CheckCandidate = CheckCandidate16no4v; |
1556 |
|
|
1557 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && (!(MotionFlags & XVID_ME_EXTSEARCH_BITS))) { |
if (MotionFlags & XVID_ME_EXTSEARCH8 && (!(MotionFlags & XVID_ME_EXTSEARCH_RD))) { |
1558 |
int32_t temp_sad = *(Data->iMinSAD); /* store current MinSAD */ |
int32_t temp_sad = *(Data->iMinSAD); /* store current MinSAD */ |
1559 |
|
|
1560 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
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 */ |
1583 |
|
|
1584 |
if (Data->qpel && MotionFlags & XVID_ME_QUARTERPELREFINE8) { |
if (Data->qpel && MotionFlags & XVID_ME_QUARTERPELREFINE8) { |
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, 8, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 3, |
1587 |
pParam->width, pParam->height, Data->iFcode, 1, 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; |
1675 |
VECTOR pmv[7]; |
VECTOR pmv[7]; |
1676 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
1677 |
*Data->iMinSAD = MV_MAX_ERROR; |
*Data->iMinSAD = MV_MAX_ERROR; |
1688 |
|
|
1689 |
Data->predMV = *predMV; |
Data->predMV = *predMV; |
1690 |
|
|
1691 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
1692 |
pParam->width, pParam->height, iFcode - Data->qpel, 0, 0); |
pParam->width, pParam->height, iFcode - Data->qpel, 1, 0); |
1693 |
|
|
1694 |
pmv[0] = Data->predMV; |
pmv[0] = Data->predMV; |
1695 |
if (Data->qpel) { pmv[0].x /= 2; pmv[0].y /= 2; } |
if (Data->qpel) { pmv[0].x /= 2; pmv[0].y /= 2; } |
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); |
if (*Data->iMinSAD > 512) { |
1711 |
|
unsigned int mask = make_mask(pmv, 7, *Data->dir); |
1712 |
|
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate16no4v); |
1713 |
|
} |
1714 |
|
|
1715 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16no4v); |
1716 |
|
|
1717 |
if (Data->qpel && *Data->iMinSAD < *best_sad + 300) { |
if (Data->qpel && *Data->iMinSAD < *best_sad + 300) { |
1718 |
Data->currentQMV->x = 2*Data->currentMV->x; |
Data->currentQMV->x = 2*Data->currentMV->x; |
1719 |
Data->currentQMV->y = 2*Data->currentMV->y; |
Data->currentQMV->y = 2*Data->currentMV->y; |
1720 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
1721 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
1722 |
pParam->width, pParam->height, iFcode, 1, 0); |
pParam->width, pParam->height, iFcode, 2, 0); |
1723 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16no4v); |
1724 |
} |
} |
1725 |
|
|
1726 |
/* three bits are needed to code backward mode. four for forward */ |
/* three bits are needed to code backward mode. four for forward */ |
1760 |
{ |
{ |
1761 |
int dx = 0, dy = 0, b_dx = 0, b_dy = 0; |
int dx = 0, dy = 0, b_dx = 0, b_dy = 0; |
1762 |
int32_t sum; |
int32_t sum; |
|
const int div = 1 + Data->qpel; |
|
1763 |
int k; |
int k; |
1764 |
const uint32_t stride = Data->iEdgedWidth/2; |
const uint32_t stride = Data->iEdgedWidth/2; |
1765 |
/* this is not full chroma compensation, only it's fullpel approximation. should work though */ |
/* this is not full chroma compensation, only it's fullpel approximation. should work though */ |
1766 |
|
|
1767 |
for (k = 0; k < 4; k++) { |
for (k = 0; k < 4; k++) { |
1768 |
dy += Data->directmvF[k].y / div; |
dy += Data->directmvF[k].y >> Data->qpel; |
1769 |
dx += Data->directmvF[k].x / div; |
dx += Data->directmvF[k].x >> Data->qpel; |
1770 |
b_dy += Data->directmvB[k].y / div; |
b_dy += Data->directmvB[k].y >> Data->qpel; |
1771 |
b_dx += Data->directmvB[k].x / div; |
b_dx += Data->directmvB[k].x >> Data->qpel; |
1772 |
} |
} |
1773 |
|
|
1774 |
dy = (dy >> 3) + roundtab_76[dy & 0xf]; |
dy = (dy >> 3) + roundtab_76[dy & 0xf]; |
1781 |
b_Ref->u + (y*8 + b_dy/2) * stride + x*8 + b_dx/2, |
b_Ref->u + (y*8 + b_dy/2) * stride + x*8 + b_dx/2, |
1782 |
stride); |
stride); |
1783 |
|
|
1784 |
if (sum >= 2 * MAX_CHROMA_SAD_FOR_SKIP * pMB->quant) return; /* no skip */ |
if (sum >= MAX_CHROMA_SAD_FOR_SKIP * Data->iQuant) return; /* no skip */ |
1785 |
|
|
1786 |
sum += sad8bi(pCur->v + 8*x + 8 * y * stride, |
sum += sad8bi(pCur->v + 8*x + 8 * y * stride, |
1787 |
f_Ref->v + (y*8 + dy/2) * stride + x*8 + dx/2, |
f_Ref->v + (y*8 + dy/2) * stride + x*8 + dx/2, |
1788 |
b_Ref->v + (y*8 + b_dy/2) * stride + x*8 + b_dx/2, |
b_Ref->v + (y*8 + b_dy/2) * stride + x*8 + b_dx/2, |
1789 |
stride); |
stride); |
1790 |
|
|
1791 |
if (sum < 2 * MAX_CHROMA_SAD_FOR_SKIP * pMB->quant) { |
if (sum < MAX_CHROMA_SAD_FOR_SKIP * Data->iQuant) { |
1792 |
pMB->mode = MODE_DIRECT_NONE_MV; /* skipped */ |
pMB->mode = MODE_DIRECT_NONE_MV; /* skipped */ |
1793 |
for (k = 0; k < 4; k++) { |
for (k = 0; k < 4; k++) { |
1794 |
pMB->qmvs[k] = pMB->mvs[k]; |
pMB->qmvs[k] = pMB->mvs[k]; |
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 < Data->iQuant * INITIAL_SKIP_THRESH * (Data->chroma?3:2)) { |
1877 |
/* possible skip */ |
/* possible skip */ |
1878 |
if (Data->chroma) { |
if (Data->chroma) { |
1879 |
pMB->mode = MODE_DIRECT_NONE_MV; |
pMB->mode = MODE_DIRECT_NONE_MV; |
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; |
1987 |
fData->currentMV[0] = fData->currentMV[2]; |
fData->currentMV[0] = fData->currentMV[2]; |
1988 |
|
|
1989 |
get_range(&fData->min_dx, &fData->max_dx, &fData->min_dy, &fData->max_dy, x, y, 16, pParam->width, pParam->height, fcode - fData->qpel, 0, 0); |
get_range(&fData->min_dx, &fData->max_dx, &fData->min_dy, &fData->max_dy, x, y, 4, pParam->width, pParam->height, fcode - fData->qpel, 1, 0); |
1990 |
get_range(&bData.min_dx, &bData.max_dx, &bData.min_dy, &bData.max_dy, x, y, 16, pParam->width, pParam->height, bcode - fData->qpel, 0, 0); |
get_range(&bData.min_dx, &bData.max_dx, &bData.min_dy, &bData.max_dy, x, y, 4, pParam->width, pParam->height, bcode - fData->qpel, 1, 0); |
1991 |
|
|
1992 |
if (fData->currentMV[0].x > fData->max_dx) fData->currentMV[0].x = fData->max_dx; |
if (fData->currentMV[0].x > fData->max_dx) fData->currentMV[0].x = fData->max_dx; |
1993 |
if (fData->currentMV[0].x < fData->min_dx) fData->currentMV[0].x = fData->min_dx; |
if (fData->currentMV[0].x < fData->min_dx) fData->currentMV[0].x = fData->min_dx; |
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, 16, pParam->width, pParam->height, fcode, 1, 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, 16, pParam->width, pParam->height, bcode, 1, 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); |
2031 |
fData->currentQMV[2].x = fData->currentQMV[0].x = 2 * fData->currentMV[0].x; |
fData->currentQMV[2].x = fData->currentQMV[0].x = 2 * fData->currentMV[0].x; |
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]; |
2102 |
Data.iEdgedWidth = pParam->edged_width; |
Data.iEdgedWidth = pParam->edged_width; |
2103 |
Data.currentMV = currentMV; Data.currentQMV = currentQMV; |
Data.currentMV = currentMV; Data.currentQMV = currentQMV; |
2104 |
Data.iMinSAD = &iMinSAD; |
Data.iMinSAD = &iMinSAD; |
2105 |
Data.lambda16 = lambda_vec16[frame->quant]; |
Data.lambda16 = lambda_vec16[MAX(frame->quant-2, 2)]; |
2106 |
Data.qpel = pParam->vol_flags & XVID_VOL_QUARTERPEL; |
Data.qpel = pParam->vol_flags & XVID_VOL_QUARTERPEL ? 1 : 0; |
2107 |
Data.rounding = 0; |
Data.rounding = 0; |
2108 |
Data.chroma = frame->motion_flags & XVID_ME_CHROMA8; |
Data.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
2109 |
Data.temp = temp; |
Data.temp = temp; |
2110 |
|
Data.dir = &dir; |
2111 |
|
Data.iQuant = frame->quant; |
2112 |
|
|
2113 |
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) */ |
2114 |
|
|
2131 |
Data.Cur = frame->image.y + (j * Data.iEdgedWidth + i) * 16; |
Data.Cur = frame->image.y + (j * Data.iEdgedWidth + i) * 16; |
2132 |
Data.CurU = frame->image.u + (j * Data.iEdgedWidth/2 + i) * 8; |
Data.CurU = frame->image.u + (j * Data.iEdgedWidth/2 + i) * 8; |
2133 |
Data.CurV = frame->image.v + (j * Data.iEdgedWidth/2 + i) * 8; |
Data.CurV = frame->image.v + (j * Data.iEdgedWidth/2 + i) * 8; |
|
pMB->quant = frame->quant; |
|
2134 |
|
|
2135 |
/* direct search comes first, because it (1) checks for SKIP-mode |
/* direct search comes first, because it (1) checks for SKIP-mode |
2136 |
and (2) sets very good predictions for forward and backward search */ |
and (2) sets very good predictions for forward and backward search */ |
2176 |
&Data); |
&Data); |
2177 |
|
|
2178 |
/* final skip decision */ |
/* final skip decision */ |
2179 |
if ( (skip_sad < frame->quant * MAX_SAD00_FOR_SKIP * 2) |
if ( (skip_sad < Data.iQuant * MAX_SAD00_FOR_SKIP * 2) |
2180 |
&& ((100*best_sad)/(skip_sad+1) > FINAL_SKIP_THRESH) ) |
&& ((100*best_sad)/(skip_sad+1) > FINAL_SKIP_THRESH) ) |
2181 |
SkipDecisionB(&frame->image, f_ref, b_ref, pMB, i, j, &Data); |
SkipDecisionB(&frame->image, f_ref, b_ref, pMB, i, j, &Data); |
2182 |
|
|
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 |
|
|
2221 |
|
unsigned int simplicity = 0; |
2222 |
|
|
2223 |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
2224 |
|
|
2225 |
|
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2226 |
|
pParam->width, pParam->height, Data->iFcode - Data->qpel - 1, 0, 0); |
2227 |
|
|
2228 |
|
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
2229 |
|
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
2230 |
|
|
2231 |
|
pmv[0].x = pMB->mvs[0].x; |
2232 |
|
pmv[0].y = pMB->mvs[0].y; |
2233 |
|
|
2234 |
|
CheckCandidate32I(pmv[0].x, pmv[0].y, Data, 0); |
2235 |
|
|
2236 |
|
if (*Data->iMinSAD > 200) { |
2237 |
|
|
2238 |
|
pmv[1].x = pmv[1].y = 0; |
2239 |
|
|
2240 |
/* median is only used as prediction. it doesn't have to be real */ |
/* median is only used as prediction. it doesn't have to be real */ |
2241 |
if (x == 1 && y == 1) Data->predMV.x = Data->predMV.y = 0; |
if (x == 1 && y == 1) Data->predMV.x = Data->predMV.y = 0; |
2242 |
else |
else |
2246 |
Data->predMV = (pMB - 1)->mvs[0]; /* left instead of median */ |
Data->predMV = (pMB - 1)->mvs[0]; /* left instead of median */ |
2247 |
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 */ |
2248 |
|
|
2249 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
pmv[2].x = Data->predMV.x; |
2250 |
pParam->width, pParam->height, Data->iFcode - quarterpel, 0, 0); |
pmv[2].y = Data->predMV.y; |
2251 |
|
|
2252 |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
if (!vector_repeats(pmv, 1)) |
2253 |
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
CheckCandidate32I(pmv[1].x, pmv[1].y, Data, 1); |
2254 |
|
if (!vector_repeats(pmv, 2)) |
2255 |
pmv[1].x = EVEN(pMB->mvs[0].x); |
CheckCandidate32I(pmv[2].x, pmv[2].y, Data, 2); |
2256 |
pmv[1].y = EVEN(pMB->mvs[0].y); |
|
2257 |
pmv[2].x = EVEN(Data->predMV.x); |
if (*Data->iMinSAD > 500) { /* diamond only if needed */ |
2258 |
pmv[2].y = EVEN(Data->predMV.y); |
unsigned int mask = make_mask(pmv, 3, *Data->dir); |
2259 |
pmv[0].x = pmv[0].y = 0; |
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate32I); |
2260 |
|
} else simplicity++; |
2261 |
CheckCandidate32I(0, 0, 255, &i, Data); |
|
2262 |
|
if (*Data->iMinSAD > 500) /* refinement from 2-pixel to 1-pixel */ |
2263 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
SubpelRefine(Data, CheckCandidate32I); |
2264 |
|
else simplicity++; |
2265 |
if (!(mask = make_mask(pmv, 1))) |
} else simplicity++; |
|
CheckCandidate32I(pmv[1].x, pmv[1].y, mask, &i, Data); |
|
|
if (!(mask = make_mask(pmv, 2))) |
|
|
CheckCandidate32I(pmv[2].x, pmv[2].y, mask, &i, Data); |
|
|
|
|
|
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) /* diamond only if needed */ |
|
|
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, i); |
|
|
} |
|
2266 |
|
|
2267 |
for (i = 0; i < 4; i++) { |
for (i = 0; i < 4; i++) { |
2268 |
MACROBLOCK * MB = &pMBs[x + (i&1) + (y+(i>>1)) * pParam->mb_width]; |
MACROBLOCK * MB = &pMBs[x + (i&1) + (y+(i>>1)) * pParam->mb_width]; |
2269 |
MB->mvs[0] = MB->mvs[1] = MB->mvs[2] = MB->mvs[3] = Data->currentMV[i]; |
MB->mvs[0] = MB->mvs[1] = MB->mvs[2] = MB->mvs[3] = Data->currentMV[i]; |
2270 |
MB->mode = MODE_INTER; |
MB->mode = MODE_INTER; |
2271 |
MB->sad16 = Data->iMinSAD[i+1]; |
/* if we skipped some search steps, we have to assume that SAD would be lower with them */ |
2272 |
|
MB->sad16 = Data->iMinSAD[i+1] - (simplicity<<7); |
2273 |
} |
} |
2274 |
} |
} |
2275 |
|
|
2276 |
#define INTRA_THRESH 2200 |
#define INTRA_THRESH 2200 |
2277 |
#define INTER_THRESH 50 |
#define INTER_THRESH 40 |
2278 |
#define INTRA_THRESH2 95 |
#define INTRA_THRESH2 95 |
2279 |
|
|
2280 |
int |
int |
2295 |
int complexity = 0; |
int complexity = 0; |
2296 |
|
|
2297 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
2298 |
|
uint32_t dir; |
2299 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
2300 |
SearchData Data; |
SearchData Data; |
2301 |
Data.iEdgedWidth = pParam->edged_width; |
Data.iEdgedWidth = pParam->edged_width; |
2303 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
2304 |
Data.iFcode = Current->fcode; |
Data.iFcode = Current->fcode; |
2305 |
Data.temp = temp; |
Data.temp = temp; |
2306 |
CheckCandidate = CheckCandidate32I; |
Data.dir = &dir; |
2307 |
|
Data.qpel = (pParam->vol_flags & XVID_VOL_QUARTERPEL)? 1: 0; |
2308 |
|
Data.qpel_precision = 0; |
2309 |
|
|
2310 |
if (intraCount != 0) { |
if (intraCount != 0) { |
2311 |
if (intraCount < 10) // we're right after an I frame |
if (intraCount < 10) // we're right after an I frame |
2315 |
IntraThresh -= (IntraThresh * (maxIntra - 8*(maxIntra - intraCount)))/maxIntra; |
IntraThresh -= (IntraThresh * (maxIntra - 8*(maxIntra - intraCount)))/maxIntra; |
2316 |
} |
} |
2317 |
|
|
2318 |
InterThresh -= 12 * bCount; |
InterThresh -= 20 * bCount; |
2319 |
if (InterThresh < 15 + b_thresh) InterThresh = 15 + b_thresh; |
if (InterThresh < 10 + b_thresh) InterThresh = 10 + b_thresh; |
2320 |
|
|
2321 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
2322 |
|
|
2341 |
dev = dev16(pCurrent->y + (x + (i&1) + (y + (i>>1)) * pParam->edged_width) * 16, |
dev = dev16(pCurrent->y + (x + (i&1) + (y + (i>>1)) * pParam->edged_width) * 16, |
2342 |
pParam->edged_width); |
pParam->edged_width); |
2343 |
|
|
2344 |
complexity += dev; |
complexity += MAX(dev, 300); |
2345 |
if (dev + IntraThresh < pMB->sad16) { |
if (dev + IntraThresh < pMB->sad16) { |
2346 |
pMB->mode = MODE_INTRA; |
pMB->mode = MODE_INTRA; |
2347 |
if (++intra > ((pParam->mb_height-2)*(pParam->mb_width-2))/2) return I_VOP; |
if (++intra > ((pParam->mb_height-2)*(pParam->mb_width-2))/2) return I_VOP; |
2348 |
} |
} |
2349 |
|
|
2350 |
if (pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
if (pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
2351 |
if (dev > 500 && pMB->sad16 < 1000) |
if (dev > 1000 && pMB->sad16 < 1000) |
2352 |
sSAD += 1000; |
sSAD += 1000; |
2353 |
|
|
2354 |
sSAD += pMB->sad16; |
sSAD += (dev < 4000) ? pMB->sad16 : pMB->sad16/2; /* blocks with big contrast differences usually have large SAD - while they look very good in b-frames */ |
2355 |
} |
} |
2356 |
} |
} |
2357 |
} |
} |
2359 |
|
|
2360 |
sSAD /= complexity + 4*blocks; |
sSAD /= complexity + 4*blocks; |
2361 |
|
|
2362 |
if (intraCount > 12 && sSAD > INTRA_THRESH2 ) return I_VOP; |
if (intraCount > 80 && sSAD > INTRA_THRESH2 ) return I_VOP; |
2363 |
if (sSAD > InterThresh ) return P_VOP; |
if (sSAD > InterThresh ) return P_VOP; |
2364 |
emms(); |
emms(); |
2365 |
return B_VOP; |
return B_VOP; |
2369 |
/* functions which perform BITS-based search/bitcount */ |
/* functions which perform BITS-based search/bitcount */ |
2370 |
|
|
2371 |
static int |
static int |
2372 |
CountMBBitsInter(SearchData * const Data, |
findRDinter(SearchData * const Data, |
2373 |
const MACROBLOCK * const pMBs, const int x, const int y, |
const MACROBLOCK * const pMBs, const int x, const int y, |
2374 |
const MBParam * const pParam, |
const MBParam * const pParam, |
2375 |
const uint32_t MotionFlags) |
const uint32_t MotionFlags) |
2376 |
{ |
{ |
2377 |
int i, iDirection; |
int i; |
2378 |
int32_t bsad[5]; |
int32_t bsad[5]; |
2379 |
|
|
|
CheckCandidate = CheckCandidateBits16; |
|
|
|
|
2380 |
if (Data->qpel) { |
if (Data->qpel) { |
2381 |
for(i = 0; i < 5; i++) { |
for(i = 0; i < 5; i++) { |
2382 |
Data->currentMV[i].x = Data->currentQMV[i].x/2; |
Data->currentMV[i].x = Data->currentQMV[i].x/2; |
2383 |
Data->currentMV[i].y = Data->currentQMV[i].y/2; |
Data->currentMV[i].y = Data->currentQMV[i].y/2; |
2384 |
} |
} |
2385 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2386 |
CheckCandidateBits16(Data->currentQMV[0].x, Data->currentQMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentQMV[0].x, Data->currentQMV[0].y, Data, 255); |
2387 |
|
|
2388 |
if (MotionFlags & (XVID_ME_HALFPELREFINE16_BITS | XVID_ME_EXTSEARCH_BITS)) { /* 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 */ |
2389 |
for(i = 0; i < 5; i++) bsad[i] = Data->iMinSAD[i]; |
for(i = 0; i < 5; i++) bsad[i] = Data->iMinSAD[i]; |
2390 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2391 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
2392 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
2393 |
if (Data->currentQMV->x & 1 || Data->currentQMV->y & 1) |
if (Data->currentQMV->x & 1 || Data->currentQMV->y & 1) |
2394 |
CheckCandidateBits16(Data->currentMV[0].x, Data->currentMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
2395 |
} |
} |
2396 |
|
|
2397 |
} else { /* not qpel */ |
} else { /* not qpel */ |
2398 |
|
|
2399 |
CheckCandidateBits16(Data->currentMV[0].x, Data->currentMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
2400 |
} |
} |
2401 |
|
|
2402 |
if (MotionFlags&XVID_ME_EXTSEARCH_BITS) SquareSearch(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
if (MotionFlags&XVID_ME_EXTSEARCH_RD) |
2403 |
|
SquareSearch(Data->currentMV->x, Data->currentMV->y, Data, 255, CheckCandidateRD16); |
2404 |
|
|
2405 |
if (MotionFlags&XVID_ME_HALFPELREFINE16_BITS) SubpelRefine(Data); |
if (MotionFlags&XVID_ME_HALFPELREFINE16_RD) |
2406 |
|
SubpelRefine(Data, CheckCandidateRD16); |
2407 |
|
|
2408 |
if (Data->qpel) { |
if (Data->qpel) { |
2409 |
if (MotionFlags&(XVID_ME_EXTSEARCH_BITS | XVID_ME_HALFPELREFINE16_BITS)) { /* there was halfpel-precision search */ |
if (MotionFlags&(XVID_ME_EXTSEARCH_RD | XVID_ME_HALFPELREFINE16_RD)) { /* there was halfpel-precision search */ |
2410 |
for(i = 0; i < 5; i++) if (bsad[i] > Data->iMinSAD[i]) { |
for(i = 0; i < 5; i++) if (bsad[i] > Data->iMinSAD[i]) { |
2411 |
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; /* we have found a better match */ |
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; /* we have found a better match */ |
2412 |
Data->currentQMV[i].y = 2 * Data->currentMV[i].y; |
Data->currentQMV[i].y = 2 * Data->currentMV[i].y; |
2414 |
|
|
2415 |
/* preparing for qpel-precision search */ |
/* preparing for qpel-precision search */ |
2416 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2417 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2418 |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
2419 |
} |
} |
2420 |
if (MotionFlags&XVID_ME_QUARTERPELREFINE16_BITS) SubpelRefine(Data); |
if (MotionFlags&XVID_ME_QUARTERPELREFINE16_RD) |
2421 |
|
SubpelRefine(Data, CheckCandidateRD16); |
2422 |
} |
} |
2423 |
|
|
2424 |
if (MotionFlags&XVID_ME_CHECKPREDICTION_BITS) { /* let's check vector equal to prediction */ |
if (MotionFlags&XVID_ME_CHECKPREDICTION_RD) { /* let's check vector equal to prediction */ |
2425 |
VECTOR * v = Data->qpel ? Data->currentQMV : Data->currentMV; |
VECTOR * v = Data->qpel ? Data->currentQMV : Data->currentMV; |
2426 |
if (!(Data->predMV.x == v->x && Data->predMV.y == v->y)) |
if (!(Data->predMV.x == v->x && Data->predMV.y == v->y)) |
2427 |
CheckCandidateBits16(Data->predMV.x, Data->predMV.y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->predMV.x, Data->predMV.y, Data, 255); |
2428 |
} |
} |
2429 |
return Data->iMinSAD[0]; |
return Data->iMinSAD[0]; |
2430 |
} |
} |
2431 |
|
|
2432 |
static int |
static int |
2433 |
CountMBBitsInter4v(const SearchData * const Data, |
findRDinter4v(const SearchData * const Data, |
2434 |
MACROBLOCK * const pMB, const MACROBLOCK * const pMBs, |
MACROBLOCK * const pMB, const MACROBLOCK * const pMBs, |
2435 |
const int x, const int y, |
const int x, const int y, |
2436 |
const MBParam * const pParam, const uint32_t MotionFlags, |
const MBParam * const pParam, const uint32_t MotionFlags, |
2437 |
const VECTOR * const backup) |
const VECTOR * const backup) |
2438 |
{ |
{ |
2439 |
|
|
2440 |
int cbp = 0, bits = 0, t = 0, i, iDirection; |
int cbp = 0, bits = 0, t = 0, i; |
2441 |
SearchData Data2, *Data8 = &Data2; |
SearchData Data2, *Data8 = &Data2; |
2442 |
int sumx = 0, sumy = 0; |
int sumx = 0, sumy = 0; |
2443 |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
2444 |
uint8_t * ptr; |
uint8_t * ptr; |
2445 |
|
|
2446 |
memcpy(Data8, Data, sizeof(SearchData)); |
memcpy(Data8, Data, sizeof(SearchData)); |
|
CheckCandidate = CheckCandidateBits8; |
|
2447 |
|
|
2448 |
for (i = 0; i < 4; i++) { /* for all luma blocks */ |
for (i = 0; i < 4; i++) { /* for all luma blocks */ |
2449 |
|
|
2456 |
Data8->RefP[1] = Data->RefP[1] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->RefP[1] = Data->RefP[1] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2457 |
Data8->RefP[3] = Data->RefP[3] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->RefP[3] = Data->RefP[3] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2458 |
*Data8->cbp = (Data->cbp[1] & (1<<(5-i))) ? 1:0; // copy corresponding cbp bit |
*Data8->cbp = (Data->cbp[1] & (1<<(5-i))) ? 1:0; // copy corresponding cbp bit |
|
// *Data8->cbp = 1; |
|
2459 |
|
|
2460 |
if(Data->qpel) { |
if(Data->qpel) { |
2461 |
Data8->predMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, i); |
Data8->predMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, i); |
2467 |
Data8->predMV, Data8->iFcode, 0, 0); |
Data8->predMV, Data8->iFcode, 0, 0); |
2468 |
} |
} |
2469 |
|
|
2470 |
get_range(&Data8->min_dx, &Data8->max_dx, &Data8->min_dy, &Data8->max_dy, 2*x + (i&1), 2*y + (i>>1), 8, |
get_range(&Data8->min_dx, &Data8->max_dx, &Data8->min_dy, &Data8->max_dy, 2*x + (i&1), 2*y + (i>>1), 3, |
2471 |
pParam->width, pParam->height, Data8->iFcode, Data8->qpel, 0); |
pParam->width, pParam->height, Data8->iFcode, Data8->qpel+1, 0); |
2472 |
|
|
2473 |
*Data8->iMinSAD += BITS_MULT*t; |
*Data8->iMinSAD += BITS_MULT*t; |
2474 |
|
|
2477 |
{ |
{ |
2478 |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
2479 |
if (!MVequal (*v, backup[i+1]) ) |
if (!MVequal (*v, backup[i+1]) ) |
2480 |
CheckCandidateBits8(backup[i+1].x, backup[i+1].y, 255, &iDirection, Data8); |
CheckCandidateRD8(backup[i+1].x, backup[i+1].y, Data8, 255); |
2481 |
} |
} |
2482 |
|
|
2483 |
if (Data8->qpel) { |
if (Data8->qpel) { |
2484 |
if (MotionFlags&XVID_ME_HALFPELREFINE8_BITS || (MotionFlags&XVID_ME_EXTSEARCH8 && MotionFlags&XVID_ME_EXTSEARCH_BITS)) { /* halfpixel motion search follows */ |
if (MotionFlags&XVID_ME_HALFPELREFINE8_RD || (MotionFlags&XVID_ME_EXTSEARCH8 && MotionFlags&XVID_ME_EXTSEARCH_RD)) { /* halfpixel motion search follows */ |
2485 |
int32_t s = *Data8->iMinSAD; |
int32_t s = *Data8->iMinSAD; |
2486 |
Data8->currentMV->x = Data8->currentQMV->x/2; |
Data8->currentMV->x = Data8->currentQMV->x/2; |
2487 |
Data8->currentMV->y = Data8->currentQMV->y/2; |
Data8->currentMV->y = Data8->currentQMV->y/2; |
2488 |
Data8->qpel_precision = 0; |
Data8->qpel_precision = 0; |
2489 |
get_range(&Data8->min_dx, &Data8->max_dx, &Data8->min_dy, &Data8->max_dy, 2*x + (i&1), 2*y + (i>>1), 8, |
get_range(&Data8->min_dx, &Data8->max_dx, &Data8->min_dy, &Data8->max_dy, 2*x + (i&1), 2*y + (i>>1), 3, |
2490 |
pParam->width, pParam->height, Data8->iFcode - 1, 0, 0); |
pParam->width, pParam->height, Data8->iFcode - 1, 1, 0); |
2491 |
|
|
2492 |
if (Data8->currentQMV->x & 1 || Data8->currentQMV->y & 1) |
if (Data8->currentQMV->x & 1 || Data8->currentQMV->y & 1) |
2493 |
CheckCandidateBits8(Data8->currentMV->x, Data8->currentMV->y, 255, &iDirection, Data8); |
CheckCandidateRD8(Data8->currentMV->x, Data8->currentMV->y, Data8, 255); |
2494 |
|
|
2495 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_BITS) |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) |
2496 |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255); |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255, CheckCandidateRD8); |
2497 |
|
|
2498 |
if (MotionFlags & XVID_ME_HALFPELREFINE8_BITS) |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
2499 |
SubpelRefine(Data8); |
SubpelRefine(Data8, CheckCandidateRD8); |
2500 |
|
|
2501 |
if(s > *Data8->iMinSAD) { /* we have found a better match */ |
if(s > *Data8->iMinSAD) { /* we have found a better match */ |
2502 |
Data8->currentQMV->x = 2*Data8->currentMV->x; |
Data8->currentQMV->x = 2*Data8->currentMV->x; |
2504 |
} |
} |
2505 |
|
|
2506 |
Data8->qpel_precision = 1; |
Data8->qpel_precision = 1; |
2507 |
get_range(&Data8->min_dx, &Data8->max_dx, &Data8->min_dy, &Data8->max_dy, 2*x + (i&1), 2*y + (i>>1), 8, |
get_range(&Data8->min_dx, &Data8->max_dx, &Data8->min_dy, &Data8->max_dy, 2*x + (i&1), 2*y + (i>>1), 3, |
2508 |
pParam->width, pParam->height, Data8->iFcode, 1, 0); |
pParam->width, pParam->height, Data8->iFcode, 2, 0); |
2509 |
|
|
2510 |
} |
} |
2511 |
if (MotionFlags & XVID_ME_QUARTERPELREFINE8_BITS) SubpelRefine(Data8); |
if (MotionFlags & XVID_ME_QUARTERPELREFINE8_RD) |
2512 |
|
SubpelRefine(Data8, CheckCandidateRD8); |
2513 |
|
|
2514 |
} else { /* not qpel */ |
} else { /* not qpel */ |
2515 |
|
|
2516 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_BITS) /* extsearch */ |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) /* extsearch */ |
2517 |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255); |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255, CheckCandidateRD8); |
2518 |
|
|
2519 |
if (MotionFlags & XVID_ME_HALFPELREFINE8_BITS) |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
2520 |
SubpelRefine(Data8); /* halfpel refinement */ |
SubpelRefine(Data8, CheckCandidateRD8); /* halfpel refinement */ |
2521 |
} |
} |
2522 |
|
|
2523 |
/* checking vector equal to predicion */ |
/* checking vector equal to predicion */ |
2524 |
if (i != 0 && MotionFlags & XVID_ME_CHECKPREDICTION_BITS) { |
if (i != 0 && MotionFlags & XVID_ME_CHECKPREDICTION_RD) { |
2525 |
const VECTOR * v = Data->qpel ? Data8->currentQMV : Data8->currentMV; |
const VECTOR * v = Data->qpel ? Data8->currentQMV : Data8->currentMV; |
2526 |
if (!MVequal(*v, Data8->predMV)) |
if (!MVequal(*v, Data8->predMV)) |
2527 |
CheckCandidateBits8(Data8->predMV.x, Data8->predMV.y, 255, &iDirection, Data8); |
CheckCandidateRD8(Data8->predMV.x, Data8->predMV.y, Data8, 255); |
2528 |
} |
} |
2529 |
|
|
2530 |
bits += *Data8->iMinSAD; |
bits += *Data8->iMinSAD; |
2574 |
} |
} |
2575 |
|
|
2576 |
static int |
static int |
2577 |
CountMBBitsIntra(const SearchData * const Data) |
findRDintra(const SearchData * const Data) |
2578 |
{ |
{ |
2579 |
int bits = BITS_MULT*1; /* this one is ac/dc prediction flag bit */ |
int bits = BITS_MULT*1; /* this one is ac/dc prediction flag bit */ |
2580 |
int cbp = 0, i, dc = 0; |
int cbp = 0, i, dc = 0; |
2606 |
} |
} |
2607 |
|
|
2608 |
static int |
static int |
2609 |
CountMBBitsGMC(const SearchData * const Data, const IMAGE * const vGMC, const int x, const int y) |
findRDgmc(const SearchData * const Data, const IMAGE * const vGMC, const int x, const int y) |
2610 |
{ |
{ |
2611 |
int bits = BITS_MULT*1; /* this one is mcsel */ |
int bits = BITS_MULT*1; /* this one is mcsel */ |
2612 |
int cbp = 0, i; |
int cbp = 0, i; |
2661 |
|
|
2662 |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
2663 |
|
|
2664 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2665 |
pParam->width, pParam->height, 16, 0, 0); |
pParam->width, pParam->height, 16, 1, 0); |
2666 |
|
|
2667 |
Data->Cur = pCur + 16*(x + y * pParam->edged_width); |
Data->Cur = pCur + 16*(x + y * pParam->edged_width); |
2668 |
Data->RefP[0] = pRef + 16*(x + y * pParam->edged_width); |
Data->RefP[0] = pRef + 16*(x + y * pParam->edged_width); |
2671 |
Data->RefP[3] = pRefHV + 16*(x + y * pParam->edged_width); |
Data->RefP[3] = pRefHV + 16*(x + y * pParam->edged_width); |
2672 |
|
|
2673 |
Data->currentMV[0].x = Data->currentMV[0].y = 0; |
Data->currentMV[0].x = Data->currentMV[0].y = 0; |
2674 |
CheckCandidate16I(0, 0, 255, &i, Data); |
CheckCandidate16I(0, 0, Data, 255); |
2675 |
|
|
2676 |
if ( (Data->predMV.x !=0) || (Data->predMV.y != 0) ) |
if ( (Data->predMV.x !=0) || (Data->predMV.y != 0) ) |
2677 |
CheckCandidate16I(Data->predMV.x, Data->predMV.y, 255, &i, Data); |
CheckCandidate16I(Data->predMV.x, Data->predMV.y, Data, 255); |
2678 |
|
|
2679 |
AdvDiamondSearch(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
DiamondSearch(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255, CheckCandidate16I); |
2680 |
|
|
2681 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16I); |
2682 |
|
|
2683 |
|
|
2684 |
/* for QPel halfpel positions are worse than in halfpel mode :( */ |
/* for QPel halfpel positions are worse than in halfpel mode :( */ |
2686 |
Data->currentQMV->x = 2*Data->currentMV->x; |
Data->currentQMV->x = 2*Data->currentMV->x; |
2687 |
Data->currentQMV->y = 2*Data->currentMV->y; |
Data->currentQMV->y = 2*Data->currentMV->y; |
2688 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2689 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2690 |
pParam->width, pParam->height, iFcode, 1, 0); |
pParam->width, pParam->height, iFcode, 2, 0); |
2691 |
SubpelRefine(Data); |
SubpelRefine(Data); |
2692 |
} |
} |
2693 |
*/ |
*/ |
2714 |
|
|
2715 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
2716 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
2717 |
|
uint32_t dir; |
2718 |
SearchData Data; |
SearchData Data; |
2719 |
memset(&Data, 0, sizeof(SearchData)); |
memset(&Data, 0, sizeof(SearchData)); |
2720 |
|
|
2725 |
Data.iMinSAD = &iMinSAD[0]; |
Data.iMinSAD = &iMinSAD[0]; |
2726 |
Data.iFcode = current->fcode; |
Data.iFcode = current->fcode; |
2727 |
Data.temp = temp; |
Data.temp = temp; |
2728 |
|
Data.dir = &dir; |
|
CheckCandidate = CheckCandidate16I; |
|
2729 |
|
|
2730 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
2731 |
|
|
2732 |
for (y = 0; y < pParam->mb_height; y ++) { |
for (y = 0; y < pParam->mb_height; y ++) { |
2733 |
for (x = 0; x < pParam->mb_width; x ++) { |
for (x = 0; x < pParam->mb_width; x ++) { |
|
|
|
2734 |
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); |
2735 |
} |
} |
2736 |
} |
} |
2912 |
*/ |
*/ |
2913 |
gmc.duv[0].x= gmc.duv[0].y= gmc.duv[1].x= gmc.duv[1].y= gmc.duv[2].x= gmc.duv[2].y=0; |
gmc.duv[0].x= gmc.duv[0].y= gmc.duv[1].x= gmc.duv[1].y= gmc.duv[2].x= gmc.duv[2].y=0; |
2914 |
|
|
2915 |
if (!(current->motion_flags & XVID_GME_REFINE)) |
if (!(current->motion_flags & XVID_ME_GME_REFINE)) |
2916 |
return gmc; |
return gmc; |
2917 |
|
|
2918 |
for (my = 1; my < (uint32_t)MBh-1; my++) /* ignore boundary blocks */ |
for (my = 1; my < (uint32_t)MBh-1; my++) /* ignore boundary blocks */ |