Lines Matching refs:table
22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
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)
36 code FAR * FAR *table;
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 */
47 unsigned used; /* code entries in table used */
53 code this; /* table entry for duplication */
54 code FAR *next; /* next available space in table */
55 const unsigned short FAR *base; /* base value table to use */
56 const unsigned short FAR *extra; /* extra bits table to use */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
96 creating from that a table of starting indices for each length in the
97 sorted table, and then entering the symbols in order in the sorted
98 table. The sorted table is work[], with that space being provided by
104 at length counts to determine sub-table sizes when building the
134 /* generate offsets into symbol table for each length for sorting */
144 Create and fill in decoding tables. In this loop, the table being
149 fill the table with replicated entries.
151 root is the number of index bits for the root table. When len exceeds
154 new sub-table should be started. drop is zero when the root table is
157 When a new sub-table is needed, it is necessary to look ahead in the
158 code lengths to determine what size sub-table is needed. The length
162 used keeps track of how many table entries have been allocated from the
163 provided *table space. It is checked for LENS and DIST tables against
165 the initial root table size constants. See the comments in inftree9.h
197 next = *table; /* current table to fill in */
198 curr = root; /* current table index bits */
200 low = (unsigned)(-1); /* trigger new sub-table when len > root */
201 used = 1U << root; /* use root table entries */
204 /* check available table space */
209 /* process all codes and make table entries */
211 /* create table entry */
252 /* create new sub-table if needed */
258 /* increment past last table */
261 /* determine length of next table */
277 /* point entry in root table to sub-table */
279 (*table)[low].op = (unsigned char)curr;
280 (*table)[low].bits = (unsigned char)root;
281 (*table)[low].val = (unsigned short)(next - *table);
286 Fill in rest of table for incomplete codes. This loop is similar to the
287 loop above in incrementing huff for table indices. It is assumed that
289 through high index bits. When the current sub-table is filled, the loop
290 drops back to the root table to fill in any remaining entries there.
296 /* when done with sub-table, drop back to root table */
300 next = *table;
305 /* put invalid code marker in table */
321 *table += used;
