Lines Matching refs:ulg
100 typedef unsigned long ulg;
372 ulg pending_buf_size; /* size of pending_buf */
396 ulg window_size;
517 ulg opt_len; /* bit length of current block with optimal trees */
518 ulg static_len; /* bit length of current block with static trees */
523 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
524 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
557 void _tr_flush_block(deflate_state *s, charf *buf, ulg stored_len,
560 void _tr_stored_block(deflate_state *s, charf *buf, ulg stored_len,
877 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
1314 s->window_size = (ulg)2L*s->w_size;
1394 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1505 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1592 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1681 (ulg)((long)s->strstart - s->block_start), \
1708 ulg max_block_size = 0xffff;
1709 ulg max_start;
1735 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
2299 s->bits_sent += (ulg)length;
2621 s->opt_len += (ulg)f * (bits + xbits);
2622 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
2956 ulg stored_len, /* length of input block */
2961 s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
3019 ulg stored_len, /* length of input block */
3022 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
3142 ulgulg)s->last_lit*8L;
3143 ulg in_length = (ulg)((long)s->strstart - s->block_start);
3146 out_length += (ulg)s->dyn_dtree[dcode].Freq *
3299 s->bits_sent += (ulg)len<<3;
5729 ulg bsize = (ulg)items*size;