Lines Matching defs:huff
1721 unsigned huff; /* Huffman code */
1824 filled is at next and has curr index bits. The code being used is huff
1832 of the low root bits of huff. This is saved in low to check for when a
1874 huff = 0; /* starting code */
1905 /* replicate for those indices with low len bits equal to huff */
1911 next[(huff >> drop) + fill] = this;
1914 /* backwards increment the len-bit code huff */
1916 while (huff & incr)
1919 huff &= incr - 1;
1920 huff += incr;
1923 huff = 0;
1933 if (len > root && (huff & mask) != low) {
1957 low = huff & mask;
1966 loop above in incrementing huff for table indices. It is assumed that
1974 while (huff != 0) {
1976 if (drop != 0 && (huff & mask) != low) {
1984 next[huff >> drop] = this;
1986 /* backwards increment the len-bit code huff */
1988 while (huff & incr)
1991 huff &= incr - 1;
1992 huff += incr;
1995 huff = 0;