ulg
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
s->window_size = (ulg)2L*s->w_size;
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
ulg curr = s->strstart + (ulg)(s->lookahead);
ulg init;
else if (s->high_water < (ulg)curr + WIN_INIT) {
init = (ulg)curr + WIN_INIT - s->high_water;
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
(ulg)((long)s->strstart - s->block_start), \
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 mod 2^32 */
ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
ulg high_water;
ulg stored_len, int last);
ulg stored_len, int last);
ulg pending_buf_size; /* size of pending_buf */
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;
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, int last) /* one if this is the last block for a file */
s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
ulg stored_len, int last)
ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
s->window_size = (ulg)2L*s->w_size;
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need 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);
_tr_stored_block(deflate_state *s, charf *buf, ulg stored_len, int eof)
s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
ulg
_tr_flush_block(deflate_state *s, charf *buf, ulg stored_len, int eof)
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 */
ulg bits_sent; /* bit length of the compressed data */
ulg bsize = (ulg)items*size;
ulg _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,
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
s->window_size = (ulg)2L*s->w_size;
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
ulg curr = s->strstart + (ulg)(s->lookahead);
ulg init;
else if (s->high_water < (ulg)curr + WIN_INIT) {
init = (ulg)curr + WIN_INIT - s->high_water;
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
(ulg)((long)s->strstart - s->block_start), \
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 mod 2^32 */
ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
ulg high_water;
ulg stored_len, int last);
ulg stored_len, int last);
ulg pending_buf_size; /* size of pending_buf */
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;
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, int last) /* one if this is the last block for a file */
s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
ulg stored_len, int last)
ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
s->window_size = (ulg)2L*s->w_size;
Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
ulg curr = s->strstart + (ulg)(s->lookahead);
ulg init;
else if (s->high_water < (ulg)curr + WIN_INIT) {
init = (ulg)curr + WIN_INIT - s->high_water;
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
(ulg)((long)s->strstart - s->block_start), \
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 mod 2^32 */
ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
ulg high_water;
ulg stored_len, int last);
ulg stored_len, int last);
ulg pending_buf_size; /* size of pending_buf */
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;
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, int last) /* one if this is the last block for a file */
s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
ulg stored_len, int last)
ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */