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
75 /* The lengths of the bit length codes are sent in order of decreasing
76  * probability, to avoid transmitting the lengths for unused bit length codes.
84 /* The static literal tree. Since the bit lengths are imposed, there is no
344  * Compute the optimal bit lengths for a tree and update the total bit length
373     /* In a first pass, compute the optimal bit lengths (which may  in gen_bitlen()
412     /* Now recompute all bit lengths, scanning in increasing frequency.  in gen_bitlen()
414      * lengths instead of fixing only the wrong ones. This idea is taken  in gen_bitlen()
477  * Construct one Huffman tree and assigns the code bit strings and lengths.
526      * establish sub-heaps of increasing lengths:  in build_tree()
560      * generate the bit lengths.  in build_tree()
667  * Construct the Huffman tree for the bit lengths and return the index in
683      * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.  in build_bl_tree()
703  * lengths of the bit length codes, the literal tree and the distance tree.
826 	/* At this point, opt_len and static_len are the total bit lengths of
873                        /* 4: two words for the lengths */