1 |
|
/***************************************************************************** |
2 |
|
* |
3 |
|
* XVID MPEG-4 VIDEO CODEC |
4 |
|
* - Macro Block coding functions - |
5 |
|
* |
6 |
|
* Copyright(C) 2002 Michael Militzer <isibaar@xvid.org> |
7 |
|
* |
8 |
|
* |
9 |
|
* This program is an implementation of a part of one or more MPEG-4 |
10 |
|
* Video tools as specified in ISO/IEC 14496-2 standard. Those intending |
11 |
|
* to use this software module in hardware or software products are |
12 |
|
* 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 |
|
* developer of this software module and his/her company, and subsequent |
15 |
|
* editors and their companies, will have no liability for use of this |
16 |
|
* software or modifications or derivatives thereof. |
17 |
|
* |
18 |
|
* This program is free software; you can redistribute it and/or modify |
19 |
|
* it under the terms of the GNU General Public License as published by |
20 |
|
* the Free Software Foundation; either version 2 of the License, or |
21 |
|
* (at your option) any later version. |
22 |
|
* |
23 |
|
* This program is distributed in the hope that it will be useful, |
24 |
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
25 |
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
26 |
|
* 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 |
|
* $Id: mbcoding.c,v 1.31 2002-09-21 02:26:12 suxen_drol Exp $ |
33 |
|
* |
34 |
|
****************************************************************************/ |
35 |
|
|
36 |
|
#include <stdlib.h> |
37 |
#include "../portab.h" |
#include "../portab.h" |
38 |
#include "bitstream.h" |
#include "bitstream.h" |
39 |
#include "zigzag.h" |
#include "zigzag.h" |
40 |
#include "vlc_codes.h" |
#include "vlc_codes.h" |
41 |
|
#include "mbcoding.h" |
42 |
|
|
43 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
44 |
|
|
|
#include <stdlib.h> /* malloc, free */ |
|
|
|
|
|
#define ESCAPE 7167 |
|
45 |
#define ABS(X) (((X)>0)?(X):-(X)) |
#define ABS(X) (((X)>0)?(X):-(X)) |
46 |
#define CLIP(X,A) (X > A) ? (A) : (X) |
#define CLIP(X,A) (X > A) ? (A) : (X) |
47 |
|
|
48 |
static VLC *DCT3D[2]; |
/***************************************************************************** |
49 |
|
* Local data |
50 |
VLC *intra_table, *inter_table; |
****************************************************************************/ |
51 |
static short clip_table[4096]; |
|
52 |
|
/* msvc sp5+pp gets confused if they globals are made static */ |
53 |
|
VLC intra_table[524032]; |
54 |
|
VLC inter_table[524032]; |
55 |
|
|
56 |
|
static VLC DCT3Dintra[4096]; |
57 |
|
static VLC DCT3Dinter[4096]; |
58 |
|
|
59 |
|
/***************************************************************************** |
60 |
|
* Vector Length Coding Initialization |
61 |
|
****************************************************************************/ |
62 |
|
|
63 |
void create_vlc_tables(void) |
void |
64 |
|
init_vlc_tables(void) |
65 |
{ |
{ |
66 |
|
|
67 |
int32_t k, l, i, intra, last; |
int32_t k, l, i, intra, last; |
68 |
VLC *vlc[2]; |
VLC *vlc[2]; |
69 |
VLC **coeff_ptr; |
VLC const **coeff_ptr; |
70 |
VLC *vlc1, *vlc2; |
VLC *vlc1, *vlc2; |
71 |
|
|
|
VLC *DCT3Dintra; |
|
|
VLC *DCT3Dinter; |
|
|
|
|
|
DCT3Dintra = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
DCT3Dinter = (VLC *) malloc(sizeof(VLC) * 4096); |
|
|
|
|
72 |
vlc1 = DCT3Dintra; |
vlc1 = DCT3Dintra; |
73 |
vlc2 = DCT3Dinter; |
vlc2 = DCT3Dinter; |
74 |
|
|
75 |
vlc[0] = intra_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[0] = intra_table; |
76 |
vlc[1] = inter_table = (VLC *) malloc(128 * 511 * sizeof(VLC)); |
vlc[1] = inter_table; |
|
|
|
|
// initialize the clipping table |
|
|
for(i = -2048; i < 2048; i++) { |
|
|
clip_table[i + 2048] = i; |
|
|
if(i < -255) |
|
|
clip_table[i + 2048] = -255; |
|
|
if(i > 255) |
|
|
clip_table[i + 2048] = 255; |
|
|
} |
|
77 |
|
|
78 |
// generate intra/inter vlc lookup table |
/* |
79 |
|
* Generate encoding vlc lookup tables |
80 |
|
* the lookup table idea is taken from the excellent fame project |
81 |
|
* by Vivien Chapellier |
82 |
|
*/ |
83 |
for(i = 0; i < 4; i++) { |
for(i = 0; i < 4; i++) { |
84 |
intra = i % 2; |
intra = i % 2; |
85 |
last = i >> 1; |
last = i / 2; |
86 |
|
|
87 |
coeff_ptr = coeff_vlc[last + (intra << 1)]; |
coeff_ptr = coeff_vlc[last + 2 * intra]; |
88 |
|
|
89 |
for(k = -255; k < 256; k++) { // level |
for (k = -2047; k < 2048; k++) { // level |
90 |
char *max_level_ptr = max_level[last + (intra << 1)]; |
int8_t const *max_level_ptr = max_level[last + 2 * intra]; |
91 |
char *max_run_ptr = max_run[last + (intra << 1)]; |
int8_t const *max_run_ptr = max_run[last + 2 * intra]; |
92 |
|
|
93 |
for(l = 0; l < 64; l++) { // run |
for(l = 0; l < 64; l++) { // run |
94 |
int32_t level = k, run = l; |
int32_t level = k; |
95 |
|
ptr_t run = l; |
96 |
|
|
97 |
if(abs(level) <= max_level_ptr[run] && run <= max_run_ptr[abs(level)]) { |
if ((abs(level) <= max_level_ptr[run]) && (run <= (uint32_t) max_run_ptr[abs(level)])) { // level < max_level and run < max_run |
98 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (coeff_ptr[run][level - 1].code) << 1; |
|
|
vlc[intra]->len = coeff_ptr[run][level - 1].len + 1; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = ((coeff_ptr[run][-level - 1].code) << 1) + 1; |
|
|
vlc[intra]->len = coeff_ptr[run][-level - 1].len + 1; |
|
|
} |
|
|
else { |
|
99 |
vlc[intra]->code = 0; |
vlc[intra]->code = 0; |
100 |
vlc[intra]->len = 0; |
vlc[intra]->len = 0; |
101 |
} |
goto loop_end; |
102 |
} else { |
} else { |
103 |
if(level > 0) |
if (level > 0) // correct level |
104 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
105 |
else |
else |
106 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; |
107 |
|
|
108 |
if(abs(level) <= max_level_ptr[run] && |
if ((abs(level) <= max_level_ptr[run]) && |
109 |
run <= max_run_ptr[abs(level)]) { |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
110 |
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (0x06 << (coeff_ptr[run][level - 1].len + 1)) | |
|
|
(coeff_ptr[run][level - 1].code << 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][level - 1].len + 1) + 8; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = (0x06 << (coeff_ptr[run][-level - 1].len + 1)) | |
|
|
((coeff_ptr[run][-level - 1].code << 1) + 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][-level - 1].len + 1) + 8; |
|
|
} |
|
|
else { |
|
111 |
vlc[intra]->code = 0x06; |
vlc[intra]->code = 0x06; |
112 |
vlc[intra]->len = 8; |
vlc[intra]->len = 8; |
113 |
|
goto loop_end; |
114 |
} |
} |
115 |
} else { |
|
116 |
if(level > 0) |
if (level > 0) // still here? |
117 |
level += max_level_ptr[run]; |
level += max_level_ptr[run]; // restore level |
118 |
else |
else |
119 |
level -= max_level_ptr[run]; |
level -= max_level_ptr[run]; |
120 |
DEBUG1("1) run:", run); |
|
121 |
run -= max_run_ptr[abs(level)] + 1; |
run -= max_run_ptr[abs(level)] + 1; // and change run |
122 |
DEBUG1("2) run:", run); |
|
123 |
|
if ((abs(level) <= max_level_ptr[run]) && |
124 |
if(abs(level) <= max_level_ptr[run] && |
(run <= (uint32_t) max_run_ptr[abs(level)])) { |
125 |
run <= max_run_ptr[abs(level)]) { |
|
|
|
|
|
if(level > 0) { |
|
|
vlc[intra]->code = (0x0e << (coeff_ptr[run][level - 1].len + 1)) | |
|
|
(coeff_ptr[run][level - 1].code << 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][level - 1].len + 1) + 9; |
|
|
} |
|
|
else if(level < 0) { |
|
|
vlc[intra]->code = (0x0e << (coeff_ptr[run][-level - 1].len + 1)) | |
|
|
((coeff_ptr[run][-level - 1].code << 1) + 1); |
|
|
vlc[intra]->len = (coeff_ptr[run][-level - 1].len + 1) + 9; |
|
|
} |
|
|
else { |
|
126 |
vlc[intra]->code = 0x0e; |
vlc[intra]->code = 0x0e; |
127 |
vlc[intra]->len = 9; |
vlc[intra]->len = 9; |
128 |
|
goto loop_end; |
129 |
} |
} |
|
} else { |
|
|
if(level != 0) |
|
130 |
run += max_run_ptr[abs(level)] + 1; |
run += max_run_ptr[abs(level)] + 1; |
131 |
else |
} |
|
run++; |
|
|
|
|
|
DEBUG1("3) run:", run); |
|
132 |
|
|
133 |
vlc[intra]->code = (uint32_t) ((0x1e + last) << 20) | |
vlc[intra]->code = |
134 |
(l << 14) | (1 << 13) | ((k & 0xfff) << 1) | 1; |
(uint32_t) ((l << 14) | (0x1e + last) << 20) | (1 << 13) | |
135 |
|
((k & 0xfff) << 1) | 1; |
136 |
|
|
137 |
vlc[intra]->len = 30; |
vlc[intra]->len = 30; |
138 |
|
vlc[intra]++; |
139 |
|
continue; |
140 |
|
|
141 |
|
loop_end: |
142 |
|
if (level != 0) { |
143 |
|
vlc[intra]->code = |
144 |
|
(vlc[intra]-> |
145 |
|
code << (coeff_ptr[run][abs(level) - 1].len + |
146 |
|
1)) | (coeff_ptr[run][abs(level) - |
147 |
|
1].code << 1); |
148 |
|
vlc[intra]->len = |
149 |
|
(coeff_ptr[run][abs(level) - 1].len + 1) + |
150 |
|
vlc[intra]->len; |
151 |
|
|
152 |
|
if (level < 0) |
153 |
|
vlc[intra]->code += 1; |
154 |
} |
} |
155 |
} |
|
|
} |
|
156 |
vlc[intra]++; |
vlc[intra]++; |
157 |
} |
} |
158 |
} |
} |
159 |
} |
} |
|
intra_table += 64*255; // center vlc tables |
|
|
inter_table += 64*255; // center vlc tables |
|
160 |
|
|
161 |
for(i = 0; i < 4096; i++) { |
for(i = 0; i < 4096; i++) { |
162 |
if(i >= 512) { |
if(i >= 512) { |
163 |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
*vlc1 = DCT3Dtab3[(i >> 5) - 16]; |
164 |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
*vlc2 = DCT3Dtab0[(i >> 5) - 16]; |
165 |
} |
} else if (i >= 128) { |
|
else if(i >= 128) { |
|
166 |
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
*vlc1 = DCT3Dtab4[(i >> 2) - 32]; |
167 |
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
*vlc2 = DCT3Dtab1[(i >> 2) - 32]; |
168 |
} |
} else if (i >= 8) { |
|
else if(i >= 8) { |
|
169 |
*vlc1 = DCT3Dtab5[i - 8]; |
*vlc1 = DCT3Dtab5[i - 8]; |
170 |
*vlc2 = DCT3Dtab2[i - 8]; |
*vlc2 = DCT3Dtab2[i - 8]; |
171 |
} |
} else { |
|
else { |
|
172 |
*vlc1 = ERRtab[i]; |
*vlc1 = ERRtab[i]; |
173 |
*vlc2 = ERRtab[i]; |
*vlc2 = ERRtab[i]; |
174 |
} |
} |
181 |
|
|
182 |
} |
} |
183 |
|
|
184 |
void destroy_vlc_tables(void) { |
/***************************************************************************** |
185 |
|
* Local inlined functions for MB coding |
186 |
if(intra_table != NULL && inter_table != NULL) { |
****************************************************************************/ |
187 |
intra_table -= 64*255; // uncenter vlc tables |
|
188 |
inter_table -= 64*255; // uncenter vlc tables |
static __inline void |
189 |
|
CodeVector(Bitstream * bs, |
190 |
free(intra_table); |
int32_t value, |
191 |
free(inter_table); |
int32_t f_code, |
192 |
} |
Statistics * pStat) |
|
|
|
|
if(DCT3D[0] != NULL && DCT3D[1] != NULL) { |
|
|
free(DCT3D[0]); |
|
|
free(DCT3D[1]); |
|
|
} |
|
|
|
|
|
} |
|
|
|
|
|
static __inline void CodeVector(Bitstream *bs, int16_t value, int16_t f_code, Statistics *pStat) |
|
193 |
{ |
{ |
194 |
|
|
195 |
const int scale_factor = 1 << (f_code - 1); |
const int scale_factor = 1 << (f_code - 1); |
196 |
const int cmp = scale_factor << 5; |
const int cmp = scale_factor << 5; |
197 |
|
|
204 |
pStat->iMvSum += value * value; |
pStat->iMvSum += value * value; |
205 |
pStat->iMvCount++; |
pStat->iMvCount++; |
206 |
|
|
207 |
if (value == 0) |
if (value == 0) { |
208 |
BitstreamPutBits(bs, mb_motion_table[32].code, mb_motion_table[32].len); |
BitstreamPutBits(bs, mb_motion_table[32].code, |
209 |
else { |
mb_motion_table[32].len); |
210 |
|
} else { |
211 |
uint16_t length, code, mv_res, sign; |
uint16_t length, code, mv_res, sign; |
212 |
|
|
213 |
length = 16 << f_code; |
length = 16 << f_code; |
231 |
code = -code; |
code = -code; |
232 |
|
|
233 |
code += 32; |
code += 32; |
234 |
BitstreamPutBits(bs, mb_motion_table[code].code, mb_motion_table[code].len); |
BitstreamPutBits(bs, mb_motion_table[code].code, |
235 |
|
mb_motion_table[code].len); |
236 |
|
|
237 |
if(f_code) |
if(f_code) |
238 |
BitstreamPutBits(bs, mv_res, f_code); |
BitstreamPutBits(bs, mv_res, f_code); |
239 |
} |
} |
240 |
|
|
241 |
} |
} |
242 |
|
|
243 |
|
static __inline void |
244 |
|
CodeCoeff(Bitstream * bs, |
245 |
|
const int16_t qcoeff[64], |
246 |
|
VLC * table, |
247 |
|
const uint16_t * zigzag, |
248 |
|
uint16_t intra) |
249 |
|
{ |
250 |
|
|
|
static __inline void CodeCoeff(Bitstream *bs, int16_t qcoeff[64], VLC *table, |
|
|
const uint16_t *zigzag, uint16_t intra) { |
|
251 |
uint32_t j, last; |
uint32_t j, last; |
252 |
short v; |
short v; |
253 |
VLC *vlc; |
VLC *vlc; |
254 |
|
|
255 |
j = intra; |
j = intra; |
256 |
last = 1 + intra; |
last = intra; |
257 |
|
|
258 |
while((v = qcoeff[zigzag[j++]]) == 0); |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
259 |
|
j++; |
260 |
|
|
261 |
do { |
do { |
262 |
|
vlc = table + 64 * 2047 + (v << 6) + j - last; |
263 |
|
last = ++j; |
264 |
|
|
265 |
// count zeroes |
// count zeroes |
266 |
vlc = table + (clip_table[2048+v] << 6) + j - last; |
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
267 |
last = j + 1; |
j++; |
|
while(j < 64 && (v = qcoeff[zigzag[j++]]) == 0); |
|
268 |
|
|
269 |
// write code |
// write code |
270 |
if(j != 64) { |
if(j != 64) { |
271 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
272 |
} else { |
} else { |
273 |
vlc += 64*511; |
vlc += 64 * 4095; |
274 |
BitstreamPutBits(bs, vlc->code, vlc->len); |
BitstreamPutBits(bs, vlc->code, vlc->len); |
275 |
break; |
break; |
276 |
} |
} |
277 |
} while(1); |
} while(1); |
|
} |
|
278 |
|
|
279 |
|
} |
280 |
|
|
281 |
static void CodeBlockIntra(const MBParam * pParam, const MACROBLOCK *pMB, |
/***************************************************************************** |
282 |
int16_t qcoeff[][64], Bitstream * bs, Statistics * pStat) |
* Local functions |
283 |
|
****************************************************************************/ |
284 |
|
|
285 |
|
static void |
286 |
|
CodeBlockIntra(const FRAMEINFO * frame, |
287 |
|
const MACROBLOCK * pMB, |
288 |
|
int16_t qcoeff[6 * 64], |
289 |
|
Bitstream * bs, |
290 |
|
Statistics * pStat) |
291 |
{ |
{ |
292 |
|
|
293 |
uint32_t i, mcbpc, cbpy, bits; |
uint32_t i, mcbpc, cbpy, bits; |
294 |
|
|
295 |
cbpy = pMB->cbp >> 2; |
cbpy = pMB->cbp >> 2; |
296 |
|
|
297 |
// write mcbpc |
// write mcbpc |
298 |
if(pParam->coding_type == I_VOP) { |
if (frame->coding_type == I_VOP) { |
299 |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
300 |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, mcbpc_intra_tab[mcbpc].len); |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
301 |
} |
mcbpc_intra_tab[mcbpc].len); |
302 |
else { |
} else { |
303 |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
304 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, mcbpc_inter_tab[mcbpc].len); |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
305 |
|
mcbpc_inter_tab[mcbpc].len); |
306 |
} |
} |
307 |
|
|
308 |
// ac prediction flag |
// ac prediction flag |
318 |
if(pMB->mode == MODE_INTRA_Q) |
if(pMB->mode == MODE_INTRA_Q) |
319 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
320 |
|
|
321 |
|
// write interlacing |
322 |
|
if (frame->global_flags & XVID_INTERLACING) { |
323 |
|
BitstreamPutBit(bs, pMB->field_dct); |
324 |
|
} |
325 |
// code block coeffs |
// code block coeffs |
326 |
for(i = 0; i < 6; i++) |
for (i = 0; i < 6; i++) { |
|
{ |
|
327 |
if(i < 4) |
if(i < 4) |
328 |
BitstreamPutBits(bs, dcy_tab[qcoeff[i][0] + 255].code, |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
329 |
dcy_tab[qcoeff[i][0] + 255].len); |
dcy_tab[qcoeff[i * 64 + 0] + 255].len); |
330 |
else |
else |
331 |
BitstreamPutBits(bs, dcc_tab[qcoeff[i][0] + 255].code, |
BitstreamPutBits(bs, dcc_tab[qcoeff[i * 64 + 0] + 255].code, |
332 |
dcc_tab[qcoeff[i][0] + 255].len); |
dcc_tab[qcoeff[i * 64 + 0] + 255].len); |
333 |
|
|
334 |
if(pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) { |
|
{ |
|
335 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
336 |
|
|
337 |
CodeCoeff(bs, qcoeff[i], intra_table, scan_tables[pMB->acpred_directions[i]], 1); |
CodeCoeff(bs, &qcoeff[i * 64], intra_table, |
338 |
|
scan_tables[pMB->acpred_directions[i]], 1); |
339 |
|
|
340 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
341 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
342 |
} |
} |
343 |
} |
} |
344 |
|
|
345 |
} |
} |
346 |
|
|
347 |
|
|
348 |
static void CodeBlockInter(const MBParam * pParam, const MACROBLOCK *pMB, |
static void |
349 |
int16_t qcoeff[][64], Bitstream * bs, Statistics * pStat) |
CodeBlockInter(const FRAMEINFO * frame, |
350 |
|
const MACROBLOCK * pMB, |
351 |
|
int16_t qcoeff[6 * 64], |
352 |
|
Bitstream * bs, |
353 |
|
Statistics * pStat) |
354 |
{ |
{ |
355 |
|
|
356 |
int32_t i; |
int32_t i; |
357 |
uint32_t bits, mcbpc, cbpy; |
uint32_t bits, mcbpc, cbpy; |
358 |
|
|
360 |
cbpy = 15 - (pMB->cbp >> 2); |
cbpy = 15 - (pMB->cbp >> 2); |
361 |
|
|
362 |
// write mcbpc |
// write mcbpc |
363 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, mcbpc_inter_tab[mcbpc].len); |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
364 |
|
mcbpc_inter_tab[mcbpc].len); |
365 |
|
|
366 |
// write cbpy |
// write cbpy |
367 |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, cbpy_tab[cbpy].code, cbpy_tab[cbpy].len); |
370 |
if(pMB->mode == MODE_INTER_Q) |
if(pMB->mode == MODE_INTER_Q) |
371 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, pMB->dquant, 2); |
372 |
|
|
373 |
|
// interlacing |
374 |
|
if (frame->global_flags & XVID_INTERLACING) { |
375 |
|
if (pMB->cbp) { |
376 |
|
BitstreamPutBit(bs, pMB->field_dct); |
377 |
|
DEBUG1("codep: field_dct: ", pMB->field_dct); |
378 |
|
} |
379 |
|
|
380 |
|
// if inter block, write field ME flag |
381 |
|
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
382 |
|
BitstreamPutBit(bs, pMB->field_pred); |
383 |
|
DEBUG1("codep: field_pred: ", pMB->field_pred); |
384 |
|
|
385 |
|
// write field prediction references |
386 |
|
if (pMB->field_pred) { |
387 |
|
BitstreamPutBit(bs, pMB->field_for_top); |
388 |
|
BitstreamPutBit(bs, pMB->field_for_bot); |
389 |
|
} |
390 |
|
} |
391 |
|
} |
392 |
// code motion vector(s) |
// code motion vector(s) |
393 |
for(i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
394 |
{ |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
395 |
CodeVector(bs, pMB->pmvs[i].x, pParam->fixed_code, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
|
CodeVector(bs, pMB->pmvs[i].y, pParam->fixed_code, pStat); |
|
396 |
} |
} |
397 |
|
|
398 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
400 |
// code block coeffs |
// code block coeffs |
401 |
for(i = 0; i < 6; i++) |
for(i = 0; i < 6; i++) |
402 |
if(pMB->cbp & (1 << (5 - i))) |
if(pMB->cbp & (1 << (5 - i))) |
403 |
CodeCoeff(bs, qcoeff[i], inter_table, scan_tables[0], 0); |
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
404 |
|
|
405 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
406 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
|
} |
|
407 |
|
|
408 |
|
} |
409 |
|
|
410 |
void MBCoding(const MBParam * pParam, MACROBLOCK *pMB, |
/***************************************************************************** |
411 |
int16_t qcoeff[][64], |
* Macro Block bitstream encoding functions |
412 |
Bitstream * bs, Statistics * pStat) |
****************************************************************************/ |
413 |
|
|
414 |
|
void |
415 |
|
MBCoding(const FRAMEINFO * frame, |
416 |
|
MACROBLOCK * pMB, |
417 |
|
int16_t qcoeff[6 * 64], |
418 |
|
Bitstream * bs, |
419 |
|
Statistics * pStat) |
420 |
{ |
{ |
|
int intra = (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q); |
|
421 |
|
|
422 |
if(pParam->coding_type == P_VOP) { |
if (frame->coding_type == P_VOP) { |
423 |
if(pMB->cbp == 0 && pMB->mode == MODE_INTER && |
BitstreamPutBit(bs, 0); // coded |
424 |
pMB->mvs[0].x == 0 && pMB->mvs[0].y == 0) |
} |
425 |
|
|
426 |
|
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
427 |
|
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
428 |
|
else |
429 |
|
CodeBlockInter(frame, pMB, qcoeff, bs, pStat); |
430 |
|
|
431 |
|
} |
432 |
|
|
433 |
|
|
434 |
|
void |
435 |
|
MBSkip(Bitstream * bs) |
436 |
{ |
{ |
437 |
BitstreamPutBit(bs, 1); // not_coded |
BitstreamPutBit(bs, 1); // not coded |
438 |
return; |
return; |
439 |
} |
} |
440 |
else |
|
441 |
BitstreamPutBit(bs, 0); // coded |
/***************************************************************************** |
442 |
|
* decoding stuff starts here |
443 |
|
****************************************************************************/ |
444 |
|
|
445 |
|
/* |
446 |
|
* For IVOP addbits == 0 |
447 |
|
* For PVOP addbits == fcode - 1 |
448 |
|
* For BVOP addbits == max(fcode,bcode) - 1 |
449 |
|
* returns true or false |
450 |
|
*/ |
451 |
|
|
452 |
|
int |
453 |
|
check_resync_marker(Bitstream * bs, int addbits) |
454 |
|
{ |
455 |
|
uint32_t nbits; |
456 |
|
uint32_t code; |
457 |
|
uint32_t nbitsresyncmarker = NUMBITS_VP_RESYNC_MARKER + addbits; |
458 |
|
|
459 |
|
nbits = BitstreamNumBitsToByteAlign(bs); |
460 |
|
code = BitstreamShowBits(bs, nbits); |
461 |
|
|
462 |
|
if (code == (((uint32_t)1 << (nbits - 1)) - 1)) |
463 |
|
{ |
464 |
|
return BitstreamShowBitsFromByteAlign(bs, nbitsresyncmarker) == RESYNC_MARKER; |
465 |
} |
} |
466 |
|
|
467 |
if(intra) |
return 0; |
|
CodeBlockIntra(pParam, pMB, qcoeff, bs, pStat); |
|
|
else |
|
|
CodeBlockInter(pParam, pMB, qcoeff, bs, pStat); |
|
468 |
} |
} |
469 |
|
|
470 |
|
|
|
/*************************************************************** |
|
|
* decoding stuff starts here * |
|
|
***************************************************************/ |
|
471 |
|
|
472 |
int get_mcbpc_intra(Bitstream * bs) |
int |
473 |
|
get_mcbpc_intra(Bitstream * bs) |
474 |
{ |
{ |
|
uint32_t index; |
|
475 |
|
|
476 |
while((index = BitstreamShowBits(bs, 9)) == 1) |
uint32_t index; |
|
BitstreamSkip(bs, 9); |
|
477 |
|
|
478 |
|
index = BitstreamShowBits(bs, 9); |
479 |
index >>= 3; |
index >>= 3; |
480 |
|
|
481 |
BitstreamSkip(bs, mcbpc_intra_table[index].len); |
BitstreamSkip(bs, mcbpc_intra_table[index].len); |
482 |
|
|
483 |
return mcbpc_intra_table[index].code; |
return mcbpc_intra_table[index].code; |
484 |
|
|
485 |
} |
} |
486 |
|
|
487 |
int get_mcbpc_inter(Bitstream * bs) |
int |
488 |
|
get_mcbpc_inter(Bitstream * bs) |
489 |
{ |
{ |
490 |
|
|
491 |
uint32_t index; |
uint32_t index; |
492 |
|
|
493 |
while((index = CLIP(BitstreamShowBits(bs, 9), 256)) == 1) |
index = CLIP(BitstreamShowBits(bs, 9), 256); |
|
BitstreamSkip(bs, 9); |
|
494 |
|
|
495 |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
BitstreamSkip(bs, mcbpc_inter_table[index].len); |
496 |
|
|
497 |
return mcbpc_inter_table[index].code; |
return mcbpc_inter_table[index].code; |
498 |
|
|
499 |
} |
} |
500 |
|
|
501 |
int get_cbpy(Bitstream * bs, int intra) |
int |
502 |
|
get_cbpy(Bitstream * bs, |
503 |
|
int intra) |
504 |
{ |
{ |
505 |
|
|
506 |
int cbpy; |
int cbpy; |
507 |
uint32_t index = BitstreamShowBits(bs, 6); |
uint32_t index = BitstreamShowBits(bs, 6); |
508 |
|
|
513 |
cbpy = 15 - cbpy; |
cbpy = 15 - cbpy; |
514 |
|
|
515 |
return cbpy; |
return cbpy; |
516 |
|
|
517 |
} |
} |
518 |
|
|
519 |
int get_mv_data(Bitstream * bs) |
int |
520 |
|
get_mv_data(Bitstream * bs) |
521 |
{ |
{ |
522 |
|
|
523 |
uint32_t index; |
uint32_t index; |
524 |
|
|
525 |
if(BitstreamGetBit(bs)) |
if(BitstreamGetBit(bs)) |
527 |
|
|
528 |
index = BitstreamShowBits(bs, 12); |
index = BitstreamShowBits(bs, 12); |
529 |
|
|
530 |
if(index >= 512) |
if (index >= 512) { |
|
{ |
|
531 |
index = (index >> 8) - 2; |
index = (index >> 8) - 2; |
532 |
BitstreamSkip(bs, TMNMVtab0[index].len); |
BitstreamSkip(bs, TMNMVtab0[index].len); |
533 |
return TMNMVtab0[index].code; |
return TMNMVtab0[index].code; |
534 |
} |
} |
535 |
|
|
536 |
if(index >= 128) |
if (index >= 128) { |
|
{ |
|
537 |
index = (index >> 2) - 32; |
index = (index >> 2) - 32; |
538 |
BitstreamSkip(bs, TMNMVtab1[index].len); |
BitstreamSkip(bs, TMNMVtab1[index].len); |
539 |
return TMNMVtab1[index].code; |
return TMNMVtab1[index].code; |
543 |
|
|
544 |
BitstreamSkip(bs, TMNMVtab2[index].len); |
BitstreamSkip(bs, TMNMVtab2[index].len); |
545 |
return TMNMVtab2[index].code; |
return TMNMVtab2[index].code; |
546 |
|
|
547 |
} |
} |
548 |
|
|
549 |
int get_mv(Bitstream * bs, int fcode) |
int |
550 |
|
get_mv(Bitstream * bs, |
551 |
|
int fcode) |
552 |
{ |
{ |
553 |
|
|
554 |
int data; |
int data; |
555 |
int res; |
int res; |
556 |
int mv; |
int mv; |
565 |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
566 |
|
|
567 |
return data < 0 ? -mv : mv; |
return data < 0 ? -mv : mv; |
568 |
|
|
569 |
} |
} |
570 |
|
|
571 |
int get_dc_dif(Bitstream * bs, uint32_t dc_size) |
int |
572 |
|
get_dc_dif(Bitstream * bs, |
573 |
|
uint32_t dc_size) |
574 |
{ |
{ |
575 |
|
|
576 |
int code = BitstreamGetBits(bs, dc_size); |
int code = BitstreamGetBits(bs, dc_size); |
577 |
int msb = code >> (dc_size - 1); |
int msb = code >> (dc_size - 1); |
578 |
|
|
580 |
return (-1 * (code^((1 << dc_size) - 1))); |
return (-1 * (code^((1 << dc_size) - 1))); |
581 |
|
|
582 |
return code; |
return code; |
583 |
|
|
584 |
} |
} |
585 |
|
|
586 |
int get_dc_size_lum(Bitstream * bs) |
int |
587 |
|
get_dc_size_lum(Bitstream * bs) |
588 |
{ |
{ |
589 |
|
|
590 |
int code, i; |
int code, i; |
591 |
|
|
592 |
code = BitstreamShowBits(bs, 11); |
code = BitstreamShowBits(bs, 11); |
593 |
|
|
594 |
for(i = 11; i > 3; i--) { |
for(i = 11; i > 3; i--) { |
601 |
|
|
602 |
BitstreamSkip(bs, dc_lum_tab[code].len); |
BitstreamSkip(bs, dc_lum_tab[code].len); |
603 |
return dc_lum_tab[code].code; |
return dc_lum_tab[code].code; |
604 |
|
|
605 |
} |
} |
606 |
|
|
607 |
|
|
608 |
int get_dc_size_chrom(Bitstream * bs) |
int |
609 |
|
get_dc_size_chrom(Bitstream * bs) |
610 |
{ |
{ |
611 |
|
|
612 |
uint32_t code, i; |
uint32_t code, i; |
613 |
|
|
614 |
code = BitstreamShowBits(bs, 12); |
code = BitstreamShowBits(bs, 12); |
615 |
|
|
616 |
for(i = 12; i > 2; i--) { |
for(i = 12; i > 2; i--) { |
622 |
} |
} |
623 |
|
|
624 |
return 3 - BitstreamGetBits(bs, 2); |
return 3 - BitstreamGetBits(bs, 2); |
625 |
|
|
626 |
} |
} |
627 |
|
|
628 |
int get_coeff(Bitstream * bs, int *run, int *last, int intra, int short_video_header) |
/***************************************************************************** |
629 |
|
* Local inlined function to "decode" written vlc codes |
630 |
|
****************************************************************************/ |
631 |
|
|
632 |
|
static __inline int |
633 |
|
get_coeff(Bitstream * bs, |
634 |
|
int *run, |
635 |
|
int *last, |
636 |
|
int intra, |
637 |
|
int short_video_header) |
638 |
{ |
{ |
639 |
|
|
640 |
uint32_t mode; |
uint32_t mode; |
641 |
const VLC *tab; |
const VLC *tab; |
642 |
int32_t level; |
int32_t level; |
652 |
BitstreamSkip(bs, tab->len); |
BitstreamSkip(bs, tab->len); |
653 |
|
|
654 |
if(tab->code != ESCAPE) { |
if(tab->code != ESCAPE) { |
655 |
if(!intra) |
if (!intra) { |
|
{ |
|
656 |
*run = (tab->code >> 4) & 255; |
*run = (tab->code >> 4) & 255; |
657 |
level = tab->code & 15; |
level = tab->code & 15; |
658 |
*last = (tab->code >> 12) & 1; |
*last = (tab->code >> 12) & 1; |
659 |
} |
} else { |
|
else |
|
|
{ |
|
660 |
*run = (tab->code >> 8) & 255; |
*run = (tab->code >> 8) & 255; |
661 |
level = tab->code & 255; |
level = tab->code & 255; |
662 |
*last = (tab->code >> 16) & 1; |
*last = (tab->code >> 16) & 1; |
664 |
return BitstreamGetBit(bs) ? -level : level; |
return BitstreamGetBit(bs) ? -level : level; |
665 |
} |
} |
666 |
|
|
667 |
if(short_video_header) |
if (short_video_header) { |
|
{ |
|
668 |
// escape mode 4 - H.263 type, only used if short_video_header = 1 |
// escape mode 4 - H.263 type, only used if short_video_header = 1 |
669 |
*last = BitstreamGetBit(bs); |
*last = BitstreamGetBit(bs); |
670 |
*run = BitstreamGetBits(bs, 6); |
*run = BitstreamGetBits(bs, 6); |
691 |
*run = (tab->code >> 4) & 255; |
*run = (tab->code >> 4) & 255; |
692 |
level = tab->code & 15; |
level = tab->code & 15; |
693 |
*last = (tab->code >> 12) & 1; |
*last = (tab->code >> 12) & 1; |
694 |
} |
} else { |
|
else |
|
|
{ |
|
695 |
*run = (tab->code >> 8) & 255; |
*run = (tab->code >> 8) & 255; |
696 |
level = tab->code & 255; |
level = tab->code & 255; |
697 |
*last = (tab->code >> 16) & 1; |
*last = (tab->code >> 16) & 1; |
704 |
|
|
705 |
return BitstreamGetBit(bs) ? -level : level; |
return BitstreamGetBit(bs) ? -level : level; |
706 |
} |
} |
|
|
|
707 |
// third escape mode - fixed length codes |
// third escape mode - fixed length codes |
708 |
BitstreamSkip(bs, 2); |
BitstreamSkip(bs, 2); |
709 |
*last = BitstreamGetBits(bs, 1); |
*last = BitstreamGetBits(bs, 1); |
717 |
error: |
error: |
718 |
*run = VLC_ERROR; |
*run = VLC_ERROR; |
719 |
return 0; |
return 0; |
|
} |
|
720 |
|
|
721 |
|
} |
722 |
|
|
723 |
void get_intra_block(Bitstream * bs, int16_t * block, int direction, int coeff) |
/***************************************************************************** |
724 |
|
* MB reading functions |
725 |
|
****************************************************************************/ |
726 |
|
|
727 |
|
void |
728 |
|
get_intra_block(Bitstream * bs, |
729 |
|
int16_t * block, |
730 |
|
int direction, |
731 |
|
int coeff) |
732 |
{ |
{ |
733 |
|
|
734 |
const uint16_t * scan = scan_tables[ direction ]; |
const uint16_t * scan = scan_tables[ direction ]; |
735 |
int level; |
int level; |
736 |
int run; |
int run; |
737 |
int last; |
int last; |
738 |
|
|
739 |
do |
do { |
|
{ |
|
740 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
741 |
if (run == -1) |
if (run == -1) { |
|
{ |
|
742 |
DEBUG("fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
743 |
break; |
break; |
744 |
} |
} |
745 |
coeff += run; |
coeff += run; |
746 |
block[ scan[coeff] ] = level; |
block[ scan[coeff] ] = level; |
747 |
if (level < -127 || level > 127) |
|
748 |
{ |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
749 |
|
//DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[coeff], level, BitstreamShowBits(bs, 32)); |
750 |
|
|
751 |
|
if (level < -127 || level > 127) { |
752 |
DEBUG1("warning: intra_overflow", level); |
DEBUG1("warning: intra_overflow", level); |
753 |
} |
} |
754 |
coeff++; |
coeff++; |
755 |
} while (!last); |
} while (!last); |
756 |
|
|
757 |
} |
} |
758 |
|
|
759 |
void get_inter_block(Bitstream * bs, int16_t * block) |
void |
760 |
|
get_inter_block(Bitstream * bs, |
761 |
|
int16_t * block) |
762 |
{ |
{ |
763 |
|
|
764 |
const uint16_t * scan = scan_tables[0]; |
const uint16_t * scan = scan_tables[0]; |
765 |
int p; |
int p; |
766 |
int level; |
int level; |
768 |
int last; |
int last; |
769 |
|
|
770 |
p = 0; |
p = 0; |
771 |
do |
do { |
|
{ |
|
772 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
773 |
if (run == -1) |
if (run == -1) { |
|
{ |
|
774 |
DEBUG("fatal: invalid run"); |
DEBUG("fatal: invalid run"); |
775 |
break; |
break; |
776 |
} |
} |
777 |
p += run; |
p += run; |
778 |
|
|
779 |
block[ scan[p] ] = level; |
block[ scan[p] ] = level; |
780 |
if (level < -127 || level > 127) |
|
781 |
{ |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
782 |
|
// DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[p], level, BitstreamShowBits(bs, 32)); |
783 |
|
|
784 |
|
if (level < -127 || level > 127) { |
785 |
DEBUG1("warning: inter_overflow", level); |
DEBUG1("warning: inter_overflow", level); |
786 |
} |
} |
787 |
p++; |
p++; |
788 |
} while (!last); |
} while (!last); |
789 |
|
|
790 |
} |
} |