Home
last modified time | relevance | path

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

/dragonfly/contrib/zlib-1.2/
H A 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); \
H A Dtrees.c176 put_byte(s, (uch)((ush)(w) >> 8)); \
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits;
587 next_code[bits] = (ush)code;
871 put_short(s, (ush)stored_len);
872 put_short(s, (ush)~stored_len);
1019 s->d_buf[s->last_lit] = (ush)dist;
1028 Assert((ush)dist < (ush)MAX_DIST(s) &&
1029 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
[all …]
H A 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()
H A Ddeflate.c121 ush good_length; /* reduce 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;
1146 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
1147 ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
1259 register ush scan_start = *(ushf*)scan;
[all …]
H A Dzutil.h45 typedef unsigned short ush; typedef
46 typedef ush FAR ushf;
H A DChangeLog556 - Add ush casts in trees.c to avoid pedantic runtime errors
/dragonfly/sys/vfs/hammer2/zlib/
H A Dhammer2_zlib_deflate.h59 ush freq; /* frequency count */
60 ush code; /* bit string */
63 ush dad; /* father node in Huffman tree */
64 ush len; /* length of bit string */
81 typedef ush Pos;
194 ush bl_count[MAX_BITS+1];
248 ush bi_buf;
323 ush dist = (distance); \
H A Dhammer2_zlib_trees.c178 put_byte(s, (uch)((ush)(w) >> 8)); \
244 ush bl_count[MAX_BITS+1]; in tr_static_init()
505 ush f; /* frequency */ in gen_bitlen()
519 tree[n].Len = (ush)bits; in gen_bitlen()
563 tree[m].Len = (ush)bits; in gen_bitlen()
1021 s->d_buf[s->last_lit] = (ush)dist;
1030 Assert((ush)dist < (ush)MAX_DIST(s) &&
1031 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1032 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1220 put_short(s, (ush)len);
[all …]
H A Dhammer2_zlib_deflate.c128 ush good_length; /* reduce lazy search above this match length */
129 ush max_lazy; /* do not perform lazy search above this match length */
130 ush nice_length; /* quit search above this match length */
131 ush max_chain;
262 overlay = (ushf *) kmalloc((s->lit_bufsize)*(sizeof(ush)+2), C_ZLIB_BUFFER_DEFLATE, M_INTWAIT); in deflateInit2_()
264 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in deflateInit2_()
273 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in deflateInit2_()
274 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in deflateInit2_()
641 register ush scan_start = *(ushf*)scan; in longest_match()
642 register ush scan_end = *(ushf*)(scan+best_len-1); in longest_match()
H A Dhammer2_zlib_zutil.h32 typedef unsigned short ush; typedef
33 typedef ush FAR ushf;
/dragonfly/usr.sbin/makefs/hammer2/zlib/
H A Dhammer2_zlib_deflate.h59 ush freq; /* frequency count */
60 ush code; /* bit string */
63 ush dad; /* father node in Huffman tree */
64 ush len; /* length of bit string */
81 typedef ush Pos;
194 ush bl_count[MAX_BITS+1];
248 ush bi_buf;
323 ush dist = (distance); \
H A Dhammer2_zlib_trees.c178 put_byte(s, (uch)((ush)(w) >> 8)); \
244 ush bl_count[MAX_BITS+1]; in tr_static_init()
505 ush f; /* frequency */ in gen_bitlen()
519 tree[n].Len = (ush)bits; in gen_bitlen()
563 tree[m].Len = (ush)bits; in gen_bitlen()
1021 s->d_buf[s->last_lit] = (ush)dist;
1030 Assert((ush)dist < (ush)MAX_DIST(s) &&
1031 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1032 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1220 put_short(s, (ush)len);
[all …]
H A Dhammer2_zlib_deflate.c128 ush good_length; /* reduce lazy search above this match length */
129 ush max_lazy; /* do not perform lazy search above this match length */
130 ush nice_length; /* quit search above this match length */
131 ush max_chain;
262 overlay = (ushf *) kmalloc((s->lit_bufsize)*(sizeof(ush)+2), C_ZLIB_BUFFER_DEFLATE, M_INTWAIT); in deflateInit2_()
264 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in deflateInit2_()
273 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in deflateInit2_()
274 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in deflateInit2_()
641 register ush scan_start = *(ushf*)scan; in longest_match()
642 register ush scan_end = *(ushf*)(scan+best_len-1); in longest_match()
H A Dhammer2_zlib_zutil.h32 typedef unsigned short ush; typedef
33 typedef ush FAR ushf;
/dragonfly/sbin/hammer2/zlib/
H A Dhammer2_zlib_deflate.h59 ush freq; /* frequency count */
60 ush code; /* bit string */
63 ush dad; /* father node in Huffman tree */
64 ush len; /* length of bit string */
81 typedef ush Pos;
194 ush bl_count[MAX_BITS+1];
248 ush bi_buf;
323 ush dist = (distance); \
H A Dhammer2_zlib_trees.c178 put_byte(s, (uch)((ush)(w) >> 8)); \
244 ush bl_count[MAX_BITS+1]; in tr_static_init()
505 ush f; /* frequency */ in gen_bitlen()
519 tree[n].Len = (ush)bits; in gen_bitlen()
563 tree[m].Len = (ush)bits; in gen_bitlen()
1021 s->d_buf[s->last_lit] = (ush)dist;
1030 Assert((ush)dist < (ush)MAX_DIST(s) &&
1031 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1032 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1220 put_short(s, (ush)len);
[all …]
H A Dhammer2_zlib_deflate.c123 ush good_length; /* reduce lazy search above this match length */
124 ush max_lazy; /* do not perform lazy search above this match length */
125 ush nice_length; /* quit search above this match length */
126 ush max_chain;
257 overlay = (ushf *) malloc((s->lit_bufsize)*(sizeof(ush)+2)); in deflateInit2_()
259 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in deflateInit2_()
268 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in deflateInit2_()
269 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in deflateInit2_()
636 register ush scan_start = *(ushf*)scan; in longest_match()
637 register ush scan_end = *(ushf*)(scan+best_len-1); in longest_match()
H A Dhammer2_zlib_zutil.h32 typedef unsigned short ush; typedef
33 typedef ush FAR ushf;
/dragonfly/sys/net/
H A Dzlib.c93 typedef unsigned short ush; typedef
94 typedef ush FAR ushf;
346 typedef ush Pos;
459 ush bl_count[MAX_BITS+1];
513 ush bi_buf;
674 ush max_chain;
2824 Assert((ush)dist < (ush)MAX_DIST(s) &&
2825 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2826 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
5259 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
[all …]
/dragonfly/contrib/mpfr/src/
H A Drint.c206 int ush; in mpfr_rint() local
219 ush = idiff == 0 ? 0 : GMP_NUMB_BITS - idiff; in mpfr_rint()
221 if (rj == 0 && ush < sh) in mpfr_rint()
227 (MPFR_LIMB_ONE << ush))) != 0) in mpfr_rint()
231 sh = ush; in mpfr_rint()
/dragonfly/share/dict/
H A Dweb2226241 ush