Lines Matching refs:uInt
218 extern void zmemcpy OF((Bytef* dest, Bytef* source, uInt len));
219 extern int zmemcmp OF((Bytef* s1, Bytef* s2, uInt len));
220 extern void zmemzero OF((Bytef* dest, uInt len));
246 typedef uLong (*check_func) OF((uLong check, const Bytef *buf, uInt len));
355 uInt w_size; /* LZ77 window size (32K by default) */
356 uInt w_bits; /* log2(w_size) (8..16) */
357 uInt w_mask; /* w_size - 1 */
382 uInt ins_h; /* hash index of string to be inserted */
383 uInt hash_size; /* number of elements in hash table */
384 uInt hash_bits; /* log2(hash_size) */
385 uInt hash_mask; /* hash_size-1 */
387 uInt hash_shift;
399 uInt match_length; /* length of best match */
402 uInt strstart; /* start of string to insert */
403 uInt match_start; /* start of matching string */
404 uInt lookahead; /* number of valid bytes ahead in window */
406 uInt prev_length;
411 uInt max_chain_length;
417 uInt max_lazy_match;
431 uInt good_match;
462 uInt lit_bufsize;
482 uInt last_lit; /* running index in l_buf */
493 uInt matches; /* number of string matches in current block */
620 local void putShortMSB OF((deflate_state *s, uInt b));
625 uInt longest_match OF((deflate_state *s, IPos cur_match));
627 local uInt longest_match OF((deflate_state *s, IPos cur_match));
825 uInt dictLength;
828 uInt length = dictLength;
829 uInt n;
937 uInt b;
998 uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
999 uInt level_flags = (s->level-1) >> 1;
1011 putShortMSB(s, (uInt)(strm->adler >> 16));
1012 putShortMSB(s, (uInt)(strm->adler & 0xffff));
1098 putShortMSB(s, (uInt)(strm->adler >> 16));
1099 putShortMSB(s, (uInt)(strm->adler & 0xffff));
1174 zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
1269 local uInt longest_match(s, cur_match)
1285 uInt wmask = s->w_mask;
1312 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1403 if ((uInt)best_len <= s->lookahead) return best_len;
1452 uInt wsize = s->w_size;
1602 s->lookahead = (uInt)(s->strstart - max_start);
1603 s->strstart = (uInt)max_start;
1609 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1776 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
3014 uInt w)); /* window size */
3034 uInt n)); /* dictionary length */
3071 uInt method; /* if FLAGS, method byte */
3076 uInt marker; /* if BAD, inflateSync's marker bytes count */
3081 uInt wbits; /* log2(window size) (8..15, defaults to 15) */
3161 z->state->wbits = (uInt)w;
3165 inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w))
3196 uInt b;
3326 uInt dictLength;
3328 uInt length = dictLength;
3336 if (length >= ((uInt)1<<z->state->wbits))
3367 uInt n; /* number of bytes to look at */
3369 uInt m; /* number of marker bytes found in a row */
3451 uInt Base; /* literal, length base, or distance base */
3457 extern uInt inflate_hufts;
3467 uInt, /* number of literal/length codes */
3468 uInt, /* number of distance codes */
3503 uInt, uInt,
3553 uInt left; /* if STORED, bytes left to copy */
3555 uInt table; /* table lengths (14 bits) */
3556 uInt index; /* index into blens (or border) */
3558 uInt bb; /* bit length tree depth */
3568 uInt last; /* true if this block is the last block */
3571 uInt bitk; /* bits in bit buffer */
3597 #define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q)
3598 #define LOADOUT {q=s->write;m=(uInt)WAVAIL;}
3599 #define WWRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
3607 extern uInt inflate_mask[17];
3627 local const uInt border[] = { /* Order of the bit length code lengths */
3704 uInt w;
3726 extern uInt inflate_hufts;
3733 uInt t; /* temporary storage */
3735 uInt k; /* bits in bit buffer */
3737 uInt n; /* bytes available there */
3739 uInt m; /* bytes to end of window or read pointer */
3749 t = (uInt)b & 7;
3765 uInt bl, bd;
3804 s->sub.left = (uInt)b & 0xffff;
3828 s->sub.trees.table = t = (uInt)b & 0x3fff;
3841 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
3854 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
3878 uInt i, j, c;
3882 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
3896 j += (uInt)b & inflate_mask[i];
3920 uInt bl, bd;
3935 if (t == (uInt)Z_DATA_ERROR)
4013 uInt n;
4032 uInt k; /* bits in bit buffer */ /* NOT USED HERE */
4033 uInt t; /* temporary storage */
4035 uInt n; /* bytes available there */
4037 uInt m; /* bytes to end of window or read pointer */
4117 uInt, /* number of codes */
4118 uInt, /* number of "simple" codes */
4127 uInt, /* number of items */
4128 uInt)); /* size of item */
4131 local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */
4135 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
4138 local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
4142 local const uInt cpdext[30] = { /* Extra bits for distance codes */
4185 uInt inflate_hufts;
4190 uInt n; /* number of codes (assumed <= N_MAX) */
4191 uInt s; /* number of simple-valued codes (0..s-1) */
4204 uInt a; /* counter for codes of length k */
4205 uInt c[BMAX+1]; /* bit length count table */
4206 uInt f; /* i repeats in table every f entries */
4209 register uInt i; /* counter, current code */
4210 register uInt j; /* counter */
4217 uInt v[N_MAX]; /* values in order of bit length */
4219 uInt x[BMAX+1]; /* bit offsets, then code stack */
4222 uInt z; /* number of entries in current table */
4249 if ((uInt)l < j)
4255 if ((uInt)l > i)
4310 z = z > (uInt)l ? l : z; /* table size upper limit */
4414 uInt nl; /* number of literal/length codes */
4415 uInt nd; /* number of distance codes */
4474 local uInt fixed_bl;
4475 local uInt fixed_bd;
4482 uInt n; /* number of items */
4483 uInt s; /* size of item */
4595 uInt,
4596 uInt,
4627 uInt len;
4631 uInt need; /* bits needed */
4633 uInt lit; /* if LIT, literal */
4635 uInt get; /* bits to get for extra */
4636 uInt dist; /* distance back to copy from */
4650 uInt bl, bd;
4676 uInt j; /* temporary storage */
4678 uInt e; /* extra bits or operation */
4680 uInt k; /* bits in bit buffer */
4682 uInt n; /* bytes available there */
4684 uInt m; /* bytes to end of window or read pointer */
4714 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4716 e = (uInt)(t->exop);
4752 c->len += (uInt)b & inflate_mask[j];
4761 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
4763 e = (uInt)(t->exop);
4784 c->sub.copy.dist += (uInt)b & inflate_mask[j];
4790 f = (uInt)(q - s->window) < c->sub.copy.dist ?
4795 if ((uInt)(q - s->window) < c->sub.copy.dist)
4796 f = s->end - (c->sub.copy.dist - (uInt)(q - s->window));
4857 uInt inflate_mask[17] = {
4870 uInt n;
4879 n = (uInt)((q <= s->write ? s->write : s->end) - q);
4907 n = (uInt)(s->write - q);
4969 uInt bl, bd;
4976 uInt e; /* extra bits or operation */
4978 uInt k; /* bits in bit buffer */
4980 uInt n; /* bytes available there */
4982 uInt m; /* bytes to end of window or read pointer */
4983 uInt ml; /* mask for literal/length tree */
4984 uInt md; /* mask for distance tree */
4985 uInt c; /* bytes to copy */
4986 uInt d; /* distance back to copy from */
5000 if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
5016 c = t->base + ((uInt)b & inflate_mask[e]);
5022 e = (t = td + ((uInt)b & md))->exop;
5030 d = t->base + ((uInt)b & inflate_mask[e]);
5036 if ((uInt)(q - s->window) >= d) /* offset before dest */
5044 e = d - (uInt)(q - s->window); /* bytes from offset to end */
5061 e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;
5074 if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0)
5163 uInt len;
5174 uInt len;
5176 uInt j;
5186 uInt len;
5303 extern voidp calloc OF((uInt items, uInt size));
5351 uInt len;