ulg
ulg beg = s->pending; /* start of bytes to update crc */
ulg left = (s->gzhead->extra_len & 0xffff) - s->gzindex;
ulg copy = s->pending_buf_size - s->pending;
ulg beg = s->pending; /* start of bytes to update crc */
ulg beg = s->pending; /* start of bytes to update crc */
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
(ulg)((long)s->strstart - s->block_start), \
if (len > (ulg)left + s->strm->avail_in)
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,
s->pending_buf_size = (ulg)s->lit_bufsize * 4;
s->window_size = (ulg)2L*s->w_size;
ulg pending_buf_size; /* size of pending_buf */
ulg pending; /* nb of bytes in the pending buffer */
ulg gzindex; /* where in extra, name, or comment */
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);
s->compressed_len - 7*(ulg)last));
s->bits_sent = (s->bits_sent + 7) & ~(ulg)7;
s->bits_sent += (ulg)length;
s->opt_len += (ulg)f * (unsigned)(bits + xbits);
if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);
s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;
s->opt_len += 3*((ulg)max_blindex + 1) + 5 + 5 + 4;
ulg stored_len, int last) {
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 */
ulg bsize = (ulg)items*size;
ulg beg = s->pending; /* start of bytes to update crc */
ulg left = (s->gzhead->extra_len & 0xffff) - s->gzindex;
ulg copy = s->pending_buf_size - s->pending;
ulg beg = s->pending; /* start of bytes to update crc */
ulg beg = s->pending; /* start of bytes to update crc */
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
(ulg)((long)s->strstart - s->block_start), \
if (len > (ulg)left + s->strm->avail_in)
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,
s->pending_buf_size = (ulg)s->lit_bufsize * 4;
s->window_size = (ulg)2L*s->w_size;
ulg pending_buf_size; /* size of pending_buf */
ulg pending; /* nb of bytes in the pending buffer */
ulg gzindex; /* where in extra, name, or comment */
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);
s->compressed_len - 7*(ulg)last));
s->bits_sent = (s->bits_sent + 7) & ~(ulg)7;
s->bits_sent += (ulg)length;
s->opt_len += (ulg)f * (unsigned)(bits + xbits);
if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);
s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;
s->opt_len += 3*((ulg)max_blindex + 1) + 5 + 5 + 4;
ulg stored_len, int last) {
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 */
ulg bsize = (ulg)items*size;