1 |
|
/****************************************************************************** |
2 |
|
* * |
3 |
|
* This file is part of XviD, a free MPEG-4 video encoder/decoder * |
4 |
|
* * |
5 |
|
* XviD is an implementation of a part of one or more MPEG-4 Video tools * |
6 |
|
* as specified in ISO/IEC 14496-2 standard. Those intending to use this * |
7 |
|
* software module in hardware or software products are advised that its * |
8 |
|
* use may infringe existing patents or copyrights, and any such use * |
9 |
|
* would be at such party's own risk. The original developer of this * |
10 |
|
* software module and his/her company, and subsequent editors and their * |
11 |
|
* companies, will have no liability for use of this software or * |
12 |
|
* modifications or derivatives thereof. * |
13 |
|
* * |
14 |
|
* XviD is free software; you can redistribute it and/or modify it * |
15 |
|
* under the terms of the GNU General Public License as published by * |
16 |
|
* the Free Software Foundation; either version 2 of the License, or * |
17 |
|
* (at your option) any later version. * |
18 |
|
* * |
19 |
|
* XviD is distributed in the hope that it will be useful, but * |
20 |
|
* WITHOUT ANY WARRANTY; without even the implied warranty of * |
21 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
22 |
|
* GNU General Public License for more details. * |
23 |
|
* * |
24 |
|
* You should have received a copy of the GNU General Public License * |
25 |
|
* along with this program; if not, write to the Free Software * |
26 |
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * |
27 |
|
* * |
28 |
|
******************************************************************************/ |
29 |
|
|
30 |
|
/****************************************************************************** |
31 |
|
* * |
32 |
|
* mbcoding.c * |
33 |
|
* * |
34 |
|
* Copyright (C) 2002 - Michael Militzer <isibaar@xvid.org> * |
35 |
|
* * |
36 |
|
* For more information visit the XviD homepage: http://www.xvid.org * |
37 |
|
* * |
38 |
|
******************************************************************************/ |
39 |
|
|
40 |
|
/****************************************************************************** |
41 |
|
* * |
42 |
|
* Revision history: * |
43 |
|
* * |
44 |
|
* 28.06.2002 added check_resync_marker() * |
45 |
|
* 14.04.2002 bframe encoding * |
46 |
|
* 08.03.2002 initial version; isibaar * |
47 |
|
* * |
48 |
|
******************************************************************************/ |
49 |
|
|
50 |
|
|
51 |
|
|
52 |
|
#include <stdlib.h> |
53 |
#include "../portab.h" |
#include "../portab.h" |
54 |
#include "bitstream.h" |
#include "bitstream.h" |
55 |
#include "zigzag.h" |
#include "zigzag.h" |
56 |
#include "vlc_codes.h" |
#include "vlc_codes.h" |
57 |
|
#include "mbcoding.h" |
58 |
|
|
59 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
60 |
|
|
|
#include <stdlib.h> /* malloc, free */ |
|
|
|
|
|
#define ESCAPE 7167 |
|
61 |
#define ABS(X) (((X)>0)?(X):-(X)) |
#define ABS(X) (((X)>0)?(X):-(X)) |
62 |
#define CLIP(X,A) (X > A) ? (A) : (X) |
#define CLIP(X,A) (X > A) ? (A) : (X) |
63 |
|
|
64 |
static VLC *DCT3D[2]; |
VLC intra_table[524032]; |
65 |
|
VLC inter_table[524032]; |
66 |
|
|
67 |
VLC *intra_table, *inter_table; |
VLC DCT3Dintra[4096]; |
68 |
static short clip_table[4096]; |
VLC DCT3Dinter[4096]; |
69 |
|
|
70 |
void create_vlc_tables(void) |
void |
71 |
|
init_vlc_tables(void) |
72 |
{ |
{ |
73 |
|
|
74 |
int32_t k, l, i, intra, last; |
int32_t k, l, i, intra, last; |
75 |
VLC *vlc[2]; |
VLC *vlc[2]; |
76 |
VLC **coeff_ptr; |
VLC **coeff_ptr; |
77 |
VLC *vlc1, *vlc2; |
VLC *vlc1, *vlc2; |
78 |
|
|
|
VLC *DCT3Dintra; |
|
|
VLC *DCT3Dinter; |
|
|
|
|
|
DCT3Dintra = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
DCT3Dinter = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
|
|
79 |
vlc1 = DCT3Dintra; |
vlc1 = DCT3Dintra; |
80 |
vlc2 = DCT3Dinter; |
vlc2 = DCT3Dinter; |
81 |
|
|
82 |
vlc[0] = intra_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[0] = intra_table; |
83 |
vlc[1] = inter_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[1] = inter_table; |
84 |
|
|
85 |
// initialize the clipping table |
// generate encoding vlc lookup tables |
86 |
for(i = -2048; i < 2048; i++) { |
// the lookup table idea is taken from the excellent fame project by Vivien Chapellier |
|
clip_table[i + 2048] = i; |
|
|
if(i < -255) |
|
|
clip_table[i + 2048] = -255; |
|
|
if(i > 255) |
|
|
clip_table[i + 2048] = 255; |
|
|
} |
|
|
|
|
|
// generate intra/inter vlc lookup table |
|
87 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
88 |
intra = i % 2; |
intra = i % 2; |
89 |
last = i >> 1; |
last = i / 2; |
90 |
|
|
91 |
coeff_ptr = coeff_vlc[last + (intra << 1)]; |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
92 |
|
|
93 |
for(k = -255; k < 256; k++) { // level |
for (k = -2047; k < 2048; k++) { // level |
94 |
char *max_level_ptr = max_level[last + (intra << 1)]; |
int8_t *max_level_ptr = max_level[last + 2 * intra]; |
95 |
char *max_run_ptr = max_run[last + (intra << 1)]; |
int8_t *max_run_ptr = max_run[last + 2 * intra]; |
96 |
|
|
97 |
for(l = 0; l < 64; l++) { // run |
for(l = 0; l < 64; l++) { // run |
98 |
int32_t level = k, run = l; |
int32_t level = k; |
99 |
|
ptr_t run = l; |
100 |
|
|
101 |
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 |
102 |
|
|
|
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 { |
|
103 |
vlc[intra]->code = 0; |
vlc[intra]->code = 0; |
104 |
vlc[intra]->len = 0; |
vlc[intra]->len = 0; |
105 |
} |
goto loop_end; |
106 |
} else { |
} else { |
107 |
if(level > 0) |
if (level > 0) // correct level |
108 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
109 |
else |
else |
110 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; |
111 |
|
|
112 |
if(abs(level) <= max_level_ptr[run] && |
if ((abs(level) <= max_level_ptr[run]) && |
113 |
run <= max_run_ptr[abs(level)]) { |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
114 |
|
|
|
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 { |
|
115 |
vlc[intra]->code = 0x06; |
vlc[intra]->code = 0x06; |
116 |
vlc[intra]->len = 8; |
vlc[intra]->len = 8; |
117 |
|
goto loop_end; |
118 |
} |
} |
119 |
} else { |
|
120 |
if(level > 0) |
if (level > 0) // still here? |
121 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; // restore level |
122 |
else |
else |
123 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
124 |
|
|
125 |
run -= max_run_ptr[abs(level)] + 1; |
run -= max_run_ptr[abs(level)] + 1; // and change run |
126 |
|
|
127 |
if(abs(level) <= max_level_ptr[run] && |
if ((abs(level) <= max_level_ptr[run]) && |
128 |
run <= max_run_ptr[abs(level)]) { |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
129 |
|
|
|
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 { |
|
130 |
vlc[intra]->code = 0x0e; |
vlc[intra]->code = 0x0e; |
131 |
vlc[intra]->len = 9; |
vlc[intra]->len = 9; |
132 |
|
goto loop_end; |
133 |
} |
} |
|
} else { |
|
|
if(level != 0) |
|
134 |
run += max_run_ptr[abs(level)] + 1; |
run += max_run_ptr[abs(level)] + 1; |
135 |
else |
} |
|
run++; |
|
136 |
|
|
137 |
vlc[intra]->code = (uint32_t) ((0x1e + last) << 20) | |
vlc[intra]->code = |
138 |
(l << 14) | (1 << 13) | ((k & 0xfff) << 1) | 1; |
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
139 |
|
((k & 0xfff) << 1) | 1; |
140 |
|
|
141 |
vlc[intra]->len = 30; |
vlc[intra]->len = 30; |
142 |
|
vlc[intra]++; |
143 |
|
continue; |
144 |
|
|
145 |
|
loop_end: |
146 |
|
if (level != 0) { |
147 |
|
vlc[intra]->code = |
148 |
|
(vlc[intra]-> |
149 |
|
code << (coeff_ptr[run][abs(level) - 1].len + |
150 |
|
1)) | (coeff_ptr[run][abs(level) - |
151 |
|
1].code << 1); |
152 |
|
vlc[intra]->len = |
153 |
|
(coeff_ptr[run][abs(level) - 1].len + 1) + |
154 |
|
vlc[intra]->len; |
155 |
|
|
156 |
|
if (level < 0) |
157 |
|
vlc[intra]->code += 1; |
158 |
} |
} |
159 |
} |
|
|
} |
|
160 |
vlc[intra]++; |
vlc[intra]++; |
161 |
} |
} |
162 |
} |
} |
163 |
} |
} |
|
intra_table += 64*255; // center vlc tables |
|
|
inter_table += 64*255; // center vlc tables |
|
164 |
|
|
165 |
for(i = 0; i < 4096; i++) { |
for(i = 0; i < 4096; i++) { |
166 |
if(i >= 512) { |
if(i >= 512) { |
167 |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
168 |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
169 |
} |
} else if (i >= 128) { |
|
else if(i >= 128) { |
|
170 |
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
171 |
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
172 |
} |
} else if (i >= 8) { |
|
else if(i >= 8) { |
|
173 |
*vlc1 = DCT3Dtab5[i - 8]; |
*vlc1 = DCT3Dtab5[i - 8]; |
174 |
*vlc2 = DCT3Dtab2[i - 8]; |
*vlc2 = DCT3Dtab2[i - 8]; |
175 |
} |
} else { |
|
else { |
|
176 |
*vlc1 = ERRtab[i]; |
*vlc1 = ERRtab[i]; |
177 |
*vlc2 = ERRtab[i]; |
*vlc2 = ERRtab[i]; |
178 |
} |
} |
185 |
|
|
186 |
} |
} |
187 |
|
|
188 |
void destroy_vlc_tables(void) { |
static __inline void |
189 |
|
CodeVector(Bitstream * bs, |
190 |
if(intra_table != NULL && inter_table != NULL) { |
int32_t value, |
191 |
intra_table -= 64*255; // uncenter vlc tables |
int32_t f_code, |
192 |
inter_table -= 64*255; // uncenter vlc tables |
Statistics * pStat) |
|
|
|
|
free(intra_table); |
|
|
free(inter_table); |
|
|
} |
|
|
|
|
|
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) |
|
193 |
{ |
{ |
194 |
|
|
195 |
const int scale_factor = 1 << (f_code - 1); |
const int scale_factor = 1 << (f_code - 1); |
196 |
const int cmp = scale_factor << 5; |
const int cmp = scale_factor << 5; |
197 |
|
|
204 |
pStat->iMvSum += value * value; |
pStat->iMvSum += value * value; |
205 |
pStat->iMvCount++; |
pStat->iMvCount++; |
206 |
|
|
207 |
if (value == 0) |
if (value == 0) { |
208 |
BitstreamPutBits(bs, mb_motion_table[32].code, mb_motion_table[32].len); |
BitstreamPutBits(bs, mb_motion_table[32].code, |
209 |
else { |
mb_motion_table[32].len); |
210 |
|
} else { |
211 |
uint16_t length, code, mv_res, sign; |
uint16_t length, code, mv_res, sign; |
212 |
|
|
213 |
length = 16 << f_code; |
length = 16 << f_code; |
231 |
code = -code; |
code = -code; |
232 |
|
|
233 |
code += 32; |
code += 32; |
234 |
BitstreamPutBits(bs, mb_motion_table[code].code, mb_motion_table[code].len); |
BitstreamPutBits(bs, mb_motion_table[code].code, |
235 |
|
mb_motion_table[code].len); |
236 |
|
|
237 |
if(f_code) |
if(f_code) |
238 |
BitstreamPutBits(bs, mv_res, f_code); |
BitstreamPutBits(bs, mv_res, f_code); |
239 |
} |
} |
240 |
|
|
241 |
} |
} |
242 |
|
|
243 |
|
|
244 |
static __inline void CodeCoeff(Bitstream *bs, int16_t qcoeff[64], VLC *table, |
static __inline void |
245 |
const uint16_t *zigzag, uint16_t intra) { |
CodeCoeff(Bitstream * bs, |
246 |
|
const int16_t qcoeff[64], |
247 |
|
VLC * table, |
248 |
|
const uint16_t * zigzag, |
249 |
|
uint16_t intra) |
250 |
|
{ |
251 |
|
|
252 |
uint32_t j, last; |
uint32_t j, last; |
253 |
short v; |
short v; |
254 |
VLC *vlc; |
VLC *vlc; |
255 |
|
|
256 |
j = intra; |
j = intra; |
257 |
last = 1 + intra; |
last = intra; |
258 |
|
|
259 |
while((v = qcoeff[zigzag[j++]]) == 0); |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
260 |
|
j++; |
261 |
|
|
262 |
do { |
do { |
263 |
|
vlc = table + 64 * 2047 + (v << 6) + j - last; |
264 |
|
last = ++j; |
265 |
|
|
266 |
// count zeroes |
// count zeroes |
267 |
vlc = table + (clip_table[2048+v] << 6) + j - last; |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
268 |
last = j + 1; |
j++; |
|
while(j < 64 && (v = qcoeff[zigzag[j++]]) == 0); |
|
269 |
|
|
270 |
// write code |
// write code |
271 |
if(j != 64) { |
if(j != 64) { |
272 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
273 |
} else { |
} else { |
274 |
vlc += 64*511; |
vlc += 64 * 4095; |
275 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
276 |
break; |
break; |
277 |
} |
} |
278 |
} while(1); |
} while(1); |
279 |
|
|
280 |
} |
} |
281 |
|
|
282 |
|
|
283 |
static void CodeBlockIntra(const MBParam * pParam, const MACROBLOCK *pMB, |
static void |
284 |
int16_t qcoeff[][64], Bitstream * bs, Statistics * pStat) |
CodeBlockIntra(const FRAMEINFO * frame, |
285 |
|
const MACROBLOCK * pMB, |
286 |
|
int16_t qcoeff[6 * 64], |
287 |
|
Bitstream * bs, |
288 |
|
Statistics * pStat) |
289 |
{ |
{ |
290 |
|
|
291 |
uint32_t i, mcbpc, cbpy, bits; |
uint32_t i, mcbpc, cbpy, bits; |
292 |
|
|
|
mcbpc = pMB->cbp & 3; |
|
293 |
cbpy = pMB->cbp >> 2; |
cbpy = pMB->cbp >> 2; |
294 |
|
|
295 |
// write mcbpc |
// write mcbpc |
296 |
if(pParam->coding_type == I_VOP) |
if (frame->coding_type == I_VOP) { |
297 |
BitstreamPutBits(bs, mcbpc_I[mcbpc].code, mcbpc_I[mcbpc].len); |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
298 |
else |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
299 |
BitstreamPutBits(bs, mcbpc_P_intra[mcbpc].code, mcbpc_P_intra[mcbpc].len); |
mcbpc_intra_tab[mcbpc].len); |
300 |
|
} else { |
301 |
|
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
302 |
|
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
303 |
|
mcbpc_inter_tab[mcbpc].len); |
304 |
|
} |
305 |
|
|
306 |
// ac prediction flag |
// ac prediction flag |
307 |
if(pMB->acpred_directions[0]) |
if(pMB->acpred_directions[0]) |
316 |
if(pMB->mode == MODE_INTRA_Q) |
if(pMB->mode == MODE_INTRA_Q) |
317 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
318 |
|
|
319 |
|
// write interlacing |
320 |
|
if (frame->global_flags & XVID_INTERLACING) { |
321 |
|
BitstreamPutBit(bs, pMB->field_dct); |
322 |
|
} |
323 |
// code block coeffs |
// code block coeffs |
324 |
for(i = 0; i < 6; i++) |
for (i = 0; i < 6; i++) { |
|
{ |
|
325 |
if(i < 4) |
if(i < 4) |
326 |
BitstreamPutBits(bs, dcy_tab[qcoeff[i][0] + 255].code, |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
327 |
dcy_tab[qcoeff[i][0] + 255].len); |
dcy_tab[qcoeff[i * 64 + 0] + 255].len); |
328 |
else |
else |
329 |
BitstreamPutBits(bs, dcc_tab[qcoeff[i][0] + 255].code, |
BitstreamPutBits(bs, dcc_tab[qcoeff[i * 64 + 0] + 255].code, |
330 |
dcc_tab[qcoeff[i][0] + 255].len); |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
331 |
|
|
332 |
if(pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) { |
|
{ |
|
333 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
334 |
|
|
335 |
CodeCoeff(bs, qcoeff[i], intra_table, scan_tables[pMB->acpred_directions[i]], 1); |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
336 |
|
scan_tables[pMB->acpred_directions[i]], 1); |
337 |
|
|
338 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
339 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
340 |
} |
} |
341 |
} |
} |
342 |
|
|
343 |
} |
} |
344 |
|
|
345 |
|
|
346 |
static void CodeBlockInter(const MBParam * pParam, const MACROBLOCK *pMB, |
static void |
347 |
int16_t qcoeff[][64], Bitstream * bs, Statistics * pStat) |
CodeBlockInter(const FRAMEINFO * frame, |
348 |
|
const MACROBLOCK * pMB, |
349 |
|
int16_t qcoeff[6 * 64], |
350 |
|
Bitstream * bs, |
351 |
|
Statistics * pStat) |
352 |
{ |
{ |
353 |
|
|
354 |
int32_t i; |
int32_t i; |
355 |
uint32_t bits, mcbpc, cbpy; |
uint32_t bits, mcbpc, cbpy; |
356 |
|
|
357 |
mcbpc = pMB->cbp & 3; |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
358 |
cbpy = 15 - (pMB->cbp >> 2); |
cbpy = 15 - (pMB->cbp >> 2); |
359 |
|
|
360 |
// write mcbpc |
// write mcbpc |
361 |
if(pMB->mode == MODE_INTER4V) |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
362 |
BitstreamPutBits(bs, mcbpc_P_inter4v[mcbpc].code, mcbpc_P_inter4v[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
|
else |
|
|
BitstreamPutBits(bs, mcbpc_P_inter[mcbpc].code, mcbpc_P_inter[mcbpc].len); |
|
363 |
|
|
364 |
// write cbpy |
// write cbpy |
365 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
368 |
if(pMB->mode == MODE_INTER_Q) |
if(pMB->mode == MODE_INTER_Q) |
369 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
370 |
|
|
371 |
|
// interlacing |
372 |
|
if (frame->global_flags & XVID_INTERLACING) { |
373 |
|
BitstreamPutBit(bs, pMB->field_dct); |
374 |
|
DEBUG1("codep: field_dct: ", pMB->field_dct); |
375 |
|
|
376 |
|
// if inter block, write field ME flag |
377 |
|
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
378 |
|
BitstreamPutBit(bs, pMB->field_pred); |
379 |
|
DEBUG1("codep: field_pred: ", pMB->field_pred); |
380 |
|
|
381 |
|
// write field prediction references |
382 |
|
if (pMB->field_pred) { |
383 |
|
BitstreamPutBit(bs, pMB->field_for_top); |
384 |
|
BitstreamPutBit(bs, pMB->field_for_bot); |
385 |
|
} |
386 |
|
} |
387 |
|
} |
388 |
// code motion vector(s) |
// code motion vector(s) |
389 |
for(i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
390 |
{ |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
391 |
CodeVector(bs, pMB->pmvs[i].x, pParam->fixed_code, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
|
CodeVector(bs, pMB->pmvs[i].y, pParam->fixed_code, pStat); |
|
392 |
} |
} |
393 |
|
|
394 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
396 |
// code block coeffs |
// code block coeffs |
397 |
for(i = 0; i < 6; i++) |
for(i = 0; i < 6; i++) |
398 |
if(pMB->cbp & (1 << (5 - i))) |
if(pMB->cbp & (1 << (5 - i))) |
399 |
CodeCoeff(bs, qcoeff[i], inter_table, scan_tables[0], 0); |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
400 |
|
|
401 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
402 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
403 |
|
|
404 |
} |
} |
405 |
|
|
406 |
|
|
407 |
void MBCoding(const MBParam * pParam, MACROBLOCK *pMB, |
void |
408 |
int16_t qcoeff[][64], |
MBCoding(const FRAMEINFO * frame, |
409 |
Bitstream * bs, Statistics * pStat) |
MACROBLOCK * pMB, |
410 |
|
int16_t qcoeff[6 * 64], |
411 |
|
Bitstream * bs, |
412 |
|
Statistics * pStat) |
413 |
{ |
{ |
414 |
|
|
415 |
int intra = (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q); |
int intra = (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q); |
416 |
|
|
417 |
if(pParam->coding_type == P_VOP) { |
if (frame->coding_type == P_VOP) { |
418 |
if(pMB->cbp == 0 && pMB->mode == MODE_INTER && |
if (pMB->cbp == 0 && pMB->mode == MODE_INTER && pMB->mvs[0].x == 0 && |
419 |
pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
pMB->mvs[0].y == 0) { |
|
{ |
|
420 |
BitstreamPutBit(bs, 1); // not_coded |
BitstreamPutBit(bs, 1); // not_coded |
421 |
return; |
return; |
422 |
} |
} else |
|
else |
|
423 |
BitstreamPutBit(bs, 0); // coded |
BitstreamPutBit(bs, 0); // coded |
424 |
} |
} |
425 |
|
|
426 |
if(intra) |
if(intra) |
427 |
CodeBlockIntra(pParam, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
428 |
else |
else |
429 |
CodeBlockInter(pParam, pMB, qcoeff, bs, pStat); |
CodeBlockInter(frame, pMB, qcoeff, bs, pStat); |
430 |
|
|
431 |
|
} |
432 |
|
|
433 |
|
/*************************************************************** |
434 |
|
* bframe encoding start |
435 |
|
***************************************************************/ |
436 |
|
|
437 |
|
/* |
438 |
|
mbtype |
439 |
|
0 1b direct(h263) mvdb |
440 |
|
1 01b interpolate mc+q dbquant, mvdf, mvdb |
441 |
|
2 001b backward mc+q dbquant, mvdb |
442 |
|
3 0001b forward mc+q dbquant, mvdf |
443 |
|
*/ |
444 |
|
|
445 |
|
void |
446 |
|
put_bvop_mbtype(Bitstream * bs, |
447 |
|
int value) |
448 |
|
{ |
449 |
|
switch (value) { |
450 |
|
case 0: |
451 |
|
BitstreamPutBit(bs, 1); |
452 |
|
return; |
453 |
|
|
454 |
|
case 1: |
455 |
|
BitstreamPutBit(bs, 0); |
456 |
|
BitstreamPutBit(bs, 1); |
457 |
|
return; |
458 |
|
|
459 |
|
case 2: |
460 |
|
BitstreamPutBit(bs, 0); |
461 |
|
BitstreamPutBit(bs, 0); |
462 |
|
BitstreamPutBit(bs, 1); |
463 |
|
return; |
464 |
|
|
465 |
|
case 3: |
466 |
|
BitstreamPutBit(bs, 0); |
467 |
|
BitstreamPutBit(bs, 0); |
468 |
|
BitstreamPutBit(bs, 0); |
469 |
|
BitstreamPutBit(bs, 1); |
470 |
|
return; |
471 |
|
|
472 |
|
default:; // invalid! |
473 |
|
|
474 |
|
} |
475 |
|
|
476 |
|
} |
477 |
|
|
478 |
|
/* |
479 |
|
dbquant |
480 |
|
-2 10b |
481 |
|
0 0b |
482 |
|
+2 11b |
483 |
|
*/ |
484 |
|
|
485 |
|
void |
486 |
|
put_bvop_dbquant(Bitstream * bs, |
487 |
|
int value) |
488 |
|
{ |
489 |
|
switch (value) { |
490 |
|
case 0: |
491 |
|
BitstreamPutBit(bs, 0); |
492 |
|
return; |
493 |
|
|
494 |
|
case -2: |
495 |
|
BitstreamPutBit(bs, 1); |
496 |
|
BitstreamPutBit(bs, 0); |
497 |
|
return; |
498 |
|
|
499 |
|
case 2: |
500 |
|
BitstreamPutBit(bs, 1); |
501 |
|
BitstreamPutBit(bs, 1); |
502 |
|
return; |
503 |
|
|
504 |
|
default:; // invalid |
505 |
|
} |
506 |
|
} |
507 |
|
|
508 |
|
|
509 |
|
|
510 |
|
void |
511 |
|
MBCodingBVOP(const MACROBLOCK * mb, |
512 |
|
const int16_t qcoeff[6 * 64], |
513 |
|
const int32_t fcode, |
514 |
|
const int32_t bcode, |
515 |
|
Bitstream * bs, |
516 |
|
Statistics * pStat) |
517 |
|
{ |
518 |
|
int i; |
519 |
|
|
520 |
|
/* ------------------------------------------------------------------ |
521 |
|
when a block is skipped it is decoded DIRECT(0,) |
522 |
|
hence are interpolated from forward & backward frames |
523 |
|
------------------------------------------------------------------ */ |
524 |
|
|
525 |
|
if (mb->mode == 5) { |
526 |
|
BitstreamPutBit(bs, 1); // skipped |
527 |
|
return; |
528 |
|
} |
529 |
|
|
530 |
|
BitstreamPutBit(bs, 0); // not skipped |
531 |
|
|
532 |
|
if (mb->cbp == 0) { |
533 |
|
BitstreamPutBit(bs, 1); // cbp == 0 |
534 |
|
} else { |
535 |
|
BitstreamPutBit(bs, 0); // cbp == xxx |
536 |
|
} |
537 |
|
|
538 |
|
put_bvop_mbtype(bs, mb->mode); |
539 |
|
|
540 |
|
if (mb->cbp) { |
541 |
|
BitstreamPutBits(bs, mb->cbp, 6); |
542 |
|
} |
543 |
|
|
544 |
|
if (mb->mode != MODE_DIRECT && mb->cbp != 0) { |
545 |
|
put_bvop_dbquant(bs, 0); // todo: mb->dquant = 0 |
546 |
|
} |
547 |
|
|
548 |
|
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_FORWARD) { |
549 |
|
CodeVector(bs, mb->pmvs[0].x, fcode, pStat); |
550 |
|
CodeVector(bs, mb->pmvs[0].y, fcode, pStat); |
551 |
|
} |
552 |
|
|
553 |
|
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_BACKWARD) { |
554 |
|
CodeVector(bs, mb->b_pmvs[0].x, bcode, pStat); |
555 |
|
CodeVector(bs, mb->b_pmvs[0].y, bcode, pStat); |
556 |
} |
} |
557 |
|
|
558 |
|
if (mb->mode == MODE_DIRECT) { |
559 |
|
// TODO: direct |
560 |
|
} |
561 |
|
|
562 |
|
for (i = 0; i < 6; i++) { |
563 |
|
if (mb->cbp & (1 << (5 - i))) { |
564 |
|
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
565 |
|
} |
566 |
|
} |
567 |
|
} |
568 |
|
|
569 |
|
|
570 |
|
|
571 |
/*************************************************************** |
/*************************************************************** |
572 |
* decoding stuff starts here * |
* decoding stuff starts here * |
573 |
***************************************************************/ |
***************************************************************/ |
574 |
|
|
|
int get_mcbpc_intra(Bitstream * bs) |
|
|
{ |
|
|
uint32_t index; |
|
575 |
|
|
576 |
while((index = BitstreamShowBits(bs, 9)) == 1) |
void |
577 |
|
skip_stuffing(Bitstream *bs) |
578 |
|
{ |
579 |
|
while (BitstreamShowBits(bs, 9) == 1) |
580 |
BitstreamSkip(bs, 9); |
BitstreamSkip(bs, 9); |
581 |
|
} |
582 |
|
|
583 |
|
|
584 |
|
|
585 |
|
// for IVOP addbits == 0 |
586 |
|
// for PVOP addbits == fcode - 1 |
587 |
|
// for BVOP addbits == max(fcode,bcode) - 1 |
588 |
|
// returns true or false |
589 |
|
int |
590 |
|
check_resync_marker(Bitstream * bs, int addbits) |
591 |
|
{ |
592 |
|
uint32_t nbits; |
593 |
|
uint32_t code; |
594 |
|
uint32_t nbitsresyncmarker = NUMBITS_VP_RESYNC_MARKER + addbits; |
595 |
|
|
596 |
|
nbits = BitstreamNumBitsToByteAlign(bs); |
597 |
|
code = BitstreamShowBits(bs, nbits); |
598 |
|
|
599 |
|
if (code == (((uint32_t)1 << (nbits - 1)) - 1)) |
600 |
|
{ |
601 |
|
return BitstreamShowBitsFromByteAlign(bs, nbitsresyncmarker) == RESYNC_MARKER; |
602 |
|
} |
603 |
|
|
604 |
|
return 0; |
605 |
|
} |
606 |
|
|
607 |
|
|
608 |
|
|
609 |
|
int |
610 |
|
get_mcbpc_intra(Bitstream * bs) |
611 |
|
{ |
612 |
|
|
613 |
|
uint32_t index; |
614 |
|
|
615 |
|
index = BitstreamShowBits(bs, 9); |
616 |
index >>= 3; |
index >>= 3; |
617 |
|
|
618 |
BitstreamSkip(bs, mcbpc_intra_table[index].len); |
BitstreamSkip(bs, mcbpc_intra_table[index].len); |
619 |
|
|
620 |
return mcbpc_intra_table[index].code; |
return mcbpc_intra_table[index].code; |
621 |
|
|
622 |
} |
} |
623 |
|
|
624 |
int get_mcbpc_inter(Bitstream * bs) |
int |
625 |
|
get_mcbpc_inter(Bitstream * bs) |
626 |
{ |
{ |
627 |
|
|
628 |
uint32_t index; |
uint32_t index; |
629 |
|
|
630 |
while((index = CLIP(BitstreamShowBits(bs, 9), 256)) == 1) |
index = CLIP(BitstreamShowBits(bs, 9), 256); |
|
BitstreamSkip(bs, 9); |
|
631 |
|
|
632 |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
633 |
|
|
634 |
return mcbpc_inter_table[index].code; |
return mcbpc_inter_table[index].code; |
635 |
|
|
636 |
} |
} |
637 |
|
|
638 |
int get_cbpy(Bitstream * bs, int intra) |
int |
639 |
|
get_cbpy(Bitstream * bs, |
640 |
|
int intra) |
641 |
{ |
{ |
642 |
|
|
643 |
int cbpy; |
int cbpy; |
644 |
uint32_t index = BitstreamShowBits(bs, 6); |
uint32_t index = BitstreamShowBits(bs, 6); |
645 |
|
|
650 |
cbpy = 15 - cbpy; |
cbpy = 15 - cbpy; |
651 |
|
|
652 |
return cbpy; |
return cbpy; |
653 |
|
|
654 |
} |
} |
655 |
|
|
656 |
int get_mv_data(Bitstream * bs) |
int |
657 |
|
get_mv_data(Bitstream * bs) |
658 |
{ |
{ |
659 |
|
|
660 |
uint32_t index; |
uint32_t index; |
661 |
|
|
662 |
if(BitstreamGetBit(bs)) |
if(BitstreamGetBit(bs)) |
664 |
|
|
665 |
index = BitstreamShowBits(bs, 12); |
index = BitstreamShowBits(bs, 12); |
666 |
|
|
667 |
if(index >= 512) |
if (index >= 512) { |
|
{ |
|
668 |
index = (index >> 8) - 2; |
index = (index >> 8) - 2; |
669 |
BitstreamSkip(bs, TMNMVtab0[index].len); |
BitstreamSkip(bs, TMNMVtab0[index].len); |
670 |
return TMNMVtab0[index].code; |
return TMNMVtab0[index].code; |
671 |
} |
} |
672 |
|
|
673 |
if(index >= 128) |
if (index >= 128) { |
|
{ |
|
674 |
index = (index >> 2) - 32; |
index = (index >> 2) - 32; |
675 |
BitstreamSkip(bs, TMNMVtab1[index].len); |
BitstreamSkip(bs, TMNMVtab1[index].len); |
676 |
return TMNMVtab1[index].code; |
return TMNMVtab1[index].code; |
680 |
|
|
681 |
BitstreamSkip(bs, TMNMVtab2[index].len); |
BitstreamSkip(bs, TMNMVtab2[index].len); |
682 |
return TMNMVtab2[index].code; |
return TMNMVtab2[index].code; |
683 |
|
|
684 |
} |
} |
685 |
|
|
686 |
int get_mv(Bitstream * bs, int fcode) |
int |
687 |
|
get_mv(Bitstream * bs, |
688 |
|
int fcode) |
689 |
{ |
{ |
690 |
|
|
691 |
int data; |
int data; |
692 |
int res; |
int res; |
693 |
int mv; |
int mv; |
702 |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
703 |
|
|
704 |
return data < 0 ? -mv : mv; |
return data < 0 ? -mv : mv; |
705 |
|
|
706 |
} |
} |
707 |
|
|
708 |
int get_dc_dif(Bitstream * bs, uint32_t dc_size) |
int |
709 |
|
get_dc_dif(Bitstream * bs, |
710 |
|
uint32_t dc_size) |
711 |
{ |
{ |
712 |
|
|
713 |
int code = BitstreamGetBits(bs, dc_size); |
int code = BitstreamGetBits(bs, dc_size); |
714 |
int msb = code >> (dc_size - 1); |
int msb = code >> (dc_size - 1); |
715 |
|
|
717 |
return (-1 * (code^((1 << dc_size) - 1))); |
return (-1 * (code^((1 << dc_size) - 1))); |
718 |
|
|
719 |
return code; |
return code; |
720 |
|
|
721 |
} |
} |
722 |
|
|
723 |
int get_dc_size_lum(Bitstream * bs) |
int |
724 |
|
get_dc_size_lum(Bitstream * bs) |
725 |
{ |
{ |
726 |
|
|
727 |
int code, i; |
int code, i; |
728 |
|
|
729 |
code = BitstreamShowBits(bs, 11); |
code = BitstreamShowBits(bs, 11); |
730 |
|
|
731 |
for(i = 11; i > 3; i--) { |
for(i = 11; i > 3; i--) { |
738 |
|
|
739 |
BitstreamSkip(bs, dc_lum_tab[code].len); |
BitstreamSkip(bs, dc_lum_tab[code].len); |
740 |
return dc_lum_tab[code].code; |
return dc_lum_tab[code].code; |
741 |
|
|
742 |
} |
} |
743 |
|
|
744 |
|
|
745 |
int get_dc_size_chrom(Bitstream * bs) |
int |
746 |
|
get_dc_size_chrom(Bitstream * bs) |
747 |
{ |
{ |
748 |
|
|
749 |
uint32_t code, i; |
uint32_t code, i; |
750 |
|
|
751 |
code = BitstreamShowBits(bs, 12); |
code = BitstreamShowBits(bs, 12); |
752 |
|
|
753 |
for(i = 12; i > 2; i--) { |
for(i = 12; i > 2; i--) { |
759 |
} |
} |
760 |
|
|
761 |
return 3 - BitstreamGetBits(bs, 2); |
return 3 - BitstreamGetBits(bs, 2); |
|
} |
|
|
|
|
|
int get_coeff(Bitstream * bs, int *run, int *last, int intra, int short_video_header) |
|
|
{ |
|
|
uint32_t mode; |
|
|
const VLC *tab; |
|
|
int32_t level; |
|
|
|
|
|
if(short_video_header) // inter-VLCs will be used for both intra and inter blocks |
|
|
intra = 0; |
|
|
|
|
|
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
|
|
|
|
if(tab->code == -1) |
|
|
goto error; |
|
|
|
|
|
BitstreamSkip(bs, tab->len); |
|
|
|
|
|
if(tab->code != ESCAPE) { |
|
|
if(!intra) |
|
|
{ |
|
|
*run = (tab->code >> 4) & 255; |
|
|
level = tab->code & 15; |
|
|
*last = (tab->code >> 12) & 1; |
|
|
} |
|
|
else |
|
|
{ |
|
|
*run = (tab->code >> 8) & 255; |
|
|
level = tab->code & 255; |
|
|
*last = (tab->code >> 16) & 1; |
|
|
} |
|
|
return BitstreamGetBit(bs) ? -level : level; |
|
|
} |
|
762 |
|
|
|
if(short_video_header) |
|
|
{ |
|
|
// escape mode 4 - H.263 type, only used if short_video_header = 1 |
|
|
*last = BitstreamGetBit(bs); |
|
|
*run = BitstreamGetBits(bs, 6); |
|
|
level = BitstreamGetBits(bs, 8); |
|
|
|
|
|
if (level == 0 || level == 128) |
|
|
DEBUG1("Illegal LEVEL for ESCAPE mode 4:", level); |
|
|
|
|
|
return (level >= 128 ? -(256 - level) : level); |
|
763 |
} |
} |
764 |
|
|
765 |
mode = BitstreamShowBits(bs, 2); |
void |
766 |
|
get_intra_block(Bitstream * bs, |
767 |
if(mode < 3) { |
int16_t * block, |
768 |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
int direction, |
769 |
|
int coeff) |
|
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
|
if (tab->code == -1) |
|
|
goto error; |
|
|
|
|
|
BitstreamSkip(bs, tab->len); |
|
|
|
|
|
if (!intra) { |
|
|
*run = (tab->code >> 4) & 255; |
|
|
level = tab->code & 15; |
|
|
*last = (tab->code >> 12) & 1; |
|
|
} |
|
|
else |
|
770 |
{ |
{ |
|
*run = (tab->code >> 8) & 255; |
|
|
level = tab->code & 255; |
|
|
*last = (tab->code >> 16) & 1; |
|
|
} |
|
|
|
|
|
if(mode < 2) // first escape mode, level is offset |
|
|
level += max_level[*last + (!intra<<1)][*run]; // need to add back the max level |
|
|
else if(mode == 2) // second escape mode, run is offset |
|
|
*run += max_run[*last + (!intra<<1)][level] + 1; |
|
|
|
|
|
return BitstreamGetBit(bs) ? -level : level; |
|
|
} |
|
|
|
|
|
// third escape mode - fixed length codes |
|
|
BitstreamSkip(bs, 2); |
|
|
*last = BitstreamGetBits(bs, 1); |
|
|
*run = BitstreamGetBits(bs, 6); |
|
|
BitstreamSkip(bs, 1); // marker |
|
|
level = BitstreamGetBits(bs, 12); |
|
|
BitstreamSkip(bs, 1); // marker |
|
|
|
|
|
return (level & 0x800) ? (level | (-1 ^ 0xfff)) : level; |
|
|
|
|
|
error: |
|
|
*run = VLC_ERROR; |
|
|
return 0; |
|
|
} |
|
|
|
|
771 |
|
|
|
void get_intra_block(Bitstream * bs, int16_t * block, int direction, int coeff) |
|
|
{ |
|
772 |
const uint16_t * scan = scan_tables[ direction ]; |
const uint16_t * scan = scan_tables[ direction ]; |
773 |
int level; |
int level; |
774 |
int run; |
int run; |
775 |
int last; |
int last; |
776 |
|
|
777 |
do |
do { |
|
{ |
|
778 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
779 |
if (run == -1) |
if (run == -1) { |
|
{ |
|
780 |
DEBUG("fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
781 |
break; |
break; |
782 |
} |
} |
783 |
coeff += run; |
coeff += run; |
784 |
block[ scan[coeff] ] = level; |
block[ scan[coeff] ] = level; |
785 |
if (level < -127 || level > 127) |
if (level < -127 || level > 127) { |
|
{ |
|
786 |
DEBUG1("warning: intra_overflow", level); |
DEBUG1("warning: intra_overflow", level); |
787 |
} |
} |
788 |
coeff++; |
coeff++; |
789 |
} while (!last); |
} while (!last); |
790 |
|
|
791 |
} |
} |
792 |
|
|
793 |
void get_inter_block(Bitstream * bs, int16_t * block) |
void |
794 |
|
get_inter_block(Bitstream * bs, |
795 |
|
int16_t * block) |
796 |
{ |
{ |
797 |
|
|
798 |
const uint16_t * scan = scan_tables[0]; |
const uint16_t * scan = scan_tables[0]; |
799 |
int p; |
int p; |
800 |
int level; |
int level; |
802 |
int last; |
int last; |
803 |
|
|
804 |
p = 0; |
p = 0; |
805 |
do |
do { |
|
{ |
|
806 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
807 |
if (run == -1) |
if (run == -1) { |
|
{ |
|
808 |
DEBUG("fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
809 |
break; |
break; |
810 |
} |
} |
811 |
p += run; |
p += run; |
812 |
|
|
813 |
block[ scan[p] ] = level; |
block[ scan[p] ] = level; |
814 |
if (level < -127 || level > 127) |
if (level < -127 || level > 127) { |
|
{ |
|
815 |
DEBUG1("warning: inter_overflow", level); |
DEBUG1("warning: inter_overflow", level); |
816 |
} |
} |
817 |
p++; |
p++; |
818 |
} while (!last); |
} while (!last); |
819 |
|
|
820 |
} |
} |