Lines Matching refs:ush
139 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
196 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
211 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
233 ush bl_count[MAX_BITS+1];
422 ush f; /* frequency */
436 tree[n].Len = (ush)bits;
480 tree[m].Len = (ush)bits;
498 ush *bl_count /* number of codes at each bit length */
501 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
502 ush code = 0; /* running code value */
598 tree[n].Dad = tree[m].Dad = (ush)node;
641 tree[max_code+1].Len = (ush)0xffff; /* guard */
975 s->d_buf[s->last_lit] = (ush)dist;
984 Assert((ush)dist < (ush)MAX_DIST(s) &&
985 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
986 (ush)d_code(dist) < (ush)D_CODES, "zlib_tr_tally: bad match");
1100 put_short(s, (ush)len);
1101 put_short(s, (ush)~len);