Lines Matching refs:drop
40 unsigned drop; /* code bits to drop for sub-table */
147 with length len. That code is converted to an index by dropping drop
148 bits off of the bottom. For codes where len is less than drop + curr,
149 those top drop + curr - len bits are incremented through all values to
155 new sub-table should be started. drop is zero when the root table is
156 being filled, and drop is root when sub-tables are being filled.
198 drop = 0; /* current bits to drop from code for index */
211 here.bits = (unsigned char)(len - drop);
226 incr = 1U << (len - drop);
231 next[(huff >> drop) + fill] = here;
255 if (drop == 0)
256 drop = root;
262 curr = len - drop;
264 while (curr + drop < max) {
265 left -= count[curr + drop];
290 here.bits = (unsigned char)(len - drop);