Lines Matching defs:drop

41     unsigned drop;              /* code bits to drop for sub-table */
148        with length len.  That code is converted to an index by dropping drop
149        bits off of the bottom.  For codes where len is less than drop + curr,
150        those top drop + curr - len bits are incremented through all values to
156        new sub-table should be started.  drop is zero when the root table is
157        being filled, and drop is root when sub-tables are being filled.
199     drop = 0;                   /* current bits to drop from code for index */
212         here.bits = (unsigned char)(len - drop);
227         incr = 1U << (len - drop);
232             next[(huff >> drop) + fill] = here;
256             if (drop == 0)
257                 drop = root;
263             curr = len - drop;
265             while (curr + drop < max) {
266                 left -= count[curr + drop];
291         here.bits = (unsigned char)(len - drop);