Lines Matching refs:ush

183     put_byte(s, (uch)((ush)(w) >> 8)); \
207         s->bi_buf |= (ush)value << s->bi_valid;
209         s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
212         s->bi_buf |= (ush)value << s->bi_valid;
222     s->bi_buf |= (ush)val << s->bi_valid;\
224     s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
227     s->bi_buf |= (ush)(value) << s->bi_valid;\
248     ush bl_count[MAX_BITS+1];  in tr_static_init()
508     ush f;              /* frequency */
522         tree[n].Len = (ush)bits;
566                 tree[m].Len = (ush)bits;
586     ush next_code[MAX_BITS+1]; /* next code value for each bit length */
587     ush code = 0;              /* running code value */
683         tree[n].Dad = tree[m].Dad = (ush)node;
725     tree[max_code+1].Len = (ush)0xffff; /* guard */
1031     s->d_buf[s->last_lit] = (ush)dist;
1040         Assert((ush)dist < (ush)MAX_DIST(s) &&
1041                (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1042                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
1232         put_short(s, (ush)len);
1233         put_short(s, (ush)~len);