3 * Copyright (c) 2000, 2001 Fabrice Bellard
4 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
5 * Copyright (c) 2010 Loren Merritt
7 * alternative bitstream reader & writer by Michael Niedermayer <michaelni@gmx.at>
9 * This file is part of FFmpeg.
11 * FFmpeg is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public
13 * License as published by the Free Software Foundation; either
14 * version 2.1 of the License, or (at your option) any later version.
16 * FFmpeg is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Lesser General Public License for more details.
21 * You should have received a copy of the GNU Lesser General Public
22 * License along with FFmpeg; if not, write to the Free Software
23 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
31 #include "libavutil/atomic.h"
32 #include "libavutil/avassert.h"
38 const uint8_t ff_log2_run[41]={
39 0, 0, 0, 0, 1, 1, 1, 1,
40 2, 2, 2, 2, 3, 3, 3, 3,
41 4, 4, 5, 5, 6, 6, 7, 7,
42 8, 9,10,11,12,13,14,15,
43 16,17,18,19,20,21,22,23,
47 void avpriv_align_put_bits(PutBitContext *s)
49 put_bits(s, s->bit_left & 7, 0);
52 void avpriv_put_string(PutBitContext *pb, const char *string,
56 put_bits(pb, 8, *string);
63 void avpriv_copy_bits(PutBitContext *pb, const uint8_t *src, int length)
65 int words = length >> 4;
66 int bits = length & 15;
72 if (CONFIG_SMALL || words < 16 || put_bits_count(pb) & 7) {
73 for (i = 0; i < words; i++)
74 put_bits(pb, 16, AV_RB16(src + 2 * i));
76 for (i = 0; put_bits_count(pb) & 31; i++)
77 put_bits(pb, 8, src[i]);
79 memcpy(put_bits_ptr(pb), src + i, 2 * words - i);
80 skip_put_bytes(pb, 2 * words - i);
83 put_bits(pb, bits, AV_RB16(src + 2 * words) >> (16 - bits));
88 #define GET_DATA(v, table, i, wrap, size) \
90 const uint8_t *ptr = (const uint8_t *)table + i * wrap; \
93 v = *(const uint8_t *)ptr; \
96 v = *(const uint16_t *)ptr; \
99 v = *(const uint32_t *)ptr; \
105 static int alloc_table(VLC *vlc, int size, int use_static)
107 int index = vlc->table_size;
109 vlc->table_size += size;
110 if (vlc->table_size > vlc->table_allocated) {
112 abort(); // cannot do anything, init_vlc() is used with too little memory
113 vlc->table_allocated += (1 << vlc->bits);
114 vlc->table = av_realloc_f(vlc->table, vlc->table_allocated, sizeof(VLC_TYPE) * 2);
116 return AVERROR(ENOMEM);
121 static av_always_inline uint32_t bitswap_32(uint32_t x)
123 return (uint32_t)ff_reverse[ x & 0xFF] << 24 |
124 (uint32_t)ff_reverse[(x >> 8) & 0xFF] << 16 |
125 (uint32_t)ff_reverse[(x >> 16) & 0xFF] << 8 |
126 (uint32_t)ff_reverse[ x >> 24];
132 /** codeword, with the first bit-to-be-read in the msb
133 * (even if intended for a little-endian bitstream reader) */
137 static int compare_vlcspec(const void *a, const void *b)
139 const VLCcode *sa = a, *sb = b;
140 return (sa->code >> 1) - (sb->code >> 1);
143 * Build VLC decoding tables suitable for use with get_vlc().
145 * @param vlc the context to be initted
147 * @param table_nb_bits max length of vlc codes to store directly in this table
148 * (Longer codes are delegated to subtables.)
150 * @param nb_codes number of elements in codes[]
152 * @param codes descriptions of the vlc codes
153 * These must be ordered such that codes going into the same subtable are contiguous.
154 * Sorting by VLCcode.code is sufficient, though not necessary.
156 static int build_table(VLC *vlc, int table_nb_bits, int nb_codes,
157 VLCcode *codes, int flags)
159 int table_size, table_index, index, code_prefix, symbol, subtable_bits;
160 int i, j, k, n, nb, inc;
162 VLC_TYPE (*table)[2];
164 table_size = 1 << table_nb_bits;
165 if (table_nb_bits > 30)
167 table_index = alloc_table(vlc, table_size, flags & INIT_VLC_USE_NEW_STATIC);
168 av_dlog(NULL, "new table index=%d size=%d\n", table_index, table_size);
171 table = &vlc->table[table_index];
173 for (i = 0; i < table_size; i++) {
174 table[i][1] = 0; //bits
175 table[i][0] = -1; //codes
178 /* first pass: map codes and compute auxiliary table sizes */
179 for (i = 0; i < nb_codes; i++) {
181 code = codes[i].code;
182 symbol = codes[i].symbol;
183 av_dlog(NULL, "i=%d n=%d code=0x%x\n", i, n, code);
184 if (n <= table_nb_bits) {
185 /* no need to add another table */
186 j = code >> (32 - table_nb_bits);
187 nb = 1 << (table_nb_bits - n);
189 if (flags & INIT_VLC_LE) {
190 j = bitswap_32(code);
193 for (k = 0; k < nb; k++) {
194 av_dlog(NULL, "%4x: code=%d n=%d\n", j, i, n);
195 if (table[j][1] /*bits*/ != 0) {
196 av_log(NULL, AV_LOG_ERROR, "incorrect codes\n");
197 return AVERROR_INVALIDDATA;
199 table[j][1] = n; //bits
200 table[j][0] = symbol;
204 /* fill auxiliary table recursively */
206 code_prefix = code >> (32 - table_nb_bits);
209 codes[i].code = code << table_nb_bits;
210 for (k = i+1; k < nb_codes; k++) {
211 n = codes[k].bits - table_nb_bits;
214 code = codes[k].code;
215 if (code >> (32 - table_nb_bits) != code_prefix)
218 codes[k].code = code << table_nb_bits;
219 subtable_bits = FFMAX(subtable_bits, n);
221 subtable_bits = FFMIN(subtable_bits, table_nb_bits);
222 j = (flags & INIT_VLC_LE) ? bitswap_32(code_prefix) >> (32 - table_nb_bits) : code_prefix;
223 table[j][1] = -subtable_bits;
224 av_dlog(NULL, "%4x: n=%d (subtable)\n",
225 j, codes[i].bits + table_nb_bits);
226 index = build_table(vlc, subtable_bits, k-i, codes+i, flags);
229 /* note: realloc has been done, so reload tables */
230 table = &vlc->table[table_index];
231 table[j][0] = index; //code
239 /* Build VLC decoding tables suitable for use with get_vlc().
241 'nb_bits' set thee decoding table size (2^nb_bits) entries. The
242 bigger it is, the faster is the decoding. But it should not be too
243 big to save memory and L1 cache. '9' is a good compromise.
245 'nb_codes' : number of vlcs codes
247 'bits' : table which gives the size (in bits) of each vlc code.
249 'codes' : table which gives the bit pattern of of each vlc code.
251 'symbols' : table which gives the values to be returned from get_vlc().
253 'xxx_wrap' : give the number of bytes between each entry of the
254 'bits' or 'codes' tables.
256 'xxx_size' : gives the number of bytes of each entry of the 'bits'
259 'wrap' and 'size' allows to use any memory configuration and types
260 (byte/word/long) to store the 'bits', 'codes', and 'symbols' tables.
262 'use_static' should be set to 1 for tables, which should be freed
263 with av_free_static(), 0 if ff_free_vlc() will be used.
265 int ff_init_vlc_sparse(VLC *vlc, int nb_bits, int nb_codes,
266 const void *bits, int bits_wrap, int bits_size,
267 const void *codes, int codes_wrap, int codes_size,
268 const void *symbols, int symbols_wrap, int symbols_size,
273 VLCcode localbuf[1500]; // the maximum currently needed is 1296 by rv34
277 if (flags & INIT_VLC_USE_NEW_STATIC) {
278 while (state = avpriv_atomic_ptr_cas(&vlc->init_state, NULL, vlc)) {
279 if (state == vlc + 1) {
280 av_assert0(vlc->table_size && vlc->table_size == vlc->table_allocated);
284 av_assert0(!vlc->table_size);
285 av_assert0(nb_codes + 1 <= FF_ARRAY_ELEMS(localbuf));
289 vlc->table_allocated = 0;
292 buf = av_malloc((nb_codes + 1) * sizeof(VLCcode));
294 return AVERROR(ENOMEM);
298 av_assert0(symbols_size <= 2 || !symbols);
300 #define COPY(condition)\
301 for (i = 0; i < nb_codes; i++) { \
302 GET_DATA(buf[j].bits, bits, i, bits_wrap, bits_size); \
305 if (buf[j].bits > 3*nb_bits || buf[j].bits>32) { \
306 av_log(NULL, AV_LOG_ERROR, "Too long VLC (%d) in init_vlc\n", buf[j].bits);\
307 if (!(flags & INIT_VLC_USE_NEW_STATIC)) \
311 GET_DATA(buf[j].code, codes, i, codes_wrap, codes_size); \
312 if (buf[j].code >= (1LL<<buf[j].bits)) { \
313 av_log(NULL, AV_LOG_ERROR, "Invalid code in init_vlc\n"); \
314 if (!(flags & INIT_VLC_USE_NEW_STATIC)) \
318 if (flags & INIT_VLC_LE) \
319 buf[j].code = bitswap_32(buf[j].code); \
321 buf[j].code <<= 32 - buf[j].bits; \
323 GET_DATA(buf[j].symbol, symbols, i, symbols_wrap, symbols_size) \
328 COPY(buf[j].bits > nb_bits);
329 // qsort is the slowest part of init_vlc, and could probably be improved or avoided
330 qsort(buf, j, sizeof(VLCcode), compare_vlcspec);
331 COPY(buf[j].bits && buf[j].bits <= nb_bits);
334 ret = build_table(vlc, nb_bits, nb_codes, buf, flags);
336 if (flags & INIT_VLC_USE_NEW_STATIC) {
337 if(vlc->table_size != vlc->table_allocated)
338 av_log(NULL, AV_LOG_ERROR, "needed %d had %d\n", vlc->table_size, vlc->table_allocated);
339 state = avpriv_atomic_ptr_cas(&vlc->init_state, vlc, vlc+1);
340 av_assert0(state == vlc);
341 av_assert0(ret >= 0);
345 av_freep(&vlc->table);
353 void ff_free_vlc(VLC *vlc)
355 av_freep(&vlc->table);