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
200 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = here;
241 /* backwards increment the len-bit code huff */
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;
294 loop above in incrementing huff for table indices. It is assumed that
302 while (huff != 0) {
304 if (drop != 0 && (huff & mask) != low) {
312 next[huff >> drop] = here;
314 /* backwards increment the len-bit code huff */
316 while (huff & incr)
319 huff &= incr - 1;
320 huff += incr;
323 huff = 0;
