1 |
/****************************************************************************** |
/***************************************************************************** |
2 |
* * |
* |
3 |
* This file is part of XviD, a free MPEG-4 video encoder/decoder * |
* XVID MPEG-4 VIDEO CODEC |
4 |
* * |
* - Macro Block coding functions - |
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 * |
* Copyright(C) 2002 Michael Militzer <isibaar@xvid.org> |
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 * |
* This program is an implementation of a part of one or more MPEG-4 |
10 |
* software module and his/her company, and subsequent editors and their * |
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
11 |
* companies, will have no liability for use of this software or * |
* to use this software module in hardware or software products are |
12 |
* modifications or derivatives thereof. * |
* advised that its use may infringe existing patents or copyrights, and |
13 |
* * |
* any such use would be at such party's own risk. The original |
14 |
* XviD is free software; you can redistribute it and/or modify it * |
* developer of this software module and his/her company, and subsequent |
15 |
* under the terms of the GNU General Public License as published by * |
* editors and their companies, will have no liability for use of this |
16 |
* the Free Software Foundation; either version 2 of the License, or * |
* software or modifications or derivatives thereof. |
17 |
* (at your option) any later version. * |
* |
18 |
* * |
* This program is free software; you can redistribute it and/or modify |
19 |
* XviD is distributed in the hope that it will be useful, but * |
* it under the terms of the GNU General Public License as published by |
20 |
* WITHOUT ANY WARRANTY; without even the implied warranty of * |
* the Free Software Foundation; either version 2 of the License, or |
21 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
* (at your option) any later version. |
22 |
* GNU General Public License for more details. * |
* |
23 |
* * |
* This program is distributed in the hope that it will be useful, |
24 |
* You should have received a copy of the GNU General Public License * |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
25 |
* along with this program; if not, write to the Free Software * |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
26 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * |
* GNU General Public License for more details. |
27 |
* * |
* |
28 |
******************************************************************************/ |
* You should have received a copy of the GNU General Public License |
29 |
|
* along with this program; if not, write to the Free Software |
30 |
/****************************************************************************** |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
31 |
* * |
* |
32 |
* mbcoding.c * |
* $Id$ |
33 |
* * |
* |
34 |
* Copyright (C) 2002 - Michael Militzer <isibaar@xvid.org> * |
****************************************************************************/ |
|
* * |
|
|
* For more information visit the XviD homepage: http://www.xvid.org * |
|
|
* * |
|
|
******************************************************************************/ |
|
|
|
|
|
/****************************************************************************** |
|
|
* * |
|
|
* Revision history: * |
|
|
* * |
|
|
* 28.10.2002 GMC support - gruel * |
|
|
* 28.06.2002 added check_resync_marker() * |
|
|
* 14.04.2002 bframe encoding * |
|
|
* 08.03.2002 initial version; isibaar * |
|
|
* * |
|
|
******************************************************************************/ |
|
35 |
|
|
|
|
|
|
#include <stdio.h> |
|
36 |
#include <stdlib.h> |
#include <stdlib.h> |
37 |
#include "../portab.h" |
#include "../portab.h" |
|
#include "../global.h" |
|
38 |
#include "bitstream.h" |
#include "bitstream.h" |
39 |
#include "zigzag.h" |
#include "zigzag.h" |
40 |
#include "vlc_codes.h" |
#include "vlc_codes.h" |
42 |
|
|
43 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
44 |
|
|
45 |
/* #define BIGLUT */ |
#define ABS(X) (((X)>0)?(X):-(X)) |
46 |
|
#define CLIP(X,A) (X > A) ? (A) : (X) |
47 |
|
|
48 |
#ifdef BIGLUT |
/***************************************************************************** |
49 |
#define LEVELOFFSET 2048 |
* Local data |
50 |
#else |
****************************************************************************/ |
51 |
#define LEVELOFFSET 32 |
|
52 |
#endif |
/* msvc sp5+pp gets confused if they globals are made static */ |
53 |
|
VLC intra_table[524032]; |
54 |
static REVERSE_EVENT DCT3D[2][4096]; |
VLC inter_table[524032]; |
55 |
|
|
56 |
#ifdef BIGLUT |
static VLC DCT3Dintra[4096]; |
57 |
static VLC coeff_VLC[2][2][4096][64]; |
static VLC DCT3Dinter[4096]; |
58 |
static VLC *intra_table, *inter_table; |
|
59 |
#else |
/***************************************************************************** |
60 |
static VLC coeff_VLC[2][2][64][64]; |
* Vector Length Coding Initialization |
61 |
#endif |
****************************************************************************/ |
62 |
|
|
63 |
/* not really MB related, but VLCs are only available here */ |
void |
64 |
void bs_put_spritetrajectory(Bitstream * bs, const int val) |
init_vlc_tables(void) |
65 |
{ |
{ |
|
const int code = sprite_trajectory_code[val+16384].code; |
|
|
const int len = sprite_trajectory_code[val+16384].len; |
|
|
const int code2 = sprite_trajectory_len[len].code; |
|
|
const int len2 = sprite_trajectory_len[len].len; |
|
66 |
|
|
67 |
// printf("GMC=%d Code/Len = %d / %d ",val, code,len); |
int32_t k, l, i, intra, last; |
68 |
// printf("Code2 / Len2 = %d / %d \n",code2,len2); |
VLC *vlc[2]; |
69 |
|
VLC const **coeff_ptr; |
70 |
|
VLC *vlc1, *vlc2; |
71 |
|
|
72 |
BitstreamPutBits(bs, code2, len2); |
vlc1 = DCT3Dintra; |
73 |
if (len) BitstreamPutBits(bs, code, len); |
vlc2 = DCT3Dinter; |
|
} |
|
74 |
|
|
75 |
int bs_get_spritetrajectory(Bitstream * bs) |
vlc[0] = intra_table; |
76 |
{ |
vlc[1] = inter_table; |
|
int i; |
|
|
for (i = 0; i < 12; i++) |
|
|
{ |
|
|
if (BitstreamShowBits(bs, sprite_trajectory_len[i].len) == sprite_trajectory_len[i].code) |
|
|
{ |
|
|
BitstreamSkip(bs, sprite_trajectory_len[i].len); |
|
|
return i; |
|
|
} |
|
|
} |
|
|
return -1; |
|
|
} |
|
77 |
|
|
78 |
void |
/* |
79 |
init_vlc_tables(void) |
* Generate encoding vlc lookup tables |
80 |
{ |
* the lookup table idea is taken from the excellent fame project |
81 |
ptr_t i, j, k, intra, last, run, run_esc, level, level_esc, escape, escape_len, offset; |
* by Vivien Chapellier |
82 |
int32_t l; |
*/ |
83 |
|
for (i = 0; i < 4; i++) { |
84 |
|
intra = i % 2; |
85 |
|
last = i / 2; |
86 |
|
|
87 |
#ifdef BIGLUT |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
|
intra_table = coeff_VLC[1]; |
|
|
inter_table = coeff_VLC[0]; |
|
|
#endif |
|
88 |
|
|
89 |
|
for (k = -2047; k < 2048; k++) { // level |
90 |
|
int8_t const *max_level_ptr = max_level[last + 2 * intra]; |
91 |
|
int8_t const *max_run_ptr = max_run[last + 2 * intra]; |
92 |
|
|
93 |
for (intra = 0; intra < 2; intra++) |
for (l = 0; l < 64; l++) { // run |
94 |
for (i = 0; i < 4096; i++) |
int32_t level = k; |
95 |
DCT3D[intra][i].event.level = 0; |
ptr_t run = l; |
96 |
|
|
97 |
for (intra = 0; intra < 2; intra++) |
if ((abs(level) <= max_level_ptr[run]) && (run <= (uint32_t) max_run_ptr[abs(level)])) { // level < max_level and run < max_run |
|
for (last = 0; last < 2; last++) |
|
|
{ |
|
|
for (run = 0; run < 63 + last; run++) |
|
|
for (level = 0; level < 32 << intra; level++) |
|
|
{ |
|
|
#ifdef BIGLUT |
|
|
offset = LEVELOFFSET; |
|
|
#else |
|
|
offset = !intra * LEVELOFFSET; |
|
|
#endif |
|
|
coeff_VLC[intra][last][level + offset][run].len = 128; |
|
|
} |
|
|
} |
|
98 |
|
|
99 |
for (intra = 0; intra < 2; intra++) |
vlc[intra]->code = 0; |
100 |
for (i = 0; i < 102; i++) |
vlc[intra]->len = 0; |
101 |
{ |
goto loop_end; |
102 |
#ifdef BIGLUT |
} else { |
103 |
offset = LEVELOFFSET; |
if (level > 0) // correct level |
104 |
#else |
level -= max_level_ptr[run]; |
105 |
offset = !intra * LEVELOFFSET; |
else |
106 |
#endif |
level += max_level_ptr[run]; |
|
for (j = 0; j < 1 << (12 - coeff_tab[intra][i].vlc.len); j++) |
|
|
{ |
|
|
DCT3D[intra][(coeff_tab[intra][i].vlc.code << (12 - coeff_tab[intra][i].vlc.len)) | j].len = coeff_tab[intra][i].vlc.len; |
|
|
DCT3D[intra][(coeff_tab[intra][i].vlc.code << (12 - coeff_tab[intra][i].vlc.len)) | j].event = coeff_tab[intra][i].event; |
|
|
} |
|
107 |
|
|
108 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].code |
if ((abs(level) <= max_level_ptr[run]) && |
109 |
= coeff_tab[intra][i].vlc.code << 1; |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
110 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].len |
|
111 |
= coeff_tab[intra][i].vlc.len + 1; |
vlc[intra]->code = 0x06; |
112 |
#ifndef BIGLUT |
vlc[intra]->len = 8; |
113 |
if (!intra) |
goto loop_end; |
|
#endif |
|
|
{ |
|
|
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].code |
|
|
= (coeff_tab[intra][i].vlc.code << 1) | 1; |
|
|
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].len |
|
|
= coeff_tab[intra][i].vlc.len + 1; |
|
|
} |
|
114 |
} |
} |
115 |
|
|
116 |
for (intra = 0; intra < 2; intra++) |
if (level > 0) // still here? |
117 |
for (last = 0; last < 2; last++) |
level += max_level_ptr[run]; // restore level |
118 |
for (run = 0; run < 63 + last; run++) |
else |
119 |
{ |
level -= max_level_ptr[run]; |
|
for (level = 1; level < 32 << intra; level++) |
|
|
{ |
|
|
if (level <= max_level[intra][last][run] && run <= max_run[intra][last][level]) |
|
|
continue; |
|
120 |
|
|
121 |
#ifdef BIGLUT |
run -= max_run_ptr[abs(level)] + 1; // and change run |
|
offset = LEVELOFFSET; |
|
|
#else |
|
|
offset = !intra * LEVELOFFSET; |
|
|
#endif |
|
|
level_esc = level - max_level[intra][last][run]; |
|
|
run_esc = run - 1 - max_run[intra][last][level]; |
|
|
/*use this test to use shorter esc2 codes when possible |
|
|
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc] |
|
|
&& !(coeff_VLC[intra][last][level_esc + offset][run].len + 7 + 1 |
|
|
> coeff_VLC[intra][last][level + offset][run_esc].code + 7 + 2))*/ |
|
122 |
|
|
123 |
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc]) |
if ((abs(level) <= max_level_ptr[run]) && |
124 |
{ |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
125 |
escape = ESCAPE1; |
|
126 |
escape_len = 7 + 1; |
vlc[intra]->code = 0x0e; |
127 |
run_esc = run; |
vlc[intra]->len = 9; |
128 |
} |
goto loop_end; |
|
else |
|
|
{ |
|
|
if (level <= max_level[intra][last][run_esc] && run_esc <= max_run[intra][last][level]) |
|
|
{ |
|
|
escape = ESCAPE2; |
|
|
escape_len = 7 + 2; |
|
|
level_esc = level; |
|
129 |
} |
} |
130 |
else |
run += max_run_ptr[abs(level)] + 1; |
|
{ |
|
|
#ifndef BIGLUT |
|
|
if (!intra) |
|
|
#endif |
|
|
{ |
|
|
coeff_VLC[intra][last][level + offset][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][level + offset][run].len = 30; |
|
|
coeff_VLC[intra][last][offset - level][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-level & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][offset - level][run].len = 30; |
|
131 |
} |
} |
132 |
|
|
133 |
|
vlc[intra]->code = |
134 |
|
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
135 |
|
((k & 0xfff) << 1) | 1; |
136 |
|
|
137 |
|
vlc[intra]->len = 30; |
138 |
|
vlc[intra]++; |
139 |
continue; |
continue; |
|
} |
|
|
} |
|
140 |
|
|
141 |
coeff_VLC[intra][last][level + offset][run].code |
loop_end: |
142 |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
if (level != 0) { |
143 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code; |
vlc[intra]->code = |
144 |
coeff_VLC[intra][last][level + offset][run].len |
(vlc[intra]-> |
145 |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
code << (coeff_ptr[run][abs(level) - 1].len + |
146 |
#ifndef BIGLUT |
1)) | (coeff_ptr[run][abs(level) - |
147 |
if (!intra) |
1].code << 1); |
148 |
#endif |
vlc[intra]->len = |
149 |
{ |
(coeff_ptr[run][abs(level) - 1].len + 1) + |
150 |
coeff_VLC[intra][last][offset - level][run].code |
vlc[intra]->len; |
151 |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
|
152 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code | 1; |
if (level < 0) |
153 |
coeff_VLC[intra][last][offset - level][run].len |
vlc[intra]->code += 1; |
154 |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
} |
155 |
|
|
156 |
|
vlc[intra]++; |
157 |
} |
} |
158 |
} |
} |
|
|
|
|
#ifdef BIGLUT |
|
|
for (level = 32 << intra; level < 2048; level++) |
|
|
{ |
|
|
coeff_VLC[intra][last][level + offset][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][level + offset][run].len = 30; |
|
|
|
|
|
coeff_VLC[intra][last][offset - level][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-level & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][offset - level][run].len = 30; |
|
159 |
} |
} |
|
#else |
|
|
if (!intra) |
|
|
{ |
|
|
coeff_VLC[intra][last][0][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-32 & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][0][run].len = 30; |
|
|
} |
|
|
#endif |
|
|
} |
|
|
/* init sprite_trajectory tables */ |
|
|
/* even if GMC is not specified (it might be used later...) */ |
|
|
|
|
|
sprite_trajectory_code[0+16384].code = 0; |
|
|
sprite_trajectory_code[0+16384].len = 0; |
|
|
for (k=0;k<14;k++) |
|
|
{ |
|
|
int limit = (1<<k); |
|
160 |
|
|
161 |
for (l=-(2*limit-1); l <= -limit; l++) |
for (i = 0; i < 4096; i++) { |
162 |
{ |
if (i >= 512) { |
163 |
sprite_trajectory_code[l+16384].code = (2*limit-1)+l; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
164 |
sprite_trajectory_code[l+16384].len = k+1; |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
165 |
|
} else if (i >= 128) { |
166 |
|
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
167 |
|
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
168 |
|
} else if (i >= 8) { |
169 |
|
*vlc1 = DCT3Dtab5[i - 8]; |
170 |
|
*vlc2 = DCT3Dtab2[i - 8]; |
171 |
|
} else { |
172 |
|
*vlc1 = ERRtab[i]; |
173 |
|
*vlc2 = ERRtab[i]; |
174 |
} |
} |
175 |
|
|
176 |
for (l=limit; l<= 2*limit-1; l++) |
vlc1++; |
177 |
{ |
vlc2++; |
|
sprite_trajectory_code[l+16384].code = l; |
|
|
sprite_trajectory_code[l+16384].len = k+1; |
|
|
} |
|
178 |
} |
} |
179 |
|
DCT3D[0] = DCT3Dinter; |
180 |
|
DCT3D[1] = DCT3Dintra; |
181 |
|
|
182 |
} |
} |
183 |
|
|
184 |
|
/***************************************************************************** |
185 |
|
* Local inlined functions for MB coding |
186 |
|
****************************************************************************/ |
187 |
|
|
188 |
static __inline void |
static __inline void |
189 |
CodeVector(Bitstream * bs, |
CodeVector(Bitstream * bs, |
190 |
int32_t value, |
int32_t value, |
240 |
|
|
241 |
} |
} |
242 |
|
|
|
#ifdef BIGLUT |
|
|
|
|
243 |
static __inline void |
static __inline void |
244 |
CodeCoeff(Bitstream * bs, |
CodeCoeff(Bitstream * bs, |
245 |
const int16_t qcoeff[64], |
const int16_t qcoeff[64], |
259 |
j++; |
j++; |
260 |
|
|
261 |
do { |
do { |
262 |
vlc = table + 64 * 2048 + (v << 6) + j - last; |
vlc = table + 64 * 2047 + (v << 6) + j - last; |
263 |
last = ++j; |
last = ++j; |
264 |
|
|
265 |
/* count zeroes */ |
// count zeroes |
266 |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
267 |
j++; |
j++; |
268 |
|
|
269 |
/* write code */ |
// write code |
270 |
if (j != 64) { |
if (j != 64) { |
271 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
272 |
} else { |
} else { |
273 |
vlc += 64 * 4096; |
vlc += 64 * 4095; |
274 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
275 |
break; |
break; |
276 |
} |
} |
278 |
|
|
279 |
} |
} |
280 |
|
|
281 |
#else |
/***************************************************************************** |
282 |
|
* Local functions |
283 |
static __inline void |
****************************************************************************/ |
|
CodeCoeffInter(Bitstream * bs, |
|
|
const int16_t qcoeff[64], |
|
|
const uint16_t * zigzag) |
|
|
{ |
|
|
uint32_t i, run, prev_run, code, len; |
|
|
int32_t level, prev_level, level_shifted; |
|
|
|
|
|
i = 0; |
|
|
run = 0; |
|
|
|
|
|
while (!(level = qcoeff[zigzag[i++]])) |
|
|
run++; |
|
|
|
|
|
prev_level = level; |
|
|
prev_run = run; |
|
|
run = 0; |
|
|
|
|
|
while (i < 64) |
|
|
{ |
|
|
if ((level = qcoeff[zigzag[i++]]) != 0) |
|
|
{ |
|
|
level_shifted = prev_level + 32; |
|
|
if (!(level_shifted & -64)) |
|
|
{ |
|
|
code = coeff_VLC[0][0][level_shifted][prev_run].code; |
|
|
len = coeff_VLC[0][0][level_shifted][prev_run].len; |
|
|
} |
|
|
else |
|
|
{ |
|
|
code = (ESCAPE3 << 21) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
|
|
len = 30; |
|
|
} |
|
|
BitstreamPutBits(bs, code, len); |
|
|
prev_level = level; |
|
|
prev_run = run; |
|
|
run = 0; |
|
|
} |
|
|
else |
|
|
run++; |
|
|
} |
|
|
|
|
|
level_shifted = prev_level + 32; |
|
|
if (!(level_shifted & -64)) |
|
|
{ |
|
|
code = coeff_VLC[0][1][level_shifted][prev_run].code; |
|
|
len = coeff_VLC[0][1][level_shifted][prev_run].len; |
|
|
} |
|
|
else |
|
|
{ |
|
|
code = (ESCAPE3 << 21) | (1 << 20) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
|
|
len = 30; |
|
|
} |
|
|
BitstreamPutBits(bs, code, len); |
|
|
} |
|
|
|
|
|
static __inline void |
|
|
CodeCoeffIntra(Bitstream * bs, |
|
|
const int16_t qcoeff[64], |
|
|
const uint16_t * zigzag) |
|
|
{ |
|
|
uint32_t i, abs_level, run, prev_run, code, len; |
|
|
int32_t level, prev_level; |
|
|
|
|
|
i = 1; |
|
|
run = 0; |
|
|
|
|
|
while (!(level = qcoeff[zigzag[i++]])) |
|
|
run++; |
|
|
|
|
|
prev_level = level; |
|
|
prev_run = run; |
|
|
run = 0; |
|
|
|
|
|
while (i < 64) |
|
|
{ |
|
|
if ((level = qcoeff[zigzag[i++]]) != 0) |
|
|
{ |
|
|
abs_level = ABS(prev_level); |
|
|
abs_level = abs_level < 64 ? abs_level : 0; |
|
|
code = coeff_VLC[1][0][abs_level][prev_run].code; |
|
|
len = coeff_VLC[1][0][abs_level][prev_run].len; |
|
|
if (len != 128) |
|
|
code |= (prev_level < 0); |
|
|
else |
|
|
{ |
|
|
code = (ESCAPE3 << 21) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
|
|
len = 30; |
|
|
} |
|
|
BitstreamPutBits(bs, code, len); |
|
|
prev_level = level; |
|
|
prev_run = run; |
|
|
run = 0; |
|
|
} |
|
|
else |
|
|
run++; |
|
|
} |
|
|
|
|
|
abs_level = ABS(prev_level); |
|
|
abs_level = abs_level < 64 ? abs_level : 0; |
|
|
code = coeff_VLC[1][1][abs_level][prev_run].code; |
|
|
len = coeff_VLC[1][1][abs_level][prev_run].len; |
|
|
if (len != 128) |
|
|
code |= (prev_level < 0); |
|
|
else |
|
|
{ |
|
|
code = (ESCAPE3 << 21) | (1 << 20) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
|
|
len = 30; |
|
|
} |
|
|
BitstreamPutBits(bs, code, len); |
|
|
} |
|
|
|
|
|
#endif |
|
284 |
|
|
285 |
static __inline void |
static void |
286 |
CodeBlockIntra(const FRAMEINFO * const frame, |
CodeBlockIntra(const FRAMEINFO * frame, |
287 |
const MACROBLOCK * pMB, |
const MACROBLOCK * pMB, |
288 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
289 |
Bitstream * bs, |
Bitstream * bs, |
332 |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
333 |
|
|
334 |
if (pMB->cbp & (1 << (5 - i))) { |
if (pMB->cbp & (1 << (5 - i))) { |
|
const uint16_t *scan_table = |
|
|
frame->global_flags & XVID_ALTERNATESCAN ? |
|
|
scan_tables[2] : scan_tables[pMB->acpred_directions[i]]; |
|
|
|
|
335 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
336 |
|
|
337 |
#ifdef BIGLUT |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
338 |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, scan_table, 1); |
scan_tables[pMB->acpred_directions[i]], 1); |
|
#else |
|
|
CodeCoeffIntra(bs, &qcoeff[i * 64], scan_table); |
|
|
#endif |
|
339 |
|
|
340 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
341 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
346 |
|
|
347 |
|
|
348 |
static void |
static void |
349 |
CodeBlockInter(const FRAMEINFO * const frame, |
CodeBlockInter(const FRAMEINFO * frame, |
350 |
const MACROBLOCK * pMB, |
const MACROBLOCK * pMB, |
351 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
352 |
Bitstream * bs, |
Bitstream * bs, |
363 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
364 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
365 |
|
|
|
if ( (frame->coding_type == S_VOP) && (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) ) |
|
|
BitstreamPutBit(bs, pMB->mcsel); // mcsel: '0'=local motion, '1'=GMC |
|
|
|
|
366 |
// write cbpy |
// write cbpy |
367 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
368 |
|
|
374 |
if (frame->global_flags & XVID_INTERLACING) { |
if (frame->global_flags & XVID_INTERLACING) { |
375 |
if (pMB->cbp) { |
if (pMB->cbp) { |
376 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
377 |
DPRINTF(DPRINTF_MB,"codep: field_dct: %i", pMB->field_dct); |
DEBUG1("codep: field_dct: ", pMB->field_dct); |
378 |
} |
} |
379 |
|
|
380 |
// if inter block, write field ME flag |
// if inter block, write field ME flag |
381 |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
382 |
BitstreamPutBit(bs, pMB->field_pred); |
BitstreamPutBit(bs, pMB->field_pred); |
383 |
DPRINTF(DPRINTF_MB,"codep: field_pred: %i", pMB->field_pred); |
DEBUG1("codep: field_pred: ", pMB->field_pred); |
384 |
|
|
385 |
// write field prediction references |
// write field prediction references |
386 |
if (pMB->field_pred) { |
if (pMB->field_pred) { |
389 |
} |
} |
390 |
} |
} |
391 |
} |
} |
392 |
// code motion vector(s) if motion is local |
// code motion vector(s) |
|
if (!pMB->mcsel) |
|
393 |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
394 |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
395 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
400 |
// code block coeffs |
// code block coeffs |
401 |
for (i = 0; i < 6; i++) |
for (i = 0; i < 6; i++) |
402 |
if (pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) |
403 |
{ |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
|
const uint16_t *scan_table = |
|
|
frame->global_flags & XVID_ALTERNATESCAN ? |
|
|
scan_tables[2] : scan_tables[0]; |
|
|
|
|
|
#ifdef BIGLUT |
|
|
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_table, 0); |
|
|
#else |
|
|
CodeCoeffInter(bs, &qcoeff[i * 64], scan_table); |
|
|
#endif |
|
|
} |
|
404 |
|
|
405 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
406 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
407 |
|
|
408 |
} |
} |
409 |
|
|
410 |
|
/***************************************************************************** |
411 |
|
* Macro Block bitstream encoding functions |
412 |
|
****************************************************************************/ |
413 |
|
|
414 |
void |
void |
415 |
MBCoding(const FRAMEINFO * const frame, |
MBCoding(const FRAMEINFO * frame, |
416 |
MACROBLOCK * pMB, |
MACROBLOCK * pMB, |
417 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
418 |
Bitstream * bs, |
Bitstream * bs, |
419 |
Statistics * pStat) |
Statistics * pStat) |
420 |
{ |
{ |
421 |
if (frame->coding_type != I_VOP) |
|
422 |
BitstreamPutBit(bs, 0); // not_coded |
if (frame->coding_type == P_VOP) { |
423 |
|
BitstreamPutBit(bs, 0); // coded |
424 |
|
} |
425 |
|
|
426 |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
427 |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
430 |
|
|
431 |
} |
} |
432 |
|
|
433 |
/* |
|
|
// moved to mbcoding.h so that in can be 'static __inline' |
|
434 |
void |
void |
435 |
MBSkip(Bitstream * bs) |
MBSkip(Bitstream * bs) |
436 |
{ |
{ |
437 |
BitstreamPutBit(bs, 1); // not coded |
BitstreamPutBit(bs, 1); // not coded |
438 |
|
return; |
439 |
} |
} |
|
*/ |
|
|
|
|
|
/*************************************************************** |
|
|
* bframe encoding start |
|
|
***************************************************************/ |
|
|
|
|
|
/* |
|
|
mbtype |
|
|
0 1b direct(h263) mvdb |
|
|
1 01b interpolate mc+q dbquant, mvdf, mvdb |
|
|
2 001b backward mc+q dbquant, mvdb |
|
|
3 0001b forward mc+q dbquant, mvdf |
|
|
*/ |
|
440 |
|
|
441 |
static __inline void |
/***************************************************************************** |
442 |
put_bvop_mbtype(Bitstream * bs, |
* decoding stuff starts here |
443 |
int value) |
****************************************************************************/ |
|
{ |
|
|
switch (value) { |
|
|
case MODE_FORWARD: |
|
|
BitstreamPutBit(bs, 0); |
|
|
case MODE_BACKWARD: |
|
|
BitstreamPutBit(bs, 0); |
|
|
case MODE_INTERPOLATE: |
|
|
BitstreamPutBit(bs, 0); |
|
|
case MODE_DIRECT: |
|
|
BitstreamPutBit(bs, 1); |
|
|
default: |
|
|
break; |
|
|
} |
|
|
} |
|
444 |
|
|
445 |
/* |
/* |
446 |
dbquant |
* For IVOP addbits == 0 |
447 |
-2 10b |
* For PVOP addbits == fcode - 1 |
448 |
0 0b |
* For BVOP addbits == max(fcode,bcode) - 1 |
449 |
+2 11b |
* returns true or false |
450 |
*/ |
*/ |
451 |
|
|
|
static __inline void |
|
|
put_bvop_dbquant(Bitstream * bs, |
|
|
int value) |
|
|
{ |
|
|
switch (value) { |
|
|
case 0: |
|
|
BitstreamPutBit(bs, 0); |
|
|
return; |
|
|
|
|
|
case -2: |
|
|
BitstreamPutBit(bs, 1); |
|
|
BitstreamPutBit(bs, 0); |
|
|
return; |
|
|
|
|
|
case 2: |
|
|
BitstreamPutBit(bs, 1); |
|
|
BitstreamPutBit(bs, 1); |
|
|
return; |
|
|
|
|
|
default:; // invalid |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
void |
|
|
MBCodingBVOP(const MACROBLOCK * mb, |
|
|
const int16_t qcoeff[6 * 64], |
|
|
const int32_t fcode, |
|
|
const int32_t bcode, |
|
|
Bitstream * bs, |
|
|
Statistics * pStat, |
|
|
int direction) |
|
|
{ |
|
|
int vcode = fcode; |
|
|
unsigned int i; |
|
|
|
|
|
/* ------------------------------------------------------------------ |
|
|
when a block is skipped it is decoded DIRECT(0,0) |
|
|
hence is interpolated from forward & backward frames |
|
|
------------------------------------------------------------------ */ |
|
|
|
|
|
if (mb->mode == MODE_DIRECT_NONE_MV) { |
|
|
BitstreamPutBit(bs, 1); // skipped |
|
|
return; |
|
|
} |
|
|
|
|
|
BitstreamPutBit(bs, 0); // not skipped |
|
|
|
|
|
if (mb->cbp == 0) { |
|
|
BitstreamPutBit(bs, 1); // cbp == 0 |
|
|
} else { |
|
|
BitstreamPutBit(bs, 0); // cbp == xxx |
|
|
} |
|
|
|
|
|
put_bvop_mbtype(bs, mb->mode); |
|
|
|
|
|
if (mb->cbp) { |
|
|
BitstreamPutBits(bs, mb->cbp, 6); |
|
|
} |
|
|
|
|
|
if (mb->mode != MODE_DIRECT && mb->cbp != 0) { |
|
|
put_bvop_dbquant(bs, 0); // todo: mb->dquant = 0 |
|
|
} |
|
|
|
|
|
switch (mb->mode) { |
|
|
case MODE_INTERPOLATE: |
|
|
CodeVector(bs, mb->pmvs[1].x, vcode, pStat); //forward vector of interpolate mode |
|
|
CodeVector(bs, mb->pmvs[1].y, vcode, pStat); |
|
|
case MODE_BACKWARD: |
|
|
vcode = bcode; |
|
|
case MODE_FORWARD: |
|
|
CodeVector(bs, mb->pmvs[0].x, vcode, pStat); |
|
|
CodeVector(bs, mb->pmvs[0].y, vcode, pStat); |
|
|
break; |
|
|
case MODE_DIRECT: |
|
|
CodeVector(bs, mb->pmvs[3].x, 1, pStat); // fcode is always 1 for delta vector |
|
|
CodeVector(bs, mb->pmvs[3].y, 1, pStat); // prediction is always (0,0) |
|
|
default: break; |
|
|
} |
|
|
|
|
|
for (i = 0; i < 6; i++) { |
|
|
if (mb->cbp & (1 << (5 - i))) { |
|
|
#ifdef BIGLUT |
|
|
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
|
|
#else |
|
|
CodeCoeffInter(bs, &qcoeff[i * 64], scan_tables[0]); |
|
|
#endif |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************** |
|
|
* decoding stuff starts here * |
|
|
***************************************************************/ |
|
|
|
|
|
|
|
|
// for IVOP addbits == 0 |
|
|
// for PVOP addbits == fcode - 1 |
|
|
// for BVOP addbits == max(fcode,bcode) - 1 |
|
|
// returns true or false |
|
452 |
int |
int |
453 |
check_resync_marker(Bitstream * bs, int addbits) |
check_resync_marker(Bitstream * bs, int addbits) |
454 |
{ |
{ |
490 |
|
|
491 |
uint32_t index; |
uint32_t index; |
492 |
|
|
493 |
index = MIN(BitstreamShowBits(bs, 9), 256); |
index = CLIP(BitstreamShowBits(bs, 9), 256); |
494 |
|
|
495 |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
496 |
|
|
516 |
|
|
517 |
} |
} |
518 |
|
|
519 |
static __inline int |
int |
520 |
get_mv_data(Bitstream * bs) |
get_mv_data(Bitstream * bs) |
521 |
{ |
{ |
522 |
|
|
625 |
|
|
626 |
} |
} |
627 |
|
|
628 |
|
/***************************************************************************** |
629 |
|
* Local inlined function to "decode" written vlc codes |
630 |
|
****************************************************************************/ |
631 |
|
|
632 |
static __inline int |
static __inline int |
633 |
get_coeff(Bitstream * bs, |
get_coeff(Bitstream * bs, |
634 |
int *run, |
int *run, |
638 |
{ |
{ |
639 |
|
|
640 |
uint32_t mode; |
uint32_t mode; |
641 |
|
const VLC *tab; |
642 |
int32_t level; |
int32_t level; |
|
REVERSE_EVENT *reverse_event; |
|
643 |
|
|
644 |
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 |
645 |
intra = 0; |
intra = 0; |
646 |
|
|
647 |
if (BitstreamShowBits(bs, 7) != ESCAPE) { |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
648 |
|
|
649 |
if ((level = reverse_event->event.level) == 0) |
if (tab->code == -1) |
650 |
goto error; |
goto error; |
651 |
|
|
652 |
*last = reverse_event->event.last; |
BitstreamSkip(bs, tab->len); |
|
*run = reverse_event->event.run; |
|
653 |
|
|
654 |
BitstreamSkip(bs, reverse_event->len); |
if (tab->code != ESCAPE) { |
655 |
|
if (!intra) { |
656 |
return BitstreamGetBits(bs, 1) ? -level : level; |
*run = (tab->code >> 4) & 255; |
657 |
|
level = tab->code & 15; |
658 |
|
*last = (tab->code >> 12) & 1; |
659 |
|
} else { |
660 |
|
*run = (tab->code >> 8) & 255; |
661 |
|
level = tab->code & 255; |
662 |
|
*last = (tab->code >> 16) & 1; |
663 |
|
} |
664 |
|
return BitstreamGetBit(bs) ? -level : level; |
665 |
} |
} |
|
|
|
|
BitstreamSkip(bs, 7); |
|
666 |
|
|
667 |
if (short_video_header) { |
if (short_video_header) { |
668 |
/* 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 |
669 |
*last = BitstreamGetBit(bs); |
*last = BitstreamGetBit(bs); |
670 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
671 |
level = BitstreamGetBits(bs, 8); |
level = BitstreamGetBits(bs, 8); |
672 |
|
|
673 |
if (level == 0 || level == 128) |
if (level == 0 || level == 128) |
674 |
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
DEBUG1("Illegal LEVEL for ESCAPE mode 4:", level); |
675 |
|
|
676 |
return (level << 24) >> 24; |
return (level >= 128 ? -(256 - level) : level); |
677 |
} |
} |
678 |
|
|
679 |
mode = BitstreamShowBits(bs, 2); |
mode = BitstreamShowBits(bs, 2); |
681 |
if (mode < 3) { |
if (mode < 3) { |
682 |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
683 |
|
|
684 |
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
685 |
|
if (tab->code == -1) |
|
if ((level = reverse_event->event.level) == 0) |
|
686 |
goto error; |
goto error; |
687 |
|
|
688 |
*last = reverse_event->event.last; |
BitstreamSkip(bs, tab->len); |
|
*run = reverse_event->event.run; |
|
689 |
|
|
690 |
BitstreamSkip(bs, reverse_event->len); |
if (!intra) { |
691 |
|
*run = (tab->code >> 4) & 255; |
692 |
|
level = tab->code & 15; |
693 |
|
*last = (tab->code >> 12) & 1; |
694 |
|
} else { |
695 |
|
*run = (tab->code >> 8) & 255; |
696 |
|
level = tab->code & 255; |
697 |
|
*last = (tab->code >> 16) & 1; |
698 |
|
} |
699 |
|
|
700 |
if (mode < 2) /* first escape mode, level is offset */ |
if (mode < 2) // first escape mode, level is offset |
701 |
level += max_level[intra][*last][*run]; |
level += max_level[*last + (!intra << 1)][*run]; // need to add back the max level |
702 |
else /* second escape mode, run is offset */ |
else if (mode == 2) // second escape mode, run is offset |
703 |
*run += max_run[intra][*last][level] + 1; |
*run += max_run[*last + (!intra << 1)][level] + 1; |
704 |
|
|
705 |
return BitstreamGetBits(bs, 1) ? -level : level; |
return BitstreamGetBit(bs) ? -level : level; |
706 |
} |
} |
707 |
|
// third escape mode - fixed length codes |
|
/* third escape mode - fixed length codes */ |
|
708 |
BitstreamSkip(bs, 2); |
BitstreamSkip(bs, 2); |
709 |
*last = BitstreamGetBits(bs, 1); |
*last = BitstreamGetBits(bs, 1); |
710 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
711 |
BitstreamSkip(bs, 1); /* marker */ |
BitstreamSkip(bs, 1); // marker |
712 |
level = BitstreamGetBits(bs, 12); |
level = BitstreamGetBits(bs, 12); |
713 |
BitstreamSkip(bs, 1); /* marker */ |
BitstreamSkip(bs, 1); // marker |
714 |
|
|
715 |
return (level << 20) >> 20; |
return (level & 0x800) ? (level | (-1 ^ 0xfff)) : level; |
716 |
|
|
717 |
error: |
error: |
718 |
*run = VLC_ERROR; |
*run = VLC_ERROR; |
719 |
return 0; |
return 0; |
720 |
|
|
721 |
} |
} |
722 |
|
|
723 |
|
/***************************************************************************** |
724 |
|
* MB reading functions |
725 |
|
****************************************************************************/ |
726 |
|
|
727 |
void |
void |
728 |
get_intra_block(Bitstream * bs, |
get_intra_block(Bitstream * bs, |
729 |
int16_t * block, |
int16_t * block, |
732 |
{ |
{ |
733 |
|
|
734 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[direction]; |
735 |
int level, run, last; |
int level; |
736 |
|
int run; |
737 |
|
int last; |
738 |
|
|
739 |
do { |
do { |
740 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
741 |
if (run == -1) { |
if (run == -1) { |
742 |
DPRINTF(DPRINTF_ERROR,"fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
743 |
break; |
break; |
744 |
} |
} |
745 |
coeff += run; |
coeff += run; |
748 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
749 |
//DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[coeff], level, BitstreamShowBits(bs, 32)); |
//DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[coeff], level, BitstreamShowBits(bs, 32)); |
750 |
|
|
751 |
if (level < -2047 || level > 2047) { |
if (level < -127 || level > 127) { |
752 |
DPRINTF(DPRINTF_ERROR,"warning: intra_overflow %i", level); |
DEBUG1("warning: intra_overflow", level); |
753 |
} |
} |
754 |
coeff++; |
coeff++; |
755 |
} while (!last); |
} while (!last); |
758 |
|
|
759 |
void |
void |
760 |
get_inter_block(Bitstream * bs, |
get_inter_block(Bitstream * bs, |
761 |
int16_t * block, |
int16_t * block) |
|
int direction) |
|
762 |
{ |
{ |
763 |
|
|
764 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[0]; |
765 |
int p; |
int p; |
766 |
int level; |
int level; |
767 |
int run; |
int run; |
771 |
do { |
do { |
772 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
773 |
if (run == -1) { |
if (run == -1) { |
774 |
DPRINTF(DPRINTF_ERROR,"fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
775 |
break; |
break; |
776 |
} |
} |
777 |
p += run; |
p += run; |
781 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
782 |
// DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[p], level, BitstreamShowBits(bs, 32)); |
// DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[p], level, BitstreamShowBits(bs, 32)); |
783 |
|
|
784 |
if (level < -2047 || level > 2047) { |
if (level < -127 || level > 127) { |
785 |
DPRINTF(DPRINTF_ERROR,"warning: inter overflow %i", level); |
DEBUG1("warning: inter_overflow", level); |
786 |
} |
} |
787 |
p++; |
p++; |
788 |
} while (!last); |
} while (!last); |