Lines Matching refs:curr
71 unsigned curr; /* number of index bits for current table */
178 filled is at next and has curr index bits. The code being used is huff
180 bits off of the bottom. For codes where len is less than drop + curr,
181 those top drop + curr - len bits are incremented through all values to
232 curr = root; /* current table index bits */
261 fill = 1U << curr;
293 next += min; /* here min is 1 << curr */
296 curr = len - drop;
297 left = (int)(1 << curr);
298 while (curr + drop < max) {
299 left -= count[curr + drop];
301 curr++;
306 used += 1U << curr;
312 (*table)[low].op = (unsigned char)curr;
321 len is equal to curr + drop, so there is no loop needed to increment