Lines Matching refs:curr
44 unsigned curr; /* number of index bits for current table */
145 filled is at next and has curr index bits. The code being used is huff
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
198 curr = root; /* current table index bits */
228 fill = 1U << curr;
259 next += 1U << curr;
262 curr = len - drop;
263 left = (int)(1 << curr);
264 while (curr + drop < max) {
265 left -= count[curr + drop];
267 curr++;
272 used += 1U << curr;
279 (*table)[low].op = (unsigned char)curr;
288 len is equal to curr + drop, so there is no loop needed to increment
301 curr = root;
