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

/darwin-on-arm/xnu/libkern/zlib/
H A Ddeflate.h91 ush freq; /* frequency count */
92 ush code; /* bit string */
95 ush dad; /* father node in Huffman tree */
96 ush len; /* length of bit string */
113 typedef ush Pos;
227 ush bl_count[MAX_BITS+1];
281 ush bi_buf;
344 ush dist = (distance); \
H A Dzutil.c254 if (*(ush*)&buf != 0) return buf;
262 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
263 *(ush*)&buf = 0;
271 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dtrees.c209 put_byte(s, (uch)((ush)(w) >> 8)); \
235 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
250 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
274 ush bl_count[MAX_BITS+1];
531 ush f; /* frequency */
545 tree[n].Len = (ush)bits;
589 tree[m].Len = (ush)bits;
609 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
610 ush code = 0; /* running code value */
706 tree[n].Dad = tree[m].Dad = (ush)nod
[all...]
H A Dzutil.h88 typedef unsigned short ush; typedef
89 typedef ush FAR ushf;
H A Ddeflate.c151 ush good_length; /* reduce lazy search above this match length */
152 ush max_lazy; /* do not perform lazy search above this match length */
153 ush nice_length; /* quit search above this match length */
154 ush max_chain;
322 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
324 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
333 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
334 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
440 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
952 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]

Completed in 21 milliseconds