12    Build a set of tables to decode the provided canonical Huffman code.
13    The code lengths are lens[0..codes-1].  The result starts at *table,
15    lens shorts, which is used as a work area.  type is the type of code
17    -1 is an invalid code, and +1 means that ENOUGH isn't enough.  table
21    longest code or if it is less than the shortest code.
24 			code **table, unsigned *bits, unsigned short *work)  in zlib_inflate_table()
26     unsigned len;               /* a code's length in bits */  in zlib_inflate_table()
27     unsigned sym;               /* index of code symbols */  in zlib_inflate_table()
28     unsigned min, max;          /* minimum and maximum code lengths */  in zlib_inflate_table()
31     unsigned drop;              /* code bits to drop for sub-table */  in zlib_inflate_table()
33     unsigned used;              /* code entries in table used */  in zlib_inflate_table()
34     unsigned huff;              /* Huffman code */  in zlib_inflate_table()
35     unsigned incr;              /* for incrementing code, index */  in zlib_inflate_table()
39     code this;                  /* table entry for duplication */  in zlib_inflate_table()
40     code *next;             /* next available space in table */  in zlib_inflate_table()
62        Process a set of code lengths to create a canonical Huffman code.  The  in zlib_inflate_table()
63        code lengths are lens[0..codes-1].  Each length corresponds to the  in zlib_inflate_table()
64        symbols 0..codes-1.  The Huffman code is generated by first sorting the  in zlib_inflate_table()
66        for codes with equal lengths.  Then the code starts with all zero bits  in zlib_inflate_table()
67        for the first code of the shortest length, and the codes are integer  in zlib_inflate_table()
76        1..MAXBITS is interpreted as that code length.  zero means that that  in zlib_inflate_table()
77        symbol does not occur in this code.  in zlib_inflate_table()
98     /* bound code lengths, force root to be within code lengths */  in zlib_inflate_table()
103     if (max == 0) {                     /* no symbols to code at all */  in zlib_inflate_table()
104         this.op = (unsigned char)64;    /* invalid code marker */  in zlib_inflate_table()
137        filled is at next and has curr index bits.  The code being used is huff  in zlib_inflate_table()
138        with length len.  That code is converted to an index by dropping drop  in zlib_inflate_table()
150        code lengths to determine what size sub-table is needed.  The length  in zlib_inflate_table()
157        the worst case distance code, MAXD.  This should never happen, but the  in zlib_inflate_table()
164        in the rest of the decoding tables with invalid code markers.  in zlib_inflate_table()
167     /* set up for code type */  in zlib_inflate_table()
187     huff = 0;                   /* starting code */  in zlib_inflate_table()
188     sym = 0;                    /* starting code symbol */  in zlib_inflate_table()
189     len = min;                  /* starting code length */  in zlib_inflate_table()
192     drop = 0;                   /* current bits to drop from code for index */  in zlib_inflate_table()
227         /* backwards increment the len-bit code huff */  in zlib_inflate_table()
284     this.op = (unsigned char)64;                /* invalid code marker */  in zlib_inflate_table()
296         /* put invalid code marker in table */  in zlib_inflate_table()
299         /* backwards increment the len-bit code huff */  in zlib_inflate_table()