Lines Matching refs:huff
48 unsigned huff; /* Huffman code */
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
198 huff = 0; /* starting code */
230 /* replicate for those indices with low len bits equal to huff */
236 next[(huff >> drop) + fill] = here;
239 /* backwards increment the len-bit code huff */
241 while (huff & incr)
244 huff &= incr - 1;
245 huff += incr;
248 huff = 0;
258 if (len > root && (huff & mask) != low) {
283 low = huff & mask;
292 loop above in incrementing huff for table indices. It is assumed that
300 while (huff != 0) {
302 if (drop != 0 && (huff & mask) != low) {
310 next[huff >> drop] = here;
312 /* backwards increment the len-bit code huff */
314 while (huff & incr)
317 huff &= incr - 1;
318 huff += incr;
321 huff = 0;