Lines Matching defs:curr
44 unsigned curr; /* number of index bits for current table */
151 filled is at next and has curr index bits. The code being used is huff
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
204 curr = root; /* current table index bits */
234 fill = 1U << curr;
266 next += min; /* here min is 1 << curr */
269 curr = len - drop;
270 left = (int)(1 << curr);
271 while (curr + drop < max) {
272 left -= count[curr + drop];
274 curr++;
279 used += 1U << curr;
286 (*table)[low].op = (unsigned char)curr;
295 len is equal to curr + drop, so there is no loop needed to increment
