FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/huffman.c
Date: 2025-03-23 22:11:24
Exec Total Coverage
Lines: 91 97 93.8%
Functions: 5 5 100.0%
Branches: 92 102 90.2%
Line Branch Exec Source
1 /*
2 * Copyright (c) 2006 Konstantin Shishkov
3 * Copyright (c) 2007 Loren Merritt
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file
24 * huffman tree builder and VLC generator
25 */
26
27 #include <stdint.h>
28
29 #include "libavutil/error.h"
30 #include "libavutil/log.h"
31 #include "libavutil/macros.h"
32 #include "libavutil/mem.h"
33 #include "libavutil/qsort.h"
34
35 #include "huffman.h"
36 #include "vlc.h"
37
38 /* symbol for Huffman tree node */
39 #define HNODE -1
40
41 typedef struct HeapElem {
42 uint64_t val;
43 int name;
44 } HeapElem;
45
46 1973140 static void heap_sift(HeapElem *h, int root, int size)
47 {
48
2/2
✓ Branch 0 taken 13354908 times.
✓ Branch 1 taken 761161 times.
 14116069 while (root * 2 + 1 < size) {
49 13354908 int child = root * 2 + 1;
50
4/4
✓ Branch 0 taken 13346304 times.
✓ Branch 1 taken 8604 times.
✓ Branch 2 taken 6177070 times.
✓ Branch 3 taken 7169234 times.
 13354908 if (child < size - 1 && h[child].val > h[child+1].val)
51 6177070 child++;
52
2/2
✓ Branch 0 taken 12142929 times.
✓ Branch 1 taken 1211979 times.
 13354908 if (h[root].val > h[child].val) {
53 12142929 FFSWAP(HeapElem, h[root], h[child]);
54 12142929 root = child;
55 } else
56 1211979 break;
57 }
58 1973140 }
59
60 2446 int ff_huff_gen_len_table(uint8_t *dst, const uint64_t *stats, int stats_size, int skip0)
61 {
62 2446 HeapElem *h = av_malloc_array(sizeof(*h), stats_size);
63 2446 int *up = av_malloc_array(sizeof(*up) * 2, stats_size);
64 2446 uint8_t *len = av_malloc_array(sizeof(*len) * 2, stats_size);
65 2446 uint16_t *map= av_malloc_array(sizeof(*map), stats_size);
66 int offset, i, next;
67 2446 int size = 0;
68 2446 int ret = 0;
69
70
4/8
✓ Branch 0 taken 2446 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2446 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2446 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 2446 times.
 2446 if (!h || !up || !len || !map) {
71 ✗ ret = AVERROR(ENOMEM);
72 ✗ goto end;
73 }
74
75
2/2
✓ Branch 0 taken 875008 times.
✓ Branch 1 taken 2446 times.
 877454 for (i = 0; i<stats_size; i++) {
76 875008 dst[i] = 255;
77
3/4
✓ Branch 0 taken 83691 times.
✓ Branch 1 taken 791317 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 83691 times.
 875008 if (stats[i] || !skip0)
78 791317 map[size++] = i;
79 }
80
81 2446 for (offset = 1; ; offset <<= 1) {
82
2/2
✓ Branch 0 taken 791317 times.
✓ Branch 1 taken 2446 times.
 793763 for (i=0; i < size; i++) {
83 791317 h[i].name = i;
84 791317 h[i].val = (stats[map[i]] << 14) + offset;
85 }
86
2/2
✓ Branch 0 taken 395398 times.
✓ Branch 1 taken 2446 times.
 397844 for (i = size / 2 - 1; i >= 0; i--)
87 395398 heap_sift(h, i, size);
88
89
2/2
✓ Branch 0 taken 788871 times.
✓ Branch 1 taken 2446 times.
 791317 for (next = size; next < size * 2 - 1; next++) {
90 // merge the two smallest entries, and put it back in the heap
91 788871 uint64_t min1v = h[0].val;
92 788871 up[h[0].name] = next;
93 788871 h[0].val = INT64_MAX;
94 788871 heap_sift(h, 0, size);
95 788871 up[h[0].name] = next;
96 788871 h[0].name = next;
97 788871 h[0].val += min1v;
98 788871 heap_sift(h, 0, size);
99 }
100
101 2446 len[2 * size - 2] = 0;
102
2/2
✓ Branch 0 taken 786425 times.
✓ Branch 1 taken 2446 times.
 788871 for (i = 2 * size - 3; i >= size; i--)
103 786425 len[i] = len[up[i]] + 1;
104
2/2
✓ Branch 0 taken 791317 times.
✓ Branch 1 taken 2446 times.
 793763 for (i = 0; i < size; i++) {
105 791317 dst[map[i]] = len[up[i]] + 1;
106
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 791317 times.
 791317 if (dst[map[i]] >= 32) break;
107 }
108
1/2
✓ Branch 0 taken 2446 times.
✗ Branch 1 not taken.
 2446 if (i==size) break;
109 }
110 2446 end:
111 2446 av_free(h);
112 2446 av_free(up);
113 2446 av_free(len);
114 2446 av_free(map);
115 2446 return ret;
116 }
117
118 319323 static void get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat,
119 Node *nodes, int node,
120 uint32_t pfx, int pl, int *pos, int no_zero_count)
121 {
122 int s;
123
124 319323 s = nodes[node].sym;
125
5/6
✓ Branch 0 taken 157113 times.
✓ Branch 1 taken 162210 times.
✓ Branch 2 taken 50778 times.
✓ Branch 3 taken 106335 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 50778 times.
 319323 if (s != HNODE || (no_zero_count && !nodes[node].count)) {
126 162210 bits[*pos] = pfx;
127 162210 lens[*pos] = pl;
128 162210 xlat[*pos] = s;
129 162210 (*pos)++;
130 } else {
131 157113 pfx <<= 1;
132 157113 pl++;
133 157113 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl,
134 pos, no_zero_count);
135 157113 pfx |= 1;
136 157113 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0 + 1, pfx, pl,
137 pos, no_zero_count);
138 }
139 319323 }
140
141 5097 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags, int nb_bits)
142 {
143 5097 int no_zero_count = !(flags & FF_HUFFMAN_FLAG_ZERO_COUNT);
144 uint32_t bits[256];
145 int16_t lens[256];
146 uint8_t xlat[256];
147 5097 int pos = 0;
148
149 5097 get_tree_codes(bits, lens, xlat, nodes, head, 0, 0,
150 &pos, no_zero_count);
151 5097 return ff_vlc_init_sparse(vlc, nb_bits, pos, lens, 2, 2, bits, 4, 4, xlat, 1, 1, 0);
152 }
153
154
155 /**
156 * nodes size must be 2*nb_codes
157 * first nb_codes nodes.count must be set
158 */
159 5097 int ff_huff_build_tree(void *logctx, VLC *vlc, int nb_codes, int nb_bits,
160 Node *nodes, HuffCmp cmp, int flags)
161 {
162 int i, j;
163 int cur_node;
164 5097 int64_t sum = 0;
165
166
2/2
✓ Branch 0 taken 162210 times.
✓ Branch 1 taken 5097 times.
 167307 for (i = 0; i < nb_codes; i++) {
167 162210 nodes[i].sym = i;
168 162210 nodes[i].n0 = -2;
169 162210 sum += nodes[i].count;
170 }
171
172
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5097 times.
 5097 if (sum >> 31) {
173 ✗ av_log(logctx, AV_LOG_ERROR,
174 "Too high symbol frequencies. "
175 "Tree construction is not possible\n");
176 ✗ return -1;
177 }
178
44/44
✓ Branch 0 taken 66248 times.
✓ Branch 1 taken 23732 times.
✓ Branch 3 taken 36365 times.
✓ Branch 4 taken 29883 times.
✓ Branch 6 taken 11086 times.
✓ Branch 7 taken 25279 times.
✓ Branch 9 taken 8949 times.
✓ Branch 10 taken 20934 times.
✓ Branch 12 taken 35522 times.
✓ Branch 13 taken 30726 times.
✓ Branch 14 taken 13551 times.
✓ Branch 15 taken 52697 times.
✓ Branch 16 taken 510008 times.
✓ Branch 17 taken 23486 times.
✓ Branch 19 taken 353232 times.
✓ Branch 20 taken 156776 times.
✓ Branch 21 taken 333731 times.
✓ Branch 22 taken 44596 times.
✓ Branch 24 taken 198065 times.
✓ Branch 25 taken 135666 times.
✓ Branch 26 taken 44596 times.
✓ Branch 27 taken 135666 times.
✓ Branch 28 taken 180262 times.
✓ Branch 29 taken 52697 times.
✓ Branch 30 taken 6731 times.
✓ Branch 31 taken 45966 times.
✓ Branch 32 taken 4852 times.
✓ Branch 33 taken 1879 times.
✓ Branch 34 taken 1475 times.
✓ Branch 35 taken 3377 times.
✓ Branch 36 taken 7939 times.
✓ Branch 37 taken 619 times.
✓ Branch 39 taken 5204 times.
✓ Branch 40 taken 2735 times.
✓ Branch 41 taken 619 times.
✓ Branch 42 taken 2735 times.
✓ Branch 43 taken 28167 times.
✓ Branch 44 taken 23911 times.
✓ Branch 46 taken 11240 times.
✓ Branch 47 taken 12492 times.
✓ Branch 48 taken 89980 times.
✓ Branch 49 taken 19273 times.
✓ Branch 50 taken 57175 times.
✓ Branch 51 taken 5097 times.
 903810 AV_QSORT(nodes, nb_codes, Node, cmp);
179 5097 cur_node = nb_codes;
180 5097 nodes[nb_codes*2-1].count = 0;
181
2/2
✓ Branch 0 taken 162210 times.
✓ Branch 1 taken 5097 times.
 167307 for (i = 0; i < nb_codes * 2 - 1; i += 2) {
182 162210 uint32_t cur_count = nodes[i].count + nodes[i+1].count;
183 // find correct place to insert new node, and
184 // make space for the new node while at it
185
2/2
✓ Branch 0 taken 5685299 times.
✓ Branch 1 taken 23161 times.
 5708460 for(j = cur_node; j > i + 2; j--){
186
2/2
✓ Branch 0 taken 5617648 times.
✓ Branch 1 taken 67651 times.
 5685299 if(cur_count > nodes[j-1].count ||
187
2/2
✓ Branch 0 taken 101452 times.
✓ Branch 1 taken 5516196 times.
 5617648 (cur_count == nodes[j-1].count &&
188
2/2
✓ Branch 0 taken 30054 times.
✓ Branch 1 taken 71398 times.
 101452 !(flags & FF_HUFFMAN_FLAG_HNODE_FIRST)))
189 break;
190 5546250 nodes[j] = nodes[j - 1];
191 }
192 162210 nodes[j].sym = HNODE;
193 162210 nodes[j].count = cur_count;
194 162210 nodes[j].n0 = i;
195 162210 cur_node++;
196 }
197
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 5097 times.
 5097 if (build_huff_tree(vlc, nodes, nb_codes * 2 - 2, flags, nb_bits) < 0) {
198 ✗ av_log(logctx, AV_LOG_ERROR, "Error building tree\n");
199 ✗ return -1;
200 }
201 5097 return 0;
202 }
203