41     unsigned drop;              /* code bits to drop for sub-table */  in inflate_table()  local
148        with length len.  That code is converted to an index by dropping drop  in inflate_table()
149        bits off of the bottom.  For codes where len is less than drop + curr,  in inflate_table()
150        those top drop + curr - len bits are incremented through all values to  in inflate_table()
156        new sub-table should be started.  drop is zero when the root table is  in inflate_table()
157        being filled, and drop is root when sub-tables are being filled.  in inflate_table()
202     drop = 0;                   /* current bits to drop from code for index */  in inflate_table()
214         this.bits = (unsigned char)(len - drop);  in inflate_table()
229         incr = 1U << (len - drop);  in inflate_table()
234             next[(huff >> drop) + fill] = this;  in inflate_table()
258             if (drop == 0)  in inflate_table()
259                 drop = root;  in inflate_table()
265             curr = len - drop;  in inflate_table()
267             while (curr + drop < max) {  in inflate_table()
268                 left -= count[curr + drop];  in inflate_table()
290        len is equal to curr + drop, so there is no loop needed to increment  in inflate_table()
295     this.bits = (unsigned char)(len - drop);  in inflate_table()
298         /* when done with sub-table, drop back to root table */  in inflate_table()
299         if (drop != 0 && (huff & mask) != low) {  in inflate_table()
300             drop = 0;  in inflate_table()
307         next[huff >> drop] = this;  in inflate_table()