Lines Matching defs:internal_state
90 typedef struct internal_state { struct
91 z_streamp strm; /* pointer back to this zlib stream */
92 int status; /* as the name implies */
93 Bytef *pending_buf; /* output still pending */
94 ulg pending_buf_size; /* size of pending_buf */
95 Bytef *pending_out; /* next pending byte to output to the stream */
96 int pending; /* nb of bytes in the pending buffer */
97 int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
98 Byte method; /* STORED (for zip only) or DEFLATED */
99 int last_flush; /* value of flush param for previous deflate call */
103 uInt w_size; /* LZ77 window size (32K by default) */
104 uInt w_bits; /* log2(w_size) (8..16) */
105 uInt w_mask; /* w_size - 1 */
107 Bytef *window;
117 ulg window_size;
122 Posf *prev;
128 Posf *head; /* Heads of the hash chains or NIL. */
130 uInt ins_h; /* hash index of string to be inserted */
131 uInt hash_size; /* number of elements in hash table */
132 uInt hash_bits; /* log2(hash_size) */
133 uInt hash_mask; /* hash_size-1 */
135 uInt hash_shift;
142 long block_start;
147 uInt match_length; /* length of best match */
148 IPos prev_match; /* previous match */
149 int match_available; /* set if previous match exists */
150 uInt strstart; /* start of string to insert */
151 uInt match_start; /* start of matching string */
152 uInt lookahead; /* number of valid bytes ahead in window */
154 uInt prev_length;
159 uInt max_chain_length;
165 uInt max_lazy_match;
176 int level; /* compression level (1..9) */
177 int strategy; /* favor or force Huffman coding*/
179 uInt good_match;
182 int nice_match; /* Stop searching when current match exceeds this */
186 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
187 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
188 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
190 struct tree_desc_s l_desc; /* desc. for literal tree */
191 struct tree_desc_s d_desc; /* desc. for distance tree */
192 struct tree_desc_s bl_desc; /* desc. for bit length tree */
194 ush bl_count[MAX_BITS+1];
197 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
198 int heap_len; /* number of elements in the heap */
199 int heap_max; /* element of largest frequency */
204 uch depth[2*L_CODES+1];
208 uchf *l_buf; /* buffer for literals or lengths */
210 uInt lit_bufsize;
230 uInt last_lit; /* running index in l_buf */
232 ushf *d_buf;
238 ulg opt_len; /* bit length of current block with optimal trees */
239 ulg static_len; /* bit length of current block with static trees */
240 uInt matches; /* number of string matches in current block */
241 int last_eob_len; /* bit length of EOB code for last block */
244 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
245 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
248 ush bi_buf;
252 int bi_valid;