20 |
* along with this program ; if not, write to the Free Software |
* along with this program ; if not, write to the Free Software |
21 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
22 |
* |
* |
23 |
* $Id: estimation_rd_based.c,v 1.1.2.7 2003-10-07 13:02:35 edgomez Exp $ |
* $Id: estimation_rd_based.c,v 1.1.2.8 2003-10-11 16:36:10 syskin Exp $ |
24 |
* |
* |
25 |
****************************************************************************/ |
****************************************************************************/ |
26 |
|
|
87 |
} |
} |
88 |
|
|
89 |
static __inline unsigned int |
static __inline unsigned int |
90 |
Block_CalcBitsIntra(int16_t * const coeff, |
Block_CalcBitsIntra(MACROBLOCK * pMB, |
91 |
int16_t * const data, |
const unsigned int x, |
92 |
int16_t * const dqcoeff, |
const unsigned int y, |
93 |
const uint32_t quant, const int quant_type, |
const unsigned int mb_width, |
94 |
uint32_t * cbp, |
const uint32_t block, |
95 |
const int block, |
int16_t coeff[64], |
96 |
int * dcpred, |
int16_t qcoeff[64], |
97 |
const uint16_t * scan_table) |
int16_t dqcoeff[64], |
98 |
{ |
int16_t predictors[8], |
99 |
int bits, i; |
const uint32_t quant, |
100 |
int distortion = 0; |
const int quant_type, |
101 |
uint32_t iDcScaler = get_dc_scaler(quant, block < 4); |
unsigned int bits[2], |
102 |
int b_dc; |
unsigned int cbp[2]) |
103 |
|
{ |
104 |
|
int direction; |
105 |
|
int16_t *pCurrent; |
106 |
|
unsigned int i, coded; |
107 |
|
unsigned int distortion = 0; |
108 |
|
const uint32_t iDcScaler = get_dc_scaler(quant, block < 4); |
109 |
|
|
110 |
|
fdct(coeff); |
111 |
|
|
112 |
|
if (quant_type) { |
113 |
|
quant_h263_intra(qcoeff, coeff, quant, iDcScaler); |
114 |
|
dequant_h263_intra(dqcoeff, qcoeff, quant, iDcScaler); |
115 |
|
} else { |
116 |
|
quant_mpeg_intra(qcoeff, coeff, quant, iDcScaler); |
117 |
|
dequant_mpeg_intra(dqcoeff, qcoeff, quant, iDcScaler); |
118 |
|
} |
119 |
|
|
120 |
fdct(data); |
predict_acdc(pMB-(x+mb_width*y), x, y, mb_width, block, qcoeff, |
121 |
data[0] -= 1024; |
quant, iDcScaler, predictors, 0); |
122 |
|
|
123 |
if (quant_type) quant_h263_intra(coeff, data, quant, iDcScaler); |
direction = pMB->acpred_directions[block]; |
124 |
else quant_mpeg_intra(coeff, data, quant, iDcScaler); |
pCurrent = pMB->pred_values[block]; |
125 |
|
|
126 |
b_dc = coeff[0]; |
/* store current coeffs to pred_values[] for future prediction */ |
127 |
if (block < 4) { |
pCurrent[0] = qcoeff[0] * iDcScaler; |
128 |
coeff[0] -= *dcpred; |
for (i = 1; i < 8; i++) { |
129 |
*dcpred = b_dc; |
pCurrent[i] = qcoeff[i]; |
130 |
|
pCurrent[i + 7] = qcoeff[i * 8]; |
131 |
} |
} |
132 |
|
|
133 |
bits = BITS_MULT*CodeCoeffIntra_CalcBits(coeff, scan_table); |
/* dc prediction */ |
134 |
if (bits != 0) *cbp |= 1 << (5 - block); |
qcoeff[0] = qcoeff[0] - predictors[0]; |
135 |
|
|
136 |
|
if (block < 4) bits[1] = bits[0] = dcy_tab[qcoeff[0] + 255].len; |
137 |
|
else bits[1] = bits[0] = dcc_tab[qcoeff[0] + 255].len; |
138 |
|
|
139 |
|
/* calc cost before ac prediction */ |
140 |
|
bits[0] += coded = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[0]); |
141 |
|
if (coded > 0) cbp[0] |= 1 << (5 - block); |
142 |
|
|
143 |
if (block < 4) bits += BITS_MULT*dcy_tab[coeff[0] + 255].len; |
/* apply ac prediction & calc cost*/ |
144 |
else bits += BITS_MULT*dcc_tab[coeff[0] + 255].len; |
if (direction == 1) { |
145 |
|
for (i = 1; i < 8; i++) { |
146 |
|
qcoeff[i] -= predictors[i]; |
147 |
|
predictors[i] = qcoeff[i]; |
148 |
|
} |
149 |
|
} else { /* acpred_direction == 2 */ |
150 |
|
for (i = 1; i < 8; i++) { |
151 |
|
qcoeff[i*8] -= predictors[i]; |
152 |
|
predictors[i] = qcoeff[i*8]; |
153 |
|
} |
154 |
|
} |
155 |
|
|
156 |
coeff[0] = b_dc; |
bits[1] += coded = CodeCoeffIntra_CalcBits(qcoeff, scan_tables[direction]); |
157 |
if (quant_type) dequant_h263_intra(dqcoeff, coeff, quant, iDcScaler); |
if (coded > 0) cbp[1] |= 1 << (5 - block); |
|
else dequant_mpeg_intra(dqcoeff, coeff, quant, iDcScaler); |
|
158 |
|
|
159 |
for (i = 0; i < 64; i++) |
for (i = 0; i < 64; i++) |
160 |
distortion += (data[i] - dqcoeff[i])*(data[i] - dqcoeff[i]); |
distortion += (coeff[i] - dqcoeff[i])*(coeff[i] - dqcoeff[i]); |
161 |
|
|
162 |
|
|
163 |
|
return (LAMBDA*distortion)/(quant*quant); |
164 |
|
|
|
return bits + (LAMBDA*distortion)/(quant*quant); |
|
165 |
} |
} |
166 |
|
|
167 |
|
|
168 |
|
|
169 |
static void |
static void |
170 |
CheckCandidateRD16(const int x, const int y, const SearchData * const data, const unsigned int Direction) |
CheckCandidateRD16(const int x, const int y, const SearchData * const data, const unsigned int Direction) |
171 |
{ |
{ |
475 |
} |
} |
476 |
|
|
477 |
static int |
static int |
478 |
findRD_intra(const SearchData * const Data) |
findRD_intra(const SearchData * const Data, MACROBLOCK * pMB, |
479 |
|
const int x, const int y, const int mb_width) |
480 |
{ |
{ |
481 |
int bits = BITS_MULT*1; /* this one is ac/dc prediction flag bit */ |
int cbp[2] = {0, 0}, bits[2], i; |
482 |
int cbp = 0, i, dc = 0; |
int bits1 = BITS_MULT*1, bits2 = BITS_MULT*1; /* this one is ac/dc prediction flag bit */ |
483 |
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64; |
int distortion = 0; |
484 |
|
|
485 |
|
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64, * dqcoeff = Data->dctSpace + 128; |
486 |
|
const uint32_t iQuant = Data->iQuant; |
487 |
|
int16_t predictors[6][8]; |
488 |
|
|
489 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
490 |
int s = 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
int s = 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
491 |
transfer_8to16copy(in, Data->Cur + s, Data->iEdgedWidth); |
transfer_8to16copy(in, Data->Cur + s, Data->iEdgedWidth); |
|
bits += Block_CalcBitsIntra(coeff, in, Data->dctSpace + 128, Data->iQuant, Data->quant_type, &cbp, i, &dc, Data->scan_table); |
|
492 |
|
|
493 |
if (bits >= Data->iMinSAD[0]) return bits; |
|
494 |
|
distortion = Block_CalcBitsIntra(pMB, x, y, mb_width, i, in, coeff, dqcoeff, |
495 |
|
predictors[i], iQuant, Data->quant_type, bits, cbp); |
496 |
|
bits1 += distortion + BITS_MULT * bits[0]; |
497 |
|
bits2 += distortion + BITS_MULT * bits[1]; |
498 |
|
|
499 |
|
if (bits1 >= Data->iMinSAD[0] && bits2 >= Data->iMinSAD[0]) |
500 |
|
return bits1; |
501 |
} |
} |
502 |
|
|
503 |
bits += BITS_MULT*xvid_cbpy_tab[cbp>>2].len; |
bits1 += BITS_MULT*xvid_cbpy_tab[cbp[0]>>2].len; |
504 |
|
bits2 += BITS_MULT*xvid_cbpy_tab[cbp[1]>>2].len; |
505 |
|
|
506 |
/*chroma U */ |
/*chroma U */ |
507 |
transfer_8to16copy(in, Data->CurU, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurU, Data->iEdgedWidth/2); |
508 |
bits += Block_CalcBitsIntra(coeff, in, Data->dctSpace + 128, Data->iQuant, Data->quant_type, &cbp, 4, &dc, Data->scan_table); |
distortion = Block_CalcBitsIntra(pMB, x, y, mb_width, 4, in, coeff, dqcoeff, |
509 |
|
predictors[4], iQuant, Data->quant_type, bits, cbp); |
510 |
|
bits1 += distortion + BITS_MULT * bits[0]; |
511 |
|
bits2 += distortion + BITS_MULT * bits[1]; |
512 |
|
|
513 |
if (bits >= Data->iMinSAD[0]) return bits; |
if (bits1 >= Data->iMinSAD[0] && bits2 >= Data->iMinSAD[0]) |
514 |
|
return bits1; |
515 |
|
|
516 |
/* chroma V */ |
/* chroma V */ |
517 |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
518 |
bits += Block_CalcBitsIntra(coeff, in, Data->dctSpace + 128, Data->iQuant, Data->quant_type, &cbp, 5, &dc, Data->scan_table); |
distortion = Block_CalcBitsIntra(pMB, x, y, mb_width, 5, in, coeff, dqcoeff, |
519 |
|
predictors[5], iQuant, Data->quant_type, bits, cbp); |
520 |
|
|
521 |
bits += BITS_MULT*mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp & 3) << 3)].len; |
bits1 += distortion + BITS_MULT * bits[0]; |
522 |
|
bits2 += distortion + BITS_MULT * bits[1]; |
523 |
|
|
524 |
return bits; |
bits1 += BITS_MULT*mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp[0] & 3) << 3)].len; |
525 |
|
bits2 += BITS_MULT*mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp[1] & 3) << 3)].len; |
526 |
|
|
527 |
|
*Data->cbp = bits1 <= bits2 ? cbp[0] : cbp[1]; |
528 |
|
|
529 |
|
return MIN(bits1, bits2); |
530 |
} |
} |
531 |
|
|
532 |
|
|
533 |
static int |
static int |
534 |
findRD_gmc(const SearchData * const Data, const IMAGE * const vGMC, const int x, const int y) |
findRD_gmc(const SearchData * const Data, const IMAGE * const vGMC, const int x, const int y) |
535 |
{ |
{ |
622 |
} |
} |
623 |
} |
} |
624 |
|
|
625 |
intra_rd = findRD_intra(Data); |
intra_rd = findRD_intra(Data, pMB, x, y, pParam->mb_width); |
626 |
if (intra_rd < min_rd) { |
if (intra_rd < min_rd) { |
627 |
*Data->iMinSAD = min_rd = intra_rd; |
*Data->iMinSAD = min_rd = intra_rd; |
628 |
mode = MODE_INTRA; |
mode = MODE_INTRA; |
629 |
|
cbp = *Data->cbp; |
630 |
} |
} |
631 |
|
|
632 |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = 0; |
pMB->sad16 = pMB->sad8[0] = pMB->sad8[1] = pMB->sad8[2] = pMB->sad8[3] = 0; |
881 |
} |
} |
882 |
} |
} |
883 |
|
|
884 |
intra_rd = findRD_intra(Data); |
intra_rd = findRD_intra(Data, pMB, x, y, pParam->mb_width); |
885 |
if (intra_rd < min_rd) { |
if (intra_rd < min_rd) { |
886 |
*Data->iMinSAD = min_rd = intra_rd; |
*Data->iMinSAD = min_rd = intra_rd; |
887 |
mode = MODE_INTRA; |
mode = MODE_INTRA; |