Home
last modified time | relevance | path

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

12

/netbsd-src/external/gpl3/gdb/dist/zlib/
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];
255 ush bi_buf;
331 ush dist = (ush)(distance); \
H A 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 …]
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 Dzutil.h41 typedef unsigned short ush; typedef
42 typedef ush FAR ushf;
H A 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;
599 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1299 register ush scan_start = *(ushf*)scan;
1300 register ush scan_end = *(ushf*)(scan+best_len-1);
/netbsd-src/external/gpl3/binutils.old/dist/zlib/
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];
255 ush bi_buf;
331 ush dist = (ush)(distance); \
H A 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 …]
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 Dzutil.h41 typedef unsigned short ush; typedef
42 typedef ush FAR ushf;
H A 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;
599 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1299 register ush scan_start = *(ushf*)scan;
1300 register ush scan_end = *(ushf*)(scan+best_len-1);
H A DChangeLog619 - Add ush casts in trees.c to avoid pedantic runtime errors
/netbsd-src/external/gpl3/binutils/dist/zlib/
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];
255 ush bi_buf;
331 ush dist = (ush)(distance); \
H A 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 …]
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 Dzutil.h41 typedef unsigned short ush; typedef
42 typedef ush FAR ushf;
H A 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;
599 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1299 register ush scan_start = *(ushf*)scan;
1300 register ush scan_end = *(ushf*)(scan+best_len-1);
/netbsd-src/external/cddl/osnet/dist/uts/common/zmod/
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 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 …]
H A 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()
H A 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 …]
H A Dzutil.h54 typedef unsigned short ush; typedef
55 typedef ush FAR ushf;
/netbsd-src/sys/net/
H A Dzlib.c98 typedef unsigned short ush; typedef
99 typedef ush FAR ushf;
338 ush freq; /* frequency count */
339 ush code; /* bit string */
342 ush dad; /* father node in Huffman tree */
343 ush len; /* length of bit string */
360 typedef ush Pos;
473 ush bl_count[MAX_BITS+1];
527 ush bi_buf;
591 ush dist = (distance); \
[all …]
/netbsd-src/external/lgpl3/mpfr/dist/src/
H A Drint.c211 int ush; in mpfr_rint() local
224 ush = idiff == 0 ? 0 : GMP_NUMB_BITS - idiff; in mpfr_rint()
226 if (rj == 0 && ush < sh) in mpfr_rint()
232 (MPFR_LIMB_ONE << ush))) != 0) in mpfr_rint()
236 sh = ush; in mpfr_rint()
/netbsd-src/external/lgpl3/mpfr/dist/tests/
H A Dtfprintf.c158 unsigned short ush = 1; in check_mixed() local
203 check_vfprintf (fout, "a. %hi, b. %*f, c. %Re%hn", ush, 3, f, mpfr, &ush); in check_mixed()
204 check_length (3, ush, 45 + DPLEN, hu); in check_mixed()
H A Dtprintf.c285 unsigned short ush = 1; in check_mixed() local
324 check_vprintf ("a. %hi, b. %*f, c. %Re%hn", ush, 3, f, mpfr, &ush); in check_mixed()
325 check_length (3, ush, 45 + DPLEN, hu); in check_mixed()

12