Searched refs:huff (Results 1 - 9 of 9) sorted by relevance
/ast/src/lib/libvcodex/Vchuff/ |
H A D | vchuffman.c | 52 Vchuff_t *huff = vcgetmtdata(vc, Vchuff_t*); local 54 huff->type = 0; 55 huff->maxs = 0; 57 { memcpy(huff->freq, freq, VCH_SIZE*sizeof(freq[0])); 58 huff->type |= VCH_HASFREQ; 61 { memcpy(huff->size, size, VCH_SIZE*sizeof(size[0])); 62 huff->maxs = maxs; 63 huff->type |= VCH_HASSIZE; 84 Vchuff_t *huff = vcgetmtdata(vc, Vchuff_t*); local 85 ssize_t *freq = huff 165 Vchuff_t *huff = vcgetmtdata(vc, Vchuff_t*); local 241 Vchuff_t *huff; local [all...] |
/ast/src/cmd/pack/ |
H A D | Makefile | 11 huff 1.0 :LIBRARY: huff.3 huffman.h \
|
/ast/src/cmd/codexlib/zip/ |
H A D | Makefile | 6 zip.c huff.c \
|
H A D | huff.h | 35 extern int huff(ulg*, ulg, ulg, ush*, ush*, Huff_t**, int*, Vmalloc_t*);
|
H A D | deflate.c | 106 #include "huff.h" 385 ulg l[288]; /* length list for huff() */ 401 if (huff(l, 288, 257, cplens, cplext, &tl, &state->fixed_bl, state->vm)) 409 if (huff(l, 30, 0, cpdist, cpdext, &state->fixed_td, &state->fixed_bd, state->vm) > 1) 487 if (i = huff(ll, 19, 19, NULL, NULL, &tl, &bl, state->vm)) 558 i = huff(ll, nl, 257, cplens, cplext, &tl, &bl, state->vm); 570 i = huff(ll + nl, nd, 0, cpdist, cpdext, &td, &bd, state->vm);
|
H A D | implode.c | 8 #include "huff.h" 26 c1 30 Mar 92 M. Adler explode that uses huff() from inflate 94 The codes themselves are decoded using tables made by huff() from 858 if(huff(state->l, 256, 256, NULL, NULL, 865 if(huff(state->l, 64, 0, cplen3, extra, 874 if(huff(state->l, 64, 0, cpdist8, extra, 880 if(huff(state->l, 64, 0, cpdist4, extra, 890 if(huff(state->l, 64, 0, cplen2, extra, 899 if(huff(state->l, 64, 0, cpdist8, extra, 905 if(huff(stat [all...] |
H A D | huff.c | 3 #include "huff.h" 41 int huff( function
|
/ast/src/lib/libz/ |
H A D | inftrees.c | 54 unsigned huff; /* Huffman code */ local 157 filled is at next and has curr index bits. The code being used is huff 165 of the low root bits of huff. This is saved in low to check for when a 207 huff = 0; /* starting code */ 238 /* replicate for those indices with low len bits equal to huff */ 244 next[(huff >> drop) + fill] = this; 247 /* backwards increment the len-bit code huff */ 249 while (huff & incr) 252 huff &= incr - 1; 253 huff [all...] |
/ast/src/cmd/INIT/ |
H A D | ratz.c | 1721 unsigned huff; /* Huffman code */ local 1824 filled is at next and has curr index bits. The code being used is huff 1832 of the low root bits of huff. This is saved in low to check for when a 1874 huff = 0; /* starting code */ 1905 /* replicate for those indices with low len bits equal to huff */ 1911 next[(huff >> drop) + fill] = this; 1914 /* backwards increment the len-bit code huff */ 1916 while (huff & incr) 1919 huff &= incr - 1; 1920 huff [all...] |
Completed in 25 milliseconds