Lines Matching refs:huff
75 unsigned huff; /* Huffman code */
178 filled is at next and has curr index bits. The code being used is huff
186 of the low root bits of huff. This is saved in low to check for when a
228 huff = 0; /* starting code */
259 /* replicate for those indices with low len bits equal to huff */
265 next[(huff >> drop) + fill] = this;
268 /* backwards increment the len-bit code huff */
270 while (huff & incr)
273 huff &= incr - 1;
274 huff += incr;
277 huff = 0;
287 if (len > root && (huff & mask) != low) {
311 low = huff & mask;
320 loop above in incrementing huff for table indices. It is assumed that
328 while (huff != 0) {
330 if (drop != 0 && (huff & mask) != low) {
338 next[huff >> drop] = this;
340 /* backwards increment the len-bit code huff */
342 while (huff & incr)
345 huff &= incr - 1;
346 huff += incr;
349 huff = 0;