Lines Matching refs:bits
23 whose indices are 0..2^bits-1. work is a writable array of at least
27 on return points to the next available entry's address. bits is the
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
32 int inflate_table9(type, lens, codes, table, bits, work)
37 unsigned FAR *bits;
40 unsigned len; /* a code's length in bits */
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
51 unsigned low; /* low bits for current root entry */
52 unsigned mask; /* mask for low root bits */
56 const unsigned short FAR *extra; /* extra bits table to use */
82 for codes with equal lengths. Then the code starts with all zero bits
85 increases. For the deflate format, these bits are stored backwards
115 root = *bits;
145 filled is at next and has curr index bits. The code being used is huff
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
151 root is the number of index bits for the root table. When len exceeds
153 of the low root bits of huff. This is saved in low to check for when a
198 curr = root; /* current table index bits */
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
226 /* replicate for those indices with low len bits equal to huff */
280 (*table)[low].bits = (unsigned char)root;
289 through high index bits. When the current sub-table is filled, the loop
293 this.bits = (unsigned char)(len - drop);
302 this.bits = (unsigned char)len;
322 *bits = root;
