Lines Matching defs:internal_state
97 typedef struct internal_state { struct
98 z_streamp strm; /* pointer back to this zlib stream */
99 int status; /* as the name implies */
100 Bytef *pending_buf; /* output still pending */
101 ulg pending_buf_size; /* size of pending_buf */
102 Bytef *pending_out; /* next pending byte to output to the stream */
103 uInt pending; /* nb of bytes in the pending buffer */
104 int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
105 gz_headerp gzhead; /* gzip header information to write */
106 uInt gzindex; /* where in extra, name, or comment */
107 Byte method; /* can only be DEFLATED */
108 int last_flush; /* value of flush param for previous deflate call */
112 uInt w_size; /* LZ77 window size (32K by default) */
113 uInt w_bits; /* log2(w_size) (8..16) */
114 uInt w_mask; /* w_size - 1 */
116 Bytef *window;
126 ulg window_size;
131 Posf *prev;
137 Posf *head; /* Heads of the hash chains or NIL. */
139 uInt ins_h; /* hash index of string to be inserted */
140 uInt hash_size; /* number of elements in hash table */
141 uInt hash_bits; /* log2(hash_size) */
142 uInt hash_mask; /* hash_size-1 */
144 uInt hash_shift;
151 long block_start;
156 uInt match_length; /* length of best match */
157 IPos prev_match; /* previous match */
158 int match_available; /* set if previous match exists */
159 uInt strstart; /* start of string to insert */
160 uInt match_start; /* start of matching string */
161 uInt lookahead; /* number of valid bytes ahead in window */
163 uInt prev_length;
168 uInt max_chain_length;
174 uInt max_lazy_match;
185 int level; /* compression level (1..9) */
186 int strategy; /* favor or force Huffman coding*/
188 uInt good_match;
191 int nice_match; /* Stop searching when current match exceeds this */
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
199 struct tree_desc_s l_desc; /* desc. for literal tree */
200 struct tree_desc_s d_desc; /* desc. for distance tree */
201 struct tree_desc_s bl_desc; /* desc. for bit length tree */
203 ush bl_count[MAX_BITS+1];
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
207 int heap_len; /* number of elements in the heap */
208 int heap_max; /* element of largest frequency */
213 uch depth[2*L_CODES+1];
217 uchf *l_buf; /* buffer for literals or lengths */
219 uInt lit_bufsize;
239 uInt last_lit; /* running index in l_buf */
241 ushf *d_buf;
247 ulg opt_len; /* bit length of current block with optimal trees */
248 ulg static_len; /* bit length of current block with static trees */
249 uInt matches; /* number of string matches in current block */
250 uInt insert; /* bytes at end of window left to insert */
253 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
254 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
257 ush bi_buf;
261 int bi_valid;
266 ulg high_water;