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

/forgerock/web-agents-v4/zlib/
H A Ddeflate.h67 ush freq; /* frequency count */
68 ush code; /* bit string */
71 ush dad; /* father node in Huffman tree */
72 ush len; /* length of bit string */
89 typedef ush Pos;
203 ush bl_count[MAX_BITS+1];
257 ush bi_buf;
332 ush dist = (distance); \
H A Dtrees.c178 put_byte(s, (uch)((ush)(w) >> 8)); \
202 s->bi_buf |= (ush)value << s->bi_valid;
204 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
207 s->bi_buf |= (ush)value << s->bi_valid;
217 s->bi_buf |= (ush)val << s->bi_valid;\
219 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
222 s->bi_buf |= (ush)(value) << s->bi_valid;\
243 ush bl_count[MAX_BITS+1];
502 ush f; /* frequency */
516 tree[n].Len = (ush)bit
[all...]
H A Dzutil.c230 if (*(ush*)&buf != 0) return buf;
238 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
239 *(ush*)&buf = 0;
247 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dzutil.h43 typedef unsigned short ush; typedef
44 typedef ush FAR ushf;
H A Ddeflate.c118 ush good_length; /* reduce lazy search above this match length */
119 ush max_lazy; /* do not perform lazy search above this match length */
120 ush nice_length; /* quit search above this match length */
121 ush max_chain;
301 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
303 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
312 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
313 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
480 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1043 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]

Completed in 27 milliseconds