31     unsigned drop;              /* code bits to drop for sub-table */  in zlib_inflate_table()  local
138        with length len.  That code is converted to an index by dropping drop  in zlib_inflate_table()
139        bits off of the bottom.  For codes where len is less than drop + curr,  in zlib_inflate_table()
140        those top drop + curr - len bits are incremented through all values to  in zlib_inflate_table()
146        new sub-table should be started.  drop is zero when the root table is  in zlib_inflate_table()
147        being filled, and drop is root when sub-tables are being filled.  in zlib_inflate_table()
192     drop = 0;                   /* current bits to drop from code for index */  in zlib_inflate_table()
204         this.bits = (unsigned char)(len - drop);  in zlib_inflate_table()
219         incr = 1U << (len - drop);  in zlib_inflate_table()
224             next[(huff >> drop) + fill] = this;  in zlib_inflate_table()
248             if (drop == 0)  in zlib_inflate_table()
249                 drop = root;  in zlib_inflate_table()
255             curr = len - drop;  in zlib_inflate_table()
257             while (curr + drop < max) {  in zlib_inflate_table()
258                 left -= count[curr + drop];  in zlib_inflate_table()
280        len is equal to curr + drop, so there is no loop needed to increment  in zlib_inflate_table()
285     this.bits = (unsigned char)(len - drop);  in zlib_inflate_table()
288         /* when done with sub-table, drop back to root table */  in zlib_inflate_table()
289         if (drop != 0 && (huff & mask) != low) {  in zlib_inflate_table()
290             drop = 0;  in zlib_inflate_table()
297         next[huff >> drop] = this;  in zlib_inflate_table()