Lines Matching refs:huff
48 unsigned huff; /* Huffman code */
145 filled is at next and has curr index bits. The code being used is huff
153 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 */
231 next[(huff >> drop) + fill] = this;
234 /* backwards increment the len-bit code huff */
236 while (huff & incr)
239 huff &= incr - 1;
240 huff += incr;
243 huff = 0;
253 if (len > root && (huff & mask) != low) {
278 low = huff & mask;
287 loop above in incrementing huff for table indices. It is assumed that
295 while (huff != 0) {
297 if (drop != 0 && (huff & mask) != low) {
306 next[huff >> drop] = this;
308 /* backwards increment the len-bit code huff */
310 while (huff & incr)
313 huff &= incr - 1;
314 huff += incr;
317 huff = 0;
