Lines Matching refs:uInt
229 extern void zmemcpy OF((Bytef* dest, Bytef* source, uInt len));
230 extern int zmemcmp OF((Bytef* s1, Bytef* s2, uInt len));
231 extern void zmemzero OF((Bytef* dest, uInt len));
257 typedef uLong (*check_func) OF((uLong check, const Bytef *buf, uInt len));
366 uInt w_size; /* LZ77 window size (32K by default) */
367 uInt w_bits; /* log2(w_size) (8..16) */
368 uInt w_mask; /* w_size - 1 */
393 uInt ins_h; /* hash index of string to be inserted */
394 uInt hash_size; /* number of elements in hash table */
395 uInt hash_bits; /* log2(hash_size) */
396 uInt hash_mask; /* hash_size-1 */
398 uInt hash_shift;
410 uInt match_length; /* length of best match */
413 uInt strstart; /* start of string to insert */
414 uInt match_start; /* start of matching string */
415 uInt lookahead; /* number of valid bytes ahead in window */
417 uInt prev_length;
422 uInt max_chain_length;
428 uInt max_lazy_match;
442 uInt good_match;
473 uInt lit_bufsize;
493 uInt last_lit; /* running index in l_buf */
504 uInt matches; /* number of string matches in current block */
631 local void putShortMSB OF((deflate_state *s, uInt b));
636 uInt longest_match OF((deflate_state *s, IPos cur_match));
638 local uInt longest_match OF((deflate_state *s, IPos cur_match));
836 uInt dictLength;
839 uInt length = dictLength;
840 uInt n;
948 uInt b;
1009 uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
1010 uInt level_flags = (s->level-1) >> 1;
1022 putShortMSB(s, (uInt)(strm->adler >> 16));
1023 putShortMSB(s, (uInt)(strm->adler & 0xffff));
1109 putShortMSB(s, (uInt)(strm->adler >> 16));
1110 putShortMSB(s, (uInt)(strm->adler & 0xffff));
1185 zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
1280 local uInt longest_match(s, cur_match) in longest_match()
1296 uInt wmask = s->w_mask;
1323 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1414 if ((uInt)best_len <= s->lookahead) return best_len;
1463 uInt wsize = s->w_size;
1613 s->lookahead = (uInt)(s->strstart - max_start);
1614 s->strstart = (uInt)max_start;
1620 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1787 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
3023 uInt w)); /* window size */
3043 uInt n)); /* dictionary length */
3080 uInt method; /* if FLAGS, method byte */
3085 uInt marker; /* if BAD, inflateSync's marker bytes count */
3090 uInt wbits; /* log2(window size) (8..15, defaults to 15) */
3170 z->state->wbits = (uInt)w;
3174 inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w))
3205 uInt b;
3335 uInt dictLength;
3337 uInt length = dictLength;
3345 if (length >= ((uInt)1<<z->state->wbits))
3376 uInt n; /* number of bytes to look at */
3378 uInt m; /* number of marker bytes found in a row */
3460 uInt Base; /* literal, length base, or distance base */
3466 extern uInt inflate_hufts;
3476 uInt, /* number of literal/length codes */
3477 uInt, /* number of distance codes */
3512 uInt, uInt,
3562 uInt left; /* if STORED, bytes left to copy */
3564 uInt table; /* table lengths (14 bits) */
3565 uInt index; /* index into blens (or border) */
3567 uInt bb; /* bit length tree depth */
3577 uInt last; /* true if this block is the last block */
3580 uInt bitk; /* bits in bit buffer */
3606 #define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q)
3607 #define LOADOUT {q=s->write;m=(uInt)WAVAIL;}
3608 #define WWRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
3616 extern uInt inflate_mask[17];
3636 local const uInt border[] = { /* Order of the bit length code lengths */
3713 uInt w;
3735 extern uInt inflate_hufts;
3742 uInt t; /* temporary storage */
3744 uInt k; /* bits in bit buffer */
3746 uInt n; /* bytes available there */
3748 uInt m; /* bytes to end of window or read pointer */
3758 t = (uInt)b & 7;
3774 uInt bl, bd;
3813 s->sub.left = (uInt)b & 0xffff;
3837 s->sub.trees.table = t = (uInt)b & 0x3fff;
3850 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
3863 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3888 uInt i, j, c;
3892 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
3906 j += (uInt)b & inflate_mask[i];
3930 uInt bl, bd;
3944 if (t == (uInt)Z_DATA_ERROR) {
4029 uInt n;
4048 uInt k; /* bits in bit buffer */ /* NOT USED HERE */
4049 uInt t; /* temporary storage */
4051 uInt n; /* bytes available there */
4053 uInt m; /* bytes to end of window or read pointer */
4133 uInt, /* number of codes */
4134 uInt, /* number of "simple" codes */
4143 uInt, /* number of items */
4144 uInt)); /* size of item */
4147 local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */
4151 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
4154 local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
4158 local const uInt cpdext[30] = { /* Extra bits for distance codes */
4201 uInt inflate_hufts;
4206 uInt n; /* number of codes (assumed <= N_MAX) */
4207 uInt s; /* number of simple-valued codes (0..s-1) */
4220 uInt a; /* counter for codes of length k */
4221 uInt c[BMAX+1]; /* bit length count table */
4222 uInt f; /* i repeats in table every f entries */
4225 uInt i; /* counter, current code */
4226 uInt j; /* counter */
4233 uInt v[N_MAX]; /* values in order of bit length */
4235 uInt x[BMAX+1]; /* bit offsets, then code stack */
4238 uInt z; /* number of entries in current table */
4265 if ((uInt)l < j)
4271 if ((uInt)l > i)
4326 z = z > (uInt)l ? l : z; /* table size upper limit */
4430 uInt nl; /* number of literal/length codes */ in inflate_trees_dynamic()
4431 uInt nd; /* number of distance codes */
4490 local uInt fixed_bl;
4491 local uInt fixed_bd;
4498 uInt n; /* number of items */
4499 uInt s; /* size of item */
4611 uInt,
4612 uInt,
4643 uInt len;
4647 uInt need; /* bits needed */
4649 uInt lit; /* if LIT, literal */
4651 uInt get; /* bits to get for extra */
4652 uInt dist; /* distance back to copy from */
4666 uInt bl, bd; in inflate_codes_new()
4692 uInt j; /* temporary storage */
4694 uInt e; /* extra bits or operation */
4696 uInt k; /* bits in bit buffer */
4698 uInt n; /* bytes available there */
4700 uInt m; /* bytes to end of window or read pointer */
4730 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4732 e = (uInt)(t->exop);
4768 c->len += (uInt)b & inflate_mask[j];
4777 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4779 e = (uInt)(t->exop);
4800 c->sub.copy.dist += (uInt)b & inflate_mask[j];
4806 f = (uInt)(q - s->window) < c->sub.copy.dist ?
4811 if ((uInt)(q - s->window) < c->sub.copy.dist)
4812 f = s->end - (c->sub.copy.dist - (uInt)(q - s->window));
4873 uInt inflate_mask[17] = {
4886 uInt n;
4895 n = (uInt)((q <= s->write ? s->write : s->end) - q);
4923 n = (uInt)(s->write - q);
4985 uInt bl, bd; in inflate_fast()
4992 uInt e; /* extra bits or operation */
4994 uInt k; /* bits in bit buffer */
4996 uInt n; /* bytes available there */
4998 uInt m; /* bytes to end of window or read pointer */
4999 uInt ml; /* mask for literal/length tree */
5000 uInt md; /* mask for distance tree */
5001 uInt c; /* bytes to copy */
5002 uInt d; /* distance back to copy from */
5016 if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
5032 c = t->base + ((uInt)b & inflate_mask[e]);
5038 e = (t = td + ((uInt)b & md))->exop;
5046 d = t->base + ((uInt)b & inflate_mask[e]);
5052 if ((uInt)(q - s->window) >= d) /* offset before dest */
5060 e = d - (uInt)(q - s->window); /* bytes from offset to end */
5077 e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;
5090 if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0)
5179 uInt len;
5190 uInt len;
5192 uInt j;
5202 uInt len;
5319 extern voidp calloc OF((uInt items, uInt size));
5367 uInt len;