Searched refs:ush (Results 1 – 9 of 9) sorted by relevance
70 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); \
176 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 …]
231 if (*(ush*)&buf != 0) return buf; in zcalloc()239 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()240 *(ush*)&buf = 0; in zcalloc()251 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
41 typedef unsigned short ush; typedef42 typedef ush FAR ushf;
115 ush good_length; /* reduce lazy search above this match length */116 ush max_lazy; /* do not perform lazy search above this match length */117 ush nice_length; /* quit search above this match length */118 ush max_chain;595 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);1301 register ush scan_start = *(ushf*)scan;1302 register ush scan_end = *(ushf*)(scan + best_len - 1);
631 - Add ush casts in trees.c to avoid pedantic runtime errors
4029 struct uma_stream_header ush; local4058 bzero(&ush, sizeof(ush));4059 ush.ush_version = UMA_STREAM_VERSION;4060 ush.ush_maxcpus = (mp_maxid + 1);4061 ush.ush_count = count;4062 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush));
3087 "ush\t$rt, $addr">; //, ISA_MIPS1_NOT_32R6_64R6;
226327 ush