3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* - Bitstream reader/writer inlined functions and constants- |
* - Bitstream reader/writer inlined functions and constants- |
5 |
* |
* |
6 |
* Copyright (C) 2001-2002 - Peter Ross <pross@xvid.org> |
* Copyright (C) 2001-2003 Peter Ross <pross@xvid.org> |
7 |
* |
* |
8 |
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
* This program is free software ; you can redistribute it and/or modify |
9 |
* |
* it under the terms of the GNU General Public License as published by |
|
* XviD is free software; you can redistribute it and/or modify it |
|
|
* under the terms of the GNU General Public License as published by |
|
10 |
* the Free Software Foundation; either version 2 of the License, or |
* the Free Software Foundation; either version 2 of the License, or |
11 |
* (at your option) any later version. |
* (at your option) any later version. |
12 |
* |
* |
19 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
20 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
21 |
* |
* |
|
* Under section 8 of the GNU General Public License, the copyright |
|
|
* holders of XVID explicitly forbid distribution in the following |
|
|
* countries: |
|
|
* |
|
|
* - Japan |
|
|
* - United States of America |
|
|
* |
|
|
* Linking XviD statically or dynamically with other modules is making a |
|
|
* combined work based on XviD. Thus, the terms and conditions of the |
|
|
* GNU General Public License cover the whole combination. |
|
|
* |
|
|
* As a special exception, the copyright holders of XviD give you |
|
|
* permission to link XviD with independent modules that communicate with |
|
|
* XviD solely through the VFW1.1 and DShow interfaces, regardless of the |
|
|
* license terms of these independent modules, and to copy and distribute |
|
|
* the resulting combined work under terms of your choice, provided that |
|
|
* every copy of the combined work is accompanied by a complete copy of |
|
|
* the source code of XviD (the version of XviD used to produce the |
|
|
* combined work), being distributed under the terms of the GNU General |
|
|
* Public License plus this exception. An independent module is a module |
|
|
* which is not derived from or based on XviD. |
|
|
* |
|
|
* Note that people who make modified versions of XviD are not obligated |
|
|
* to grant this special exception for their modified versions; it is |
|
|
* their choice whether to do so. The GNU General Public License gives |
|
|
* permission to release a modified version without this exception; this |
|
|
* exception also makes it possible to release a modified version which |
|
|
* carries forward this exception. |
|
|
* |
|
22 |
* $Id$ |
* $Id$ |
23 |
* |
* |
24 |
****************************************************************************/ |
****************************************************************************/ |
45 |
#define GRPOFVOP_START_CODE 0x000001b3 |
#define GRPOFVOP_START_CODE 0x000001b3 |
46 |
/*#define VIDSESERR_ERROR_CODE 0x000001b4 */ |
/*#define VIDSESERR_ERROR_CODE 0x000001b4 */ |
47 |
#define VISOBJ_START_CODE 0x000001b5 |
#define VISOBJ_START_CODE 0x000001b5 |
48 |
/*#define SLICE_START_CODE 0x000001b7 */ |
#define VOP_START_CODE 0x000001b6 |
49 |
/*#define EXT_START_CODE 0x000001b8 */ |
/*#define STUFFING_START_CODE 0x000001c3 */ |
50 |
|
|
51 |
|
|
52 |
#define VISOBJ_TYPE_VIDEO 1 |
#define VISOBJ_TYPE_VIDEO 1 |
58 |
|
|
59 |
#define VIDOBJLAY_TYPE_SIMPLE 1 |
#define VIDOBJLAY_TYPE_SIMPLE 1 |
60 |
/*#define VIDOBJLAY_TYPE_SIMPLE_SCALABLE 2 */ |
/*#define VIDOBJLAY_TYPE_SIMPLE_SCALABLE 2 */ |
61 |
#define VIDOBJLAY_TYPE_CORE 3 |
/*#define VIDOBJLAY_TYPE_CORE 3 */ |
62 |
#define VIDOBJLAY_TYPE_MAIN 4 |
/*#define VIDOBJLAY_TYPE_MAIN 4 */ |
63 |
|
/*#define VIDOBJLAY_TYPE_NBIT 5 */ |
64 |
|
/*#define VIDOBJLAY_TYPE_ANIM_TEXT 6 */ |
65 |
|
/*#define VIDOBJLAY_TYPE_ANIM_MESH 7 */ |
66 |
|
/*#define VIDOBJLAY_TYPE_SIMPLE_FACE 8 */ |
67 |
|
/*#define VIDOBJLAY_TYPE_STILL_SCALABLE 9 */ |
68 |
|
#define VIDOBJLAY_TYPE_ART_SIMPLE 10 |
69 |
|
/*#define VIDOBJLAY_TYPE_CORE_SCALABLE 11 */ |
70 |
|
/*#define VIDOBJLAY_TYPE_ACE 12 */ |
71 |
|
/*#define VIDOBJLAY_TYPE_ADVANCED_SCALABLE_TEXTURE 13 */ |
72 |
|
/*#define VIDOBJLAY_TYPE_SIMPLE_FBA 14 */ |
73 |
|
/*#define VIDEOJLAY_TYPE_SIMPLE_STUDIO 15*/ |
74 |
|
/*#define VIDEOJLAY_TYPE_CORE_STUDIO 16*/ |
75 |
|
#define VIDOBJLAY_TYPE_ASP 17 |
76 |
|
/*#define VIDOBJLAY_TYPE_FGS 18*/ |
77 |
|
|
78 |
|
|
79 |
/*#define VIDOBJLAY_AR_SQUARE 1 */ |
/*#define VIDOBJLAY_AR_SQUARE 1 */ |
89 |
#define VIDOBJLAY_SHAPE_BINARY_ONLY 2 |
#define VIDOBJLAY_SHAPE_BINARY_ONLY 2 |
90 |
#define VIDOBJLAY_SHAPE_GRAYSCALE 3 |
#define VIDOBJLAY_SHAPE_GRAYSCALE 3 |
91 |
|
|
92 |
#define VO_START_CODE 0x8 |
|
93 |
#define VOL_START_CODE 0x12 |
#define SPRITE_NONE 0 |
94 |
#define VOP_START_CODE 0x1b6 |
#define SPRITE_STATIC 1 |
95 |
|
#define SPRITE_GMC 2 |
96 |
|
|
97 |
|
|
98 |
|
|
99 |
#define READ_MARKER() BitstreamSkip(bs, 1) |
#define READ_MARKER() BitstreamSkip(bs, 1) |
100 |
#define WRITE_MARKER() BitstreamPutBit(bs, 1) |
#define WRITE_MARKER() BitstreamPutBit(bs, 1) |
116 |
* Prototypes |
* Prototypes |
117 |
****************************************************************************/ |
****************************************************************************/ |
118 |
|
|
119 |
int |
int read_video_packet_header(Bitstream *bs, |
120 |
read_video_packet_header(Bitstream *bs, const int addbits, int * quant); |
DECODER * dec, |
121 |
|
const int addbits, |
122 |
|
int *quant, |
123 |
|
int *fcode_forward, |
124 |
|
int *fcode_backward, |
125 |
|
int *intra_dc_threshold); |
126 |
|
|
127 |
/* header stuff */ |
/* header stuff */ |
128 |
int BitstreamReadHeaders(Bitstream * bs, |
int BitstreamReadHeaders(Bitstream * bs, |
129 |
DECODER * dec, |
DECODER * dec, |
130 |
uint32_t * rounding, |
uint32_t * rounding, |
131 |
|
uint32_t * reduced_resolution, |
132 |
uint32_t * quant, |
uint32_t * quant, |
133 |
uint32_t * fcode_forward, |
uint32_t * fcode_forward, |
134 |
uint32_t * fcode_backward, |
uint32_t * fcode_backward, |
135 |
uint32_t * intra_dc_threshold); |
uint32_t * intra_dc_threshold, |
136 |
|
WARPPOINTS * gmc_warp); |
137 |
|
|
138 |
|
|
139 |
void BitstreamWriteVolHeader(Bitstream * const bs, |
void BitstreamWriteVolHeader(Bitstream * const bs, |
140 |
const MBParam * pParam, |
const MBParam * pParam, |
141 |
const FRAMEINFO * frame); |
const FRAMEINFO * const frame); |
142 |
|
|
143 |
void BitstreamWriteVopHeader(Bitstream * const bs, |
void BitstreamWriteVopHeader(Bitstream * const bs, |
144 |
const MBParam * pParam, |
const MBParam * pParam, |
145 |
const FRAMEINFO * frame, |
const FRAMEINFO * const frame, |
146 |
int vop_coded); |
int vop_coded, |
147 |
|
unsigned int quant); |
148 |
/***************************************************************************** |
|
149 |
* Inlined functions |
void BitstreamWriteUserData(Bitstream * const bs, |
150 |
****************************************************************************/ |
uint8_t * data, |
151 |
|
const int length); |
152 |
|
|
153 |
/* initialise bitstream structure */ |
/* initialise bitstream structure */ |
154 |
|
|
158 |
uint32_t length) |
uint32_t length) |
159 |
{ |
{ |
160 |
uint32_t tmp; |
uint32_t tmp; |
161 |
|
size_t bitpos; |
162 |
|
ptr_t adjbitstream = (ptr_t)bitstream; |
163 |
|
|
164 |
bs->start = bs->tail = (uint32_t *) bitstream; |
/* |
165 |
|
* Start the stream on a uint32_t boundary, by rounding down to the |
166 |
|
* previous uint32_t and skipping the intervening bytes. |
167 |
|
*/ |
168 |
|
bitpos = ((sizeof(uint32_t)-1) & (size_t)bitstream); |
169 |
|
adjbitstream = adjbitstream - bitpos; |
170 |
|
bs->start = bs->tail = (uint32_t *) adjbitstream; |
171 |
|
|
172 |
tmp = *(uint32_t *) bitstream; |
tmp = *bs->start; |
173 |
#ifndef ARCH_IS_BIG_ENDIAN |
#ifndef ARCH_IS_BIG_ENDIAN |
174 |
BSWAP(tmp); |
BSWAP(tmp); |
175 |
#endif |
#endif |
176 |
bs->bufa = tmp; |
bs->bufa = tmp; |
177 |
|
|
178 |
tmp = *((uint32_t *) bitstream + 1); |
tmp = *(bs->start + 1); |
179 |
#ifndef ARCH_IS_BIG_ENDIAN |
#ifndef ARCH_IS_BIG_ENDIAN |
180 |
BSWAP(tmp); |
BSWAP(tmp); |
181 |
#endif |
#endif |
182 |
bs->bufb = tmp; |
bs->bufb = tmp; |
183 |
|
|
184 |
bs->buf = 0; |
bs->buf = 0; |
185 |
bs->pos = 0; |
bs->pos = bs->initpos = bitpos*8; |
186 |
bs->length = length; |
bs->length = length; |
187 |
} |
} |
188 |
|
|
209 |
bs->bufb = tmp; |
bs->bufb = tmp; |
210 |
|
|
211 |
bs->buf = 0; |
bs->buf = 0; |
212 |
bs->pos = 0; |
bs->pos = bs->initpos; |
213 |
} |
} |
214 |
|
|
215 |
|
|
233 |
|
|
234 |
/* skip n bits forward in bitstream */ |
/* skip n bits forward in bitstream */ |
235 |
|
|
236 |
static void __inline |
static __inline void |
237 |
BitstreamSkip(Bitstream * const bs, |
BitstreamSkip(Bitstream * const bs, |
238 |
const uint32_t bits) |
const uint32_t bits) |
239 |
{ |
{ |
255 |
|
|
256 |
|
|
257 |
/* number of bits to next byte alignment */ |
/* number of bits to next byte alignment */ |
258 |
static uint32_t __inline |
static __inline uint32_t |
259 |
BitstreamNumBitsToByteAlign(Bitstream *bs) |
BitstreamNumBitsToByteAlign(Bitstream *bs) |
260 |
{ |
{ |
261 |
uint32_t n = (32 - bs->pos) % 8; |
uint32_t n = (32 - bs->pos) % 8; |
264 |
|
|
265 |
|
|
266 |
/* show nbits from next byte alignment */ |
/* show nbits from next byte alignment */ |
267 |
static uint32_t __inline |
static __inline uint32_t |
268 |
BitstreamShowBitsFromByteAlign(Bitstream *bs, int bits) |
BitstreamShowBitsFromByteAlign(Bitstream *bs, int bits) |
269 |
{ |
{ |
270 |
int bspos = bs->pos + BitstreamNumBitsToByteAlign(bs); |
int bspos = bs->pos + BitstreamNumBitsToByteAlign(bs); |
286 |
|
|
287 |
/* move forward to the next byte boundary */ |
/* move forward to the next byte boundary */ |
288 |
|
|
289 |
static void __inline |
static __inline void |
290 |
BitstreamByteAlign(Bitstream * const bs) |
BitstreamByteAlign(Bitstream * const bs) |
291 |
{ |
{ |
292 |
uint32_t remainder = bs->pos % 8; |
uint32_t remainder = bs->pos % 8; |
302 |
static uint32_t __inline |
static uint32_t __inline |
303 |
BitstreamPos(const Bitstream * const bs) |
BitstreamPos(const Bitstream * const bs) |
304 |
{ |
{ |
305 |
return((uint32_t)(8*((ptr_t)bs->tail - (ptr_t)bs->start) + bs->pos)); |
return((uint32_t)(8*((ptr_t)bs->tail - (ptr_t)bs->start) + bs->pos - bs->initpos)); |
306 |
} |
} |
307 |
|
|
308 |
|
|
309 |
/* flush the bitstream & return length (unit bytes) |
/* |
310 |
NOTE: assumes no futher bitstream functions will be called. |
* flush the bitstream & return length (unit bytes) |
311 |
|
* NOTE: assumes no futher bitstream functions will be called. |
312 |
*/ |
*/ |
313 |
|
|
314 |
static uint32_t __inline |
static uint32_t __inline |
327 |
len += (bs->pos + 7) / 8; |
len += (bs->pos + 7) / 8; |
328 |
} |
} |
329 |
|
|
330 |
|
/* initpos is always on a byte boundary */ |
331 |
|
if (bs->initpos) |
332 |
|
len -= bs->initpos/8; |
333 |
|
|
334 |
return len; |
return len; |
335 |
} |
} |
336 |
|
|
355 |
} |
} |
356 |
} |
} |
357 |
|
|
|
|
|
|
/* pad bitstream to the next byte boundary */ |
|
|
|
|
|
static void __inline |
|
|
BitstreamPad(Bitstream * const bs) |
|
|
{ |
|
|
uint32_t remainder = bs->pos % 8; |
|
|
|
|
|
if (remainder) { |
|
|
BitstreamForward(bs, 8 - remainder); |
|
|
} |
|
|
} |
|
|
|
|
|
|
|
358 |
/* read n bits from bitstream */ |
/* read n bits from bitstream */ |
359 |
|
|
360 |
static uint32_t __inline |
static uint32_t __inline |
417 |
} |
} |
418 |
} |
} |
419 |
|
|
420 |
|
static const int stuffing_codes[8] = |
421 |
|
{ |
422 |
|
/* nbits stuffing code */ |
423 |
|
0, /* 1 0 */ |
424 |
|
1, /* 2 01 */ |
425 |
|
3, /* 3 011 */ |
426 |
|
7, /* 4 0111 */ |
427 |
|
0xf, /* 5 01111 */ |
428 |
|
0x1f, /* 6 011111 */ |
429 |
|
0x3f, /* 7 0111111 */ |
430 |
|
0x7f, /* 8 01111111 */ |
431 |
|
}; |
432 |
|
|
433 |
|
/* pad bitstream to the next byte boundary */ |
434 |
|
|
435 |
|
static void __inline |
436 |
|
BitstreamPad(Bitstream * const bs) |
437 |
|
{ |
438 |
|
int bits = 8 - (bs->pos % 8); |
439 |
|
if (bits < 8) |
440 |
|
BitstreamPutBits(bs, stuffing_codes[bits - 1], bits); |
441 |
|
} |
442 |
|
|
443 |
|
|
444 |
|
/* |
445 |
|
* pad bitstream to the next byte boundary |
446 |
|
* alway pad: even if currently at the byte boundary |
447 |
|
*/ |
448 |
|
|
449 |
|
static void __inline |
450 |
|
BitstreamPadAlways(Bitstream * const bs) |
451 |
|
{ |
452 |
|
int bits = 8 - (bs->pos % 8); |
453 |
|
BitstreamPutBits(bs, stuffing_codes[bits - 1], bits); |
454 |
|
} |
455 |
|
|
456 |
#endif /* _BITSTREAM_H_ */ |
#endif /* _BITSTREAM_H_ */ |