Lines Matching refs:uInt
32 uInt, /* number of codes */
33 uInt, /* number of "simple" codes */
39 uInt *, /* hufts used in space */
43 local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */
47 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
50 local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
54 local const uInt cpdext[30] = { /* Extra bits for distance codes */
97 uInt n, /* number of codes (assumed <= 288) */
98 uInt s, /* number of simple-valued codes (0..s-1) */
104 uInt *hn, /* hufts used in space */
113 uInt a; /* counter for codes of length k */
114 uInt c[BMAX+1]; /* bit length count table */
115 uInt f; /* i repeats in table every f entries */
118 register uInt i; /* counter, current code */
119 register uInt j; /* counter */
122 uInt mask; /* (1 << w) - 1, to avoid cc -O bug on HP */
128 uInt x[BMAX+1]; /* bit offsets, then code stack */
131 uInt z; /* number of entries in current table */
161 if ((uInt)l < j)
167 if ((uInt)l > i)
222 z = z > (uInt)l ? (uInt)l : z; /* table size upper limit */
250 r.base = (uInt)(q - u[h-1] - j); /* offset to this table */
308 uInt hn = 0; /* hufts used in space */
311 if ((v = (uIntf*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL)
328 uInt nl, /* number of literal/length codes */
329 uInt nd, /* number of distance codes */
340 uInt hn = 0; /* hufts used in space */
344 if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
400 local uInt fixed_bl;
401 local uInt fixed_bd;
422 uInt f = 0; /* number of hufts used in fixed_mem */
427 if ((c = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
429 if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
