Home | History | Annotate | Download | only in gzip

Lines Matching defs:tree

38  *	    06 - Level for the huffman tree (<=24)
41  * tree levels, each level would consume 1 byte (See [1]).
52  * have at most 256 symbols in the huffman tree.  pack(1) rejects empty
65  * Represent the huffman tree in a similar way that pack(1) would
73 	int		treelevels;	/* Levels for the huffman tree */
82 	char		**tree;		/* Decoding huffman tree (pointers to
83 					   first symbol of each tree level */
105 	free(unpackd->tree);
143  * Read file header and construct the tree.  Also, prepare the buffered I/O
175 	/* Get the levels of the tree */
178 		maybe_errx("Huffman tree has insane levels");
186 	/* Allocate for the tables of bounds and the tree itself */
191 	unpackd->tree =
192 	    calloc(unpackd->treelevels, (sizeof (*(unpackd->tree))));
194 	    unpackd->tree == NULL)
229 		unpackd->tree[i] = unpackd->symbol_eob;
250  * Decode huffman stream, based on the huffman tree.
265 	 * Assumption: sizeof(int) > ((max tree levels + 1) / 8).
279 		 * the tree.
292 				    &(unpackd->tree[thislevel][inlevelindex]);