Lines Matching defs:drop
31 unsigned drop; /* code bits to drop for sub-table */
138 with length len. That code is converted to an index by dropping drop
139 bits off of the bottom. For codes where len is less than drop + curr,
140 those top drop + curr - len bits are incremented through all values to
146 new sub-table should be started. drop is zero when the root table is
147 being filled, and drop is root when sub-tables are being filled.
192 drop = 0; /* current bits to drop from code for index */
204 this.bits = (unsigned char)(len - drop);
219 incr = 1U << (len - drop);
224 next[(huff >> drop) + fill] = this;
248 if (drop == 0)
249 drop = root;
255 curr = len - drop;
257 while (curr + drop < max) {
258 left -= count[curr + drop];
280 len is equal to curr + drop, so there is no loop needed to increment
285 this.bits = (unsigned char)(len - drop);
288 /* when done with sub-table, drop back to root table */
289 if (drop != 0 && (huff & mask) != low) {
290 drop = 0;
297 next[huff >> drop] = this;