Lines Matching full:huff
48 unsigned huff; /* Huffman code */
151 filled is at next and has curr index bits. The code being used is huff
159 of the low root bits of huff. This is saved in low to check for when a
201 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = this;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff += incr;
250 huff = 0;
260 if (len > root && (huff & mask) != low) {
284 low = huff & mask;
293 loop above in incrementing huff for table indices. It is assumed that
301 while (huff != 0) {
303 if (drop != 0 && (huff & mask) != low) {
311 next[huff >> drop] = this;
313 /* backwards increment the len-bit code huff */
315 while (huff & incr)
318 huff &= incr - 1;
319 huff += incr;
322 huff = 0;
