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

Lines Matching defs:codes
22    The code lengths are lens[0..codes-1].  The result starts at *table,
34 int inflate_table(codetype type, unsigned short FAR *lens, unsigned codes,
37 int inflate_table(type, lens, codes, table, bits, work)
40 unsigned codes;
52     int left;                   /* number of prefix codes available */
64     unsigned short count[MAXBITS+1];    /* number of codes of each length */
66     static const unsigned short lbase[31] = { /* Length codes 257..285 base */
69     static const unsigned short lext[31] = { /* Length codes 257..285 extra */
72     static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
76     static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
83        code lengths are lens[0..codes-1].  Each length corresponds to the
84        symbols 0..codes-1.  The Huffman code is generated by first sorting the
86        for codes with equal lengths.  Then the code starts with all zero bits
87        for the first code of the shortest length, and the codes are integer
91        decoding tables are built in the large loop below, the integer codes
99        The codes are sorted by computing a count of codes for each length,
106        the minimum and maximum length codes, determining if there are any
107        codes at all, checking for a valid set of lengths, and looking ahead
112     /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
115     for (sym = 0; sym < codes; sym++)
152     for (sym = 0; sym < codes; sym++)
159        bits off of the bottom.  For codes where len is less than drop + curr,
171        counts are used for this, and so count[] is decremented as codes are
182        all codes of length max, i.e. all codes, have been processed.  This
183        routine permits incomplete codes, so another loop after this one fills
221     /* process all codes and make table entries */
298        Fill in rest of table for incomplete codes.  This loop is similar to the