ush
__be16 *ush;
ush = ((__be16 *) (label+1)) - 1;
for (csum = 0; ush >= ((__be16 *) label);)
csum ^= *ush--;
ush n; /* literal, length base, or distance base */
const ush *, const ush *, struct huft **, int *));
static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
static const ush cplext[] = { /* Extra bits for literal codes 257..285 */
static const ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
static const ush cpdext[] = { /* Extra bits for distance codes */
STATIC const ush mask_bits[] = {
const ush *d, /* list of base values for non-simple codes */
const ush *e, /* list of extra bits for non-simple codes */
r.v.n = (ush)(*p); /* simple code is just the value */
ush good_length; /* reduce lazy search above this match length */
ush max_lazy; /* do not perform lazy search above this match length */
ush nice_length; /* quit search above this match length */
ush max_chain;
ush *overlay;
overlay = (ush *) mem->overlay_memory;
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
register ush scan_start = *(ush*)scan;
register ush scan_end = *(ush*)(scan+best_len-1);
if (*(ush*)(match+best_len-1) != scan_end ||
*(ush*)match != scan_start) continue;
} while (*(ush*)(scan+=2) == *(ush*)(match+=2) &&
*(ush*)(scan+=2) == *(ush*)(match+=2) &&
*(ush*)(scan+=2) == *(ush*)(match+=2) &&
*(ush*)(scan+=2) == *(ush*)(match+=2) &&
scan_end = *(ush*)(scan+best_len-1);
put_short(s, (ush)len);
put_short(s, (ush)~len);
static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
ush bl_count[MAX_BITS+1];
ush f; /* frequency */
tree[n].Len = (ush)bits;
tree[m].Len = (ush)bits;
ush *bl_count /* number of codes at each bit length */
ush next_code[MAX_BITS+1]; /* next code value for each bit length */
ush code = 0; /* running code value */
tree[n].Dad = tree[m].Dad = (ush)node;
tree[max_code+1].Len = (ush)0xffff; /* guard */
s->d_buf[s->last_lit] = (ush)dist;
Assert((ush)dist < (ush)MAX_DIST(s) &&
(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
(ush)d_code(dist) < (ush)D_CODES, "zlib_tr_tally: bad match");
ush bl_count[MAX_BITS+1];
ush *d_buf;
ush bi_buf;
((1 << ((memLevel)+6)) * (sizeof(ush)+2))
put_byte(s, (uch)((ush)(w) >> 8)); \
s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
ush freq; /* frequency count */
ush code; /* bit string */
ush dad; /* father node in Huffman tree */
ush len; /* length of bit string */
typedef ush Pos;