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