Lines Matching refs:uIntf
26 uIntf *, /* code lengths in bits */
29 const uIntf *, /* list of base values for non-simple codes */
30 const uIntf *, /* list of extra bits for non-simple codes */
32 uIntf *, /* maximum lookup bits (returns actual) */
35 uIntf * )); /* space for values */
91 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */ in huft_build()
94 const uIntf *d; /* list of base values for non-simple codes */
95 const uIntf *e; /* list of extra bits for non-simple codes */
97 uIntf *m; /* maximum lookup bits, returns actual */
100 uIntf *v; /* working area: values in order of bit length */
118 register uIntf *p; /* pointer into c[], b[], or v[] */
124 uIntf *xp; /* pointer into x */
292 uIntf *c; /* 19 code lengths */ in zlib_inflate_trees_bits()
293 uIntf *bb; /* bits tree desired/actual depth */
300 uIntf *v; /* work area for huft_build */
303 r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)Z_NULL,
318 uIntf *c; /* that many (total) code lengths */
319 uIntf *bl; /* literal desired/actual bit depth */
320 uIntf *bd; /* distance desired/actual bit depth */
328 uIntf *v; /* work area for huft_build */
380 uIntf *bl; /* literal desired/actual bit depth */ in zlib_inflate_trees_fixed()
381 uIntf *bd; /* distance desired/actual bit depth */