Searched refs:ush (Results 1 - 11 of 11) sorted by relevance

/ast/src/cmd/codexlib/zip/
H A Dhuff.h30 ush n; /* literal, length base, or distance base */
35 extern int huff(ulg*, ulg, ulg, ush*, ush*, Huff_t**, int*, Vmalloc_t*);
H A Dzip.h13 typedef uint16_t ush; typedef
H A Dhuff.c45 ush *d, /* list of base values for non-simple codes */
46 ush *e, /* list of extra bits for non-simple codes */
206 r.v.n = (ush)*p++; /* simple code is just the value */
H A Ddeflate.c193 static ush cplens[] = { /* Copy lengths for literal codes 257..285 */
197 static ush cplext[] = { /* Extra bits for literal codes 257..285 */
200 static ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
204 static ush cpdext[] = { /* Extra bits for distance codes */
H A Dimplode.c38 c8 17 Oct 92 G. Roelofs changed ULONG/UWORD/byte to ulg/ush/uch.
145 static ush cplen2[] =
150 static ush cplen3[] =
155 static ush extra[] =
160 static ush cpdist4[] =
167 static ush cpdist8[] =
/ast/src/lib/libz/
H A Ddeflate.h64 ush freq; /* frequency count */
65 ush code; /* bit string */
68 ush dad; /* father node in Huffman tree */
69 ush len; /* length of bit string */
86 typedef ush Pos;
200 ush bl_count[MAX_BITS+1];
254 ush bi_buf;
317 ush dist = (distance); \
H A Dzutil.c226 if (*(ush*)&buf != 0) return buf;
234 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
235 *(ush*)&buf = 0;
243 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dtrees.c182 put_byte(s, (uch)((ush)(w) >> 8)); \
208 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
223 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
247 ush bl_count[MAX_BITS+1];
504 ush f; /* frequency */
518 tree[n].Len = (ush)bits;
562 tree[m].Len = (ush)bits;
582 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
583 ush code = 0; /* running code value */
679 tree[n].Dad = tree[m].Dad = (ush)nod
[all...]
H A Dzutil.h49 typedef unsigned short ush; typedef
50 typedef ush FAR ushf;
H A Ddeflate.c124 ush good_length; /* reduce lazy search above this match length */
125 ush max_lazy; /* do not perform lazy search above this match length */
126 ush nice_length; /* quit search above this match length */
127 ush max_chain;
293 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
295 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
304 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
305 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
411 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
923 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]
/ast/src/cmd/INIT/
H A Dratz.c598 typedef unsigned short ush; typedef
599 typedef ush FAR ushf;
896 if (*(ush*)&buf != 0) return buf;
904 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
905 *(ush*)&buf = 0;
913 if (*(ush*)&ptr != 0) { /* object < 64K */
1274 ush freq; /* frequency count */
1275 ush code; /* bit string */
1278 ush da
[all...]

Completed in 42 milliseconds