Lines Matching refs:uInt
121 typedef uLong (*check_func) OF((uLong check, Bytef *buf, uInt len));
230 uInt w_size; /* LZ77 window size (32K by default) */
231 uInt w_bits; /* log2(w_size) (8..16) */
232 uInt w_mask; /* w_size - 1 */
257 uInt ins_h; /* hash index of string to be inserted */
258 uInt hash_size; /* number of elements in hash table */
259 uInt hash_bits; /* log2(hash_size) */
260 uInt hash_mask; /* hash_size-1 */
262 uInt hash_shift;
274 uInt match_length; /* length of best match */
277 uInt strstart; /* start of string to insert */
278 uInt match_start; /* start of matching string */
279 uInt lookahead; /* number of valid bytes ahead in window */
281 uInt prev_length;
286 uInt max_chain_length;
292 uInt max_lazy_match;
306 uInt good_match;
337 uInt lit_bufsize;
357 uInt last_lit; /* running index in l_buf */
368 uInt matches; /* number of string matches in current block */
384 uInt blocks_in_packet;
535 local void putShortMSB OF((deflate_state *s, uInt b));
699 uInt b;
749 uInt header = (DEFLATED + ((state->w_bits-8)<<4)) << 8;
750 uInt level_flags = (state->level-1) >> 1;
843 putShortMSB(state, (uInt)(state->adler >> 16));
844 putShortMSB(state, (uInt)(state->adler & 0xffff));
954 uInt wmask = s->w_mask;
1115 uInt wsize = s->w_size;
1381 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
2614 uInt w)); /* window size */
2660 uInt Nalloc; /* number of these allocated here */
2664 uInt Base; /* literal, length base, or distance base */
2670 local uInt inflate_hufts;
2680 uInt, /* number of literal/length codes */
2681 uInt, /* number of distance codes */
2715 uInt, uInt,
2753 uInt method; /* if FLAGS, method byte */
2758 uInt marker; /* if BAD, inflateSync's marker bytes count */
2763 uInt wbits; /* log2(window size) (8..15, defaults to 15) */
2830 z->state->wbits = (uInt)w;
2863 uInt b;
2987 uInt n; /* number of bytes to look at */
2989 uInt m; /* number of marker bytes found in a row */
3066 uInt left; /* if STORED, bytes left to copy */
3068 uInt table; /* table lengths (14 bits) */
3069 uInt index; /* index into blens (or border) */
3071 uInt bb; /* bit length tree depth */
3081 uInt last; /* true if this block is the last block */
3084 uInt bitk; /* bits in bit buffer */
3120 local uInt inflate_mask[] = {
3144 uInt,
3145 uInt,
3159 local uInt border[] = { /* Order of the bit length code lengths */
3216 ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
3236 uInt w;
3262 uInt t; /* temporary storage */
3264 uInt k; /* bits in bit buffer */
3266 uInt n; /* bytes available there */
3268 uInt m; /* bytes to end of window or read pointer */
3278 t = (uInt)b & 7;
3294 uInt bl, bd;
3333 s->sub.left = (uInt)b & 0xffff;
3357 s->sub.trees.table = t = (uInt)b & 0x3fff;
3370 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
3384 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3407 uInt i, j, c;
3411 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
3425 j += (uInt)b & inflate_mask[i];
3447 uInt bl, bd;
3458 if (t == (uInt)Z_DATA_ERROR)
3471 ZFREE(z, s->sub.trees.blens, s->sub.trees.nblens * sizeof(uInt));
3545 uInt k; /* bits in bit buffer */ /* NOT USED HERE */
3546 uInt t; /* temporary storage */
3548 uInt n; /* bytes available there */
3550 uInt m; /* bytes to end of window or read pointer */
3615 uInt, /* number of codes */
3616 uInt, /* number of "simple" codes */
3625 uInt, /* number of items */
3626 uInt)); /* size of item */
3631 uInt n)); /* number of bytes (not used) */
3634 local uInt cplens[] = { /* Copy lengths for literal codes 257..285 */
3638 local uInt cplext[] = { /* Extra bits for literal codes 257..285 */
3641 local uInt cpdist[] = { /* Copy offsets for distance codes 0..29 */
3645 local uInt cpdext[] = { /* Extra bits for distance codes */
3688 uInt inflate_hufts;
3693 uInt n; /* number of codes (assumed <= N_MAX) */
3694 uInt s; /* number of simple-valued codes (0..s-1) */
3707 uInt a; /* counter for codes of length k */
3708 uInt c[BMAX+1]; /* bit length count table */
3709 uInt f; /* i repeats in table every f entries */
3712 register uInt i; /* counter, current code */
3713 register uInt j; /* counter */
3720 uInt v[N_MAX]; /* values in order of bit length */
3722 uInt x[BMAX+1]; /* bit offsets, then code stack */
3725 uInt z; /* number of entries in current table */
3752 if ((uInt)l < j)
3758 if ((uInt)l > i)
3811 z = (z = g - w) > (uInt)l ? l : z; /* table size upper limit */
3916 uInt nl; /* number of literal/length codes */
3917 uInt nd; /* number of distance codes */
3969 local uInt fixed_left = FIXEDH;
3971 local uInt fixed_bl;
3972 local uInt fixed_bd;
3979 uInt n; /* number of items */
3980 uInt s; /* size of item */
3993 uInt n;
4100 uInt len;
4104 uInt need; /* bits needed */
4106 uInt lit; /* if LIT, literal */
4108 uInt get; /* bits to get for extra */
4109 uInt dist; /* distance back to copy from */
4123 uInt bl, bd;
4148 uInt j; /* temporary storage */
4150 uInt e; /* extra bits or operation */
4152 uInt k; /* bits in bit buffer */
4154 uInt n; /* bytes available there */
4156 uInt m; /* bytes to end of window or read pointer */
4186 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4188 e = (uInt)(t->exop);
4224 c->len += (uInt)b & inflate_mask[j];
4233 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4235 e = (uInt)(t->exop);
4256 c->sub.copy.dist += (uInt)b & inflate_mask[j];
4262 f = (uInt)(q - s->window) < c->sub.copy.dist ?
4267 if ((uInt)(q - s->window) < c->sub.copy.dist)
4323 uInt n;
4331 n = (uInt)((q <= s->write ? s->write : s->end) - q);
4359 n = (uInt)(s->write - q);
4410 uInt bl, bd;
4416 uInt e; /* extra bits or operation */
4418 uInt k; /* bits in bit buffer */
4420 uInt n; /* bytes available there */
4422 uInt m; /* bytes to end of window or read pointer */
4423 uInt ml; /* mask for literal/length tree */
4424 uInt md; /* mask for distance tree */
4425 uInt c; /* bytes to copy */
4426 uInt d; /* distance back to copy from */
4440 if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
4456 c = t->base + ((uInt)b & inflate_mask[e]);
4462 e = (t = td + ((uInt)b & md))->exop;
4470 d = t->base + ((uInt)b & inflate_mask[e]);
4476 if ((uInt)(q - s->window) >= d) /* offset before dest */
4501 e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;
4514 if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0)
4592 uInt len;