Lines Matching refs:drop
51 unsigned drop; /* code bits to drop for sub-table */
158 with length len. That code is converted to an index by dropping drop
159 bits off of the bottom. For codes where len is less than drop + curr,
160 those top drop + curr - len bits are incremented through all values to
166 new sub-table should be started. drop is zero when the root table is
167 being filled, and drop is root when sub-tables are being filled.
212 drop = 0; /* current bits to drop from code for index */
224 this.bits = (unsigned char)(len - drop);
239 incr = 1U << (len - drop);
244 next[(huff >> drop) + fill] = this;
268 if (drop == 0)
269 drop = root;
275 curr = len - drop;
277 while (curr + drop < max) {
278 left -= count[curr + drop];
300 len is equal to curr + drop, so there is no loop needed to increment
305 this.bits = (unsigned char)(len - drop);
308 /* when done with sub-table, drop back to root table */
309 if (drop != 0 && (huff & mask) != low) {
310 drop = 0;
317 next[huff >> drop] = this;