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
202 curr = root; /* current table index bits */
232 fill = 1U << curr;
264 next += min; /* here min is 1 << curr */
267 curr = len - drop;
268 left = (int)(1 << curr);
269 while (curr + drop < max) {
270 left -= count[curr + drop];
272 curr++;
277 used += 1U << curr;
284 (*table)[low].op = (unsigned char)curr;
293 len is equal to curr + drop, so there is no loop needed to increment