FFmpeg coverage


Directory: ../../../ffmpeg/
File: src/libavcodec/bitstream.c
Date: 2022-01-18 10:05:52
Exec Total Coverage
Lines: 144 169 85.2%
Branches: 160 205 78.0%

Line Branch Exec Source
1 /*
2 * Common bit i/o utils
3 * Copyright (c) 2000, 2001 Fabrice Bellard
4 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
5 * Copyright (c) 2010 Loren Merritt
6 *
7 * alternative bitstream reader & writer by Michael Niedermayer <michaelni@gmx.at>
8 *
9 * This file is part of FFmpeg.
10 *
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.
15 *
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.
20 *
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
24 */
25
26 /**
27 * @file
28 * bitstream api.
29 */
30
31 #include <inttypes.h>
32 #include <stdint.h>
33 #include <stdlib.h>
34 #include <string.h>
35
36 #include "config.h"
37 #include "libavutil/avassert.h"
38 #include "libavutil/bswap.h"
39 #include "libavutil/common.h"
40 #include "libavutil/error.h"
41 #include "libavutil/internal.h"
42 #include "libavutil/intreadwrite.h"
43 #include "libavutil/log.h"
44 #include "libavutil/mem.h"
45 #include "libavutil/qsort.h"
46 #include "mathops.h"
47 #include "put_bits.h"
48 #include "vlc.h"
49
50 const uint8_t ff_log2_run[41]={
51 0, 0, 0, 0, 1, 1, 1, 1,
52 2, 2, 2, 2, 3, 3, 3, 3,
53 4, 4, 5, 5, 6, 6, 7, 7,
54 8, 9,10,11,12,13,14,15,
55 16,17,18,19,20,21,22,23,
56 24,
57 };
58
59 1025 void ff_put_string(PutBitContext *pb, const char *string, int terminate_string)
60 {
61
2/2
✓ Branch 0 taken 5100 times.
✓ Branch 1 taken 1025 times.
6125 while (*string) {
62 5100 put_bits(pb, 8, *string);
63 5100 string++;
64 }
65
2/2
✓ Branch 0 taken 365 times.
✓ Branch 1 taken 660 times.
1025 if (terminate_string)
66 365 put_bits(pb, 8, 0);
67 1025 }
68
69 1232206 void ff_copy_bits(PutBitContext *pb, const uint8_t *src, int length)
70 {
71 1232206 int words = length >> 4;
72 1232206 int bits = length & 15;
73 int i;
74
75
2/2
✓ Branch 0 taken 114010 times.
✓ Branch 1 taken 1118196 times.
1232206 if (length == 0)
76 114010 return;
77
78
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1118196 times.
1118196 av_assert0(length <= put_bits_left(pb));
79
80
4/4
✓ Branch 0 taken 112486 times.
✓ Branch 1 taken 1005710 times.
✓ Branch 3 taken 97712 times.
✓ Branch 4 taken 14774 times.
1118196 if (CONFIG_SMALL || words < 16 || put_bits_count(pb) & 7) {
81
2/2
✓ Branch 0 taken 6664080 times.
✓ Branch 1 taken 1103422 times.
7767502 for (i = 0; i < words; i++)
82 6664080 put_bits(pb, 16, AV_RB16(src + 2 * i));
83 } else {
84
2/2
✓ Branch 1 taken 21128 times.
✓ Branch 2 taken 14774 times.
35902 for (i = 0; put_bits_count(pb) & 31; i++)
85 21128 put_bits(pb, 8, src[i]);
86 14774 flush_put_bits(pb);
87 14774 memcpy(put_bits_ptr(pb), src + i, 2 * words - i);
88 14774 skip_put_bytes(pb, 2 * words - i);
89 }
90
91 1118196 put_bits(pb, bits, AV_RB16(src + 2 * words) >> (16 - bits));
92 }
93
94 /* VLC decoding */
95
96 #define GET_DATA(v, table, i, wrap, size) \
97 { \
98 const uint8_t *ptr = (const uint8_t *)table + i * wrap; \
99 switch(size) { \
100 case 1: \
101 v = *(const uint8_t *)ptr; \
102 break; \
103 case 2: \
104 v = *(const uint16_t *)ptr; \
105 break; \
106 case 4: \
107 default: \
108 av_assert1(size == 4); \
109 v = *(const uint32_t *)ptr; \
110 break; \
111 } \
112 }
113
114
115 435695 static int alloc_table(VLC *vlc, int size, int use_static)
116 {
117 435695 int index = vlc->table_size;
118
119 435695 vlc->table_size += size;
120
2/2
✓ Branch 0 taken 49740 times.
✓ Branch 1 taken 385955 times.
435695 if (vlc->table_size > vlc->table_allocated) {
121
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 49740 times.
49740 if (use_static)
122 abort(); // cannot do anything, init_vlc() is used with too little memory
123 49740 vlc->table_allocated += (1 << vlc->bits);
124 49740 vlc->table = av_realloc_f(vlc->table, vlc->table_allocated, sizeof(VLC_TYPE) * 2);
125
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 49740 times.
49740 if (!vlc->table) {
126 vlc->table_allocated = 0;
127 vlc->table_size = 0;
128 return AVERROR(ENOMEM);
129 }
130 49740 memset(vlc->table + vlc->table_allocated - (1 << vlc->bits), 0, sizeof(VLC_TYPE) * 2 << vlc->bits);
131 }
132 435695 return index;
133 }
134
135 #define LOCALBUF_ELEMS 1500 // the maximum currently needed is 1296 by rv34
136
137 typedef struct VLCcode {
138 uint8_t bits;
139 VLC_TYPE symbol;
140 /** codeword, with the first bit-to-be-read in the msb
141 * (even if intended for a little-endian bitstream reader) */
142 uint32_t code;
143 } VLCcode;
144
145 58855 static int vlc_common_init(VLC *vlc, int nb_bits, int nb_codes,
146 VLCcode **buf, int flags)
147 {
148 58855 vlc->bits = nb_bits;
149 58855 vlc->table_size = 0;
150
2/2
✓ Branch 0 taken 32009 times.
✓ Branch 1 taken 26846 times.
58855 if (flags & INIT_VLC_USE_NEW_STATIC) {
151
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 32009 times.
32009 av_assert0(nb_codes <= LOCALBUF_ELEMS);
152 } else {
153 26846 vlc->table = NULL;
154 26846 vlc->table_allocated = 0;
155 }
156
2/2
✓ Branch 0 taken 120 times.
✓ Branch 1 taken 58735 times.
58855 if (nb_codes > LOCALBUF_ELEMS) {
157 120 *buf = av_malloc_array(nb_codes, sizeof(VLCcode));
158
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 120 times.
120 if (!*buf)
159 return AVERROR(ENOMEM);
160 }
161
162 58855 return 0;
163 }
164
165 20366401 static int compare_vlcspec(const void *a, const void *b)
166 {
167 20366401 const VLCcode *sa = a, *sb = b;
168 20366401 return (sa->code >> 1) - (sb->code >> 1);
169 }
170 /**
171 * Build VLC decoding tables suitable for use with get_vlc().
172 *
173 * @param vlc the context to be initialized
174 *
175 * @param table_nb_bits max length of vlc codes to store directly in this table
176 * (Longer codes are delegated to subtables.)
177 *
178 * @param nb_codes number of elements in codes[]
179 *
180 * @param codes descriptions of the vlc codes
181 * These must be ordered such that codes going into the same subtable are contiguous.
182 * Sorting by VLCcode.code is sufficient, though not necessary.
183 */
184 435695 static int build_table(VLC *vlc, int table_nb_bits, int nb_codes,
185 VLCcode *codes, int flags)
186 {
187 int table_size, table_index, index, code_prefix, symbol, subtable_bits;
188 int i, j, k, n, nb, inc;
189 VLC_TYPE (*table)[2];
190 uint32_t code;
191
192
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 435695 times.
435695 if (table_nb_bits > 30)
193 return AVERROR(EINVAL);
194 435695 table_size = 1 << table_nb_bits;
195 435695 table_index = alloc_table(vlc, table_size, flags & INIT_VLC_USE_NEW_STATIC);
196 ff_dlog(NULL, "new table index=%d size=%d\n", table_index, table_size);
197
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 435695 times.
435695 if (table_index < 0)
198 return table_index;
199 435695 table = &vlc->table[table_index];
200
201 /* first pass: map codes and compute auxiliary table sizes */
202
2/2
✓ Branch 0 taken 4968911 times.
✓ Branch 1 taken 435695 times.
5404606 for (i = 0; i < nb_codes; i++) {
203 4968911 n = codes[i].bits;
204 4968911 code = codes[i].code;
205 4968911 symbol = codes[i].symbol;
206 ff_dlog(NULL, "i=%d n=%d code=0x%"PRIx32"\n", i, n, code);
207
2/2
✓ Branch 0 taken 4592071 times.
✓ Branch 1 taken 376840 times.
4968911 if (n <= table_nb_bits) {
208 /* no need to add another table */
209 4592071 j = code >> (32 - table_nb_bits);
210 4592071 nb = 1 << (table_nb_bits - n);
211 4592071 inc = 1;
212
2/2
✓ Branch 0 taken 456135 times.
✓ Branch 1 taken 4135936 times.
4592071 if (flags & INIT_VLC_OUTPUT_LE) {
213 456135 j = bitswap_32(code);
214 456135 inc = 1 << n;
215 }
216
2/2
✓ Branch 0 taken 40639677 times.
✓ Branch 1 taken 4592071 times.
45231748 for (k = 0; k < nb; k++) {
217 40639677 int bits = table[j][1];
218 40639677 int oldsym = table[j][0];
219 ff_dlog(NULL, "%4x: code=%d n=%d\n", j, i, n);
220
2/8
✓ Branch 0 taken 40639677 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 40639677 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
40639677 if ((bits || oldsym) && (bits != n || oldsym != symbol)) {
221 av_log(NULL, AV_LOG_ERROR, "incorrect codes\n");
222 return AVERROR_INVALIDDATA;
223 }
224 40639677 table[j][1] = n; //bits
225 40639677 table[j][0] = symbol;
226 40639677 j += inc;
227 }
228 } else {
229 /* fill auxiliary table recursively */
230 376840 n -= table_nb_bits;
231 376840 code_prefix = code >> (32 - table_nb_bits);
232 376840 subtable_bits = n;
233 376840 codes[i].bits = n;
234 376840 codes[i].code = code << table_nb_bits;
235
2/2
✓ Branch 0 taken 3439009 times.
✓ Branch 1 taken 12337 times.
3451346 for (k = i+1; k < nb_codes; k++) {
236 3439009 n = codes[k].bits - table_nb_bits;
237
2/2
✓ Branch 0 taken 37380 times.
✓ Branch 1 taken 3401629 times.
3439009 if (n <= 0)
238 37380 break;
239 3401629 code = codes[k].code;
240
2/2
✓ Branch 0 taken 327123 times.
✓ Branch 1 taken 3074506 times.
3401629 if (code >> (32 - table_nb_bits) != code_prefix)
241 327123 break;
242 3074506 codes[k].bits = n;
243 3074506 codes[k].code = code << table_nb_bits;
244 3074506 subtable_bits = FFMAX(subtable_bits, n);
245 }
246 376840 subtable_bits = FFMIN(subtable_bits, table_nb_bits);
247
2/2
✓ Branch 0 taken 49668 times.
✓ Branch 1 taken 327172 times.
376840 j = (flags & INIT_VLC_OUTPUT_LE) ? bitswap_32(code_prefix) >> (32 - table_nb_bits) : code_prefix;
248 376840 table[j][1] = -subtable_bits;
249 ff_dlog(NULL, "%4x: n=%d (subtable)\n",
250 j, codes[i].bits + table_nb_bits);
251 376840 index = build_table(vlc, subtable_bits, k-i, codes+i, flags);
252
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 376840 times.
376840 if (index < 0)
253 return index;
254 /* note: realloc has been done, so reload tables */
255 376840 table = &vlc->table[table_index];
256 376840 table[j][0] = index; //code
257
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 376840 times.
376840 if (table[j][0] != index) {
258 avpriv_request_sample(NULL, "strange codes");
259 return AVERROR_PATCHWELCOME;
260 }
261 376840 i = k-1;
262 }
263 }
264
265
2/2
✓ Branch 0 taken 41522580 times.
✓ Branch 1 taken 435695 times.
41958275 for (i = 0; i < table_size; i++) {
266
2/2
✓ Branch 0 taken 506063 times.
✓ Branch 1 taken 41016517 times.
41522580 if (table[i][1] == 0) //bits
267 506063 table[i][0] = -1; //codes
268 }
269
270 435695 return table_index;
271 }
272
273 58855 static int vlc_common_end(VLC *vlc, int nb_bits, int nb_codes, VLCcode *codes,
274 int flags, VLCcode localbuf[LOCALBUF_ELEMS])
275 {
276 58855 int ret = build_table(vlc, nb_bits, nb_codes, codes, flags);
277
278
2/2
✓ Branch 0 taken 32009 times.
✓ Branch 1 taken 26846 times.
58855 if (flags & INIT_VLC_USE_NEW_STATIC) {
279
2/2
✓ Branch 0 taken 6390 times.
✓ Branch 1 taken 25619 times.
32009 if (vlc->table_size != vlc->table_allocated &&
280
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6390 times.
6390 !(flags & (INIT_VLC_STATIC_OVERLONG & ~INIT_VLC_USE_NEW_STATIC)))
281 av_log(NULL, AV_LOG_ERROR, "needed %d had %d\n", vlc->table_size, vlc->table_allocated);
282
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 32009 times.
32009 av_assert0(ret >= 0);
283 } else {
284
2/2
✓ Branch 0 taken 120 times.
✓ Branch 1 taken 26726 times.
26846 if (codes != localbuf)
285 120 av_free(codes);
286
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 26846 times.
26846 if (ret < 0) {
287 av_freep(&vlc->table);
288 return ret;
289 }
290 }
291 58855 return 0;
292 }
293
294 /* Build VLC decoding tables suitable for use with get_vlc().
295
296 'nb_bits' sets the decoding table size (2^nb_bits) entries. The
297 bigger it is, the faster is the decoding. But it should not be too
298 big to save memory and L1 cache. '9' is a good compromise.
299
300 'nb_codes' : number of vlcs codes
301
302 'bits' : table which gives the size (in bits) of each vlc code.
303
304 'codes' : table which gives the bit pattern of of each vlc code.
305
306 'symbols' : table which gives the values to be returned from get_vlc().
307
308 'xxx_wrap' : give the number of bytes between each entry of the
309 'bits' or 'codes' tables.
310
311 'xxx_size' : gives the number of bytes of each entry of the 'bits'
312 or 'codes' tables. Currently 1,2 and 4 are supported.
313
314 'wrap' and 'size' make it possible to use any memory configuration and types
315 (byte/word/long) to store the 'bits', 'codes', and 'symbols' tables.
316 */
317 36911 int ff_init_vlc_sparse(VLC *vlc, int nb_bits, int nb_codes,
318 const void *bits, int bits_wrap, int bits_size,
319 const void *codes, int codes_wrap, int codes_size,
320 const void *symbols, int symbols_wrap, int symbols_size,
321 int flags)
322 {
323 36911 VLCcode localbuf[LOCALBUF_ELEMS], *buf = localbuf;
324 int i, j, ret;
325
326 36911 ret = vlc_common_init(vlc, nb_bits, nb_codes, &buf, flags);
327
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 36911 times.
36911 if (ret < 0)
328 return ret;
329
330
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 36911 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
36911 av_assert0(symbols_size <= 2 || !symbols);
331 36911 j = 0;
332 #define COPY(condition)\
333 for (i = 0; i < nb_codes; i++) { \
334 unsigned len; \
335 GET_DATA(len, bits, i, bits_wrap, bits_size); \
336 if (!(condition)) \
337 continue; \
338 if (len > 3*nb_bits || len > 32) { \
339 av_log(NULL, AV_LOG_ERROR, "Too long VLC (%u) in init_vlc\n", len);\
340 if (buf != localbuf) \
341 av_free(buf); \
342 return AVERROR(EINVAL); \
343 } \
344 buf[j].bits = len; \
345 GET_DATA(buf[j].code, codes, i, codes_wrap, codes_size); \
346 if (buf[j].code >= (1LL<<buf[j].bits)) { \
347 av_log(NULL, AV_LOG_ERROR, "Invalid code %"PRIx32" for %d in " \
348 "init_vlc\n", buf[j].code, i); \
349 if (buf != localbuf) \
350 av_free(buf); \
351 return AVERROR(EINVAL); \
352 } \
353 if (flags & INIT_VLC_INPUT_LE) \
354 buf[j].code = bitswap_32(buf[j].code); \
355 else \
356 buf[j].code <<= 32 - buf[j].bits; \
357 if (symbols) \
358 GET_DATA(buf[j].symbol, symbols, i, symbols_wrap, symbols_size) \
359 else \
360 buf[j].symbol = i; \
361 j++; \
362 }
363
19/27
✓ Branch 0 taken 2818213 times.
✓ Branch 1 taken 310065 times.
✓ Branch 2 taken 106765 times.
✓ Branch 3 taken 1109023 times.
✓ Branch 4 taken 2126020 times.
✓ Branch 5 taken 2126020 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✓ Branch 8 taken 2126020 times.
✗ Branch 10 not taken.
✗ Branch 11 not taken.
✓ Branch 13 taken 45797 times.
✓ Branch 14 taken 975584 times.
✓ Branch 15 taken 1104639 times.
✗ Branch 16 not taken.
✓ Branch 17 taken 2126020 times.
✗ Branch 19 not taken.
✗ Branch 20 not taken.
✓ Branch 22 taken 325405 times.
✓ Branch 23 taken 1800615 times.
✓ Branch 25 taken 155749 times.
✓ Branch 26 taken 1970271 times.
✓ Branch 27 taken 22247 times.
✓ Branch 28 taken 133502 times.
✗ Branch 29 not taken.
✓ Branch 30 taken 3235043 times.
✓ Branch 31 taken 36911 times.
3271954 COPY(len > nb_bits);
364 // qsort is the slowest part of init_vlc, and could probably be improved or avoided
365
44/44
✓ Branch 0 taken 773960 times.
✓ Branch 1 taken 248967 times.
✓ Branch 3 taken 357979 times.
✓ Branch 4 taken 415981 times.
✓ Branch 6 taken 119733 times.
✓ Branch 7 taken 238246 times.
✓ Branch 9 taken 125663 times.
✓ Branch 10 taken 290318 times.
✓ Branch 12 taken 416772 times.
✓ Branch 13 taken 357188 times.
✓ Branch 14 taken 141086 times.
✓ Branch 15 taken 632874 times.
✓ Branch 16 taken 8591074 times.
✓ Branch 17 taken 189505 times.
✓ Branch 19 taken 6164453 times.
✓ Branch 20 taken 2426621 times.
✓ Branch 21 taken 8547025 times.
✓ Branch 22 taken 529265 times.
✓ Branch 24 taken 6460164 times.
✓ Branch 25 taken 2086861 times.
✓ Branch 26 taken 2086861 times.
✓ Branch 27 taken 529265 times.
✓ Branch 28 taken 2616126 times.
✓ Branch 29 taken 632874 times.
✓ Branch 30 taken 124864 times.
✓ Branch 31 taken 508010 times.
✓ Branch 32 taken 98743 times.
✓ Branch 33 taken 26121 times.
✓ Branch 34 taken 50071 times.
✓ Branch 35 taken 48672 times.
✓ Branch 36 taken 657455 times.
✓ Branch 37 taken 23088 times.
✓ Branch 39 taken 604351 times.
✓ Branch 40 taken 53104 times.
✓ Branch 41 taken 23088 times.
✓ Branch 42 taken 53104 times.
✓ Branch 43 taken 245608 times.
✓ Branch 44 taken 364178 times.
✓ Branch 46 taken 140446 times.
✓ Branch 47 taken 108521 times.
✓ Branch 48 taken 1022927 times.
✓ Branch 49 taken 233556 times.
✓ Branch 50 taken 646697 times.
✓ Branch 51 taken 36911 times.
17138488 AV_QSORT(buf, j, struct VLCcode, compare_vlcspec);
366
21/29
✓ Branch 0 taken 2818213 times.
✓ Branch 1 taken 310065 times.
✓ Branch 2 taken 106765 times.
✓ Branch 3 taken 3153940 times.
✓ Branch 4 taken 81103 times.
✓ Branch 5 taken 2126020 times.
✓ Branch 6 taken 1027920 times.
✓ Branch 7 taken 1027920 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 1027920 times.
✗ Branch 12 not taken.
✗ Branch 13 not taken.
✓ Branch 15 taken 166887 times.
✓ Branch 16 taken 567445 times.
✓ Branch 17 taken 293588 times.
✗ Branch 18 not taken.
✓ Branch 19 taken 1027920 times.
✗ Branch 21 not taken.
✗ Branch 22 not taken.
✓ Branch 24 taken 80419 times.
✓ Branch 25 taken 947501 times.
✓ Branch 27 taken 327692 times.
✓ Branch 28 taken 700228 times.
✓ Branch 29 taken 160761 times.
✓ Branch 30 taken 166931 times.
✗ Branch 31 not taken.
✓ Branch 32 taken 3235043 times.
✓ Branch 33 taken 36911 times.
3271954 COPY(len && len <= nb_bits);
367 36911 nb_codes = j;
368
369 36911 return vlc_common_end(vlc, nb_bits, nb_codes, buf,
370 flags, localbuf);
371 }
372
373 21944 int ff_init_vlc_from_lengths(VLC *vlc, int nb_bits, int nb_codes,
374 const int8_t *lens, int lens_wrap,
375 const void *symbols, int symbols_wrap, int symbols_size,
376 int offset, int flags, void *logctx)
377 {
378 21944 VLCcode localbuf[LOCALBUF_ELEMS], *buf = localbuf;
379 uint64_t code;
380 21944 int ret, j, len_max = FFMIN(32, 3 * nb_bits);
381
382 21944 ret = vlc_common_init(vlc, nb_bits, nb_codes, &buf, flags);
383
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 21944 times.
21944 if (ret < 0)
384 return ret;
385
386 21944 j = code = 0;
387
2/2
✓ Branch 0 taken 1441779 times.
✓ Branch 1 taken 21944 times.
1463723 for (int i = 0; i < nb_codes; i++, lens += lens_wrap) {
388 1441779 int len = *lens;
389
2/2
✓ Branch 0 taken 1438131 times.
✓ Branch 1 taken 3648 times.
1441779 if (len > 0) {
390 unsigned sym;
391
392 1438131 buf[j].bits = len;
393
2/2
✓ Branch 0 taken 1434109 times.
✓ Branch 1 taken 4022 times.
1438131 if (symbols)
394
2/3
✓ Branch 0 taken 238874 times.
✓ Branch 1 taken 1195235 times.
✗ Branch 2 not taken.
1434109 GET_DATA(sym, symbols, i, symbols_wrap, symbols_size)
395 else
396 4022 sym = i;
397 1438131 buf[j].symbol = sym + offset;
398 1438131 buf[j++].code = code;
399
2/2
✓ Branch 0 taken 1536 times.
✓ Branch 1 taken 2112 times.
3648 } else if (len < 0) {
400 1536 len = -len;
401 } else
402 2112 continue;
403
2/4
✓ Branch 0 taken 1439667 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 1439667 times.
1439667 if (len > len_max || code & ((1U << (32 - len)) - 1)) {
404 av_log(logctx, AV_LOG_ERROR, "Invalid VLC (length %u)\n", len);
405 goto fail;
406 }
407 1439667 code += 1U << (32 - len);
408
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1439667 times.
1439667 if (code > UINT32_MAX + 1ULL) {
409 av_log(logctx, AV_LOG_ERROR, "Overdetermined VLC tree\n");
410 goto fail;
411 }
412 }
413 21944 return vlc_common_end(vlc, nb_bits, j, buf, flags, localbuf);
414 fail:
415 if (buf != localbuf)
416 av_free(buf);
417 return AVERROR_INVALIDDATA;
418 }
419
420 31332 void ff_free_vlc(VLC *vlc)
421 {
422 31332 av_freep(&vlc->table);
423 31332 }
424