81 |
static __inline uint32_t |
static __inline uint32_t |
82 |
d_mv_bits(int x, int y, const VECTOR pred, const uint32_t iFcode, const int qpel, const int rrv) |
d_mv_bits(int x, int y, const VECTOR pred, const uint32_t iFcode, const int qpel, const int rrv) |
83 |
{ |
{ |
84 |
int xb, yb; |
int bits; |
85 |
x = qpel ? x<<1 : x; |
const int q = (1 << (iFcode - 1)) - 1; |
86 |
y = qpel ? y<<1 : y; |
|
87 |
|
x <<= qpel; |
88 |
|
y <<= qpel; |
89 |
if (rrv) { x = RRV_MV_SCALEDOWN(x); y = RRV_MV_SCALEDOWN(y); } |
if (rrv) { x = RRV_MV_SCALEDOWN(x); y = RRV_MV_SCALEDOWN(y); } |
90 |
|
|
91 |
x -= pred.x; |
x -= pred.x; |
92 |
y -= pred.y; |
bits = (x != 0 ? iFcode:0); |
93 |
|
x = abs(x); |
94 |
if (x) { |
x += q; |
|
x = ABS(x); |
|
|
x += (1 << (iFcode - 1)) - 1; |
|
95 |
x >>= (iFcode - 1); |
x >>= (iFcode - 1); |
96 |
if (x > 32) x = 32; |
bits += mvtab[x]; |
97 |
xb = mvtab[x] + iFcode; |
|
98 |
} else xb = 1; |
y -= pred.y; |
99 |
|
bits += (y != 0 ? iFcode:0); |
100 |
if (y) { |
y = abs(y); |
101 |
y = ABS(y); |
y += q; |
|
y += (1 << (iFcode - 1)) - 1; |
|
102 |
y >>= (iFcode - 1); |
y >>= (iFcode - 1); |
103 |
if (y > 32) y = 32; |
bits += mvtab[y]; |
104 |
yb = mvtab[y] + iFcode; |
|
105 |
} else yb = 1; |
return bits; |
|
return xb + yb; |
|
106 |
} |
} |
107 |
|
|
108 |
static int32_t ChromaSAD2(int fx, int fy, int bx, int by, const SearchData * const data) |
static int32_t ChromaSAD2(const int fx, const int fy, const int bx, const int by, |
109 |
|
const SearchData * const data) |
110 |
{ |
{ |
111 |
int sad; |
int sad; |
112 |
const uint32_t stride = data->iEdgedWidth/2; |
const uint32_t stride = data->iEdgedWidth/2; |
114 |
* f_refv = data->RefQ + 8, |
* f_refv = data->RefQ + 8, |
115 |
* b_refu = data->RefQ + 16, |
* b_refu = data->RefQ + 16, |
116 |
* b_refv = data->RefQ + 24; |
* b_refv = data->RefQ + 24; |
117 |
|
int offset = (fx>>1) + (fy>>1)*stride; |
118 |
|
|
119 |
switch (((fx & 1) << 1) | (fy & 1)) { |
switch (((fx & 1) << 1) | (fy & 1)) { |
120 |
case 0: |
case 0: |
121 |
fx = fx / 2; fy = fy / 2; |
f_refu = (uint8_t*)data->RefP[4] + offset; |
122 |
f_refu = (uint8_t*)data->RefCU + fy * stride + fx, stride; |
f_refv = (uint8_t*)data->RefP[5] + offset; |
|
f_refv = (uint8_t*)data->RefCV + fy * stride + fx, stride; |
|
123 |
break; |
break; |
124 |
case 1: |
case 1: |
125 |
fx = fx / 2; fy = (fy - 1) / 2; |
interpolate8x8_halfpel_v(f_refu, data->RefP[4] + offset, stride, data->rounding); |
126 |
interpolate8x8_halfpel_v(f_refu, data->RefCU + fy * stride + fx, stride, data->rounding); |
interpolate8x8_halfpel_v(f_refv, data->RefP[5] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_v(f_refv, data->RefCV + fy * stride + fx, stride, data->rounding); |
|
127 |
break; |
break; |
128 |
case 2: |
case 2: |
129 |
fx = (fx - 1) / 2; fy = fy / 2; |
interpolate8x8_halfpel_h(f_refu, data->RefP[4] + offset, stride, data->rounding); |
130 |
interpolate8x8_halfpel_h(f_refu, data->RefCU + fy * stride + fx, stride, data->rounding); |
interpolate8x8_halfpel_h(f_refv, data->RefP[5] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_h(f_refv, data->RefCV + fy * stride + fx, stride, data->rounding); |
|
131 |
break; |
break; |
132 |
default: |
default: |
133 |
fx = (fx - 1) / 2; fy = (fy - 1) / 2; |
interpolate8x8_halfpel_hv(f_refu, data->RefP[4] + offset, stride, data->rounding); |
134 |
interpolate8x8_halfpel_hv(f_refu, data->RefCU + fy * stride + fx, stride, data->rounding); |
interpolate8x8_halfpel_hv(f_refv, data->RefP[5] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_hv(f_refv, data->RefCV + fy * stride + fx, stride, data->rounding); |
|
135 |
break; |
break; |
136 |
} |
} |
137 |
|
|
138 |
|
offset = (bx>>1) + (by>>1)*stride; |
139 |
switch (((bx & 1) << 1) | (by & 1)) { |
switch (((bx & 1) << 1) | (by & 1)) { |
140 |
case 0: |
case 0: |
141 |
bx = bx / 2; by = by / 2; |
b_refu = (uint8_t*)data->b_RefP[4] + offset; |
142 |
b_refu = (uint8_t*)data->b_RefCU + by * stride + bx, stride; |
b_refv = (uint8_t*)data->b_RefP[5] + offset; |
|
b_refv = (uint8_t*)data->b_RefCV + by * stride + bx, stride; |
|
143 |
break; |
break; |
144 |
case 1: |
case 1: |
145 |
bx = bx / 2; by = (by - 1) / 2; |
interpolate8x8_halfpel_v(b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
146 |
interpolate8x8_halfpel_v(b_refu, data->b_RefCU + by * stride + bx, stride, data->rounding); |
interpolate8x8_halfpel_v(b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_v(b_refv, data->b_RefCV + by * stride + bx, stride, data->rounding); |
|
147 |
break; |
break; |
148 |
case 2: |
case 2: |
149 |
bx = (bx - 1) / 2; by = by / 2; |
interpolate8x8_halfpel_h(b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
150 |
interpolate8x8_halfpel_h(b_refu, data->b_RefCU + by * stride + bx, stride, data->rounding); |
interpolate8x8_halfpel_h(b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_h(b_refv, data->b_RefCV + by * stride + bx, stride, data->rounding); |
|
151 |
break; |
break; |
152 |
default: |
default: |
153 |
bx = (bx - 1) / 2; by = (by - 1) / 2; |
interpolate8x8_halfpel_hv(b_refu, data->b_RefP[4] + offset, stride, data->rounding); |
154 |
interpolate8x8_halfpel_hv(b_refu, data->b_RefCU + by * stride + bx, stride, data->rounding); |
interpolate8x8_halfpel_hv(b_refv, data->b_RefP[5] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_hv(b_refv, data->b_RefCV + by * stride + bx, stride, data->rounding); |
|
155 |
break; |
break; |
156 |
} |
} |
157 |
|
|
161 |
return sad; |
return sad; |
162 |
} |
} |
163 |
|
|
|
|
|
164 |
static int32_t |
static int32_t |
165 |
ChromaSAD(int dx, int dy, const SearchData * const data) |
ChromaSAD(const int dx, const int dy, const SearchData * const data) |
166 |
{ |
{ |
167 |
int sad; |
int sad; |
168 |
const uint32_t stride = data->iEdgedWidth/2; |
const uint32_t stride = data->iEdgedWidth/2; |
169 |
|
int offset = (dx>>1) + (dy>>1)*stride; |
170 |
|
|
171 |
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 |
172 |
data->temp[5] = dx; data->temp[6] = dy; // backup |
data->temp[5] = dx; data->temp[6] = dy; // backup |
173 |
|
|
174 |
switch (((dx & 1) << 1) | (dy & 1)) { |
switch (((dx & 1) << 1) | (dy & 1)) { |
175 |
case 0: |
case 0: |
176 |
dx = dx / 2; dy = dy / 2; |
sad = sad8(data->CurU, data->RefP[4] + offset, stride); |
177 |
sad = sad8(data->CurU, data->RefCU + dy * stride + dx, stride); |
sad += sad8(data->CurV, data->RefP[5] + offset, stride); |
|
sad += sad8(data->CurV, data->RefCV + dy * stride + dx, stride); |
|
178 |
break; |
break; |
179 |
case 1: |
case 1: |
180 |
dx = dx / 2; dy = (dy - 1) / 2; |
sad = sad8bi(data->CurU, data->RefP[4] + offset, data->RefP[4] + offset + stride, stride); |
181 |
sad = sad8bi(data->CurU, data->RefCU + dy * stride + dx, data->RefCU + (dy+1) * stride + dx, stride); |
sad += sad8bi(data->CurV, data->RefP[5] + offset, data->RefP[5] + offset + stride, stride); |
|
sad += sad8bi(data->CurV, data->RefCV + dy * stride + dx, data->RefCV + (dy+1) * stride + dx, stride); |
|
182 |
break; |
break; |
183 |
case 2: |
case 2: |
184 |
dx = (dx - 1) / 2; dy = dy / 2; |
sad = sad8bi(data->CurU, data->RefP[4] + offset, data->RefP[4] + offset + 1, stride); |
185 |
sad = sad8bi(data->CurU, data->RefCU + dy * stride + dx, data->RefCU + dy * stride + dx+1, stride); |
sad += sad8bi(data->CurV, data->RefP[5] + offset, data->RefP[5] + offset + 1, stride); |
|
sad += sad8bi(data->CurV, data->RefCV + dy * stride + dx, data->RefCV + dy * stride + dx+1, stride); |
|
186 |
break; |
break; |
187 |
default: |
default: |
188 |
dx = (dx - 1) / 2; dy = (dy - 1) / 2; |
interpolate8x8_halfpel_hv(data->RefQ, data->RefP[4] + offset, stride, data->rounding); |
|
interpolate8x8_halfpel_hv(data->RefQ, data->RefCU + dy * stride + dx, stride, data->rounding); |
|
189 |
sad = sad8(data->CurU, data->RefQ, stride); |
sad = sad8(data->CurU, data->RefQ, stride); |
190 |
|
|
191 |
interpolate8x8_halfpel_hv(data->RefQ, data->RefCV + dy * stride + dx, stride, data->rounding); |
interpolate8x8_halfpel_hv(data->RefQ, data->RefP[5] + offset, stride, data->rounding); |
192 |
sad += sad8(data->CurV, data->RefQ, stride); |
sad += sad8(data->CurV, data->RefQ, stride); |
193 |
break; |
break; |
194 |
} |
} |
200 |
GetReferenceB(const int x, const int y, const uint32_t dir, const SearchData * const data) |
GetReferenceB(const int x, const int y, const uint32_t dir, const SearchData * const data) |
201 |
{ |
{ |
202 |
// dir : 0 = forward, 1 = backward |
// dir : 0 = forward, 1 = backward |
203 |
switch ( (dir << 2) | ((x&1)<<1) | (y&1) ) { |
const uint8_t *const *const direction = ( dir == 0 ? data->RefP : data->b_RefP ); |
204 |
case 0 : return data->Ref + x/2 + (y/2)*(data->iEdgedWidth); |
const int picture = ((x&1)<<1) | (y&1); |
205 |
case 1 : return data->RefV + x/2 + ((y-1)/2)*(data->iEdgedWidth); |
const int offset = (x>>1) + (y>>1)*data->iEdgedWidth; |
206 |
case 2 : return data->RefH + (x-1)/2 + (y/2)*(data->iEdgedWidth); |
return direction[picture] + offset; |
|
case 3 : return data->RefHV + (x-1)/2 + ((y-1)/2)*(data->iEdgedWidth); |
|
|
case 4 : return data->bRef + x/2 + (y/2)*(data->iEdgedWidth); |
|
|
case 5 : return data->bRefV + x/2 + ((y-1)/2)*(data->iEdgedWidth); |
|
|
case 6 : return data->bRefH + (x-1)/2 + (y/2)*(data->iEdgedWidth); |
|
|
default : return data->bRefHV + (x-1)/2 + ((y-1)/2)*(data->iEdgedWidth); |
|
|
} |
|
207 |
} |
} |
208 |
|
|
209 |
// this is a simpler copy of GetReferenceB, but as it's __inline anyway, we can keep the two separate |
// this is a simpler copy of GetReferenceB, but as it's __inline anyway, we can keep the two separate |
210 |
static __inline const uint8_t * |
static __inline const uint8_t * |
211 |
GetReference(const int x, const int y, const SearchData * const data) |
GetReference(const int x, const int y, const SearchData * const data) |
212 |
{ |
{ |
213 |
switch ( ((x&1)<<1) | (y&1) ) { |
const int picture = ((x&1)<<1) | (y&1); |
214 |
case 0 : return data->Ref + x/2 + (y/2)*(data->iEdgedWidth); |
const int offset = (x>>1) + (y>>1)*data->iEdgedWidth; |
215 |
case 3 : return data->RefHV + (x-1)/2 + ((y-1)/2)*(data->iEdgedWidth); |
return data->RefP[picture] + offset; |
|
case 1 : return data->RefV + x/2 + ((y-1)/2)*(data->iEdgedWidth); |
|
|
default : return data->RefH + (x-1)/2 + (y/2)*(data->iEdgedWidth); //case 2 |
|
|
} |
|
216 |
} |
} |
217 |
|
|
218 |
static uint8_t * |
static uint8_t * |
351 |
data->iMinSAD[3] = data->temp[3]; current[3].x = x; current[3].y = y; } |
data->iMinSAD[3] = data->temp[3]; current[3].x = x; current[3].y = y; } |
352 |
if (data->temp[4] < data->iMinSAD[4]) { |
if (data->temp[4] < data->iMinSAD[4]) { |
353 |
data->iMinSAD[4] = data->temp[4]; current[4].x = x; current[4].y = y; } |
data->iMinSAD[4] = data->temp[4]; current[4].x = x; current[4].y = y; } |
|
|
|
354 |
} |
} |
355 |
|
|
356 |
static void |
static void |
358 |
{ |
{ |
359 |
int32_t sad; uint32_t t; |
int32_t sad; uint32_t t; |
360 |
const uint8_t * Reference; |
const uint8_t * Reference; |
361 |
|
VECTOR * current; |
362 |
|
|
363 |
if ( (x > data->max_dx) || (x < data->min_dx) |
if ( (x > data->max_dx) || (x < data->min_dx) |
364 |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
365 |
|
|
366 |
if (!data->qpel_precision) Reference = GetReference(x, y, data); |
if (!data->qpel_precision) { |
367 |
else Reference = Interpolate8x8qpel(x, y, 0, 0, data); |
Reference = GetReference(x, y, data); |
368 |
|
current = data->currentMV; |
369 |
|
} else { // x and y are in 1/4 precision |
370 |
|
Reference = Interpolate8x8qpel(x, y, 0, 0, data); |
371 |
|
current = data->currentQMV; |
372 |
|
} |
373 |
|
|
374 |
sad = sad8(data->Cur, Reference, data->iEdgedWidth); |
sad = sad8(data->Cur, Reference, data->iEdgedWidth); |
375 |
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); |
378 |
|
|
379 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
380 |
*(data->iMinSAD) = sad; |
*(data->iMinSAD) = sad; |
381 |
data->currentMV->x = x; data->currentMV->y = y; |
current->x = x; current->y = y; |
382 |
*dir = Direction; |
*dir = Direction; |
383 |
} |
} |
384 |
} |
} |
385 |
|
|
|
|
|
386 |
static void |
static void |
387 |
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 int Direction, int * const dir, const SearchData * const data) |
388 |
{ |
{ |
463 |
if ( (x > data->max_dx) || (x < data->min_dx) |
if ( (x > data->max_dx) || (x < data->min_dx) |
464 |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
|| (y > data->max_dy) || (y < data->min_dy) ) return; |
465 |
|
|
466 |
sad = sad32v_c(data->Cur, data->Ref + x/2 + (y/2)*(data->iEdgedWidth), |
sad = sad32v_c(data->Cur, data->RefP[0] + (x>>1) + (y>>1)*(data->iEdgedWidth), |
467 |
data->iEdgedWidth, data->temp+1); |
data->iEdgedWidth, data->temp+1); |
468 |
|
|
469 |
if (sad < *(data->iMinSAD)) { |
if (sad < *(data->iMinSAD)) { |
683 |
yc = (yc >> 1) + roundtab_79[yc & 0x3]; |
yc = (yc >> 1) + roundtab_79[yc & 0x3]; |
684 |
|
|
685 |
//chroma U |
//chroma U |
686 |
ptr = interpolate8x8_switch2(data->RefQ + 64, data->RefCU, 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
ptr = interpolate8x8_switch2(data->RefQ + 64, data->RefP[4], 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
687 |
transfer_8to16subro(in, ptr, data->CurU, data->iEdgedWidth/2); |
transfer_8to16subro(in, ptr, data->CurU, data->iEdgedWidth/2); |
688 |
fdct(in); |
fdct(in); |
689 |
if (data->lambda8 == 0) sum = quant_inter(coeff, in, data->lambda16); |
if (data->lambda8 == 0) sum = quant_inter(coeff, in, data->lambda16); |
695 |
|
|
696 |
if (bits < data->iMinSAD[0]) { |
if (bits < data->iMinSAD[0]) { |
697 |
//chroma V |
//chroma V |
698 |
ptr = interpolate8x8_switch2(data->RefQ + 64, data->RefCV, 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
ptr = interpolate8x8_switch2(data->RefQ + 64, data->RefP[5], 0, 0, xc, yc, data->iEdgedWidth/2, data->rounding); |
699 |
transfer_8to16subro(in, ptr, data->CurV, data->iEdgedWidth/2); |
transfer_8to16subro(in, ptr, data->CurV, data->iEdgedWidth/2); |
700 |
fdct(in); |
fdct(in); |
701 |
if (data->lambda8 == 0) sum = quant_inter(coeff, in, data->lambda16); |
if (data->lambda8 == 0) sum = quant_inter(coeff, in, data->lambda16); |
1221 |
if (bits_inter4v < bits) { Data->iMinSAD[0] = bits = bits_inter4v; mode = MODE_INTER4V; } |
if (bits_inter4v < bits) { Data->iMinSAD[0] = bits = bits_inter4v; mode = MODE_INTER4V; } |
1222 |
} |
} |
1223 |
|
|
|
|
|
1224 |
intra = CountMBBitsIntra(Data); |
intra = CountMBBitsIntra(Data); |
1225 |
|
|
1226 |
if (intra < bits) { *Data->iMinSAD = bits = intra; return MODE_INTRA; } |
if (intra < bits) { *Data->iMinSAD = bits = intra; return MODE_INTRA; } |
1262 |
Data->CurV = pCur->v + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
Data->CurV = pCur->v + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
1263 |
Data->CurU = pCur->u + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
Data->CurU = pCur->u + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
1264 |
|
|
1265 |
Data->Ref = pRef->y + (x + Data->iEdgedWidth*y) * 16*i; |
Data->RefP[0] = pRef->y + (x + Data->iEdgedWidth*y) * 16*i; |
1266 |
Data->RefH = pRefH + (x + Data->iEdgedWidth*y) * 16*i; |
Data->RefP[2] = pRefH + (x + Data->iEdgedWidth*y) * 16*i; |
1267 |
Data->RefV = pRefV + (x + Data->iEdgedWidth*y) * 16*i; |
Data->RefP[1] = pRefV + (x + Data->iEdgedWidth*y) * 16*i; |
1268 |
Data->RefHV = pRefHV + (x + Data->iEdgedWidth*y) * 16*i; |
Data->RefP[3] = pRefHV + (x + Data->iEdgedWidth*y) * 16*i; |
1269 |
Data->RefCV = pRef->v + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
Data->RefP[4] = pRef->u + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
1270 |
Data->RefCU = pRef->u + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
Data->RefP[5] = pRef->v + (x + y * (Data->iEdgedWidth/2)) * 8*i; |
1271 |
|
|
1272 |
Data->lambda16 = lambda_vec16[iQuant]; |
Data->lambda16 = lambda_vec16[iQuant]; |
1273 |
Data->lambda8 = lambda_vec8[iQuant]; |
Data->lambda8 = lambda_vec8[iQuant]; |
1359 |
} |
} |
1360 |
|
|
1361 |
if (MotionFlags & PMV_HALFPELREFINE16) |
if (MotionFlags & PMV_HALFPELREFINE16) |
|
if ((!(MotionFlags & HALFPELREFINE16_BITS)) || Data->iMinSAD[0] < 200*(int)iQuant) |
|
1362 |
SubpelRefine(Data); |
SubpelRefine(Data); |
1363 |
|
|
1364 |
for(i = 0; i < 5; i++) { |
for(i = 0; i < 5; i++) { |
1370 |
|
|
1371 |
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, 16, |
1372 |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
|
|
|
|
if ((!(MotionFlags & QUARTERPELREFINE16_BITS)) || (Data->iMinSAD[0] < 200*(int)iQuant)) { |
|
1373 |
Data->qpel_precision = 1; |
Data->qpel_precision = 1; |
1374 |
SubpelRefine(Data); |
SubpelRefine(Data); |
1375 |
} |
} |
|
} |
|
1376 |
|
|
1377 |
if ((!(GlobalFlags & XVID_MODEDECISION_BITS)) && (Data->iMinSAD[0] < (int32_t)iQuant * 30)) inter4v = 0; |
if ((!(GlobalFlags & XVID_MODEDECISION_BITS)) && (Data->iMinSAD[0] < (int32_t)iQuant * 30)) inter4v = 0; |
1378 |
|
|
1379 |
if (inter4v && (!(GlobalFlags & XVID_MODEDECISION_BITS) || |
if (inter4v) { |
|
(!(MotionFlags & QUARTERPELREFINE8_BITS)) || (!(MotionFlags & HALFPELREFINE8_BITS)) || |
|
|
((!(MotionFlags & EXTSEARCH_BITS)) && (!(MotionFlags&PMV_EXTSEARCH8)) ))) { |
|
|
// if decision is BITS-based and all refinement steps will be done in BITS domain, there is no reason to call this loop |
|
|
|
|
1380 |
SearchData Data8; |
SearchData Data8; |
1381 |
memcpy(&Data8, Data, sizeof(SearchData)); //quick copy of common data |
memcpy(&Data8, Data, sizeof(SearchData)); //quick copy of common data |
1382 |
|
|
1388 |
if ((Data->chroma) && (!(GlobalFlags & XVID_MODEDECISION_BITS))) { |
if ((Data->chroma) && (!(GlobalFlags & XVID_MODEDECISION_BITS))) { |
1389 |
// chroma is only used for comparsion to INTER. if the comparsion will be done in BITS domain, there is no reason to compute it |
// chroma is only used for comparsion to INTER. if the comparsion will be done in BITS domain, there is no reason to compute it |
1390 |
int sumx = 0, sumy = 0; |
int sumx = 0, sumy = 0; |
1391 |
const int div = 1 + Data->qpel; |
const int div = Data->qpel ? 2 : 1; |
1392 |
const VECTOR * const mv = Data->qpel ? pMB->qmvs : pMB->mvs; |
const VECTOR * const mv = Data->qpel ? pMB->qmvs : pMB->mvs; |
1393 |
|
|
1394 |
for (i = 0; i < 4; i++) { |
for (i = 0; i < 4; i++) { |
1461 |
*(Data->iMinSAD) += (Data->lambda8 * i * (*Data->iMinSAD + NEIGH_8X8_BIAS))>>10; |
*(Data->iMinSAD) += (Data->lambda8 * i * (*Data->iMinSAD + NEIGH_8X8_BIAS))>>10; |
1462 |
|
|
1463 |
if (MotionFlags & (PMV_EXTSEARCH8|PMV_HALFPELREFINE8|PMV_QUARTERPELREFINE8)) { |
if (MotionFlags & (PMV_EXTSEARCH8|PMV_HALFPELREFINE8|PMV_QUARTERPELREFINE8)) { |
|
if (Data->rrv) i = 2; else i = 1; |
|
1464 |
|
|
1465 |
Data->Ref = OldData->Ref + i * 8 * ((block&1) + Data->iEdgedWidth*(block>>1)); |
if (Data->rrv) i = 16; else i = 8; |
|
Data->RefH = OldData->RefH + i * 8 * ((block&1) + Data->iEdgedWidth*(block>>1)); |
|
|
Data->RefV = OldData->RefV + i * 8 * ((block&1) + Data->iEdgedWidth*(block>>1)); |
|
|
Data->RefHV = OldData->RefHV + i * 8 * ((block&1) + Data->iEdgedWidth*(block>>1)); |
|
1466 |
|
|
1467 |
Data->Cur = OldData->Cur + i * 8 * ((block&1) + Data->iEdgedWidth*(block>>1)); |
Data->RefP[0] = OldData->RefP[0] + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
1468 |
|
Data->RefP[1] = OldData->RefP[1] + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
1469 |
|
Data->RefP[2] = OldData->RefP[2] + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
1470 |
|
Data->RefP[3] = OldData->RefP[3] + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
1471 |
|
|
1472 |
|
Data->Cur = OldData->Cur + i * ((block&1) + Data->iEdgedWidth*(block>>1)); |
1473 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
1474 |
|
|
1475 |
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, 8, |
1603 |
Data->qpel_precision = 0; |
Data->qpel_precision = 0; |
1604 |
Data->temp[5] = Data->temp[6] = Data->temp[7] = 256*4096; // reset chroma-sad cache |
Data->temp[5] = Data->temp[6] = Data->temp[7] = 256*4096; // reset chroma-sad cache |
1605 |
|
|
1606 |
Data->Ref = pRef->y + (x + y * Data->iEdgedWidth) * 16; |
Data->RefP[0] = pRef->y + (x + Data->iEdgedWidth*y) * 16; |
1607 |
Data->RefH = pRefH + (x + y * Data->iEdgedWidth) * 16; |
Data->RefP[2] = pRefH + (x + Data->iEdgedWidth*y) * 16; |
1608 |
Data->RefV = pRefV + (x + y * Data->iEdgedWidth) * 16; |
Data->RefP[1] = pRefV + (x + Data->iEdgedWidth*y) * 16; |
1609 |
Data->RefHV = pRefHV + (x + y * Data->iEdgedWidth) * 16; |
Data->RefP[3] = pRefHV + (x + Data->iEdgedWidth*y) * 16; |
1610 |
Data->RefCU = pRef->u + (x + y * Data->iEdgedWidth/2) * 8; |
Data->RefP[4] = pRef->u + (x + y * (Data->iEdgedWidth/2)) * 8; |
1611 |
Data->RefCV = pRef->v + (x + y * Data->iEdgedWidth/2) * 8; |
Data->RefP[5] = pRef->v + (x + y * (Data->iEdgedWidth/2)) * 8; |
1612 |
|
|
1613 |
Data->predMV = *predMV; |
Data->predMV = *predMV; |
1614 |
|
|
1746 |
MainSearchFunc *MainSearchPtr; |
MainSearchFunc *MainSearchPtr; |
1747 |
|
|
1748 |
*Data->iMinSAD = 256*4096; |
*Data->iMinSAD = 256*4096; |
1749 |
Data->Ref = f_Ref->y + k; |
Data->RefP[0] = f_Ref->y + k; |
1750 |
Data->RefH = f_RefH + k; |
Data->RefP[2] = f_RefH + k; |
1751 |
Data->RefV = f_RefV + k; |
Data->RefP[1] = f_RefV + k; |
1752 |
Data->RefHV = f_RefHV + k; |
Data->RefP[3] = f_RefHV + k; |
1753 |
Data->bRef = b_Ref->y + k; |
Data->b_RefP[0] = b_Ref->y + k; |
1754 |
Data->bRefH = b_RefH + k; |
Data->b_RefP[2] = b_RefH + k; |
1755 |
Data->bRefV = b_RefV + k; |
Data->b_RefP[1] = b_RefV + k; |
1756 |
Data->bRefHV = b_RefHV + k; |
Data->b_RefP[3] = b_RefHV + k; |
1757 |
Data->RefCU = f_Ref->u + (x + (Data->iEdgedWidth/2) * y) * 8; |
Data->RefP[4] = f_Ref->u + (x + (Data->iEdgedWidth/2) * y) * 8; |
1758 |
Data->RefCV = f_Ref->v + (x + (Data->iEdgedWidth/2) * y) * 8; |
Data->RefP[5] = f_Ref->v + (x + (Data->iEdgedWidth/2) * y) * 8; |
1759 |
Data->b_RefCU = b_Ref->u + (x + (Data->iEdgedWidth/2) * y) * 8; |
Data->b_RefP[4] = b_Ref->u + (x + (Data->iEdgedWidth/2) * y) * 8; |
1760 |
Data->b_RefCV = b_Ref->v + (x + (Data->iEdgedWidth/2) * y) * 8; |
Data->b_RefP[5] = b_Ref->v + (x + (Data->iEdgedWidth/2) * y) * 8; |
1761 |
|
|
1762 |
k = Data->qpel ? 4 : 2; |
k = Data->qpel ? 4 : 2; |
1763 |
Data->max_dx = k * (pParam->width - x * 16); |
Data->max_dx = k * (pParam->width - x * 16); |
1888 |
fData->iFcode = bData.bFcode = fcode; fData->bFcode = bData.iFcode = bcode; |
fData->iFcode = bData.bFcode = fcode; fData->bFcode = bData.iFcode = bcode; |
1889 |
|
|
1890 |
i = (x + y * fData->iEdgedWidth) * 16; |
i = (x + y * fData->iEdgedWidth) * 16; |
|
bData.bRef = fData->Ref = f_Ref->y + i; |
|
|
bData.bRefH = fData->RefH = f_RefH + i; |
|
|
bData.bRefV = fData->RefV = f_RefV + i; |
|
|
bData.bRefHV = fData->RefHV = f_RefHV + i; |
|
|
bData.Ref = fData->bRef = b_Ref->y + i; |
|
|
bData.RefH = fData->bRefH = b_RefH + i; |
|
|
bData.RefV = fData->bRefV = b_RefV + i; |
|
|
bData.RefHV = fData->bRefHV = b_RefHV + i; |
|
|
bData.b_RefCU = fData->RefCU = f_Ref->u + (x + (fData->iEdgedWidth/2) * y) * 8; |
|
|
bData.b_RefCV = fData->RefCV = f_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
|
|
bData.RefCU = fData->b_RefCU = b_Ref->u + (x + (fData->iEdgedWidth/2) * y) * 8; |
|
|
bData.RefCV = fData->b_RefCV = b_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
|
1891 |
|
|
1892 |
|
bData.b_RefP[0] = fData->RefP[0] = f_Ref->y + i; |
1893 |
|
bData.b_RefP[2] = fData->RefP[2] = f_RefH + i; |
1894 |
|
bData.b_RefP[1] = fData->RefP[1] = f_RefV + i; |
1895 |
|
bData.b_RefP[3] = fData->RefP[3] = f_RefHV + i; |
1896 |
|
bData.RefP[0] = fData->b_RefP[0] = b_Ref->y + i; |
1897 |
|
bData.RefP[2] = fData->b_RefP[2] = b_RefH + i; |
1898 |
|
bData.RefP[1] = fData->b_RefP[1] = b_RefV + i; |
1899 |
|
bData.RefP[3] = fData->b_RefP[3] = b_RefHV + i; |
1900 |
|
bData.b_RefP[4] = fData->RefP[4] = f_Ref->u + (x + (fData->iEdgedWidth/2) * y) * 8; |
1901 |
|
bData.b_RefP[5] = fData->RefP[5] = f_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
1902 |
|
bData.RefP[4] = fData->b_RefP[4] = b_Ref->u + (x + (fData->iEdgedWidth/2) * y) * 8; |
1903 |
|
bData.RefP[5] = fData->b_RefP[5] = b_Ref->v + (x + (fData->iEdgedWidth/2) * y) * 8; |
1904 |
|
|
1905 |
bData.bpredMV = fData->predMV = *f_predMV; |
bData.bpredMV = fData->predMV = *f_predMV; |
1906 |
fData->bpredMV = bData.predMV = *b_predMV; |
fData->bpredMV = bData.predMV = *b_predMV; |
2151 |
pParam->width, pParam->height, Data->iFcode - pParam->m_quarterpel, 0, 0); |
pParam->width, pParam->height, Data->iFcode - pParam->m_quarterpel, 0, 0); |
2152 |
|
|
2153 |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
2154 |
Data->Ref = pRef + (x + y * pParam->edged_width) * 16; |
Data->RefP[0] = pRef + (x + y * pParam->edged_width) * 16; |
2155 |
|
|
2156 |
pmv[1].x = EVEN(pMB->mvs[0].x); |
pmv[1].x = EVEN(pMB->mvs[0].x); |
2157 |
pmv[1].y = EVEN(pMB->mvs[0].y); |
pmv[1].y = EVEN(pMB->mvs[0].y); |
2160 |
pmv[0].x = pmv[0].y = 0; |
pmv[0].x = pmv[0].y = 0; |
2161 |
|
|
2162 |
CheckCandidate32I(0, 0, 255, &i, Data); |
CheckCandidate32I(0, 0, 255, &i, Data); |
|
Data->iMinSAD[1] -= 50; |
|
|
Data->iMinSAD[2] -= 50; |
|
|
Data->iMinSAD[3] -= 50; |
|
|
Data->iMinSAD[4] -= 50; |
|
2163 |
|
|
2164 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
2165 |
|
|
2180 |
} |
} |
2181 |
} |
} |
2182 |
|
|
2183 |
#define INTRA_THRESH 2400 |
#define INTRA_THRESH 1800 |
2184 |
#define INTER_THRESH 1100 |
#define INTER_THRESH 1200 |
2185 |
|
|
2186 |
int |
int |
2187 |
MEanalysis( const IMAGE * const pRef, |
MEanalysis( const IMAGE * const pRef, |
2210 |
CheckCandidate = CheckCandidate32I; |
CheckCandidate = CheckCandidate32I; |
2211 |
|
|
2212 |
if (intraCount != 0 && intraCount < 10) // we're right after an I frame |
if (intraCount != 0 && intraCount < 10) // we're right after an I frame |
2213 |
IntraThresh += 8 * (intraCount - 10) * (intraCount - 10); |
IntraThresh += 15 * (intraCount - 10) * (intraCount - 10); |
2214 |
else |
else |
2215 |
if ( 5*(maxIntra - intraCount) < maxIntra) // we're close to maximum. 2 sec when max is 10 sec |
if ( 5*(maxIntra - intraCount) < maxIntra) // we're close to maximum. 2 sec when max is 10 sec |
2216 |
IntraThresh -= (IntraThresh * (maxIntra - 5*(maxIntra - intraCount)))/maxIntra; |
IntraThresh -= (IntraThresh * (maxIntra - 8*(maxIntra - intraCount)))/maxIntra; |
2217 |
|
|
2218 |
InterThresh -= (350 - 8*b_thresh) * bCount; |
InterThresh -= (350 - 8*b_thresh) * bCount; |
2219 |
if (InterThresh < 300 + 5*b_thresh) InterThresh = 300 + 5*b_thresh; |
if (InterThresh < 300 + 5*b_thresh) InterThresh = 300 + 5*b_thresh; |
2256 |
sSAD /= blocks; |
sSAD /= blocks; |
2257 |
s = (10*s) / blocks; |
s = (10*s) / blocks; |
2258 |
|
|
2259 |
if (s > 5) sSAD += (s - 4) * (180 - 2*b_thresh); //static block - looks bad when in bframe... |
if (s > 4) sSAD += (s - 2) * (60 - 2*b_thresh); //static block - looks bad when in bframe... |
2260 |
|
|
2261 |
if (sSAD > InterThresh ) return P_VOP; |
if (sSAD > InterThresh ) return P_VOP; |
2262 |
emms(); |
emms(); |
2310 |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_NOT_CODED) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_NOT_CODED) |
2311 |
continue; |
continue; |
2312 |
|
|
2313 |
if ( ( (ABS(mv.x - (pMB-1)->mvs[0].x) < deltax) && (ABS(mv.y - (pMB-1)->mvs[0].y) < deltay) ) |
if ( ( (abs(mv.x - (pMB-1)->mvs[0].x) < deltax) && (abs(mv.y - (pMB-1)->mvs[0].y) < deltay) ) |
2314 |
&& ( (ABS(mv.x - (pMB+1)->mvs[0].x) < deltax) && (ABS(mv.y - (pMB+1)->mvs[0].y) < deltay) ) |
&& ( (abs(mv.x - (pMB+1)->mvs[0].x) < deltax) && (abs(mv.y - (pMB+1)->mvs[0].y) < deltay) ) |
2315 |
&& ( (ABS(mv.x - (pMB-MBw)->mvs[0].x) < deltax) && (ABS(mv.y - (pMB-MBw)->mvs[0].y) < deltay) ) |
&& ( (abs(mv.x - (pMB-MBw)->mvs[0].x) < deltax) && (abs(mv.y - (pMB-MBw)->mvs[0].y) < deltay) ) |
2316 |
&& ( (ABS(mv.x - (pMB+MBw)->mvs[0].x) < deltax) && (ABS(mv.y - (pMB+MBw)->mvs[0].y) < deltay) ) ) |
&& ( (abs(mv.x - (pMB+MBw)->mvs[0].x) < deltax) && (abs(mv.y - (pMB+MBw)->mvs[0].y) < deltay) ) ) |
2317 |
MBmask[mbnum]=1; |
MBmask[mbnum]=1; |
2318 |
} |
} |
2319 |
|
|
2388 |
continue; |
continue; |
2389 |
|
|
2390 |
oldnum++; |
oldnum++; |
2391 |
meanx += ABS(( sol[0] + (16*mx+8)*sol[1] + (16*my+8)*sol[2] ) - mv.x ); |
meanx += fabs(( sol[0] + (16*mx+8)*sol[1] + (16*my+8)*sol[2] ) - mv.x ); |
2392 |
meany += ABS(( sol[3] - (16*mx+8)*sol[2] + (16*my+8)*sol[1] ) - mv.y ); |
meany += fabs(( sol[3] - (16*mx+8)*sol[2] + (16*my+8)*sol[1] ) - mv.y ); |
2393 |
} |
} |
2394 |
|
|
2395 |
if (4*meanx > oldnum) /* better fit than 0.25 is useless */ |
if (4*meanx > oldnum) /* better fit than 0.25 is useless */ |
2416 |
if (!MBmask[mbnum]) |
if (!MBmask[mbnum]) |
2417 |
continue; |
continue; |
2418 |
|
|
2419 |
if ( ( ABS(( sol[0] + (16*mx+8)*sol[1] + (16*my+8)*sol[2] ) - mv.x ) > meanx ) |
if ( ( fabs(( sol[0] + (16*mx+8)*sol[1] + (16*my+8)*sol[2] ) - mv.x ) > meanx ) |
2420 |
|| ( ABS(( sol[3] - (16*mx+8)*sol[2] + (16*my+8)*sol[1] ) - mv.y ) > meany ) ) |
|| ( fabs(( sol[3] - (16*mx+8)*sol[2] + (16*my+8)*sol[1] ) - mv.y ) > meany ) ) |
2421 |
MBmask[mbnum]=0; |
MBmask[mbnum]=0; |
2422 |
else |
else |
2423 |
num++; |
num++; |
2538 |
Data8->currentMV = Data->currentMV + i + 1; |
Data8->currentMV = Data->currentMV + i + 1; |
2539 |
Data8->currentQMV = Data->currentQMV + i + 1; |
Data8->currentQMV = Data->currentQMV + i + 1; |
2540 |
Data8->Cur = Data->Cur + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->Cur = Data->Cur + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2541 |
Data8->Ref = Data->Ref + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->RefP[0] = Data->RefP[0] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2542 |
Data8->RefH = Data->RefH + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->RefP[2] = Data->RefP[2] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2543 |
Data8->RefV = Data->RefV + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->RefP[1] = Data->RefP[1] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2544 |
Data8->RefHV = Data->RefHV + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
Data8->RefP[3] = Data->RefP[3] + 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2545 |
|
|
2546 |
if(Data->qpel) { |
if(Data->qpel) { |
2547 |
Data8->predMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, i); |
Data8->predMV = get_qpmv2(pMBs, pParam->mb_width, 0, x, y, i); |
2560 |
|
|
2561 |
Data8->qpel_precision = Data8->qpel; |
Data8->qpel_precision = Data8->qpel; |
2562 |
// checking the vector which has been found by SAD-based 8x8 search (if it's different than the one found so far) |
// checking the vector which has been found by SAD-based 8x8 search (if it's different than the one found so far) |
2563 |
if (Data8->qpel) { |
{ |
2564 |
if (!(Data8->currentQMV->x == backup[i+1].x && Data8->currentQMV->y == backup[i+1].y)) |
VECTOR *v = Data8->qpel ? Data8->currentQMV : Data8->currentMV; |
2565 |
CheckCandidateBits8(backup[i+1].x, backup[i+1].y, 255, &iDirection, Data8); |
if (!( (v->x == backup[i+1].x) && (v->y == backup[i+1].y) )) |
|
} else { |
|
|
if (!(Data8->currentMV->x == backup[i+1].x && Data8->currentMV->y == backup[i+1].y)) |
|
2566 |
CheckCandidateBits8(backup[i+1].x, backup[i+1].y, 255, &iDirection, Data8); |
CheckCandidateBits8(backup[i+1].x, backup[i+1].y, 255, &iDirection, Data8); |
2567 |
} |
} |
2568 |
|
|
2632 |
sumy = (sumy >> 3) + roundtab_76[sumy & 0xf]; |
sumy = (sumy >> 3) + roundtab_76[sumy & 0xf]; |
2633 |
|
|
2634 |
//chroma U |
//chroma U |
2635 |
ptr = interpolate8x8_switch2(Data->RefQ + 64, Data->RefCU, 0, 0, sumx, sumy, Data->iEdgedWidth/2, Data->rounding); |
ptr = interpolate8x8_switch2(Data->RefQ + 64, Data->RefP[4], 0, 0, sumx, sumy, Data->iEdgedWidth/2, Data->rounding); |
2636 |
transfer_8to16subro(in, Data->CurU, ptr, Data->iEdgedWidth/2); |
transfer_8to16subro(in, Data->CurU, ptr, Data->iEdgedWidth/2); |
2637 |
fdct(in); |
fdct(in); |
2638 |
if (Data->lambda8 == 0) i = quant_inter(coeff, in, Data->lambda16); |
if (Data->lambda8 == 0) i = quant_inter(coeff, in, Data->lambda16); |
2644 |
|
|
2645 |
if (bits < *Data->iMinSAD) { // still possible |
if (bits < *Data->iMinSAD) { // still possible |
2646 |
//chroma V |
//chroma V |
2647 |
ptr = interpolate8x8_switch2(Data->RefQ + 64, Data->RefCV, 0, 0, sumx, sumy, Data->iEdgedWidth/2, Data->rounding); |
ptr = interpolate8x8_switch2(Data->RefQ + 64, Data->RefP[5], 0, 0, sumx, sumy, Data->iEdgedWidth/2, Data->rounding); |
2648 |
transfer_8to16subro(in, Data->CurV, ptr, Data->iEdgedWidth/2); |
transfer_8to16subro(in, Data->CurV, ptr, Data->iEdgedWidth/2); |
2649 |
fdct(in); |
fdct(in); |
2650 |
if (Data->lambda8 == 0) i = quant_inter(coeff, in, Data->lambda16); |
if (Data->lambda8 == 0) i = quant_inter(coeff, in, Data->lambda16); |
2666 |
CountMBBitsIntra(const SearchData * const Data) |
CountMBBitsIntra(const SearchData * const Data) |
2667 |
{ |
{ |
2668 |
int bits = 1; //this one is ac/dc prediction flag. always 1. |
int bits = 1; //this one is ac/dc prediction flag. always 1. |
2669 |
int cbp = 0, i, t, dc = 0, b_dc = 1024; |
int cbp = 0, i, t, dc = 1024, b_dc; |
2670 |
const uint32_t iQuant = Data->lambda16; |
const uint32_t iQuant = Data->lambda16; |
2671 |
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64; |
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64; |
2672 |
|
uint32_t iDcScaler = get_dc_scaler(iQuant, 1);; |
2673 |
|
|
2674 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
|
uint32_t iDcScaler = get_dc_scaler(iQuant, 1); |
|
|
|
|
2675 |
int s = 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
int s = 8*((i&1) + (i>>1)*Data->iEdgedWidth); |
2676 |
transfer_8to16copy(in, Data->Cur + s, Data->iEdgedWidth); |
transfer_8to16copy(in, Data->Cur + s, Data->iEdgedWidth); |
2677 |
fdct(in); |
fdct(in); |
2678 |
b_dc = dc; |
b_dc = in[0]; |
2679 |
dc = in[0]; |
in[0] -= dc; |
2680 |
in[0] -= b_dc; |
dc = b_dc; |
2681 |
if (Data->lambda8 == 0) quant_intra_c(coeff, in, iQuant, iDcScaler); |
if (Data->lambda8 == 0) quant_intra(coeff, in, iQuant, iDcScaler); |
2682 |
else quant4_intra_c(coeff, in, iQuant, iDcScaler); |
else quant4_intra(coeff, in, iQuant, iDcScaler); |
|
|
|
|
b_dc = dc; |
|
|
dc = coeff[0]; |
|
|
if (i != 0) coeff[0] -= b_dc; |
|
2683 |
|
|
2684 |
bits += t = CodeCoeffIntra_CalcBits(coeff, scan_tables[0]) + dcy_tab[coeff[0] + 255].len;; |
bits += t = CodeCoeffIntra_CalcBits(coeff, scan_tables[0]) + dcy_tab[coeff[0] + 255].len;; |
2685 |
Data->temp[i] = t; |
Data->temp[i] = t; |
2688 |
} |
} |
2689 |
|
|
2690 |
if (bits < Data->iMinSAD[0]) { // INTRA still looks good, let's add chroma |
if (bits < Data->iMinSAD[0]) { // INTRA still looks good, let's add chroma |
2691 |
uint32_t iDcScaler = get_dc_scaler(iQuant, 0); |
iDcScaler = get_dc_scaler(iQuant, 0); |
2692 |
//chroma U |
//chroma U |
2693 |
transfer_8to16copy(in, Data->CurU, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurU, Data->iEdgedWidth/2); |
2694 |
fdct(in); |
fdct(in); |
2700 |
if (t != 0) cbp |= 1 << (5 - 4); |
if (t != 0) cbp |= 1 << (5 - 4); |
2701 |
|
|
2702 |
if (bits < Data->iMinSAD[0]) { |
if (bits < Data->iMinSAD[0]) { |
|
iDcScaler = get_dc_scaler(iQuant, 1); |
|
2703 |
//chroma V |
//chroma V |
2704 |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
2705 |
fdct(in); |
fdct(in); |