Lines Matching refs:huff
43 unsigned huff; /* Huffman code */
140 filled is at next and has curr index bits. The code being used is huff
148 of the low root bits of huff. This is saved in low to check for when a
189 huff = 0; /* starting code */
221 /* replicate for those indices with low len bits equal to huff */
226 next[(huff >> drop) + fill] = this;
229 /* backwards increment the len-bit code huff */
231 while (huff & incr)
234 huff &= incr - 1;
235 huff += incr;
238 huff = 0;
248 if (len > root && (huff & mask) != low) {
273 low = huff & mask;
282 loop above in incrementing huff for table indices. It is assumed that
290 while (huff != 0) {
292 if (drop != 0 && (huff & mask) != low) {
301 next[huff >> drop] = this;
303 /* backwards increment the len-bit code huff */
305 while (huff & incr)
308 huff &= incr - 1;
309 huff += incr;
312 huff = 0;