Lines Matching refs:nodes
119 Node *nodes, int node,
124 s = nodes[node].sym;
125 if (s != HNODE || (no_zero_count && !nodes[node].count)) {
133 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl,
136 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0 + 1, pfx, pl,
141 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags, int nb_bits)
149 get_tree_codes(bits, lens, xlat, nodes, head, 0, 0,
156 * nodes size must be 2*nb_codes
157 * first nb_codes nodes.count must be set
160 Node *nodes, HuffCmp cmp, int flags)
167 nodes[i].sym = i;
168 nodes[i].n0 = -2;
169 sum += nodes[i].count;
178 AV_QSORT(nodes, nb_codes, Node, cmp);
180 nodes[nb_codes*2-1].count = 0;
182 uint32_t cur_count = nodes[i].count + nodes[i+1].count;
186 if(cur_count > nodes[j-1].count ||
187 (cur_count == nodes[j-1].count &&
190 nodes[j] = nodes[j - 1];
192 nodes[j].sym = HNODE;
193 nodes[j].count = cur_count;
194 nodes[j].n0 = i;
197 if (build_huff_tree(vlc, nodes, nb_codes * 2 - 2, flags, nb_bits) < 0) {