Lines Matching refs:ush
209 put_byte(s, (uch)((ush)(w) >> 8)); \
237 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); in send_bits()
252 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
277 ush bl_count[MAX_BITS+1]; in tr_static_init()
536 ush f; /* frequency */ in gen_bitlen()
553 tree[n].Len = (ush)bits; in gen_bitlen()
597 tree[m].Len = (ush)bits; in gen_bitlen()
619 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes()
620 ush code = 0; /* running code value */ in gen_codes()
628 next_code[bits] = code = (ush)((code + bl_count[bits-1]) << 1); in gen_codes()
641 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()
718 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
764 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree()
1086 s->d_buf[s->last_lit] = (ush)dist;
1095 Assert((ush)dist < (ush)MAX_DIST(s) &&
1096 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1097 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1280 put_short(s, (ush)len);
1281 put_short(s, (ush)~len);