Lines Matching defs:nodes
31 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)
35 s = nodes[node].sym;
36 if(s != HNODE || (no_zero_count && !nodes[node].count)){
44 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl, pos,
47 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0+1, pfx, pl, pos,
52 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags)
60 get_tree_codes(bits, lens, xlat, nodes, head, 0, 0, &pos, no_zero_count);
66 * nodes size must be 2*nb_codes
67 * first nb_codes nodes.count must be set
70 Node *nodes, HuffCmp cmp, int flags)
77 nodes[i].sym = i;
78 nodes[i].n0 = -2;
79 sum += nodes[i].count;
86 qsort(nodes, nb_codes, sizeof(Node), cmp);
88 nodes[nb_codes*2-1].count = 0;
90 nodes[cur_node].sym = HNODE;
91 nodes[cur_node].count = nodes[i].count + nodes[i+1].count;
92 nodes[cur_node].n0 = i;
94 if(nodes[j].count > nodes[j-1].count ||
95 (nodes[j].count == nodes[j-1].count &&
97 nodes[j].n0==j-1 || nodes[j].n0==j-2 ||
98 (nodes[j].sym!=HNODE && nodes[j-1].sym!=HNODE))))
100 FFSWAP(Node, nodes[j], nodes[j-1]);
104 if(build_huff_tree(vlc, nodes, nb_codes*2-2, flags) < 0){