ulg
ulg c = crc;
bytes_out += (ulg)outcnt;
output_ptr += (ulg)outcnt;
free_mem_ptr = (ulg)output_start + ksize;
free_mem_end_ptr = (ulg)output_start + ksize + 0x200000;
static ulg output_ptr;
static ulg bytes_out;
static ulg free_mem_ptr;
static ulg free_mem_end_ptr;
ulg c = crc; /* temporary variable */
bytes_out += (ulg)outcnt;
output_ptr += (ulg)outcnt;
register ulg b; /* bit buffer */
static ulg crc_32_tab[256];
static ulg crc; /* initialized in makecrc() so it'll reside in bss */
crc = (ulg)0xffffffffUL; /* shift register contents */
ulg orig_crc = 0; /* original crc */
ulg orig_len = 0; /* original uncompressed length */
orig_crc = (ulg) NEXTBYTE();
orig_crc |= (ulg) NEXTBYTE() << 8;
orig_crc |= (ulg) NEXTBYTE() << 16;
orig_crc |= (ulg) NEXTBYTE() << 24;
orig_len = (ulg) NEXTBYTE();
orig_len |= (ulg) NEXTBYTE() << 8;
orig_len |= (ulg) NEXTBYTE() << 16;
orig_len |= (ulg) NEXTBYTE() << 24;
STATIC ulg bb; /* bit buffer */
#define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}}
register ulg b; /* bit buffer */
register ulg b; /* bit buffer */
register ulg b; /* bit buffer */
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)((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)len<<3;
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;
ulg zlib_tr_flush_block(
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 *
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 zlib_tr_flush_block (deflate_state *s, char *buf, ulg stored_len,
void zlib_tr_stored_block (deflate_state *s, char *buf, ulg stored_len,
s->bits_sent += (ulg)length;
ulg pending_buf_size; /* size of pending_buf */