Lines Matching full:trees
1 /* +++ trees.c */
2 /* trees.c -- output deflated data using Huffman coding
10 * The "deflation" process uses several Huffman trees. The more
33 /* From: trees.c,v 1.11 1996/07/24 13:41:06 me Exp $ */
278 /* Initialize the trees. */ in init_block()
676 /* Determine the bit length frequencies for literal and distance trees */ in build_bl_tree()
695 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", in build_bl_tree()
702 * Send the header for a block using dynamic Huffman trees: the counts, the
798 * Determine the best encoding for the current block: dynamic trees, static
799 * trees or store, and output the encoded block to the zip file. This function
812 /* Build the Huffman trees unless a stored block is forced */
818 /* Construct the literal and distance trees */
830 /* Build the bit length tree for the above two trees, and get the index
884 } else if (static_lenb >= 0) { /* force static trees */
962 * Send the block data compressed using the given Huffman trees