Lines Matching full:lengths

14  * a Huffman encoding of the lengths of all the code strings (in
16  * reconstructed from the lengths in the inflate process, as described
73 /* The lengths of the bit length codes are sent in order of decreasing
74  * probability, to avoid transmitting the lengths for unused bit length codes.
87 /* The static literal tree. Since the bit lengths are imposed, there is no
529  * Compute the optimal bit lengths for a tree and update the total bit length
554     /* In a first pass, compute the optimal bit lengths (which may  in gen_bitlen()
593     /* Now recompute all bit lengths, scanning in increasing frequency.  in gen_bitlen()
595      * lengths instead of fixing only the wrong ones. This idea is taken  in gen_bitlen()
618  * Construct one Huffman tree and assigns the code bit strings and lengths.
663      * establish sub-heaps of increasing lengths:  in build_tree()
698      * generate the bit lengths.  in build_tree()
795  * Construct the Huffman tree for the bit lengths and return the index in
808      * lengths of the bit lengths codes and the 5 + 5 + 4 bits for the counts.  in build_bl_tree()
828  * lengths of the bit length codes, the literal tree and the distance tree.
1015         /* At this point, opt_len and static_len are the total bit lengths of
1024         /* Determine the best encoding. Compute the block lengths in bytes. */
1046                        /* 4: two words for the lengths */