Home | History | Annotate | Download | only in infback9

Lines Matching defs:curr

39     unsigned curr;              /* number of index bits for current table */
140        filled is at next and has curr index bits.  The code being used is huff
142        bits off of the bottom.  For codes where len is less than drop + curr,
143        those top drop + curr - len bits are incremented through all values to
193     curr = root;                /* current table index bits */
223         fill = 1U << curr;
254             next += 1U << curr;
257             curr = len - drop;
258             left = (int)(1 << curr);
259             while (curr + drop < max) {
260                 left -= count[curr + drop];
262                 curr++;
267             used += 1U << curr;
274             (*table)[low].op = (unsigned char)curr;
283        len is equal to curr + drop, so there is no loop needed to increment
296             curr = root;