95 typedef unsigned long  ulg;  typedef
358     ulg   pending_buf_size; /* size of pending_buf */
382     ulg window_size;
503     ulg opt_len;        /* bit length of current block with optimal trees */
504     ulg static_len;     /* bit length of current block with static trees */
505     ulg compressed_len; /* total bit length of compressed file */
510     ulg bits_sent;      /* bit length of the compressed data */
543 ulg  _tr_flush_block  OF((deflate_state *s, charf *buf, ulg stored_len,
546 void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
808     s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);  in deflateInit2_()
1230     s->window_size = (ulg)2L*s->w_size;  in lm_init()
1312     Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");  in longest_match()
1451         more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);  in fill_window()
1540 		(ulg)((long)s->strstart - s->block_start), \
1568     ulg max_block_size = 0xffff;  in deflate_stored()
1569     ulg max_start;  in deflate_stored()
1595         if (s->strstart == 0 || (ulg)s->strstart >= max_start) {  in deflate_stored()
2020     s->bits_sent += (ulg)length;  in send_bits()
2281         s->opt_len += (ulg)f * (bits + xbits);  in gen_bitlen()
2282         if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);  in gen_bitlen()
2637 _tr_stored_block(deflate_state *s, charf *buf, ulg stored_len, int eof)  in _tr_stored_block()
2640     s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;  in _tr_stored_block()
2699 ulg
2700 _tr_flush_block(deflate_state *s, charf *buf, ulg stored_len, int eof)
2702     ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
2835         ulg out_length = (ulg)s->last_lit*8L;
2836         ulg in_length = (ulg)((long)s->strstart - s->block_start);
2839             out_length += (ulg)s->dyn_dtree[dcode].Freq *
3003     s->bits_sent += (ulg)len<<3;
5244     ulg bsize = (ulg)items*size;