ulg 292 lib/zlib/deflate.c s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
ulg 986 lib/zlib/deflate.c s->window_size = (ulg)2L*s->w_size;
ulg 1069 lib/zlib/deflate.c Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
ulg 1186 lib/zlib/deflate.c Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
ulg 1275 lib/zlib/deflate.c more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
ulg 1368 lib/zlib/deflate.c (ulg)((long)s->strstart - s->block_start), \
ulg 1397 lib/zlib/deflate.c ulg max_block_size = 0xffff;
ulg 1398 lib/zlib/deflate.c ulg max_start;
ulg 1424 lib/zlib/deflate.c if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
ulg 98 lib/zlib/deflate.h ulg pending_buf_size; /* size of pending_buf */
ulg 123 lib/zlib/deflate.h ulg window_size;
ulg 244 lib/zlib/deflate.h ulg opt_len; /* bit length of current block with optimal trees */
ulg 245 lib/zlib/deflate.h ulg static_len; /* bit length of current block with static trees */
ulg 250 lib/zlib/deflate.h ulg compressed_len; /* total bit length of compressed file mod 2^32 */
ulg 251 lib/zlib/deflate.h ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
ulg 199 lib/zlib/trees.c s->bits_sent += (ulg)length;
ulg 527 lib/zlib/trees.c s->opt_len += (ulg)f * (bits + xbits);
ulg 528 lib/zlib/trees.c if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
ulg 875 lib/zlib/trees.c s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
ulg 927 lib/zlib/trees.c ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
ulg 1048 lib/zlib/trees.c ulg out_length = (ulg)s->last_lit*8L;
ulg 1049 lib/zlib/trees.c ulg in_length = (ulg)((long)s->strstart - s->block_start);
ulg 1052 lib/zlib/trees.c out_length += (ulg)s->dyn_dtree[dcode].Freq *
ulg 1214 lib/zlib/trees.c s->bits_sent += (ulg)len<<3;
ulg 219 lib/zlib/zutil.c ulg bsize = (ulg)items*size;