Searched refs:huff (Results 1 - 6 of 6) sorted by relevance

/illumos-gate/usr/src/cmd/spell/
H A Dhuff.h33 extern struct huff { struct
50 double huff(float);
H A DMakefile33 SPELLPROGSRC= spellprog.c hash.c hashlook.c huff.c
36 SPELLINSRC= spellin.c huff.c
39 HASHCHECKSRC= hashcheck.c hash.c huff.c
H A Dhuff.c44 #include "huff.h"
45 struct huff huffcode;
181 huff(float a) function
H A Dspellin.c38 #include "huff.h"
111 z = huff((1L<<HASHWIDTH)/atof(argv[1]));
/illumos-gate/usr/src/boot/lib/libz/
H A Dinftrees.c48 unsigned huff; /* Huffman code */ local
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
200 huff = 0; /* starting code */
232 /* replicate for those indices with low len bits equal to huff */
238 next[(huff >> drop) + fill] = here;
241 /* backwards increment the len-bit code huff */
243 while (huff & incr)
246 huff &= incr - 1;
247 huff
[all...]
/illumos-gate/usr/src/uts/common/zmod/
H A Dinftrees.c50 unsigned huff; /* Huffman code */ local
153 filled is at next and has curr index bits. The code being used is huff
161 of the low root bits of huff. This is saved in low to check for when a
203 huff = 0; /* starting code */
234 /* replicate for those indices with low len bits equal to huff */
240 next[(huff >> drop) + fill] = this;
243 /* backwards increment the len-bit code huff */
245 while (huff & incr)
248 huff &= incr - 1;
249 huff
[all...]

Completed in 97 milliseconds