Lines Matching defs:tree
37 * 06 - Level for the huffman tree (<=24)
40 * tree levels, each level would consume 1 byte (See [1]).
51 * have at most 256 symbols in the huffman tree. pack(1) rejects empty
64 * Represent the huffman tree in a similar way that pack(1) would
72 int treelevels; /* Levels for the huffman tree */
81 char **tree; /* Decoding huffman tree (pointers to
82 first symbol of each tree level */
104 free(unpackd->tree);
142 * Read file header and construct the tree. Also, prepare the buffered I/O
173 /* Get the levels of the tree */
176 maybe_errx("Huffman tree has insane levels");
184 /* Allocate for the tables of bounds and the tree itself */
189 unpackd->tree =
190 calloc(unpackd->treelevels, (sizeof (*(unpackd->tree))));
192 unpackd->tree == NULL)
226 unpackd->tree[i] = unpackd->symbol_eob;
246 * Decode huffman stream, based on the huffman tree.
261 * Assumption: sizeof(int) > ((max tree levels + 1) / 8).
273 * the tree.
286 &(unpackd->tree[thislevel][inlevelindex]);