Lines Matching defs:deflate_state
354 typedef struct deflate_state { struct
355 z_streamp strm; /* pointer back to this zlib stream */
356 int status; /* as the name implies */
357 Bytef *pending_buf; /* output still pending */
358 ulg pending_buf_size; /* size of pending_buf */
359 Bytef *pending_out; /* next pending byte to output to the stream */
360 int pending; /* nb of bytes in the pending buffer */
361 int noheader; /* suppress zlib header and adler32 */
362 Byte data_type; /* UNKNOWN, BINARY or ASCII */
363 Byte method; /* STORED (for zip only) or DEFLATED */
364 int last_flush; /* value of flush param for previous deflate call */
368 uInt w_size; /* LZ77 window size (32K by default) */
369 uInt w_bits; /* log2(w_size) (8..16) */
370 uInt w_mask; /* w_size - 1 */
372 Bytef *window;
382 ulg window_size;
387 Posf *prev;
393 Posf *head; /* Heads of the hash chains or NIL. */
395 uInt ins_h; /* hash index of string to be inserted */
396 uInt hash_size; /* number of elements in hash table */
397 uInt hash_bits; /* log2(hash_size) */
398 uInt hash_mask; /* hash_size-1 */
400 uInt hash_shift;
407 long block_start;
412 uInt match_length; /* length of best match */
413 IPos prev_match; /* previous match */
414 int match_available; /* set if previous match exists */
415 uInt strstart; /* start of string to insert */
416 uInt match_start; /* start of matching string */
417 uInt lookahead; /* number of valid bytes ahead in window */
419 uInt prev_length;
424 uInt max_chain_length;
430 uInt max_lazy_match;
441 int level; /* compression level (1..9) */
442 int strategy; /* favor or force Huffman coding*/
444 uInt good_match;
447 int nice_match; /* Stop searching when current match exceeds this */
451 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
452 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
453 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
455 struct tree_desc_s l_desc; /* desc. for literal tree */
456 struct tree_desc_s d_desc; /* desc. for distance tree */
457 struct tree_desc_s bl_desc; /* desc. for bit length tree */
459 ush bl_count[MAX_BITS+1];
462 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
463 int heap_len; /* number of elements in the heap */
464 int heap_max; /* element of largest frequency */
469 uch depth[2*L_CODES+1];
473 uchf *l_buf; /* buffer for literals or lengths */
475 uInt lit_bufsize;
495 uInt last_lit; /* running index in l_buf */
497 ushf *d_buf;
522 } FAR deflate_state; argument