Lines Matching full:lengths
25 single bytes (called "literals") and match lengths. A second Huffman
101 13. The literal/length and distance code bit lengths are read as a
102 single stream of lengths. It is possible (and advantageous) for
104 the two sets of lengths.
174 static const unsigned border[] = { /* Order of the bit length code lengths */
176 static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
323 unsigned *b, /* code lengths in bits (all assumed <= BMAX) */ in huft_build()
331 /* Given a list of code lengths and a maximum table size, make a set of in huft_build()
335 oversubscribed set of lengths), and three if not enough memory. */ in huft_build()
433 /* Make a table of values in order of bit lengths */ in huft_build()
453 /* go through the bit lengths (k already is bits in shortest code) */ in huft_build()
835 unsigned m; /* mask for bit lengths table */ in inflate_dynamic()
836 unsigned n; /* number of lengths to get */ in inflate_dynamic()
844 unsigned *ll; /* literal/length and distance code lengths */ in inflate_dynamic()
852 ll = malloc(sizeof(*ll) * (288+32)); /* literal/length and distance code lengths */ in inflate_dynamic()
854 ll = malloc(sizeof(*ll) * (286+30)); /* literal/length and distance code lengths */ in inflate_dynamic()
865 /* read in table lengths */ in inflate_dynamic()
881 ret = 1; /* bad lengths */ in inflate_dynamic()
887 /* read in bit-length-code lengths */ in inflate_dynamic()
911 /* read in literal and distance code lengths */ in inflate_dynamic()