Lines Matching full: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
195 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) {
277 low = huff & mask;
286 loop above in incrementing huff for table indices. It is assumed that
294 while (huff != 0) {
296 if (drop != 0 && (huff & mask) != low) {
305 next[huff >> drop] = this;
307 /* backwards increment the len-bit code huff */
309 while (huff & incr)
312 huff &= incr - 1;
313 huff += incr;
316 huff = 0;
