Lines Matching defs:ush
61 typedef unsigned short ush;
182 outbuf[outcnt++] = (uch) ((ush)(w) >> 8); \
185 put_byte((uch)((ush)(w) >> 8)); \
232 static void lm_init (ush * flags);
236 static void ct_init (ush * attr, int *methodp);
315 DECLARE(ush, d_buf, DIST_BUFSIZE);
317 DECLARE(ush, tab_prefix, 1L << BITS);
544 bi_buf = (ush) value >> (Buf_size - bi_valid);
594 put_short((ush) len);
595 put_short((ush) ~ len);
662 * void lm_init (int pack_level, ush *flags)
720 typedef ush Pos;
853 static void lm_init(ush *flags)
1278 ALLOC(ush, d_buf, DIST_BUFSIZE);
1280 ALLOC(ush, tab_prefix, 1L << BITS);
1393 * void ct_init (ush *attr, int *methodp)
1499 ush freq; /* frequency count */
1500 ush code; /* bit string */
1503 ush dad; /* father node in Huffman tree */
1504 ush len; /* length of bit string */
1559 static ush bl_count[MAX_BITS + 1];
1604 /* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
1629 static ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
1673 static void ct_init(ush *attr, int *methodp)
1846 ush f; /* frequency */
1862 tree[n].Len = (ush) bits;
1916 tree[m].Len = (ush) bits;
1933 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
1934 ush code = 0; /* running code value */
2034 tree[n].Dad = tree[m].Dad = (ush) node;
2077 tree[max_code + 1].Len = (ush) 0xffff; /* guard */
2242 if (*file_type == (ush) UNKNOWN)
2342 Assert((ush) dist < (ush) MAX_DIST &&
2343 (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH) &&
2344 (ush) d_code(dist) < (ush) D_CODES, "ct_tally: bad match");
2349 d_buf[last_dist++] = (ush) dist;
2477 ush attr = 0; /* ascii/binary flag */
2478 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */