Lines Matching refs:ush
146 put_byte(s, (uch)((ush)(w) >> 8)); \
203 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes()
213 next_code[bits] = (ush)code; in gen_codes()
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()
262 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()
264 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); in send_bits()
267 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()
277 s->bi_buf |= (ush)val << s->bi_valid;\
279 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
282 s->bi_buf |= (ush)(value) << s->bi_valid;\
302 ush bl_count[MAX_BITS+1]; in tr_static_init()
549 ush f; /* frequency */ in gen_bitlen()
563 tree[n].Len = (ush)bits; in gen_bitlen()
606 tree[m].Len = (ush)bits; in gen_bitlen()
682 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
720 tree[max_code + 1].Len = (ush)0xffff; /* guard */ in scan_tree()
862 put_short(s, (ush)stored_len); in _tr_stored_block()
863 put_short(s, (ush)~stored_len); in _tr_stored_block()
1095 s->d_buf[s->sym_next] = (ush)dist;
1109 Assert((ush)dist < (ush)MAX_DIST(s) &&
1110 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1111 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");