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
33 		  code FAR * FAR *table, unsigned FAR *bits,  in inflate_table()  argument
39     unsigned root;              /* number of index bits for root table */  in inflate_table()
40     unsigned curr;              /* number of index bits for current table */  in inflate_table()
41     unsigned drop;              /* code bits to drop for sub-table */  in inflate_table()
43     unsigned used;              /* code entries in table used */  in inflate_table()
49     code this;                  /* table entry for duplication */  in inflate_table()
50     code FAR *next;             /* next available space in table */  in inflate_table()
51     const unsigned short FAR *base;     /* base value table to use */  in inflate_table()
52     const unsigned short FAR *extra;    /* extra bits table to use */  in inflate_table()
55     unsigned short offs[MAXBITS+1];     /* offsets in table for each length */  in inflate_table()
90        creating from that a table of starting indices for each length in the  in inflate_table()
91        sorted table, and then entering the symbols in order in the sorted  in inflate_table()
92        table.  The sorted table is work[], with that space being provided by  in inflate_table()
98        at length counts to determine sub-table sizes when building the  in inflate_table()
117         *(*table)++ = this;             /* make a table to force an error */  in inflate_table()
118         *(*table)++ = this;  in inflate_table()
136     /* generate offsets into symbol table for each length for sorting */  in inflate_table()
146        Create and fill in decoding tables.  In this loop, the table being  in inflate_table()
151        fill the table with replicated entries.  in inflate_table()
153        root is the number of index bits for the root table.  When len exceeds  in inflate_table()
156        new sub-table should be started.  drop is zero when the root table is  in inflate_table()
159        When a new sub-table is needed, it is necessary to look ahead in the  in inflate_table()
160        code lengths to determine what size sub-table is needed.  The length  in inflate_table()
164        used keeps track of how many table entries have been allocated from the  in inflate_table()
165        provided *table space.  It is checked when a LENS table is being made  in inflate_table()
166        against the space in *table, ENOUGH, minus the maximum space needed by  in inflate_table()
200     next = *table;              /* current table to fill in */  in inflate_table()
201     curr = root;                /* current table index bits */  in inflate_table()
203     low = (unsigned)(-1);       /* trigger new sub-table when len > root */  in inflate_table()
204     used = 1U << root;          /* use root table entries */  in inflate_table()
207     /* check available table space */  in inflate_table()
211     /* process all codes and make table entries */  in inflate_table()
213         /* create table entry */  in inflate_table()
231         min = fill;                 /* save offset to next table */  in inflate_table()
255         /* create new sub-table if needed */  in inflate_table()
261             /* increment past last table */  in inflate_table()
264             /* determine length of next table */  in inflate_table()
279             /* point entry in root table to sub-table */  in inflate_table()
281             (*table)[low].op = (unsigned char)curr;  in inflate_table()
282             (*table)[low].bits = (unsigned char)root;  in inflate_table()
283             (*table)[low].val = (unsigned short)(next - *table);  in inflate_table()
288        Fill in rest of table for incomplete codes.  This loop is similar to the  in inflate_table()
289        loop above in incrementing huff for table indices.  It is assumed that  in inflate_table()
291        through high index bits.  When the current sub-table is filled, the loop  in inflate_table()
292        drops back to the root table to fill in any remaining entries there.  in inflate_table()
298         /* when done with sub-table, drop back to root table */  in inflate_table()
302             next = *table;  in inflate_table()
306         /* put invalid code marker in table */  in inflate_table()
322     *table += used;  in inflate_table()