ulg
more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
s->bits_sent += (ulg)length;
s->opt_len += (ulg)f * (bits + xbits);
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
ulg stored_len; /* length of input block */
local ulg ct_flush_block(s, buf, stored_len, flush)
ulg stored_len; /* length of input block */
ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
ulg out_length = (ulg)s->last_lit*8L;
ulg in_length = (ulg)s->strstart - s->block_start;
out_length += (ulg)s->dyn_dtree[dcode].Freq *
ulg window_size;
s->bits_sent += (ulg)len<<3;
ulg opt_len; /* bit length of current block with optimal trees */
ulg static_len; /* bit length of current block with static trees */
ulg compressed_len; /* total bit length of compressed file */
ulg bits_sent; /* bit length of the compressed data */
local ulg ct_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
local void ct_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
s->window_size = (ulg)2L*s->w_size;
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
register ulg b; /* bit buffer */
ulg crc_value = 0xffffffffUL;
static ulg crc_32_tab[] = {
static ulg updcrc(s, n)
register ulg c; /* temporary variable */
crc = (ulg)0xffffffffUL;
static ulg bb; /* bit buffer */
#define NEEDBITS(n) do {while(k<(n)){b|=((ulg)get_byte())<<k;k+=8;}} while (0)
register ulg b; /* bit buffer */
register ulg b; /* bit buffer */
register ulg b; /* bit buffer */
s->window_size = (ulg)2L*s->w_size;
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD,
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD,
more = (unsigned)(s->window_size -(ulg)s->lookahead -
(ulg)s->strstart);
(ulg)((long)s->strstart - s->block_start), \
ulg max_block_size = 0xffff;
ulg max_start;
if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
s->bits_sent += (ulg)length;
s->opt_len += (ulg)f * (bits + xbits);
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
ulg stored_len; /* length of input block */
s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L; /* PPP */
ulg stored_len; /* length of input block */
ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
ulg out_length = (ulg)s->last_lit*8L;
ulg in_length = (ulg)((long)s->strstart - s->block_start);
out_length += (ulg)s->dyn_dtree[dcode].Freq *
s->bits_sent += (ulg)len<<3;
ulg pending_buf_size; /* size of pending_buf */
ulg window_size;
ulg opt_len; /* bit length of current block with optimal trees */
ulg static_len; /* bit length of current block with static trees */
ulg compressed_len; /* total bit length of compressed file PPP */
ulg bits_sent; /* bit length of the compressed data */
void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
ulg bsize = (ulg)items*size;
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof (ush)+2L);