Lines Matching defs:deflate_state
980 typedef struct deflate_state { struct
981 z_streamp strm; /* pointer back to this zlib stream */
982 int status; /* as the name implies */
983 Byte *pending_buf; /* output still pending */
984 ulg pending_buf_size; /* size of pending_buf */
985 Byte *pending_out; /* next pending byte to output to the stream */
986 int pending; /* nb of bytes in the pending buffer */
987 int noheader; /* suppress zlib header and adler32 */
988 Byte data_type; /* UNKNOWN, BINARY or ASCII */
989 Byte method; /* STORED (for zip only) or DEFLATED */
990 int last_flush; /* value of flush param for previous deflate call */
994 uInt w_size; /* LZ77 window size (32K by default) */
995 uInt w_bits; /* log2(w_size) (8..16) */
996 uInt w_mask; /* w_size - 1 */
998 Byte *window;
1008 ulg window_size;
1013 Pos *prev;
1019 Pos *head; /* Heads of the hash chains or NIL. */
1021 uInt ins_h; /* hash index of string to be inserted */
1022 uInt hash_size; /* number of elements in hash table */
1023 uInt hash_bits; /* log2(hash_size) */
1024 uInt hash_mask; /* hash_size-1 */
1026 uInt hash_shift;
1033 long block_start;
1038 uInt match_length; /* length of best match */
1039 IPos prev_match; /* previous match */
1040 int match_available; /* set if previous match exists */
1041 uInt strstart; /* start of string to insert */
1042 uInt match_start; /* start of matching string */
1043 uInt lookahead; /* number of valid bytes ahead in window */
1045 uInt prev_length;
1050 uInt max_chain_length;
1056 uInt max_lazy_match;
1067 int level; /* compression level (1..9) */
1068 int strategy; /* favor or force Huffman coding*/
1070 uInt good_match;
1073 int nice_match; /* Stop searching when current match exceeds this */
1077 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1078 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
1079 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
1081 struct tree_desc_s l_desc; /* desc. for literal tree */
1082 struct tree_desc_s d_desc; /* desc. for distance tree */
1083 struct tree_desc_s bl_desc; /* desc. for bit length tree */
1085 ush bl_count[MAX_BITS+1];
1088 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
1089 int heap_len; /* number of elements in the heap */
1090 int heap_max; /* element of largest frequency */
1095 uch depth[2*L_CODES+1];
1099 uch *l_buf; /* buffer for literals or lengths */
1101 uInt lit_bufsize;
1121 uInt last_lit; /* running index in l_buf */
1123 ush *d_buf;
1148 } deflate_state; argument