uInt 274 lib/libz/zconf.h typedef uInt FAR uIntf;
uInt 85 lib/libz/zlib.h uInt avail_in; /* number of bytes available at next_in */
uInt 89 lib/libz/zlib.h uInt avail_out; /* remaining free space at next_out */
uInt 116 lib/libz/zlib.h uInt extra_len; /* extra field length (valid if extra != Z_NULL) */
uInt 117 lib/libz/zlib.h uInt extra_max; /* space at extra (only when reading header) */
uInt 119 lib/libz/zlib.h uInt name_max; /* space at name (only when reading header) */
uInt 121 lib/libz/zlib.h uInt comm_max; /* space at comment (only when reading header) */
uInt 541 lib/libz/zlib.h uInt dictLength));
uInt 739 lib/libz/zlib.h uInt dictLength));
uInt 1261 lib/libz/zlib.h ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));
uInt 1286 lib/libz/zlib.h ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len));
uInt 242 net/zlib.c uInt w_size; /* LZ77 window size (32K by default) */
uInt 243 net/zlib.c uInt w_bits; /* log2(w_size) (8..16) */
uInt 244 net/zlib.c uInt w_mask; /* w_size - 1 */
uInt 269 net/zlib.c uInt ins_h; /* hash index of string to be inserted */
uInt 270 net/zlib.c uInt hash_size; /* number of elements in hash table */
uInt 271 net/zlib.c uInt hash_bits; /* log2(hash_size) */
uInt 272 net/zlib.c uInt hash_mask; /* hash_size-1 */
uInt 274 net/zlib.c uInt hash_shift;
uInt 286 net/zlib.c uInt match_length; /* length of best match */
uInt 289 net/zlib.c uInt strstart; /* start of string to insert */
uInt 290 net/zlib.c uInt match_start; /* start of matching string */
uInt 291 net/zlib.c uInt lookahead; /* number of valid bytes ahead in window */
uInt 293 net/zlib.c uInt prev_length;
uInt 298 net/zlib.c uInt max_chain_length;
uInt 304 net/zlib.c uInt max_lazy_match;
uInt 318 net/zlib.c uInt good_match;
uInt 349 net/zlib.c uInt lit_bufsize;
uInt 369 net/zlib.c uInt last_lit; /* running index in l_buf */
uInt 380 net/zlib.c uInt matches; /* number of string matches in current block */
uInt 396 net/zlib.c uInt blocks_in_packet;
uInt 762 net/zlib.c uInt header = (DEFLATED + ((state->w_bits-8)<<4)) << 8;
uInt 763 net/zlib.c uInt level_flags = (state->level-1) >> 1;
uInt 856 net/zlib.c putShortMSB(state, (uInt)(state->adler >> 16));
uInt 857 net/zlib.c putShortMSB(state, (uInt)(state->adler & 0xffff));
uInt 967 net/zlib.c uInt wmask = s->w_mask;
uInt 1128 net/zlib.c uInt wsize = s->w_size;
uInt 1394 net/zlib.c uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
uInt 2672 net/zlib.c uInt Nalloc; /* number of these allocated here */
uInt 2676 net/zlib.c uInt Base; /* literal, length base, or distance base */
uInt 2682 net/zlib.c local uInt inflate_hufts;
uInt 2765 net/zlib.c uInt method; /* if FLAGS, method byte */
uInt 2770 net/zlib.c uInt marker; /* if BAD, inflateSync's marker bytes count */
uInt 2775 net/zlib.c uInt wbits; /* log2(window size) (8..15, defaults to 15) */
uInt 2842 net/zlib.c z->state->wbits = (uInt)w;
uInt 2875 net/zlib.c uInt b;
uInt 2999 net/zlib.c uInt n; /* number of bytes to look at */
uInt 3001 net/zlib.c uInt m; /* number of marker bytes found in a row */
uInt 3078 net/zlib.c uInt left; /* if STORED, bytes left to copy */
uInt 3080 net/zlib.c uInt table; /* table lengths (14 bits) */
uInt 3081 net/zlib.c uInt index; /* index into blens (or border) */
uInt 3083 net/zlib.c uInt bb; /* bit length tree depth */
uInt 3093 net/zlib.c uInt last; /* true if this block is the last block */
uInt 3096 net/zlib.c uInt bitk; /* bits in bit buffer */
uInt 3132 net/zlib.c local const uInt inflate_mask[] = {
uInt 3171 net/zlib.c local uInt border[] = { /* Order of the bit length code lengths */
uInt 3228 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
uInt 3274 net/zlib.c uInt t; /* temporary storage */
uInt 3276 net/zlib.c uInt k; /* bits in bit buffer */
uInt 3278 net/zlib.c uInt n; /* bytes available there */
uInt 3280 net/zlib.c uInt m; /* bytes to end of window or read pointer */
uInt 3290 net/zlib.c t = (uInt)b & 7;
uInt 3306 net/zlib.c uInt bl, bd;
uInt 3345 net/zlib.c s->sub.left = (uInt)b & 0xffff;
uInt 3369 net/zlib.c s->sub.trees.table = t = (uInt)b & 0x3fff;
uInt 3382 net/zlib.c if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
uInt 3396 net/zlib.c s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
uInt 3409 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
uInt 3422 net/zlib.c uInt i, j, c;
uInt 3426 net/zlib.c h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
uInt 3440 net/zlib.c j += (uInt)b & inflate_mask[i];
uInt 3462 net/zlib.c uInt bl, bd;
uInt 3473 net/zlib.c if (t == (uInt)Z_DATA_ERROR)
uInt 3475 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
uInt 3489 net/zlib.c ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
uInt 3563 net/zlib.c uInt k; /* bits in bit buffer */ /* NOT USED HERE */
uInt 3564 net/zlib.c uInt t; /* temporary storage */
uInt 3566 net/zlib.c uInt n; /* bytes available there */
uInt 3568 net/zlib.c uInt m; /* bytes to end of window or read pointer */
uInt 3652 net/zlib.c local const uInt cplens[] = { /* Copy lengths for literal codes 257..285 */
uInt 3656 net/zlib.c local const uInt cplext[] = { /* Extra bits for literal codes 257..285 */
uInt 3659 net/zlib.c local const uInt cpdist[] = { /* Copy offsets for distance codes 0..29 */
uInt 3663 net/zlib.c local const uInt cpdext[] = { /* Extra bits for distance codes */
uInt 3706 net/zlib.c uInt inflate_hufts;
uInt 3725 net/zlib.c uInt a; /* counter for codes of length k */
uInt 3726 net/zlib.c uInt c[BMAX+1]; /* bit length count table */
uInt 3727 net/zlib.c uInt f; /* i repeats in table every f entries */
uInt 3730 net/zlib.c uInt i; /* counter, current code */
uInt 3731 net/zlib.c uInt j; /* counter */
uInt 3738 net/zlib.c uInt v[N_MAX]; /* values in order of bit length */
uInt 3740 net/zlib.c uInt x[BMAX+1]; /* bit offsets, then code stack */
uInt 3743 net/zlib.c uInt z; /* number of entries in current table */
uInt 3770 net/zlib.c if ((uInt)l < j)
uInt 3776 net/zlib.c if ((uInt)l > i)
uInt 3829 net/zlib.c z = (z = g - w) > (uInt)l ? l : z; /* table size upper limit */
uInt 3987 net/zlib.c local uInt fixed_left = FIXEDH;
uInt 3989 net/zlib.c local uInt fixed_bl;
uInt 3990 net/zlib.c local uInt fixed_bd;
uInt 4118 net/zlib.c uInt len;
uInt 4122 net/zlib.c uInt need; /* bits needed */
uInt 4124 net/zlib.c uInt lit; /* if LIT, literal */
uInt 4126 net/zlib.c uInt get; /* bits to get for extra */
uInt 4127 net/zlib.c uInt dist; /* distance back to copy from */
uInt 4166 net/zlib.c uInt j; /* temporary storage */
uInt 4168 net/zlib.c uInt e; /* extra bits or operation */
uInt 4170 net/zlib.c uInt k; /* bits in bit buffer */
uInt 4172 net/zlib.c uInt n; /* bytes available there */
uInt 4174 net/zlib.c uInt m; /* bytes to end of window or read pointer */
uInt 4204 net/zlib.c t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
uInt 4206 net/zlib.c e = (uInt)(t->exop);
uInt 4242 net/zlib.c c->len += (uInt)b & inflate_mask[j];
uInt 4251 net/zlib.c t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
uInt 4253 net/zlib.c e = (uInt)(t->exop);
uInt 4274 net/zlib.c c->sub.copy.dist += (uInt)b & inflate_mask[j];
uInt 4280 net/zlib.c f = (uInt)(q - s->window) < c->sub.copy.dist ?
uInt 4285 net/zlib.c if ((uInt)(q - s->window) < c->sub.copy.dist)
uInt 4341 net/zlib.c uInt n;
uInt 4349 net/zlib.c n = (uInt)((q <= s->write ? s->write : s->end) - q);
uInt 4377 net/zlib.c n = (uInt)(s->write - q);
uInt 4434 net/zlib.c uInt e; /* extra bits or operation */
uInt 4436 net/zlib.c uInt k; /* bits in bit buffer */
uInt 4438 net/zlib.c uInt n; /* bytes available there */
uInt 4440 net/zlib.c uInt m; /* bytes to end of window or read pointer */
uInt 4441 net/zlib.c uInt ml; /* mask for literal/length tree */
uInt 4442 net/zlib.c uInt md; /* mask for distance tree */
uInt 4443 net/zlib.c uInt c; /* bytes to copy */
uInt 4444 net/zlib.c uInt d; /* distance back to copy from */
uInt 4458 net/zlib.c if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
uInt 4474 net/zlib.c c = t->base + ((uInt)b & inflate_mask[e]);
uInt 4480 net/zlib.c e = (t = td + ((uInt)b & md))->exop;
uInt 4488 net/zlib.c d = t->base + ((uInt)b & inflate_mask[e]);
uInt 4494 net/zlib.c if ((uInt)(q - s->window) >= d) /* offset before dest */
uInt 4519 net/zlib.c e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;
uInt 4532 net/zlib.c if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0)
uInt 121 net/zlib.h typedef uInt FAR uIntf;
uInt 162 net/zlib.h uInt avail_in; /* number of bytes available at next_in */
uInt 166 net/zlib.h uInt avail_out; /* remaining free space at next_out */