Lines Matching defs:huff

44     unsigned huff;              /* Huffman code */
147        filled is at next and has curr index bits.  The code being used is huff
155        of the low root bits of huff.  This is saved in low to check for when a
194     huff = 0;                   /* starting code */
226         /* replicate for those indices with low len bits equal to huff */
232             next[(huff >> drop) + fill] = here;
235         /* backwards increment the len-bit code huff */
237         while (huff & incr)
240             huff &= incr - 1;
241             huff += incr;
244             huff = 0;
254         if (len > root && (huff & mask) != low) {
279             low = huff & mask;
289     if (huff != 0) {
293         next[huff] = here;