Lines Matching refs:tree_size
192 int tree_size = tree_size_orig;
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees);
212 if (tree_size > 1) { // Normal case.
214 while (tree_size > 1) { // Finish when we have only one root.
216 tree_pool[tree_pool_size++] = tree[tree_size - 1];
217 tree_pool[tree_pool_size++] = tree[tree_size - 2];
220 tree_size -= 2;
224 for (k = 0; k < tree_size; ++k) {
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree));
235 tree_size = tree_size + 1;
239 } else if (tree_size == 1) { // Trivial case: only one element.
