Lines Matching refs:drop
45 unsigned drop; /* code bits to drop for sub-table */
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
227 incr = 1U << (len - drop);
231 next[(huff >> drop) + fill] = this;
255 if (drop == 0)
256 drop = root;
262 curr = len - drop;
264 while (curr + drop < max) {
265 left -= count[curr + drop];
288 len is equal to curr + drop, so there is no loop needed to increment
293 this.bits = (unsigned char)(len - drop);
296 /* when done with sub-table, drop back to root table */
297 if (drop != 0 && (huff & mask) != low) {
298 drop = 0;
306 next[huff >> drop] = this;
