Lines Matching defs:drop
47 unsigned drop; /* code bits to drop for sub-table */
154 with length len. That code is converted to an index by dropping drop
155 bits off of the bottom. For codes where len is less than drop + curr,
156 those top drop + curr - len bits are incremented through all values to
162 new sub-table should be started. drop is zero when the root table is
163 being filled, and drop is root when sub-tables are being filled.
208 drop = 0; /* current bits to drop from code for index */
220 this.bits = (unsigned char)(len - drop);
235 incr = 1U << (len - drop);
240 next[(huff >> drop) + fill] = this;
264 if (drop == 0)
265 drop = root;
271 curr = len - drop;
273 while (curr + drop < max) {
274 left -= count[curr + drop];
296 len is equal to curr + drop, so there is no loop needed to increment
301 this.bits = (unsigned char)(len - drop);
304 /* when done with sub-table, drop back to root table */
305 if (drop != 0 && (huff & mask) != low) {
306 drop = 0;
313 next[huff >> drop] = this;