Lines Matching defs:drop
42 unsigned drop; /* code bits to drop for sub-table */
149 with length len. That code is converted to an index by dropping drop
150 bits off of the bottom. For codes where len is less than drop + curr,
151 those top drop + curr - len bits are incremented through all values to
157 new sub-table should be started. drop is zero when the root table is
158 being filled, and drop is root when sub-tables are being filled.
200 drop = 0; /* current bits to drop from code for index */
213 here.bits = (unsigned char)(len - drop);
228 incr = 1U << (len - drop);
233 next[(huff >> drop) + fill] = here;
257 if (drop == 0)
258 drop = root;
264 curr = len - drop;
266 while (curr + drop < mmax) {
267 left -= count[curr + drop];
292 here.bits = (unsigned char)(len - drop);