Lines Matching refs:ush

178     put_byte(s, (uch)((ush)(w) >> 8)); \
202         s->bi_buf |= (ush)value << s->bi_valid;
204         s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
207         s->bi_buf |= (ush)value << s->bi_valid;
217     s->bi_buf |= (ush)val << s->bi_valid;\
219     s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
222     s->bi_buf |= (ush)(value) << s->bi_valid;\
243     ush bl_count[MAX_BITS+1];  in tr_static_init()
502     ush f;              /* frequency */
516         tree[n].Len = (ush)bits;
560                 tree[m].Len = (ush)bits;
580     ush next_code[MAX_BITS+1]; /* next code value for each bit length */
581     ush code = 0;              /* running code value */
677         tree[n].Dad = tree[m].Dad = (ush)node;
719     tree[max_code+1].Len = (ush)0xffff; /* guard */
1015     s->d_buf[s->last_lit] = (ush)dist;
1024         Assert((ush)dist < (ush)MAX_DIST(s) &&
1025                (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1026                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
1214         put_short(s, (ush)len);
1215         put_short(s, (ush)~len);