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,
65 int words = length >> 4;
66 int bits = length & 15;
75 for (i = 0; i < words; i++)
90 #define GET_DATA(v, table, i, wrap, size) \
92 const uint8_t *ptr = (const uint8_t *)table + i * wrap; \
95 v = *(const uint8_t *)ptr; \
98 v = *(const uint16_t *)ptr; \
101 v = *(const uint32_t *)ptr; \
129 return (uint32_t)
ff_reverse[ x & 0xFF] << 24 |
146 return (sa->
code >> 1) - (sb->code >> 1);
165 int table_size, table_index,
index, code_prefix, symbol, subtable_bits;
166 int i, j, k,
n, nb, inc;
170 table_size = 1 << table_nb_bits;
171 if (table_nb_bits > 30)
174 av_dlog(
NULL,
"new table index=%d size=%d\n", table_index, table_size);
180 for (i = 0; i < nb_codes; i++) {
182 code = codes[i].
code;
184 av_dlog(
NULL,
"i=%d n=%d code=0x%x\n", i, n, code);
185 if (n <= table_nb_bits) {
187 j = code >> (32 - table_nb_bits);
188 nb = 1 << (table_nb_bits -
n);
194 for (k = 0; k < nb; k++) {
197 if (bits != 0 && bits != n) {
202 table[j][0] = symbol;
208 code_prefix = code >> (32 - table_nb_bits);
211 codes[i].
code = code << table_nb_bits;
212 for (k = i+1; k < nb_codes; k++) {
213 n = codes[k].
bits - table_nb_bits;
216 code = codes[k].
code;
217 if (code >> (32 - table_nb_bits) != code_prefix)
220 codes[k].
code = code << table_nb_bits;
221 subtable_bits =
FFMAX(subtable_bits, n);
223 subtable_bits =
FFMIN(subtable_bits, table_nb_bits);
225 table[j][1] = -subtable_bits;
227 j, codes[i].
bits + table_nb_bits);
228 index =
build_table(vlc, subtable_bits, k-i, codes+i, flags);
238 for (i = 0; i < table_size; i++) {
239 if (
table[i][1] == 0)
274 const void *
bits,
int bits_wrap,
int bits_size,
275 const void *codes,
int codes_wrap,
int codes_size,
276 const void *symbols,
int symbols_wrap,
int symbols_size,
305 #define COPY(condition)\
306 for (i = 0; i < nb_codes; i++) { \
307 GET_DATA(buf[j].bits, bits, i, bits_wrap, bits_size); \
310 if (buf[j].bits > 3*nb_bits || buf[j].bits>32) { \
311 av_log(NULL, AV_LOG_ERROR, "Too long VLC (%d) in init_vlc\n", buf[j].bits);\
312 if (!(flags & INIT_VLC_USE_NEW_STATIC)) \
316 GET_DATA(buf[j].code, codes, i, codes_wrap, codes_size); \
317 if (buf[j].code >= (1LL<<buf[j].bits)) { \
318 av_log(NULL, AV_LOG_ERROR, "Invalid code in init_vlc\n"); \
319 if (!(flags & INIT_VLC_USE_NEW_STATIC)) \
323 if (flags & INIT_VLC_LE) \
324 buf[j].code = bitswap_32(buf[j].code); \
326 buf[j].code <<= 32 - buf[j].bits; \
328 GET_DATA(buf[j].symbol, symbols, i, symbols_wrap, symbols_size) \
333 COPY(buf[j].bits > nb_bits);
336 COPY(buf[j].bits && buf[j].bits <= nb_bits);
339 ret =
build_table(vlc, nb_bits, nb_codes, buf, flags);
341 if (flags & INIT_VLC_USE_NEW_STATIC) {
const uint8_t ff_log2_run[41]
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
#define av_realloc_f(p, o, n)
static void put_bits(Jpeg2000EncoderContext *s, int val, int n)
put n times val bit
int ff_init_vlc_sparse(VLC *vlc_arg, int nb_bits, int nb_codes, const void *bits, int bits_wrap, int bits_size, const void *codes, int codes_wrap, int codes_size, const void *symbols, int symbols_wrap, int symbols_size, int flags)
void avpriv_copy_bits(PutBitContext *pb, const uint8_t *src, int length)
Copy the content of src to the bitstream.
void avpriv_align_put_bits(PutBitContext *s)
Pad the bitstream with zeros up to the next byte boundary.
#define FF_ARRAY_ELEMS(a)
av_dlog(ac->avr,"%d samples - audio_convert: %s to %s (%s)\n", len, av_get_sample_fmt_name(ac->in_fmt), av_get_sample_fmt_name(ac->out_fmt), use_generic?ac->func_descr_generic:ac->func_descr)
static int build_table(VLC *vlc, int table_nb_bits, int nb_codes, VLCcode *codes, int flags)
Build VLC decoding tables suitable for use with get_vlc().
#define av_assert0(cond)
assert() equivalent, that is always enabled.
static av_always_inline uint32_t bitswap_32(uint32_t x)
bitstream reader API header.
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
static uint8_t * put_bits_ptr(PutBitContext *s)
Return the pointer to the byte where the bitstream writer will put the next bit.
static int put_bits_left(PutBitContext *s)
static const struct endianess table[]
uint32_t code
codeword, with the first bit-to-be-read in the msb (even if intended for a little-endian bitstream re...
simple assert() macros that are a bit more flexible than ISO C assert().
Libavcodec external API header.
static int put_bits_count(PutBitContext *s)
static void skip_put_bytes(PutBitContext *s, int n)
Skip the given number of bytes.
static int compare_vlcspec(const void *a, const void *b)
#define INIT_VLC_USE_NEW_STATIC
static void flush_put_bits(PutBitContext *s)
Pad the end of the output stream with zeros.
VLC_TYPE(* table)[2]
code, bits
void avpriv_put_string(PutBitContext *pb, const char *string, int terminate_string)
Put the string string in the bitstream.
const uint8_t ff_reverse[256]
#define av_malloc_array(a, b)
void ff_free_vlc(VLC *vlc)
static int alloc_table(VLC *vlc, int size, int use_static)