Lines Matching refs:huff
34 unsigned huff; /* Huffman code */
137 filled is at next and has curr index bits. The code being used is huff
145 of the low root bits of huff. This is saved in low to check for when a
187 huff = 0; /* starting code */
218 /* replicate for those indices with low len bits equal to huff */
224 next[(huff >> drop) + fill] = this;
227 /* backwards increment the len-bit code huff */
229 while (huff & incr)
232 huff &= incr - 1;
233 huff += incr;
236 huff = 0;
246 if (len > root && (huff & mask) != low) {
270 low = huff & mask;
279 loop above in incrementing huff for table indices. It is assumed that
287 while (huff != 0) {
289 if (drop != 0 && (huff & mask) != low) {
297 next[huff >> drop] = this;
299 /* backwards increment the len-bit code huff */
301 while (huff & incr)
304 huff &= incr - 1;
305 huff += incr;
308 huff = 0;