Searched refs:ush (Results 1 – 7 of 7) 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];260 ush bi_buf;335 ush dist = (ush)(distance); \
176 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 …]
229 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()
48 typedef unsigned short ush; typedef49 typedef ush FAR ushf;
121 ush good_length; /* reduce lazy search above this match length */123 ush nice_length; /* quit search above this match length */124 ush max_chain;332 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);334 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);343 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);344 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;1149 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);1150 ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;1262 register ush scan_start = *(ushf*)scan;[all …]
556 - Add ush casts in trees.c to avoid pedantic runtime errors
5176 struct uma_stream_header ush; local5206 bzero(&ush, sizeof(ush));5207 ush.ush_version = UMA_STREAM_VERSION;5208 ush.ush_maxcpus = (mp_maxid + 1);5209 ush.ush_count = count;5210 (void)sbuf_bcat(&sbuf, &ush, sizeof(ush));