Lines Matching defs:curr
30 unsigned curr; /* number of index bits for current table */
137 filled is at next and has curr index bits. The code being used is huff
139 bits off of the bottom. For codes where len is less than drop + curr,
140 those top drop + curr - len bits are incremented through all values to
191 curr = root; /* current table index bits */
220 fill = 1U << curr;
252 next += min; /* here min is 1 << curr */
255 curr = len - drop;
256 left = (int)(1 << curr);
257 while (curr + drop < max) {
258 left -= count[curr + drop];
260 curr++;
265 used += 1U << curr;
271 (*table)[low].op = (unsigned char)curr;
280 len is equal to curr + drop, so there is no loop needed to increment