libkern/zlib/inftrees.c

49    The code lengths are lens[0..codes-1].  The result starts at *table,
59 int inflate_table(type, lens, codes, table, bits, work)
62 unsigned codes;
73     int left;                   /* number of prefix codes available */
85     unsigned short count[MAXBITS+1];    /* number of codes of each length */
87     static const unsigned short lbase[31] = { /* Length codes 257..285 base */
90     static const unsigned short lext[31] = { /* Length codes 257..285 extra */
93     static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
97     static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
104        code lengths are lens[0..codes-1].  Each length corresponds to the
105        symbols 0..codes-1.  The Huffman code is generated by first sorting the
107        for codes with equal lengths.  Then the code starts with all zero bits
108        for the first code of the shortest length, and the codes are integer
112        decoding tables are built in the large loop below, the integer codes
120        The codes are sorted by computing a count of codes for each length,
127        the minimum and maximum length codes, determining if there are any
128        codes at all, checking for a valid set of lengths, and looking ahead
133     /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
136     for (sym = 0; sym < codes; sym++)
173     for (sym = 0; sym < codes; sym++)
180        bits off of the bottom.  For codes where len is less than drop + curr,
192        counts are used for this, and so count[] is decremented as codes are
203        all codes of length max, i.e. all codes, have been processed.  This
204        routine permits incomplete codes, so another loop after this one fills
242     /* process all codes and make table entries */
319        Fill in rest of table for incomplete codes.  This loop is similar to the