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 |
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); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode); |
589 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode); |
590 |
|
|
591 |
|
#if 0 /* #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; |
bits = BitstreamPos(bs) - bits; |
1075 |
return (level << 20) >> 20; |
return (level << 20) >> 20; |
1076 |
|
|
1077 |
error: |
error: |
1078 |
*run = VLC_ERROR; |
*run = 64; |
1079 |
return 0; |
return 0; |
1080 |
} |
} |
1081 |
|
|
1087 |
{ |
{ |
1088 |
|
|
1089 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[direction]; |
1090 |
int level, run, last; |
int level, run, last = 0; |
1091 |
|
|
1092 |
do { |
do { |
1093 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
|
if (run == -1) { |
|
|
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run"); |
|
|
break; |
|
|
} |
|
1094 |
coeff += run; |
coeff += run; |
1095 |
|
if (coeff & ~63) { |
1096 |
#ifdef _DEBUG |
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run or index"); |
1097 |
if(coeff>=64) { |
break; |
|
DPRINTF(XVID_DEBUG_ERROR,"error: overflow in coefficient index\n"); |
|
|
return; |
|
1098 |
} |
} |
|
#endif |
|
1099 |
|
|
1100 |
block[scan[coeff]] = level; |
block[scan[coeff]] = level; |
1101 |
|
|
1127 |
int p; |
int p; |
1128 |
int level; |
int level; |
1129 |
int run; |
int run; |
1130 |
int last; |
int last = 0; |
1131 |
|
|
1132 |
p = 0; |
p = 0; |
1133 |
do { |
do { |
1134 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
|
if (run == -1) { |
|
|
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run"); |
|
|
break; |
|
|
} |
|
1135 |
p += run; |
p += run; |
1136 |
|
if (p & ~63) { |
1137 |
#ifdef _DEBUG |
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run or index"); |
1138 |
if(p>=64) { |
break; |
|
DPRINTF(XVID_DEBUG_ERROR,"error: overflow in coefficient index\n"); |
|
|
return; |
|
1139 |
} |
} |
|
#endif |
|
1140 |
|
|
1141 |
if (level < 0) { |
if (level < 0) { |
1142 |
level = level*quant_m_2 - quant_add; |
level = level*quant_m_2 - quant_add; |
1162 |
int p; |
int p; |
1163 |
int level; |
int level; |
1164 |
int run; |
int run; |
1165 |
int last; |
int last = 0; |
1166 |
|
|
1167 |
p = 0; |
p = 0; |
1168 |
do { |
do { |
1169 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
|
if (run == -1) { |
|
|
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run"); |
|
|
break; |
|
|
} |
|
1170 |
p += run; |
p += run; |
1171 |
|
if (p & ~63) { |
1172 |
#ifdef _DEBUG |
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run or index"); |
1173 |
if(p>=64) { |
break; |
|
DPRINTF(XVID_DEBUG_ERROR,"error: overflow in coefficient index\n"); |
|
|
return; |
|
1174 |
} |
} |
|
#endif |
|
1175 |
|
|
1176 |
if (level < 0) { |
if (level < 0) { |
1177 |
level = ((2 * -level + 1) * matrix[scan[p]] * quant) >> 4; |
level = ((2 * -level + 1) * matrix[scan[p]] * quant) >> 4; |