117                            Node *nodes, int node,  in get_tree_codes()  argument
122     s = nodes[node].sym;  in get_tree_codes()
123     if (s != HNODE || (no_zero_count && !nodes[node].count)) {  in get_tree_codes()
131         get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl,  in get_tree_codes()
134         get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0 + 1, pfx, pl,  in get_tree_codes()
139 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags, int nb_bits)  in build_huff_tree()  argument
147     get_tree_codes(bits, lens, xlat, nodes, head, 0, 0,  in build_huff_tree()
158                        Node *nodes, HuffCmp cmp, int flags)  in ff_huff_build_tree()  argument
165         nodes[i].sym = i;  in ff_huff_build_tree()
166         nodes[i].n0 = -2;  in ff_huff_build_tree()
167         sum += nodes[i].count;  in ff_huff_build_tree()
176     AV_QSORT(nodes, nb_codes, Node, cmp);  in ff_huff_build_tree()
178     nodes[nb_codes*2-1].count = 0;  in ff_huff_build_tree()
180         uint32_t cur_count = nodes[i].count + nodes[i+1].count;  in ff_huff_build_tree()
184             if(cur_count > nodes[j-1].count ||  in ff_huff_build_tree()
185                (cur_count == nodes[j-1].count &&  in ff_huff_build_tree()
188             nodes[j] = nodes[j - 1];  in ff_huff_build_tree()
190         nodes[j].sym = HNODE;  in ff_huff_build_tree()
191         nodes[j].count = cur_count;  in ff_huff_build_tree()
192         nodes[j].n0 = i;  in ff_huff_build_tree()
195     if (build_huff_tree(vlc, nodes, nb_codes * 2 - 2, flags, nb_bits) < 0) {  in ff_huff_build_tree()