e081d0cf61ad7b711065d3d7c4844a3a9691f148
2 * Common bit I/O utils.
4 * Extracted 2009 from mplayer 2009-02-10 libavcodec/bitstream.c.
6 * Copyright (c) 2000, 2001 Fabrice Bellard
7 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
8 * alternative bitstream reader & writer by Michael Niedermayer <michaelni@gmx.at>
10 * Licensed under the GNU Lesser General Public License.
11 * For licencing details see COPYING.LIB.
15 * \file bitstream.c Bitstream API.
28 #include "bitstream.h"
30 #define GET_DATA(v, table, i, wrap, size) \
32 const uint8_t *ptr = (const uint8_t *)table + i * wrap; \
35 v = *(const uint8_t *)ptr; \
38 v = *(const uint16_t *)ptr; \
41 v = *(const uint32_t *)ptr; \
46 static int alloc_table(struct vlc
*vlc
, int size
)
50 idx
= vlc
->table_size
;
51 vlc
->table_size
+= size
;
52 if (vlc
->table_size
> vlc
->table_allocated
) {
53 vlc
->table_allocated
+= (1 << vlc
->bits
);
54 vlc
->table
= para_realloc(vlc
->table
,
55 sizeof(VLC_TYPE
) * 2 * vlc
->table_allocated
);
60 static int build_table(struct vlc
*vlc
, int table_nb_bits
, int nb_codes
,
61 const void *bits
, const void *codes
, int codes_wrap
,
62 int codes_size
, uint32_t code_prefix
, int n_prefix
)
64 int ret
, i
, j
, k
, n
, table_size
, table_index
, nb
, n1
, idx
, code_prefix2
,
69 table_size
= 1 << table_nb_bits
;
70 ret
= alloc_table(vlc
, table_size
);
74 table
= &vlc
->table
[table_index
];
76 for (i
= 0; i
< table_size
; i
++) {
77 table
[i
][1] = 0; //bits
78 table
[i
][0] = -1; //codes
81 /* first pass: map codes and compute auxillary table sizes */
82 for (i
= 0; i
< nb_codes
; i
++) {
83 GET_DATA(n
, bits
, i
, 1, 1);
84 GET_DATA(code
, codes
, i
, codes_wrap
, codes_size
);
85 /* we accept tables with holes */
89 /* if code matches the prefix, it is in the table */
91 code_prefix2
= code
>> n
;
92 if (n
> 0 && code_prefix2
== code_prefix
) {
93 if (n
<= table_nb_bits
) {
94 /* no need to add another table */
95 j
= (code
<< (table_nb_bits
- n
)) & (table_size
- 1);
96 nb
= 1 << (table_nb_bits
- n
);
97 for (k
= 0; k
< nb
; k
++) {
98 if (table
[j
][1] /* bits */ != 0)
100 table
[j
][1] = n
; //bits
101 table
[j
][0] = symbol
;
106 j
= (code
>> n
) & ((1 << table_nb_bits
) - 1);
107 /* compute table size */
108 n1
= -table
[j
][1]; //bits
111 table
[j
][1] = -n1
; //bits
116 /* second pass : fill auxillary tables recursively */
117 for (i
= 0; i
< table_size
; i
++) {
118 n
= table
[i
][1]; //bits
121 if (n
> table_nb_bits
) {
123 table
[i
][1] = -n
; //bits
125 ret
= build_table(vlc
, n
, nb_codes
,
126 bits
, codes
, codes_wrap
, codes_size
,
127 (code_prefix
<< table_nb_bits
) | i
,
128 n_prefix
+ table_nb_bits
);
132 /* note: realloc has been done, so reload tables */
133 table
= &vlc
->table
[table_index
];
134 table
[i
][0] = idx
; //code
141 * Build VLC decoding tables suitable for use with get_vlc().
143 * \param nb_bits Set the decoding table size (2^nb_bits)
144 * entries. The bigger it is, the faster is the decoding. But
145 * it should not be too big to save memory and L1 cache. '9'
146 * is a good compromise.
148 * \param nb_codes Number of vlcs codes.
150 * \param bits Table which gives the size (in bits) of each
153 * \param codes Table which gives the bit pattern of of each
156 * \param codes_wrap The number of bytes between each entry of the
159 * \param codes_size The number of bytes of each entry of the
162 * The wrap and size parameters allow to use any memory configuration and
163 * types (byte/word/long) to store the bits and codes tables.
165 int init_vlc(struct vlc
*vlc
, int nb_bits
, int nb_codes
,
166 const void *bits
, const void *codes
, int codes_wrap
,
171 PARA_INFO_LOG("nb_codes=%d\n", nb_codes
);
174 vlc
->table_allocated
= 0;
176 ret
= build_table(vlc
, nb_bits
, nb_codes
, bits
,
177 codes
, codes_wrap
, codes_size
, 0, 0);
183 void free_vlc(struct vlc
*vlc
)