Lines Matching defs:deflate_state
216 typedef struct deflate_state { struct
217 z_stream *strm; /* pointer back to this zlib stream */
218 int status; /* as the name implies */
219 Bytef *pending_buf; /* output still pending */
220 Bytef *pending_out; /* next pending byte to output to the stream */
221 int pending; /* nb of bytes in the pending buffer */
222 uLong adler; /* adler32 of uncompressed data */
223 int noheader; /* suppress zlib header and adler32 */
224 Byte data_type; /* UNKNOWN, BINARY or ASCII */
225 Byte method; /* STORED (for zip only) or DEFLATED */
226 int minCompr; /* min size decrease for Z_FLUSH_NOSTORE */
230 uInt w_size; /* LZ77 window size (32K by default) */
231 uInt w_bits; /* log2(w_size) (8..16) */
232 uInt w_mask; /* w_size - 1 */
234 Bytef *window;
244 ulg window_size;
249 Posf *prev;
255 Posf *head; /* Heads of the hash chains or NIL. */
257 uInt ins_h; /* hash index of string to be inserted */
258 uInt hash_size; /* number of elements in hash table */
259 uInt hash_bits; /* log2(hash_size) */
260 uInt hash_mask; /* hash_size-1 */
262 uInt hash_shift;
269 long block_start;
274 uInt match_length; /* length of best match */
275 IPos prev_match; /* previous match */
276 int match_available; /* set if previous match exists */
277 uInt strstart; /* start of string to insert */
278 uInt match_start; /* start of matching string */
279 uInt lookahead; /* number of valid bytes ahead in window */
281 uInt prev_length;
286 uInt max_chain_length;
292 uInt max_lazy_match;
303 int level; /* compression level (1..9) */
304 int strategy; /* favor or force Huffman coding*/
306 uInt good_match;
309 int nice_match; /* Stop searching when current match exceeds this */
313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
317 struct tree_desc_s l_desc; /* desc. for literal tree */
318 struct tree_desc_s d_desc; /* desc. for distance tree */
319 struct tree_desc_s bl_desc; /* desc. for bit length tree */
321 ush bl_count[MAX_BITS+1];
324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
325 int heap_len; /* number of elements in the heap */
326 int heap_max; /* element of largest frequency */
331 uch depth[2*L_CODES+1];
335 uchf *l_buf; /* buffer for literals or lengths */
337 uInt lit_bufsize;
357 uInt last_lit; /* running index in l_buf */
359 ushf *d_buf;
365 ulg opt_len; /* bit length of current block with optimal trees */
389 } FAR deflate_state; argument