uch
uch *in, *out, ch;
output_data = (uch *)output_start;
input_data = (uch *)input_start;
static uch *inbuf; /* input buffer */
static uch *window; /* Sliding window buffer */
static uch *output_data;
uch *in, *out, ch;
static uch *inbuf; /* input buffer */
static uch window[WSIZE]; /* Sliding window buffer */
static uch *output_data;
uch flags;
flags = (uch)get_byte();
uch e; /* number of extra bits or operation */
uch b; /* number of bits in this code or subcode */
#define NEXTBYTE() ({ int v = get_byte(); if (v < 0) goto underrun; (uch)v; })
r.b = (uch)l; /* bits to dump before this table */
r.e = (uch)(16 + j); /* bits in this table */
r.b = (uch)(k - w);
r.e = (uch)(*p < 256 ? 16 : 15); /* 256 is end-of-block code */
r.e = (uch)e[*p - s]; /* non-simple--look up in lists */
slide[w++] = (uch)t->v.n;
slide[w++] = (uch)b;
s->pending_buf = (uch *) overlay;
static uch length_code[MAX_MATCH-MIN_MATCH+1];
length_code[length++] = (uch)code;
length_code[length-1] = (uch)code;
dist_code[dist++] = (uch)code;
dist_code[256 + dist++] = (uch)code;
s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1);
static const uch bl_order[BL_CODES]
s->l_buf[s->last_lit++] = (uch)lc;
static uch dist_code[512];
uch depth[2*L_CODES+1];
uch *l_buf; /* buffer for literals or lengths */
put_byte(s, (uch)((w) & 0xff)); \
put_byte(s, (uch)((ush)(w) >> 8)); \