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.24 2003-08-02 15:08:39 edgomez Exp $ |
* $Id: motion_est.c,v 1.58.2.35 2003-09-06 11:24:50 Isibaar 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) |
CheckCandidate16_subpel(const int x, const int y, const SearchData * const data, const int Direction) |
351 |
|
{ |
352 |
|
int xc, yc; |
353 |
|
const uint8_t *Reference; |
354 |
|
VECTOR *current, *current2; |
355 |
|
int32_t sad; uint32_t t; |
356 |
|
|
357 |
|
if ( (x > data->max_dx) || (x < data->min_dx) |
358 |
|
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
359 |
|
|
360 |
|
if (!data->qpel_precision) { |
361 |
|
Reference = GetReference(x, y, data); |
362 |
|
current = data->currentMV; |
363 |
|
current2 = data->currentMV2; |
364 |
|
xc = x; yc = y; |
365 |
|
} else { /* x and y are in 1/4 precision */ |
366 |
|
Reference = Interpolate16x16qpel(x, y, 0, data); |
367 |
|
xc = x/2; yc = y/2; /* for chroma sad */ |
368 |
|
current = data->currentQMV; |
369 |
|
current2 = data->currentQMV2; |
370 |
|
} |
371 |
|
|
372 |
|
sad = sad16v(data->Cur, Reference, data->iEdgedWidth, data->temp); |
373 |
|
t = d_mv_bits(x, y, data->predMV, data->iFcode, data->qpel^data->qpel_precision, 0); |
374 |
|
|
375 |
|
sad += (data->lambda16 * t * sad)>>10; |
376 |
|
data->temp[0] += (data->lambda8 * t * (data->temp[0] + NEIGH_8X8_BIAS))>>10; |
377 |
|
|
378 |
|
if (data->chroma && sad < data->iMinSAD[0]) |
379 |
|
sad += ChromaSAD((xc >> 1) + roundtab_79[xc & 0x3], |
380 |
|
(yc >> 1) + roundtab_79[yc & 0x3], data); |
381 |
|
|
382 |
|
if (data->temp[0] < data->iMinSAD[1]) { |
383 |
|
data->iMinSAD[1] = data->temp[0]; current[1].x = x; current[1].y = y; } |
384 |
|
if (data->temp[1] < data->iMinSAD[2]) { |
385 |
|
data->iMinSAD[2] = data->temp[1]; current[2].x = x; current[2].y = y; } |
386 |
|
if (data->temp[2] < data->iMinSAD[3]) { |
387 |
|
data->iMinSAD[3] = data->temp[2]; current[3].x = x; current[3].y = y; } |
388 |
|
if (data->temp[3] < data->iMinSAD[4]) { |
389 |
|
data->iMinSAD[4] = data->temp[3]; current[4].x = x; current[4].y = y; } |
390 |
|
|
391 |
|
if (sad < data->iMinSAD[0]) { |
392 |
|
*(data->iMinSAD2) = *(data->iMinSAD); |
393 |
|
current2->x = current->x; current2->y = current->y; |
394 |
|
|
395 |
|
data->iMinSAD[0] = sad; |
396 |
|
current[0].x = x; current[0].y = y; |
397 |
|
*data->dir = Direction; |
398 |
|
return; |
399 |
|
} |
400 |
|
|
401 |
|
if (sad < *(data->iMinSAD2)) { |
402 |
|
*(data->iMinSAD2) = sad; |
403 |
|
current2->x = x; current2->y = y; |
404 |
|
*data->dir = Direction; |
405 |
|
} |
406 |
|
} |
407 |
|
|
408 |
|
static void |
409 |
|
CheckCandidate8(const int x, const int y, const SearchData * const data, const int Direction) |
410 |
{ |
{ |
411 |
int32_t sad; uint32_t t; |
int32_t sad; uint32_t t; |
412 |
const uint8_t * Reference; |
const uint8_t * Reference; |
431 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
432 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
433 |
current->x = x; current->y = y; |
current->x = x; current->y = y; |
434 |
*dir = Direction; |
*data->dir = Direction; |
435 |
} |
} |
436 |
} |
} |
437 |
|
|
438 |
static void |
static void |
439 |
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) |
440 |
{ |
{ |
441 |
uint32_t t; |
uint32_t t; |
442 |
const uint8_t * Reference; |
const uint8_t * Reference; |
443 |
|
int sad; |
444 |
|
|
445 |
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 */ |
446 |
(x > data->max_dx) || (x < data->min_dx) |
(x > data->max_dx) || (x < data->min_dx) |
449 |
Reference = GetReference(x, y, data); |
Reference = GetReference(x, y, data); |
450 |
t = d_mv_bits(x, y, data->predMV, data->iFcode, 0, 1); |
t = d_mv_bits(x, y, data->predMV, data->iFcode, 0, 1); |
451 |
|
|
452 |
data->temp[0] = sad32v_c(data->Cur, Reference, data->iEdgedWidth, data->temp + 1); |
sad = sad32v_c(data->Cur, Reference, data->iEdgedWidth, data->temp); |
453 |
|
|
454 |
data->temp[0] += (data->lambda16 * t * data->temp[0]) >> 10; |
sad += (data->lambda16 * t * sad) >> 10; |
455 |
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; |
456 |
|
|
457 |
if (data->temp[0] < data->iMinSAD[0]) { |
if (sad < data->iMinSAD[0]) { |
458 |
data->iMinSAD[0] = data->temp[0]; |
data->iMinSAD[0] = sad; |
459 |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
460 |
*dir = Direction; } |
*data->dir = Direction; |
461 |
|
} |
462 |
|
|
463 |
if (data->temp[1] < data->iMinSAD[1]) { |
if (data->temp[0] < data->iMinSAD[1]) { |
464 |
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; } |
465 |
if (data->temp[2] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
466 |
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; } |
467 |
if (data->temp[3] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
468 |
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; } |
469 |
if (data->temp[4] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
470 |
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; } |
471 |
} |
} |
472 |
|
|
473 |
static void |
static void |
474 |
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) |
475 |
{ |
{ |
476 |
int32_t sad, xc, yc; |
int32_t sad, xc, yc; |
477 |
const uint8_t * Reference; |
const uint8_t * Reference; |
505 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
506 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
507 |
current->x = x; current->y = y; |
current->x = x; current->y = y; |
508 |
*dir = Direction; |
*data->dir = Direction; |
509 |
} |
} |
510 |
} |
} |
511 |
|
|
512 |
static void |
static void |
513 |
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) |
514 |
{ |
{ |
515 |
int sad; |
int sad; |
516 |
// int xc, yc; |
// int xc, yc; |
533 |
if (sad < data->iMinSAD[0]) { |
if (sad < data->iMinSAD[0]) { |
534 |
data->iMinSAD[0] = sad; |
data->iMinSAD[0] = sad; |
535 |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
536 |
*dir = Direction; |
*data->dir = Direction; |
537 |
} |
} |
538 |
} |
} |
539 |
|
|
540 |
static void |
static void |
541 |
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) |
542 |
{ |
{ |
543 |
/* maximum speed - for P/B/I decision */ |
/* maximum speed - for P/B/I decision */ |
544 |
int32_t sad; |
int32_t sad; |
546 |
if ( (x > data->max_dx) || (x < data->min_dx) |
if ( (x > data->max_dx) || (x < data->min_dx) |
547 |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
548 |
|
|
549 |
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), |
550 |
data->iEdgedWidth, data->temp+1); |
data->iEdgedWidth, data->temp); |
551 |
|
|
552 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
553 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
554 |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
data->currentMV[0].x = x; data->currentMV[0].y = y; |
555 |
*dir = Direction; |
*data->dir = Direction; |
556 |
} |
} |
557 |
if (data->temp[1] < data->iMinSAD[1]) { |
if (data->temp[0] < data->iMinSAD[1]) { |
558 |
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; } |
559 |
if (data->temp[2] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
560 |
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; } |
561 |
if (data->temp[3] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
562 |
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; } |
563 |
if (data->temp[4] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
564 |
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; } |
565 |
|
|
566 |
} |
} |
567 |
|
|
568 |
static void |
static void |
569 |
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) |
570 |
{ |
{ |
571 |
int32_t sad, xb, yb, xcf, ycf, xcb, ycb; |
int32_t sad, xb, yb, xcf, ycf, xcb, ycb; |
572 |
uint32_t t; |
uint32_t t; |
608 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
609 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
610 |
current->x = xf; current->y = yf; |
current->x = xf; current->y = yf; |
611 |
*dir = Direction; |
*data->dir = Direction; |
612 |
} |
} |
613 |
} |
} |
614 |
|
|
615 |
static void |
static void |
616 |
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) |
617 |
{ |
{ |
618 |
int32_t sad = 0, xcf = 0, ycf = 0, xcb = 0, ycb = 0; |
int32_t sad = 0, xcf = 0, ycf = 0, xcb = 0, ycb = 0; |
619 |
uint32_t k; |
uint32_t k; |
669 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
670 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
671 |
data->currentMV->x = x; data->currentMV->y = y; |
data->currentMV->x = x; data->currentMV->y = y; |
672 |
*dir = Direction; |
*data->dir = Direction; |
673 |
} |
} |
674 |
} |
} |
675 |
|
|
676 |
static void |
static void |
677 |
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) |
678 |
{ |
{ |
679 |
int32_t sad, xcf, ycf, xcb, ycb; |
int32_t sad, xcf, ycf, xcb, ycb; |
680 |
const uint8_t *ReferenceF; |
const uint8_t *ReferenceF; |
722 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
723 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
724 |
data->currentMV->x = x; data->currentMV->y = y; |
data->currentMV->x = x; data->currentMV->y = y; |
725 |
*dir = Direction; |
*data->dir = Direction; |
726 |
} |
} |
727 |
} |
} |
728 |
|
|
729 |
|
|
730 |
static void |
static void |
731 |
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) |
732 |
{ |
{ |
733 |
|
|
734 |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
735 |
int32_t bits = 0; |
int32_t rd = 0; |
736 |
VECTOR * current; |
VECTOR * current; |
737 |
const uint8_t * ptr; |
const uint8_t * ptr; |
738 |
int i, cbp = 0, t, xc, yc; |
int i, cbp = 0, t, xc, yc; |
753 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
754 |
int s = 8*((i&1) + (i>>1)*data->iEdgedWidth); |
int s = 8*((i&1) + (i>>1)*data->iEdgedWidth); |
755 |
transfer_8to16subro(in, data->Cur + s, ptr + s, data->iEdgedWidth); |
transfer_8to16subro(in, data->Cur + s, ptr + s, data->iEdgedWidth); |
756 |
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); |
757 |
} |
} |
758 |
|
|
759 |
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); |
760 |
|
|
761 |
if (data->temp[0] + t < data->iMinSAD[1]) { |
if (data->temp[0] + t < data->iMinSAD[1]) { |
762 |
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); } |
763 |
if (data->temp[1] < data->iMinSAD[2]) { |
if (data->temp[1] < data->iMinSAD[2]) { |
764 |
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); } |
765 |
if (data->temp[2] < data->iMinSAD[3]) { |
if (data->temp[2] < data->iMinSAD[3]) { |
766 |
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); } |
767 |
if (data->temp[3] < data->iMinSAD[4]) { |
if (data->temp[3] < data->iMinSAD[4]) { |
768 |
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); } |
769 |
|
|
770 |
bits += BITS_MULT*xvid_cbpy_tab[15-(cbp>>2)].len; |
rd += BITS_MULT*xvid_cbpy_tab[15-(cbp>>2)].len; |
771 |
|
|
772 |
if (bits >= data->iMinSAD[0]) return; |
if (rd >= data->iMinSAD[0]) return; |
773 |
|
|
774 |
/* chroma */ |
/* chroma */ |
775 |
xc = (xc >> 1) + roundtab_79[xc & 0x3]; |
xc = (xc >> 1) + roundtab_79[xc & 0x3]; |
778 |
/* chroma U */ |
/* chroma U */ |
779 |
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); |
780 |
transfer_8to16subro(in, data->CurU, ptr, data->iEdgedWidth/2); |
transfer_8to16subro(in, data->CurU, ptr, data->iEdgedWidth/2); |
781 |
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); |
782 |
if (bits >= data->iMinSAD[0]) return; |
if (rd >= data->iMinSAD[0]) return; |
783 |
|
|
784 |
/* chroma V */ |
/* chroma V */ |
785 |
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); |
786 |
transfer_8to16subro(in, data->CurV, ptr, data->iEdgedWidth/2); |
transfer_8to16subro(in, data->CurV, ptr, data->iEdgedWidth/2); |
787 |
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); |
788 |
|
|
789 |
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; |
790 |
|
|
791 |
if (bits < data->iMinSAD[0]) { |
if (rd < data->iMinSAD[0]) { |
792 |
data->iMinSAD[0] = bits; |
data->iMinSAD[0] = rd; |
793 |
current[0].x = x; current[0].y = y; |
current[0].x = x; current[0].y = y; |
794 |
*dir = Direction; |
*data->dir = Direction; |
795 |
*data->cbp = cbp; |
*data->cbp = cbp; |
796 |
} |
} |
797 |
} |
} |
798 |
|
|
799 |
static void |
static void |
800 |
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) |
801 |
{ |
{ |
802 |
|
|
803 |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
804 |
int32_t bits; |
int32_t rd; |
805 |
VECTOR * current; |
VECTOR * current; |
806 |
const uint8_t * ptr; |
const uint8_t * ptr; |
807 |
int cbp = 0; |
int cbp = 0; |
818 |
} |
} |
819 |
|
|
820 |
transfer_8to16subro(in, data->Cur, ptr, data->iEdgedWidth); |
transfer_8to16subro(in, data->Cur, ptr, data->iEdgedWidth); |
821 |
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); |
822 |
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); |
823 |
|
|
824 |
if (bits < data->iMinSAD[0]) { |
if (rd < data->iMinSAD[0]) { |
825 |
*data->cbp = cbp; |
*data->cbp = cbp; |
826 |
data->iMinSAD[0] = bits; |
data->iMinSAD[0] = rd; |
827 |
current[0].x = x; current[0].y = y; |
current[0].x = x; current[0].y = y; |
828 |
*dir = Direction; |
*data->dir = Direction; |
829 |
} |
} |
830 |
} |
} |
831 |
|
|
834 |
/* MAINSEARCH FUNCTIONS START */ |
/* MAINSEARCH FUNCTIONS START */ |
835 |
|
|
836 |
static void |
static void |
837 |
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) |
838 |
{ |
{ |
839 |
|
|
840 |
/* 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) */ |
841 |
|
|
842 |
int iDirection; |
unsigned int * const iDirection = data->dir; |
843 |
|
|
844 |
for(;;) { /* forever */ |
for(;;) { /* forever */ |
845 |
iDirection = 0; |
*iDirection = 0; |
846 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
847 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
848 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
850 |
|
|
851 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
852 |
|
|
853 |
if (iDirection) { /* if anything found */ |
if (*iDirection) { /* if anything found */ |
854 |
bDirection = iDirection; |
bDirection = *iDirection; |
855 |
iDirection = 0; |
*iDirection = 0; |
856 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
857 |
if (bDirection & 3) { /* our candidate is left or right */ |
if (bDirection & 3) { /* our candidate is left or right */ |
858 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
862 |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
863 |
} |
} |
864 |
|
|
865 |
if (iDirection) { |
if (*iDirection) { |
866 |
bDirection += iDirection; |
bDirection += *iDirection; |
867 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
868 |
} |
} |
869 |
} else { /* about to quit, eh? not so fast.... */ |
} else { /* about to quit, eh? not so fast.... */ |
911 |
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
CHECK_CANDIDATE(x + iDiamondSize, y + iDiamondSize, 2 + 8); |
912 |
break; |
break; |
913 |
} |
} |
914 |
if (!iDirection) break; /* ok, the end. really */ |
if (!*iDirection) break; /* ok, the end. really */ |
915 |
bDirection = iDirection; |
bDirection = *iDirection; |
916 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
917 |
} |
} |
918 |
} |
} |
919 |
} |
} |
920 |
|
|
921 |
static void |
static void |
922 |
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) |
923 |
{ |
{ |
924 |
int iDirection; |
unsigned int * const iDirection = data->dir; |
925 |
|
|
926 |
do { |
do { |
927 |
iDirection = 0; |
*iDirection = 0; |
928 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1+16+64); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1+16+64); |
929 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2+32+128); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2+32+128); |
930 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4+16+32); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4+16+32); |
934 |
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); |
935 |
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); |
936 |
|
|
937 |
bDirection = iDirection; |
bDirection = *iDirection; |
938 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
939 |
} while (iDirection); |
} while (*iDirection); |
940 |
} |
} |
941 |
|
|
942 |
static void |
static void |
943 |
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) |
944 |
{ |
{ |
945 |
|
|
946 |
/* 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) */ |
947 |
|
|
948 |
int iDirection; |
unsigned int * const iDirection = data->dir; |
949 |
|
|
950 |
do { |
do { |
951 |
iDirection = 0; |
*iDirection = 0; |
952 |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
if (bDirection & 1) CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
953 |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
if (bDirection & 2) CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
954 |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
if (bDirection & 4) CHECK_CANDIDATE(x, y - iDiamondSize, 4); |
956 |
|
|
957 |
/* now we're doing diagonal checks near our candidate */ |
/* now we're doing diagonal checks near our candidate */ |
958 |
|
|
959 |
if (iDirection) { /* checking if anything found */ |
if (*iDirection) { /* checking if anything found */ |
960 |
bDirection = iDirection; |
bDirection = *iDirection; |
961 |
iDirection = 0; |
*iDirection = 0; |
962 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
963 |
if (bDirection & 3) { /* our candidate is left or right */ |
if (bDirection & 3) { /* our candidate is left or right */ |
964 |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
CHECK_CANDIDATE(x, y + iDiamondSize, 8); |
967 |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
CHECK_CANDIDATE(x + iDiamondSize, y, 2); |
968 |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
CHECK_CANDIDATE(x - iDiamondSize, y, 1); |
969 |
} |
} |
970 |
bDirection += iDirection; |
bDirection += *iDirection; |
971 |
x = data->currentMV->x; y = data->currentMV->y; |
x = data->currentMV->x; y = data->currentMV->y; |
972 |
} |
} |
973 |
} |
} |
974 |
while (iDirection); |
while (*iDirection); |
975 |
} |
} |
976 |
|
|
977 |
/* MAINSEARCH FUNCTIONS END */ |
/* MAINSEARCH FUNCTIONS END */ |
978 |
|
|
979 |
static void |
static void |
980 |
SubpelRefine(const SearchData * const data) |
SubpelRefine_Fast(SearchData * data, CheckFunc * CheckCandidate) |
981 |
|
{ |
982 |
|
/* Do a half-pel or q-pel refinement */ |
983 |
|
VECTOR centerMV; |
984 |
|
VECTOR second_best; |
985 |
|
int best_sad = *data->iMinSAD; |
986 |
|
int xo, yo, xo2, yo2; |
987 |
|
int size = 2; |
988 |
|
CheckFunc *backupFunc = CheckCandidate; |
989 |
|
|
990 |
|
if(data->qpel_precision) |
991 |
|
size = 1; |
992 |
|
|
993 |
|
centerMV = *data->currentMV; |
994 |
|
*data->iMinSAD = 256 * 4096; |
995 |
|
|
996 |
|
CHECK_CANDIDATE(centerMV.x, centerMV.y - size, 0); |
997 |
|
CHECK_CANDIDATE(centerMV.x + size, centerMV.y - size, 0); |
998 |
|
CHECK_CANDIDATE(centerMV.x + size, centerMV.y, 0); |
999 |
|
CHECK_CANDIDATE(centerMV.x + size, centerMV.y + size, 0); |
1000 |
|
|
1001 |
|
CHECK_CANDIDATE(centerMV.x, centerMV.y + size, 0); |
1002 |
|
CHECK_CANDIDATE(centerMV.x - size, centerMV.y + size, 0); |
1003 |
|
CHECK_CANDIDATE(centerMV.x - size, centerMV.y, 0); |
1004 |
|
CHECK_CANDIDATE(centerMV.x - size, centerMV.y - size, 0); |
1005 |
|
|
1006 |
|
second_best = *data->currentMV; |
1007 |
|
|
1008 |
|
if(data->qpel_precision) { |
1009 |
|
second_best.x *= 2; second_best.y *= 2; |
1010 |
|
} |
1011 |
|
|
1012 |
|
data->currentMV[0] = centerMV; |
1013 |
|
*data->iMinSAD = best_sad; |
1014 |
|
|
1015 |
|
centerMV = data->qpel_precision ? *data->currentQMV : *data->currentMV; |
1016 |
|
|
1017 |
|
xo = centerMV.x; |
1018 |
|
yo = centerMV.y; |
1019 |
|
xo2 = second_best.x; |
1020 |
|
yo2 = second_best.y; |
1021 |
|
|
1022 |
|
CheckCandidate = CheckCandidate16_subpel; |
1023 |
|
*data->iMinSAD2 = 256 * 4096; |
1024 |
|
|
1025 |
|
if (yo == yo2) |
1026 |
|
{ |
1027 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo, 0); |
1028 |
|
CHECK_CANDIDATE(xo, yo-1, 0); |
1029 |
|
CHECK_CANDIDATE(xo, yo+1, 0); |
1030 |
|
|
1031 |
|
if(best_sad <= *data->iMinSAD2) |
1032 |
|
goto ende; |
1033 |
|
|
1034 |
|
if(data->currentQMV[0].x == data->currentQMV2[0].x) { |
1035 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo-1, 0); |
1036 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo+1, 0); |
1037 |
|
goto ende; |
1038 |
|
} |
1039 |
|
else { |
1040 |
|
CHECK_CANDIDATE((xo+xo2)>>1, |
1041 |
|
(data->currentQMV[0].x == xo) ? data->currentQMV[0].y : data->currentQMV2[0].y, |
1042 |
|
0); |
1043 |
|
goto ende; |
1044 |
|
} |
1045 |
|
} |
1046 |
|
|
1047 |
|
if (xo == xo2) |
1048 |
|
{ |
1049 |
|
CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0); |
1050 |
|
CHECK_CANDIDATE(xo-1, yo, 0); |
1051 |
|
CHECK_CANDIDATE(xo+1, yo, 0); |
1052 |
|
|
1053 |
|
if(best_sad < *data->iMinSAD2) |
1054 |
|
goto ende; |
1055 |
|
|
1056 |
|
if(data->currentQMV[0].y == data->currentQMV2[0].y) { |
1057 |
|
CHECK_CANDIDATE(xo-1, (yo+yo2)>>1, 0); |
1058 |
|
CHECK_CANDIDATE(xo+1, (yo+yo2)>>1, 0); |
1059 |
|
goto ende; |
1060 |
|
} |
1061 |
|
else { |
1062 |
|
CHECK_CANDIDATE((data->currentQMV[0].y == yo) ? data->currentQMV[0].x : data->currentQMV2[0].x, (yo+yo2)>>1, 0); |
1063 |
|
goto ende; |
1064 |
|
} |
1065 |
|
} |
1066 |
|
|
1067 |
|
CHECK_CANDIDATE(xo, (yo+yo2)>>1, 0); |
1068 |
|
CHECK_CANDIDATE((xo+xo2)>>1, yo, 0); |
1069 |
|
|
1070 |
|
if(best_sad <= *data->iMinSAD2) |
1071 |
|
goto ende; |
1072 |
|
|
1073 |
|
CHECK_CANDIDATE((xo+xo2)>>1, (yo+yo2)>>1, 0); |
1074 |
|
|
1075 |
|
ende: |
1076 |
|
CheckCandidate = backupFunc; |
1077 |
|
} |
1078 |
|
|
1079 |
|
static void |
1080 |
|
SubpelRefine(const SearchData * const data, CheckFunc * const CheckCandidate) |
1081 |
{ |
{ |
1082 |
/* Do a half-pel or q-pel refinement */ |
/* Do a half-pel or q-pel refinement */ |
1083 |
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 */ |
|
1084 |
|
|
1085 |
CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0); |
CHECK_CANDIDATE(centerMV.x, centerMV.y - 1, 0); |
1086 |
CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0); |
CHECK_CANDIDATE(centerMV.x + 1, centerMV.y - 1, 0); |
1120 |
} |
} |
1121 |
|
|
1122 |
static __inline void |
static __inline void |
1123 |
SkipMacroblockP(MACROBLOCK *pMB, const int32_t sad) |
ZeroMacroblockP(MACROBLOCK *pMB, const int32_t sad) |
1124 |
{ |
{ |
1125 |
pMB->mode = MODE_NOT_CODED; |
pMB->mode = MODE_INTER; |
1126 |
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; |
1127 |
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; |
1128 |
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; |
1129 |
} |
} |
1130 |
|
|
1131 |
static __inline void |
static __inline void |
1132 |
ZeroMacroblockP(MACROBLOCK *pMB, const int32_t sad) |
ModeDecision_Fast(SearchData * const Data, |
1133 |
|
MACROBLOCK * const pMB, |
1134 |
|
const MACROBLOCK * const pMBs, |
1135 |
|
const int x, const int y, |
1136 |
|
const MBParam * const pParam, |
1137 |
|
const uint32_t MotionFlags, |
1138 |
|
const uint32_t VopFlags, |
1139 |
|
const uint32_t VolFlags, |
1140 |
|
const IMAGE * const pCurrent, |
1141 |
|
const IMAGE * const pRef, |
1142 |
|
const IMAGE * const vGMC, |
1143 |
|
const int coding_type) |
1144 |
{ |
{ |
1145 |
pMB->mode = MODE_INTER; |
int mode = MODE_INTER; |
1146 |
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = zeroMV; |
int mcsel = 0; |
1147 |
pMB->qmvs[0] = pMB->qmvs[1] = pMB->qmvs[2] = pMB->qmvs[3] = zeroMV; |
int inter4v = (VopFlags & XVID_VOP_INTER4V) && (pMB->dquant == 0); |
1148 |
|
const uint32_t iQuant = pMB->quant; |
1149 |
|
const int skip_possible = (coding_type == P_VOP) && (pMB->dquant == 0); |
1150 |
|
int sad; |
1151 |
|
int min_rd = -1, intra_rd, i, cbp, c[2] = {0, 0}; |
1152 |
|
VECTOR backup[5], *v; |
1153 |
|
int sad_backup[5]; |
1154 |
|
int InterBias = MV16_INTER_BIAS; |
1155 |
|
int thresh = 0; |
1156 |
|
int count = 0; |
1157 |
|
int top = 0, top_right = 0, left = 0; |
1158 |
|
|
1159 |
|
pMB->mcsel = 0; |
1160 |
|
|
1161 |
|
/* INTER <-> INTER4V decision */ |
1162 |
|
if ((Data->iMinSAD[0] + 75 < Data->iMinSAD[1] + |
1163 |
|
Data->iMinSAD[2] + Data->iMinSAD[3] + Data->iMinSAD[4])) { /* normal, fast, SAD-based mode decision */ |
1164 |
|
if (inter4v == 0 || Data->iMinSAD[0] < Data->iMinSAD[1] + Data->iMinSAD[2] + |
1165 |
|
Data->iMinSAD[3] + Data->iMinSAD[4] + IMV16X16 * (int32_t)iQuant) { |
1166 |
|
mode = MODE_INTER; |
1167 |
|
sad = Data->iMinSAD[0]; |
1168 |
|
} else { |
1169 |
|
mode = MODE_INTER4V; |
1170 |
|
sad = Data->iMinSAD[1] + Data->iMinSAD[2] + |
1171 |
|
Data->iMinSAD[3] + Data->iMinSAD[4] + IMV16X16 * (int32_t)iQuant; |
1172 |
|
Data->iMinSAD[0] = sad; |
1173 |
|
} |
1174 |
|
|
1175 |
|
/* final skip decision, a.k.a. "the vector you found, really that good?" */ |
1176 |
|
if (skip_possible && (pMB->sad16 < (int)iQuant * MAX_SAD00_FOR_SKIP)) |
1177 |
|
if ( (100*sad)/(pMB->sad16+1) > FINAL_SKIP_THRESH) |
1178 |
|
if (Data->chroma || SkipDecisionP(pCurrent, pRef, x, y, Data->iEdgedWidth/2, iQuant, Data->rrv)) { |
1179 |
|
mode = MODE_NOT_CODED; |
1180 |
|
goto early_out; |
1181 |
|
} |
1182 |
|
|
1183 |
|
/* mcsel */ |
1184 |
|
if (coding_type == S_VOP) { |
1185 |
|
|
1186 |
|
int32_t iSAD = sad16(Data->Cur, |
1187 |
|
vGMC->y + 16*y*Data->iEdgedWidth + 16*x, Data->iEdgedWidth, 65536); |
1188 |
|
|
1189 |
|
if (Data->chroma) { |
1190 |
|
iSAD += sad8(Data->CurU, vGMC->u + 8*y*(Data->iEdgedWidth/2) + 8*x, Data->iEdgedWidth/2); |
1191 |
|
iSAD += sad8(Data->CurV, vGMC->v + 8*y*(Data->iEdgedWidth/2) + 8*x, Data->iEdgedWidth/2); |
1192 |
|
} |
1193 |
|
|
1194 |
|
if (iSAD <= sad) { /* mode decision GMC */ |
1195 |
|
mode = MODE_INTER; |
1196 |
|
mcsel = 1; |
1197 |
|
sad = iSAD; |
1198 |
|
} |
1199 |
|
|
1200 |
|
} |
1201 |
|
} else { /* Rate-Distortion INTER<->INTER4V */ |
1202 |
|
Data->iQuant = iQuant; |
1203 |
|
Data->cbp = c; |
1204 |
|
v = Data->qpel ? Data->currentQMV : Data->currentMV; |
1205 |
|
|
1206 |
|
/* final skip decision, a.k.a. "the vector you found, really that good?" */ |
1207 |
|
if (skip_possible && (pMB->sad16 < (int)iQuant * MAX_SAD00_FOR_SKIP)) |
1208 |
|
if ( (100*Data->iMinSAD[0])/(pMB->sad16+1) > FINAL_SKIP_THRESH) |
1209 |
|
if (Data->chroma || SkipDecisionP(pCurrent, pRef, x, y, Data->iEdgedWidth/2, iQuant, Data->rrv)) { |
1210 |
|
mode = MODE_NOT_CODED; |
1211 |
|
goto early_out; |
1212 |
|
} |
1213 |
|
|
1214 |
|
for (i = 0; i < 5; i++) { |
1215 |
|
sad_backup[i] = Data->iMinSAD[i]; |
1216 |
|
Data->iMinSAD[i] = 256*4096; |
1217 |
|
backup[i] = v[i]; |
1218 |
|
} |
1219 |
|
|
1220 |
|
min_rd = findRDinter(Data, pMBs, x, y, pParam, MotionFlags); |
1221 |
|
cbp = *Data->cbp; |
1222 |
|
sad = sad_backup[0]; |
1223 |
|
|
1224 |
|
if (coding_type == S_VOP) { |
1225 |
|
int gmc_rd; |
1226 |
|
int32_t iSAD = sad16(Data->Cur, |
1227 |
|
vGMC->y + 16*y*Data->iEdgedWidth + 16*x, Data->iEdgedWidth, 65536); |
1228 |
|
|
1229 |
|
if (Data->chroma) { |
1230 |
|
iSAD += sad8(Data->CurU, vGMC->u + 8*y*(Data->iEdgedWidth/2) + 8*x, Data->iEdgedWidth/2); |
1231 |
|
iSAD += sad8(Data->CurV, vGMC->v + 8*y*(Data->iEdgedWidth/2) + 8*x, Data->iEdgedWidth/2); |
1232 |
|
} |
1233 |
|
|
1234 |
|
*Data->iMinSAD = min_rd += BITS_MULT*1; /* mcsel */ |
1235 |
|
gmc_rd = findRDgmc(Data, vGMC, x, y); |
1236 |
|
if (gmc_rd < min_rd) { |
1237 |
|
mcsel = 1; |
1238 |
|
*Data->iMinSAD = min_rd = gmc_rd; |
1239 |
|
mode = MODE_INTER; |
1240 |
|
cbp = *Data->cbp; |
1241 |
|
sad = iSAD; |
1242 |
|
} |
1243 |
|
} |
1244 |
|
|
1245 |
|
if (inter4v) { |
1246 |
|
int v4_rd; |
1247 |
|
v4_rd = findRDinter4v(Data, pMB, pMBs, x, y, pParam, MotionFlags, backup); |
1248 |
|
if (v4_rd < min_rd) { |
1249 |
|
Data->iMinSAD[0] = min_rd = v4_rd; |
1250 |
|
mode = MODE_INTER4V; |
1251 |
|
cbp = *Data->cbp; |
1252 |
|
sad = sad_backup[1] + sad_backup[2] + |
1253 |
|
sad_backup[3] + sad_backup[4] + IMV16X16 * (int32_t)iQuant; |
1254 |
|
} |
1255 |
|
} |
1256 |
|
} |
1257 |
|
|
1258 |
|
left = top = top_right = -1; |
1259 |
|
thresh = 0; |
1260 |
|
|
1261 |
|
if((x > 0) && (y > 0) && (x < (int32_t) pParam->mb_width)) { |
1262 |
|
left = (&pMBs[(x-1) + y * pParam->mb_width])->sad16; // left |
1263 |
|
top = (&pMBs[x + (y-1) * pParam->mb_width])->sad16; // top |
1264 |
|
top_right = (&pMBs[(x+1) + (y-1) * pParam->mb_width])->sad16; // top right |
1265 |
|
|
1266 |
|
if(((&pMBs[(x-1) + y * pParam->mb_width])->mode != MODE_INTRA) && |
1267 |
|
((&pMBs[x + (y-1) * pParam->mb_width])->mode != MODE_INTRA) && |
1268 |
|
((&pMBs[(x+1) + (y-1) * pParam->mb_width])->mode != MODE_INTRA)) { |
1269 |
|
thresh = MAX(MAX(top, left), top_right); |
1270 |
|
} |
1271 |
|
else |
1272 |
|
thresh = MIN(MIN(top, left), top_right); |
1273 |
|
} |
1274 |
|
|
1275 |
|
/* INTRA <-> INTER decision */ |
1276 |
|
if (sad < thresh) { /* normal, fast, SAD-based mode decision */ |
1277 |
|
/* intra decision */ |
1278 |
|
|
1279 |
|
if (iQuant > 8) InterBias += 100 * (iQuant - 8); /* to make high quants work */ |
1280 |
|
if (y != 0) |
1281 |
|
if ((pMB - pParam->mb_width)->mode == MODE_INTRA ) InterBias -= 80; |
1282 |
|
if (x != 0) |
1283 |
|
if ((pMB - 1)->mode == MODE_INTRA ) InterBias -= 80; |
1284 |
|
|
1285 |
|
if (Data->chroma) InterBias += 50; /* dev8(chroma) ??? <-- yes, we need dev8 (no big difference though) */ |
1286 |
|
if (Data->rrv) InterBias *= 4; |
1287 |
|
|
1288 |
|
if (InterBias < sad) { |
1289 |
|
int32_t deviation; |
1290 |
|
if (!Data->rrv) |
1291 |
|
deviation = dev16(Data->Cur, Data->iEdgedWidth); |
1292 |
|
else |
1293 |
|
deviation = dev16(Data->Cur, Data->iEdgedWidth) + /* dev32() */ |
1294 |
|
dev16(Data->Cur+16, Data->iEdgedWidth) + |
1295 |
|
dev16(Data->Cur + 16*Data->iEdgedWidth, Data->iEdgedWidth) + |
1296 |
|
dev16(Data->Cur+16+16*Data->iEdgedWidth, Data->iEdgedWidth); |
1297 |
|
|
1298 |
|
if (deviation < (sad - InterBias)) mode = MODE_INTRA; |
1299 |
|
} |
1300 |
|
|
1301 |
|
pMB->cbp = 63; |
1302 |
|
} else { /* Rate-Distortion INTRA<->INTER */ |
1303 |
|
if(min_rd < 0) { |
1304 |
|
Data->iQuant = iQuant; |
1305 |
|
Data->cbp = c; |
1306 |
|
v = Data->qpel ? Data->currentQMV : Data->currentMV; |
1307 |
|
|
1308 |
|
for (i = 0; i < 5; i++) { |
1309 |
|
Data->iMinSAD[i] = 256*4096; |
1310 |
|
backup[i] = v[i]; |
1311 |
|
} |
1312 |
|
|
1313 |
|
if(mode == MODE_INTER) { |
1314 |
|
min_rd = findRDinter(Data, pMBs, x, y, pParam, MotionFlags); |
1315 |
|
cbp = *Data->cbp; |
1316 |
|
|
1317 |
|
if (coding_type == S_VOP) { |
1318 |
|
int gmc_rd; |
1319 |
|
|
1320 |
|
*Data->iMinSAD = min_rd += BITS_MULT*1; /* mcsel */ |
1321 |
|
gmc_rd = findRDgmc(Data, vGMC, x, y); |
1322 |
|
if (gmc_rd < min_rd) { |
1323 |
|
mcsel = 1; |
1324 |
|
*Data->iMinSAD = min_rd = gmc_rd; |
1325 |
|
mode = MODE_INTER; |
1326 |
|
cbp = *Data->cbp; |
1327 |
|
} |
1328 |
|
} |
1329 |
|
} |
1330 |
|
|
1331 |
|
if(mode == MODE_INTER4V) { |
1332 |
|
int v4_rd; |
1333 |
|
v4_rd = findRDinter4v(Data, pMB, pMBs, x, y, pParam, MotionFlags, backup); |
1334 |
|
if (v4_rd < min_rd) { |
1335 |
|
Data->iMinSAD[0] = min_rd = v4_rd; |
1336 |
|
mode = MODE_INTER4V; |
1337 |
|
cbp = *Data->cbp; |
1338 |
|
} |
1339 |
|
} |
1340 |
|
} |
1341 |
|
|
1342 |
|
intra_rd = findRDintra(Data); |
1343 |
|
if (intra_rd < min_rd) { |
1344 |
|
*Data->iMinSAD = min_rd = intra_rd; |
1345 |
|
mode = MODE_INTRA; |
1346 |
|
} |
1347 |
|
|
1348 |
|
pMB->cbp = cbp; |
1349 |
|
} |
1350 |
|
|
1351 |
|
early_out: |
1352 |
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; |
1353 |
|
|
1354 |
|
if (Data->rrv) { |
1355 |
|
Data->currentMV[0].x = RRV_MV_SCALEDOWN(Data->currentMV[0].x); |
1356 |
|
Data->currentMV[0].y = RRV_MV_SCALEDOWN(Data->currentMV[0].y); |
1357 |
|
} |
1358 |
|
|
1359 |
|
if (mode == MODE_INTER && mcsel == 0) { |
1360 |
|
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = Data->currentMV[0]; |
1361 |
|
|
1362 |
|
if(Data->qpel) { |
1363 |
|
pMB->qmvs[0] = pMB->qmvs[1] |
1364 |
|
= pMB->qmvs[2] = pMB->qmvs[3] = Data->currentQMV[0]; |
1365 |
|
pMB->pmvs[0].x = Data->currentQMV[0].x - Data->predMV.x; |
1366 |
|
pMB->pmvs[0].y = Data->currentQMV[0].y - Data->predMV.y; |
1367 |
|
} else { |
1368 |
|
pMB->pmvs[0].x = Data->currentMV[0].x - Data->predMV.x; |
1369 |
|
pMB->pmvs[0].y = Data->currentMV[0].y - Data->predMV.y; |
1370 |
|
} |
1371 |
|
|
1372 |
|
} else if (mode == MODE_INTER ) { // but mcsel == 1 |
1373 |
|
|
1374 |
|
pMB->mcsel = 1; |
1375 |
|
if (Data->qpel) { |
1376 |
|
pMB->qmvs[0] = pMB->qmvs[1] = pMB->qmvs[2] = pMB->qmvs[3] = pMB->amv; |
1377 |
|
pMB->mvs[0].x = pMB->mvs[1].x = pMB->mvs[2].x = pMB->mvs[3].x = pMB->amv.x/2; |
1378 |
|
pMB->mvs[0].y = pMB->mvs[1].y = pMB->mvs[2].y = pMB->mvs[3].y = pMB->amv.y/2; |
1379 |
|
} else |
1380 |
|
pMB->mvs[0] = pMB->mvs[1] = pMB->mvs[2] = pMB->mvs[3] = pMB->amv; |
1381 |
|
|
1382 |
|
} else |
1383 |
|
if (mode == MODE_INTER4V) ; /* anything here? */ |
1384 |
|
else /* INTRA, NOT_CODED */ |
1385 |
|
ZeroMacroblockP(pMB, 0); |
1386 |
|
|
1387 |
|
pMB->mode = mode; |
1388 |
} |
} |
1389 |
|
|
1390 |
static __inline void |
static __inline void |
1478 |
pMB->cbp = 63; |
pMB->cbp = 63; |
1479 |
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; |
1480 |
|
|
1481 |
} else { /* BITS */ |
} else { /* Rate-Distortion */ |
1482 |
|
|
1483 |
int bits, intra, i, cbp, c[2] = {0, 0}; |
int min_rd, intra_rd, i, cbp, c[2] = {0, 0}; |
1484 |
VECTOR backup[5], *v; |
VECTOR backup[5], *v; |
1485 |
Data->iQuant = iQuant; |
Data->iQuant = iQuant; |
1486 |
Data->cbp = c; |
Data->cbp = c; |
1491 |
backup[i] = v[i]; |
backup[i] = v[i]; |
1492 |
} |
} |
1493 |
|
|
1494 |
bits = CountMBBitsInter(Data, pMBs, x, y, pParam, MotionFlags); |
min_rd = findRDinter(Data, pMBs, x, y, pParam, MotionFlags); |
1495 |
cbp = *Data->cbp; |
cbp = *Data->cbp; |
1496 |
|
|
1497 |
if (coding_type == S_VOP) { |
if (coding_type == S_VOP) { |
1498 |
int bits_gmc; |
int gmc_rd; |
1499 |
*Data->iMinSAD = bits += BITS_MULT*1; /* mcsel */ |
*Data->iMinSAD = min_rd += BITS_MULT*1; /* mcsel */ |
1500 |
bits_gmc = CountMBBitsGMC(Data, vGMC, x, y); |
gmc_rd = findRDgmc(Data, vGMC, x, y); |
1501 |
if (bits_gmc < bits) { |
if (gmc_rd < min_rd) { |
1502 |
mcsel = 1; |
mcsel = 1; |
1503 |
*Data->iMinSAD = bits = bits_gmc; |
*Data->iMinSAD = min_rd = gmc_rd; |
1504 |
mode = MODE_INTER; |
mode = MODE_INTER; |
1505 |
cbp = *Data->cbp; |
cbp = *Data->cbp; |
1506 |
} |
} |
1507 |
} |
} |
1508 |
|
|
1509 |
if (inter4v) { |
if (inter4v) { |
1510 |
int bits_4v; |
int v4_rd; |
1511 |
bits_4v = CountMBBitsInter4v(Data, pMB, pMBs, x, y, pParam, MotionFlags, backup); |
v4_rd = findRDinter4v(Data, pMB, pMBs, x, y, pParam, MotionFlags, backup); |
1512 |
if (bits_4v < bits) { |
if (v4_rd < min_rd) { |
1513 |
Data->iMinSAD[0] = bits = bits_4v; |
Data->iMinSAD[0] = min_rd = v4_rd; |
1514 |
mode = MODE_INTER4V; |
mode = MODE_INTER4V; |
1515 |
cbp = *Data->cbp; |
cbp = *Data->cbp; |
1516 |
} |
} |
1517 |
} |
} |
1518 |
|
|
1519 |
intra = CountMBBitsIntra(Data); |
intra_rd = findRDintra(Data); |
1520 |
if (intra < bits) { |
if (intra_rd < min_rd) { |
1521 |
*Data->iMinSAD = bits = intra; |
*Data->iMinSAD = min_rd = intra_rd; |
1522 |
mode = MODE_INTRA; |
mode = MODE_INTRA; |
1523 |
} |
} |
1524 |
|
|
1557 |
} else |
} else |
1558 |
if (mode == MODE_INTER4V) ; /* anything here? */ |
if (mode == MODE_INTER4V) ; /* anything here? */ |
1559 |
else /* INTRA, NOT_CODED */ |
else /* INTRA, NOT_CODED */ |
1560 |
SkipMacroblockP(pMB, 0); |
ZeroMacroblockP(pMB, 0); |
1561 |
|
|
1562 |
pMB->mode = mode; |
pMB->mode = mode; |
1563 |
} |
} |
1580 |
uint32_t mb_height = pParam->mb_height; |
uint32_t mb_height = pParam->mb_height; |
1581 |
const uint32_t iEdgedWidth = pParam->edged_width; |
const uint32_t iEdgedWidth = pParam->edged_width; |
1582 |
const uint32_t MotionFlags = MakeGoodMotionFlags(current->motion_flags, current->vop_flags, current->vol_flags); |
const uint32_t MotionFlags = MakeGoodMotionFlags(current->motion_flags, current->vop_flags, current->vol_flags); |
1583 |
|
int stat_thresh = 0; |
1584 |
|
|
1585 |
uint32_t x, y; |
uint32_t x, y; |
1586 |
uint32_t iIntra = 0; |
uint32_t iIntra = 0; |
1587 |
int32_t quant = current->quant, sad00; |
int32_t sad00; |
1588 |
int skip_thresh = INITIAL_SKIP_THRESH * \ |
int skip_thresh = INITIAL_SKIP_THRESH * \ |
1589 |
(current->vop_flags & XVID_VOP_REDUCED ? 4:1) * \ |
(current->vop_flags & XVID_VOP_REDUCED ? 4:1) * \ |
1590 |
(current->vop_flags & XVID_VOP_MODEDECISION_RD ? 2:1); |
(current->vop_flags & XVID_VOP_MODEDECISION_RD ? 2:1); |
1591 |
|
|
1592 |
/* some pre-initialized thingies for SearchP */ |
/* some pre-initialized thingies for SearchP */ |
1593 |
int32_t temp[8]; |
int32_t temp[8]; uint32_t dir; |
1594 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
1595 |
VECTOR currentQMV[5]; |
VECTOR currentQMV[5]; |
1596 |
|
VECTOR currentMV2[5]; |
1597 |
|
VECTOR currentQMV2[5]; |
1598 |
int32_t iMinSAD[5]; |
int32_t iMinSAD[5]; |
1599 |
|
int32_t iMinSAD2[5]; |
1600 |
DECLARE_ALIGNED_MATRIX(dct_space, 3, 64, int16_t, CACHE_LINE); |
DECLARE_ALIGNED_MATRIX(dct_space, 3, 64, int16_t, CACHE_LINE); |
1601 |
SearchData Data; |
SearchData Data; |
1602 |
memset(&Data, 0, sizeof(SearchData)); |
memset(&Data, 0, sizeof(SearchData)); |
1603 |
Data.iEdgedWidth = iEdgedWidth; |
Data.iEdgedWidth = iEdgedWidth; |
1604 |
Data.currentMV = currentMV; |
Data.currentMV = currentMV; |
1605 |
Data.currentQMV = currentQMV; |
Data.currentQMV = currentQMV; |
1606 |
|
Data.currentMV2 = currentMV2; |
1607 |
|
Data.currentQMV2 = currentQMV2; |
1608 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
1609 |
|
Data.iMinSAD2 = iMinSAD2; |
1610 |
Data.temp = temp; |
Data.temp = temp; |
1611 |
|
Data.dir = &dir; |
1612 |
Data.iFcode = current->fcode; |
Data.iFcode = current->fcode; |
1613 |
Data.rounding = pParam->m_rounding_type; |
Data.rounding = pParam->m_rounding_type; |
1614 |
Data.qpel = (current->vol_flags & XVID_VOL_QUARTERPEL ? 1:0); |
Data.qpel = (current->vol_flags & XVID_VOL_QUARTERPEL ? 1:0); |
1629 |
for (y = 0; y < mb_height; y++) { |
for (y = 0; y < mb_height; y++) { |
1630 |
for (x = 0; x < mb_width; x++) { |
for (x = 0; x < mb_width; x++) { |
1631 |
MACROBLOCK *pMB = &pMBs[x + y * pParam->mb_width]; |
MACROBLOCK *pMB = &pMBs[x + y * pParam->mb_width]; |
1632 |
|
MACROBLOCK *prevMB = &reference->mbs[x + y * pParam->mb_width]; |
1633 |
|
|
1634 |
if (!Data.rrv) pMB->sad16 = |
if (!Data.rrv) pMB->sad16 = |
1635 |
sad16v(pCurrent->y + (x + y * iEdgedWidth) * 16, |
sad16v(pCurrent->y + (x + y * iEdgedWidth) * 16, |
1651 |
|
|
1652 |
sad00 = pMB->sad16; |
sad00 = pMB->sad16; |
1653 |
|
|
|
if (pMB->dquant != 0) { |
|
|
quant += DQtab[pMB->dquant]; |
|
|
if (quant > 31) quant = 31; |
|
|
else if (quant < 1) quant = 1; |
|
|
} |
|
|
pMB->quant = quant; |
|
|
|
|
1654 |
/* initial skip decision */ |
/* initial skip decision */ |
1655 |
/* no early skip for GMC (global vector = skip vector is unknown!) */ |
/* no early skip for GMC (global vector = skip vector is unknown!) */ |
1656 |
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 */ |
1657 |
if (pMB->dquant == 0 && sad00 < pMB->quant * skip_thresh) |
if (pMB->dquant == 0 && sad00 < pMB->quant * skip_thresh) |
1658 |
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)) { |
1659 |
SkipMacroblockP(pMB, sad00); |
ZeroMacroblockP(pMB, sad00); |
1660 |
|
pMB->mode = MODE_NOT_CODED; |
1661 |
continue; |
continue; |
1662 |
} |
} |
1663 |
} |
} |
1664 |
|
|
1665 |
|
if(MotionFlags & XVID_ME_DETECT_STATIC_MOTION) { |
1666 |
|
if(x > 0 && y > 0 && x < pParam->mb_width) |
1667 |
|
if(MVequal((&pMBs[(x-1) + y * pParam->mb_width])->mvs[0], zeroMV) && |
1668 |
|
MVequal((&pMBs[x + (y-1) * pParam->mb_width])->mvs[0], zeroMV) && |
1669 |
|
MVequal((&pMBs[(x+1) + (y-1) * pParam->mb_width])->mvs[0], zeroMV) && |
1670 |
|
MVequal(prevMB->mvs[0], zeroMV)) { |
1671 |
|
stat_thresh = MAX((&pMBs[(x-1) + y * pParam->mb_width])->sad16, |
1672 |
|
MAX((&pMBs[x + (y-1) * pParam->mb_width])->sad16, |
1673 |
|
MAX((&pMBs[(x+1) + (y-1) * pParam->mb_width])->sad16, |
1674 |
|
prevMB->sad16))); |
1675 |
|
} |
1676 |
|
else |
1677 |
|
stat_thresh = MIN((&pMBs[(x-1) + y * pParam->mb_width])->sad16, |
1678 |
|
MIN((&pMBs[x + (y-1) * pParam->mb_width])->sad16, |
1679 |
|
MIN((&pMBs[(x+1) + (y-1) * pParam->mb_width])->sad16, |
1680 |
|
prevMB->sad16))); |
1681 |
|
} |
1682 |
|
|
1683 |
if ((current->vop_flags & XVID_VOP_CARTOON) && |
if ((current->vop_flags & XVID_VOP_CARTOON) && |
1684 |
(sad00 < pMB->quant * 4 * skip_thresh)) { /* favorize (0,0) vector for cartoons */ |
(sad00 < pMB->quant * 4 * skip_thresh) || (sad00 < stat_thresh)) { /* favorize (0,0) vector for cartoons */ |
1685 |
ZeroMacroblockP(pMB, sad00); |
ZeroMacroblockP(pMB, sad00); |
1686 |
continue; |
continue; |
1687 |
} |
} |
1690 |
y, MotionFlags, current->vop_flags, current->vol_flags, |
y, MotionFlags, current->vop_flags, current->vol_flags, |
1691 |
&Data, pParam, pMBs, reference->mbs, pMB); |
&Data, pParam, pMBs, reference->mbs, pMB); |
1692 |
|
|
1693 |
|
if(current->vop_flags & XVID_VOP_FAST_MODEDECISION_RD) { |
1694 |
|
ModeDecision_Fast(&Data, pMB, pMBs, x, y, pParam, |
1695 |
|
MotionFlags, current->vop_flags, current->vol_flags, |
1696 |
|
pCurrent, pRef, pGMC, current->coding_type); |
1697 |
|
} |
1698 |
|
else { |
1699 |
ModeDecision(&Data, pMB, pMBs, x, y, pParam, |
ModeDecision(&Data, pMB, pMBs, x, y, pParam, |
1700 |
MotionFlags, current->vop_flags, current->vol_flags, |
MotionFlags, current->vop_flags, current->vol_flags, |
1701 |
pCurrent, pRef, pGMC, current->coding_type); |
pCurrent, pRef, pGMC, current->coding_type); |
1702 |
|
} |
1703 |
|
|
1704 |
if (pMB->mode == MODE_INTRA) |
if (pMB->mode == MODE_INTRA) |
1705 |
if (++iIntra > iLimit) return 1; |
if (++iIntra > iLimit) return 1; |
1706 |
} |
} |
1707 |
} |
} |
1708 |
|
|
|
// if (current->vol_flags & XVID_VOL_GMC ) /* GMC only for S(GMC)-VOPs */ |
|
|
// { |
|
|
// current->warp = GlobalMotionEst( pMBs, pParam, current, reference, pRefH, pRefV, pRefHV); |
|
|
// } |
|
1709 |
return 0; |
return 0; |
1710 |
} |
} |
1711 |
|
|
1712 |
|
/* check if given vector is equal to any vector checked before */ |
1713 |
|
static __inline int |
1714 |
|
vector_repeats(const VECTOR * const pmv, const int i) |
1715 |
|
{ |
1716 |
|
unsigned int j; |
1717 |
|
for (j = 0; j < i; j++) |
1718 |
|
if (MVequal(pmv[i], pmv[j])) return 1; /* same vector has been checked already */ |
1719 |
|
return 0; |
1720 |
|
} |
1721 |
|
|
1722 |
|
/* make a binary mask that prevents diamonds/squares |
1723 |
|
from checking a vector which has been checked as a prediction */ |
1724 |
static __inline int |
static __inline int |
1725 |
make_mask(const VECTOR * const pmv, const int i) |
make_mask(const VECTOR * const pmv, const int i, const int current) |
1726 |
{ |
{ |
1727 |
int mask = 255, j; |
unsigned int mask = 255, j; |
1728 |
for (j = 0; j < i; j++) { |
for (j = 0; j < i; j++) { |
1729 |
if (MVequal(pmv[i], pmv[j])) return 0; /* same vector has been checked already */ |
if (pmv[current].x == pmv[j].x) { |
1730 |
if (pmv[i].x == pmv[j].x) { |
if (pmv[current].y == pmv[j].y + iDiamondSize) mask &= ~4; |
1731 |
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; |
|
1732 |
} else |
} else |
1733 |
if (pmv[i].y == pmv[j].y) { |
if (pmv[current].y == pmv[j].y) { |
1734 |
if (pmv[i].x == pmv[j].x + iDiamondSize) mask &= ~1; |
if (pmv[current].x == pmv[j].x + iDiamondSize) mask &= ~1; |
1735 |
else if (pmv[i].x == pmv[j].x - iDiamondSize) mask &= ~2; |
else if (pmv[current].x == pmv[j].x - iDiamondSize) mask &= ~2; |
1736 |
} |
} |
1737 |
} |
} |
1738 |
return mask; |
return mask; |
1796 |
MACROBLOCK * const pMB) |
MACROBLOCK * const pMB) |
1797 |
{ |
{ |
1798 |
|
|
1799 |
int i, iDirection = 255, mask, threshA; |
int i, threshA; |
1800 |
VECTOR pmv[7]; |
VECTOR pmv[7]; |
1801 |
int inter4v = (VopFlags & XVID_VOP_INTER4V) && (pMB->dquant == 0); |
int inter4v = (VopFlags & XVID_VOP_INTER4V) && (pMB->dquant == 0); |
1802 |
|
CheckFunc * CheckCandidate; |
1803 |
|
|
1804 |
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, |
1805 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
1806 |
|
|
1807 |
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); |
1808 |
|
|
1822 |
Data->lambda16 = lambda_vec16[pMB->quant]; |
Data->lambda16 = lambda_vec16[pMB->quant]; |
1823 |
Data->lambda8 = lambda_vec8[pMB->quant]; |
Data->lambda8 = lambda_vec8[pMB->quant]; |
1824 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
1825 |
|
*Data->dir = 0; |
1826 |
|
|
1827 |
memset(Data->currentMV, 0, 5*sizeof(VECTOR)); |
memset(Data->currentMV, 0, 5*sizeof(VECTOR)); |
1828 |
|
|
1847 |
prevMBs + x + y * pParam->mb_width, Data->rrv); |
prevMBs + x + y * pParam->mb_width, Data->rrv); |
1848 |
|
|
1849 |
if (!Data->rrv) { |
if (!Data->rrv) { |
1850 |
if (inter4v | Data->chroma) CheckCandidate = CheckCandidate16; |
if (inter4v) CheckCandidate = CheckCandidate16; |
1851 |
else CheckCandidate = CheckCandidate16no4v; /* for extra speed */ |
else CheckCandidate = CheckCandidate16no4v; /* for extra speed */ |
1852 |
} else CheckCandidate = CheckCandidate32; |
} else CheckCandidate = CheckCandidate32; |
1853 |
|
|
1854 |
/* 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())*/ |
1855 |
|
|
1856 |
for (i = 1; i < 7; i++) { |
for (i = 1; i < 7; i++) |
1857 |
if (!(mask = make_mask(pmv, i)) ) continue; |
if (!vector_repeats(pmv, i)) { |
1858 |
CheckCandidate(pmv[i].x, pmv[i].y, mask, &iDirection, Data); |
CheckCandidate(pmv[i].x, pmv[i].y, Data, i); |
1859 |
if (Data->iMinSAD[0] <= threshA) break; |
if (Data->iMinSAD[0] <= threshA) { i++; break; } |
1860 |
} |
} |
1861 |
|
|
1862 |
if ((Data->iMinSAD[0] <= threshA) || |
if ((Data->iMinSAD[0] <= threshA) || |
1866 |
else { |
else { |
1867 |
|
|
1868 |
MainSearchFunc * MainSearchPtr; |
MainSearchFunc * MainSearchPtr; |
1869 |
|
int mask = make_mask(pmv, i, *Data->dir); // all vectors pmv[0..i-1] have been checked |
1870 |
|
|
1871 |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
1872 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
1873 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
1874 |
|
|
1875 |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate); |
1876 |
|
|
1877 |
/* extended search, diamond starting in 0,0 and in prediction. |
/* extended search, diamond starting in 0,0 and in prediction. |
1878 |
note that this search is/might be done in halfpel positions, |
note that this search is/might be done in halfpel positions, |
1888 |
if (!(MVequal(startMV, backupMV))) { |
if (!(MVequal(startMV, backupMV))) { |
1889 |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
1890 |
|
|
1891 |
CheckCandidate(startMV.x, startMV.y, 255, &iDirection, Data); |
CheckCandidate(startMV.x, startMV.y, Data, 255); |
1892 |
MainSearchPtr(startMV.x, startMV.y, Data, 255); |
MainSearchPtr(startMV.x, startMV.y, Data, 255, CheckCandidate); |
1893 |
if (bSAD < Data->iMinSAD[0]) { |
if (bSAD < Data->iMinSAD[0]) { |
1894 |
Data->currentMV[0] = backupMV; |
Data->currentMV[0] = backupMV; |
1895 |
Data->iMinSAD[0] = bSAD; } |
Data->iMinSAD[0] = bSAD; } |
1900 |
if (!(MVequal(startMV, backupMV))) { |
if (!(MVequal(startMV, backupMV))) { |
1901 |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
bSAD = Data->iMinSAD[0]; Data->iMinSAD[0] = MV_MAX_ERROR; |
1902 |
|
|
1903 |
CheckCandidate(startMV.x, startMV.y, 255, &iDirection, Data); |
CheckCandidate(startMV.x, startMV.y, Data, 255); |
1904 |
MainSearchPtr(startMV.x, startMV.y, Data, 255); |
MainSearchPtr(startMV.x, startMV.y, Data, 255, CheckCandidate); |
1905 |
if (bSAD < Data->iMinSAD[0]) { |
if (bSAD < Data->iMinSAD[0]) { |
1906 |
Data->currentMV[0] = backupMV; |
Data->currentMV[0] = backupMV; |
1907 |
Data->iMinSAD[0] = bSAD; } |
Data->iMinSAD[0] = bSAD; |
1908 |
|
} |
1909 |
} |
} |
1910 |
} |
} |
1911 |
} |
} |
1912 |
|
|
1913 |
if (MotionFlags & XVID_ME_HALFPELREFINE16) |
if (MotionFlags & XVID_ME_HALFPELREFINE16) |
1914 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
1915 |
|
|
1916 |
for(i = 0; i < 5; i++) { |
for(i = 0; i < 5; i++) { |
1917 |
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; /* initialize qpel vectors */ |
Data->currentQMV[i].x = 2 * Data->currentMV[i].x; /* initialize qpel vectors */ |
1919 |
} |
} |
1920 |
|
|
1921 |
if (Data->qpel) { |
if (Data->qpel) { |
1922 |
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, |
1923 |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
1924 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
1925 |
if (MotionFlags & XVID_ME_QUARTERPELREFINE16) |
if (MotionFlags & XVID_ME_QUARTERPELREFINE16) |
1926 |
SubpelRefine(Data); |
if(MotionFlags & XVID_ME_FASTREFINE16) |
1927 |
|
SubpelRefine_Fast(Data, CheckCandidate); |
1928 |
|
else |
1929 |
|
SubpelRefine(Data, CheckCandidate); |
1930 |
} |
} |
1931 |
|
|
1932 |
if (Data->iMinSAD[0] < (int32_t)pMB->quant * 30) |
if (Data->iMinSAD[0] < (int32_t)pMB->quant * 30) |
1973 |
SearchData * const Data) |
SearchData * const Data) |
1974 |
{ |
{ |
1975 |
int i = 0; |
int i = 0; |
1976 |
|
CheckFunc * CheckCandidate; |
1977 |
Data->iMinSAD = OldData->iMinSAD + 1 + block; |
Data->iMinSAD = OldData->iMinSAD + 1 + block; |
1978 |
Data->currentMV = OldData->currentMV + 1 + block; |
Data->currentMV = OldData->currentMV + 1 + block; |
1979 |
Data->currentQMV = OldData->currentQMV + 1 + block; |
Data->currentQMV = OldData->currentQMV + 1 + block; |
2002 |
Data->Cur = OldData->Cur + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
Data->Cur = OldData->Cur + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
2003 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
2004 |
|
|
2005 |
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, |
2006 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
2007 |
|
|
2008 |
if (!Data->rrv) CheckCandidate = CheckCandidate8; |
if (!Data->rrv) CheckCandidate = CheckCandidate8; |
2009 |
else CheckCandidate = CheckCandidate16no4v; |
else CheckCandidate = CheckCandidate16no4v; |
2016 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND8) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND8) MainSearchPtr = AdvDiamondSearch; |
2017 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
2018 |
|
|
2019 |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, 255); |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, 255, CheckCandidate); |
2020 |
|
|
2021 |
if(*(Data->iMinSAD) < temp_sad) { |
if(*(Data->iMinSAD) < temp_sad) { |
2022 |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
2027 |
if (MotionFlags & XVID_ME_HALFPELREFINE8) { |
if (MotionFlags & XVID_ME_HALFPELREFINE8) { |
2028 |
int32_t temp_sad = *(Data->iMinSAD); /* store current MinSAD */ |
int32_t temp_sad = *(Data->iMinSAD); /* store current MinSAD */ |
2029 |
|
|
2030 |
SubpelRefine(Data); /* perform halfpel refine of current best vector */ |
SubpelRefine(Data, CheckCandidate); /* perform halfpel refine of current best vector */ |
2031 |
|
|
2032 |
if(*(Data->iMinSAD) < temp_sad) { /* we have found a better match */ |
if(*(Data->iMinSAD) < temp_sad) { /* we have found a better match */ |
2033 |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
Data->currentQMV->x = 2 * Data->currentMV->x; /* update our qpel vector */ |
2037 |
|
|
2038 |
if (Data->qpel && MotionFlags & XVID_ME_QUARTERPELREFINE8) { |
if (Data->qpel && MotionFlags & XVID_ME_QUARTERPELREFINE8) { |
2039 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2040 |
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, |
2041 |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
2042 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
2043 |
} |
} |
2044 |
} |
} |
2045 |
|
|
2125 |
SearchData * const Data) |
SearchData * const Data) |
2126 |
{ |
{ |
2127 |
|
|
2128 |
int i, iDirection = 255, mask; |
int i; |
2129 |
VECTOR pmv[7]; |
VECTOR pmv[7]; |
2130 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
2131 |
*Data->iMinSAD = MV_MAX_ERROR; |
*Data->iMinSAD = MV_MAX_ERROR; |
2142 |
|
|
2143 |
Data->predMV = *predMV; |
Data->predMV = *predMV; |
2144 |
|
|
2145 |
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, |
2146 |
pParam->width, pParam->height, iFcode - Data->qpel, 0, 0); |
pParam->width, pParam->height, iFcode - Data->qpel, 1, 0); |
2147 |
|
|
2148 |
pmv[0] = Data->predMV; |
pmv[0] = Data->predMV; |
2149 |
if (Data->qpel) { pmv[0].x /= 2; pmv[0].y /= 2; } |
if (Data->qpel) { pmv[0].x /= 2; pmv[0].y /= 2; } |
2151 |
PreparePredictionsBF(pmv, x, y, pParam->mb_width, pMB, mode_current); |
PreparePredictionsBF(pmv, x, y, pParam->mb_width, pMB, mode_current); |
2152 |
|
|
2153 |
Data->currentMV->x = Data->currentMV->y = 0; |
Data->currentMV->x = Data->currentMV->y = 0; |
|
CheckCandidate = CheckCandidate16no4v; |
|
2154 |
|
|
2155 |
/* main loop. checking all predictions */ |
/* main loop. checking all predictions */ |
2156 |
for (i = 0; i < 7; i++) { |
for (i = 0; i < 7; i++) |
2157 |
if (!(mask = make_mask(pmv, i)) ) continue; |
if (!vector_repeats(pmv, i) ) |
2158 |
CheckCandidate16no4v(pmv[i].x, pmv[i].y, mask, &iDirection, Data); |
CheckCandidate16no4v(pmv[i].x, pmv[i].y, Data, i); |
|
} |
|
2159 |
|
|
2160 |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
if (MotionFlags & XVID_ME_USESQUARES16) MainSearchPtr = SquareSearch; |
2161 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
2162 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
2163 |
|
|
2164 |
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
if (*Data->iMinSAD > 512) { |
2165 |
|
unsigned int mask = make_mask(pmv, 7, *Data->dir); |
2166 |
|
MainSearchPtr(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate16no4v); |
2167 |
|
} |
2168 |
|
|
2169 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16no4v); |
2170 |
|
|
2171 |
if (Data->qpel && *Data->iMinSAD < *best_sad + 300) { |
if (Data->qpel && *Data->iMinSAD < *best_sad + 300) { |
2172 |
Data->currentQMV->x = 2*Data->currentMV->x; |
Data->currentQMV->x = 2*Data->currentMV->x; |
2173 |
Data->currentQMV->y = 2*Data->currentMV->y; |
Data->currentQMV->y = 2*Data->currentMV->y; |
2174 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2175 |
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, |
2176 |
pParam->width, pParam->height, iFcode, 1, 0); |
pParam->width, pParam->height, iFcode, 2, 0); |
2177 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16no4v); |
2178 |
} |
} |
2179 |
|
|
2180 |
/* three bits are needed to code backward mode. four for forward */ |
/* three bits are needed to code backward mode. four for forward */ |
2214 |
{ |
{ |
2215 |
int dx = 0, dy = 0, b_dx = 0, b_dy = 0; |
int dx = 0, dy = 0, b_dx = 0, b_dy = 0; |
2216 |
int32_t sum; |
int32_t sum; |
|
const int div = 1 + Data->qpel; |
|
2217 |
int k; |
int k; |
2218 |
const uint32_t stride = Data->iEdgedWidth/2; |
const uint32_t stride = Data->iEdgedWidth/2; |
2219 |
/* 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 */ |
2220 |
|
|
2221 |
for (k = 0; k < 4; k++) { |
for (k = 0; k < 4; k++) { |
2222 |
dy += Data->directmvF[k].y / div; |
dy += Data->directmvF[k].y >> Data->qpel; |
2223 |
dx += Data->directmvF[k].x / div; |
dx += Data->directmvF[k].x >> Data->qpel; |
2224 |
b_dy += Data->directmvB[k].y / div; |
b_dy += Data->directmvB[k].y >> Data->qpel; |
2225 |
b_dx += Data->directmvB[k].x / div; |
b_dx += Data->directmvB[k].x >> Data->qpel; |
2226 |
} |
} |
2227 |
|
|
2228 |
dy = (dy >> 3) + roundtab_76[dy & 0xf]; |
dy = (dy >> 3) + roundtab_76[dy & 0xf]; |
2235 |
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, |
2236 |
stride); |
stride); |
2237 |
|
|
2238 |
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 */ |
2239 |
|
|
2240 |
sum += sad8bi(pCur->v + 8*x + 8 * y * stride, |
sum += sad8bi(pCur->v + 8*x + 8 * y * stride, |
2241 |
f_Ref->v + (y*8 + dy/2) * stride + x*8 + dx/2, |
f_Ref->v + (y*8 + dy/2) * stride + x*8 + dx/2, |
2242 |
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, |
2243 |
stride); |
stride); |
2244 |
|
|
2245 |
if (sum < 2 * MAX_CHROMA_SAD_FOR_SKIP * pMB->quant) { |
if (sum < MAX_CHROMA_SAD_FOR_SKIP * Data->iQuant) { |
2246 |
pMB->mode = MODE_DIRECT_NONE_MV; /* skipped */ |
pMB->mode = MODE_DIRECT_NONE_MV; /* skipped */ |
2247 |
for (k = 0; k < 4; k++) { |
for (k = 0; k < 4; k++) { |
2248 |
pMB->qmvs[k] = pMB->mvs[k]; |
pMB->qmvs[k] = pMB->mvs[k]; |
2274 |
int32_t skip_sad; |
int32_t skip_sad; |
2275 |
int k = (x + Data->iEdgedWidth*y) * 16; |
int k = (x + Data->iEdgedWidth*y) * 16; |
2276 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
2277 |
|
CheckFunc * CheckCandidate; |
2278 |
|
|
2279 |
*Data->iMinSAD = 256*4096; |
*Data->iMinSAD = 256*4096; |
2280 |
Data->RefP[0] = f_Ref->y + k; |
Data->RefP[0] = f_Ref->y + k; |
2324 |
|
|
2325 |
CheckCandidate = b_mb->mode == MODE_INTER4V ? CheckCandidateDirect : CheckCandidateDirectno4v; |
CheckCandidate = b_mb->mode == MODE_INTER4V ? CheckCandidateDirect : CheckCandidateDirectno4v; |
2326 |
|
|
2327 |
CheckCandidate(0, 0, 255, &k, Data); |
CheckCandidate(0, 0, Data, 255); |
2328 |
|
|
2329 |
/* initial (fast) skip decision */ |
/* initial (fast) skip decision */ |
2330 |
if (*Data->iMinSAD < pMB->quant * INITIAL_SKIP_THRESH * (Data->chroma?3:2)) { |
if (*Data->iMinSAD < Data->iQuant * INITIAL_SKIP_THRESH * (Data->chroma?3:2)) { |
2331 |
/* possible skip */ |
/* possible skip */ |
2332 |
if (Data->chroma) { |
if (Data->chroma) { |
2333 |
pMB->mode = MODE_DIRECT_NONE_MV; |
pMB->mode = MODE_DIRECT_NONE_MV; |
2350 |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
else if (MotionFlags & XVID_ME_ADVANCEDDIAMOND16) MainSearchPtr = AdvDiamondSearch; |
2351 |
else MainSearchPtr = DiamondSearch; |
else MainSearchPtr = DiamondSearch; |
2352 |
|
|
2353 |
MainSearchPtr(0, 0, Data, 255); |
MainSearchPtr(0, 0, Data, 255, CheckCandidate); |
2354 |
|
|
2355 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate); |
2356 |
|
|
2357 |
*best_sad = *Data->iMinSAD; |
*best_sad = *Data->iMinSAD; |
2358 |
|
|
2411 |
|
|
2412 |
{ |
{ |
2413 |
|
|
2414 |
int iDirection, i, j; |
int i, j; |
2415 |
SearchData bData; |
SearchData bData; |
2416 |
|
|
2417 |
fData->qpel_precision = 0; |
fData->qpel_precision = 0; |
2434 |
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; |
2435 |
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; |
2436 |
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; |
2437 |
|
bData.dir = fData->dir; |
2438 |
|
|
2439 |
bData.bpredMV = fData->predMV = *f_predMV; |
bData.bpredMV = fData->predMV = *f_predMV; |
2440 |
fData->bpredMV = bData.predMV = *b_predMV; |
fData->bpredMV = bData.predMV = *b_predMV; |
2441 |
fData->currentMV[0] = fData->currentMV[2]; |
fData->currentMV[0] = fData->currentMV[2]; |
2442 |
|
|
2443 |
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); |
2444 |
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); |
2445 |
|
|
2446 |
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; |
2447 |
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; |
2453 |
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; |
2454 |
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; |
2455 |
|
|
2456 |
CheckCandidateInt(fData->currentMV[0].x, fData->currentMV[0].y, 255, &iDirection, fData); |
CheckCandidateInt(fData->currentMV[0].x, fData->currentMV[0].y, fData, 255); |
2457 |
|
|
2458 |
/* diamond */ |
/* diamond */ |
2459 |
do { |
do { |
2460 |
iDirection = 255; |
*fData->dir = 255; |
2461 |
/* forward MV moves */ |
/* forward MV moves */ |
2462 |
i = fData->currentMV[0].x; j = fData->currentMV[0].y; |
i = fData->currentMV[0].x; j = fData->currentMV[0].y; |
2463 |
|
|
2464 |
CheckCandidateInt(i + 1, j, 0, &iDirection, fData); |
CheckCandidateInt(i + 1, j, fData, 0); |
2465 |
CheckCandidateInt(i, j + 1, 0, &iDirection, fData); |
CheckCandidateInt(i, j + 1, fData, 0); |
2466 |
CheckCandidateInt(i - 1, j, 0, &iDirection, fData); |
CheckCandidateInt(i - 1, j, fData, 0); |
2467 |
CheckCandidateInt(i, j - 1, 0, &iDirection, fData); |
CheckCandidateInt(i, j - 1, fData, 0); |
2468 |
|
|
2469 |
/* backward MV moves */ |
/* backward MV moves */ |
2470 |
i = fData->currentMV[1].x; j = fData->currentMV[1].y; |
i = fData->currentMV[1].x; j = fData->currentMV[1].y; |
2471 |
fData->currentMV[2] = fData->currentMV[0]; |
fData->currentMV[2] = fData->currentMV[0]; |
2472 |
CheckCandidateInt(i + 1, j, 0, &iDirection, &bData); |
CheckCandidateInt(i + 1, j, &bData, 0); |
2473 |
CheckCandidateInt(i, j + 1, 0, &iDirection, &bData); |
CheckCandidateInt(i, j + 1, &bData, 0); |
2474 |
CheckCandidateInt(i - 1, j, 0, &iDirection, &bData); |
CheckCandidateInt(i - 1, j, &bData, 0); |
2475 |
CheckCandidateInt(i, j - 1, 0, &iDirection, &bData); |
CheckCandidateInt(i, j - 1, &bData, 0); |
2476 |
|
|
2477 |
} while (!(iDirection)); |
} while (!(*fData->dir)); |
2478 |
|
|
2479 |
/* qpel refinement */ |
/* qpel refinement */ |
2480 |
if (fData->qpel) { |
if (fData->qpel) { |
2481 |
if (*fData->iMinSAD > *best_sad + 500) return; |
if (*fData->iMinSAD > *best_sad + 500) return; |
|
CheckCandidate = CheckCandidateInt; |
|
2482 |
fData->qpel_precision = bData.qpel_precision = 1; |
fData->qpel_precision = bData.qpel_precision = 1; |
2483 |
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); |
2484 |
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); |
2485 |
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; |
2486 |
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; |
2487 |
fData->currentQMV[1].x = 2 * fData->currentMV[1].x; |
fData->currentQMV[1].x = 2 * fData->currentMV[1].x; |
2488 |
fData->currentQMV[1].y = 2 * fData->currentMV[1].y; |
fData->currentQMV[1].y = 2 * fData->currentMV[1].y; |
2489 |
SubpelRefine(fData); |
SubpelRefine(fData, CheckCandidateInt); |
2490 |
if (*fData->iMinSAD > *best_sad + 300) return; |
if (*fData->iMinSAD > *best_sad + 300) return; |
2491 |
fData->currentQMV[2] = fData->currentQMV[0]; |
fData->currentQMV[2] = fData->currentQMV[0]; |
2492 |
SubpelRefine(&bData); |
SubpelRefine(&bData, CheckCandidateInt); |
2493 |
} |
} |
2494 |
|
|
2495 |
*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. */ |
2548 |
|
|
2549 |
SearchData Data; |
SearchData Data; |
2550 |
int32_t iMinSAD; |
int32_t iMinSAD; |
2551 |
|
uint32_t dir; |
2552 |
VECTOR currentMV[3]; |
VECTOR currentMV[3]; |
2553 |
VECTOR currentQMV[3]; |
VECTOR currentQMV[3]; |
2554 |
int32_t temp[8]; |
int32_t temp[8]; |
2556 |
Data.iEdgedWidth = pParam->edged_width; |
Data.iEdgedWidth = pParam->edged_width; |
2557 |
Data.currentMV = currentMV; Data.currentQMV = currentQMV; |
Data.currentMV = currentMV; Data.currentQMV = currentQMV; |
2558 |
Data.iMinSAD = &iMinSAD; |
Data.iMinSAD = &iMinSAD; |
2559 |
Data.lambda16 = lambda_vec16[frame->quant]; |
Data.lambda16 = lambda_vec16[MAX(frame->quant-2, 2)]; |
2560 |
Data.qpel = pParam->vol_flags & XVID_VOL_QUARTERPEL; |
Data.qpel = pParam->vol_flags & XVID_VOL_QUARTERPEL ? 1 : 0; |
2561 |
Data.rounding = 0; |
Data.rounding = 0; |
2562 |
Data.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
Data.chroma = frame->motion_flags & XVID_ME_CHROMA_BVOP; |
2563 |
Data.temp = temp; |
Data.temp = temp; |
2564 |
|
Data.dir = &dir; |
2565 |
|
Data.iQuant = frame->quant; |
2566 |
|
|
2567 |
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) */ |
2568 |
|
|
2585 |
Data.Cur = frame->image.y + (j * Data.iEdgedWidth + i) * 16; |
Data.Cur = frame->image.y + (j * Data.iEdgedWidth + i) * 16; |
2586 |
Data.CurU = frame->image.u + (j * Data.iEdgedWidth/2 + i) * 8; |
Data.CurU = frame->image.u + (j * Data.iEdgedWidth/2 + i) * 8; |
2587 |
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; |
|
2588 |
|
|
2589 |
/* direct search comes first, because it (1) checks for SKIP-mode |
/* direct search comes first, because it (1) checks for SKIP-mode |
2590 |
and (2) sets very good predictions for forward and backward search */ |
and (2) sets very good predictions for forward and backward search */ |
2630 |
&Data); |
&Data); |
2631 |
|
|
2632 |
/* final skip decision */ |
/* final skip decision */ |
2633 |
if ( (skip_sad < frame->quant * MAX_SAD00_FOR_SKIP * 2) |
if ( (skip_sad < Data.iQuant * MAX_SAD00_FOR_SKIP * 2) |
2634 |
&& ((100*best_sad)/(skip_sad+1) > FINAL_SKIP_THRESH) ) |
&& ((100*best_sad)/(skip_sad+1) > FINAL_SKIP_THRESH) ) |
2635 |
SkipDecisionB(&frame->image, f_ref, b_ref, pMB, i, j, &Data); |
SkipDecisionB(&frame->image, f_ref, b_ref, pMB, i, j, &Data); |
2636 |
|
|
2668 |
SearchData * const Data) |
SearchData * const Data) |
2669 |
{ |
{ |
2670 |
|
|
2671 |
int i, mask; |
int i; |
|
int quarterpel = (pParam->vol_flags & XVID_VOL_QUARTERPEL)? 1: 0; |
|
2672 |
VECTOR pmv[3]; |
VECTOR pmv[3]; |
2673 |
MACROBLOCK * const pMB = &pMBs[x + y * pParam->mb_width]; |
MACROBLOCK * const pMB = &pMBs[x + y * pParam->mb_width]; |
2674 |
|
|
2675 |
|
unsigned int simplicity = 0; |
2676 |
|
|
2677 |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
2678 |
|
|
2679 |
|
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 4, |
2680 |
|
pParam->width, pParam->height, Data->iFcode - Data->qpel - 1, 0, 0); |
2681 |
|
|
2682 |
|
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
2683 |
|
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
2684 |
|
|
2685 |
|
pmv[0].x = pMB->mvs[0].x; |
2686 |
|
pmv[0].y = pMB->mvs[0].y; |
2687 |
|
|
2688 |
|
CheckCandidate32I(pmv[0].x, pmv[0].y, Data, 0); |
2689 |
|
|
2690 |
|
if (*Data->iMinSAD > 200) { |
2691 |
|
|
2692 |
|
pmv[1].x = pmv[1].y = 0; |
2693 |
|
|
2694 |
/* 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 */ |
2695 |
if (x == 1 && y == 1) Data->predMV.x = Data->predMV.y = 0; |
if (x == 1 && y == 1) Data->predMV.x = Data->predMV.y = 0; |
2696 |
else |
else |
2700 |
Data->predMV = (pMB - 1)->mvs[0]; /* left instead of median */ |
Data->predMV = (pMB - 1)->mvs[0]; /* left instead of median */ |
2701 |
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 */ |
2702 |
|
|
2703 |
get_range(&Data->min_dx, &Data->max_dx, &Data->min_dy, &Data->max_dy, x, y, 16, |
pmv[2].x = Data->predMV.x; |
2704 |
pParam->width, pParam->height, Data->iFcode - quarterpel, 0, 0); |
pmv[2].y = Data->predMV.y; |
|
|
|
|
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
|
|
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
|
|
|
|
|
pmv[1].x = EVEN(pMB->mvs[0].x); |
|
|
pmv[1].y = EVEN(pMB->mvs[0].y); |
|
|
pmv[2].x = EVEN(Data->predMV.x); |
|
|
pmv[2].y = EVEN(Data->predMV.y); |
|
|
pmv[0].x = pmv[0].y = 0; |
|
|
|
|
|
CheckCandidate32I(0, 0, 255, &i, Data); |
|
|
|
|
|
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
|
|
|
|
|
if (!(mask = make_mask(pmv, 1))) |
|
|
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); |
|
2705 |
|
|
2706 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) /* diamond only if needed */ |
if (!vector_repeats(pmv, 1)) |
2707 |
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, i); |
CheckCandidate32I(pmv[1].x, pmv[1].y, Data, 1); |
2708 |
} |
if (!vector_repeats(pmv, 2)) |
2709 |
|
CheckCandidate32I(pmv[2].x, pmv[2].y, Data, 2); |
2710 |
|
|
2711 |
|
if (*Data->iMinSAD > 500) { /* diamond only if needed */ |
2712 |
|
unsigned int mask = make_mask(pmv, 3, *Data->dir); |
2713 |
|
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, mask, CheckCandidate32I); |
2714 |
|
} else simplicity++; |
2715 |
|
|
2716 |
|
if (*Data->iMinSAD > 500) /* refinement from 2-pixel to 1-pixel */ |
2717 |
|
SubpelRefine(Data, CheckCandidate32I); |
2718 |
|
else simplicity++; |
2719 |
|
} else simplicity++; |
2720 |
|
|
2721 |
for (i = 0; i < 4; i++) { |
for (i = 0; i < 4; i++) { |
2722 |
MACROBLOCK * MB = &pMBs[x + (i&1) + (y+(i>>1)) * pParam->mb_width]; |
MACROBLOCK * MB = &pMBs[x + (i&1) + (y+(i>>1)) * pParam->mb_width]; |
2723 |
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]; |
2724 |
MB->mode = MODE_INTER; |
MB->mode = MODE_INTER; |
2725 |
MB->sad16 = Data->iMinSAD[i+1]; |
/* if we skipped some search steps, we have to assume that SAD would be lower with them */ |
2726 |
|
MB->sad16 = Data->iMinSAD[i+1] - (simplicity<<7); |
2727 |
} |
} |
2728 |
} |
} |
2729 |
|
|
2730 |
#define INTRA_THRESH 2200 |
#define INTRA_THRESH 2200 |
2731 |
#define INTER_THRESH 50 |
#define INTER_THRESH 40 |
2732 |
#define INTRA_THRESH2 95 |
#define INTRA_THRESH2 95 |
2733 |
|
|
2734 |
int |
int |
2749 |
int complexity = 0; |
int complexity = 0; |
2750 |
|
|
2751 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
2752 |
|
uint32_t dir; |
2753 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
2754 |
SearchData Data; |
SearchData Data; |
2755 |
Data.iEdgedWidth = pParam->edged_width; |
Data.iEdgedWidth = pParam->edged_width; |
2757 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
2758 |
Data.iFcode = Current->fcode; |
Data.iFcode = Current->fcode; |
2759 |
Data.temp = temp; |
Data.temp = temp; |
2760 |
CheckCandidate = CheckCandidate32I; |
Data.dir = &dir; |
2761 |
|
Data.qpel = (pParam->vol_flags & XVID_VOL_QUARTERPEL)? 1: 0; |
2762 |
|
Data.qpel_precision = 0; |
2763 |
|
|
2764 |
if (intraCount != 0) { |
if (intraCount != 0) { |
2765 |
if (intraCount < 10) // we're right after an I frame |
if (intraCount < 10) // we're right after an I frame |
2769 |
IntraThresh -= (IntraThresh * (maxIntra - 8*(maxIntra - intraCount)))/maxIntra; |
IntraThresh -= (IntraThresh * (maxIntra - 8*(maxIntra - intraCount)))/maxIntra; |
2770 |
} |
} |
2771 |
|
|
2772 |
InterThresh -= 12 * bCount; |
InterThresh -= 20 * bCount; |
2773 |
if (InterThresh < 15 + b_thresh) InterThresh = 15 + b_thresh; |
if (InterThresh < 10 + b_thresh) InterThresh = 10 + b_thresh; |
2774 |
|
|
2775 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
2776 |
|
|
2795 |
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, |
2796 |
pParam->edged_width); |
pParam->edged_width); |
2797 |
|
|
2798 |
complexity += dev; |
complexity += MAX(dev, 300); |
2799 |
if (dev + IntraThresh < pMB->sad16) { |
if (dev + IntraThresh < pMB->sad16) { |
2800 |
pMB->mode = MODE_INTRA; |
pMB->mode = MODE_INTRA; |
2801 |
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; |
2802 |
} |
} |
2803 |
|
|
2804 |
if (pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
if (pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
2805 |
if (dev > 500 && pMB->sad16 < 1000) |
if (dev > 1000 && pMB->sad16 < 1000) |
2806 |
sSAD += 1000; |
sSAD += 1000; |
2807 |
|
|
2808 |
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 */ |
2809 |
} |
} |
2810 |
} |
} |
2811 |
} |
} |
2813 |
|
|
2814 |
sSAD /= complexity + 4*blocks; |
sSAD /= complexity + 4*blocks; |
2815 |
|
|
2816 |
if (intraCount > 12 && sSAD > INTRA_THRESH2 ) return I_VOP; |
if (intraCount > 80 && sSAD > INTRA_THRESH2 ) return I_VOP; |
2817 |
if (sSAD > InterThresh ) return P_VOP; |
if (sSAD > InterThresh ) return P_VOP; |
2818 |
emms(); |
emms(); |
2819 |
return B_VOP; |
return B_VOP; |
2823 |
/* functions which perform BITS-based search/bitcount */ |
/* functions which perform BITS-based search/bitcount */ |
2824 |
|
|
2825 |
static int |
static int |
2826 |
CountMBBitsInter(SearchData * const Data, |
findRDinter(SearchData * const Data, |
2827 |
const MACROBLOCK * const pMBs, const int x, const int y, |
const MACROBLOCK * const pMBs, const int x, const int y, |
2828 |
const MBParam * const pParam, |
const MBParam * const pParam, |
2829 |
const uint32_t MotionFlags) |
const uint32_t MotionFlags) |
2830 |
{ |
{ |
2831 |
int i, iDirection; |
int i; |
2832 |
int32_t bsad[5]; |
int32_t bsad[5]; |
2833 |
|
|
|
CheckCandidate = CheckCandidateBits16; |
|
|
|
|
2834 |
if (Data->qpel) { |
if (Data->qpel) { |
2835 |
for(i = 0; i < 5; i++) { |
for(i = 0; i < 5; i++) { |
2836 |
Data->currentMV[i].x = Data->currentQMV[i].x/2; |
Data->currentMV[i].x = Data->currentQMV[i].x/2; |
2837 |
Data->currentMV[i].y = Data->currentQMV[i].y/2; |
Data->currentMV[i].y = Data->currentQMV[i].y/2; |
2838 |
} |
} |
2839 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2840 |
CheckCandidateBits16(Data->currentQMV[0].x, Data->currentQMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentQMV[0].x, Data->currentQMV[0].y, Data, 255); |
2841 |
|
|
2842 |
if (MotionFlags & (XVID_ME_HALFPELREFINE16_RD | XVID_ME_EXTSEARCH_RD)) { /* we have to prepare for halfpixel-precision search */ |
if (MotionFlags & (XVID_ME_HALFPELREFINE16_RD | XVID_ME_EXTSEARCH_RD)) { /* we have to prepare for halfpixel-precision search */ |
2843 |
for(i = 0; i < 5; i++) bsad[i] = Data->iMinSAD[i]; |
for(i = 0; i < 5; i++) bsad[i] = Data->iMinSAD[i]; |
2844 |
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, |
2845 |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - Data->qpel, 1, Data->rrv); |
2846 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
2847 |
if (Data->currentQMV->x & 1 || Data->currentQMV->y & 1) |
if (Data->currentQMV->x & 1 || Data->currentQMV->y & 1) |
2848 |
CheckCandidateBits16(Data->currentMV[0].x, Data->currentMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
2849 |
} |
} |
2850 |
|
|
2851 |
} else { /* not qpel */ |
} else { /* not qpel */ |
2852 |
|
|
2853 |
CheckCandidateBits16(Data->currentMV[0].x, Data->currentMV[0].y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
2854 |
} |
} |
2855 |
|
|
2856 |
if (MotionFlags&XVID_ME_EXTSEARCH_RD) SquareSearch(Data->currentMV->x, Data->currentMV->y, Data, iDirection); |
if (MotionFlags&XVID_ME_EXTSEARCH_RD) |
2857 |
|
SquareSearch(Data->currentMV->x, Data->currentMV->y, Data, 255, CheckCandidateRD16); |
2858 |
|
|
2859 |
if (MotionFlags&XVID_ME_HALFPELREFINE16_RD) SubpelRefine(Data); |
if (MotionFlags&XVID_ME_HALFPELREFINE16_RD) |
2860 |
|
SubpelRefine(Data, CheckCandidateRD16); |
2861 |
|
|
2862 |
if (Data->qpel) { |
if (Data->qpel) { |
2863 |
if (MotionFlags&(XVID_ME_EXTSEARCH_RD | XVID_ME_HALFPELREFINE16_RD)) { /* there was halfpel-precision search */ |
if (MotionFlags&(XVID_ME_EXTSEARCH_RD | XVID_ME_HALFPELREFINE16_RD)) { /* there was halfpel-precision search */ |
2868 |
|
|
2869 |
/* preparing for qpel-precision search */ |
/* preparing for qpel-precision search */ |
2870 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
2871 |
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, |
2872 |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
pParam->width, pParam->height, Data->iFcode, 2, 0); |
2873 |
} |
} |
2874 |
if (MotionFlags&XVID_ME_QUARTERPELREFINE16_RD) SubpelRefine(Data); |
if (MotionFlags&XVID_ME_QUARTERPELREFINE16_RD) |
2875 |
|
SubpelRefine(Data, CheckCandidateRD16); |
2876 |
} |
} |
2877 |
|
|
2878 |
if (MotionFlags&XVID_ME_CHECKPREDICTION_RD) { /* let's check vector equal to prediction */ |
if (MotionFlags&XVID_ME_CHECKPREDICTION_RD) { /* let's check vector equal to prediction */ |
2879 |
VECTOR * v = Data->qpel ? Data->currentQMV : Data->currentMV; |
VECTOR * v = Data->qpel ? Data->currentQMV : Data->currentMV; |
2880 |
if (!(Data->predMV.x == v->x && Data->predMV.y == v->y)) |
if (!(Data->predMV.x == v->x && Data->predMV.y == v->y)) |
2881 |
CheckCandidateBits16(Data->predMV.x, Data->predMV.y, 255, &iDirection, Data); |
CheckCandidateRD16(Data->predMV.x, Data->predMV.y, Data, 255); |
2882 |
} |
} |
2883 |
return Data->iMinSAD[0]; |
return Data->iMinSAD[0]; |
2884 |
} |
} |
2885 |
|
|
2886 |
static int |
static int |
2887 |
CountMBBitsInter4v(const SearchData * const Data, |
findRDinter4v(const SearchData * const Data, |
2888 |
MACROBLOCK * const pMB, const MACROBLOCK * const pMBs, |
MACROBLOCK * const pMB, const MACROBLOCK * const pMBs, |
2889 |
const int x, const int y, |
const int x, const int y, |
2890 |
const MBParam * const pParam, const uint32_t MotionFlags, |
const MBParam * const pParam, const uint32_t MotionFlags, |
2891 |
const VECTOR * const backup) |
const VECTOR * const backup) |
2892 |
{ |
{ |
2893 |
|
|
2894 |
int cbp = 0, bits = 0, t = 0, i, iDirection; |
int cbp = 0, bits = 0, t = 0, i; |
2895 |
SearchData Data2, *Data8 = &Data2; |
SearchData Data2, *Data8 = &Data2; |
2896 |
int sumx = 0, sumy = 0; |
int sumx = 0, sumy = 0; |
2897 |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
2898 |
uint8_t * ptr; |
uint8_t * ptr; |
2899 |
|
|
2900 |
memcpy(Data8, Data, sizeof(SearchData)); |
memcpy(Data8, Data, sizeof(SearchData)); |
|
CheckCandidate = CheckCandidateBits8; |
|
2901 |
|
|
2902 |
for (i = 0; i < 4; i++) { /* for all luma blocks */ |
for (i = 0; i < 4; i++) { /* for all luma blocks */ |
2903 |
|
|
2910 |
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); |
2911 |
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); |
2912 |
*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; |
|
2913 |
|
|
2914 |
if(Data->qpel) { |
if(Data->qpel) { |
2915 |
Data8->predMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, i); |
Data8->predMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, i); |
2921 |
Data8->predMV, Data8->iFcode, 0, 0); |
Data8->predMV, Data8->iFcode, 0, 0); |
2922 |
} |
} |
2923 |
|
|
2924 |
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, |
2925 |
pParam->width, pParam->height, Data8->iFcode, Data8->qpel, 0); |
pParam->width, pParam->height, Data8->iFcode, Data8->qpel+1, 0); |
2926 |
|
|
2927 |
*Data8->iMinSAD += BITS_MULT*t; |
*Data8->iMinSAD += BITS_MULT*t; |
2928 |
|
|
2931 |
{ |
{ |
2932 |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
2933 |
if (!MVequal (*v, backup[i+1]) ) |
if (!MVequal (*v, backup[i+1]) ) |
2934 |
CheckCandidateBits8(backup[i+1].x, backup[i+1].y, 255, &iDirection, Data8); |
CheckCandidateRD8(backup[i+1].x, backup[i+1].y, Data8, 255); |
2935 |
} |
} |
2936 |
|
|
2937 |
if (Data8->qpel) { |
if (Data8->qpel) { |
2940 |
Data8->currentMV->x = Data8->currentQMV->x/2; |
Data8->currentMV->x = Data8->currentQMV->x/2; |
2941 |
Data8->currentMV->y = Data8->currentQMV->y/2; |
Data8->currentMV->y = Data8->currentQMV->y/2; |
2942 |
Data8->qpel_precision = 0; |
Data8->qpel_precision = 0; |
2943 |
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, |
2944 |
pParam->width, pParam->height, Data8->iFcode - 1, 0, 0); |
pParam->width, pParam->height, Data8->iFcode - 1, 1, 0); |
2945 |
|
|
2946 |
if (Data8->currentQMV->x & 1 || Data8->currentQMV->y & 1) |
if (Data8->currentQMV->x & 1 || Data8->currentQMV->y & 1) |
2947 |
CheckCandidateBits8(Data8->currentMV->x, Data8->currentMV->y, 255, &iDirection, Data8); |
CheckCandidateRD8(Data8->currentMV->x, Data8->currentMV->y, Data8, 255); |
2948 |
|
|
2949 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) |
2950 |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255); |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255, CheckCandidateRD8); |
2951 |
|
|
2952 |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
2953 |
SubpelRefine(Data8); |
SubpelRefine(Data8, CheckCandidateRD8); |
2954 |
|
|
2955 |
if(s > *Data8->iMinSAD) { /* we have found a better match */ |
if(s > *Data8->iMinSAD) { /* we have found a better match */ |
2956 |
Data8->currentQMV->x = 2*Data8->currentMV->x; |
Data8->currentQMV->x = 2*Data8->currentMV->x; |
2958 |
} |
} |
2959 |
|
|
2960 |
Data8->qpel_precision = 1; |
Data8->qpel_precision = 1; |
2961 |
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, |
2962 |
pParam->width, pParam->height, Data8->iFcode, 1, 0); |
pParam->width, pParam->height, Data8->iFcode, 2, 0); |
2963 |
|
|
2964 |
} |
} |
2965 |
if (MotionFlags & XVID_ME_QUARTERPELREFINE8_RD) SubpelRefine(Data8); |
if (MotionFlags & XVID_ME_QUARTERPELREFINE8_RD) |
2966 |
|
SubpelRefine(Data8, CheckCandidateRD8); |
2967 |
|
|
2968 |
} else { /* not qpel */ |
} else { /* not qpel */ |
2969 |
|
|
2970 |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) /* extsearch */ |
if (MotionFlags & XVID_ME_EXTSEARCH8 && MotionFlags & XVID_ME_EXTSEARCH_RD) /* extsearch */ |
2971 |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255); |
SquareSearch(Data8->currentMV->x, Data8->currentMV->x, Data8, 255, CheckCandidateRD8); |
2972 |
|
|
2973 |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
if (MotionFlags & XVID_ME_HALFPELREFINE8_RD) |
2974 |
SubpelRefine(Data8); /* halfpel refinement */ |
SubpelRefine(Data8, CheckCandidateRD8); /* halfpel refinement */ |
2975 |
} |
} |
2976 |
|
|
2977 |
/* checking vector equal to predicion */ |
/* checking vector equal to predicion */ |
2978 |
if (i != 0 && MotionFlags & XVID_ME_CHECKPREDICTION_RD) { |
if (i != 0 && MotionFlags & XVID_ME_CHECKPREDICTION_RD) { |
2979 |
const VECTOR * v = Data->qpel ? Data8->currentQMV : Data8->currentMV; |
const VECTOR * v = Data->qpel ? Data8->currentQMV : Data8->currentMV; |
2980 |
if (!MVequal(*v, Data8->predMV)) |
if (!MVequal(*v, Data8->predMV)) |
2981 |
CheckCandidateBits8(Data8->predMV.x, Data8->predMV.y, 255, &iDirection, Data8); |
CheckCandidateRD8(Data8->predMV.x, Data8->predMV.y, Data8, 255); |
2982 |
} |
} |
2983 |
|
|
2984 |
bits += *Data8->iMinSAD; |
bits += *Data8->iMinSAD; |
3028 |
} |
} |
3029 |
|
|
3030 |
static int |
static int |
3031 |
CountMBBitsIntra(const SearchData * const Data) |
findRDintra(const SearchData * const Data) |
3032 |
{ |
{ |
3033 |
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 */ |
3034 |
int cbp = 0, i, dc = 0; |
int cbp = 0, i, dc = 0; |
3060 |
} |
} |
3061 |
|
|
3062 |
static int |
static int |
3063 |
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) |
3064 |
{ |
{ |
3065 |
int bits = BITS_MULT*1; /* this one is mcsel */ |
int bits = BITS_MULT*1; /* this one is mcsel */ |
3066 |
int cbp = 0, i; |
int cbp = 0, i; |
3115 |
|
|
3116 |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
Data->predMV = get_pmv2(pMBs, pParam->mb_width, 0, x, y, 0); |
3117 |
|
|
3118 |
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, |
3119 |
pParam->width, pParam->height, 16, 0, 0); |
pParam->width, pParam->height, 16, 1, 0); |
3120 |
|
|
3121 |
Data->Cur = pCur + 16*(x + y * pParam->edged_width); |
Data->Cur = pCur + 16*(x + y * pParam->edged_width); |
3122 |
Data->RefP[0] = pRef + 16*(x + y * pParam->edged_width); |
Data->RefP[0] = pRef + 16*(x + y * pParam->edged_width); |
3125 |
Data->RefP[3] = pRefHV + 16*(x + y * pParam->edged_width); |
Data->RefP[3] = pRefHV + 16*(x + y * pParam->edged_width); |
3126 |
|
|
3127 |
Data->currentMV[0].x = Data->currentMV[0].y = 0; |
Data->currentMV[0].x = Data->currentMV[0].y = 0; |
3128 |
CheckCandidate16I(0, 0, 255, &i, Data); |
CheckCandidate16I(0, 0, Data, 255); |
3129 |
|
|
3130 |
if ( (Data->predMV.x !=0) || (Data->predMV.y != 0) ) |
if ( (Data->predMV.x !=0) || (Data->predMV.y != 0) ) |
3131 |
CheckCandidate16I(Data->predMV.x, Data->predMV.y, 255, &i, Data); |
CheckCandidate16I(Data->predMV.x, Data->predMV.y, Data, 255); |
3132 |
|
|
3133 |
AdvDiamondSearch(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255); |
DiamondSearch(Data->currentMV[0].x, Data->currentMV[0].y, Data, 255, CheckCandidate16I); |
3134 |
|
|
3135 |
SubpelRefine(Data); |
SubpelRefine(Data, CheckCandidate16I); |
3136 |
|
|
3137 |
|
|
3138 |
/* for QPel halfpel positions are worse than in halfpel mode :( */ |
/* for QPel halfpel positions are worse than in halfpel mode :( */ |
3140 |
Data->currentQMV->x = 2*Data->currentMV->x; |
Data->currentQMV->x = 2*Data->currentMV->x; |
3141 |
Data->currentQMV->y = 2*Data->currentMV->y; |
Data->currentQMV->y = 2*Data->currentMV->y; |
3142 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
3143 |
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, |
3144 |
pParam->width, pParam->height, iFcode, 1, 0); |
pParam->width, pParam->height, iFcode, 2, 0); |
3145 |
SubpelRefine(Data); |
SubpelRefine(Data); |
3146 |
} |
} |
3147 |
*/ |
*/ |
3168 |
|
|
3169 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
3170 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
3171 |
|
uint32_t dir; |
3172 |
SearchData Data; |
SearchData Data; |
3173 |
memset(&Data, 0, sizeof(SearchData)); |
memset(&Data, 0, sizeof(SearchData)); |
3174 |
|
|
3179 |
Data.iMinSAD = &iMinSAD[0]; |
Data.iMinSAD = &iMinSAD[0]; |
3180 |
Data.iFcode = current->fcode; |
Data.iFcode = current->fcode; |
3181 |
Data.temp = temp; |
Data.temp = temp; |
3182 |
|
Data.dir = &dir; |
|
CheckCandidate = CheckCandidate16I; |
|
3183 |
|
|
3184 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
3185 |
|
|
3186 |
for (y = 0; y < pParam->mb_height; y ++) { |
for (y = 0; y < pParam->mb_height; y ++) { |
3187 |
for (x = 0; x < pParam->mb_width; x ++) { |
for (x = 0; x < pParam->mb_width; x ++) { |
|
|
|
3188 |
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); |
3189 |
} |
} |
3190 |
} |
} |