1 |
/****************************************************************************** |
/***************************************************************************** |
2 |
* * |
* |
3 |
* This file is part of XviD, a free MPEG-4 video encoder/decoder * |
* XVID MPEG-4 VIDEO CODEC |
4 |
* * |
* - MB coding - |
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 program is free software ; you can redistribute it and/or modify |
9 |
* would be at such party's own risk. The original developer of this * |
* it under the terms of the GNU General Public License as published by |
10 |
* software module and his/her company, and subsequent editors and their * |
* the Free Software Foundation ; either version 2 of the License, or |
11 |
* companies, will have no liability for use of this software or * |
* (at your option) any later version. |
12 |
* modifications or derivatives thereof. * |
* |
13 |
* * |
* This program is distributed in the hope that it will be useful, |
14 |
* XviD is free software; you can redistribute it and/or modify it * |
* but WITHOUT ANY WARRANTY ; without even the implied warranty of |
15 |
* under the terms of the GNU General Public License as published by * |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* the Free Software Foundation; either version 2 of the License, or * |
* GNU General Public License for more details. |
17 |
* (at your option) any later version. * |
* |
18 |
* * |
* You should have received a copy of the GNU General Public License |
19 |
* XviD is distributed in the hope that it will be useful, but * |
* along with this program ; if not, write to the Free Software |
20 |
* WITHOUT ANY WARRANTY; without even the implied warranty of * |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
21 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
* |
22 |
* GNU General Public License for more details. * |
* $Id$ |
23 |
* * |
* |
24 |
* You should have received a copy of the GNU General Public License * |
****************************************************************************/ |
|
* along with this program; if not, write to the Free Software * |
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * |
|
|
* * |
|
|
******************************************************************************/ |
|
|
|
|
|
/****************************************************************************** |
|
|
* * |
|
|
* mbcoding.c * |
|
|
* * |
|
|
* 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 * |
|
|
* * |
|
|
******************************************************************************/ |
|
|
|
|
25 |
|
|
26 |
#include <stdio.h> |
#include <stdio.h> |
27 |
#include <stdlib.h> |
#include <stdlib.h> |
28 |
|
#include <string.h> |
29 |
|
|
30 |
#include "../portab.h" |
#include "../portab.h" |
31 |
#include "../global.h" |
#include "../global.h" |
32 |
#include "bitstream.h" |
#include "bitstream.h" |
36 |
|
|
37 |
#include "../utils/mbfunctions.h" |
#include "../utils/mbfunctions.h" |
38 |
|
|
|
/* #define BIGLUT */ |
|
|
|
|
|
#ifdef BIGLUT |
|
|
#define LEVELOFFSET 2048 |
|
|
#else |
|
39 |
#define LEVELOFFSET 32 |
#define LEVELOFFSET 32 |
|
#endif |
|
40 |
|
|
41 |
|
/* Initialized once during xvid_global call |
42 |
|
* RO access is thread safe */ |
43 |
static REVERSE_EVENT DCT3D[2][4096]; |
static REVERSE_EVENT DCT3D[2][4096]; |
|
|
|
|
#ifdef BIGLUT |
|
|
static VLC coeff_VLC[2][2][4096][64]; |
|
|
VLC *intra_table; |
|
|
static VLC *inter_table; |
|
|
#else |
|
44 |
static VLC coeff_VLC[2][2][64][64]; |
static VLC coeff_VLC[2][2][64][64]; |
|
#endif |
|
45 |
|
|
46 |
/* not really MB related, but VLCs are only available here */ |
/* not really MB related, but VLCs are only available here */ |
47 |
void bs_put_spritetrajectory(Bitstream * bs, const int val) |
void bs_put_spritetrajectory(Bitstream * bs, const int val) |
51 |
const int code2 = sprite_trajectory_len[len].code; |
const int code2 = sprite_trajectory_len[len].code; |
52 |
const int len2 = sprite_trajectory_len[len].len; |
const int len2 = sprite_trajectory_len[len].len; |
53 |
|
|
54 |
// printf("GMC=%d Code/Len = %d / %d ",val, code,len); |
#if 0 |
55 |
// printf("Code2 / Len2 = %d / %d \n",code2,len2); |
printf("GMC=%d Code/Len = %d / %d ",val, code,len); |
56 |
|
printf("Code2 / Len2 = %d / %d \n",code2,len2); |
57 |
|
#endif |
58 |
|
|
59 |
BitstreamPutBits(bs, code2, len2); |
BitstreamPutBits(bs, code2, len2); |
60 |
if (len) BitstreamPutBits(bs, code, len); |
if (len) BitstreamPutBits(bs, code, len); |
80 |
uint32_t i, j, k, intra, last, run, run_esc, level, level_esc, escape, escape_len, offset; |
uint32_t i, j, k, intra, last, run, run_esc, level, level_esc, escape, escape_len, offset; |
81 |
int32_t l; |
int32_t l; |
82 |
|
|
|
#ifdef BIGLUT |
|
|
intra_table = coeff_VLC[1]; |
|
|
inter_table = coeff_VLC[0]; |
|
|
#endif |
|
|
|
|
|
|
|
83 |
for (intra = 0; intra < 2; intra++) |
for (intra = 0; intra < 2; intra++) |
84 |
for (i = 0; i < 4096; i++) |
for (i = 0; i < 4096; i++) |
85 |
DCT3D[intra][i].event.level = 0; |
DCT3D[intra][i].event.level = 0; |
86 |
|
|
87 |
for (intra = 0; intra < 2; intra++) |
for (intra = 0; intra < 2; intra++) { |
88 |
for (last = 0; last < 2; last++) |
for (last = 0; last < 2; last++) { |
89 |
{ |
for (run = 0; run < 63 + last; run++) { |
90 |
for (run = 0; run < 63 + last; run++) |
for (level = 0; level < (uint32_t)(32 << intra); level++) { |
|
for (level = 0; level < (uint32_t)(32 << intra); level++) |
|
|
{ |
|
|
#ifdef BIGLUT |
|
|
offset = LEVELOFFSET; |
|
|
#else |
|
91 |
offset = !intra * LEVELOFFSET; |
offset = !intra * LEVELOFFSET; |
|
#endif |
|
92 |
coeff_VLC[intra][last][level + offset][run].len = 128; |
coeff_VLC[intra][last][level + offset][run].len = 128; |
93 |
} |
} |
94 |
} |
} |
95 |
|
} |
96 |
|
} |
97 |
|
|
98 |
for (intra = 0; intra < 2; intra++) |
for (intra = 0; intra < 2; intra++) { |
99 |
for (i = 0; i < 102; i++) |
for (i = 0; i < 102; i++) { |
|
{ |
|
|
#ifdef BIGLUT |
|
|
offset = LEVELOFFSET; |
|
|
#else |
|
100 |
offset = !intra * LEVELOFFSET; |
offset = !intra * LEVELOFFSET; |
101 |
#endif |
|
102 |
for (j = 0; j < (uint32_t)(1 << (12 - coeff_tab[intra][i].vlc.len)); j++) |
for (j = 0; j < (uint32_t)(1 << (12 - coeff_tab[intra][i].vlc.len)); j++) { |
|
{ |
|
103 |
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].len = coeff_tab[intra][i].vlc.len; |
104 |
DCT3D[intra][(coeff_tab[intra][i].vlc.code << (12 - coeff_tab[intra][i].vlc.len)) | j].event = coeff_tab[intra][i].event; |
DCT3D[intra][(coeff_tab[intra][i].vlc.code << (12 - coeff_tab[intra][i].vlc.len)) | j].event = coeff_tab[intra][i].event; |
105 |
} |
} |
108 |
= coeff_tab[intra][i].vlc.code << 1; |
= coeff_tab[intra][i].vlc.code << 1; |
109 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].len |
coeff_VLC[intra][coeff_tab[intra][i].event.last][coeff_tab[intra][i].event.level + offset][coeff_tab[intra][i].event.run].len |
110 |
= coeff_tab[intra][i].vlc.len + 1; |
= coeff_tab[intra][i].vlc.len + 1; |
111 |
#ifndef BIGLUT |
|
112 |
if (!intra) |
if (!intra) { |
|
#endif |
|
|
{ |
|
113 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].code |
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].code |
114 |
= (coeff_tab[intra][i].vlc.code << 1) | 1; |
= (coeff_tab[intra][i].vlc.code << 1) | 1; |
115 |
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].len |
coeff_VLC[intra][coeff_tab[intra][i].event.last][offset - coeff_tab[intra][i].event.level][coeff_tab[intra][i].event.run].len |
116 |
= coeff_tab[intra][i].vlc.len + 1; |
= coeff_tab[intra][i].vlc.len + 1; |
117 |
} |
} |
118 |
} |
} |
119 |
|
} |
120 |
|
|
121 |
|
for (intra = 0; intra < 2; intra++) { |
122 |
|
for (last = 0; last < 2; last++) { |
123 |
|
for (run = 0; run < 63 + last; run++) { |
124 |
|
for (level = 1; level < (uint32_t)(32 << intra); level++) { |
125 |
|
|
|
for (intra = 0; intra < 2; intra++) |
|
|
for (last = 0; last < 2; last++) |
|
|
for (run = 0; run < 63 + last; run++) |
|
|
{ |
|
|
for (level = 1; level < (uint32_t)(32 << intra); level++) |
|
|
{ |
|
126 |
if (level <= max_level[intra][last][run] && run <= max_run[intra][last][level]) |
if (level <= max_level[intra][last][run] && run <= max_run[intra][last][level]) |
127 |
continue; |
continue; |
128 |
|
|
|
#ifdef BIGLUT |
|
|
offset = LEVELOFFSET; |
|
|
#else |
|
129 |
offset = !intra * LEVELOFFSET; |
offset = !intra * LEVELOFFSET; |
|
#endif |
|
130 |
level_esc = level - max_level[intra][last][run]; |
level_esc = level - max_level[intra][last][run]; |
131 |
run_esc = run - 1 - max_run[intra][last][level]; |
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))*/ |
|
132 |
|
|
133 |
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc]) |
if (level_esc <= max_level[intra][last][run] && run <= max_run[intra][last][level_esc]) { |
|
{ |
|
134 |
escape = ESCAPE1; |
escape = ESCAPE1; |
135 |
escape_len = 7 + 1; |
escape_len = 7 + 1; |
136 |
run_esc = run; |
run_esc = run; |
137 |
} |
} else { |
138 |
else |
if (run_esc <= max_run[intra][last][level] && level <= max_level[intra][last][run_esc]) { |
|
{ |
|
|
if (run_esc <= max_run[intra][last][level] && level <= max_level[intra][last][run_esc]) |
|
|
{ |
|
139 |
escape = ESCAPE2; |
escape = ESCAPE2; |
140 |
escape_len = 7 + 2; |
escape_len = 7 + 2; |
141 |
level_esc = level; |
level_esc = level; |
142 |
} |
} else { |
143 |
else |
if (!intra) { |
|
{ |
|
|
#ifndef BIGLUT |
|
|
if (!intra) |
|
|
#endif |
|
|
{ |
|
144 |
coeff_VLC[intra][last][level + offset][run].code |
coeff_VLC[intra][last][level + offset][run].code |
145 |
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
146 |
coeff_VLC[intra][last][level + offset][run].len = 30; |
coeff_VLC[intra][last][level + offset][run].len = 30; |
157 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code; |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code; |
158 |
coeff_VLC[intra][last][level + offset][run].len |
coeff_VLC[intra][last][level + offset][run].len |
159 |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
= coeff_VLC[intra][last][level_esc + offset][run_esc].len + escape_len; |
160 |
#ifndef BIGLUT |
|
161 |
if (!intra) |
if (!intra) { |
|
#endif |
|
|
{ |
|
162 |
coeff_VLC[intra][last][offset - level][run].code |
coeff_VLC[intra][last][offset - level][run].code |
163 |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
= (escape << coeff_VLC[intra][last][level_esc + offset][run_esc].len) |
164 |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code | 1; |
| coeff_VLC[intra][last][level_esc + offset][run_esc].code | 1; |
167 |
} |
} |
168 |
} |
} |
169 |
|
|
170 |
#ifdef BIGLUT |
if (!intra) { |
|
for (level = 32 << intra; level < 2048; level++) |
|
|
{ |
|
|
coeff_VLC[intra][last][level + offset][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((level & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][level + offset][run].len = 30; |
|
|
|
|
|
coeff_VLC[intra][last][offset - level][run].code |
|
|
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-level & 0xfff) << 1) | 1; |
|
|
coeff_VLC[intra][last][offset - level][run].len = 30; |
|
|
} |
|
|
#else |
|
|
if (!intra) |
|
|
{ |
|
171 |
coeff_VLC[intra][last][0][run].code |
coeff_VLC[intra][last][0][run].code |
172 |
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-32 & 0xfff) << 1) | 1; |
= (ESCAPE3 << 21) | (last << 20) | (run << 14) | (1 << 13) | ((-32 & 0xfff) << 1) | 1; |
173 |
coeff_VLC[intra][last][0][run].len = 30; |
coeff_VLC[intra][last][0][run].len = 30; |
174 |
} |
} |
|
#endif |
|
175 |
} |
} |
176 |
/* init sprite_trajectory tables */ |
} |
177 |
/* even if GMC is not specified (it might be used later...) */ |
} |
178 |
|
|
179 |
|
/* init sprite_trajectory tables |
180 |
|
* even if GMC is not specified (it might be used later...) */ |
181 |
|
|
182 |
sprite_trajectory_code[0+16384].code = 0; |
sprite_trajectory_code[0+16384].code = 0; |
183 |
sprite_trajectory_code[0+16384].len = 0; |
sprite_trajectory_code[0+16384].len = 0; |
184 |
for (k=0;k<14;k++) |
for (k=0;k<14;k++) { |
|
{ |
|
185 |
int limit = (1<<k); |
int limit = (1<<k); |
186 |
|
|
187 |
for (l=-(2*limit-1); l <= -limit; l++) |
for (l=-(2*limit-1); l <= -limit; l++) { |
|
{ |
|
188 |
sprite_trajectory_code[l+16384].code = (2*limit-1)+l; |
sprite_trajectory_code[l+16384].code = (2*limit-1)+l; |
189 |
sprite_trajectory_code[l+16384].len = k+1; |
sprite_trajectory_code[l+16384].len = k+1; |
190 |
} |
} |
191 |
|
|
192 |
for (l=limit; l<= 2*limit-1; l++) |
for (l=limit; l<= 2*limit-1; l++) { |
|
{ |
|
193 |
sprite_trajectory_code[l+16384].code = l; |
sprite_trajectory_code[l+16384].code = l; |
194 |
sprite_trajectory_code[l+16384].len = k+1; |
sprite_trajectory_code[l+16384].len = k+1; |
195 |
} |
} |
199 |
static __inline void |
static __inline void |
200 |
CodeVector(Bitstream * bs, |
CodeVector(Bitstream * bs, |
201 |
int32_t value, |
int32_t value, |
202 |
int32_t f_code, |
int32_t f_code) |
|
Statistics * pStat) |
|
203 |
{ |
{ |
204 |
|
|
205 |
const int scale_factor = 1 << (f_code - 1); |
const int scale_factor = 1 << (f_code - 1); |
211 |
if (value > (cmp - 1)) |
if (value > (cmp - 1)) |
212 |
value -= 64 * scale_factor; |
value -= 64 * scale_factor; |
213 |
|
|
|
pStat->iMvSum += value * value; |
|
|
pStat->iMvCount++; |
|
|
|
|
214 |
if (value == 0) { |
if (value == 0) { |
215 |
BitstreamPutBits(bs, mb_motion_table[32].code, |
BitstreamPutBits(bs, mb_motion_table[32].code, |
216 |
mb_motion_table[32].len); |
mb_motion_table[32].len); |
247 |
|
|
248 |
} |
} |
249 |
|
|
|
#ifdef BIGLUT |
|
|
|
|
|
static __inline void |
|
|
CodeCoeff(Bitstream * bs, |
|
|
const int16_t qcoeff[64], |
|
|
VLC * table, |
|
|
const uint16_t * zigzag, |
|
|
uint16_t intra) |
|
|
{ |
|
|
|
|
|
uint32_t j, last; |
|
|
short v; |
|
|
VLC *vlc; |
|
|
|
|
|
j = intra; |
|
|
last = intra; |
|
|
|
|
|
while (j < 64 && (v = qcoeff[zigzag[j]]) == 0) |
|
|
j++; |
|
|
|
|
|
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) { |
|
|
BitstreamPutBits(bs, vlc->code, vlc->len); |
|
|
} else { |
|
|
vlc += 64 * 4096; |
|
|
BitstreamPutBits(bs, vlc->code, vlc->len); |
|
|
break; |
|
|
} |
|
|
} while (1); |
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/* returns the number of bits required to encode qcoeff */ |
|
|
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 |
|
|
|
|
250 |
static __inline void |
static __inline void |
251 |
CodeCoeffInter(Bitstream * bs, |
CodeCoeffInter(Bitstream * bs, |
252 |
const int16_t qcoeff[64], |
const int16_t qcoeff[64], |
325 |
{ |
{ |
326 |
if ((level = qcoeff[zigzag[i++]]) != 0) |
if ((level = qcoeff[zigzag[i++]]) != 0) |
327 |
{ |
{ |
328 |
abs_level = ABS(prev_level); |
abs_level = abs(prev_level); |
329 |
abs_level = abs_level < 64 ? abs_level : 0; |
abs_level = abs_level < 64 ? abs_level : 0; |
330 |
code = coeff_VLC[1][0][abs_level][prev_run].code; |
code = coeff_VLC[1][0][abs_level][prev_run].code; |
331 |
len = coeff_VLC[1][0][abs_level][prev_run].len; |
len = coeff_VLC[1][0][abs_level][prev_run].len; |
345 |
run++; |
run++; |
346 |
} |
} |
347 |
|
|
348 |
abs_level = ABS(prev_level); |
abs_level = abs(prev_level); |
349 |
abs_level = abs_level < 64 ? abs_level : 0; |
abs_level = abs_level < 64 ? abs_level : 0; |
350 |
code = coeff_VLC[1][1][abs_level][prev_run].code; |
code = coeff_VLC[1][1][abs_level][prev_run].code; |
351 |
len = coeff_VLC[1][1][abs_level][prev_run].len; |
len = coeff_VLC[1][1][abs_level][prev_run].len; |
386 |
{ |
{ |
387 |
if ((level = qcoeff[zigzag[i++]]) != 0) |
if ((level = qcoeff[zigzag[i++]]) != 0) |
388 |
{ |
{ |
389 |
abs_level = ABS(prev_level); |
abs_level = abs(prev_level); |
390 |
abs_level = abs_level < 64 ? abs_level : 0; |
abs_level = abs_level < 64 ? abs_level : 0; |
391 |
len = coeff_VLC[1][0][abs_level][prev_run].len; |
len = coeff_VLC[1][0][abs_level][prev_run].len; |
392 |
bits += len!=128 ? len : 30; |
bits += len!=128 ? len : 30; |
399 |
run++; |
run++; |
400 |
} |
} |
401 |
|
|
402 |
abs_level = ABS(prev_level); |
abs_level = abs(prev_level); |
403 |
abs_level = abs_level < 64 ? abs_level : 0; |
abs_level = abs_level < 64 ? abs_level : 0; |
404 |
len = coeff_VLC[1][1][abs_level][prev_run].len; |
len = coeff_VLC[1][1][abs_level][prev_run].len; |
405 |
bits += len!=128 ? len : 30; |
bits += len!=128 ? len : 30; |
451 |
return bits; |
return bits; |
452 |
} |
} |
453 |
|
|
454 |
|
static const int iDQtab[5] = { |
455 |
|
1, 0, -1 /* no change */, 2, 3 |
456 |
|
}; |
457 |
|
#define DQ_VALUE2INDEX(value) iDQtab[(value)+2] |
458 |
|
|
|
#endif |
|
459 |
|
|
460 |
static __inline void |
static __inline void |
461 |
CodeBlockIntra(const FRAMEINFO * const frame, |
CodeBlockIntra(const FRAMEINFO * const frame, |
469 |
|
|
470 |
cbpy = pMB->cbp >> 2; |
cbpy = pMB->cbp >> 2; |
471 |
|
|
472 |
// write mcbpc |
/* write mcbpc */ |
473 |
if (frame->coding_type == I_VOP) { |
if (frame->coding_type == I_VOP) { |
474 |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
mcbpc = ((pMB->mode >> 1) & 3) | ((pMB->cbp & 3) << 2); |
475 |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
BitstreamPutBits(bs, mcbpc_intra_tab[mcbpc].code, |
480 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
481 |
} |
} |
482 |
|
|
483 |
// ac prediction flag |
/* ac prediction flag */ |
484 |
if (pMB->acpred_directions[0]) |
if (pMB->acpred_directions[0]) |
485 |
BitstreamPutBits(bs, 1, 1); |
BitstreamPutBits(bs, 1, 1); |
486 |
else |
else |
487 |
BitstreamPutBits(bs, 0, 1); |
BitstreamPutBits(bs, 0, 1); |
488 |
|
|
489 |
// write cbpy |
/* write cbpy */ |
490 |
BitstreamPutBits(bs, xvid_cbpy_tab[cbpy].code, xvid_cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, xvid_cbpy_tab[cbpy].code, xvid_cbpy_tab[cbpy].len); |
491 |
|
|
492 |
// write dquant |
/* write dquant */ |
493 |
if (pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA_Q) |
494 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, DQ_VALUE2INDEX(pMB->dquant), 2); |
495 |
|
|
496 |
// write interlacing |
/* write interlacing */ |
497 |
if (frame->global_flags & XVID_INTERLACING) { |
if (frame->vol_flags & XVID_VOL_INTERLACING) { |
498 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
499 |
} |
} |
500 |
// code block coeffs |
/* code block coeffs */ |
501 |
for (i = 0; i < 6; i++) { |
for (i = 0; i < 6; i++) { |
502 |
if (i < 4) |
if (i < 4) |
503 |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
BitstreamPutBits(bs, dcy_tab[qcoeff[i * 64 + 0] + 255].code, |
508 |
|
|
509 |
if (pMB->cbp & (1 << (5 - i))) { |
if (pMB->cbp & (1 << (5 - i))) { |
510 |
const uint16_t *scan_table = |
const uint16_t *scan_table = |
511 |
frame->global_flags & XVID_ALTERNATESCAN ? |
frame->vop_flags & XVID_VOP_ALTERNATESCAN ? |
512 |
scan_tables[2] : scan_tables[pMB->acpred_directions[i]]; |
scan_tables[2] : scan_tables[pMB->acpred_directions[i]]; |
513 |
|
|
514 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
515 |
|
|
|
#ifdef BIGLUT |
|
|
CodeCoeff(bs, &qcoeff[i * 64], intra_table, scan_table, 1); |
|
|
#else |
|
516 |
CodeCoeffIntra(bs, &qcoeff[i * 64], scan_table); |
CodeCoeffIntra(bs, &qcoeff[i * 64], scan_table); |
|
#endif |
|
517 |
|
|
518 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
519 |
pStat->iTextBits += bits; |
pStat->iTextBits += bits; |
537 |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
mcbpc = (pMB->mode & 7) | ((pMB->cbp & 3) << 3); |
538 |
cbpy = 15 - (pMB->cbp >> 2); |
cbpy = 15 - (pMB->cbp >> 2); |
539 |
|
|
540 |
// write mcbpc |
/* write mcbpc */ |
541 |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
BitstreamPutBits(bs, mcbpc_inter_tab[mcbpc].code, |
542 |
mcbpc_inter_tab[mcbpc].len); |
mcbpc_inter_tab[mcbpc].len); |
543 |
|
|
544 |
if ( (frame->coding_type == S_VOP) && (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) ) |
if ( (frame->coding_type == S_VOP) && (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) ) |
545 |
BitstreamPutBit(bs, pMB->mcsel); // mcsel: '0'=local motion, '1'=GMC |
BitstreamPutBit(bs, pMB->mcsel); /* mcsel: '0'=local motion, '1'=GMC */ |
546 |
|
|
547 |
// write cbpy |
/* write cbpy */ |
548 |
BitstreamPutBits(bs, xvid_cbpy_tab[cbpy].code, xvid_cbpy_tab[cbpy].len); |
BitstreamPutBits(bs, xvid_cbpy_tab[cbpy].code, xvid_cbpy_tab[cbpy].len); |
549 |
|
|
550 |
// write dquant |
/* write dquant */ |
551 |
if (pMB->mode == MODE_INTER_Q) |
if (pMB->mode == MODE_INTER_Q) |
552 |
BitstreamPutBits(bs, pMB->dquant, 2); |
BitstreamPutBits(bs, DQ_VALUE2INDEX(pMB->dquant), 2); |
553 |
|
|
554 |
// interlacing |
/* interlacing */ |
555 |
if (frame->global_flags & XVID_INTERLACING) { |
if (frame->vol_flags & XVID_VOL_INTERLACING) { |
556 |
if (pMB->cbp) { |
if (pMB->cbp) { |
557 |
BitstreamPutBit(bs, pMB->field_dct); |
BitstreamPutBit(bs, pMB->field_dct); |
558 |
DPRINTF(DPRINTF_MB,"codep: field_dct: %i", pMB->field_dct); |
DPRINTF(XVID_DEBUG_MB,"codep: field_dct: %i\n", pMB->field_dct); |
559 |
} |
} |
560 |
|
|
561 |
// if inter block, write field ME flag |
/* if inter block, write field ME flag */ |
562 |
if (pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) { |
if ((pMB->mode == MODE_INTER || pMB->mode == MODE_INTER_Q) && (pMB->mcsel == 0)) { |
563 |
BitstreamPutBit(bs, pMB->field_pred); |
BitstreamPutBit(bs, 0 /*pMB->field_pred*/); /* not implemented yet */ |
564 |
DPRINTF(DPRINTF_MB,"codep: field_pred: %i", pMB->field_pred); |
DPRINTF(XVID_DEBUG_MB,"codep: field_pred: %i\n", pMB->field_pred); |
565 |
|
|
566 |
// write field prediction references |
/* write field prediction references */ |
567 |
|
#if 0 /* Remove the #if once field_pred is supported */ |
568 |
if (pMB->field_pred) { |
if (pMB->field_pred) { |
569 |
BitstreamPutBit(bs, pMB->field_for_top); |
BitstreamPutBit(bs, pMB->field_for_top); |
570 |
BitstreamPutBit(bs, pMB->field_for_bot); |
BitstreamPutBit(bs, pMB->field_for_bot); |
571 |
} |
} |
572 |
|
#endif |
573 |
} |
} |
574 |
} |
} |
575 |
// code motion vector(s) if motion is local |
/* code motion vector(s) if motion is local */ |
576 |
if (!pMB->mcsel) |
if (!pMB->mcsel) |
577 |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
for (i = 0; i < (pMB->mode == MODE_INTER4V ? 4 : 1); i++) { |
578 |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].x, frame->fcode); |
579 |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode, pStat); |
CodeVector(bs, pMB->pmvs[i].y, frame->fcode); |
580 |
} |
} |
581 |
|
|
582 |
bits = BitstreamPos(bs); |
bits = BitstreamPos(bs); |
583 |
|
|
584 |
// code block coeffs |
/* code block coeffs */ |
585 |
for (i = 0; i < 6; i++) |
for (i = 0; i < 6; i++) |
586 |
if (pMB->cbp & (1 << (5 - i))) |
if (pMB->cbp & (1 << (5 - i))) { |
|
{ |
|
587 |
const uint16_t *scan_table = |
const uint16_t *scan_table = |
588 |
frame->global_flags & XVID_ALTERNATESCAN ? |
frame->vop_flags & XVID_VOP_ALTERNATESCAN ? |
589 |
scan_tables[2] : scan_tables[0]; |
scan_tables[2] : scan_tables[0]; |
590 |
|
|
|
#ifdef BIGLUT |
|
|
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_table, 0); |
|
|
#else |
|
591 |
CodeCoeffInter(bs, &qcoeff[i * 64], scan_table); |
CodeCoeffInter(bs, &qcoeff[i * 64], scan_table); |
|
#endif |
|
592 |
} |
} |
593 |
|
|
594 |
bits = BitstreamPos(bs) - bits; |
bits = BitstreamPos(bs) - bits; |
604 |
Statistics * pStat) |
Statistics * pStat) |
605 |
{ |
{ |
606 |
if (frame->coding_type != I_VOP) |
if (frame->coding_type != I_VOP) |
607 |
BitstreamPutBit(bs, 0); // not_coded |
BitstreamPutBit(bs, 0); /* not_coded */ |
608 |
|
|
609 |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
if (pMB->mode == MODE_INTRA || pMB->mode == MODE_INTRA_Q) |
610 |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
CodeBlockIntra(frame, pMB, qcoeff, bs, pStat); |
613 |
|
|
614 |
} |
} |
615 |
|
|
|
/* |
|
|
// moved to mbcoding.h so that in can be 'static __inline' |
|
|
void |
|
|
MBSkip(Bitstream * bs) |
|
|
{ |
|
|
BitstreamPutBit(bs, 1); // not coded |
|
|
} |
|
|
*/ |
|
|
|
|
616 |
/*************************************************************** |
/*************************************************************** |
617 |
* bframe encoding start |
* bframe encoding start |
618 |
***************************************************************/ |
***************************************************************/ |
669 |
BitstreamPutBit(bs, 1); |
BitstreamPutBit(bs, 1); |
670 |
return; |
return; |
671 |
|
|
672 |
default:; // invalid |
default:; /* invalid */ |
673 |
} |
} |
674 |
} |
} |
675 |
|
|
676 |
|
|
677 |
|
|
678 |
void |
void |
679 |
MBCodingBVOP(const MACROBLOCK * mb, |
MBCodingBVOP(const FRAMEINFO * const frame, |
680 |
|
const MACROBLOCK * mb, |
681 |
const int16_t qcoeff[6 * 64], |
const int16_t qcoeff[6 * 64], |
682 |
const int32_t fcode, |
const int32_t fcode, |
683 |
const int32_t bcode, |
const int32_t bcode, |
684 |
Bitstream * bs, |
Bitstream * bs, |
685 |
Statistics * pStat, |
Statistics * pStat) |
|
int direction) |
|
686 |
{ |
{ |
687 |
int vcode = fcode; |
int vcode = fcode; |
688 |
unsigned int i; |
unsigned int i; |
689 |
|
|
690 |
|
const uint16_t *scan_table = |
691 |
|
frame->vop_flags & XVID_VOP_ALTERNATESCAN ? |
692 |
|
scan_tables[2] : scan_tables[0]; |
693 |
|
int bits; |
694 |
|
|
695 |
|
|
696 |
/* ------------------------------------------------------------------ |
/* ------------------------------------------------------------------ |
697 |
when a block is skipped it is decoded DIRECT(0,0) |
when a block is skipped it is decoded DIRECT(0,0) |
698 |
hence is interpolated from forward & backward frames |
hence is interpolated from forward & backward frames |
699 |
------------------------------------------------------------------ */ |
------------------------------------------------------------------ */ |
700 |
|
|
701 |
if (mb->mode == MODE_DIRECT_NONE_MV) { |
if (mb->mode == MODE_DIRECT_NONE_MV) { |
702 |
BitstreamPutBit(bs, 1); // skipped |
BitstreamPutBit(bs, 1); /* skipped */ |
703 |
return; |
return; |
704 |
} |
} |
705 |
|
|
706 |
BitstreamPutBit(bs, 0); // not skipped |
BitstreamPutBit(bs, 0); /* not skipped */ |
707 |
|
|
708 |
if (mb->cbp == 0) { |
if (mb->cbp == 0) { |
709 |
BitstreamPutBit(bs, 1); // cbp == 0 |
BitstreamPutBit(bs, 1); /* cbp == 0 */ |
710 |
} else { |
} else { |
711 |
BitstreamPutBit(bs, 0); // cbp == xxx |
BitstreamPutBit(bs, 0); /* cbp == xxx */ |
712 |
} |
} |
713 |
|
|
714 |
put_bvop_mbtype(bs, mb->mode); |
put_bvop_mbtype(bs, mb->mode); |
718 |
} |
} |
719 |
|
|
720 |
if (mb->mode != MODE_DIRECT && mb->cbp != 0) { |
if (mb->mode != MODE_DIRECT && mb->cbp != 0) { |
721 |
put_bvop_dbquant(bs, 0); // todo: mb->dquant = 0 |
put_bvop_dbquant(bs, 0); /* todo: mb->dquant = 0 */ |
722 |
} |
} |
723 |
|
|
724 |
|
if (frame->vol_flags & XVID_VOL_INTERLACING) { |
725 |
|
if (mb->cbp) { |
726 |
|
BitstreamPutBit(bs, mb->field_dct); |
727 |
|
DPRINTF(XVID_DEBUG_MB,"codep: field_dct: %i\n", mb->field_dct); |
728 |
|
} |
729 |
|
|
730 |
|
/* if not direct block, write field ME flag */ |
731 |
|
if (mb->mode != MODE_DIRECT) { |
732 |
|
BitstreamPutBit(bs, 0 /*mb->field_pred*/); /* field ME not implemented */ |
733 |
|
|
734 |
|
/* write field prediction references */ |
735 |
|
#if 0 /* Remove the #if once field_pred is supported */ |
736 |
|
if (mb->field_pred) { |
737 |
|
BitstreamPutBit(bs, mb->field_for_top); |
738 |
|
BitstreamPutBit(bs, mb->field_for_bot); |
739 |
|
} |
740 |
|
#endif |
741 |
|
} |
742 |
|
} |
743 |
|
|
744 |
|
|
745 |
switch (mb->mode) { |
switch (mb->mode) { |
746 |
case MODE_INTERPOLATE: |
case MODE_INTERPOLATE: |
747 |
CodeVector(bs, mb->pmvs[1].x, vcode, pStat); //forward vector of interpolate mode |
CodeVector(bs, mb->pmvs[1].x, vcode); /* forward vector of interpolate mode */ |
748 |
CodeVector(bs, mb->pmvs[1].y, vcode, pStat); |
CodeVector(bs, mb->pmvs[1].y, vcode); |
749 |
case MODE_BACKWARD: |
case MODE_BACKWARD: |
750 |
vcode = bcode; |
vcode = bcode; |
751 |
case MODE_FORWARD: |
case MODE_FORWARD: |
752 |
CodeVector(bs, mb->pmvs[0].x, vcode, pStat); |
CodeVector(bs, mb->pmvs[0].x, vcode); |
753 |
CodeVector(bs, mb->pmvs[0].y, vcode, pStat); |
CodeVector(bs, mb->pmvs[0].y, vcode); |
754 |
break; |
break; |
755 |
case MODE_DIRECT: |
case MODE_DIRECT: |
756 |
CodeVector(bs, mb->pmvs[3].x, 1, pStat); // fcode is always 1 for delta vector |
CodeVector(bs, mb->pmvs[3].x, 1); /* fcode is always 1 for delta vector */ |
757 |
CodeVector(bs, mb->pmvs[3].y, 1, pStat); // prediction is always (0,0) |
CodeVector(bs, mb->pmvs[3].y, 1); /* prediction is always (0,0) */ |
758 |
default: break; |
default: break; |
759 |
} |
} |
760 |
|
|
761 |
|
bits = BitstreamPos(bs); |
762 |
for (i = 0; i < 6; i++) { |
for (i = 0; i < 6; i++) { |
763 |
if (mb->cbp & (1 << (5 - i))) { |
if (mb->cbp & (1 << (5 - i))) { |
764 |
#ifdef BIGLUT |
CodeCoeffInter(bs, &qcoeff[i * 64], scan_table); |
|
CodeCoeff(bs, &qcoeff[i * 64], inter_table, scan_tables[0], 0); |
|
|
#else |
|
|
CodeCoeffInter(bs, &qcoeff[i * 64], scan_tables[0]); |
|
|
#endif |
|
765 |
} |
} |
766 |
} |
} |
767 |
|
pStat->iTextBits += BitstreamPos(bs) - bits; |
768 |
} |
} |
769 |
|
|
770 |
|
|
774 |
***************************************************************/ |
***************************************************************/ |
775 |
|
|
776 |
|
|
777 |
// for IVOP addbits == 0 |
/* |
778 |
// for PVOP addbits == fcode - 1 |
* for IVOP addbits == 0 |
779 |
// for BVOP addbits == max(fcode,bcode) - 1 |
* for PVOP addbits == fcode - 1 |
780 |
// returns true or false |
* for BVOP addbits == max(fcode,bcode) - 1 |
781 |
|
* returns true or false |
782 |
|
*/ |
783 |
int |
int |
784 |
check_resync_marker(Bitstream * bs, int addbits) |
check_resync_marker(Bitstream * bs, int addbits) |
785 |
{ |
{ |
893 |
return data; |
return data; |
894 |
|
|
895 |
res = BitstreamGetBits(bs, fcode - 1); |
res = BitstreamGetBits(bs, fcode - 1); |
896 |
mv = ((ABS(data) - 1) * scale_fac) + res + 1; |
mv = ((abs(data) - 1) * scale_fac) + res + 1; |
897 |
|
|
898 |
return data < 0 ? -mv : mv; |
return data < 0 ? -mv : mv; |
899 |
|
|
956 |
|
|
957 |
} |
} |
958 |
|
|
959 |
|
#define GET_BITS(cache, n) ((cache)>>(32-(n))) |
960 |
|
|
961 |
static __inline int |
static __inline int |
962 |
get_coeff(Bitstream * bs, |
get_coeff(Bitstream * bs, |
963 |
int *run, |
int *run, |
970 |
int32_t level; |
int32_t level; |
971 |
REVERSE_EVENT *reverse_event; |
REVERSE_EVENT *reverse_event; |
972 |
|
|
973 |
|
uint32_t cache = BitstreamShowBits(bs, 32); |
974 |
|
|
975 |
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 */ |
976 |
intra = 0; |
intra = 0; |
977 |
|
|
978 |
if (BitstreamShowBits(bs, 7) != ESCAPE) { |
if (GET_BITS(cache, 7) != ESCAPE) { |
979 |
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
reverse_event = &DCT3D[intra][GET_BITS(cache, 12)]; |
980 |
|
|
981 |
if ((level = reverse_event->event.level) == 0) |
if ((level = reverse_event->event.level) == 0) |
982 |
goto error; |
goto error; |
984 |
*last = reverse_event->event.last; |
*last = reverse_event->event.last; |
985 |
*run = reverse_event->event.run; |
*run = reverse_event->event.run; |
986 |
|
|
987 |
BitstreamSkip(bs, reverse_event->len); |
/* Don't forget to update the bitstream position */ |
988 |
|
BitstreamSkip(bs, reverse_event->len+1); |
989 |
|
|
990 |
return BitstreamGetBits(bs, 1) ? -level : level; |
return (GET_BITS(cache, reverse_event->len+1)&0x01) ? -level : level; |
991 |
} |
} |
992 |
|
|
993 |
BitstreamSkip(bs, 7); |
/* flush 7bits of cache */ |
994 |
|
cache <<= 7; |
995 |
|
|
996 |
if (short_video_header) { |
if (short_video_header) { |
997 |
/* 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 */ |
998 |
*last = BitstreamGetBit(bs); |
*last = GET_BITS(cache, 1); |
999 |
*run = BitstreamGetBits(bs, 6); |
*run = (GET_BITS(cache, 7) &0x3f); |
1000 |
level = BitstreamGetBits(bs, 8); |
level = (GET_BITS(cache, 15)&0xff); |
1001 |
|
|
1002 |
if (level == 0 || level == 128) |
if (level == 0 || level == 128) |
1003 |
DPRINTF(DPRINTF_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d", level); |
DPRINTF(XVID_DEBUG_ERROR, "Illegal LEVEL for ESCAPE mode 4: %d\n", level); |
1004 |
|
|
1005 |
|
/* We've "eaten" 22 bits */ |
1006 |
|
BitstreamSkip(bs, 22); |
1007 |
|
|
1008 |
return (level << 24) >> 24; |
return (level << 24) >> 24; |
1009 |
} |
} |
1010 |
|
|
1011 |
mode = BitstreamShowBits(bs, 2); |
if ((mode = GET_BITS(cache, 2)) < 3) { |
1012 |
|
const int skip[3] = {1, 1, 2}; |
1013 |
|
cache <<= skip[mode]; |
1014 |
|
|
1015 |
if (mode < 3) { |
reverse_event = &DCT3D[intra][GET_BITS(cache, 12)]; |
|
BitstreamSkip(bs, (mode == 2) ? 2 : 1); |
|
|
|
|
|
reverse_event = &DCT3D[intra][BitstreamShowBits(bs, 12)]; |
|
1016 |
|
|
1017 |
if ((level = reverse_event->event.level) == 0) |
if ((level = reverse_event->event.level) == 0) |
1018 |
goto error; |
goto error; |
1020 |
*last = reverse_event->event.last; |
*last = reverse_event->event.last; |
1021 |
*run = reverse_event->event.run; |
*run = reverse_event->event.run; |
1022 |
|
|
1023 |
BitstreamSkip(bs, reverse_event->len); |
if (mode < 2) { |
1024 |
|
/* first escape mode, level is offset */ |
|
if (mode < 2) /* first escape mode, level is offset */ |
|
1025 |
level += max_level[intra][*last][*run]; |
level += max_level[intra][*last][*run]; |
1026 |
else /* second escape mode, run is offset */ |
} else { |
1027 |
|
/* second escape mode, run is offset */ |
1028 |
*run += max_run[intra][*last][level] + 1; |
*run += max_run[intra][*last][level] + 1; |
1029 |
|
} |
1030 |
|
|
1031 |
|
/* Update bitstream position */ |
1032 |
|
BitstreamSkip(bs, 7 + skip[mode] + reverse_event->len + 1); |
1033 |
|
|
1034 |
return BitstreamGetBits(bs, 1) ? -level : level; |
return (GET_BITS(cache, reverse_event->len+1)&0x01) ? -level : level; |
1035 |
} |
} |
1036 |
|
|
1037 |
/* third escape mode - fixed length codes */ |
/* third escape mode - fixed length codes */ |
1038 |
BitstreamSkip(bs, 2); |
cache <<= 2; |
1039 |
*last = BitstreamGetBits(bs, 1); |
*last = GET_BITS(cache, 1); |
1040 |
*run = BitstreamGetBits(bs, 6); |
*run = (GET_BITS(cache, 7)&0x3f); |
1041 |
BitstreamSkip(bs, 1); /* marker */ |
level = (GET_BITS(cache, 20)&0xfff); |
1042 |
level = BitstreamGetBits(bs, 12); |
|
1043 |
BitstreamSkip(bs, 1); /* marker */ |
/* Update bitstream position */ |
1044 |
|
BitstreamSkip(bs, 30); |
1045 |
|
|
1046 |
return (level << 20) >> 20; |
return (level << 20) >> 20; |
1047 |
|
|
1063 |
do { |
do { |
1064 |
level = get_coeff(bs, &run, &last, 1, 0); |
level = get_coeff(bs, &run, &last, 1, 0); |
1065 |
if (run == -1) { |
if (run == -1) { |
1066 |
DPRINTF(DPRINTF_ERROR,"fatal: invalid run"); |
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run"); |
1067 |
break; |
break; |
1068 |
} |
} |
1069 |
coeff += run; |
coeff += run; |
1070 |
block[scan[coeff]] = level; |
block[scan[coeff]] = level; |
1071 |
|
|
1072 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[coeff], level); |
DPRINTF(XVID_DEBUG_COEFF,"block[%i] %i\n", scan[coeff], level); |
1073 |
//DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[coeff], level, BitstreamShowBits(bs, 32)); |
#if 0 |
1074 |
|
DPRINTF(XVID_DEBUG_COEFF,"block[%i] %i %08x\n", scan[coeff], level, BitstreamShowBits(bs, 32)); |
1075 |
|
#endif |
1076 |
|
|
1077 |
if (level < -2047 || level > 2047) { |
if (level < -2047 || level > 2047) { |
1078 |
DPRINTF(DPRINTF_ERROR,"warning: intra_overflow %i", level); |
DPRINTF(XVID_DEBUG_ERROR,"warning: intra_overflow %i\n", level); |
1079 |
} |
} |
1080 |
coeff++; |
coeff++; |
1081 |
} while (!last); |
} while (!last); |
1083 |
} |
} |
1084 |
|
|
1085 |
void |
void |
1086 |
get_inter_block(Bitstream * bs, |
get_inter_block_h263( |
1087 |
|
Bitstream * bs, |
1088 |
int16_t * block, |
int16_t * block, |
1089 |
int direction) |
int direction, |
1090 |
|
const int quant, |
1091 |
|
const uint16_t *matrix) |
1092 |
{ |
{ |
1093 |
|
|
1094 |
const uint16_t *scan = scan_tables[direction]; |
const uint16_t *scan = scan_tables[direction]; |
1095 |
|
const uint16_t quant_m_2 = quant << 1; |
1096 |
|
const uint16_t quant_add = (quant & 1 ? quant : quant - 1); |
1097 |
int p; |
int p; |
1098 |
int level; |
int level; |
1099 |
int run; |
int run; |
1103 |
do { |
do { |
1104 |
level = get_coeff(bs, &run, &last, 0, 0); |
level = get_coeff(bs, &run, &last, 0, 0); |
1105 |
if (run == -1) { |
if (run == -1) { |
1106 |
DPRINTF(DPRINTF_ERROR,"fatal: invalid run"); |
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run"); |
1107 |
break; |
break; |
1108 |
} |
} |
1109 |
p += run; |
p += run; |
1110 |
|
|
1111 |
block[scan[p]] = level; |
if (level < 0) { |
1112 |
|
level = level*quant_m_2 - quant_add; |
1113 |
|
block[scan[p]] = (level >= -2048 ? level : -2048); |
1114 |
|
} else { |
1115 |
|
level = level * quant_m_2 + quant_add; |
1116 |
|
block[scan[p]] = (level <= 2047 ? level : 2047); |
1117 |
|
} |
1118 |
|
p++; |
1119 |
|
} while (!last); |
1120 |
|
} |
1121 |
|
|
1122 |
|
void |
1123 |
|
get_inter_block_mpeg( |
1124 |
|
Bitstream * bs, |
1125 |
|
int16_t * block, |
1126 |
|
int direction, |
1127 |
|
const int quant, |
1128 |
|
const uint16_t *matrix) |
1129 |
|
{ |
1130 |
|
const uint16_t *scan = scan_tables[direction]; |
1131 |
|
uint32_t sum = 0; |
1132 |
|
int p; |
1133 |
|
int level; |
1134 |
|
int run; |
1135 |
|
int last; |
1136 |
|
|
1137 |
DPRINTF(DPRINTF_COEFF,"block[%i] %i", scan[p], level); |
p = 0; |
1138 |
// DPRINTF(DPRINTF_COEFF,"block[%i] %i %08x", scan[p], level, BitstreamShowBits(bs, 32)); |
do { |
1139 |
|
level = get_coeff(bs, &run, &last, 0, 0); |
1140 |
|
if (run == -1) { |
1141 |
|
DPRINTF(XVID_DEBUG_ERROR,"fatal: invalid run"); |
1142 |
|
break; |
1143 |
|
} |
1144 |
|
p += run; |
1145 |
|
|
1146 |
if (level < -2047 || level > 2047) { |
if (level < 0) { |
1147 |
DPRINTF(DPRINTF_ERROR,"warning: inter overflow %i", level); |
level = ((2 * -level + 1) * matrix[scan[p]] * quant) >> 4; |
1148 |
|
block[scan[p]] = (level <= 2048 ? -level : -2048); |
1149 |
|
} else { |
1150 |
|
level = ((2 * level + 1) * matrix[scan[p]] * quant) >> 4; |
1151 |
|
block[scan[p]] = (level <= 2047 ? level : 2047); |
1152 |
} |
} |
1153 |
|
|
1154 |
|
sum ^= block[scan[p]]; |
1155 |
|
|
1156 |
p++; |
p++; |
1157 |
} while (!last); |
} while (!last); |
1158 |
|
|
1159 |
|
/* mismatch control */ |
1160 |
|
if ((sum & 1) == 0) { |
1161 |
|
block[63] ^= 1; |
1162 |
} |
} |
1163 |
|
} |
1164 |
|
|
1165 |
|
|
1166 |
/***************************************************************************** |
/***************************************************************************** |
1167 |
* VLC tables and other constant arrays |
* VLC tables and other constant arrays |
1493 |
VLC sprite_trajectory_len[15] = { |
VLC sprite_trajectory_len[15] = { |
1494 |
{ 0x00 , 2}, |
{ 0x00 , 2}, |
1495 |
{ 0x02 , 3}, { 0x03, 3}, { 0x04, 3}, { 0x05, 3}, { 0x06, 3}, |
{ 0x02 , 3}, { 0x03, 3}, { 0x04, 3}, { 0x05, 3}, { 0x06, 3}, |
1496 |
{ 0x0E , 4}, { 0x1E, 5}, { 0x3E, 6}, { 0x7F, 7}, { 0xFE, 8}, |
{ 0x0E , 4}, { 0x1E, 5}, { 0x3E, 6}, { 0x7E, 7}, { 0xFE, 8}, |
1497 |
{ 0x1FE, 9}, {0x3FE,10}, {0x7FE,11}, {0xFFE,12} }; |
{ 0x1FE, 9}, {0x3FE,10}, {0x7FE,11}, {0xFFE,12} }; |
1498 |
|
|
1499 |
|
|