30
31
/* symbol for Huffman tree node */
34
static void get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat, Node *nodes, int node, uint32_t pfx, int pl, int *pos, int no_zero_count)
39
static void heap_sift(HeapElem *h, int root, int size)
41
while (root * 2 + 1 < size) {
42
int child = root * 2 + 1;
43
if (child < size - 1 && h[child].val > h[child+1].val)
45
if (h[root].val > h[child].val) {
46
FFSWAP(HeapElem, h[root], h[child]);
53
void ff_huff_gen_len_table(uint8_t *dst, const uint64_t *stats)
61
for (offset = 1; ; offset <<= 1) {
62
for (i=0; i < size; i++) {
64
h[i].val = (stats[i] << 8) + offset;
66
for (i = size / 2 - 1; i >= 0; i--)
67
heap_sift(h, i, size);
69
for (next = size; next < size * 2 - 1; next++) {
70
// merge the two smallest entries, and put it back in the heap
71
uint64_t min1v = h[0].val;
74
heap_sift(h, 0, size);
78
heap_sift(h, 0, size);
81
len[2 * size - 2] = 0;
82
for (i = 2 * size - 3; i >= size; i--)
83
len[i] = len[up[i]] + 1;
84
for (i = 0; i < size; i++) {
85
dst[i] = len[up[i]] + 1;
86
if (dst[i] >= 32) break;
92
static void get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat,
93
Node *nodes, int node,
94
uint32_t pfx, int pl, int *pos, int no_zero_count)
38
98
s = nodes[node].sym;
39
if(s != HNODE || (no_zero_count && !nodes[node].count)){
99
if (s != HNODE || (no_zero_count && !nodes[node].count)) {
47
get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl, pos,
107
get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl,
50
get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0+1, pfx, pl, pos,
110
get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0 + 1, pfx, pl,
60
120
uint8_t xlat[256];
63
get_tree_codes(bits, lens, xlat, nodes, head, 0, 0, &pos, no_zero_count);
123
get_tree_codes(bits, lens, xlat, nodes, head, 0, 0,
124
&pos, no_zero_count);
64
125
return ff_init_vlc_sparse(vlc, 9, pos, lens, 2, 2, bits, 4, 4, xlat, 1, 1, 0);
79
for(i = 0; i < nb_codes; i++){
140
for (i = 0; i < nb_codes; i++) {
82
143
sum += nodes[i].count;
86
av_log(avctx, AV_LOG_ERROR, "Too high symbol frequencies. Tree construction is not possible\n");
147
av_log(avctx, AV_LOG_ERROR,
148
"Too high symbol frequencies. "
149
"Tree construction is not possible\n");
89
152
qsort(nodes, nb_codes, sizeof(Node), cmp);
90
153
cur_node = nb_codes;
91
154
nodes[nb_codes*2-1].count = 0;
92
for(i = 0; i < nb_codes*2-1; i += 2){
155
for (i = 0; i < nb_codes * 2 - 1; i += 2) {
93
156
nodes[cur_node].sym = HNODE;
94
nodes[cur_node].count = nodes[i].count + nodes[i+1].count;
157
nodes[cur_node].count = nodes[i].count + nodes[i + 1].count;
95
158
nodes[cur_node].n0 = i;
96
for(j = cur_node; j > 0; j--){
97
if(nodes[j].count > nodes[j-1].count ||
98
(nodes[j].count == nodes[j-1].count &&
99
(!(flags & FF_HUFFMAN_FLAG_HNODE_FIRST) ||
100
nodes[j].n0==j-1 || nodes[j].n0==j-2 ||
101
(nodes[j].sym!=HNODE && nodes[j-1].sym!=HNODE))))
159
for (j = cur_node; j > 0; j--) {
160
if (nodes[j].count > nodes[j - 1].count ||
161
(nodes[j].count == nodes[j - 1].count &&
162
(!(flags & FF_HUFFMAN_FLAG_HNODE_FIRST) ||
163
nodes[j].n0 == j - 1 || nodes[j].n0 == j - 2 ||
164
(nodes[j].sym!=HNODE && nodes[j-1].sym!=HNODE))))
103
FFSWAP(Node, nodes[j], nodes[j-1]);
166
FFSWAP(Node, nodes[j], nodes[j - 1]);
107
if(build_huff_tree(vlc, nodes, nb_codes*2-2, flags) < 0){
170
if (build_huff_tree(vlc, nodes, nb_codes * 2 - 2, flags) < 0) {
108
171
av_log(avctx, AV_LOG_ERROR, "Error building tree\n");