Lines Matching defs:curr
46 unsigned curr; /* number of index bits for current table */
153 filled is at next and has curr index bits. The code being used is huff
155 bits off of the bottom. For codes where len is less than drop + curr,
156 those top drop + curr - len bits are incremented through all values to
207 curr = root; /* current table index bits */
236 fill = 1U << curr;
268 next += min; /* here min is 1 << curr */
271 curr = len - drop;
272 left = (int)(1 << curr);
273 while (curr + drop < max) {
274 left -= count[curr + drop];
276 curr++;
281 used += 1U << curr;
287 (*table)[low].op = (unsigned char)curr;
296 len is equal to curr + drop, so there is no loop needed to increment