Lines Matching full:trees

1 /* trees.c -- output deflated data using Huffman coding
10  *      The "deflation" process uses several Huffman trees. The more
84 /* non ANSI compilers may not accept trees.h */
114 #  include "trees.h"
376  * Generate the file trees.h describing the static trees.
388     FILE *header = fopen("trees.h", "w");  in gen_trees_header()
391     Assert (header != NULL, "Can't open trees.h");  in gen_trees_header()
442     /* Initialize the trees. */  in init_block()
801     /* Determine the bit length frequencies for literal and distance trees */  in build_bl_tree()
820     Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",  in build_bl_tree()
827  * Send the header for a block using dynamic Huffman trees: the counts, the
896  * Send the block data compressed using the given Huffman trees
992  * Determine the best encoding for the current block: dynamic trees, static
993  * trees or store, and write out the encoded block.
1000     /* Build the Huffman trees unless a stored block is forced */
1007         /* Construct the literal and distance trees */
1019         /* Build the bit length tree for the above two trees, and get the index