Lines Matching defs:bits

14    whose indices are 0..2^bits-1.  work is a writable array of at least
18 on return points to the next available entry's address. bits is the
19 requested root table index bits, and on return it is the actual root
20 table index bits. It will differ if the request is greater than the
24 code **table, unsigned *bits, unsigned short *work)
26 unsigned len; /* a code's length in bits */
29 unsigned root; /* number of index bits for root table */
30 unsigned curr; /* number of index bits for current table */
31 unsigned drop; /* code bits to drop for sub-table */
37 unsigned low; /* low bits for current root entry */
38 unsigned mask; /* mask for low root bits */
42 const unsigned short *extra; /* extra bits table to use */
66 for codes with equal lengths. Then the code starts with all zero bits
69 increases. For the deflate format, these bits are stored backwards
99 root = *bits;
105 this.bits = (unsigned char)1;
109 *bits = 1;
137 filled is at next and has curr index bits. The code being used is huff
139 bits off of the bottom. For codes where len is less than drop + curr,
140 those top drop + curr - len bits are incremented through all values to
143 root is the number of index bits for the root table. When len exceeds
145 of the low root bits of huff. This is saved in low to check for when a
159 This assumes that when type == LENS, bits == 9.
191 curr = root; /* current table index bits */
192 drop = 0; /* current bits to drop from code for index */
204 this.bits = (unsigned char)(len - drop);
218 /* replicate for those indices with low len bits equal to huff */
272 (*table)[low].bits = (unsigned char)root;
281 through high index bits. When the current sub-table is filled, the loop
285 this.bits = (unsigned char)(len - drop);
293 this.bits = (unsigned char)len;
313 *bits = root;