Lines Matching defs:len
42 unsigned len; /* a code's length in bits */
109 for (len = 0; len <= MAXBITS; len++)
110 count[len] = 0;
134 for (len = 1; len <= MAXBITS; len++) {
136 left -= count[len];
144 for (len = 1; len < MAXBITS; len++)
145 offs[len + 1] = offs[len] + count[len];
154 with length len. That code is converted to an index by dropping drop
155 bits off of the bottom. For codes where len is less than drop + curr,
156 those top drop + curr - len bits are incremented through all values to
159 root is the number of index bits for the root table. When len exceeds
205 len = min; /* starting code length */
209 low = (unsigned)(-1); /* trigger new sub-table when len > root */
220 this.bits = (unsigned char)(len - drop);
234 /* replicate for those indices with low len bits equal to huff */
235 incr = 1U << (len - drop);
243 /* backwards increment the len-bit code huff */
244 incr = 1U << (len - 1);
254 /* go to next symbol, update count, len */
256 if (--(count[len]) == 0) {
257 if (len == max) break;
258 len = lens[work[sym]];
262 if (len > root && (huff & mask) != low) {
271 curr = len - drop;
296 len is equal to curr + drop, so there is no loop needed to increment
301 this.bits = (unsigned char)(len - drop);
307 len = root;
309 this.bits = (unsigned char)len;
315 /* backwards increment the len-bit code huff */
316 incr = 1U << (len - 1);