Lines Matching defs:drop
69 unsigned drop; /* code bits to drop for sub-table */
176 with length len. That code is converted to an index by dropping drop
177 bits off of the bottom. For codes where len is less than drop + curr,
178 those top drop + curr - len bits are incremented through all values to
184 new sub-table should be started. drop is zero when the root table is
185 being filled, and drop is root when sub-tables are being filled.
227 drop = 0; /* current bits to drop from code for index */
240 here.bits = (unsigned char)(len - drop);
255 incr = 1U << (len - drop);
260 next[(huff >> drop) + fill] = here;
284 if (drop == 0)
285 drop = root;
291 curr = len - drop;
293 while (curr + drop < max) {
294 left -= count[curr + drop];
319 here.bits = (unsigned char)(len - drop);