Lines Matching defs:internal_state
100 typedef struct internal_state { struct
101 z_streamp strm; /* pointer back to this zlib stream */
102 int status; /* as the name implies */
103 Bytef *pending_buf; /* output still pending */
104 ulg pending_buf_size; /* size of pending_buf */
105 Bytef *pending_out; /* next pending byte to output to the stream */
106 ulg pending; /* nb of bytes in the pending buffer */
107 int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
108 gz_headerp gzhead; /* gzip header information to write */
109 ulg gzindex; /* where in extra, name, or comment */
110 Byte method; /* can only be DEFLATED */
111 int last_flush; /* value of flush param for previous deflate call */
115 uInt w_size; /* LZ77 window size (32K by default) */
116 uInt w_bits; /* log2(w_size) (8..16) */
117 uInt w_mask; /* w_size - 1 */
119 Bytef *window;
129 ulg window_size;
134 Posf *prev;
140 Posf *head; /* Heads of the hash chains or NIL. */
142 uInt ins_h; /* hash index of string to be inserted */
143 uInt hash_size; /* number of elements in hash table */
144 uInt hash_bits; /* log2(hash_size) */
145 uInt hash_mask; /* hash_size-1 */
147 uInt hash_shift;
154 long block_start;
159 uInt match_length; /* length of best match */
160 IPos prev_match; /* previous match */
161 int match_available; /* set if previous match exists */
162 uInt strstart; /* start of string to insert */
163 uInt match_start; /* start of matching string */
164 uInt lookahead; /* number of valid bytes ahead in window */
166 uInt prev_length;
171 uInt max_chain_length;
177 uInt max_lazy_match;
188 int level; /* compression level (1..9) */
189 int strategy; /* favor or force Huffman coding*/
191 uInt good_match;
194 int nice_match; /* Stop searching when current match exceeds this */
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
202 struct tree_desc_s l_desc; /* desc. for literal tree */
203 struct tree_desc_s d_desc; /* desc. for distance tree */
204 struct tree_desc_s bl_desc; /* desc. for bit length tree */
206 ush bl_count[MAX_BITS+1];
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
210 int heap_len; /* number of elements in the heap */
211 int heap_max; /* element of largest frequency */
216 uch depth[2*L_CODES+1];
220 uchf *l_buf; /* buffer for literals or lengths */
222 uInt lit_bufsize;
242 uInt last_lit; /* running index in l_buf */
244 ushf *d_buf;
250 ulg opt_len; /* bit length of current block with optimal trees */
251 ulg static_len; /* bit length of current block with static trees */
252 uInt matches; /* number of string matches in current block */
253 uInt insert; /* bytes at end of window left to insert */
256 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
257 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
260 ush bi_buf;
264 int bi_valid;
269 ulg high_water;