Lines Matching defs:drop
45 unsigned drop; /* code bits to drop for sub-table */
152 with length len. That code is converted to an index by dropping drop
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
160 new sub-table should be started. drop is zero when the root table is
161 being filled, and drop is root when sub-tables are being filled.
206 drop = 0; /* current bits to drop from code for index */
218 this.bits = (unsigned char)(len - drop);
233 incr = 1U << (len - drop);
238 next[(huff >> drop) + fill] = this;
262 if (drop == 0)
263 drop = root;
269 curr = len - drop;
271 while (curr + drop < max) {
272 left -= count[curr + drop];
294 len is equal to curr + drop, so there is no loop needed to increment
299 this.bits = (unsigned char)(len - drop);
302 /* when done with sub-table, drop back to root table */
303 if (drop != 0 && (huff & mask) != low) {
304 drop = 0;
311 next[huff >> drop] = this;
