Lines Matching refs:ush
70 typedef unsigned short ush;
71 typedef ush FAR ushf;
208 ush freq; /* frequency count */
209 ush code; /* bit string */
212 ush dad; /* father node in Huffman tree */
213 ush len; /* length of bit string */
230 typedef ush Pos;
343 ush bl_count[MAX_BITS+1];
397 ush bi_buf;
520 ush good_length; /* reduce lazy search above this match length */
521 ush max_lazy; /* do not perform lazy search above this match length */
522 ush nice_length; /* quit search above this match length */
523 ush max_chain;
661 s->pending_buf = (uchf *) ZALLOC(strm, s->lit_bufsize, 2*sizeof(ush));
886 TRY_FREE(strm, state->pending_buf, state->lit_bufsize * 2 * sizeof(ush));
983 register ush scan_start = *(ushf*)scan;
984 register ush scan_end = *(ushf*)(scan+best_len-1);
1634 put_byte(s, (uch)((ush)(w) >> 8)); \
1660 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
1675 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
1699 ush bl_count[MAX_BITS+1];
1884 ush f; /* frequency */
1898 tree[n].Len = (ush)bits;
1942 tree[m].Len = (ush)bits;
1962 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
1963 ush code = 0; /* running code value */
2058 tree[n].Dad = tree[m].Dad = (ush)node;
2100 tree[max_code+1].Len = (ush)0xffff; /* guard */
2430 s->d_buf[s->last_lit] = (ush)dist;
2439 Assert((ush)dist < (ush)MAX_DIST(s) &&
2440 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2441 (ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
2604 put_short(s, (ush)len);
2605 put_short(s, (ush)~len);