Lines Matching defs:curr

39     unsigned curr;              /* number of index bits for current table */
146        filled is at next and has curr index bits.  The code being used is huff
148        bits off of the bottom.  For codes where len is less than drop + curr,
149        those top drop + curr - len bits are incremented through all values to
197     curr = root;                /* current table index bits */
227         fill = 1U << curr;
259             next += min;            /* here min is 1 << 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;