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 * |
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
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 * |
* XviD is free software; you can redistribute it and/or modify it |
11 |
* companies, will have no liability for use of this software or * |
* under the terms of the GNU General Public License as published by |
12 |
* modifications or derivatives thereof. * |
* the Free Software Foundation; either version 2 of the License, or |
13 |
* * |
* (at your option) any later version. |
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 * |
* This program is distributed in the hope that it will be useful, |
16 |
* the Free Software Foundation; either version 2 of the License, or * |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
17 |
* (at your option) any later version. * |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
18 |
* * |
* GNU General Public License for more details. |
19 |
* XviD is distributed in the hope that it will be useful, but * |
* |
20 |
* WITHOUT ANY WARRANTY; without even the implied warranty of * |
* You should have received a copy of the GNU General Public License |
21 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
* along with this program; if not, write to the Free Software |
22 |
* GNU General Public License for more details. * |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
23 |
* * |
* |
24 |
* You should have received a copy of the GNU General Public License * |
* Under section 8 of the GNU General Public License, the copyright |
25 |
* along with this program; if not, write to the Free Software * |
* holders of XVID explicitly forbid distribution in the following |
26 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * |
* countries: |
27 |
* * |
* |
28 |
******************************************************************************/ |
* - Japan |
29 |
|
* - United States of America |
30 |
/****************************************************************************** |
* |
31 |
* * |
* Linking XviD statically or dynamically with other modules is making a |
32 |
* mbcoding.c * |
* combined work based on XviD. Thus, the terms and conditions of the |
33 |
* * |
* GNU General Public License cover the whole combination. |
34 |
* Copyright (C) 2002 - Michael Militzer <isibaar@xvid.org> * |
* |
35 |
* * |
* As a special exception, the copyright holders of XviD give you |
36 |
* For more information visit the XviD homepage: http://www.xvid.org * |
* 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 |
* Revision history: * |
* combined work), being distributed under the terms of the GNU General |
43 |
* * |
* Public License plus this exception. An independent module is a module |
44 |
* 28.10.2002 GMC support - gruel * |
* which is not derived from or based on XviD. |
45 |
* 28.06.2002 added check_resync_marker() * |
* |
46 |
* 14.04.2002 bframe encoding * |
* Note that people who make modified versions of XviD are not obligated |
47 |
* 08.03.2002 initial version; isibaar * |
* 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$ |
54 |
|
* |
55 |
|
****************************************************************************/ |
56 |
|
|
|
|
|
|
#include <stdio.h> |
|
57 |
#include <stdlib.h> |
#include <stdlib.h> |
58 |
#include "../portab.h" |
#include "../portab.h" |
|
#include "../global.h" |
|
59 |
#include "bitstream.h" |
#include "bitstream.h" |
60 |
#include "zigzag.h" |
#include "zigzag.h" |
61 |
#include "vlc_codes.h" |
#include "vlc_codes.h" |
63 |
|
|
64 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
65 |
|
|
66 |
/* #define BIGLUT */ |
#define ABS(X) (((X)>0)?(X):-(X)) |
67 |
|
#define CLIP(X,A) (X > A) ? (A) : (X) |
68 |
|
|
69 |
#ifdef BIGLUT |
/***************************************************************************** |
70 |
#define LEVELOFFSET 2048 |
* Local data |
71 |
#else |
****************************************************************************/ |
72 |
#define LEVELOFFSET 32 |
|
73 |
#endif |
/* msvc sp5+pp gets confused if they globals are made static */ |
74 |
|
static VLC intra_table[524288]; |
75 |
static REVERSE_EVENT DCT3D[2][4096]; |
static VLC inter_table[524288]; |
76 |
|
|
77 |
#ifdef BIGLUT |
static VLC DCT3Dintra[4096]; |
78 |
static VLC coeff_VLC[2][2][4096][64]; |
static VLC DCT3Dinter[4096]; |
79 |
static VLC *intra_table, *inter_table; |
|
80 |
#else |
/***************************************************************************** |
81 |
static VLC coeff_VLC[2][2][64][64]; |
* Vector Length Coding Initialization |
82 |
#endif |
****************************************************************************/ |
83 |
|
|
84 |
/* not really MB related, but VLCs are only available here */ |
void |
85 |
void bs_put_spritetrajectory(Bitstream * bs, const int val) |
init_vlc_tables(void) |
86 |
{ |
{ |
|
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; |
|
87 |
|
|
88 |
// printf("GMC=%d Code/Len = %d / %d ",val, code,len); |
int32_t k, l, i, intra, last; |
89 |
// printf("Code2 / Len2 = %d / %d \n",code2,len2); |
VLC *vlc[2]; |
90 |
|
VLC const **coeff_ptr; |
91 |
|
VLC *vlc1, *vlc2; |
92 |
|
|
93 |
BitstreamPutBits(bs, code2, len2); |
vlc1 = DCT3Dintra; |
94 |
if (len) BitstreamPutBits(bs, code, len); |
vlc2 = DCT3Dinter; |
|
} |
|
95 |
|
|
96 |
int bs_get_spritetrajectory(Bitstream * bs) |
vlc[0] = intra_table; |
97 |
{ |
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; |
|
|
} |
|
98 |
|
|
99 |
void |
/* |
100 |
init_vlc_tables(void) |
* Generate encoding vlc lookup tables |
101 |
{ |
* the lookup table idea is taken from the excellent fame project |
102 |
ptr_t i, j, k, intra, last, run, run_esc, level, level_esc, escape, escape_len, offset; |
* by Vivien Chapellier |
103 |
int32_t l; |
*/ |
104 |
|
for (i = 0; i < 4; i++) { |
105 |
|
intra = i % 2; |
106 |
|
last = i / 2; |
107 |
|
|
108 |
#ifdef BIGLUT |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
|
intra_table = coeff_VLC[1]; |
|
|
inter_table = coeff_VLC[0]; |
|
|
#endif |
|
109 |
|
|
110 |
|
for (k = -2047; k < 2048; k++) { /* level */ |
111 |
|
int8_t const *max_level_ptr = max_level[last + 2 * intra]; |
112 |
|
int8_t const *max_run_ptr = max_run[last + 2 * intra]; |
113 |
|
|
114 |
for (intra = 0; intra < 2; intra++) |
for (l = 0; l < 64; l++) { /* run */ |
115 |
for (i = 0; i < 4096; i++) |
int32_t level = k; |
116 |
DCT3D[intra][i].event.level = 0; |
ptr_t run = l; |
117 |
|
|
118 |
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; |
|
|
} |
|
|
} |
|
119 |
|
|
120 |
for (intra = 0; intra < 2; intra++) |
vlc[intra]->code = 0; |
121 |
for (i = 0; i < 102; i++) |
vlc[intra]->len = 0; |
122 |
{ |
goto loop_end; |
123 |
#ifdef BIGLUT |
} else { |
124 |
offset = LEVELOFFSET; |
if (level > 0) /* correct level */ |
125 |
#else |
level -= max_level_ptr[run]; |
126 |
offset = !intra * LEVELOFFSET; |
else |
127 |
#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; |
|
|
} |
|
128 |
|
|
129 |
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]) && |
130 |
= coeff_tab[intra][i].vlc.code << 1; |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
131 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].len |
|
132 |
= coeff_tab[intra][i].vlc.len + 1; |
vlc[intra]->code = 0x06; |
133 |
#ifndef BIGLUT |
vlc[intra]->len = 8; |
134 |
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; |
|
|
} |
|
135 |
} |
} |
136 |
|
|
137 |
for (intra = 0; intra < 2; intra++) |
if (level > 0) /* still here? */ |
138 |
for (last = 0; last < 2; last++) |
level += max_level_ptr[run]; /* restore level */ |
139 |
for (run = 0; run < 63 + last; run++) |
else |
140 |
{ |
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; |
|
141 |
|
|
142 |
#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))*/ |
|
143 |
|
|
144 |
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc]) |
if ((abs(level) <= max_level_ptr[run]) && |
145 |
{ |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
146 |
escape = ESCAPE1; |
|
147 |
escape_len = 7 + 1; |
vlc[intra]->code = 0x0e; |
148 |
run_esc = run; |
vlc[intra]->len = 9; |
149 |
} |
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; |
|
150 |
} |
} |
151 |
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; |
|
152 |
} |
} |
153 |
|
|
154 |
|
vlc[intra]->code = |
155 |
|
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
156 |
|
((k & 0xfff) << 1) | 1; |
157 |
|
|
158 |
|
vlc[intra]->len = 30; |
159 |
|
vlc[intra]++; |
160 |
continue; |
continue; |
|
} |
|
|
} |
|
161 |
|
|
162 |
coeff_VLC[intra][last][level + offset][run].code |
loop_end: |
163 |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
if (level != 0) { |
164 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code; |
vlc[intra]->code = |
165 |
coeff_VLC[intra][last][level + offset][run].len |
(vlc[intra]-> |
166 |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
code << (coeff_ptr[run][abs(level) - 1].len + |
167 |
#ifndef BIGLUT |
1)) | (coeff_ptr[run][abs(level) - |
168 |
if (!intra) |
1].code << 1); |
169 |
#endif |
vlc[intra]->len = |
170 |
{ |
(coeff_ptr[run][abs(level) - 1].len + 1) + |
171 |
coeff_VLC[intra][last][offset - level][run].code |
vlc[intra]->len; |
172 |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
|
173 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code | 1; |
if (level < 0) |
174 |
coeff_VLC[intra][last][offset - level][run].len |
vlc[intra]->code += 1; |
175 |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
} |
176 |
|
|
177 |
|
vlc[intra]++; |
178 |
} |
} |
179 |
} |
} |
|
|
|
|
#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; |
|
180 |
} |
} |
|
#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); |
|
181 |
|
|
182 |
for (l=-(2*limit-1); l <= -limit; l++) |
for (i = 0; i < 4096; i++) { |
183 |
{ |
if (i >= 512) { |
184 |
sprite_trajectory_code[l+16384].code = (2*limit-1)+l; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
185 |
sprite_trajectory_code[l+16384].len = k+1; |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
186 |
|
} else if (i >= 128) { |
187 |
|
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
188 |
|
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
189 |
|
} else if (i >= 8) { |
190 |
|
*vlc1 = DCT3Dtab5[i - 8]; |
191 |
|
*vlc2 = DCT3Dtab2[i - 8]; |
192 |
|
} else { |
193 |
|
*vlc1 = ERRtab[i]; |
194 |
|
*vlc2 = ERRtab[i]; |
195 |
} |
} |
196 |
|
|
197 |
for (l=limit; l<= 2*limit-1; l++) |
vlc1++; |
198 |
{ |
vlc2++; |
|
sprite_trajectory_code[l+16384].code = l; |
|
|
sprite_trajectory_code[l+16384].len = k+1; |
|
|
} |
|
199 |
} |
} |
200 |
|
DCT3D[0] = DCT3Dinter; |
201 |
|
DCT3D[1] = DCT3Dintra; |
202 |
|
|
203 |
} |
} |
204 |
|
|
205 |
|
/***************************************************************************** |
206 |
|
* Local inlined functions for MB coding |
207 |
|
****************************************************************************/ |
208 |
|
|
209 |
static __inline void |
static __inline void |
210 |
CodeVector(Bitstream * bs, |
CodeVector(Bitstream * bs, |
211 |
int32_t value, |
int32_t value, |
261 |
|
|
262 |
} |
} |
263 |
|
|
|
#ifdef BIGLUT |
|
|
|
|
264 |
static __inline void |
static __inline void |
265 |
CodeCoeff(Bitstream * bs, |
CodeCoeff(Bitstream * bs, |
266 |
const int16_t qcoeff[64], |
const int16_t qcoeff[64], |
280 |
j++; |
j++; |
281 |
|
|
282 |
do { |
do { |
283 |
vlc = table + 64 * 2048 + (v << 6) + j - last; |
vlc = table + 64 * 2047 + (v << 6) + j - last; |
284 |
last = ++j; |
last = ++j; |
285 |
|
|
286 |
/* count zeroes */ |
/* count zeroes */ |
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 * 4096; |
vlc += 64 * 4095; |
295 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
296 |
break; |
break; |
297 |
} |
} |
299 |
|
|
300 |
} |
} |
301 |
|
|
302 |
#else |
/***************************************************************************** |
303 |
|
* Local functions |
304 |
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; |
|
305 |
|
|
306 |
while (!(level = qcoeff[zigzag[i++]])) |
static void |
307 |
run++; |
CodeBlockIntra(const FRAMEINFO * frame, |
|
|
|
|
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 |
|
|
|
|
|
static __inline void |
|
|
CodeBlockIntra(const FRAMEINFO * const frame, |
|
308 |
const MACROBLOCK * pMB, |
const MACROBLOCK * pMB, |
309 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
310 |
Bitstream * bs, |
Bitstream * bs, |
315 |
|
|
316 |
cbpy = pMB->cbp >> 2; |
cbpy = pMB->cbp >> 2; |
317 |
|
|
318 |
// write mcbpc |
/* write mcbpc */ |
319 |
if (frame->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, |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
326 |
mcbpc_inter_tab[mcbpc].len); |
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 (frame->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 |
/* code block coeffs */ |
347 |
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 * 64 + 0] + 255].code, |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
353 |
dcc_tab[qcoeff[i * 64 + 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))) { |
|
const uint16_t *scan_table = |
|
|
frame->global_flags & XVID_ALTERNATESCAN ? |
|
|
scan_tables[2] : scan_tables[pMB->acpred_directions[i]]; |
|
|
|
|
356 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
357 |
|
|
358 |
#ifdef BIGLUT |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
359 |
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 |
|
360 |
|
|
361 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
362 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
367 |
|
|
368 |
|
|
369 |
static void |
static void |
370 |
CodeBlockInter(const FRAMEINFO * const frame, |
CodeBlockInter(const FRAMEINFO * frame, |
371 |
const MACROBLOCK * pMB, |
const MACROBLOCK * pMB, |
372 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
373 |
Bitstream * bs, |
Bitstream * bs, |
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, |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
385 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
386 |
|
|
387 |
if ( (frame->coding_type == S_VOP) && (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) ) |
/* write cbpy */ |
|
BitstreamPutBit(bs, pMB->mcsel); // mcsel: '0'=local motion, '1'=GMC |
|
|
|
|
|
// 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 (frame->global_flags & XVID_INTERLACING) { |
if (frame->global_flags & XVID_INTERLACING) { |
396 |
if (pMB->cbp) { |
if (pMB->cbp) { |
397 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
398 |
DPRINTF(DPRINTF_MB,"codep: field_dct: %i", 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 |
DPRINTF(DPRINTF_MB,"codep: field_pred: %i", 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) if motion is local |
/* code motion vector(s) */ |
|
if (!pMB->mcsel) |
|
414 |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
415 |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
416 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
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 * 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 |
|
|
} |
|
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 |
void |
436 |
MBCoding(const FRAMEINFO * const frame, |
MBCoding(const FRAMEINFO * frame, |
437 |
MACROBLOCK * pMB, |
MACROBLOCK * pMB, |
438 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
439 |
Bitstream * bs, |
Bitstream * bs, |
440 |
Statistics * pStat) |
Statistics * pStat) |
441 |
{ |
{ |
442 |
if (frame->coding_type != I_VOP) |
|
443 |
BitstreamPutBit(bs, 0); // not_coded |
if (frame->coding_type == P_VOP) { |
444 |
|
BitstreamPutBit(bs, 0); /* coded */ |
445 |
|
} |
446 |
|
|
447 |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
448 |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
451 |
|
|
452 |
} |
} |
453 |
|
|
454 |
/* |
|
|
// moved to mbcoding.h so that in can be 'static __inline' |
|
455 |
void |
void |
456 |
MBSkip(Bitstream * bs) |
MBSkip(Bitstream * bs) |
457 |
{ |
{ |
458 |
BitstreamPutBit(bs, 1); // not coded |
BitstreamPutBit(bs, 1); /* not coded */ |
459 |
|
return; |
460 |
} |
} |
|
*/ |
|
|
|
|
|
/*************************************************************** |
|
|
* 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 |
|
|
*/ |
|
461 |
|
|
462 |
static __inline void |
/***************************************************************************** |
463 |
put_bvop_mbtype(Bitstream * bs, |
* decoding stuff starts here |
464 |
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; |
|
|
} |
|
|
} |
|
465 |
|
|
466 |
/* |
/* |
467 |
dbquant |
* For IVOP addbits == 0 |
468 |
-2 10b |
* For PVOP addbits == fcode - 1 |
469 |
0 0b |
* For BVOP addbits == max(fcode,bcode) - 1 |
470 |
+2 11b |
* returns true or false |
471 |
*/ |
*/ |
472 |
|
|
|
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 |
|
473 |
int |
int |
474 |
check_resync_marker(Bitstream * bs, int addbits) |
check_resync_marker(Bitstream * bs, int addbits) |
475 |
{ |
{ |
511 |
|
|
512 |
uint32_t index; |
uint32_t index; |
513 |
|
|
514 |
index = MIN(BitstreamShowBits(bs, 9), 256); |
index = CLIP(BitstreamShowBits(bs, 9), 256); |
515 |
|
|
516 |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
517 |
|
|
537 |
|
|
538 |
} |
} |
539 |
|
|
540 |
static __inline int |
int |
541 |
get_mv_data(Bitstream * bs) |
get_mv_data(Bitstream * bs) |
542 |
{ |
{ |
543 |
|
|
646 |
|
|
647 |
} |
} |
648 |
|
|
649 |
|
/***************************************************************************** |
650 |
|
* Local inlined function to "decode" written vlc codes |
651 |
|
****************************************************************************/ |
652 |
|
|
653 |
static __inline int |
static __inline int |
654 |
get_coeff(Bitstream * bs, |
get_coeff(Bitstream * bs, |
655 |
int *run, |
int *run, |
659 |
{ |
{ |
660 |
|
|
661 |
uint32_t mode; |
uint32_t mode; |
662 |
|
const VLC *tab; |
663 |
int32_t level; |
int32_t level; |
|
REVERSE_EVENT *reverse_event; |
|
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 |
if (BitstreamShowBits(bs, 7) != ESCAPE) { |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
669 |
|
|
670 |
if ((level = reverse_event->event.level) == 0) |
if (tab->code == -1) |
671 |
goto error; |
goto error; |
672 |
|
|
673 |
*last = reverse_event->event.last; |
BitstreamSkip(bs, tab->len); |
|
*run = reverse_event->event.run; |
|
|
|
|
|
BitstreamSkip(bs, reverse_event->len); |
|
674 |
|
|
675 |
return BitstreamGetBits(bs, 1) ? -level : level; |
if (tab->code != ESCAPE) { |
676 |
|
if (!intra) { |
677 |
|
*run = (tab->code >> 4) & 255; |
678 |
|
level = tab->code & 15; |
679 |
|
*last = (tab->code >> 12) & 1; |
680 |
|
} else { |
681 |
|
*run = (tab->code >> 8) & 255; |
682 |
|
level = tab->code & 255; |
683 |
|
*last = (tab->code >> 16) & 1; |
684 |
|
} |
685 |
|
return BitstreamGetBit(bs) ? -level : level; |
686 |
} |
} |
|
|
|
|
BitstreamSkip(bs, 7); |
|
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 */ |
694 |
if (level == 0 || level == 128) |
if (level == 0 || level == 128) |
695 |
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
696 |
|
|
697 |
return (level << 24) >> 24; |
return (level >= 128 ? -(256 - level) : level); |
698 |
} |
} |
699 |
|
|
700 |
mode = BitstreamShowBits(bs, 2); |
mode = BitstreamShowBits(bs, 2); |
702 |
if (mode < 3) { |
if (mode < 3) { |
703 |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
704 |
|
|
705 |
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
706 |
|
if (tab->code == -1) |
|
if ((level = reverse_event->event.level) == 0) |
|
707 |
goto error; |
goto error; |
708 |
|
|
709 |
*last = reverse_event->event.last; |
BitstreamSkip(bs, tab->len); |
|
*run = reverse_event->event.run; |
|
710 |
|
|
711 |
BitstreamSkip(bs, reverse_event->len); |
if (!intra) { |
712 |
|
*run = (tab->code >> 4) & 255; |
713 |
|
level = tab->code & 15; |
714 |
|
*last = (tab->code >> 12) & 1; |
715 |
|
} else { |
716 |
|
*run = (tab->code >> 8) & 255; |
717 |
|
level = tab->code & 255; |
718 |
|
*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[intra][*last][*run]; |
level += max_level[*last + (!intra << 1)][*run]; /* need to add back the max level */ |
723 |
else /* second escape mode, run is offset */ |
else if (mode == 2) /* second escape mode, run is offset */ |
724 |
*run += max_run[intra][*last][level] + 1; |
*run += max_run[*last + (!intra << 1)][level] + 1; |
725 |
|
|
726 |
return BitstreamGetBits(bs, 1) ? -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); |
733 |
level = BitstreamGetBits(bs, 12); |
level = BitstreamGetBits(bs, 12); |
734 |
BitstreamSkip(bs, 1); /* marker */ |
BitstreamSkip(bs, 1); /* marker */ |
735 |
|
|
736 |
return (level << 20) >> 20; |
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 |
|
/***************************************************************************** |
745 |
|
* MB reading functions |
746 |
|
****************************************************************************/ |
747 |
|
|
748 |
void |
void |
749 |
get_intra_block(Bitstream * bs, |
get_intra_block(Bitstream * bs, |
750 |
int16_t * block, |
int16_t * block, |
753 |
{ |
{ |
754 |
|
|
755 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[direction]; |
756 |
int level, run, last; |
int level; |
757 |
|
int run; |
758 |
|
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_ERROR,"fatal: invalid run"); |
DPRINTF(DPRINTF_DEBUG, "fatal: invalid run"); |
764 |
break; |
break; |
765 |
} |
} |
766 |
coeff += run; |
coeff += run; |
767 |
block[scan[coeff]] = level; |
block[scan[coeff]] = level; |
768 |
|
|
769 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
770 |
//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)); */ |
771 |
|
|
772 |
if (level < -2047 || level > 2047) { |
if (level < -2047 || level > 2047) { |
773 |
DPRINTF(DPRINTF_ERROR,"warning: intra_overflow %i", level); |
DPRINTF(DPRINTF_DEBUG, "warning: intra_overflow: %d", level); |
774 |
} |
} |
775 |
coeff++; |
coeff++; |
776 |
} while (!last); |
} while (!last); |
779 |
|
|
780 |
void |
void |
781 |
get_inter_block(Bitstream * bs, |
get_inter_block(Bitstream * bs, |
782 |
int16_t * block, |
int16_t * block) |
|
int direction) |
|
783 |
{ |
{ |
784 |
|
|
785 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[0]; |
786 |
int p; |
int p; |
787 |
int level; |
int level; |
788 |
int run; |
int run; |
800 |
block[scan[p]] = level; |
block[scan[p]] = level; |
801 |
|
|
802 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
|
// DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[p], level, BitstreamShowBits(bs, 32)); |
|
803 |
|
|
804 |
if (level < -2047 || level > 2047) { |
if (level < -2047 || level > 2047) { |
805 |
DPRINTF(DPRINTF_ERROR,"warning: inter overflow %i", level); |
DPRINTF(DPRINTF_DEBUG, "warning: inter_overflow: %d", level); |
806 |
} |
} |
807 |
p++; |
p++; |
808 |
} while (!last); |
} while (!last); |