Cross Reference: /ast/src/lib/libz/inftrees.c

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
35       code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work)
37 int inflate_table(type, lens, codes, table, bits, work)
42 unsigned FAR *bits;
46     unsigned len;               /* a code's length in bits */
49     unsigned root;              /* number of index bits for root table */
50     unsigned curr;              /* number of index bits for current table */
51     unsigned drop;              /* code bits to drop for sub-table */
57     unsigned low;               /* low bits for current root entry */
58     unsigned mask;              /* mask for low root bits */
62     const unsigned short FAR *extra;    /* extra bits table to use */
86        for codes with equal lengths.  Then the code starts with all zero bits
89        increases.  For the deflate format, these bits are stored backwards
119     root = *bits;
125         this.bits = (unsigned char)1;
129         *bits = 1;
157        filled is at next and has curr index bits.  The code being used is huff
159        bits off of the bottom.  For codes where len is less than drop + curr,
160        those top drop + curr - len bits are incremented through all values to
163        root is the number of index bits for the root table.  When len exceeds
165        of the low root bits of huff.  This is saved in low to check for when a
179        This assumes that when type == LENS, bits == 9.
211     curr = root;                /* current table index bits */
212     drop = 0;                   /* current bits to drop from code for index */
224         this.bits = (unsigned char)(len - drop);
238         /* replicate for those indices with low len bits equal to huff */
292             (*table)[low].bits = (unsigned char)root;
301        through high index bits.  When the current sub-table is filled, the loop
305     this.bits = (unsigned char)(len - drop);
313             this.bits = (unsigned char)len;
333     *bits = root;