Lines Matching refs:ush

176     put_byte(s, (uch)((ush)(w) >> 8)); \
200         s->bi_buf |= (ush)value << s->bi_valid;
202         s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205         s->bi_buf |= (ush)value << s->bi_valid;
215     s->bi_buf |= (ush)val << s->bi_valid;\
217     s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220     s->bi_buf |= (ush)(value) << s->bi_valid;\
241     ush bl_count[MAX_BITS+1];  in tr_static_init()
500     ush f;              /* frequency */
514         tree[n].Len = (ush)bits;
557                 tree[m].Len = (ush)bits;
577     ush next_code[MAX_BITS+1]; /* next code value for each bit length */
587         next_code[bits] = (ush)code;
600         tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
675         tree[n].Dad = tree[m].Dad = (ush)node;
717     tree[max_code+1].Len = (ush)0xffff; /* guard */
871     put_short(s, (ush)stored_len);
872     put_short(s, (ush)~stored_len);
1019     s->d_buf[s->last_lit] = (ush)dist;
1028         Assert((ush)dist < (ush)MAX_DIST(s) &&
1029                (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1030                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");