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.06.2002 added check_resync_marker() * |
* which is not derived from or based on XviD. |
45 |
* 14.04.2002 bframe encoding * |
* |
46 |
* 08.03.2002 initial version; isibaar * |
* Note that people who make modified versions of XviD are not obligated |
47 |
* * |
* to grant this special exception for their modified versions; it is |
48 |
******************************************************************************/ |
* their choice whether to do so. The GNU General Public License gives |
49 |
|
* permission to release a modified version without this exception; this |
50 |
|
* exception also makes it possible to release a modified version which |
51 |
|
* carries forward this exception. |
52 |
|
* |
53 |
|
* $Id: mbcoding.c,v 1.40 2003-02-06 00:48:08 edgomez Exp $ |
54 |
|
* |
55 |
|
****************************************************************************/ |
56 |
|
|
57 |
#include <stdlib.h> |
#include <stdlib.h> |
58 |
#include "../portab.h" |
#include "../portab.h" |
66 |
#define ABS(X) (((X)>0)?(X):-(X)) |
#define ABS(X) (((X)>0)?(X):-(X)) |
67 |
#define CLIP(X,A) (X > A) ? (A) : (X) |
#define CLIP(X,A) (X > A) ? (A) : (X) |
68 |
|
|
69 |
VLC intra_table[524032]; |
/* #define BIGLUT */ |
|
VLC inter_table[524032]; |
|
70 |
|
|
71 |
VLC DCT3Dintra[4096]; |
#ifdef BIGLUT |
72 |
VLC DCT3Dinter[4096]; |
#define LEVELOFFSET 2048 |
73 |
|
#else |
74 |
|
#define LEVELOFFSET 32 |
75 |
|
#endif |
76 |
|
|
77 |
|
/***************************************************************************** |
78 |
|
* Local data |
79 |
|
****************************************************************************/ |
80 |
|
|
81 |
|
static REVERSE_EVENT DCT3D[2][4096]; |
82 |
|
|
83 |
|
#ifdef BIGLUT |
84 |
|
static VLC coeff_VLC[2][2][4096][64]; |
85 |
|
static VLC *intra_table, *inter_table; |
86 |
|
#else |
87 |
|
static VLC coeff_VLC[2][2][64][64]; |
88 |
|
#endif |
89 |
|
|
90 |
|
/***************************************************************************** |
91 |
|
* Vector Length Coding Initialization |
92 |
|
****************************************************************************/ |
93 |
|
|
94 |
void |
void |
95 |
init_vlc_tables(void) |
init_vlc_tables(void) |
96 |
{ |
{ |
97 |
|
uint32_t i, j, intra, last, run, run_esc, level, level_esc, escape, escape_len, offset; |
98 |
|
|
99 |
int32_t k, l, i, intra, last; |
#ifdef BIGLUT |
100 |
VLC *vlc[2]; |
intra_table = (VLC*)coeff_VLC[1]; |
101 |
VLC **coeff_ptr; |
inter_table = (VLC*)coeff_VLC[0]; |
102 |
VLC *vlc1, *vlc2; |
#endif |
|
|
|
|
vlc1 = DCT3Dintra; |
|
|
vlc2 = DCT3Dinter; |
|
|
|
|
|
vlc[0] = intra_table; |
|
|
vlc[1] = inter_table; |
|
|
|
|
|
// generate encoding vlc lookup tables |
|
|
// the lookup table idea is taken from the excellent fame project by Vivien Chapellier |
|
|
for (i = 0; i < 4; i++) { |
|
|
intra = i % 2; |
|
|
last = i / 2; |
|
|
|
|
|
coeff_ptr = coeff_vlc[last + 2 * intra]; |
|
|
|
|
|
for (k = -2047; k < 2048; k++) { // level |
|
|
int8_t *max_level_ptr = max_level[last + 2 * intra]; |
|
|
int8_t *max_run_ptr = max_run[last + 2 * intra]; |
|
|
|
|
|
for (l = 0; l < 64; l++) { // run |
|
|
int32_t level = k; |
|
|
ptr_t run = l; |
|
|
|
|
|
if ((abs(level) <= max_level_ptr[run]) && (run <= (uint32_t) max_run_ptr[abs(level)])) { // level < max_level and run < max_run |
|
|
|
|
|
vlc[intra]->code = 0; |
|
|
vlc[intra]->len = 0; |
|
|
goto loop_end; |
|
|
} else { |
|
|
if (level > 0) // correct level |
|
|
level -= max_level_ptr[run]; |
|
|
else |
|
|
level += max_level_ptr[run]; |
|
103 |
|
|
|
if ((abs(level) <= max_level_ptr[run]) && |
|
|
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
|
104 |
|
|
105 |
vlc[intra]->code = 0x06; |
for (intra = 0; intra < 2; intra++) |
106 |
vlc[intra]->len = 8; |
for (i = 0; i < 4096; i++) |
107 |
goto loop_end; |
DCT3D[intra][i].event.level = 0; |
|
} |
|
|
|
|
|
if (level > 0) // still here? |
|
|
level += max_level_ptr[run]; // restore level |
|
|
else |
|
|
level -= max_level_ptr[run]; |
|
108 |
|
|
109 |
run -= max_run_ptr[abs(level)] + 1; // and change run |
for (intra = 0; intra < 2; intra++) |
110 |
|
for (last = 0; last < 2; last++) |
111 |
|
{ |
112 |
|
for (run = 0; run < 63 + last; run++) |
113 |
|
for (level = 0; level < 32 << intra; level++) |
114 |
|
{ |
115 |
|
#ifdef BIGLUT |
116 |
|
offset = LEVELOFFSET; |
117 |
|
#else |
118 |
|
offset = !intra * LEVELOFFSET; |
119 |
|
#endif |
120 |
|
coeff_VLC[intra][last][level + offset][run].len = 128; |
121 |
|
} |
122 |
|
} |
123 |
|
|
124 |
if ((abs(level) <= max_level_ptr[run]) && |
for (intra = 0; intra < 2; intra++) |
125 |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
for (i = 0; i < 102; i++) |
126 |
|
{ |
127 |
|
#ifdef BIGLUT |
128 |
|
offset = LEVELOFFSET; |
129 |
|
#else |
130 |
|
offset = !intra * LEVELOFFSET; |
131 |
|
#endif |
132 |
|
for (j = 0; j < (uint32_t)(1 << (12 - coeff_tab[intra][i].vlc.len)); j++) |
133 |
|
{ |
134 |
|
DCT3D[intra][(coeff_tab[intra][i].vlc.code << (12 - coeff_tab[intra][i].vlc.len)) | j].len = coeff_tab[intra][i].vlc.len; |
135 |
|
DCT3D[intra][(coeff_tab[intra][i].vlc.code << (12 - coeff_tab[intra][i].vlc.len)) | j].event = coeff_tab[intra][i].event; |
136 |
|
} |
137 |
|
|
138 |
vlc[intra]->code = 0x0e; |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].code |
139 |
vlc[intra]->len = 9; |
= coeff_tab[intra][i].vlc.code << 1; |
140 |
goto loop_end; |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].len |
141 |
|
= coeff_tab[intra][i].vlc.len + 1; |
142 |
|
#ifndef BIGLUT |
143 |
|
if (!intra) |
144 |
|
#endif |
145 |
|
{ |
146 |
|
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].code |
147 |
|
= (coeff_tab[intra][i].vlc.code << 1) | 1; |
148 |
|
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].len |
149 |
|
= coeff_tab[intra][i].vlc.len + 1; |
150 |
} |
} |
|
run += max_run_ptr[abs(level)] + 1; |
|
151 |
} |
} |
152 |
|
|
153 |
vlc[intra]->code = |
for (intra = 0; intra < 2; intra++) |
154 |
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
for (last = 0; last < 2; last++) |
155 |
((k & 0xfff) << 1) | 1; |
for (run = 0; run < 63 + last; run++) |
156 |
|
{ |
157 |
vlc[intra]->len = 30; |
for (level = 1; level < (uint32_t)(32 << intra); level++) |
158 |
vlc[intra]++; |
{ |
159 |
|
if (level <= max_level[intra][last][run] && run <= max_run[intra][last][level]) |
160 |
continue; |
continue; |
161 |
|
|
162 |
loop_end: |
#ifdef BIGLUT |
163 |
if (level != 0) { |
offset = LEVELOFFSET; |
164 |
vlc[intra]->code = |
#else |
165 |
(vlc[intra]-> |
offset = !intra * LEVELOFFSET; |
166 |
code << (coeff_ptr[run][abs(level) - 1].len + |
#endif |
167 |
1)) | (coeff_ptr[run][abs(level) - |
level_esc = level - max_level[intra][last][run]; |
168 |
1].code << 1); |
run_esc = run - 1 - max_run[intra][last][level]; |
169 |
vlc[intra]->len = |
|
170 |
(coeff_ptr[run][abs(level) - 1].len + 1) + |
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc]) |
171 |
vlc[intra]->len; |
{ |
172 |
|
escape = ESCAPE1; |
173 |
if (level < 0) |
escape_len = 7 + 1; |
174 |
vlc[intra]->code += 1; |
run_esc = run; |
|
} |
|
|
|
|
|
vlc[intra]++; |
|
175 |
} |
} |
176 |
|
else |
177 |
|
{ |
178 |
|
if (run_esc <= max_run[intra][last][level] && level <= max_level[intra][last][run_esc]) |
179 |
|
{ |
180 |
|
escape = ESCAPE2; |
181 |
|
escape_len = 7 + 2; |
182 |
|
level_esc = level; |
183 |
} |
} |
184 |
|
else |
185 |
|
{ |
186 |
|
#ifndef BIGLUT |
187 |
|
if (!intra) |
188 |
|
#endif |
189 |
|
{ |
190 |
|
coeff_VLC[intra][last][level + offset][run].code |
191 |
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
192 |
|
coeff_VLC[intra][last][level + offset][run].len = 30; |
193 |
|
coeff_VLC[intra][last][offset - level][run].code |
194 |
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-level & 0xfff) << 1) | 1; |
195 |
|
coeff_VLC[intra][last][offset - level][run].len = 30; |
196 |
|
} |
197 |
|
continue; |
198 |
} |
} |
|
|
|
|
for (i = 0; i < 4096; i++) { |
|
|
if (i >= 512) { |
|
|
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
|
|
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
|
|
} else if (i >= 128) { |
|
|
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
|
|
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
|
|
} else if (i >= 8) { |
|
|
*vlc1 = DCT3Dtab5[i - 8]; |
|
|
*vlc2 = DCT3Dtab2[i - 8]; |
|
|
} else { |
|
|
*vlc1 = ERRtab[i]; |
|
|
*vlc2 = ERRtab[i]; |
|
199 |
} |
} |
200 |
|
|
201 |
vlc1++; |
coeff_VLC[intra][last][level + offset][run].code |
202 |
vlc2++; |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
203 |
|
| coeff_VLC[intra][last][level_esc + offset][run_esc].code; |
204 |
|
coeff_VLC[intra][last][level + offset][run].len |
205 |
|
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
206 |
|
#ifndef BIGLUT |
207 |
|
if (!intra) |
208 |
|
#endif |
209 |
|
{ |
210 |
|
coeff_VLC[intra][last][offset - level][run].code |
211 |
|
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
212 |
|
| coeff_VLC[intra][last][level_esc + offset][run_esc].code | 1; |
213 |
|
coeff_VLC[intra][last][offset - level][run].len |
214 |
|
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
215 |
|
} |
216 |
} |
} |
|
DCT3D[0] = DCT3Dinter; |
|
|
DCT3D[1] = DCT3Dintra; |
|
217 |
|
|
218 |
|
#ifdef BIGLUT |
219 |
|
for (level = (uint32_t)(32 << intra); level < 2048; level++) |
220 |
|
{ |
221 |
|
coeff_VLC[intra][last][level + offset][run].code |
222 |
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
223 |
|
coeff_VLC[intra][last][level + offset][run].len = 30; |
224 |
|
|
225 |
|
coeff_VLC[intra][last][offset - level][run].code |
226 |
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-level & 0xfff) << 1) | 1; |
227 |
|
coeff_VLC[intra][last][offset - level][run].len = 30; |
228 |
|
} |
229 |
|
#else |
230 |
|
if (!intra) |
231 |
|
{ |
232 |
|
coeff_VLC[intra][last][0][run].code |
233 |
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-32 & 0xfff) << 1) | 1; |
234 |
|
coeff_VLC[intra][last][0][run].len = 30; |
235 |
|
} |
236 |
|
#endif |
237 |
|
} |
238 |
} |
} |
239 |
|
|
240 |
|
/***************************************************************************** |
241 |
|
* Local inlined functions for MB coding |
242 |
|
****************************************************************************/ |
243 |
|
|
244 |
static __inline void |
static __inline void |
245 |
CodeVector(Bitstream * bs, |
CodeVector(Bitstream * bs, |
246 |
int32_t value, |
int32_t value, |
296 |
|
|
297 |
} |
} |
298 |
|
|
299 |
|
#ifdef BIGLUT |
300 |
|
|
301 |
static __inline void |
static __inline void |
302 |
CodeCoeff(Bitstream * bs, |
CodeCoeff(Bitstream * bs, |
317 |
j++; |
j++; |
318 |
|
|
319 |
do { |
do { |
320 |
vlc = table + 64 * 2047 + (v << 6) + j - last; |
vlc = table + 64 * 2048 + (v << 6) + j - last; |
321 |
last = ++j; |
last = ++j; |
322 |
|
|
323 |
// count zeroes |
/* count zeroes */ |
324 |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
325 |
j++; |
j++; |
326 |
|
|
327 |
// write code |
/* write code */ |
328 |
if (j != 64) { |
if (j != 64) { |
329 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
330 |
} else { |
} else { |
331 |
vlc += 64 * 4095; |
vlc += 64 * 4096; |
332 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
333 |
break; |
break; |
334 |
} |
} |
336 |
|
|
337 |
} |
} |
338 |
|
|
339 |
|
#else |
340 |
|
|
341 |
|
static __inline void |
342 |
|
CodeCoeffInter(Bitstream * bs, |
343 |
|
const int16_t qcoeff[64], |
344 |
|
const uint16_t * zigzag) |
345 |
|
{ |
346 |
|
uint32_t i, run, prev_run, code, len; |
347 |
|
int32_t level, prev_level, level_shifted; |
348 |
|
|
349 |
|
i = 0; |
350 |
|
run = 0; |
351 |
|
|
352 |
|
while (!(level = qcoeff[zigzag[i++]])) |
353 |
|
run++; |
354 |
|
|
355 |
|
prev_level = level; |
356 |
|
prev_run = run; |
357 |
|
run = 0; |
358 |
|
|
359 |
|
while (i < 64) |
360 |
|
{ |
361 |
|
if ((level = qcoeff[zigzag[i++]]) != 0) |
362 |
|
{ |
363 |
|
level_shifted = prev_level + 32; |
364 |
|
if (!(level_shifted & -64)) |
365 |
|
{ |
366 |
|
code = coeff_VLC[0][0][level_shifted][prev_run].code; |
367 |
|
len = coeff_VLC[0][0][level_shifted][prev_run].len; |
368 |
|
} |
369 |
|
else |
370 |
|
{ |
371 |
|
code = (ESCAPE3 << 21) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
372 |
|
len = 30; |
373 |
|
} |
374 |
|
BitstreamPutBits(bs, code, len); |
375 |
|
prev_level = level; |
376 |
|
prev_run = run; |
377 |
|
run = 0; |
378 |
|
} |
379 |
|
else |
380 |
|
run++; |
381 |
|
} |
382 |
|
|
383 |
|
level_shifted = prev_level + 32; |
384 |
|
if (!(level_shifted & -64)) |
385 |
|
{ |
386 |
|
code = coeff_VLC[0][1][level_shifted][prev_run].code; |
387 |
|
len = coeff_VLC[0][1][level_shifted][prev_run].len; |
388 |
|
} |
389 |
|
else |
390 |
|
{ |
391 |
|
code = (ESCAPE3 << 21) | (1 << 20) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
392 |
|
len = 30; |
393 |
|
} |
394 |
|
BitstreamPutBits(bs, code, len); |
395 |
|
} |
396 |
|
|
397 |
|
static __inline void |
398 |
|
CodeCoeffIntra(Bitstream * bs, |
399 |
|
const int16_t qcoeff[64], |
400 |
|
const uint16_t * zigzag) |
401 |
|
{ |
402 |
|
uint32_t i, abs_level, run, prev_run, code, len; |
403 |
|
int32_t level, prev_level; |
404 |
|
|
405 |
|
i = 1; |
406 |
|
run = 0; |
407 |
|
|
408 |
|
while (!(level = qcoeff[zigzag[i++]])) |
409 |
|
run++; |
410 |
|
|
411 |
|
prev_level = level; |
412 |
|
prev_run = run; |
413 |
|
run = 0; |
414 |
|
|
415 |
|
while (i < 64) |
416 |
|
{ |
417 |
|
if ((level = qcoeff[zigzag[i++]]) != 0) |
418 |
|
{ |
419 |
|
abs_level = ABS(prev_level); |
420 |
|
abs_level = abs_level < 64 ? abs_level : 0; |
421 |
|
code = coeff_VLC[1][0][abs_level][prev_run].code; |
422 |
|
len = coeff_VLC[1][0][abs_level][prev_run].len; |
423 |
|
if (len != 128) |
424 |
|
code |= (prev_level < 0); |
425 |
|
else |
426 |
|
{ |
427 |
|
code = (ESCAPE3 << 21) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
428 |
|
len = 30; |
429 |
|
} |
430 |
|
BitstreamPutBits(bs, code, len); |
431 |
|
prev_level = level; |
432 |
|
prev_run = run; |
433 |
|
run = 0; |
434 |
|
} |
435 |
|
else |
436 |
|
run++; |
437 |
|
} |
438 |
|
|
439 |
|
abs_level = ABS(prev_level); |
440 |
|
abs_level = abs_level < 64 ? abs_level : 0; |
441 |
|
code = coeff_VLC[1][1][abs_level][prev_run].code; |
442 |
|
len = coeff_VLC[1][1][abs_level][prev_run].len; |
443 |
|
if (len != 128) |
444 |
|
code |= (prev_level < 0); |
445 |
|
else |
446 |
|
{ |
447 |
|
code = (ESCAPE3 << 21) | (1 << 20) | (prev_run << 14) | (1 << 13) | ((prev_level & 0xfff) << 1) | 1; |
448 |
|
len = 30; |
449 |
|
} |
450 |
|
BitstreamPutBits(bs, code, len); |
451 |
|
} |
452 |
|
|
453 |
|
#endif |
454 |
|
|
455 |
|
/***************************************************************************** |
456 |
|
* Local functions |
457 |
|
****************************************************************************/ |
458 |
|
|
459 |
static void |
static void |
460 |
CodeBlockIntra(const FRAMEINFO * frame, |
CodeBlockIntra(const FRAMEINFO * frame, |
468 |
|
|
469 |
cbpy = pMB->cbp >> 2; |
cbpy = pMB->cbp >> 2; |
470 |
|
|
471 |
// write mcbpc |
/* write mcbpc */ |
472 |
if (frame->coding_type == I_VOP) { |
if (frame->coding_type == I_VOP) { |
473 |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
474 |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
479 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
480 |
} |
} |
481 |
|
|
482 |
// ac prediction flag |
/* ac prediction flag */ |
483 |
if (pMB->acpred_directions[0]) |
if (pMB->acpred_directions[0]) |
484 |
BitstreamPutBits(bs, 1, 1); |
BitstreamPutBits(bs, 1, 1); |
485 |
else |
else |
486 |
BitstreamPutBits(bs, 0, 1); |
BitstreamPutBits(bs, 0, 1); |
487 |
|
|
488 |
// write cbpy |
/* write cbpy */ |
489 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
490 |
|
|
491 |
// write dquant |
/* write dquant */ |
492 |
if (pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA_Q) |
493 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
494 |
|
|
495 |
// write interlacing |
/* write interlacing */ |
496 |
if (frame->global_flags & XVID_INTERLACING) { |
if (frame->global_flags & XVID_INTERLACING) { |
497 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
498 |
} |
} |
499 |
// code block coeffs |
/* code block coeffs */ |
500 |
for (i = 0; i < 6; i++) { |
for (i = 0; i < 6; i++) { |
501 |
if (i < 4) |
if (i < 4) |
502 |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
508 |
if (pMB->cbp & (1 << (5 - i))) { |
if (pMB->cbp & (1 << (5 - i))) { |
509 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
510 |
|
|
511 |
|
#ifdef BIGLUT |
512 |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
513 |
scan_tables[pMB->acpred_directions[i]], 1); |
scan_tables[pMB->acpred_directions[i]], 1); |
514 |
|
#else |
515 |
|
CodeCoeffIntra(bs, &qcoeff[i * 64], scan_tables[pMB->acpred_directions[i]]); |
516 |
|
#endif |
517 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
518 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
519 |
} |
} |
536 |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
537 |
cbpy = 15 - (pMB->cbp >> 2); |
cbpy = 15 - (pMB->cbp >> 2); |
538 |
|
|
539 |
// write mcbpc |
/* write mcbpc */ |
540 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
541 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
542 |
|
|
543 |
// write cbpy |
/* write cbpy */ |
544 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
545 |
|
|
546 |
// write dquant |
/* write dquant */ |
547 |
if (pMB->mode == MODE_INTER_Q) |
if (pMB->mode == MODE_INTER_Q) |
548 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
549 |
|
|
550 |
// interlacing |
/* interlacing */ |
551 |
if (frame->global_flags & XVID_INTERLACING) { |
if (frame->global_flags & XVID_INTERLACING) { |
552 |
|
if (pMB->cbp) { |
553 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
554 |
DEBUG1("codep: field_dct: ", pMB->field_dct); |
DPRINTF(DPRINTF_DEBUG, "codep: field_dct: %d", pMB->field_dct); |
555 |
|
} |
556 |
|
|
557 |
// if inter block, write field ME flag |
/* if inter block, write field ME flag */ |
558 |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
559 |
BitstreamPutBit(bs, pMB->field_pred); |
BitstreamPutBit(bs, pMB->field_pred); |
560 |
DEBUG1("codep: field_pred: ", pMB->field_pred); |
DPRINTF(DPRINTF_DEBUG, "codep: field_pred: %d", pMB->field_pred); |
561 |
|
|
562 |
// write field prediction references |
/* write field prediction references */ |
563 |
if (pMB->field_pred) { |
if (pMB->field_pred) { |
564 |
BitstreamPutBit(bs, pMB->field_for_top); |
BitstreamPutBit(bs, pMB->field_for_top); |
565 |
BitstreamPutBit(bs, pMB->field_for_bot); |
BitstreamPutBit(bs, pMB->field_for_bot); |
566 |
} |
} |
567 |
} |
} |
568 |
} |
} |
569 |
// code motion vector(s) |
/* code motion vector(s) */ |
570 |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
571 |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
572 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
574 |
|
|
575 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
576 |
|
|
577 |
// code block coeffs |
/* code block coeffs */ |
578 |
for (i = 0; i < 6; i++) |
for (i = 0; i < 6; i++) |
579 |
if (pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) |
580 |
|
#ifdef BIGLUT |
581 |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
582 |
|
#else |
583 |
|
CodeCoeffInter(bs, &qcoeff[i * 64], scan_tables[0]); |
584 |
|
#endif |
585 |
|
|
586 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
587 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
588 |
|
|
589 |
} |
} |
590 |
|
|
591 |
|
/***************************************************************************** |
592 |
|
* Macro Block bitstream encoding functions |
593 |
|
****************************************************************************/ |
594 |
|
|
595 |
void |
void |
596 |
MBCoding(const FRAMEINFO * frame, |
MBCoding(const FRAMEINFO * frame, |
600 |
Statistics * pStat) |
Statistics * pStat) |
601 |
{ |
{ |
602 |
|
|
|
int intra = (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q); |
|
|
|
|
603 |
if (frame->coding_type == P_VOP) { |
if (frame->coding_type == P_VOP) { |
604 |
if (pMB->cbp == 0 && pMB->mode == MODE_INTER && pMB->mvs[0].x == 0 && |
BitstreamPutBit(bs, 0); /* coded */ |
|
pMB->mvs[0].y == 0) { |
|
|
BitstreamPutBit(bs, 1); // not_coded |
|
|
return; |
|
|
} else |
|
|
BitstreamPutBit(bs, 0); // coded |
|
605 |
} |
} |
606 |
|
|
607 |
if (intra) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
608 |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
609 |
else |
else |
610 |
CodeBlockInter(frame, pMB, qcoeff, bs, pStat); |
CodeBlockInter(frame, pMB, qcoeff, bs, pStat); |
611 |
|
|
612 |
} |
} |
613 |
|
|
|
/*************************************************************** |
|
|
* 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 |
|
|
*/ |
|
614 |
|
|
615 |
void |
void |
616 |
put_bvop_mbtype(Bitstream * bs, |
MBSkip(Bitstream * bs) |
|
int value) |
|
617 |
{ |
{ |
618 |
switch (value) { |
BitstreamPutBit(bs, 1); /* not coded */ |
|
case 0: |
|
|
BitstreamPutBit(bs, 1); |
|
619 |
return; |
return; |
|
|
|
|
case 1: |
|
|
BitstreamPutBit(bs, 0); |
|
|
BitstreamPutBit(bs, 1); |
|
|
return; |
|
|
|
|
|
case 2: |
|
|
BitstreamPutBit(bs, 0); |
|
|
BitstreamPutBit(bs, 0); |
|
|
BitstreamPutBit(bs, 1); |
|
|
return; |
|
|
|
|
|
case 3: |
|
|
BitstreamPutBit(bs, 0); |
|
|
BitstreamPutBit(bs, 0); |
|
|
BitstreamPutBit(bs, 0); |
|
|
BitstreamPutBit(bs, 1); |
|
|
return; |
|
|
|
|
|
default:; // invalid! |
|
|
|
|
620 |
} |
} |
621 |
|
|
622 |
} |
/***************************************************************************** |
623 |
|
* decoding stuff starts here |
624 |
|
****************************************************************************/ |
625 |
|
|
626 |
/* |
/* |
627 |
dbquant |
* For IVOP addbits == 0 |
628 |
-2 10b |
* For PVOP addbits == fcode - 1 |
629 |
0 0b |
* For BVOP addbits == max(fcode,bcode) - 1 |
630 |
+2 11b |
* returns true or false |
631 |
*/ |
*/ |
632 |
|
|
|
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 i; |
|
|
|
|
|
/* ------------------------------------------------------------------ |
|
|
when a block is skipped it is decoded DIRECT(0,) |
|
|
hence are interpolated from forward & backward frames |
|
|
------------------------------------------------------------------ */ |
|
|
|
|
|
if (mb->mode == 5) { |
|
|
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 |
|
|
} |
|
|
|
|
|
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_FORWARD) { |
|
|
CodeVector(bs, mb->pmvs[0].x, fcode, pStat); |
|
|
CodeVector(bs, mb->pmvs[0].y, fcode, pStat); |
|
|
} |
|
|
|
|
|
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_BACKWARD) { |
|
|
CodeVector(bs, mb->b_pmvs[0].x, bcode, pStat); |
|
|
CodeVector(bs, mb->b_pmvs[0].y, bcode, pStat); |
|
|
} |
|
|
|
|
|
if (mb->mode == MODE_DIRECT) { |
|
|
// TODO: direct |
|
|
} |
|
|
|
|
|
for (i = 0; i < 6; i++) { |
|
|
if (mb->cbp & (1 << (5 - i))) { |
|
|
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
|
|
} |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************** |
|
|
* decoding stuff starts here * |
|
|
***************************************************************/ |
|
|
|
|
|
|
|
|
void |
|
|
skip_stuffing(Bitstream *bs) |
|
|
{ |
|
|
while (BitstreamShowBits(bs, 9) == 1) |
|
|
BitstreamSkip(bs, 9); |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// for IVOP addbits == 0 |
|
|
// for PVOP addbits == fcode - 1 |
|
|
// for BVOP addbits == max(fcode,bcode) - 1 |
|
|
// returns true or false |
|
633 |
int |
int |
634 |
check_resync_marker(Bitstream * bs, int addbits) |
check_resync_marker(Bitstream * bs, int addbits) |
635 |
{ |
{ |
806 |
|
|
807 |
} |
} |
808 |
|
|
809 |
|
/***************************************************************************** |
810 |
|
* Local inlined function to "decode" written vlc codes |
811 |
|
****************************************************************************/ |
812 |
|
|
813 |
|
static __inline int |
814 |
|
get_coeff(Bitstream * bs, |
815 |
|
int *run, |
816 |
|
int *last, |
817 |
|
int intra, |
818 |
|
int short_video_header) |
819 |
|
{ |
820 |
|
|
821 |
|
uint32_t mode; |
822 |
|
int32_t level; |
823 |
|
REVERSE_EVENT *reverse_event; |
824 |
|
|
825 |
|
if (short_video_header) /* inter-VLCs will be used for both intra and inter blocks */ |
826 |
|
intra = 0; |
827 |
|
|
828 |
|
if (BitstreamShowBits(bs, 7) != ESCAPE) { |
829 |
|
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
830 |
|
|
831 |
|
if ((level = reverse_event->event.level) == 0) |
832 |
|
goto error; |
833 |
|
|
834 |
|
*last = reverse_event->event.last; |
835 |
|
*run = reverse_event->event.run; |
836 |
|
|
837 |
|
BitstreamSkip(bs, reverse_event->len); |
838 |
|
|
839 |
|
return BitstreamGetBits(bs, 1) ? -level : level; |
840 |
|
} |
841 |
|
|
842 |
|
BitstreamSkip(bs, 7); |
843 |
|
|
844 |
|
if (short_video_header) { |
845 |
|
/* escape mode 4 - H.263 type, only used if short_video_header = 1 */ |
846 |
|
*last = BitstreamGetBit(bs); |
847 |
|
*run = BitstreamGetBits(bs, 6); |
848 |
|
level = BitstreamGetBits(bs, 8); |
849 |
|
|
850 |
|
if (level == 0 || level == 128) |
851 |
|
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
852 |
|
|
853 |
|
return (level << 24) >> 24; |
854 |
|
} |
855 |
|
|
856 |
|
mode = BitstreamShowBits(bs, 2); |
857 |
|
|
858 |
|
if (mode < 3) { |
859 |
|
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
860 |
|
|
861 |
|
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
862 |
|
|
863 |
|
if ((level = reverse_event->event.level) == 0) |
864 |
|
goto error; |
865 |
|
|
866 |
|
*last = reverse_event->event.last; |
867 |
|
*run = reverse_event->event.run; |
868 |
|
|
869 |
|
BitstreamSkip(bs, reverse_event->len); |
870 |
|
|
871 |
|
if (mode < 2) /* first escape mode, level is offset */ |
872 |
|
level += max_level[intra][*last][*run]; |
873 |
|
else /* second escape mode, run is offset */ |
874 |
|
*run += max_run[intra][*last][level] + 1; |
875 |
|
|
876 |
|
return BitstreamGetBits(bs, 1) ? -level : level; |
877 |
|
} |
878 |
|
|
879 |
|
/* third escape mode - fixed length codes */ |
880 |
|
BitstreamSkip(bs, 2); |
881 |
|
*last = BitstreamGetBits(bs, 1); |
882 |
|
*run = BitstreamGetBits(bs, 6); |
883 |
|
BitstreamSkip(bs, 1); /* marker */ |
884 |
|
level = BitstreamGetBits(bs, 12); |
885 |
|
BitstreamSkip(bs, 1); /* marker */ |
886 |
|
|
887 |
|
return (level << 20) >> 20; |
888 |
|
|
889 |
|
error: |
890 |
|
*run = VLC_ERROR; |
891 |
|
return 0; |
892 |
|
} |
893 |
|
|
894 |
|
/***************************************************************************** |
895 |
|
* MB reading functions |
896 |
|
****************************************************************************/ |
897 |
|
|
898 |
void |
void |
899 |
get_intra_block(Bitstream * bs, |
get_intra_block(Bitstream * bs, |
900 |
int16_t * block, |
int16_t * block, |
910 |
do { |
do { |
911 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
912 |
if (run == -1) { |
if (run == -1) { |
913 |
DEBUG("fatal: invalid run"); |
DPRINTF(DPRINTF_DEBUG, "fatal: invalid run"); |
914 |
break; |
break; |
915 |
} |
} |
916 |
coeff += run; |
coeff += run; |
917 |
block[scan[coeff]] = level; |
block[scan[coeff]] = level; |
918 |
if (level < -127 || level > 127) { |
|
919 |
DEBUG1("warning: intra_overflow", level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
920 |
|
/*DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[coeff], level, BitstreamShowBits(bs, 32)); */ |
921 |
|
|
922 |
|
if (level < -2047 || level > 2047) { |
923 |
|
DPRINTF(DPRINTF_DEBUG, "warning: intra_overflow: %d", level); |
924 |
} |
} |
925 |
coeff++; |
coeff++; |
926 |
} while (!last); |
} while (!last); |
942 |
do { |
do { |
943 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
944 |
if (run == -1) { |
if (run == -1) { |
945 |
DEBUG("fatal: invalid run"); |
DPRINTF(DPRINTF_ERROR, "fatal: invalid run"); |
946 |
break; |
break; |
947 |
} |
} |
948 |
p += run; |
p += run; |
949 |
|
|
950 |
block[scan[p]] = level; |
block[scan[p]] = level; |
951 |
if (level < -127 || level > 127) { |
|
952 |
DEBUG1("warning: inter_overflow", level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
953 |
|
|
954 |
|
if (level < -2047 || level > 2047) { |
955 |
|
DPRINTF(DPRINTF_DEBUG, "warning: inter_overflow: %d", level); |
956 |
} |
} |
957 |
p++; |
p++; |
958 |
} while (!last); |
} while (!last); |