46 |
#include "../utils/emms.h" |
#include "../utils/emms.h" |
47 |
#include "../dct/fdct.h" |
#include "../dct/fdct.h" |
48 |
|
|
49 |
|
/***************************************************************************** |
50 |
|
* Modified rounding tables -- declared in motion.h |
51 |
|
* Original tables see ISO spec tables 7-6 -> 7-9 |
52 |
|
****************************************************************************/ |
53 |
|
|
54 |
|
const uint32_t roundtab[16] = |
55 |
|
{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2 }; |
56 |
|
|
57 |
|
/* K = 4 */ |
58 |
|
const uint32_t roundtab_76[16] = |
59 |
|
{ 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1 }; |
60 |
|
|
61 |
|
/* K = 2 */ |
62 |
|
const uint32_t roundtab_78[8] = |
63 |
|
{ 0, 0, 1, 1, 0, 0, 0, 1 }; |
64 |
|
|
65 |
|
/* K = 1 */ |
66 |
|
const uint32_t roundtab_79[4] = |
67 |
|
{ 0, 1, 0, 0 }; |
68 |
|
|
69 |
#define INITIAL_SKIP_THRESH (10) |
#define INITIAL_SKIP_THRESH (10) |
70 |
#define FINAL_SKIP_THRESH (50) |
#define FINAL_SKIP_THRESH (50) |
71 |
#define MAX_SAD00_FOR_SKIP (20) |
#define MAX_SAD00_FOR_SKIP (20) |
74 |
#define CHECK_CANDIDATE(X,Y,D) { \ |
#define CHECK_CANDIDATE(X,Y,D) { \ |
75 |
CheckCandidate((X),(Y), (D), &iDirection, data ); } |
CheckCandidate((X),(Y), (D), &iDirection, data ); } |
76 |
|
|
77 |
|
/***************************************************************************** |
78 |
|
* Code |
79 |
|
****************************************************************************/ |
80 |
|
|
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 |
{ |
{ |
506 |
const uint8_t *ReferenceF, *ReferenceB; |
const uint8_t *ReferenceF, *ReferenceB; |
507 |
VECTOR *current; |
VECTOR *current; |
508 |
|
|
509 |
if ( (xf > data->max_dx) | (xf < data->min_dx) |
if ( (xf > data->max_dx) || (xf < data->min_dx) |
510 |
| (yf > data->max_dy) | (yf < data->min_dy) ) return; |
|| (yf > data->max_dy) || (yf < data->min_dy) ) return; |
511 |
|
|
512 |
if (!data->qpel_precision) { |
if (!data->qpel_precision) { |
513 |
ReferenceF = GetReference(xf, yf, data); |
ReferenceF = GetReference(xf, yf, data); |
552 |
const uint8_t *ReferenceB; |
const uint8_t *ReferenceB; |
553 |
VECTOR mvs, b_mvs; |
VECTOR mvs, b_mvs; |
554 |
|
|
555 |
if (( x > 31) | ( x < -32) | ( y > 31) | (y < -32)) return; |
if (( x > 31) || ( x < -32) || ( y > 31) || (y < -32)) return; |
556 |
|
|
557 |
for (k = 0; k < 4; k++) { |
for (k = 0; k < 4; k++) { |
558 |
mvs.x = data->directmvF[k].x + x; |
mvs.x = data->directmvF[k].x + x; |
565 |
data->directmvB[k].y |
data->directmvB[k].y |
566 |
: mvs.y - data->referencemv[k].y); |
: mvs.y - data->referencemv[k].y); |
567 |
|
|
568 |
if ( (mvs.x > data->max_dx) | (mvs.x < data->min_dx) |
if ( (mvs.x > data->max_dx) || (mvs.x < data->min_dx) |
569 |
| (mvs.y > data->max_dy) | (mvs.y < data->min_dy) |
|| (mvs.y > data->max_dy) || (mvs.y < data->min_dy) |
570 |
| (b_mvs.x > data->max_dx) | (b_mvs.x < data->min_dx) |
|| (b_mvs.x > data->max_dx) || (b_mvs.x < data->min_dx) |
571 |
| (b_mvs.y > data->max_dy) | (b_mvs.y < data->min_dy) ) return; |
|| (b_mvs.y > data->max_dy) || (b_mvs.y < data->min_dy) ) return; |
572 |
|
|
573 |
if (data->qpel) { |
if (data->qpel) { |
574 |
xcf += mvs.x/2; ycf += mvs.y/2; |
xcf += mvs.x/2; ycf += mvs.y/2; |
659 |
CheckCandidateBits16(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateBits16(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
660 |
{ |
{ |
661 |
|
|
662 |
static int16_t in[64], coeff[64]; |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
663 |
int32_t bits = 0, sum; |
int32_t bits = 0, sum; |
664 |
VECTOR * current; |
VECTOR * current; |
665 |
const uint8_t * ptr; |
const uint8_t * ptr; |
721 |
} |
} |
722 |
} |
} |
723 |
|
|
724 |
bits += cbpy_tab[15-(cbp>>2)].len; |
bits += xvid_cbpy_tab[15-(cbp>>2)].len; |
725 |
bits += mcbpc_inter_tab[(MODE_INTER & 7) | ((cbp & 3) << 3)].len; |
bits += mcbpc_inter_tab[(MODE_INTER & 7) | ((cbp & 3) << 3)].len; |
726 |
|
|
727 |
if (bits < data->iMinSAD[0]) { |
if (bits < data->iMinSAD[0]) { |
744 |
CheckCandidateBits8(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
CheckCandidateBits8(const int x, const int y, const int Direction, int * const dir, const SearchData * const data) |
745 |
{ |
{ |
746 |
|
|
747 |
static int16_t in[64], coeff[64]; |
int16_t *in = data->dctSpace, *coeff = data->dctSpace + 64; |
748 |
int32_t sum, bits; |
int32_t sum, bits; |
749 |
VECTOR * current; |
VECTOR * current; |
750 |
const uint8_t * ptr; |
const uint8_t * ptr; |
1000 |
uint32_t x, y; |
uint32_t x, y; |
1001 |
uint32_t iIntra = 0; |
uint32_t iIntra = 0; |
1002 |
int32_t quant = current->quant, sad00; |
int32_t quant = current->quant, sad00; |
1003 |
|
int skip_thresh = INITIAL_SKIP_THRESH * |
1004 |
|
(current->global_flags & XVID_REDUCED ? 4:1) * |
1005 |
|
(current->global_flags & XVID_MODEDECISION_BITS ? 2:1); |
1006 |
|
|
1007 |
// some pre-initialized thingies for SearchP |
// some pre-initialized thingies for SearchP |
1008 |
int32_t temp[8]; |
int32_t temp[8]; |
1009 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
1010 |
VECTOR currentQMV[5]; |
VECTOR currentQMV[5]; |
1011 |
int32_t iMinSAD[5]; |
int32_t iMinSAD[5]; |
1012 |
|
DECLARE_ALIGNED_MATRIX(dct_space, 2, 64, int16_t, CACHE_LINE); |
1013 |
SearchData Data; |
SearchData Data; |
1014 |
memset(&Data, 0, sizeof(SearchData)); |
memset(&Data, 0, sizeof(SearchData)); |
1015 |
Data.iEdgedWidth = iEdgedWidth; |
Data.iEdgedWidth = iEdgedWidth; |
1022 |
Data.qpel = pParam->m_quarterpel; |
Data.qpel = pParam->m_quarterpel; |
1023 |
Data.chroma = MotionFlags & PMV_CHROMA16; |
Data.chroma = MotionFlags & PMV_CHROMA16; |
1024 |
Data.rrv = current->global_flags & XVID_REDUCED; |
Data.rrv = current->global_flags & XVID_REDUCED; |
1025 |
|
Data.dctSpace = dct_space; |
1026 |
|
|
1027 |
if ((current->global_flags & XVID_REDUCED)) { |
if ((current->global_flags & XVID_REDUCED)) { |
1028 |
mb_width = (pParam->width + 31) / 32; |
mb_width = (pParam->width + 31) / 32; |
1071 |
//initial skip decision |
//initial skip decision |
1072 |
/* no early skip for GMC (global vector = skip vector is unknown!) */ |
/* no early skip for GMC (global vector = skip vector is unknown!) */ |
1073 |
if (!(current->global_flags & XVID_GMC)) { /* no fast SKIP for S(GMC)-VOPs */ |
if (!(current->global_flags & XVID_GMC)) { /* no fast SKIP for S(GMC)-VOPs */ |
1074 |
if (pMB->dquant == NO_CHANGE && sad00 < pMB->quant * INITIAL_SKIP_THRESH * (Data.rrv ? 4:1) ) |
if (pMB->dquant == NO_CHANGE && sad00 < pMB->quant * skip_thresh) |
1075 |
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)) { |
1076 |
SkipMacroblockP(pMB, sad00); |
SkipMacroblockP(pMB, sad00); |
1077 |
continue; |
continue; |
1084 |
current->global_flags & XVID_INTER4V, pMB); |
current->global_flags & XVID_INTER4V, pMB); |
1085 |
|
|
1086 |
/* final skip decision, a.k.a. "the vector you found, really that good?" */ |
/* final skip decision, a.k.a. "the vector you found, really that good?" */ |
1087 |
if (!(current->global_flags & XVID_GMC)) { |
if (!(current->global_flags & XVID_GMC || current->global_flags & XVID_MODEDECISION_BITS)) { |
1088 |
if ( pMB->dquant == NO_CHANGE && sad00 < pMB->quant * MAX_SAD00_FOR_SKIP) { |
if ( pMB->dquant == NO_CHANGE && sad00 < pMB->quant * MAX_SAD00_FOR_SKIP) { |
|
if (!(current->global_flags & XVID_MODEDECISION_BITS)) { |
|
1089 |
if ( (100*pMB->sad16)/(sad00+1) > FINAL_SKIP_THRESH * (Data.rrv ? 4:1) ) |
if ( (100*pMB->sad16)/(sad00+1) > FINAL_SKIP_THRESH * (Data.rrv ? 4:1) ) |
1090 |
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)) |
1091 |
SkipMacroblockP(pMB, sad00); |
SkipMacroblockP(pMB, sad00); |
|
} else { // BITS mode decision |
|
|
if (pMB->sad16 > 10) |
|
|
SkipMacroblockP(pMB, sad00); // more than 10 bits would be used for this MB - skip |
|
|
|
|
|
} |
|
1092 |
} |
} |
1093 |
} |
} |
1094 |
if (pMB->mode == MODE_INTRA) |
if (pMB->mode == MODE_INTRA) |
1177 |
int mode = MODE_INTER; |
int mode = MODE_INTER; |
1178 |
|
|
1179 |
if (!(GlobalFlags & XVID_MODEDECISION_BITS)) { //normal, fast, SAD-based mode decision |
if (!(GlobalFlags & XVID_MODEDECISION_BITS)) { //normal, fast, SAD-based mode decision |
1180 |
int intra = 0; |
// int intra = 0; |
1181 |
int sad; |
int sad; |
1182 |
int InterBias = MV16_INTER_BIAS; |
int InterBias = MV16_INTER_BIAS; |
1183 |
if (inter4v == 0 || Data->iMinSAD[0] < Data->iMinSAD[1] + Data->iMinSAD[2] + |
if (inter4v == 0 || Data->iMinSAD[0] < Data->iMinSAD[1] + Data->iMinSAD[2] + |
1383 |
Data->currentQMV[i].y = 2 * Data->currentMV[i].y; |
Data->currentQMV[i].y = 2 * Data->currentMV[i].y; |
1384 |
} |
} |
1385 |
|
|
1386 |
if (MotionFlags & PMV_QUARTERPELREFINE16) |
if (MotionFlags & PMV_QUARTERPELREFINE16) { |
1387 |
if ((!(MotionFlags & QUARTERPELREFINE16_BITS)) || (Data->iMinSAD[0] < 200*(int)iQuant)) { |
|
|
Data->qpel_precision = 1; |
|
1388 |
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, |
1389 |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
pParam->width, pParam->height, Data->iFcode, 1, 0); |
1390 |
|
|
1391 |
|
if ((!(MotionFlags & QUARTERPELREFINE16_BITS)) || (Data->iMinSAD[0] < 200*(int)iQuant)) { |
1392 |
|
Data->qpel_precision = 1; |
1393 |
SubpelRefine(Data); |
SubpelRefine(Data); |
1394 |
} |
} |
1395 |
|
} |
1396 |
|
|
1397 |
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; |
1398 |
|
|
1824 |
} |
} |
1825 |
} |
} |
1826 |
|
|
1827 |
|
*Data->iMinSAD += Data->lambda16; |
1828 |
skip_sad = *Data->iMinSAD; |
skip_sad = *Data->iMinSAD; |
1829 |
|
|
1830 |
// DIRECT MODE DELTA VECTOR SEARCH. |
// DIRECT MODE DELTA VECTOR SEARCH. |
2151 |
|
|
2152 |
int i, mask; |
int i, mask; |
2153 |
VECTOR pmv[3]; |
VECTOR pmv[3]; |
2154 |
MACROBLOCK * pMB = &pMBs[x + y * pParam->mb_width]; |
MACROBLOCK * const pMB = &pMBs[x + y * pParam->mb_width]; |
2155 |
|
|
2156 |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
for (i = 0; i < 5; i++) Data->iMinSAD[i] = MV_MAX_ERROR; |
2157 |
|
|
2165 |
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 |
2166 |
|
|
2167 |
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, |
2168 |
pParam->width, pParam->height, Data->iFcode - pParam->m_quarterpel, 0, Data->rrv); |
pParam->width, pParam->height, Data->iFcode - pParam->m_quarterpel, 0, 0); |
2169 |
|
|
2170 |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
Data->Cur = pCur + (x + y * pParam->edged_width) * 16; |
2171 |
Data->Ref = pRef + (x + y * pParam->edged_width) * 16; |
Data->Ref = pRef + (x + y * pParam->edged_width) * 16; |
2177 |
pmv[0].x = pmv[0].y = 0; |
pmv[0].x = pmv[0].y = 0; |
2178 |
|
|
2179 |
CheckCandidate32I(0, 0, 255, &i, Data); |
CheckCandidate32I(0, 0, 255, &i, Data); |
2180 |
|
Data->iMinSAD[1] -= 50; |
2181 |
|
Data->iMinSAD[2] -= 50; |
2182 |
|
Data->iMinSAD[3] -= 50; |
2183 |
|
Data->iMinSAD[4] -= 50; |
2184 |
|
|
2185 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP * 4) { |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) { |
2186 |
|
|
2187 |
if (!(mask = make_mask(pmv, 1))) |
if (!(mask = make_mask(pmv, 1))) |
2188 |
CheckCandidate32I(pmv[1].x, pmv[1].y, mask, &i, Data); |
CheckCandidate32I(pmv[1].x, pmv[1].y, mask, &i, Data); |
2189 |
if (!(mask = make_mask(pmv, 2))) |
if (!(mask = make_mask(pmv, 2))) |
2190 |
CheckCandidate32I(pmv[2].x, pmv[2].y, mask, &i, Data); |
CheckCandidate32I(pmv[2].x, pmv[2].y, mask, &i, Data); |
2191 |
|
|
2192 |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP * 4) // diamond only if needed |
if (*Data->iMinSAD > 4 * MAX_SAD00_FOR_SKIP) // diamond only if needed |
2193 |
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, i); |
DiamondSearch(Data->currentMV->x, Data->currentMV->y, Data, i); |
2194 |
|
} |
2195 |
|
|
2196 |
for (i = 0; i < 4; i++) { |
for (i = 0; i < 4; i++) { |
2197 |
MACROBLOCK * MB = &pMBs[x + (i&1) + (y+(i>>1)) * pParam->mb_width]; |
MACROBLOCK * MB = &pMBs[x + (i&1) + (y+(i>>1)) * pParam->mb_width]; |
2200 |
MB->sad16 = Data->iMinSAD[i+1]; |
MB->sad16 = Data->iMinSAD[i+1]; |
2201 |
} |
} |
2202 |
} |
} |
|
} |
|
2203 |
|
|
2204 |
#define INTRA_BIAS 2500 |
#define INTRA_THRESH 2400 |
2205 |
#define INTRA_THRESH 1500 |
#define INTER_THRESH 1100 |
|
#define INTER_THRESH 1400 |
|
2206 |
|
|
2207 |
int |
int |
2208 |
MEanalysis( const IMAGE * const pRef, |
MEanalysis( const IMAGE * const pRef, |
2209 |
FRAMEINFO * const Current, |
const FRAMEINFO * const Current, |
2210 |
MBParam * const pParam, |
const MBParam * const pParam, |
2211 |
int maxIntra, //maximum number if non-I frames |
const int maxIntra, //maximum number if non-I frames |
2212 |
int intraCount, //number of non-I frames after last I frame; 0 if we force P/B frame |
const int intraCount, //number of non-I frames after last I frame; 0 if we force P/B frame |
2213 |
int bCount) // number of B frames in a row |
const int bCount, // number of B frames in a row |
2214 |
|
const int b_thresh) |
2215 |
{ |
{ |
2216 |
uint32_t x, y, intra = 0; |
uint32_t x, y, intra = 0; |
2217 |
int sSAD = 0; |
int sSAD = 0; |
2218 |
MACROBLOCK * const pMBs = Current->mbs; |
MACROBLOCK * const pMBs = Current->mbs; |
2219 |
const IMAGE * const pCurrent = &Current->image; |
const IMAGE * const pCurrent = &Current->image; |
2220 |
int IntraThresh = INTRA_THRESH, InterThresh = INTER_THRESH; |
int IntraThresh = INTRA_THRESH, InterThresh = INTER_THRESH + 10*b_thresh; |
2221 |
|
int s = 0, blocks = 0; |
2222 |
|
|
2223 |
int32_t iMinSAD[5], temp[5]; |
int32_t iMinSAD[5], temp[5]; |
2224 |
VECTOR currentMV[5]; |
VECTOR currentMV[5]; |
2227 |
Data.currentMV = currentMV; |
Data.currentMV = currentMV; |
2228 |
Data.iMinSAD = iMinSAD; |
Data.iMinSAD = iMinSAD; |
2229 |
Data.iFcode = Current->fcode; |
Data.iFcode = Current->fcode; |
|
Data.rrv = Current->global_flags & XVID_REDUCED; |
|
2230 |
Data.temp = temp; |
Data.temp = temp; |
2231 |
CheckCandidate = CheckCandidate32I; |
CheckCandidate = CheckCandidate32I; |
2232 |
|
|
2233 |
if (intraCount != 0 && intraCount < 10) // we're right after an I frame |
if (intraCount != 0 && intraCount < 10) // we're right after an I frame |
2234 |
IntraThresh += 4 * (intraCount - 10) * (intraCount - 10); |
IntraThresh += 8 * (intraCount - 10) * (intraCount - 10); |
2235 |
else |
else |
2236 |
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 |
2237 |
IntraThresh -= (IntraThresh * (maxIntra - 5*(maxIntra - intraCount)))/maxIntra; |
IntraThresh -= (IntraThresh * (maxIntra - 5*(maxIntra - intraCount)))/maxIntra; |
2238 |
|
|
2239 |
InterThresh += 400 * (1 - bCount); |
InterThresh -= (350 - 8*b_thresh) * bCount; |
2240 |
if (InterThresh < 300) InterThresh = 300; |
if (InterThresh < 300 + 5*b_thresh) InterThresh = 300 + 5*b_thresh; |
2241 |
|
|
2242 |
if (sadInit) (*sadInit) (); |
if (sadInit) (*sadInit) (); |
2243 |
|
|
2244 |
for (y = 1; y < pParam->mb_height-1; y += 2) { |
for (y = 1; y < pParam->mb_height-1; y += 2) { |
2245 |
for (x = 1; x < pParam->mb_width-1; x += 2) { |
for (x = 1; x < pParam->mb_width-1; x += 2) { |
2246 |
int i; |
int i; |
2247 |
|
blocks += 4; |
2248 |
|
|
2249 |
if (bCount == 0) pMBs[x + y * pParam->mb_width].mvs[0] = zeroMV; |
if (bCount == 0) pMBs[x + y * pParam->mb_width].mvs[0] = zeroMV; |
2250 |
|
else { //extrapolation of the vector found for last frame |
2251 |
|
pMBs[x + y * pParam->mb_width].mvs[0].x = |
2252 |
|
(pMBs[x + y * pParam->mb_width].mvs[0].x * (bCount+1) ) / bCount; |
2253 |
|
pMBs[x + y * pParam->mb_width].mvs[0].y = |
2254 |
|
(pMBs[x + y * pParam->mb_width].mvs[0].y * (bCount+1) ) / bCount; |
2255 |
|
} |
2256 |
|
|
2257 |
MEanalyzeMB(pRef->y, pCurrent->y, x, y, pParam, pMBs, &Data); |
MEanalyzeMB(pRef->y, pCurrent->y, x, y, pParam, pMBs, &Data); |
2258 |
|
|
2264 |
pParam->edged_width); |
pParam->edged_width); |
2265 |
if (dev + IntraThresh < pMB->sad16) { |
if (dev + IntraThresh < pMB->sad16) { |
2266 |
pMB->mode = MODE_INTRA; |
pMB->mode = MODE_INTRA; |
2267 |
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; |
2268 |
} |
} |
2269 |
} |
} |
2270 |
|
if (pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) s++; |
2271 |
|
|
2272 |
sSAD += pMB->sad16; |
sSAD += pMB->sad16; |
2273 |
} |
} |
2274 |
} |
} |
2275 |
} |
} |
2276 |
sSAD /= (pParam->mb_height-2)*(pParam->mb_width-2); |
|
2277 |
// if (sSAD > IntraThresh + INTRA_BIAS) return I_VOP; |
sSAD /= blocks; |
2278 |
|
s = (10*s) / blocks; |
2279 |
|
|
2280 |
|
if (s > 5) sSAD += (s - 4) * (180 - 2*b_thresh); //static block - looks bad when in bframe... |
2281 |
|
|
2282 |
if (sSAD > InterThresh ) return P_VOP; |
if (sSAD > InterThresh ) return P_VOP; |
2283 |
emms(); |
emms(); |
2284 |
return B_VOP; |
return B_VOP; |
|
|
|
2285 |
} |
} |
2286 |
|
|
2287 |
|
|
2313 |
double meanx,meany; |
double meanx,meany; |
2314 |
int num,oldnum; |
int num,oldnum; |
2315 |
|
|
2316 |
if (!MBmask) { fprintf(stderr,"Mem error\n"); return gmc;} |
if (!MBmask) { fprintf(stderr,"Mem error\n"); |
2317 |
|
gmc.duv[0].x= gmc.duv[0].y = |
2318 |
|
gmc.duv[1].x= gmc.duv[1].y = |
2319 |
|
gmc.duv[2].x= gmc.duv[2].y = 0; |
2320 |
|
return gmc; } |
2321 |
|
|
2322 |
// filter mask of all blocks |
// filter mask of all blocks |
2323 |
|
|
2324 |
for (my = 1; my < MBh-1; my++) |
for (my = 1; my < (uint32_t)MBh-1; my++) |
2325 |
for (mx = 1; mx < MBw-1; mx++) |
for (mx = 1; mx < (uint32_t)MBw-1; mx++) |
2326 |
{ |
{ |
2327 |
const int mbnum = mx + my * MBw; |
const int mbnum = mx + my * MBw; |
2328 |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
2338 |
MBmask[mbnum]=1; |
MBmask[mbnum]=1; |
2339 |
} |
} |
2340 |
|
|
2341 |
for (my = 1; my < MBh-1; my++) |
for (my = 1; my < (uint32_t)MBh-1; my++) |
2342 |
for (mx = 1; mx < MBw-1; mx++) |
for (mx = 1; mx < (uint32_t)MBw-1; mx++) |
2343 |
{ |
{ |
2344 |
const uint8_t *const pCur = current->image.y + 16*my*pParam->edged_width + 16*mx; |
const uint8_t *const pCur = current->image.y + 16*my*pParam->edged_width + 16*mx; |
2345 |
|
|
2347 |
if (!MBmask[mbnum]) |
if (!MBmask[mbnum]) |
2348 |
continue; |
continue; |
2349 |
|
|
2350 |
if (sad16 ( pCur, pCur+1 , pParam->edged_width, 65536) <= grad ) |
if (sad16 ( pCur, pCur+1 , pParam->edged_width, 65536) <= (uint32_t)grad ) |
2351 |
MBmask[mbnum] = 0; |
MBmask[mbnum] = 0; |
2352 |
if (sad16 ( pCur, pCur+pParam->edged_width, pParam->edged_width, 65536) <= grad ) |
if (sad16 ( pCur, pCur+pParam->edged_width, pParam->edged_width, 65536) <= (uint32_t)grad ) |
2353 |
MBmask[mbnum] = 0; |
MBmask[mbnum] = 0; |
2354 |
|
|
2355 |
} |
} |
2360 |
|
|
2361 |
a = b = c = n = 0; |
a = b = c = n = 0; |
2362 |
DtimesF[0] = DtimesF[1] = DtimesF[2] = DtimesF[3] = 0.; |
DtimesF[0] = DtimesF[1] = DtimesF[2] = DtimesF[3] = 0.; |
2363 |
for (my = 0; my < MBh; my++) |
for (my = 0; my < (uint32_t)MBh; my++) |
2364 |
for (mx = 0; mx < MBw; mx++) |
for (mx = 0; mx < (uint32_t)MBw; mx++) |
2365 |
{ |
{ |
2366 |
const int mbnum = mx + my * MBw; |
const int mbnum = mx + my * MBw; |
2367 |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
2398 |
|
|
2399 |
meanx = meany = 0.; |
meanx = meany = 0.; |
2400 |
oldnum = 0; |
oldnum = 0; |
2401 |
for (my = 0; my < MBh; my++) |
for (my = 0; my < (uint32_t)MBh; my++) |
2402 |
for (mx = 0; mx < MBw; mx++) |
for (mx = 0; mx < (uint32_t)MBw; mx++) |
2403 |
{ |
{ |
2404 |
const int mbnum = mx + my * MBw; |
const int mbnum = mx + my * MBw; |
2405 |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
2427 |
fprintf(stderr,"meanx = %8.5f meany = %8.5f %d\n",meanx,meany, oldnum); |
fprintf(stderr,"meanx = %8.5f meany = %8.5f %d\n",meanx,meany, oldnum); |
2428 |
*/ |
*/ |
2429 |
num = 0; |
num = 0; |
2430 |
for (my = 0; my < MBh; my++) |
for (my = 0; my < (uint32_t)MBh; my++) |
2431 |
for (mx = 0; mx < MBw; mx++) |
for (mx = 0; mx < (uint32_t)MBw; mx++) |
2432 |
{ |
{ |
2433 |
const int mbnum = mx + my * MBw; |
const int mbnum = mx + my * MBw; |
2434 |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
const MACROBLOCK *pMB = &pMBs[mbnum]; |
2549 |
int cbp = 0, bits = 0, t = 0, i, iDirection; |
int cbp = 0, bits = 0, t = 0, i, iDirection; |
2550 |
SearchData Data2, *Data8 = &Data2; |
SearchData Data2, *Data8 = &Data2; |
2551 |
int sumx = 0, sumy = 0; |
int sumx = 0, sumy = 0; |
2552 |
int16_t in[64], coeff[64]; |
int16_t *in = Data->dctSpace, *coeff = Data->dctSpace + 64; |
2553 |
|
|
2554 |
memcpy(Data8, Data, sizeof(SearchData)); |
memcpy(Data8, Data, sizeof(SearchData)); |
2555 |
CheckCandidate = CheckCandidateBits8; |
CheckCandidate = CheckCandidateBits8; |
2676 |
bits += CodeCoeffInter_CalcBits(coeff, scan_tables[0]); |
bits += CodeCoeffInter_CalcBits(coeff, scan_tables[0]); |
2677 |
cbp |= 1 << (5 - 5); |
cbp |= 1 << (5 - 5); |
2678 |
} |
} |
2679 |
bits += cbpy_tab[15-(cbp>>2)].len; |
bits += xvid_cbpy_tab[15-(cbp>>2)].len; |
2680 |
bits += mcbpc_inter_tab[(MODE_INTER4V & 7) | ((cbp & 3) << 3)].len; |
bits += mcbpc_inter_tab[(MODE_INTER4V & 7) | ((cbp & 3) << 3)].len; |
2681 |
} |
} |
2682 |
} |
} |
2691 |
int bits = 1; //this one is ac/dc prediction flag. always 1. |
int bits = 1; //this one is ac/dc prediction flag. always 1. |
2692 |
int cbp = 0, i, t, dc = 0, b_dc = 1024; |
int cbp = 0, i, t, dc = 0, b_dc = 1024; |
2693 |
const uint32_t iQuant = Data->lambda16; |
const uint32_t iQuant = Data->lambda16; |
2694 |
int16_t in[64], coeff[64]; |
int16_t *in = Data->dctSpace, * coeff = Data->dctSpace + 64; |
2695 |
|
|
2696 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
2697 |
uint32_t iDcScaler = get_dc_scaler(iQuant, 1); |
uint32_t iDcScaler = get_dc_scaler(iQuant, 1); |
2726 |
|
|
2727 |
bits += t = CodeCoeffIntra_CalcBits(coeff, scan_tables[0]) + dcc_tab[coeff[0] + 255].len; |
bits += t = CodeCoeffIntra_CalcBits(coeff, scan_tables[0]) + dcc_tab[coeff[0] + 255].len; |
2728 |
if (t != 0) cbp |= 1 << (5 - 4); |
if (t != 0) cbp |= 1 << (5 - 4); |
|
Data->temp[4] = t; |
|
2729 |
|
|
2730 |
if (bits < Data->iMinSAD[0]) { |
if (bits < Data->iMinSAD[0]) { |
2731 |
|
iDcScaler = get_dc_scaler(iQuant, 1); |
2732 |
//chroma V |
//chroma V |
2733 |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
transfer_8to16copy(in, Data->CurV, Data->iEdgedWidth/2); |
2734 |
fdct(in); |
fdct(in); |
2739 |
bits += t = CodeCoeffIntra_CalcBits(coeff, scan_tables[0]) + dcc_tab[coeff[0] + 255].len; |
bits += t = CodeCoeffIntra_CalcBits(coeff, scan_tables[0]) + dcc_tab[coeff[0] + 255].len; |
2740 |
if (t != 0) cbp |= 1 << (5 - 5); |
if (t != 0) cbp |= 1 << (5 - 5); |
2741 |
|
|
2742 |
Data->temp[5] = t; |
bits += xvid_cbpy_tab[cbp>>2].len; |
2743 |
|
bits += mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp & 3) << 3)].len; |
|
bits += t = cbpy_tab[cbp>>2].len; |
|
|
Data->temp[6] = t; |
|
|
|
|
|
bits += t = mcbpc_inter_tab[(MODE_INTRA & 7) | ((cbp & 3) << 3)].len; |
|
|
Data->temp[7] = t; |
|
|
|
|
2744 |
} |
} |
2745 |
} |
} |
|
|
|
2746 |
return bits; |
return bits; |
2747 |
} |
} |