Searched refs:ush (Results 1 – 9 of 9) sorted by relevance
74 ush freq; /* frequency count */75 ush code; /* bit string */78 ush dad; /* father node in Huffman tree */79 ush len; /* length of bit string */96 typedef ush Pos;210 ush bl_count[MAX_BITS+1];266 ush bi_buf;342 ush dist = (ush)(distance); \361 ush dist = (ush)(distance); \
146 put_byte(s, (uch)((ush)(w) >> 8)); \203 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes()213 next_code[bits] = (ush)code; in gen_codes()226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()262 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()264 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); in send_bits()267 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()277 s->bi_buf |= (ush)val << s->bi_valid;\279 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\282 s->bi_buf |= (ush)(value) << s->bi_valid;\[all …]
213 if (*(ush*)&buf != 0) return buf; in zcalloc()221 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()222 *(ush*)&buf = 0; in zcalloc()232 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
41 typedef unsigned short ush; typedef42 typedef ush FAR ushf;
99 ush good_length; /* reduce lazy search above this match length */100 ush max_lazy; /* do not perform lazy search above this match length */101 ush nice_length; /* quit search above this match length */102 ush max_chain;742 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid); in deflatePrime()1368 register ush scan_start = *(ushf*)scan; in longest_match()1369 register ush scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
659 - Add ush casts in trees.c to avoid pedantic runtime errors
5557 struct uma_stream_header ush; local5587 bzero(&ush, sizeof(ush));5588 ush.ush_version = UMA_STREAM_VERSION;5589 ush.ush_maxcpus = (mp_maxid + 1);5590 ush.ush_count = count;5591 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush));
3095 "ush\t$rt, $addr">; //, ISA_MIPS1_NOT_32R6_64R6;
226358 ush