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 void alloc_table(struct vlc *vlc, int size)
48 vlc->table_size += size;
49 if (vlc->table_size > vlc->table_allocated) {
50 vlc->table_allocated += (1 << vlc->bits);
51 vlc->table = para_realloc(vlc->table,
52 sizeof(VLC_TYPE) * 2 * vlc->table_allocated);
56 static int build_table(struct vlc *vlc, int table_nb_bits, int nb_codes,
57 const void *bits, const void *codes, int codes_wrap,
58 int codes_size, uint32_t code_prefix, int n_prefix)
60 int i, j, k, n, table_size, table_index, nb, n1, idx, code_prefix2,
65 table_size = 1 << table_nb_bits;
66 table_index = vlc->table_size;
67 alloc_table(vlc, table_size);
68 table = &vlc->table[table_index];
70 for (i = 0; i < table_size; i++) {
71 table[i][1] = 0; //bits
72 table[i][0] = -1; //codes
75 /* map codes and compute auxillary table sizes */
76 for (i = 0; i < nb_codes; i++) {
77 GET_DATA(n, bits, i, 1, 1);
78 GET_DATA(code, codes, i, codes_wrap, codes_size);
79 /* we accept tables with holes */
83 /* if code matches the prefix, it is in the table */
85 code_prefix2 = code >> n;
86 if (n > 0 && code_prefix2 == code_prefix) {
87 if (n <= table_nb_bits) {
88 /* no need to add another table */
89 j = (code << (table_nb_bits - n)) & (table_size - 1);
90 nb = 1 << (table_nb_bits - n);
91 for (k = 0; k < nb; k++) {
92 if (table[j][1] /* bits */ != 0) {
93 PARA_EMERG_LOG("detected incorrect code\n");
96 table[j][1] = n; //bits
102 j = (code >> n) & ((1 << table_nb_bits) - 1);
103 /* compute table size */
104 n1 = -table[j][1]; //bits
107 table[j][1] = -n1; //bits
112 /* fill auxillary tables recursively */
113 for (i = 0; i < table_size; i++) {
114 n = table[i][1]; //bits
117 if (n > table_nb_bits) {
119 table[i][1] = -n; //bits
121 idx = build_table(vlc, n, nb_codes,
122 bits, codes, codes_wrap, codes_size,
123 (code_prefix << table_nb_bits) | i,
124 n_prefix + table_nb_bits);
125 /* vlc->table might have changed */
126 table = &vlc->table[table_index];
127 table[i][0] = idx; //code
134 * Build VLC decoding tables suitable for use with get_vlc().
136 * \param nb_bits Set the decoding table size (2^nb_bits)
137 * entries. The bigger it is, the faster is the decoding. But
138 * it should not be too big to save memory and L1 cache. '9'
139 * is a good compromise.
141 * \param nb_codes Number of vlcs codes.
143 * \param bits Table which gives the size (in bits) of each
146 * \param codes Table which gives the bit pattern of of each
149 * \param codes_wrap The number of bytes between each entry of the
152 * \param codes_size The number of bytes of each entry of the
155 * The wrap and size parameters allow to use any memory configuration and
156 * types (byte/word/long) to store the bits and codes tables.
158 void init_vlc(struct vlc *vlc, int nb_bits, int nb_codes,
159 const void *bits, const void *codes, int codes_wrap,
162 PARA_INFO_LOG("nb_codes: %d\n", nb_codes);
165 vlc->table_allocated = 0;
167 build_table(vlc, nb_bits, nb_codes, bits,
168 codes, codes_wrap, codes_size, 0, 0);
171 void free_vlc(struct vlc *vlc)