Searched refs:huff (Results 1 – 4 of 4) sorted by relevance
48 unsigned huff; /* Huffman code */ local194 huff = 0; /* starting code */231 next[(huff >> drop) + fill] = this;236 while (huff & incr)239 huff &= incr - 1;240 huff += incr;243 huff = 0;253 if (len > root && (huff & mask) != low) {278 low = huff & mask;295 while (huff != 0) {[all …]
48 unsigned huff; /* Huffman code */ in inflate_table() local200 huff = 0; /* starting code */ in inflate_table()238 next[(huff >> drop) + fill] = here; in inflate_table()243 while (huff & incr) in inflate_table()246 huff &= incr - 1; in inflate_table()247 huff += incr; in inflate_table()250 huff = 0; in inflate_table()260 if (len > root && (huff & mask) != low) { in inflate_table()285 low = huff & mask; in inflate_table()295 if (huff != 0) { in inflate_table()[all …]
48 unsigned huff; /* Huffman code */ local200 huff = 0; /* starting code */238 next[(huff >> drop) + fill] = here;243 while (huff & incr)246 huff &= incr - 1;247 huff += incr;250 huff = 0;260 if (len > root && (huff & mask) != low) {285 low = huff & mask;295 if (huff != 0) {[all …]
249 struct huff { struct259 static void len2huff(struct huff *huff, char bitlen[], int len) in len2huff() argument265 memset(huff, 0, sizeof(struct huff)); in len2huff()266 for (i = 0; i<len; i++) huff->length[bitlen[i]]++; in len2huff()269 *huff->length = *offset = 0; in len2huff()270 for (i = 1; i<16; i++) offset[i] = offset[i-1] + huff->length[i-1]; in len2huff()272 for (i = 0; i<len; i++) if (bitlen[i]) huff->symbol[offset[bitlen[i]]++] = i; in len2huff()279 static unsigned huff_and_puff(struct bitbuf *bb, struct huff *huff) in huff_and_puff() argument281 unsigned short *length = huff->length; in huff_and_puff()289 if ((length - huff->length) & 16) error_exit("bad symbol"); in huff_and_puff()[all …]