Lines Matching refs:uInt
246 extern void zmemcpy(Bytef* dest, const Bytef* source, uInt len);
247 extern int zmemcmp(const Bytef* s1, const Bytef* s2, uInt len);
248 extern void zmemzero(Bytef* dest, uInt len);
273 uInt len);
382 uInt w_size; /* LZ77 window size (32K by default) */
383 uInt w_bits; /* log2(w_size) (8..16) */
384 uInt w_mask; /* w_size - 1 */
409 uInt ins_h; /* hash index of string to be inserted */
410 uInt hash_size; /* number of elements in hash table */
411 uInt hash_bits; /* log2(hash_size) */
412 uInt hash_mask; /* hash_size-1 */
414 uInt hash_shift;
426 uInt match_length; /* length of best match */
429 uInt strstart; /* start of string to insert */
430 uInt match_start; /* start of matching string */
431 uInt lookahead; /* number of valid bytes ahead in window */
433 uInt prev_length;
438 uInt max_chain_length;
444 uInt max_lazy_match;
458 uInt good_match;
489 uInt lit_bufsize;
509 uInt last_lit; /* running index in l_buf */
519 uInt
690 local void putShortMSB(deflate_state *s, uInt b);
695 uInt longest_match(deflate_state *s, IPos cur_match);
697 local uInt longest_match(deflate_state *s, IPos cur_match);
900 uInt dictLength)
903 uInt length = dictLength;
904 uInt n;
1012 local void putShortMSB (deflate_state *s, uInt b)
1070 uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
1071 uInt level_flags = (s->level-1) >> 1;
1083 putShortMSB(s, (uInt)(strm->adler >> 16));
1084 putShortMSB(s, (uInt)(strm->adler & 0xffff));
1170 putShortMSB(s, (uInt)(strm->adler >> 16));
1171 putShortMSB(s, (uInt)(strm->adler & 0xffff));
1253 zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
1350 local uInt longest_match(deflate_state *s,
1365 uInt wmask = s->w_mask;
1392 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1483 if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
1491 local uInt longest_match(s, cur_match)
1589 uInt wsize = s->w_size;
1737 s->lookahead = (uInt)(s->strstart - max_start);
1738 s->strstart = (uInt)max_start;
1744 if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
1910 uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
3334 uInt w); /* window size */
3353 uInt n); /* dictionary length */
3395 uInt method; /* if FLAGS, method byte */
3400 uInt marker; /* if BAD, inflateSync's marker bytes count */
3405 uInt wbits; /* log2(window size) (8..15, defaults to 15) */
3475 z->state->wbits = (uInt)w;
3479 inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w))
3507 uInt b;
3649 uInt dictLength)
3651 uInt length = dictLength;
3659 if (length >= ((uInt)1<<z->state->wbits))
3690 uInt n; /* number of bytes to look at */
3692 uInt m; /* number of marker bytes found in a row */
3792 uInt pad; /* pad structure to a power of 2 (4 bytes for */
3794 uInt base; /* literal, length base, distance base,
3813 uInt, /* number of literal/length codes */
3814 uInt, /* number of distance codes */
3847 uInt, uInt,
3898 uInt left; /* if STORED, bytes left to copy */
3900 uInt table; /* table lengths (14 bits) */
3901 uInt index; /* index into blens (or border) */
3903 uInt bb; /* bit length tree depth */
3911 uInt last; /* true if this block is the last block */
3914 uInt bitk; /* bits in bit buffer */
3941 #define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q)
3942 #define LOADOUT {q=s->write;m=(uInt)WAVAIL;}
3943 #define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
3951 extern uInt inflate_mask[17];
3975 local const uInt border[] = { /* Order of the bit length code lengths */
4042 inflate_blocks_statef *inflate_blocks_new(z_streamp z, check_func c, uInt w)
4072 uInt t; /* temporary storage */
4074 uInt k; /* bits in bit buffer */
4076 uInt n; /* bytes available there */
4078 uInt m; /* bytes to end of window or read pointer */
4088 t = (uInt)b & 7;
4104 uInt bl, bd;
4141 s->sub.left = (uInt)b & 0xffff;
4165 s->sub.trees.table = t = (uInt)b & 0x3fff;
4176 if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
4189 s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
4215 uInt i, j, c;
4219 h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
4233 j += (uInt)b & inflate_mask[i];
4255 uInt bl, bd;
4267 if (t == (uInt)Z_DATA_ERROR)
4334 void inflate_set_dictionary(inflate_blocks_statef *s, const Bytef *d, uInt n)
4352 uInt k; /* bits in bit buffer */ /* NOT USED HERE */
4353 uInt t; /* temporary storage */
4355 uInt n; /* bytes available there */
4357 uInt m; /* bytes to end of window or read pointer */
4453 uInt, /* number of codes */
4454 uInt, /* number of "simple" codes */
4460 uInt *, /* hufts used in space */
4464 local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */
4468 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
4471 local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
4475 local const uInt cpdext[30] = { /* Extra bits for distance codes */
4517 uInt n, /* number of codes (assumed <= 288) */
4518 uInt s, /* number of simple-valued codes (0..s-1) */
4524 uInt *hn, /* hufts used in space */
4533 uInt a; /* counter for codes of length k */
4534 uInt c[BMAX+1]; /* bit length count table */
4535 uInt f; /* i repeats in table every f entries */
4538 uInt i; /* counter, current code */
4539 uInt j; /* counter */
4542 uInt mask; /* (1 << w) - 1, to avoid cc -O bug on HP */
4548 uInt x[BMAX+1]; /* bit offsets, then code stack */
4551 uInt z; /* number of entries in current table */
4579 if ((uInt)l < j)
4585 if ((uInt)l > i)
4640 z = z > (uInt)l ? l : z; /* table size upper limit */
4668 r.base = (uInt)(q - u[h-1] - j); /* offset to this table */
4726 uInt hn = 0; /* hufts used in space */
4729 if ((v = (uIntf*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL)
4745 int inflate_trees_dynamic(uInt nl,
4746 uInt nd, /* number of literal/length codes */
4756 uInt hn = 0; /* hufts used in space */
4760 if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
4813 local uInt fixed_bl;
4814 local uInt fixed_bd;
4829 local uInt fixed_bl = 9;
4830 local uInt fixed_bd = 5;
4988 uInt f = 0; /* number of hufts used in fixed_mem */
4993 if ((c = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
4995 if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
5061 uInt,
5062 uInt,
5093 uInt len;
5097 uInt need; /* bits needed */
5099 uInt lit; /* if LIT, literal */
5101 uInt get; /* bits to get for extra */
5102 uInt dist; /* distance back to copy from */
5115 inflate_codes_statef *inflate_codes_new(uInt bl, uInt bd,
5136 uInt j; /* temporary storage */
5138 uInt e; /* extra bits or operation */
5140 uInt k; /* bits in bit buffer */
5142 uInt n; /* bytes available there */
5144 uInt m; /* bytes to end of window or read pointer */
5175 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
5177 e = (uInt)(t->exop);
5213 c->len += (uInt)b & inflate_mask[j];
5223 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
5225 e = (uInt)(t->exop);
5246 c->sub.copy.dist += (uInt)b & inflate_mask[j];
5324 uInt inflate_mask[17] = {
5334 uInt n;
5343 n = (uInt)((q <= s->write ? s->write : s->end) - q);
5371 n = (uInt)(s->write - q);
5431 int inflate_fast(uInt bl, uInt bd,
5438 uInt e; /* extra bits or operation */
5440 uInt k; /* bits in bit buffer */
5442 uInt n; /* bytes available there */
5444 uInt m; /* bytes to end of window or read pointer */
5445 uInt ml; /* mask for literal/length tree */
5446 uInt md; /* mask for distance tree */
5447 uInt c; /* bytes to copy */
5448 uInt d; /* distance back to copy from */
5462 if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
5478 c = t->base + ((uInt)b & inflate_mask[e]);
5484 e = (t = td + ((uInt)b & md))->exop;
5492 d = t->base + ((uInt)b & inflate_mask[e]);
5538 e = (t += ((uInt)b & inflate_mask[e]))->exop;
5553 if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0)
5663 uInt len;
5674 uInt len;
5676 uInt j;
5686 uInt len;
5803 extern voidp calloc(uInt items, uInt size);
5848 uLong ZEXPORT adler32(uLong adler, const Bytef *buf, uInt len)
Indexes created Thu Oct 02 14:10:14 GMT 2025