Home
last modified time | relevance | path

Searched refs:ush (Results 1 – 16 of 16) sorted by relevance

/freebsd-10-stable/contrib/zlib/
Ddeflate.h70 ush freq; /* frequency count */
71 ush code; /* bit string */
74 ush dad; /* father node in Huffman tree */
75 ush len; /* length of bit string */
92 typedef ush Pos;
206 ush bl_count[MAX_BITS+1];
260 ush bi_buf;
335 ush dist = (ush)(distance); \
Dtrees.c176 put_byte(s, (uch)((ush)(w) >> 8)); \
200 s->bi_buf |= (ush)value << s->bi_valid;
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |= (ush)(value) << s->bi_valid;\
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits;
[all …]
Dzutil.c229 if (*(ush*)&buf != 0) return buf; in zcalloc()
237 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
238 *(ush*)&buf = 0; in zcalloc()
249 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
Ddeflate.c121 ush good_length; /* reduce lazy search above this match length */
122 ush max_lazy; /* do not perform lazy search above this match length */
123 ush nice_length; /* quit search above this match length */
124 ush max_chain;
329 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
331 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
340 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
341 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
558 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1131 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
[all …]
Dzutil.h45 typedef unsigned short ush; typedef
46 typedef ush FAR ushf;
DChangeLog556 - Add ush casts in trees.c to avoid pedantic runtime errors
/freebsd-10-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/
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); \
Dzutil.c232 if (*(ush*)&buf != 0) return buf; in zcalloc()
240 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
241 *(ush*)&buf = 0; in zcalloc()
249 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
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]; in tr_static_init()
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)node;
[all …]
Ddeflate.c129 ush good_length; /* reduce lazy search above this match length */
130 ush max_lazy; /* do not perform lazy search above this match length */
131 ush nice_length; /* quit search above this match length */
132 ush max_chain;
299 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
301 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
310 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
311 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
417 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
929 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
[all …]
Dzutil.h54 typedef unsigned short ush; typedef
55 typedef ush FAR ushf;
/freebsd-10-stable/sys/kern/
Dinflate.c28 #define ush u_short macro
268 ush n; /* literal, length base, or distance
276 static int huft_build(struct inflate *, unsigned *, unsigned, unsigned, const ush *, const ush *, s…
301 static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
306 static const ush cplext[] = { /* Extra bits for literal codes 257..285 */
310 static const ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
315 static const ush cpdext[] = { /* Extra bits for distance codes */
321 static const ush mask[] = {
420 const ush *d; /* list of base values for non-simple codes */
421 const ush *e; /* list of extra bits for non-simple codes */
/freebsd-10-stable/sys/net/
Dzlib.c100 typedef unsigned short ush; typedef
101 typedef ush FAR ushf;
322 ush freq; /* frequency count */
323 ush code; /* bit string */
326 ush dad; /* father node in Huffman tree */
327 ush len; /* length of bit string */
344 typedef ush Pos;
457 ush bl_count[MAX_BITS+1];
511 ush bi_buf;
669 ush good_length; /* reduce lazy search above this match length */
[all …]
Dzutil.h67 typedef unsigned short ush; typedef
68 typedef ush FAR ushf;
/freebsd-10-stable/sys/vm/
Duma_core.c3447 struct uma_stream_header ush; local
3474 bzero(&ush, sizeof(ush));
3475 ush.ush_version = UMA_STREAM_VERSION;
3476 ush.ush_maxcpus = (mp_maxid + 1);
3477 ush.ush_count = count;
3478 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush));
/freebsd-10-stable/share/dict/
Dweb2226283 ush