Lines Matching refs:codes
46 The code lengths are lens[0..codes-1]. The result starts at *table,
56 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
59 unsigned codes;
70 int left; /* number of prefix codes available */
82 unsigned short count[MAXBITS+1]; /* number of codes of each length */
84 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
87 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
90 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
94 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
101 code lengths are lens[0..codes-1]. Each length corresponds to the
102 symbols 0..codes-1. The Huffman code is generated by first sorting the
104 for codes with equal lengths. Then the code starts with all zero bits
105 for the first code of the shortest length, and the codes are integer
109 decoding tables are built in the large loop below, the integer codes
117 The codes are sorted by computing a count of codes for each length,
124 the minimum and maximum length codes, determining if there are any
125 codes at all, checking for a valid set of lengths, and looking ahead
130 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
133 for (sym = 0; sym < codes; sym++)
170 for (sym = 0; sym < codes; sym++)
177 bits off of the bottom. For codes where len is less than drop + curr,
189 counts are used for this, and so count[] is decremented as codes are
199 all codes of length max, i.e. all codes, have been processed. This
200 routine permits incomplete codes, so another loop after this one fills
237 /* process all codes and make table entries */