uIntf
uIntf *, /* 19 code lengths */
uIntf *, /* bits tree desired/actual depth */
uIntf *, /* that many (total) code lengths */
uIntf *, /* literal desired/actual bit depth */
uIntf *, /* distance desired/actual bit depth */
uIntf *, /* literal desired/actual bit depth */
uIntf *, /* distance desired/actual bit depth */
uIntf *blens; /* bit lengths of codes */
if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
uIntf *, /* code lengths in bits */
uIntf *, /* list of base values for non-simple codes */
uIntf *, /* list of extra bits for non-simple codes */
uIntf *, /* maximum lookup bits (returns actual) */
uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
uIntf *d; /* list of base values for non-simple codes */
uIntf *e; /* list of extra bits for non-simple codes */
uIntf *m; /* maximum lookup bits, returns actual */
register uIntf *p; /* pointer into c[], b[], or v[] */
uIntf *xp; /* pointer into x */
uIntf *c; /* 19 code lengths */
uIntf *bb; /* bits tree desired/actual depth */
r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, tb, bb, z);
uIntf *c; /* that many (total) code lengths */
uIntf *bl; /* literal desired/actual bit depth */
uIntf *bd; /* distance desired/actual bit depth */
uIntf *bl; /* literal desired/actual bit depth */
uIntf *bd; /* distance desired/actual bit depth */
uIntf *, /* 19 code lengths */
uIntf *, /* bits tree desired/actual depth */
uIntf *, /* that many (total) code lengths */
uIntf *, /* literal desired/actual bit depth */
uIntf *, /* distance desired/actual bit depth */
uIntf *, /* literal desired/actual bit depth */
uIntf *, /* distance desired/actual bit depth */
uIntf *blens; /* bit lengths of codes */
if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t,
uIntf *, /* code lengths in bits */
const uIntf *, /* list of base values for non-simple codes */
const uIntf *, /* list of extra bits for non-simple codes */
uIntf *, /* maximum lookup bits (returns actual) */
uIntf *v)); /* working area: values in order of bit length */
uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
const uIntf *d; /* list of base values for non-simple codes */
const uIntf *e; /* list of extra bits for non-simple codes */
uIntf *m; /* maximum lookup bits, returns actual */
uIntf *v; /* working area: values in order of bit length */
register uIntf *p; /* pointer into c[], b[], or v[] */
uIntf *xp; /* pointer into x */
uIntf *c; /* 19 code lengths */
uIntf *bb; /* bits tree desired/actual depth */
uIntf v[19]; /* work area for huft_build */
r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL, tb, bb,
uIntf *c; /* that many (total) code lengths */
uIntf *bl; /* literal desired/actual bit depth */
uIntf *bd; /* distance desired/actual bit depth */
uIntf v[288]; /* work area for huft_build */
uIntf *bl; /* literal desired/actual bit depth */
uIntf *bd; /* distance desired/actual bit depth */
uIntf *c; /* length list for huft_build */
uIntf *v;
if ((c = (uIntf*)ZALLOC(z, 288, sizeof (uInt))) == Z_NULL)
if ((v = (uIntf*)ZALLOC(z, 288, sizeof (uInt))) == Z_NULL)