Lines Matching defs:drop
72 unsigned drop; /* code bits to drop for sub-table */
179 with length len. That code is converted to an index by dropping drop
180 bits off of the bottom. For codes where len is less than drop + curr,
181 those top drop + curr - len bits are incremented through all values to
187 new sub-table should be started. drop is zero when the root table is
188 being filled, and drop is root when sub-tables are being filled.
233 drop = 0; /* current bits to drop from code for index */
245 this.bits = (unsigned char)(len - drop);
260 incr = 1U << (len - drop);
265 next[(huff >> drop) + fill] = this;
289 if (drop == 0)
290 drop = root;
296 curr = len - drop;
298 while (curr + drop < max) {
299 left -= count[curr + drop];
321 len is equal to curr + drop, so there is no loop needed to increment
326 this.bits = (unsigned char)(len - drop);
329 /* when done with sub-table, drop back to root table */
330 if (drop != 0 && (huff & mask) != low) {
331 drop = 0;
338 next[huff >> drop] = this;