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)); \213 next_code[bits] = (ush)code; in gen_codes()302 ush bl_count[MAX_BITS+1]; in tr_static_init()549 ush f; /* frequency */ in gen_bitlen()563 tree[n].Len = (ush)bits; in gen_bitlen()862 put_short(s, (ush)stored_len); in _tr_stored_block()863 put_short(s, (ush)~stored_len); in _tr_stored_block()1095 s->d_buf[s->sym_next] = (ush)dist;1109 Assert((ush)dist < (ush)MAX_DIST(s) &&1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&[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
5507 struct uma_stream_header ush; local5537 bzero(&ush, sizeof(ush));5538 ush.ush_version = UMA_STREAM_VERSION;5539 ush.ush_maxcpus = (mp_maxid + 1);5540 ush.ush_count = count;5541 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush));
3092 "ush\t$rt, $addr">; //, ISA_MIPS1_NOT_32R6_64R6;
226358 ush