Lines Matching refs:len
40 unsigned len; /* a code's length in bits */
109 for (len = 0; len <= MAXBITS; len++)
110 count[len] = 0;
126 for (len = 1; len <= MAXBITS; len++) {
128 left -= count[len];
136 for (len = 1; len < MAXBITS; len++)
137 offs[len + 1] = offs[len] + count[len];
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
151 root is the number of index bits for the root table. When len exceeds
196 len = min; /* starting code length */
200 low = (unsigned)(-1); /* trigger new sub-table when len > root */
212 this.bits = (unsigned char)(len - drop);
226 /* replicate for those indices with low len bits equal to huff */
227 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;
288 len is equal to curr + drop, so there is no loop needed to increment
293 this.bits = (unsigned char)(len - drop);
299 len = root;
302 this.bits = (unsigned char)len;
308 /* backwards increment the len-bit code huff */
309 incr = 1U << (len - 1);
