Lines Matching defs:nodes
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)
38 s = nodes[node].sym;
39 if(s != HNODE || (no_zero_count && !nodes[node].count)){
47 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl, pos,
50 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0+1, pfx, pl, pos,
55 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags)
63 get_tree_codes(bits, lens, xlat, nodes, head, 0, 0, &pos, no_zero_count);
69 * nodes size must be 2*nb_codes
70 * first nb_codes nodes.count must be set
73 Node *nodes, HuffCmp cmp, int flags)
80 nodes[i].sym = i;
81 nodes[i].n0 = -2;
82 sum += nodes[i].count;
89 qsort(nodes, nb_codes, sizeof(Node), cmp);
91 nodes[nb_codes*2-1].count = 0;
93 nodes[cur_node].sym = HNODE;
94 nodes[cur_node].count = nodes[i].count + nodes[i+1].count;
95 nodes[cur_node].n0 = i;
97 if(nodes[j].count > nodes[j-1].count ||
98 (nodes[j].count == nodes[j-1].count &&
100 nodes[j].n0==j-1 || nodes[j].n0==j-2 ||
101 (nodes[j].sym!=HNODE && nodes[j-1].sym!=HNODE))))
103 FFSWAP(Node, nodes[j], nodes[j-1]);
107 if(build_huff_tree(vlc, nodes, nb_codes*2-2, flags) < 0){