Lines Matching defs:curr
68 unsigned curr; /* number of index bits for current table */
175 filled is at next and has curr index bits. The code being used is huff
177 bits off of the bottom. For codes where len is less than drop + curr,
178 those top drop + curr - len bits are incremented through all values to
229 curr = root; /* current table index bits */
258 fill = 1U << curr;
290 next += min; /* here min is 1 << curr */
293 curr = len - drop;
294 left = (int)(1 << curr);
295 while (curr + drop < max) {
296 left -= count[curr + drop];
298 curr++;
303 used += 1U << curr;
309 (*table)[low].op = (unsigned char)curr;
318 len is equal to curr + drop, so there is no loop needed to increment