Lines Matching defs:ush
89 typedef unsigned short ush;
90 typedef ush FAR ushf;
311 ush freq; /* frequency count */
312 ush code; /* bit string */
315 ush dad; /* father node in Huffman tree */
316 ush len; /* length of bit string */
333 typedef ush Pos;
446 ush bl_count[MAX_BITS+1];
500 ush bi_buf;
658 ush good_length; /* reduce lazy search above this match length */
659 ush max_lazy; /* do not perform lazy search above this match length */
660 ush nice_length; /* quit search above this match length */
661 ush max_chain;
801 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
803 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
811 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
812 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
1162 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
1177 ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
1178 ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
1292 register ush scan_start = *(ushf*)scan;
1293 register ush scan_end = *(ushf*)(scan+best_len-1);
2008 put_byte(s, (uch)((ush)(w) >> 8)); \
2034 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
2049 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
2075 ush bl_count[MAX_BITS+1];
2260 ush f; /* frequency */
2274 tree[n].Len = (ush)bits;
2318 tree[m].Len = (ush)bits;
2338 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
2339 ush code = 0; /* running code value */
2434 tree[n].Dad = tree[m].Dad = (ush)node;
2476 tree[max_code+1].Len = (ush)0xffff; /* guard */
2800 s->d_buf[s->last_lit] = (ush)dist;
2809 Assert((ush)dist < (ush)MAX_DIST(s) &&
2810 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2811 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
2974 put_short(s, (ush)len);
2975 put_short(s, (ush)~len);
5236 if (*(ush*)&buf != 0) return buf;
5244 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
5245 *(ush*)&buf = 0;
5253 if (*(ush*)&ptr != 0) { /* object < 64K */