Lines Matching refs:ush
48 typedef unsigned short ush;
49 typedef ush FAR ushf;
186 ush freq; /* frequency count */
187 ush code; /* bit string */
190 ush dad; /* father node in Huffman tree */
191 ush len; /* length of bit string */
208 typedef ush Pos;
321 ush bl_count[MAX_BITS+1];
375 ush bi_buf;
498 ush good_length; /* reduce lazy search above this match length */
499 ush max_lazy; /* do not perform lazy search above this match length */
500 ush nice_length; /* quit search above this match length */
501 ush max_chain;
639 s->pending_buf = (uchf *) ZALLOC(strm, s->lit_bufsize, 2*sizeof(ush));
864 TRY_FREE(strm, state->pending_buf, state->lit_bufsize * 2 * sizeof(ush));
961 register ush scan_start = *(ushf*)scan;
962 register ush scan_end = *(ushf*)(scan+best_len-1);
1612 put_byte(s, (uch)((ush)(w) >> 8)); \
1638 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
1653 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
1677 ush bl_count[MAX_BITS+1];
1862 ush f; /* frequency */
1876 tree[n].Len = (ush)bits;
1920 tree[m].Len = (ush)bits;
1940 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
1941 ush code = 0; /* running code value */
2036 tree[n].Dad = tree[m].Dad = (ush)node;
2078 tree[max_code+1].Len = (ush)0xffff; /* guard */
2408 s->d_buf[s->last_lit] = (ush)dist;
2417 Assert((ush)dist < (ush)MAX_DIST(s) &&
2418 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2419 (ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
2582 put_short(s, (ush)len);
2583 put_short(s, (ush)~len);