Lines Matching full:codes
112 * - The codes as stored in the compressed data are bit-reversed relative to
113 * a simple integer ordering of codes of the same lengths. Hence below the
118 * - The first code for the shortest length is all ones. Subsequent codes of
130 int count; /* number of codes of length len */ in decode()
134 short *next; /* next number of codes */ in decode()
167 return -9; /* ran out of codes */ in decode()
176 * codes. Those tables are the number of codes of each length, and the symbols
185 * codes past the end of the incomplete lengths.
191 int left; /* number of possible codes left of current length */ in construct()
207 /* count number of codes of each length */ in construct()
212 if (h->count[0] == n) /* no codes! */ in construct()
218 left <<= 1; /* one more bit, double codes left */ in construct()
219 left -= h->count[len]; /* deduct count from possible codes */ in construct()
294 /* bit lengths of literal codes */ in decomp()
302 /* bit lengths of length codes 0..15 */ in decomp()
304 /* bit lengths of distance codes 0..63 */ in decomp()
306 static const short base[16] = { /* base for length codes */ in decomp()
308 static const char extra[16] = { /* extra bits for length codes */ in decomp()