inflate_huft
inflate_huft *Next; /* pointer to next level of table */
inflate_huft * FAR *, /* bits tree result */
inflate_huft * FAR *, /* literal/length tree result */
inflate_huft * FAR *, /* distance tree result */
inflate_huft * FAR *, /* literal/length tree result */
inflate_huft * FAR *)); /* distance tree result */
inflate_huft *, /* tables to free */
inflate_huft *, inflate_huft *,
inflate_huft *tb; /* bit length decoding tree */
inflate_huft *tl, *td; /* trees to free */
inflate_huft *,
inflate_huft *,
inflate_huft *tl, *td;
inflate_huft *h;
inflate_huft *tl, *td;
inflate_huft * FAR*,/* result: starting table */
inflate_huft * FAR *t; /* result: starting table */
inflate_huft *q; /* points to current table */
inflate_huft *u[BMAX]; /* table stack */
*t = (inflate_huft *)Z_NULL;
u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */
q = (inflate_huft *)Z_NULL; /* ditto */
if ((q = (inflate_huft *)ZALLOC
(zs,z + 1,sizeof(inflate_huft))) == Z_NULL)
inflate_huft * FAR *tb; /* bits tree result */
inflate_huft * FAR *tl; /* literal/length tree result */
inflate_huft * FAR *td; /* distance tree result */
local inflate_huft fixed_mem[FIXEDH];
local inflate_huft *fixed_tl;
local inflate_huft *fixed_td;
Assert(s == sizeof(inflate_huft) && n <= fixed_left,
inflate_huft * FAR *tl; /* literal/length tree result */
inflate_huft * FAR *td; /* distance tree result */
inflate_huft *t; /* table to free */
register inflate_huft *p, *q;
ZFREE(z, p, p->word.Nalloc * sizeof(inflate_huft));
inflate_huft *tree; /* pointer into tree */
inflate_huft *ltree; /* literal/length/eob tree */
inflate_huft *dtree; /* distance tree */
inflate_huft *tl, *td;
inflate_huft *t; /* temporary pointer */
inflate_huft *tl, *td;
inflate_huft *t; /* temporary pointer */
local const inflate_huft fixed_td[] = {
local const inflate_huft fixed_tl[] = {
inflate_huft * FAR *, /* bits tree result */
inflate_huft *, /* space for trees */
inflate_huft * FAR *, /* literal/length tree result */
inflate_huft * FAR *, /* distance tree result */
inflate_huft *, /* space for trees */
const inflate_huft * FAR *, /* literal/length tree result */
const inflate_huft * FAR *, /* distance tree result */
const inflate_huft *, const inflate_huft *,
inflate_huft *tb; /* bit length decoding tree */
inflate_huft *hufts; /* single malloc for tree space */
s->hufts = (inflate_huft *)ZALLOC(z, MANY, sizeof (inflate_huft));
const inflate_huft *tl, *td;
inflate_huft *h;
inflate_huft *tl, *td;
inflate_huft * FAR*, /* result: starting table */
inflate_huft *hp, /* space for trees */
inflate_huft * FAR *t; /* result: starting table */
inflate_huft *hp; /* space for trees */
inflate_huft *q; /* points to current table */
inflate_huft *u[BMAX]; /* table stack */
*t = (inflate_huft *)Z_NULL;
u[0] = (inflate_huft *)Z_NULL; /* just to keep compilers happy */
q = (inflate_huft *)Z_NULL; /* ditto */
inflate_huft * FAR *tb; /* bits tree result */
inflate_huft *hp; /* space for trees */
inflate_huft * FAR *tl; /* literal/length tree result */
inflate_huft * FAR *td; /* distance tree result */
inflate_huft *hp; /* space for trees */
local inflate_huft fixed_mem[FIXEDH];
local inflate_huft *fixed_tl;
local inflate_huft *fixed_td;
const inflate_huft * FAR *tl; /* literal/length tree result */
const inflate_huft * FAR *td; /* distance tree result */
const inflate_huft *,
const inflate_huft *,
const inflate_huft *tree; /* pointer into tree */
const inflate_huft *ltree; /* literal/length/eob tree */
const inflate_huft *dtree; /* distance tree */
const inflate_huft *tl;
const inflate_huft *td; /* need separate declaration for Borland C++ */
const inflate_huft *t; /* temporary pointer */
const inflate_huft *tl;
const inflate_huft *td; /* need separate declaration for Borland C++ */
const inflate_huft *t; /* temporary pointer */