36 |
|
|
37 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
38 |
|
|
39 |
|
#ifdef _DEBUG |
40 |
|
# include "../motion/estimation.h" |
41 |
|
# include "../motion/motion_inlines.h" |
42 |
|
# include <assert.h> |
43 |
|
#endif |
44 |
|
|
45 |
|
|
46 |
#define LEVELOFFSET 32 |
#define LEVELOFFSET 32 |
47 |
|
|
48 |
/* Initialized once during xvid_global call |
/* Initialized once during xvid_global call |
206 |
static __inline void |
static __inline void |
207 |
CodeVector(Bitstream * bs, |
CodeVector(Bitstream * bs, |
208 |
int32_t value, |
int32_t value, |
209 |
int32_t f_code, |
int32_t f_code) |
|
Statistics * pStat) |
|
210 |
{ |
{ |
211 |
|
|
212 |
const int scale_factor = 1 << (f_code - 1); |
const int scale_factor = 1 << (f_code - 1); |
218 |
if (value > (cmp - 1)) |
if (value > (cmp - 1)) |
219 |
value -= 64 * scale_factor; |
value -= 64 * scale_factor; |
220 |
|
|
|
pStat->iMvSum += value * value; |
|
|
pStat->iMvCount++; |
|
|
|
|
221 |
if (value == 0) { |
if (value == 0) { |
222 |
BitstreamPutBits(bs, mb_motion_table[32].code, |
BitstreamPutBits(bs, mb_motion_table[32].code, |
223 |
mb_motion_table[32].len); |
mb_motion_table[32].len); |
579 |
#endif |
#endif |
580 |
} |
} |
581 |
} |
} |
582 |
|
|
583 |
|
bits = BitstreamPos(bs); |
584 |
|
|
585 |
/* code motion vector(s) if motion is local */ |
/* code motion vector(s) if motion is local */ |
586 |
if (!pMB->mcsel) |
if (!pMB->mcsel) |
587 |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
588 |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode); |
589 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode); |
590 |
|
|
591 |
|
#ifdef _DEBUG |
592 |
|
if (i == 0) /* for simplicity */ { |
593 |
|
int coded_length = BitstreamPos(bs) - bits; |
594 |
|
int estimated_length = d_mv_bits(pMB->pmvs[i].x, pMB->pmvs[i].y, zeroMV, frame->fcode, 0); |
595 |
|
assert(estimated_length == coded_length); |
596 |
|
d_mv_bits(pMB->pmvs[i].x, pMB->pmvs[i].y, zeroMV, frame->fcode, 0); |
597 |
|
} |
598 |
|
#endif |
599 |
} |
} |
600 |
|
|
601 |
|
bits = BitstreamPos(bs) - bits; |
602 |
|
pStat->iMVBits += bits; |
603 |
|
|
604 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
605 |
|
|
606 |
/* code block coeffs */ |
/* code block coeffs */ |
628 |
if (frame->coding_type != I_VOP) |
if (frame->coding_type != I_VOP) |
629 |
BitstreamPutBit(bs, 0); /* not_coded */ |
BitstreamPutBit(bs, 0); /* not_coded */ |
630 |
|
|
631 |
|
if (frame->vop_flags & XVID_VOP_GREYSCALE) { |
632 |
|
pMB->cbp &= 0x3C; /* keep only bits 5-2 */ |
633 |
|
qcoeff[4*64+0]=0; /* for INTRA DC value is saved */ |
634 |
|
qcoeff[5*64+0]=0; |
635 |
|
} |
636 |
|
|
637 |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
638 |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
639 |
else |
else |
720 |
scan_tables[2] : scan_tables[0]; |
scan_tables[2] : scan_tables[0]; |
721 |
int bits; |
int bits; |
722 |
|
|
|
|
|
723 |
/* ------------------------------------------------------------------ |
/* ------------------------------------------------------------------ |
724 |
when a block is skipped it is decoded DIRECT(0,0) |
when a block is skipped it is decoded DIRECT(0,0) |
725 |
hence is interpolated from forward & backward frames |
hence is interpolated from forward & backward frames |
768 |
} |
} |
769 |
} |
} |
770 |
|
|
771 |
|
bits = BitstreamPos(bs); |
772 |
|
|
773 |
switch (mb->mode) { |
switch (mb->mode) { |
774 |
case MODE_INTERPOLATE: |
case MODE_INTERPOLATE: |
775 |
CodeVector(bs, mb->pmvs[1].x, vcode, pStat); /* forward vector of interpolate mode */ |
CodeVector(bs, mb->pmvs[1].x, vcode); /* forward vector of interpolate mode */ |
776 |
CodeVector(bs, mb->pmvs[1].y, vcode, pStat); |
CodeVector(bs, mb->pmvs[1].y, vcode); |
777 |
case MODE_BACKWARD: |
case MODE_BACKWARD: |
778 |
vcode = bcode; |
vcode = bcode; |
779 |
case MODE_FORWARD: |
case MODE_FORWARD: |
780 |
CodeVector(bs, mb->pmvs[0].x, vcode, pStat); |
CodeVector(bs, mb->pmvs[0].x, vcode); |
781 |
CodeVector(bs, mb->pmvs[0].y, vcode, pStat); |
CodeVector(bs, mb->pmvs[0].y, vcode); |
782 |
break; |
break; |
783 |
case MODE_DIRECT: |
case MODE_DIRECT: |
784 |
CodeVector(bs, mb->pmvs[3].x, 1, pStat); /* fcode is always 1 for delta vector */ |
CodeVector(bs, mb->pmvs[3].x, 1); /* fcode is always 1 for delta vector */ |
785 |
CodeVector(bs, mb->pmvs[3].y, 1, pStat); /* prediction is always (0,0) */ |
CodeVector(bs, mb->pmvs[3].y, 1); /* prediction is always (0,0) */ |
786 |
default: break; |
default: break; |
787 |
} |
} |
788 |
|
pStat->iMVBits += BitstreamPos(bs) - bits; |
789 |
|
|
790 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
791 |
for (i = 0; i < 6; i++) { |
for (i = 0; i < 6; i++) { |
1096 |
break; |
break; |
1097 |
} |
} |
1098 |
coeff += run; |
coeff += run; |
1099 |
|
|
1100 |
|
#ifdef _DEBUG |
1101 |
|
if(coeff>=64) { |
1102 |
|
DPRINTF(XVID_DEBUG_ERROR,"error: overflow in coefficient index\n"); |
1103 |
|
return; |
1104 |
|
} |
1105 |
|
#endif |
1106 |
|
|
1107 |
block[scan[coeff]] = level; |
block[scan[coeff]] = level; |
1108 |
|
|
1109 |
DPRINTF(XVID_DEBUG_COEFF,"block[%i] %i\n", scan[coeff], level); |
DPRINTF(XVID_DEBUG_COEFF,"block[%i] %i\n", scan[coeff], level); |
1145 |
} |
} |
1146 |
p += run; |
p += run; |
1147 |
|
|
1148 |
|
#ifdef _DEBUG |
1149 |
|
if(p>=64) { |
1150 |
|
DPRINTF(XVID_DEBUG_ERROR,"error: overflow in coefficient index\n"); |
1151 |
|
return; |
1152 |
|
} |
1153 |
|
#endif |
1154 |
|
|
1155 |
if (level < 0) { |
if (level < 0) { |
1156 |
level = level*quant_m_2 - quant_add; |
level = level*quant_m_2 - quant_add; |
1157 |
block[scan[p]] = (level >= -2048 ? level : -2048); |
block[scan[p]] = (level >= -2048 ? level : -2048); |
1187 |
} |
} |
1188 |
p += run; |
p += run; |
1189 |
|
|
1190 |
|
#ifdef _DEBUG |
1191 |
|
if(p>=64) { |
1192 |
|
DPRINTF(XVID_DEBUG_ERROR,"error: overflow in coefficient index\n"); |
1193 |
|
return; |
1194 |
|
} |
1195 |
|
#endif |
1196 |
|
|
1197 |
if (level < 0) { |
if (level < 0) { |
1198 |
level = ((2 * -level + 1) * matrix[scan[p]] * quant) >> 4; |
level = ((2 * -level + 1) * matrix[scan[p]] * quant) >> 4; |
1199 |
block[scan[p]] = (level <= 2048 ? -level : -2048); |
block[scan[p]] = (level <= 2048 ? -level : -2048); |
1990 |
}; |
}; |
1991 |
|
|
1992 |
short const dc_threshold[] = { |
short const dc_threshold[] = { |
1993 |
21514, 26984, 8307, 28531, 29798, 24951, 25970, 26912, |
26708, 29545, 29472, 26223, 30580, 29281, 8293, 29545, |
1994 |
8307, 25956, 26994, 25974, 8292, 29286, 28015, 29728, |
25632, 29285, 30313, 25701, 26144, 28530, 8301, 26740, |
1995 |
25960, 18208, 21838, 18208, 19536, 22560, 26998, 8260, |
8293, 20039, 8277, 20551, 8268, 30296, 17513, 25376, |
1996 |
28515, 25956, 8291, 25640, 30309, 27749, 11817, 22794, |
25711, 25445, 10272, 11825, 11825, 10544, 2606, 28505, |
1997 |
30063, 8306, 28531, 29798, 24951, 25970, 25632, 29545, |
29301, 29472, 26223, 30580, 29281, 8293, 26980, 29811, |
1998 |
29300, 25193, 29813, 29295, 26656, 29537, 29728, 8303, |
26994, 30050, 28532, 8306, 24936, 8307, 28532, 26400, |
1999 |
26983, 25974, 24864, 25443, 29541, 8307, 28532, 26912, |
30313, 8293, 25441, 25955, 29555, 29728, 8303, 29801, |
2000 |
29556, 29472, 30063, 25458, 8293, 28515, 25956, 2606 |
8307, 28531, 29301, 25955, 25376, 25711, 11877, 10 |
2001 |
}; |
}; |
2002 |
|
|
2003 |
VLC const dc_lum_tab[] = { |
VLC const dc_lum_tab[] = { |