Lines Matching refs:codes
22 The code lengths are lens[0..codes-1]. The result starts at *table,
32 int inflate_table9(type, lens, codes, table, bits, work)
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
64 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
68 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */
72 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
79 code lengths are lens[0..codes-1]. Each length corresponds to the
80 symbols 0..codes-1. The Huffman code is generated by first sorting the
82 for codes with equal lengths. Then the code starts with all zero bits
83 for the first code of the shortest length, and the codes are integer
87 decoding tables are built in the large loop below, the integer codes
95 The codes are sorted by computing a count of codes for each length,
102 the minimum and maximum length codes, determining if there are any
103 codes at all, checking for a valid set of lengths, and looking ahead
108 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
111 for (sym = 0; sym < codes; sym++)
119 if (max == 0) return -1; /* no codes! */
140 for (sym = 0; sym < codes; sym++)
147 bits off of the bottom. For codes where len is less than drop + curr,
159 counts are used for this, and so count[] is decremented as codes are
170 all codes of length max, i.e. all codes, have been processed. This
171 routine permits incomplete codes, so another loop after this one fills
209 /* process all codes and make table entries */
285 Fill in rest of table for incomplete codes. This loop is similar to the