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) |
|
#ifdef BIGLUT |
|
|
#define LEVELOFFSET 2048 |
|
|
#else |
|
|
#define LEVELOFFSET 32 |
|
|
#endif |
|
|
|
|
|
static REVERSE_EVENT DCT3D[2][4096]; |
|
47 |
|
|
48 |
#ifdef BIGLUT |
/***************************************************************************** |
49 |
static VLC coeff_VLC[2][2][4096][64]; |
* Local data |
50 |
VLC *intra_table; |
****************************************************************************/ |
51 |
static VLC *inter_table; |
|
52 |
#else |
static VLC intra_table[524032]; |
53 |
static VLC coeff_VLC[2][2][64][64]; |
static VLC inter_table[524032]; |
54 |
#endif |
|
55 |
|
static VLC DCT3Dintra[4096]; |
56 |
|
static VLC DCT3Dinter[4096]; |
57 |
|
|
58 |
|
/***************************************************************************** |
59 |
|
* Vector Length Coding Initialization |
60 |
|
****************************************************************************/ |
61 |
|
|
62 |
/* not really MB related, but VLCs are only available here */ |
void |
63 |
void bs_put_spritetrajectory(Bitstream * bs, const int val) |
init_vlc_tables(void) |
64 |
{ |
{ |
|
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; |
|
65 |
|
|
66 |
// printf("GMC=%d Code/Len = %d / %d ",val, code,len); |
int32_t k, l, i, intra, last; |
67 |
// printf("Code2 / Len2 = %d / %d \n",code2,len2); |
VLC *vlc[2]; |
68 |
|
VLC const **coeff_ptr; |
69 |
|
VLC *vlc1, *vlc2; |
70 |
|
|
71 |
BitstreamPutBits(bs, code2, len2); |
vlc1 = DCT3Dintra; |
72 |
if (len) BitstreamPutBits(bs, code, len); |
vlc2 = DCT3Dinter; |
|
} |
|
73 |
|
|
74 |
int bs_get_spritetrajectory(Bitstream * bs) |
vlc[0] = intra_table; |
75 |
{ |
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; |
|
|
} |
|
76 |
|
|
77 |
void |
/* |
78 |
init_vlc_tables(void) |
* Generate encoding vlc lookup tables |
79 |
{ |
* the lookup table idea is taken from the excellent fame project |
80 |
ptr_t i, j, k, intra, last, run, run_esc, level, level_esc, escape, escape_len, offset; |
* by Vivien Chapellier |
81 |
int32_t l; |
*/ |
82 |
|
for (i = 0; i < 4; i++) { |
83 |
|
intra = i % 2; |
84 |
|
last = i / 2; |
85 |
|
|
86 |
#ifdef BIGLUT |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
|
intra_table = coeff_VLC[1]; |
|
|
inter_table = coeff_VLC[0]; |
|
|
#endif |
|
87 |
|
|
88 |
|
for (k = -2047; k < 2048; k++) { // level |
89 |
|
int8_t const *max_level_ptr = max_level[last + 2 * intra]; |
90 |
|
int8_t const *max_run_ptr = max_run[last + 2 * intra]; |
91 |
|
|
92 |
for (intra = 0; intra < 2; intra++) |
for (l = 0; l < 64; l++) { // run |
93 |
for (i = 0; i < 4096; i++) |
int32_t level = k; |
94 |
DCT3D[intra][i].event.level = 0; |
ptr_t run = l; |
|
|
|
|
for (intra = 0; intra < 2; intra++) |
|
|
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; |
|
|
} |
|
|
} |
|
95 |
|
|
96 |
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 (i = 0; i < 102; i++) |
|
|
{ |
|
|
#ifdef BIGLUT |
|
|
offset = LEVELOFFSET; |
|
|
#else |
|
|
offset = !intra * LEVELOFFSET; |
|
|
#endif |
|
|
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; |
|
|
} |
|
97 |
|
|
98 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].code |
vlc[intra]->code = 0; |
99 |
= coeff_tab[intra][i].vlc.code << 1; |
vlc[intra]->len = 0; |
100 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].len |
goto loop_end; |
101 |
= coeff_tab[intra][i].vlc.len + 1; |
} else { |
102 |
#ifndef BIGLUT |
if (level > 0) // correct level |
103 |
if (!intra) |
level -= max_level_ptr[run]; |
104 |
#endif |
else |
105 |
{ |
level += max_level_ptr[run]; |
|
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; |
|
|
} |
|
|
} |
|
106 |
|
|
107 |
for (intra = 0; intra < 2; intra++) |
if ((abs(level) <= max_level_ptr[run]) && |
108 |
for (last = 0; last < 2; last++) |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
|
for (run = 0; run < 63 + last; run++) |
|
|
{ |
|
|
for (level = 1; level < 32 << intra; level++) |
|
|
{ |
|
|
if (level <= max_level[intra][last][run] && run <= max_run[intra][last][level]) |
|
|
continue; |
|
109 |
|
|
110 |
#ifdef BIGLUT |
vlc[intra]->code = 0x06; |
111 |
offset = LEVELOFFSET; |
vlc[intra]->len = 8; |
112 |
#else |
goto loop_end; |
|
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))*/ |
|
|
|
|
|
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc]) |
|
|
{ |
|
|
escape = ESCAPE1; |
|
|
escape_len = 7 + 1; |
|
|
run_esc = run; |
|
|
} |
|
|
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; |
|
113 |
} |
} |
114 |
|
|
115 |
|
if (level > 0) // still here? |
116 |
|
level += max_level_ptr[run]; // restore level |
117 |
else |
else |
118 |
{ |
level -= max_level_ptr[run]; |
|
#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; |
|
|
} |
|
|
continue; |
|
|
} |
|
|
} |
|
119 |
|
|
120 |
coeff_VLC[intra][last][level + offset][run].code |
run -= max_run_ptr[abs(level)] + 1; // and change run |
121 |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
|
122 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code; |
if ((abs(level) <= max_level_ptr[run]) && |
123 |
coeff_VLC[intra][last][level + offset][run].len |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
124 |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
|
125 |
#ifndef BIGLUT |
vlc[intra]->code = 0x0e; |
126 |
if (!intra) |
vlc[intra]->len = 9; |
127 |
#endif |
goto loop_end; |
|
{ |
|
|
coeff_VLC[intra][last][offset - level][run].code |
|
|
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
|
|
| coeff_VLC[intra][last][level_esc + offset][run_esc].code | 1; |
|
|
coeff_VLC[intra][last][offset - level][run].len |
|
|
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
|
128 |
} |
} |
129 |
|
run += max_run_ptr[abs(level)] + 1; |
130 |
} |
} |
131 |
|
|
132 |
#ifdef BIGLUT |
vlc[intra]->code = |
133 |
for (level = 32 << intra; level < 2048; level++) |
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
134 |
{ |
((k & 0xfff) << 1) | 1; |
|
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; |
|
135 |
|
|
136 |
coeff_VLC[intra][last][offset - level][run].code |
vlc[intra]->len = 30; |
137 |
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-level & 0xfff) << 1) | 1; |
vlc[intra]++; |
138 |
coeff_VLC[intra][last][offset - level][run].len = 30; |
continue; |
139 |
|
|
140 |
|
loop_end: |
141 |
|
if (level != 0) { |
142 |
|
vlc[intra]->code = |
143 |
|
(vlc[intra]-> |
144 |
|
code << (coeff_ptr[run][abs(level) - 1].len + |
145 |
|
1)) | (coeff_ptr[run][abs(level) - |
146 |
|
1].code << 1); |
147 |
|
vlc[intra]->len = |
148 |
|
(coeff_ptr[run][abs(level) - 1].len + 1) + |
149 |
|
vlc[intra]->len; |
150 |
|
|
151 |
|
if (level < 0) |
152 |
|
vlc[intra]->code += 1; |
153 |
|
} |
154 |
|
|
155 |
|
vlc[intra]++; |
156 |
} |
} |
|
#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; |
|
157 |
} |
} |
|
#endif |
|
158 |
} |
} |
|
/* 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); |
|
159 |
|
|
160 |
for (l=-(2*limit-1); l <= -limit; l++) |
for (i = 0; i < 4096; i++) { |
161 |
{ |
if (i >= 512) { |
162 |
sprite_trajectory_code[l+16384].code = (2*limit-1)+l; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
163 |
sprite_trajectory_code[l+16384].len = k+1; |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
164 |
|
} else if (i >= 128) { |
165 |
|
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
166 |
|
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
167 |
|
} else if (i >= 8) { |
168 |
|
*vlc1 = DCT3Dtab5[i - 8]; |
169 |
|
*vlc2 = DCT3Dtab2[i - 8]; |
170 |
|
} else { |
171 |
|
*vlc1 = ERRtab[i]; |
172 |
|
*vlc2 = ERRtab[i]; |
173 |
} |
} |
174 |
|
|
175 |
for (l=limit; l<= 2*limit-1; l++) |
vlc1++; |
176 |
{ |
vlc2++; |
|
sprite_trajectory_code[l+16384].code = l; |
|
|
sprite_trajectory_code[l+16384].len = k+1; |
|
|
} |
|
177 |
} |
} |
178 |
|
DCT3D[0] = DCT3Dinter; |
179 |
|
DCT3D[1] = DCT3Dintra; |
180 |
|
|
181 |
} |
} |
182 |
|
|
183 |
|
/***************************************************************************** |
184 |
|
* Local inlined functions for MB coding |
185 |
|
****************************************************************************/ |
186 |
|
|
187 |
static __inline void |
static __inline void |
188 |
CodeVector(Bitstream * bs, |
CodeVector(Bitstream * bs, |
189 |
int32_t value, |
int32_t value, |
239 |
|
|
240 |
} |
} |
241 |
|
|
|
#ifdef BIGLUT |
|
|
|
|
242 |
static __inline void |
static __inline void |
243 |
CodeCoeff(Bitstream * bs, |
CodeCoeff(Bitstream * bs, |
244 |
const int16_t qcoeff[64], |
const int16_t qcoeff[64], |
258 |
j++; |
j++; |
259 |
|
|
260 |
do { |
do { |
261 |
vlc = table + 64 * 2048 + (v << 6) + j - last; |
vlc = table + 64 * 2047 + (v << 6) + j - last; |
262 |
last = ++j; |
last = ++j; |
263 |
|
|
264 |
/* count zeroes */ |
// count zeroes |
265 |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
266 |
j++; |
j++; |
267 |
|
|
268 |
/* write code */ |
// write code |
269 |
if (j != 64) { |
if (j != 64) { |
270 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
271 |
} else { |
} else { |
272 |
vlc += 64 * 4096; |
vlc += 64 * 4095; |
273 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
274 |
break; |
break; |
275 |
} |
} |
277 |
|
|
278 |
} |
} |
279 |
|
|
280 |
|
/***************************************************************************** |
281 |
|
* Local functions |
282 |
|
****************************************************************************/ |
283 |
|
|
284 |
|
static void |
285 |
/* returns the number of bits required to encode qcoeff */ |
CodeBlockIntra(const FRAMEINFO * frame, |
|
int |
|
|
CodeCoeff_CalcBits(const int16_t qcoeff[64], |
|
|
VLC * table, |
|
|
const uint16_t * zigzag, |
|
|
uint16_t intra) |
|
|
{ |
|
|
int bits = 0; |
|
|
uint32_t j, last; |
|
|
short v; |
|
|
VLC *vlc; |
|
|
|
|
|
j = intra; |
|
|
last = intra; |
|
|
|
|
|
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
|
|
j++; |
|
|
|
|
|
if (j >= 64) return 0; /* empty block */ |
|
|
|
|
|
do { |
|
|
vlc = table + 64 * 2048 + (v << 6) + j - last; |
|
|
last = ++j; |
|
|
|
|
|
/* count zeroes */ |
|
|
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
|
|
j++; |
|
|
|
|
|
/* write code */ |
|
|
if (j != 64) { |
|
|
bits += vlc->len; |
|
|
} else { |
|
|
vlc += 64 * 4096; |
|
|
bits += vlc->len; |
|
|
break; |
|
|
} |
|
|
} while (1); |
|
|
|
|
|
return bits; |
|
|
} |
|
|
|
|
|
|
|
|
#else |
|
|
|
|
|
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 (i<64 && !(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); |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/* returns the number of bits required to encode qcoeff */ |
|
|
|
|
|
int |
|
|
CodeCoeffIntra_CalcBits(const int16_t qcoeff[64], const uint16_t * zigzag) |
|
|
{ |
|
|
int bits = 0; |
|
|
uint32_t i, abs_level, run, prev_run, len; |
|
|
int32_t level, prev_level; |
|
|
|
|
|
i = 1; |
|
|
run = 0; |
|
|
|
|
|
while (i<64 && !(level = qcoeff[zigzag[i++]])) |
|
|
run++; |
|
|
|
|
|
if (i >= 64) return 0; /* empty block */ |
|
|
|
|
|
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; |
|
|
len = coeff_VLC[1][0][abs_level][prev_run].len; |
|
|
bits += len!=128 ? len : 30; |
|
|
|
|
|
prev_level = level; |
|
|
prev_run = run; |
|
|
run = 0; |
|
|
} |
|
|
else |
|
|
run++; |
|
|
} |
|
|
|
|
|
abs_level = ABS(prev_level); |
|
|
abs_level = abs_level < 64 ? abs_level : 0; |
|
|
len = coeff_VLC[1][1][abs_level][prev_run].len; |
|
|
bits += len!=128 ? len : 30; |
|
|
|
|
|
return bits; |
|
|
} |
|
|
|
|
|
|
|
|
#endif |
|
|
|
|
|
static __inline void |
|
|
CodeBlockIntra(const FRAMEINFO * const frame, |
|
286 |
const MACROBLOCK * pMB, |
const MACROBLOCK * pMB, |
287 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
288 |
Bitstream * bs, |
Bitstream * bs, |
331 |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
332 |
|
|
333 |
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]]; |
|
|
|
|
334 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
335 |
|
|
336 |
#ifdef BIGLUT |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
337 |
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 |
|
338 |
|
|
339 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
340 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
345 |
|
|
346 |
|
|
347 |
static void |
static void |
348 |
CodeBlockInter(const FRAMEINFO * const frame, |
CodeBlockInter(const FRAMEINFO * frame, |
349 |
const MACROBLOCK * pMB, |
const MACROBLOCK * pMB, |
350 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
351 |
Bitstream * bs, |
Bitstream * bs, |
362 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
363 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
364 |
|
|
|
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 |
|
|
|
|
365 |
// write cbpy |
// write cbpy |
366 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
367 |
|
|
373 |
if (frame->global_flags & XVID_INTERLACING) { |
if (frame->global_flags & XVID_INTERLACING) { |
374 |
if (pMB->cbp) { |
if (pMB->cbp) { |
375 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
376 |
DPRINTF(DPRINTF_MB,"codep: field_dct: %i", pMB->field_dct); |
DEBUG1("codep: field_dct: ", pMB->field_dct); |
377 |
} |
} |
378 |
|
|
379 |
// if inter block, write field ME flag |
// if inter block, write field ME flag |
380 |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
381 |
BitstreamPutBit(bs, pMB->field_pred); |
BitstreamPutBit(bs, pMB->field_pred); |
382 |
DPRINTF(DPRINTF_MB,"codep: field_pred: %i", pMB->field_pred); |
DEBUG1("codep: field_pred: ", pMB->field_pred); |
383 |
|
|
384 |
// write field prediction references |
// write field prediction references |
385 |
if (pMB->field_pred) { |
if (pMB->field_pred) { |
388 |
} |
} |
389 |
} |
} |
390 |
} |
} |
391 |
// code motion vector(s) if motion is local |
// code motion vector(s) |
|
if (!pMB->mcsel) |
|
392 |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
393 |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
394 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
399 |
// code block coeffs |
// code block coeffs |
400 |
for (i = 0; i < 6; i++) |
for (i = 0; i < 6; i++) |
401 |
if (pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) |
402 |
{ |
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 |
|
|
} |
|
403 |
|
|
404 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
405 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
406 |
|
|
407 |
} |
} |
408 |
|
|
409 |
|
/***************************************************************************** |
410 |
|
* Macro Block bitstream encoding functions |
411 |
|
****************************************************************************/ |
412 |
|
|
413 |
void |
void |
414 |
MBCoding(const FRAMEINFO * const frame, |
MBCoding(const FRAMEINFO * frame, |
415 |
MACROBLOCK * pMB, |
MACROBLOCK * pMB, |
416 |
int16_t qcoeff[6 * 64], |
int16_t qcoeff[6 * 64], |
417 |
Bitstream * bs, |
Bitstream * bs, |
418 |
Statistics * pStat) |
Statistics * pStat) |
419 |
{ |
{ |
420 |
if (frame->coding_type != I_VOP) |
|
421 |
BitstreamPutBit(bs, 0); // not_coded |
if (frame->coding_type == P_VOP) { |
422 |
|
BitstreamPutBit(bs, 0); // coded |
423 |
|
} |
424 |
|
|
425 |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
426 |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
429 |
|
|
430 |
} |
} |
431 |
|
|
432 |
/* |
|
|
// moved to mbcoding.h so that in can be 'static __inline' |
|
433 |
void |
void |
434 |
MBSkip(Bitstream * bs) |
MBSkip(Bitstream * bs) |
435 |
{ |
{ |
436 |
BitstreamPutBit(bs, 1); // not coded |
BitstreamPutBit(bs, 1); // not coded |
437 |
|
return; |
438 |
} |
} |
|
*/ |
|
439 |
|
|
440 |
|
#if 0 |
441 |
/*************************************************************** |
/*************************************************************** |
442 |
* bframe encoding start |
* bframe encoding start |
443 |
***************************************************************/ |
***************************************************************/ |
450 |
3 0001b forward mc+q dbquant, mvdf |
3 0001b forward mc+q dbquant, mvdf |
451 |
*/ |
*/ |
452 |
|
|
453 |
static __inline void |
void |
454 |
put_bvop_mbtype(Bitstream * bs, |
put_bvop_mbtype(Bitstream * bs, |
455 |
int value) |
int value) |
456 |
{ |
{ |
457 |
switch (value) { |
switch (value) { |
458 |
case MODE_FORWARD: |
case 0: |
459 |
|
BitstreamPutBit(bs, 1); |
460 |
|
return; |
461 |
|
|
462 |
|
case 1: |
463 |
BitstreamPutBit(bs, 0); |
BitstreamPutBit(bs, 0); |
464 |
case MODE_BACKWARD: |
BitstreamPutBit(bs, 1); |
465 |
|
return; |
466 |
|
|
467 |
|
case 2: |
468 |
BitstreamPutBit(bs, 0); |
BitstreamPutBit(bs, 0); |
|
case MODE_INTERPOLATE: |
|
469 |
BitstreamPutBit(bs, 0); |
BitstreamPutBit(bs, 0); |
|
case MODE_DIRECT: |
|
470 |
BitstreamPutBit(bs, 1); |
BitstreamPutBit(bs, 1); |
471 |
default: |
return; |
472 |
break; |
|
473 |
|
case 3: |
474 |
|
BitstreamPutBit(bs, 0); |
475 |
|
BitstreamPutBit(bs, 0); |
476 |
|
BitstreamPutBit(bs, 0); |
477 |
|
BitstreamPutBit(bs, 1); |
478 |
|
return; |
479 |
|
|
480 |
|
default:; // invalid! |
481 |
|
|
482 |
} |
} |
483 |
|
|
484 |
} |
} |
485 |
|
|
486 |
/* |
/* |
490 |
+2 11b |
+2 11b |
491 |
*/ |
*/ |
492 |
|
|
493 |
static __inline void |
void |
494 |
put_bvop_dbquant(Bitstream * bs, |
put_bvop_dbquant(Bitstream * bs, |
495 |
int value) |
int value) |
496 |
{ |
{ |
513 |
} |
} |
514 |
} |
} |
515 |
|
|
|
|
|
|
|
|
516 |
void |
void |
517 |
MBCodingBVOP(const MACROBLOCK * mb, |
MBCodingBVOP(const MACROBLOCK * mb, |
518 |
const int16_t qcoeff[6 * 64], |
const int16_t qcoeff[6 * 64], |
519 |
const int32_t fcode, |
const int32_t fcode, |
520 |
const int32_t bcode, |
const int32_t bcode, |
521 |
Bitstream * bs, |
Bitstream * bs, |
522 |
Statistics * pStat, |
Statistics * pStat) |
|
int direction) |
|
523 |
{ |
{ |
524 |
int vcode = fcode; |
int i; |
|
unsigned int i; |
|
525 |
|
|
526 |
/* ------------------------------------------------------------------ |
/* ------------------------------------------------------------------ |
527 |
when a block is skipped it is decoded DIRECT(0,0) |
when a block is skipped it is decoded DIRECT(0,0) |
551 |
put_bvop_dbquant(bs, 0); // todo: mb->dquant = 0 |
put_bvop_dbquant(bs, 0); // todo: mb->dquant = 0 |
552 |
} |
} |
553 |
|
|
554 |
switch (mb->mode) { |
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_FORWARD) { |
555 |
case MODE_INTERPOLATE: |
CodeVector(bs, mb->pmvs[0].x, fcode, pStat); |
556 |
CodeVector(bs, mb->pmvs[1].x, vcode, pStat); //forward vector of interpolate mode |
CodeVector(bs, mb->pmvs[0].y, fcode, pStat); |
557 |
CodeVector(bs, mb->pmvs[1].y, vcode, pStat); |
} |
558 |
case MODE_BACKWARD: |
|
559 |
vcode = bcode; |
if (mb->mode == MODE_INTERPOLATE || mb->mode == MODE_BACKWARD) { |
560 |
case MODE_FORWARD: |
CodeVector(bs, mb->b_pmvs[0].x, bcode, pStat); |
561 |
CodeVector(bs, mb->pmvs[0].x, vcode, pStat); |
CodeVector(bs, mb->b_pmvs[0].y, bcode, pStat); |
562 |
CodeVector(bs, mb->pmvs[0].y, vcode, pStat); |
} |
563 |
break; |
|
564 |
case MODE_DIRECT: |
if (mb->mode == MODE_DIRECT) { |
565 |
CodeVector(bs, mb->pmvs[3].x, 1, pStat); // fcode is always 1 for delta vector |
CodeVector(bs, mb->deltamv.x, 1, pStat); /* fcode is always 1 for delta vector */ |
566 |
CodeVector(bs, mb->pmvs[3].y, 1, pStat); // prediction is always (0,0) |
CodeVector(bs, mb->deltamv.y, 1, pStat); /* prediction is always (0,0) */ |
|
default: break; |
|
567 |
} |
} |
568 |
|
|
569 |
for (i = 0; i < 6; i++) { |
for (i = 0; i < 6; i++) { |
570 |
if (mb->cbp & (1 << (5 - i))) { |
if (mb->cbp & (1 << (5 - i))) { |
|
#ifdef BIGLUT |
|
571 |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
|
#else |
|
|
CodeCoeffInter(bs, &qcoeff[i * 64], scan_tables[0]); |
|
|
#endif |
|
572 |
} |
} |
573 |
} |
} |
574 |
} |
} |
575 |
|
#endif |
576 |
|
|
577 |
|
|
578 |
|
/***************************************************************************** |
579 |
|
* decoding stuff starts here |
580 |
|
****************************************************************************/ |
581 |
|
|
582 |
/*************************************************************** |
/* |
583 |
* decoding stuff starts here * |
* For IVOP addbits == 0 |
584 |
***************************************************************/ |
* For PVOP addbits == fcode - 1 |
585 |
|
* For BVOP addbits == max(fcode,bcode) - 1 |
586 |
|
* returns true or false |
587 |
|
*/ |
588 |
|
|
|
// for IVOP addbits == 0 |
|
|
// for PVOP addbits == fcode - 1 |
|
|
// for BVOP addbits == max(fcode,bcode) - 1 |
|
|
// returns true or false |
|
589 |
int |
int |
590 |
check_resync_marker(Bitstream * bs, int addbits) |
check_resync_marker(Bitstream * bs, int addbits) |
591 |
{ |
{ |
627 |
|
|
628 |
uint32_t index; |
uint32_t index; |
629 |
|
|
630 |
index = MIN(BitstreamShowBits(bs, 9), 256); |
index = CLIP(BitstreamShowBits(bs, 9), 256); |
631 |
|
|
632 |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
633 |
|
|
653 |
|
|
654 |
} |
} |
655 |
|
|
656 |
static __inline int |
int |
657 |
get_mv_data(Bitstream * bs) |
get_mv_data(Bitstream * bs) |
658 |
{ |
{ |
659 |
|
|
762 |
|
|
763 |
} |
} |
764 |
|
|
765 |
|
/***************************************************************************** |
766 |
|
* Local inlined function to "decode" written vlc codes |
767 |
|
****************************************************************************/ |
768 |
|
|
769 |
static __inline int |
static __inline int |
770 |
get_coeff(Bitstream * bs, |
get_coeff(Bitstream * bs, |
771 |
int *run, |
int *run, |
775 |
{ |
{ |
776 |
|
|
777 |
uint32_t mode; |
uint32_t mode; |
778 |
|
const VLC *tab; |
779 |
int32_t level; |
int32_t level; |
|
REVERSE_EVENT *reverse_event; |
|
780 |
|
|
781 |
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 |
782 |
intra = 0; |
intra = 0; |
783 |
|
|
784 |
if (BitstreamShowBits(bs, 7) != ESCAPE) { |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
785 |
|
|
786 |
if ((level = reverse_event->event.level) == 0) |
if (tab->code == -1) |
787 |
goto error; |
goto error; |
788 |
|
|
789 |
*last = reverse_event->event.last; |
BitstreamSkip(bs, tab->len); |
|
*run = reverse_event->event.run; |
|
790 |
|
|
791 |
BitstreamSkip(bs, reverse_event->len); |
if (tab->code != ESCAPE) { |
792 |
|
if (!intra) { |
793 |
return BitstreamGetBits(bs, 1) ? -level : level; |
*run = (tab->code >> 4) & 255; |
794 |
|
level = tab->code & 15; |
795 |
|
*last = (tab->code >> 12) & 1; |
796 |
|
} else { |
797 |
|
*run = (tab->code >> 8) & 255; |
798 |
|
level = tab->code & 255; |
799 |
|
*last = (tab->code >> 16) & 1; |
800 |
|
} |
801 |
|
return BitstreamGetBit(bs) ? -level : level; |
802 |
} |
} |
|
|
|
|
BitstreamSkip(bs, 7); |
|
803 |
|
|
804 |
if (short_video_header) { |
if (short_video_header) { |
805 |
/* 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 |
806 |
*last = BitstreamGetBit(bs); |
*last = BitstreamGetBit(bs); |
807 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
808 |
level = BitstreamGetBits(bs, 8); |
level = BitstreamGetBits(bs, 8); |
809 |
|
|
810 |
if (level == 0 || level == 128) |
if (level == 0 || level == 128) |
811 |
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
DEBUG1("Illegal LEVEL for ESCAPE mode 4:", level); |
812 |
|
|
813 |
return (level << 24) >> 24; |
return (level >= 128 ? -(256 - level) : level); |
814 |
} |
} |
815 |
|
|
816 |
mode = BitstreamShowBits(bs, 2); |
mode = BitstreamShowBits(bs, 2); |
818 |
if (mode < 3) { |
if (mode < 3) { |
819 |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
820 |
|
|
821 |
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
tab = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
822 |
|
if (tab->code == -1) |
|
if ((level = reverse_event->event.level) == 0) |
|
823 |
goto error; |
goto error; |
824 |
|
|
825 |
*last = reverse_event->event.last; |
BitstreamSkip(bs, tab->len); |
|
*run = reverse_event->event.run; |
|
826 |
|
|
827 |
BitstreamSkip(bs, reverse_event->len); |
if (!intra) { |
828 |
|
*run = (tab->code >> 4) & 255; |
829 |
|
level = tab->code & 15; |
830 |
|
*last = (tab->code >> 12) & 1; |
831 |
|
} else { |
832 |
|
*run = (tab->code >> 8) & 255; |
833 |
|
level = tab->code & 255; |
834 |
|
*last = (tab->code >> 16) & 1; |
835 |
|
} |
836 |
|
|
837 |
if (mode < 2) /* first escape mode, level is offset */ |
if (mode < 2) // first escape mode, level is offset |
838 |
level += max_level[intra][*last][*run]; |
level += max_level[*last + (!intra << 1)][*run]; // need to add back the max level |
839 |
else /* second escape mode, run is offset */ |
else if (mode == 2) // second escape mode, run is offset |
840 |
*run += max_run[intra][*last][level] + 1; |
*run += max_run[*last + (!intra << 1)][level] + 1; |
841 |
|
|
842 |
return BitstreamGetBits(bs, 1) ? -level : level; |
return BitstreamGetBit(bs) ? -level : level; |
843 |
} |
} |
844 |
|
// third escape mode - fixed length codes |
|
/* third escape mode - fixed length codes */ |
|
845 |
BitstreamSkip(bs, 2); |
BitstreamSkip(bs, 2); |
846 |
*last = BitstreamGetBits(bs, 1); |
*last = BitstreamGetBits(bs, 1); |
847 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
848 |
BitstreamSkip(bs, 1); /* marker */ |
BitstreamSkip(bs, 1); // marker |
849 |
level = BitstreamGetBits(bs, 12); |
level = BitstreamGetBits(bs, 12); |
850 |
BitstreamSkip(bs, 1); /* marker */ |
BitstreamSkip(bs, 1); // marker |
851 |
|
|
852 |
return (level << 20) >> 20; |
return (level & 0x800) ? (level | (-1 ^ 0xfff)) : level; |
853 |
|
|
854 |
error: |
error: |
855 |
*run = VLC_ERROR; |
*run = VLC_ERROR; |
856 |
return 0; |
return 0; |
857 |
|
|
858 |
} |
} |
859 |
|
|
860 |
|
/***************************************************************************** |
861 |
|
* MB reading functions |
862 |
|
****************************************************************************/ |
863 |
|
|
864 |
void |
void |
865 |
get_intra_block(Bitstream * bs, |
get_intra_block(Bitstream * bs, |
866 |
int16_t * block, |
int16_t * block, |
869 |
{ |
{ |
870 |
|
|
871 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[direction]; |
872 |
int level, run, last; |
int level; |
873 |
|
int run; |
874 |
|
int last; |
875 |
|
|
876 |
do { |
do { |
877 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
878 |
if (run == -1) { |
if (run == -1) { |
879 |
DPRINTF(DPRINTF_ERROR,"fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
880 |
break; |
break; |
881 |
} |
} |
882 |
coeff += run; |
coeff += run; |
885 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
886 |
//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)); |
887 |
|
|
888 |
if (level < -2047 || level > 2047) { |
if (level < -127 || level > 127) { |
889 |
DPRINTF(DPRINTF_ERROR,"warning: intra_overflow %i", level); |
DEBUG1("warning: intra_overflow", level); |
890 |
} |
} |
891 |
coeff++; |
coeff++; |
892 |
} while (!last); |
} while (!last); |
895 |
|
|
896 |
void |
void |
897 |
get_inter_block(Bitstream * bs, |
get_inter_block(Bitstream * bs, |
898 |
int16_t * block, |
int16_t * block) |
|
int direction) |
|
899 |
{ |
{ |
900 |
|
|
901 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[0]; |
902 |
int p; |
int p; |
903 |
int level; |
int level; |
904 |
int run; |
int run; |
908 |
do { |
do { |
909 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
910 |
if (run == -1) { |
if (run == -1) { |
911 |
DPRINTF(DPRINTF_ERROR,"fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
912 |
break; |
break; |
913 |
} |
} |
914 |
p += run; |
p += run; |
918 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
919 |
// 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)); |
920 |
|
|
921 |
if (level < -2047 || level > 2047) { |
if (level < -127 || level > 127) { |
922 |
DPRINTF(DPRINTF_ERROR,"warning: inter overflow %i", level); |
DEBUG1("warning: inter_overflow", level); |
923 |
} |
} |
924 |
p++; |
p++; |
925 |
} while (!last); |
} while (!last); |