Lines Matching refs:drop
40 unsigned drop; /* code bits to drop for sub-table */
141 with length len. That code is converted to an index by dropping drop
142 bits off of the bottom. For codes where len is less than drop + curr,
143 those top drop + curr - len bits are incremented through all values to
149 new sub-table should be started. drop is zero when the root table is
150 being filled, and drop is root when sub-tables are being filled.
194 drop = 0; /* current bits to drop from code for index */
207 this.bits = (unsigned char)(len - drop);
222 incr = 1U << (len - drop);
226 next[(huff >> drop) + fill] = this;
250 if (drop == 0)
251 drop = root;
257 curr = len - drop;
259 while (curr + drop < max) {
260 left -= count[curr + drop];
283 len is equal to curr + drop, so there is no loop needed to increment
288 this.bits = (unsigned char)(len - drop);
291 /* when done with sub-table, drop back to root table */
292 if (drop != 0 && (huff & mask) != low) {
293 drop = 0;
301 next[huff >> drop] = this;