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.
230 drop = 0; /* current bits to drop from code for index */
242 this.bits = (unsigned char)(len - drop);
257 incr = 1U << (len - drop);
262 next[(huff >> drop) + fill] = this;
286 if (drop == 0)
287 drop = root;
293 curr = len - drop;
295 while (curr + drop < max) {
296 left -= count[curr + drop];
318 len is equal to curr + drop, so there is no loop needed to increment
323 this.bits = (unsigned char)(len - drop);
326 /* when done with sub-table, drop back to root table */
327 if (drop != 0 && (huff & mask) != low) {
328 drop = 0;
335 next[huff >> drop] = this;