Lines Matching defs:ush
101 typedef unsigned short ush;
102 typedef ush FAR ushf;
331 ush freq; /* frequency count */
332 ush code; /* bit string */
335 ush dad; /* father node in Huffman tree */
336 ush len; /* length of bit string */
353 typedef ush Pos;
483 ush bl_count[MAX_BITS+1];
551 ush bi_buf;
616 ush dist = (distance); \
759 ush good_length; /* reduce lazy search above this match length */
760 ush max_lazy; /* do not perform lazy search above this match length */
761 ush nice_length; /* quit search above this match length */
762 ush max_chain;
924 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof (ush)+2);
926 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof (ush)+2L);
935 s->d_buf = overlay + s->lit_bufsize/sizeof (ush);
936 s->l_buf = s->pending_buf + (1+sizeof (ush))*s->lit_bufsize;
1333 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof (ush)+2);
1349 ds->d_buf = overlay + ds->lit_bufsize/sizeof (ush);
1350 ds->l_buf = ds->pending_buf + (1+sizeof (ush))*ds->lit_bufsize;
1479 register ush scan_start = *(ushf*)scan;
1480 register ush scan_end = *(ushf*)(scan+best_len-1);
2394 put_byte(s, (uch)((ush)(w) >> 8)); \
2423 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
2438 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid); \
2466 ush bl_count[MAX_BITS+1];
2670 ush f; /* frequency */
2686 tree[n].Len = (ush)bits;
2737 tree[m].Len = (ush)bits;
2760 ush next_code[MAX_BITS+1];
2761 ush code = 0; /* running code value */
2868 tree[n].Dad = tree[m].Dad = (ush)node;
2914 tree[max_code+1].Len = (ush)0xffff; /* guard */
3310 s->d_buf[s->last_lit] = (ush)dist;
3319 Assert((ush)dist < (ush)MAX_DIST(s) &&
3320 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
3321 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
3511 put_short(s, (ush)len);
3512 put_short(s, (ush)~len);
5962 if (*(ush *)&buf != 0)
5972 *((ush *)&buf+1) += ((ush)((uch *)buf-0) + 15) >> 4;
5973 *(ush *)&buf = 0;
5982 if (*(ush*)&ptr != 0) { /* object < 64K */