Lines Matching refs:max_len
33 local int max_len; /* maximum bit length of Huffman codes */
104 max_len = (int)get_byte(); /* maximum bit length of Huffman codes */
105 if (max_len > MAX_BITLEN) {
111 for (len = 1; len <= max_len; len++) {
118 Trace((stderr, "orig_len %ld, max_len %d, leaves %d\n",
119 orig_len, max_len, n));
120 /* There are at least 2 and at most 256 leaves of length max_len.
127 leaves[max_len]++;
131 for (len = 1; len <= max_len; len++) {
139 leaves[max_len]++; /* Now include the EOB code in the Huffman tree */
151 for (len = max_len; len >= 1; len--) {
167 peek_bits = MIN(max_len, MAX_PEEK);
202 eob = leaves[max_len]-1;
203 Trace((stderr, "eob %d %x\n", max_len, eob));
207 /* Since eob is the longest code and not shorter than max_len,
208 * we can peek at max_len bits without having the risk of reading
226 if (peek == eob && len == max_len) break; /* end of file? */