Searched refs:ush (Results 1 – 6 of 6) sorted by relevance
66 ush freq; /* frequency count */67 ush code; /* bit string */70 ush dad; /* father node in Huffman tree */71 ush len; /* length of bit string */88 typedef ush Pos;202 ush bl_count[MAX_BITS+1];256 ush bi_buf;319 ush dist = (distance); \
228 if (*(ush*)&buf != 0) return buf; in zcalloc()236 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()237 *(ush*)&buf = 0; in zcalloc()245 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
184 put_byte(s, (uch)((ush)(w) >> 8)); \249 ush bl_count[MAX_BITS+1]; in tr_static_init()506 ush f; /* frequency */520 tree[n].Len = (ush)bits;564 tree[m].Len = (ush)bits;1030 s->d_buf[s->last_lit] = (ush)dist;1039 Assert((ush)dist < (ush)MAX_DIST(s) &&1040 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&1041 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");1210 put_short(s, (ush)len);[all …]
126 ush good_length; /* reduce lazy search above this match length */128 ush nice_length; /* quit search above this match length */129 ush max_chain;295 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);297 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);306 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);307 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;413 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));940 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);1052 register ush scan_start = *(ushf*)scan;[all …]
58 typedef unsigned short ush; typedef59 typedef ush FAR ushf;
773 ;;; register ush scan_start = *(ushf*)scan;774 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);