Lines Matching refs:huff
43 unsigned huff; /* Huffman code */
146 filled is at next and has curr index bits. The code being used is huff
154 of the low root bits of huff. This is saved in low to check for when a
193 huff = 0; /* starting code */
225 /* replicate for those indices with low len bits equal to huff */
231 next[(huff >> drop) + fill] = here;
234 /* backwards increment the len-bit code huff */
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;
288 if (huff != 0) {
292 next[huff] = here;