Lines Matching refs:huff
50 unsigned huff; /* Huffman code */
153 filled is at next and has curr index bits. The code being used is huff
161 of the low root bits of huff. This is saved in low to check for when a
203 huff = 0; /* starting code */
234 /* replicate for those indices with low len bits equal to huff */
240 next[(huff >> drop) + fill] = this;
243 /* backwards increment the len-bit code huff */
245 while (huff & incr)
248 huff &= incr - 1;
249 huff += incr;
252 huff = 0;
262 if (len > root && (huff & mask) != low) {
286 low = huff & mask;
295 loop above in incrementing huff for table indices. It is assumed that
303 while (huff != 0) {
305 if (drop != 0 && (huff & mask) != low) {
313 next[huff >> drop] = this;
315 /* backwards increment the len-bit code huff */
317 while (huff & incr)
320 huff &= incr - 1;
321 huff += incr;
324 huff = 0;