Lines Matching defs:len
35 unsigned len; /* a code's length in bits */
102 for (len = 0; len <= MAXBITS; len++)
103 count[len] = 0;
127 for (len = 1; len <= MAXBITS; len++) {
129 left -= count[len];
137 for (len = 1; len < MAXBITS; len++)
138 offs[len + 1] = offs[len] + count[len];
147 with length len. That code is converted to an index by dropping drop
148 bits off of the bottom. For codes where len is less than drop + curr,
149 those top drop + curr - len bits are incremented through all values to
152 root is the number of index bits for the root table. When len exceeds
195 len = min; /* starting code length */
199 low = (unsigned)(-1); /* trigger new sub-table when len > root */
211 here.bits = (unsigned char)(len - drop);
225 /* replicate for those indices with low len bits equal to huff */
226 incr = 1U << (len - drop);
234 /* backwards increment the len-bit code huff */
235 incr = 1U << (len - 1);
245 /* go to next symbol, update count, len */
247 if (--(count[len]) == 0) {
248 if (len == max) break;
249 len = lens[work[sym]];
253 if (len > root && (huff & mask) != low) {
262 curr = len - drop;
290 here.bits = (unsigned char)(len - drop);