1 |
|
/***************************************************************************** |
2 |
|
* |
3 |
|
* XVID MPEG-4 VIDEO CODEC |
4 |
|
* - Macro Block coding functions - |
5 |
|
* |
6 |
|
* Copyright(C) 2002 Michael Militzer <isibaar@xvid.org> |
7 |
|
* |
8 |
|
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
9 |
|
* |
10 |
|
* XviD is free software; you can redistribute it and/or modify it |
11 |
|
* under the terms of the GNU General Public License as published by |
12 |
|
* the Free Software Foundation; either version 2 of the License, or |
13 |
|
* (at your option) any later version. |
14 |
|
* |
15 |
|
* This program is distributed in the hope that it will be useful, |
16 |
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
17 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
18 |
|
* GNU General Public License for more details. |
19 |
|
* |
20 |
|
* You should have received a copy of the GNU General Public License |
21 |
|
* along with this program; if not, write to the Free Software |
22 |
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
23 |
|
* |
24 |
|
* Under section 8 of the GNU General Public License, the copyright |
25 |
|
* holders of XVID explicitly forbid distribution in the following |
26 |
|
* countries: |
27 |
|
* |
28 |
|
* - Japan |
29 |
|
* - United States of America |
30 |
|
* |
31 |
|
* Linking XviD statically or dynamically with other modules is making a |
32 |
|
* combined work based on XviD. Thus, the terms and conditions of the |
33 |
|
* GNU General Public License cover the whole combination. |
34 |
|
* |
35 |
|
* As a special exception, the copyright holders of XviD give you |
36 |
|
* permission to link XviD with independent modules that communicate with |
37 |
|
* XviD solely through the VFW1.1 and DShow interfaces, regardless of the |
38 |
|
* license terms of these independent modules, and to copy and distribute |
39 |
|
* the resulting combined work under terms of your choice, provided that |
40 |
|
* every copy of the combined work is accompanied by a complete copy of |
41 |
|
* the source code of XviD (the version of XviD used to produce the |
42 |
|
* combined work), being distributed under the terms of the GNU General |
43 |
|
* Public License plus this exception. An independent module is a module |
44 |
|
* which is not derived from or based on XviD. |
45 |
|
* |
46 |
|
* Note that people who make modified versions of XviD are not obligated |
47 |
|
* to grant this special exception for their modified versions; it is |
48 |
|
* their choice whether to do so. The GNU General Public License gives |
49 |
|
* permission to release a modified version without this exception; this |
50 |
|
* exception also makes it possible to release a modified version which |
51 |
|
* carries forward this exception. |
52 |
|
* |
53 |
|
* $Id: mbcoding.c,v 1.36 2003-01-04 04:28:48 suxen_drol Exp $ |
54 |
|
* |
55 |
|
****************************************************************************/ |
56 |
|
|
57 |
|
#include <stdlib.h> |
58 |
#include "../portab.h" |
#include "../portab.h" |
59 |
#include "bitstream.h" |
#include "bitstream.h" |
60 |
#include "zigzag.h" |
#include "zigzag.h" |
61 |
#include "vlc_codes.h" |
#include "vlc_codes.h" |
62 |
|
#include "mbcoding.h" |
63 |
|
|
64 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
65 |
|
|
|
#include <stdlib.h> /* malloc, free */ |
|
|
|
|
|
#define ESCAPE 7167 |
|
66 |
#define ABS(X) (((X)>0)?(X):-(X)) |
#define ABS(X) (((X)>0)?(X):-(X)) |
67 |
#define CLIP(X,A) (X > A) ? (A) : (X) |
#define CLIP(X,A) (X > A) ? (A) : (X) |
68 |
|
|
69 |
static VLC *DCT3D[2]; |
/***************************************************************************** |
70 |
|
* Local data |
71 |
VLC *intra_table, *inter_table; |
****************************************************************************/ |
72 |
static short clip_table[4096]; |
|
73 |
|
/* msvc sp5+pp gets confused if they globals are made static */ |
74 |
|
static VLC intra_table[524288]; |
75 |
|
static VLC inter_table[524288]; |
76 |
|
|
77 |
|
static VLC DCT3Dintra[4096]; |
78 |
|
static VLC DCT3Dinter[4096]; |
79 |
|
|
80 |
|
/***************************************************************************** |
81 |
|
* Vector Length Coding Initialization |
82 |
|
****************************************************************************/ |
83 |
|
|
84 |
void create_vlc_tables(void) |
void |
85 |
|
init_vlc_tables(void) |
86 |
{ |
{ |
87 |
|
|
88 |
int32_t k, l, i, intra, last; |
int32_t k, l, i, intra, last; |
89 |
VLC *vlc[2]; |
VLC *vlc[2]; |
90 |
VLC **coeff_ptr; |
VLC const **coeff_ptr; |
91 |
VLC *vlc1, *vlc2; |
VLC *vlc1, *vlc2; |
92 |
|
|
|
VLC *DCT3Dintra; |
|
|
VLC *DCT3Dinter; |
|
|
|
|
|
DCT3Dintra = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
DCT3Dinter = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
|
|
93 |
vlc1 = DCT3Dintra; |
vlc1 = DCT3Dintra; |
94 |
vlc2 = DCT3Dinter; |
vlc2 = DCT3Dinter; |
95 |
|
|
96 |
vlc[0] = intra_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[0] = intra_table; |
97 |
vlc[1] = inter_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[1] = inter_table; |
|
|
|
|
// initialize the clipping table |
|
|
for(i = -2048; i < 2048; i++) { |
|
|
clip_table[i + 2048] = i; |
|
|
if(i < -255) |
|
|
clip_table[i + 2048] = -255; |
|
|
if(i > 255) |
|
|
clip_table[i + 2048] = 255; |
|
|
} |
|
98 |
|
|
99 |
// generate intra/inter vlc lookup table |
/* |
100 |
|
* Generate encoding vlc lookup tables |
101 |
|
* the lookup table idea is taken from the excellent fame project |
102 |
|
* by Vivien Chapellier |
103 |
|
*/ |
104 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
105 |
intra = i % 2; |
intra = i % 2; |
106 |
last = i >> 1; |
last = i / 2; |
107 |
|
|
108 |
coeff_ptr = coeff_vlc[last + (intra << 1)]; |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
109 |
|
|
110 |
for(k = -255; k < 256; k++) { // level |
for (k = -2047; k < 2048; k++) { /* level */ |
111 |
char *max_level_ptr = max_level[last + (intra << 1)]; |
int8_t const *max_level_ptr = max_level[last + 2 * intra]; |
112 |
char *max_run_ptr = max_run[last + (intra << 1)]; |
int8_t const *max_run_ptr = max_run[last + 2 * intra]; |
113 |
|
|
114 |
for(l = 0; l < 64; l++) { // run |
for (l = 0; l < 64; l++) { /* run */ |
115 |
int32_t level = k; |
int32_t level = k; |
116 |
uint32_t run = l; |
ptr_t run = l; |
117 |
|
|
118 |
if(abs(level) <= max_level_ptr[run] && run <= max_run_ptr[abs(level)]) { |
if ((abs(level) <= max_level_ptr[run]) && (run <= (uint32_t) max_run_ptr[abs(level)])) { /* level < max_level and run < max_run */ |
119 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (coeff_ptr[run][level - 1].code) << 1; |
|
|
vlc[intra]->len = coeff_ptr[run][level - 1].len + 1; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = ((coeff_ptr[run][-level - 1].code) << 1) + 1; |
|
|
vlc[intra]->len = coeff_ptr[run][-level - 1].len + 1; |
|
|
} |
|
|
else { |
|
120 |
vlc[intra]->code = 0; |
vlc[intra]->code = 0; |
121 |
vlc[intra]->len = 0; |
vlc[intra]->len = 0; |
122 |
} |
goto loop_end; |
123 |
} else { |
} else { |
124 |
if(level > 0) |
if (level > 0) /* correct level */ |
125 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
126 |
else |
else |
127 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; |
128 |
|
|
129 |
if(abs(level) <= max_level_ptr[run] && |
if ((abs(level) <= max_level_ptr[run]) && |
130 |
run <= max_run_ptr[abs(level)]) { |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
131 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (0x06 << (coeff_ptr[run][level - 1].len + 1)) | |
|
|
(coeff_ptr[run][level - 1].code << 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][level - 1].len + 1) + 8; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = (0x06 << (coeff_ptr[run][-level - 1].len + 1)) | |
|
|
((coeff_ptr[run][-level - 1].code << 1) + 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][-level - 1].len + 1) + 8; |
|
|
} |
|
|
else { |
|
132 |
vlc[intra]->code = 0x06; |
vlc[intra]->code = 0x06; |
133 |
vlc[intra]->len = 8; |
vlc[intra]->len = 8; |
134 |
|
goto loop_end; |
135 |
} |
} |
136 |
} else { |
|
137 |
if(level > 0) |
if (level > 0) /* still here? */ |
138 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; /* restore level */ |
139 |
else |
else |
140 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
141 |
|
|
142 |
run -= max_run_ptr[abs(level)] + 1; |
run -= max_run_ptr[abs(level)] + 1; /* and change run */ |
143 |
|
|
144 |
if(abs(level) <= max_level_ptr[run] && |
if ((abs(level) <= max_level_ptr[run]) && |
145 |
run <= max_run_ptr[abs(level)]) { |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
146 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (0x0e << (coeff_ptr[run][level - 1].len + 1)) | |
|
|
(coeff_ptr[run][level - 1].code << 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][level - 1].len + 1) + 9; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = (0x0e << (coeff_ptr[run][-level - 1].len + 1)) | |
|
|
((coeff_ptr[run][-level - 1].code << 1) + 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][-level - 1].len + 1) + 9; |
|
|
} |
|
|
else { |
|
147 |
vlc[intra]->code = 0x0e; |
vlc[intra]->code = 0x0e; |
148 |
vlc[intra]->len = 9; |
vlc[intra]->len = 9; |
149 |
|
goto loop_end; |
150 |
} |
} |
|
} else { |
|
|
if(level != 0) |
|
151 |
run += max_run_ptr[abs(level)] + 1; |
run += max_run_ptr[abs(level)] + 1; |
152 |
else |
} |
|
run++; |
|
153 |
|
|
154 |
vlc[intra]->code = (uint32_t) ((0x1e + last) << 20) | |
vlc[intra]->code = |
155 |
(l << 14) | (1 << 13) | ((k & 0xfff) << 1) | 1; |
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
156 |
|
((k & 0xfff) << 1) | 1; |
157 |
|
|
158 |
vlc[intra]->len = 30; |
vlc[intra]->len = 30; |
159 |
|
vlc[intra]++; |
160 |
|
continue; |
161 |
|
|
162 |
|
loop_end: |
163 |
|
if (level != 0) { |
164 |
|
vlc[intra]->code = |
165 |
|
(vlc[intra]-> |
166 |
|
code << (coeff_ptr[run][abs(level) - 1].len + |
167 |
|
1)) | (coeff_ptr[run][abs(level) - |
168 |
|
1].code << 1); |
169 |
|
vlc[intra]->len = |
170 |
|
(coeff_ptr[run][abs(level) - 1].len + 1) + |
171 |
|
vlc[intra]->len; |
172 |
|
|
173 |
|
if (level < 0) |
174 |
|
vlc[intra]->code += 1; |
175 |
} |
} |
176 |
} |
|
|
} |
|
177 |
vlc[intra]++; |
vlc[intra]++; |
178 |
} |
} |
179 |
} |
} |
180 |
} |
} |
|
intra_table += 64*255; // center vlc tables |
|
|
inter_table += 64*255; // center vlc tables |
|
181 |
|
|
182 |
for(i = 0; i < 4096; i++) { |
for(i = 0; i < 4096; i++) { |
183 |
if(i >= 512) { |
if(i >= 512) { |
184 |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
185 |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
186 |
} |
} else if (i >= 128) { |
|
else if(i >= 128) { |
|
187 |
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
188 |
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
189 |
} |
} else if (i >= 8) { |
|
else if(i >= 8) { |
|
190 |
*vlc1 = DCT3Dtab5[i - 8]; |
*vlc1 = DCT3Dtab5[i - 8]; |
191 |
*vlc2 = DCT3Dtab2[i - 8]; |
*vlc2 = DCT3Dtab2[i - 8]; |
192 |
} |
} else { |
|
else { |
|
193 |
*vlc1 = ERRtab[i]; |
*vlc1 = ERRtab[i]; |
194 |
*vlc2 = ERRtab[i]; |
*vlc2 = ERRtab[i]; |
195 |
} |
} |
202 |
|
|
203 |
} |
} |
204 |
|
|
205 |
void destroy_vlc_tables(void) { |
/***************************************************************************** |
206 |
|
* Local inlined functions for MB coding |
207 |
if(intra_table != NULL && inter_table != NULL) { |
****************************************************************************/ |
208 |
intra_table -= 64*255; // uncenter vlc tables |
|
209 |
inter_table -= 64*255; // uncenter vlc tables |
static __inline void |
210 |
|
CodeVector(Bitstream * bs, |
211 |
free(intra_table); |
int32_t value, |
212 |
free(inter_table); |
int32_t f_code, |
213 |
} |
Statistics * pStat) |
|
|
|
|
if(DCT3D[0] != NULL && DCT3D[1] != NULL) { |
|
|
free(DCT3D[0]); |
|
|
free(DCT3D[1]); |
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
static __inline void CodeVector(Bitstream *bs, int16_t value, int16_t f_code, Statistics *pStat) |
|
214 |
{ |
{ |
215 |
|
|
216 |
const int scale_factor = 1 << (f_code - 1); |
const int scale_factor = 1 << (f_code - 1); |
217 |
const int cmp = scale_factor << 5; |
const int cmp = scale_factor << 5; |
218 |
|
|
225 |
pStat->iMvSum += value * value; |
pStat->iMvSum += value * value; |
226 |
pStat->iMvCount++; |
pStat->iMvCount++; |
227 |
|
|
228 |
if (value == 0) |
if (value == 0) { |
229 |
BitstreamPutBits(bs, mb_motion_table[32].code, mb_motion_table[32].len); |
BitstreamPutBits(bs, mb_motion_table[32].code, |
230 |
else { |
mb_motion_table[32].len); |
231 |
|
} else { |
232 |
uint16_t length, code, mv_res, sign; |
uint16_t length, code, mv_res, sign; |
233 |
|
|
234 |
length = 16 << f_code; |
length = 16 << f_code; |
252 |
code = -code; |
code = -code; |
253 |
|
|
254 |
code += 32; |
code += 32; |
255 |
BitstreamPutBits(bs, mb_motion_table[code].code, mb_motion_table[code].len); |
BitstreamPutBits(bs, mb_motion_table[code].code, |
256 |
|
mb_motion_table[code].len); |
257 |
|
|
258 |
if(f_code) |
if(f_code) |
259 |
BitstreamPutBits(bs, mv_res, f_code); |
BitstreamPutBits(bs, mv_res, f_code); |
260 |
} |
} |
261 |
|
|
262 |
} |
} |
263 |
|
|
264 |
|
static __inline void |
265 |
|
CodeCoeff(Bitstream * bs, |
266 |
|
const int16_t qcoeff[64], |
267 |
|
VLC * table, |
268 |
|
const uint16_t * zigzag, |
269 |
|
uint16_t intra) |
270 |
|
{ |
271 |
|
|
|
static __inline void CodeCoeff(Bitstream *bs, int16_t qcoeff[64], VLC *table, |
|
|
const uint16_t *zigzag, uint16_t intra) { |
|
272 |
uint32_t j, last; |
uint32_t j, last; |
273 |
short v; |
short v; |
274 |
VLC *vlc; |
VLC *vlc; |
275 |
|
|
276 |
j = intra; |
j = intra; |
277 |
last = 1 + intra; |
last = intra; |
278 |
|
|
279 |
while((v = qcoeff[zigzag[j++]]) == 0); |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
280 |
|
j++; |
281 |
|
|
282 |
do { |
do { |
283 |
// count zeroes |
vlc = table + 64 * 2047 + (v << 6) + j - last; |
284 |
vlc = table + (clip_table[2048+v] << 6) + j - last; |
last = ++j; |
285 |
last = j + 1; |
|
286 |
while(j < 64 && (v = qcoeff[zigzag[j++]]) == 0); |
/* count zeroes */ |
287 |
|
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
288 |
|
j++; |
289 |
|
|
290 |
// write code |
/* write code */ |
291 |
if(j != 64) { |
if(j != 64) { |
292 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
293 |
} else { |
} else { |
294 |
vlc += 64*511; |
vlc += 64 * 4095; |
295 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
296 |
break; |
break; |
297 |
} |
} |
298 |
} while(1); |
} while(1); |
|
} |
|
299 |
|
|
300 |
|
} |
301 |
|
|
302 |
static void CodeBlockIntra(const MBParam * pParam, const MACROBLOCK *pMB, |
/***************************************************************************** |
303 |
int16_t qcoeff[][64], Bitstream * bs, Statistics * pStat) |
* Local functions |
304 |
|
****************************************************************************/ |
305 |
|
|
306 |
|
static void |
307 |
|
CodeBlockIntra(const FRAMEINFO * frame, |
308 |
|
const MACROBLOCK * pMB, |
309 |
|
int16_t qcoeff[6 * 64], |
310 |
|
Bitstream * bs, |
311 |
|
Statistics * pStat) |
312 |
{ |
{ |
313 |
|
|
314 |
uint32_t i, mcbpc, cbpy, bits; |
uint32_t i, mcbpc, cbpy, bits; |
315 |
|
|
316 |
cbpy = pMB->cbp >> 2; |
cbpy = pMB->cbp >> 2; |
317 |
|
|
318 |
// write mcbpc |
/* write mcbpc */ |
319 |
if(pParam->coding_type == I_VOP) { |
if (frame->coding_type == I_VOP) { |
320 |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
321 |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, mcbpc_intra_tab[mcbpc].len); |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
322 |
} |
mcbpc_intra_tab[mcbpc].len); |
323 |
else { |
} else { |
324 |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
325 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, mcbpc_inter_tab[mcbpc].len); |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
326 |
|
mcbpc_inter_tab[mcbpc].len); |
327 |
} |
} |
328 |
|
|
329 |
// ac prediction flag |
/* ac prediction flag */ |
330 |
if(pMB->acpred_directions[0]) |
if(pMB->acpred_directions[0]) |
331 |
BitstreamPutBits(bs, 1, 1); |
BitstreamPutBits(bs, 1, 1); |
332 |
else |
else |
333 |
BitstreamPutBits(bs, 0, 1); |
BitstreamPutBits(bs, 0, 1); |
334 |
|
|
335 |
// write cbpy |
/* write cbpy */ |
336 |
BitstreamPutBits (bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits (bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
337 |
|
|
338 |
// write dquant |
/* write dquant */ |
339 |
if(pMB->mode == MODE_INTRA_Q) |
if(pMB->mode == MODE_INTRA_Q) |
340 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
341 |
|
|
342 |
// write interlacing |
/* write interlacing */ |
343 |
if (pParam->global_flags & XVID_INTERLACING) |
if (frame->global_flags & XVID_INTERLACING) { |
|
{ |
|
344 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
345 |
} |
} |
346 |
|
/* code block coeffs */ |
347 |
// code block coeffs |
for (i = 0; i < 6; i++) { |
|
for(i = 0; i < 6; i++) |
|
|
{ |
|
348 |
if(i < 4) |
if(i < 4) |
349 |
BitstreamPutBits(bs, dcy_tab[qcoeff[i][0] + 255].code, |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
350 |
dcy_tab[qcoeff[i][0] + 255].len); |
dcy_tab[qcoeff[i * 64 + 0] + 255].len); |
351 |
else |
else |
352 |
BitstreamPutBits(bs, dcc_tab[qcoeff[i][0] + 255].code, |
BitstreamPutBits(bs, dcc_tab[qcoeff[i * 64 + 0] + 255].code, |
353 |
dcc_tab[qcoeff[i][0] + 255].len); |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
354 |
|
|
355 |
if(pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) { |
|
{ |
|
356 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
357 |
|
|
358 |
CodeCoeff(bs, qcoeff[i], intra_table, scan_tables[pMB->acpred_directions[i]], 1); |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
359 |
|
scan_tables[pMB->acpred_directions[i]], 1); |
360 |
|
|
361 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
362 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
363 |
} |
} |
364 |
} |
} |
365 |
|
|
366 |
} |
} |
367 |
|
|
368 |
|
|
369 |
static void CodeBlockInter(const MBParam * pParam, const MACROBLOCK *pMB, |
static void |
370 |
int16_t qcoeff[][64], Bitstream * bs, Statistics * pStat) |
CodeBlockInter(const FRAMEINFO * frame, |
371 |
|
const MACROBLOCK * pMB, |
372 |
|
int16_t qcoeff[6 * 64], |
373 |
|
Bitstream * bs, |
374 |
|
Statistics * pStat) |
375 |
{ |
{ |
376 |
|
|
377 |
int32_t i; |
int32_t i; |
378 |
uint32_t bits, mcbpc, cbpy; |
uint32_t bits, mcbpc, cbpy; |
379 |
|
|
380 |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
381 |
cbpy = 15 - (pMB->cbp >> 2); |
cbpy = 15 - (pMB->cbp >> 2); |
382 |
|
|
383 |
// write mcbpc |
/* write mcbpc */ |
384 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, mcbpc_inter_tab[mcbpc].len); |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
385 |
|
mcbpc_inter_tab[mcbpc].len); |
386 |
|
|
387 |
// write cbpy |
/* write cbpy */ |
388 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
389 |
|
|
390 |
// write dquant |
/* write dquant */ |
391 |
if(pMB->mode == MODE_INTER_Q) |
if(pMB->mode == MODE_INTER_Q) |
392 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
393 |
|
|
394 |
// interlacing |
/* interlacing */ |
395 |
if (pParam->global_flags & XVID_INTERLACING) |
if (frame->global_flags & XVID_INTERLACING) { |
396 |
{ |
if (pMB->cbp) { |
397 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
398 |
DEBUG1("codep: field_dct: ", pMB->field_dct); |
DPRINTF(DPRINTF_DEBUG, "codep: field_dct: %d", pMB->field_dct); |
399 |
|
} |
400 |
|
|
401 |
// if inter block, write field ME flag |
/* if inter block, write field ME flag */ |
402 |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
|
{ |
|
403 |
BitstreamPutBit(bs, pMB->field_pred); |
BitstreamPutBit(bs, pMB->field_pred); |
404 |
DEBUG1("codep: field_pred: ", pMB->field_pred); |
DPRINTF(DPRINTF_DEBUG, "codep: field_pred: %d", pMB->field_pred); |
405 |
|
|
406 |
// write field prediction references |
/* write field prediction references */ |
407 |
if (pMB->field_pred) |
if (pMB->field_pred) { |
|
{ |
|
408 |
BitstreamPutBit(bs, pMB->field_for_top); |
BitstreamPutBit(bs, pMB->field_for_top); |
409 |
BitstreamPutBit(bs, pMB->field_for_bot); |
BitstreamPutBit(bs, pMB->field_for_bot); |
410 |
} |
} |
411 |
} |
} |
412 |
} |
} |
413 |
|
/* code motion vector(s) */ |
414 |
// code motion vector(s) |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
415 |
for(i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
416 |
{ |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
|
CodeVector(bs, pMB->pmvs[i].x, pParam->fixed_code, pStat); |
|
|
CodeVector(bs, pMB->pmvs[i].y, pParam->fixed_code, pStat); |
|
417 |
} |
} |
418 |
|
|
419 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
420 |
|
|
421 |
// code block coeffs |
/* code block coeffs */ |
422 |
for(i = 0; i < 6; i++) |
for(i = 0; i < 6; i++) |
423 |
if(pMB->cbp & (1 << (5 - i))) |
if(pMB->cbp & (1 << (5 - i))) |
424 |
CodeCoeff(bs, qcoeff[i], inter_table, scan_tables[0], 0); |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
425 |
|
|
426 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
427 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
428 |
|
|
429 |
} |
} |
430 |
|
|
431 |
|
/***************************************************************************** |
432 |
|
* Macro Block bitstream encoding functions |
433 |
|
****************************************************************************/ |
434 |
|
|
435 |
void MBCoding(const MBParam * pParam, MACROBLOCK *pMB, |
void |
436 |
int16_t qcoeff[][64], |
MBCoding(const FRAMEINFO * frame, |
437 |
Bitstream * bs, Statistics * pStat) |
MACROBLOCK * pMB, |
438 |
|
int16_t qcoeff[6 * 64], |
439 |
|
Bitstream * bs, |
440 |
|
Statistics * pStat) |
441 |
{ |
{ |
|
int intra = (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q); |
|
442 |
|
|
443 |
if(pParam->coding_type == P_VOP) { |
if (frame->coding_type == P_VOP) { |
444 |
if(pMB->cbp == 0 && pMB->mode == MODE_INTER && |
BitstreamPutBit(bs, 0); /* coded */ |
445 |
pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
} |
446 |
|
|
447 |
|
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
448 |
|
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
449 |
|
else |
450 |
|
CodeBlockInter(frame, pMB, qcoeff, bs, pStat); |
451 |
|
|
452 |
|
} |
453 |
|
|
454 |
|
|
455 |
|
void |
456 |
|
MBSkip(Bitstream * bs) |
457 |
{ |
{ |
458 |
BitstreamPutBit(bs, 1); // not_coded |
BitstreamPutBit(bs, 1); /* not coded */ |
459 |
return; |
return; |
460 |
} |
} |
461 |
else |
|
462 |
BitstreamPutBit(bs, 0); // coded |
/***************************************************************************** |
463 |
|
* decoding stuff starts here |
464 |
|
****************************************************************************/ |
465 |
|
|
466 |
|
/* |
467 |
|
* For IVOP addbits == 0 |
468 |
|
* For PVOP addbits == fcode - 1 |
469 |
|
* For BVOP addbits == max(fcode,bcode) - 1 |
470 |
|
* returns true or false |
471 |
|
*/ |
472 |
|
|
473 |
|
int |
474 |
|
check_resync_marker(Bitstream * bs, int addbits) |
475 |
|
{ |
476 |
|
uint32_t nbits; |
477 |
|
uint32_t code; |
478 |
|
uint32_t nbitsresyncmarker = NUMBITS_VP_RESYNC_MARKER + addbits; |
479 |
|
|
480 |
|
nbits = BitstreamNumBitsToByteAlign(bs); |
481 |
|
code = BitstreamShowBits(bs, nbits); |
482 |
|
|
483 |
|
if (code == (((uint32_t)1 << (nbits - 1)) - 1)) |
484 |
|
{ |
485 |
|
return BitstreamShowBitsFromByteAlign(bs, nbitsresyncmarker) == RESYNC_MARKER; |
486 |
} |
} |
487 |
|
|
488 |
if(intra) |
return 0; |
|
CodeBlockIntra(pParam, pMB, qcoeff, bs, pStat); |
|
|
else |
|
|
CodeBlockInter(pParam, pMB, qcoeff, bs, pStat); |
|
489 |
} |
} |
490 |
|
|
491 |
|
|
|
/*************************************************************** |
|
|
* decoding stuff starts here * |
|
|
***************************************************************/ |
|
492 |
|
|
493 |
int get_mcbpc_intra(Bitstream * bs) |
int |
494 |
|
get_mcbpc_intra(Bitstream * bs) |
495 |
{ |
{ |
|
uint32_t index; |
|
496 |
|
|
497 |
while((index = BitstreamShowBits(bs, 9)) == 1) |
uint32_t index; |
|
BitstreamSkip(bs, 9); |
|
498 |
|
|
499 |
|
index = BitstreamShowBits(bs, 9); |
500 |
index >>= 3; |
index >>= 3; |
501 |
|
|
502 |
BitstreamSkip(bs, mcbpc_intra_table[index].len); |
BitstreamSkip(bs, mcbpc_intra_table[index].len); |
503 |
|
|
504 |
return mcbpc_intra_table[index].code; |
return mcbpc_intra_table[index].code; |
505 |
|
|
506 |
} |
} |
507 |
|
|
508 |
int get_mcbpc_inter(Bitstream * bs) |
int |
509 |
|
get_mcbpc_inter(Bitstream * bs) |
510 |
{ |
{ |
511 |
|
|
512 |
uint32_t index; |
uint32_t index; |
513 |
|
|
514 |
while((index = CLIP(BitstreamShowBits(bs, 9), 256)) == 1) |
index = CLIP(BitstreamShowBits(bs, 9), 256); |
|
BitstreamSkip(bs, 9); |
|
515 |
|
|
516 |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
517 |
|
|
518 |
return mcbpc_inter_table[index].code; |
return mcbpc_inter_table[index].code; |
519 |
|
|
520 |
} |
} |
521 |
|
|
522 |
int get_cbpy(Bitstream * bs, int intra) |
int |
523 |
|
get_cbpy(Bitstream * bs, |
524 |
|
int intra) |
525 |
{ |
{ |
526 |
|
|
527 |
int cbpy; |
int cbpy; |
528 |
uint32_t index = BitstreamShowBits(bs, 6); |
uint32_t index = BitstreamShowBits(bs, 6); |
529 |
|
|
534 |
cbpy = 15 - cbpy; |
cbpy = 15 - cbpy; |
535 |
|
|
536 |
return cbpy; |
return cbpy; |
537 |
|
|
538 |
} |
} |
539 |
|
|
540 |
int get_mv_data(Bitstream * bs) |
int |
541 |
|
get_mv_data(Bitstream * bs) |
542 |
{ |
{ |
543 |
|
|
544 |
uint32_t index; |
uint32_t index; |
545 |
|
|
546 |
if(BitstreamGetBit(bs)) |
if(BitstreamGetBit(bs)) |
548 |
|
|
549 |
index = BitstreamShowBits(bs, 12); |
index = BitstreamShowBits(bs, 12); |
550 |
|
|
551 |
if(index >= 512) |
if (index >= 512) { |
|
{ |
|
552 |
index = (index >> 8) - 2; |
index = (index >> 8) - 2; |
553 |
BitstreamSkip(bs, TMNMVtab0[index].len); |
BitstreamSkip(bs, TMNMVtab0[index].len); |
554 |
return TMNMVtab0[index].code; |
return TMNMVtab0[index].code; |
555 |
} |
} |
556 |
|
|
557 |
if(index >= 128) |
if (index >= 128) { |
|
{ |
|
558 |
index = (index >> 2) - 32; |
index = (index >> 2) - 32; |
559 |
BitstreamSkip(bs, TMNMVtab1[index].len); |
BitstreamSkip(bs, TMNMVtab1[index].len); |
560 |
return TMNMVtab1[index].code; |
return TMNMVtab1[index].code; |
564 |
|
|
565 |
BitstreamSkip(bs, TMNMVtab2[index].len); |
BitstreamSkip(bs, TMNMVtab2[index].len); |
566 |
return TMNMVtab2[index].code; |
return TMNMVtab2[index].code; |
567 |
|
|
568 |
} |
} |
569 |
|
|
570 |
int get_mv(Bitstream * bs, int fcode) |
int |
571 |
|
get_mv(Bitstream * bs, |
572 |
|
int fcode) |
573 |
{ |
{ |
574 |
|
|
575 |
int data; |
int data; |
576 |
int res; |
int res; |
577 |
int mv; |
int mv; |
586 |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
587 |
|
|
588 |
return data < 0 ? -mv : mv; |
return data < 0 ? -mv : mv; |
589 |
|
|
590 |
} |
} |
591 |
|
|
592 |
int get_dc_dif(Bitstream * bs, uint32_t dc_size) |
int |
593 |
|
get_dc_dif(Bitstream * bs, |
594 |
|
uint32_t dc_size) |
595 |
{ |
{ |
596 |
|
|
597 |
int code = BitstreamGetBits(bs, dc_size); |
int code = BitstreamGetBits(bs, dc_size); |
598 |
int msb = code >> (dc_size - 1); |
int msb = code >> (dc_size - 1); |
599 |
|
|
601 |
return (-1 * (code^((1 << dc_size) - 1))); |
return (-1 * (code^((1 << dc_size) - 1))); |
602 |
|
|
603 |
return code; |
return code; |
604 |
|
|
605 |
} |
} |
606 |
|
|
607 |
int get_dc_size_lum(Bitstream * bs) |
int |
608 |
|
get_dc_size_lum(Bitstream * bs) |
609 |
{ |
{ |
610 |
|
|
611 |
int code, i; |
int code, i; |
612 |
|
|
613 |
code = BitstreamShowBits(bs, 11); |
code = BitstreamShowBits(bs, 11); |
614 |
|
|
615 |
for(i = 11; i > 3; i--) { |
for(i = 11; i > 3; i--) { |
622 |
|
|
623 |
BitstreamSkip(bs, dc_lum_tab[code].len); |
BitstreamSkip(bs, dc_lum_tab[code].len); |
624 |
return dc_lum_tab[code].code; |
return dc_lum_tab[code].code; |
625 |
|
|
626 |
} |
} |
627 |
|
|
628 |
|
|
629 |
int get_dc_size_chrom(Bitstream * bs) |
int |
630 |
|
get_dc_size_chrom(Bitstream * bs) |
631 |
{ |
{ |
632 |
|
|
633 |
uint32_t code, i; |
uint32_t code, i; |
634 |
|
|
635 |
code = BitstreamShowBits(bs, 12); |
code = BitstreamShowBits(bs, 12); |
636 |
|
|
637 |
for(i = 12; i > 2; i--) { |
for(i = 12; i > 2; i--) { |
643 |
} |
} |
644 |
|
|
645 |
return 3 - BitstreamGetBits(bs, 2); |
return 3 - BitstreamGetBits(bs, 2); |
646 |
|
|
647 |
} |
} |
648 |
|
|
649 |
int get_coeff(Bitstream * bs, int *run, int *last, int intra, int short_video_header) |
/***************************************************************************** |
650 |
|
* Local inlined function to "decode" written vlc codes |
651 |
|
****************************************************************************/ |
652 |
|
|
653 |
|
static __inline int |
654 |
|
get_coeff(Bitstream * bs, |
655 |
|
int *run, |
656 |
|
int *last, |
657 |
|
int intra, |
658 |
|
int short_video_header) |
659 |
{ |
{ |
660 |
|
|
661 |
uint32_t mode; |
uint32_t mode; |
662 |
const VLC *tab; |
const VLC *tab; |
663 |
int32_t level; |
int32_t level; |
664 |
|
|
665 |
if(short_video_header) // inter-VLCs will be used for both intra and inter blocks |
if (short_video_header) /* inter-VLCs will be used for both intra and inter blocks */ |
666 |
intra = 0; |
intra = 0; |
667 |
|
|
668 |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
673 |
BitstreamSkip(bs, tab->len); |
BitstreamSkip(bs, tab->len); |
674 |
|
|
675 |
if(tab->code != ESCAPE) { |
if(tab->code != ESCAPE) { |
676 |
if(!intra) |
if (!intra) { |
|
{ |
|
677 |
*run = (tab->code >> 4) & 255; |
*run = (tab->code >> 4) & 255; |
678 |
level = tab->code & 15; |
level = tab->code & 15; |
679 |
*last = (tab->code >> 12) & 1; |
*last = (tab->code >> 12) & 1; |
680 |
} |
} else { |
|
else |
|
|
{ |
|
681 |
*run = (tab->code >> 8) & 255; |
*run = (tab->code >> 8) & 255; |
682 |
level = tab->code & 255; |
level = tab->code & 255; |
683 |
*last = (tab->code >> 16) & 1; |
*last = (tab->code >> 16) & 1; |
685 |
return BitstreamGetBit(bs) ? -level : level; |
return BitstreamGetBit(bs) ? -level : level; |
686 |
} |
} |
687 |
|
|
688 |
if(short_video_header) |
if (short_video_header) { |
689 |
{ |
/* escape mode 4 - H.263 type, only used if short_video_header = 1 */ |
|
// escape mode 4 - H.263 type, only used if short_video_header = 1 |
|
690 |
*last = BitstreamGetBit(bs); |
*last = BitstreamGetBit(bs); |
691 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
692 |
level = BitstreamGetBits(bs, 8); |
level = BitstreamGetBits(bs, 8); |
693 |
|
|
694 |
if (level == 0 || level == 128) |
if (level == 0 || level == 128) |
695 |
DEBUG1("Illegal LEVEL for ESCAPE mode 4:", level); |
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
696 |
|
|
697 |
return (level >= 128 ? -(256 - level) : level); |
return (level >= 128 ? -(256 - level) : level); |
698 |
} |
} |
712 |
*run = (tab->code >> 4) & 255; |
*run = (tab->code >> 4) & 255; |
713 |
level = tab->code & 15; |
level = tab->code & 15; |
714 |
*last = (tab->code >> 12) & 1; |
*last = (tab->code >> 12) & 1; |
715 |
} |
} else { |
|
else |
|
|
{ |
|
716 |
*run = (tab->code >> 8) & 255; |
*run = (tab->code >> 8) & 255; |
717 |
level = tab->code & 255; |
level = tab->code & 255; |
718 |
*last = (tab->code >> 16) & 1; |
*last = (tab->code >> 16) & 1; |
719 |
} |
} |
720 |
|
|
721 |
if(mode < 2) // first escape mode, level is offset |
if (mode < 2) /* first escape mode, level is offset */ |
722 |
level += max_level[*last + (!intra<<1)][*run]; // need to add back the max level |
level += max_level[*last + (!intra << 1)][*run]; /* need to add back the max level */ |
723 |
else if(mode == 2) // second escape mode, run is offset |
else if (mode == 2) /* second escape mode, run is offset */ |
724 |
*run += max_run[*last + (!intra<<1)][level] + 1; |
*run += max_run[*last + (!intra<<1)][level] + 1; |
725 |
|
|
726 |
return BitstreamGetBit(bs) ? -level : level; |
return BitstreamGetBit(bs) ? -level : level; |
727 |
} |
} |
728 |
|
/* third escape mode - fixed length codes */ |
|
// third escape mode - fixed length codes |
|
729 |
BitstreamSkip(bs, 2); |
BitstreamSkip(bs, 2); |
730 |
*last = BitstreamGetBits(bs, 1); |
*last = BitstreamGetBits(bs, 1); |
731 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
732 |
BitstreamSkip(bs, 1); // marker |
BitstreamSkip(bs, 1); /* marker */ |
733 |
level = BitstreamGetBits(bs, 12); |
level = BitstreamGetBits(bs, 12); |
734 |
BitstreamSkip(bs, 1); // marker |
BitstreamSkip(bs, 1); /* marker */ |
735 |
|
|
736 |
return (level & 0x800) ? (level | (-1 ^ 0xfff)) : level; |
return (level & 0x800) ? (level | (-1 ^ 0xfff)) : level; |
737 |
|
|
738 |
error: |
error: |
739 |
*run = VLC_ERROR; |
*run = VLC_ERROR; |
740 |
return 0; |
return 0; |
|
} |
|
741 |
|
|
742 |
|
} |
743 |
|
|
744 |
void get_intra_block(Bitstream * bs, int16_t * block, int direction, int coeff) |
/***************************************************************************** |
745 |
|
* MB reading functions |
746 |
|
****************************************************************************/ |
747 |
|
|
748 |
|
void |
749 |
|
get_intra_block(Bitstream * bs, |
750 |
|
int16_t * block, |
751 |
|
int direction, |
752 |
|
int coeff) |
753 |
{ |
{ |
754 |
|
|
755 |
const uint16_t * scan = scan_tables[ direction ]; |
const uint16_t * scan = scan_tables[ direction ]; |
756 |
int level; |
int level; |
757 |
int run; |
int run; |
758 |
int last; |
int last; |
759 |
|
|
760 |
do |
do { |
|
{ |
|
761 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
762 |
if (run == -1) |
if (run == -1) { |
763 |
{ |
DPRINTF(DPRINTF_DEBUG, "fatal: invalid run"); |
|
DEBUG("fatal: invalid run"); |
|
764 |
break; |
break; |
765 |
} |
} |
766 |
coeff += run; |
coeff += run; |
767 |
block[ scan[coeff] ] = level; |
block[ scan[coeff] ] = level; |
768 |
if (level < -127 || level > 127) |
|
769 |
{ |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
770 |
DEBUG1("warning: intra_overflow", level); |
/*DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[coeff], level, BitstreamShowBits(bs, 32)); */ |
771 |
|
|
772 |
|
if (level < -2047 || level > 2047) { |
773 |
|
DPRINTF(DPRINTF_DEBUG, "warning: intra_overflow: %d", level); |
774 |
} |
} |
775 |
coeff++; |
coeff++; |
776 |
} while (!last); |
} while (!last); |
777 |
|
|
778 |
} |
} |
779 |
|
|
780 |
void get_inter_block(Bitstream * bs, int16_t * block) |
void |
781 |
|
get_inter_block(Bitstream * bs, |
782 |
|
int16_t * block) |
783 |
{ |
{ |
784 |
|
|
785 |
const uint16_t * scan = scan_tables[0]; |
const uint16_t * scan = scan_tables[0]; |
786 |
int p; |
int p; |
787 |
int level; |
int level; |
789 |
int last; |
int last; |
790 |
|
|
791 |
p = 0; |
p = 0; |
792 |
do |
do { |
|
{ |
|
793 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
794 |
if (run == -1) |
if (run == -1) { |
795 |
{ |
DPRINTF(DPRINTF_ERROR, "fatal: invalid run"); |
|
DEBUG("fatal: invalid run"); |
|
796 |
break; |
break; |
797 |
} |
} |
798 |
p += run; |
p += run; |
799 |
|
|
800 |
block[ scan[p] ] = level; |
block[ scan[p] ] = level; |
801 |
if (level < -127 || level > 127) |
|
802 |
{ |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
803 |
DEBUG1("warning: inter_overflow", level); |
|
804 |
|
if (level < -2047 || level > 2047) { |
805 |
|
DPRINTF(DPRINTF_DEBUG, "warning: inter_overflow: %d", level); |
806 |
} |
} |
807 |
p++; |
p++; |
808 |
} while (!last); |
} while (!last); |
809 |
|
|
810 |
} |
} |