Searched refs:ush (Results 1 – 5 of 5) sorted by relevance
91 ush freq; /* frequency count */92 ush code; /* bit string */95 ush dad; /* father node in Huffman tree */96 ush len; /* length of bit string */113 typedef ush Pos;229 ush bl_count[MAX_BITS+1];283 ush bi_buf;346 ush dist = (ush)(distance); \
209 put_byte(s, (uch)((ush)(w) >> 8)); \277 ush bl_count[MAX_BITS+1]; in tr_static_init()536 ush f; /* frequency */ in gen_bitlen()553 tree[n].Len = (ush)bits; in gen_bitlen()597 tree[m].Len = (ush)bits; in gen_bitlen()1086 s->d_buf[s->last_lit] = (ush)dist;1095 Assert((ush)dist < (ush)MAX_DIST(s) &&1096 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&1097 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");1280 put_short(s, (ush)len);[all …]
250 if (*(ush*)&buf != 0) return buf; in zcalloc()258 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()259 *(ush*)&buf = 0; in zcalloc()268 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
151 ush good_length; /* reduce lazy search above this match length */153 ush nice_length; /* quit search above this match length */154 ush max_chain;313 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); in deflateInit2_()315 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in deflateInit2_()324 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in deflateInit2_()325 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in deflateInit2_()443 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1)); in deflatePrime()965 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush); in deflateCopy()1075 ush scan_start = *(ushf*)scan; in longest_match()[all …]
88 typedef unsigned short ush; typedef89 typedef ush FAR ushf;