Lines Matching defs:deflate_state
73 typedef struct deflate_state { struct
74 z_streamp strm; /* pointer back to this zlib stream */
75 int status; /* as the name implies */
76 Byte *pending_buf; /* output still pending */
77 ulg pending_buf_size; /* size of pending_buf */
78 Byte *pending_out; /* next pending byte to output to the stream */
79 int pending; /* nb of bytes in the pending buffer */
80 int noheader; /* suppress zlib header and adler32 */
81 Byte data_type; /* UNKNOWN, BINARY or ASCII */
82 Byte method; /* STORED (for zip only) or DEFLATED */
83 int last_flush; /* value of flush param for previous deflate call */
87 uInt w_size; /* LZ77 window size (32K by default) */
88 uInt w_bits; /* log2(w_size) (8..16) */
89 uInt w_mask; /* w_size - 1 */
91 Byte *window;
101 ulg window_size;
106 Pos *prev;
112 Pos *head; /* Heads of the hash chains or NIL. */
114 uInt ins_h; /* hash index of string to be inserted */
115 uInt hash_size; /* number of elements in hash table */
116 uInt hash_bits; /* log2(hash_size) */
117 uInt hash_mask; /* hash_size-1 */
119 uInt hash_shift;
126 long block_start;
131 uInt match_length; /* length of best match */
132 IPos prev_match; /* previous match */
133 int match_available; /* set if previous match exists */
134 uInt strstart; /* start of string to insert */
135 uInt match_start; /* start of matching string */
136 uInt lookahead; /* number of valid bytes ahead in window */
138 uInt prev_length;
143 uInt max_chain_length;
149 uInt max_lazy_match;
160 int level; /* compression level (1..9) */
161 int strategy; /* favor or force Huffman coding*/
163 uInt good_match;
166 int nice_match; /* Stop searching when current match exceeds this */
170 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
171 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
172 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
174 struct tree_desc_s l_desc; /* desc. for literal tree */
175 struct tree_desc_s d_desc; /* desc. for distance tree */
176 struct tree_desc_s bl_desc; /* desc. for bit length tree */
178 ush bl_count[MAX_BITS+1];
181 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
182 int heap_len; /* number of elements in the heap */
183 int heap_max; /* element of largest frequency */
188 uch depth[2*L_CODES+1];
192 uch *l_buf; /* buffer for literals or lengths */
194 uInt lit_bufsize;
214 uInt last_lit; /* running index in l_buf */
216 ush *d_buf;
241 } deflate_state; argument