Lines Matching refs:ush
184 put_byte(s, (uch)((ush)(w) >> 8)); \
210 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
225 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
249 ush bl_count[MAX_BITS+1]; in tr_static_init()
506 ush f; /* frequency */
520 tree[n].Len = (ush)bits;
564 tree[m].Len = (ush)bits;
584 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
585 ush code = 0; /* running code value */
681 tree[n].Dad = tree[m].Dad = (ush)node;
723 tree[max_code+1].Len = (ush)0xffff; /* guard */
1030 s->d_buf[s->last_lit] = (ush)dist;
1039 Assert((ush)dist < (ush)MAX_DIST(s) &&
1040 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
1041 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1210 put_short(s, (ush)len);
1211 put_short(s, (ush)~len);