Lines Matching defs:internal_state
94 typedef struct internal_state { struct
95 z_streamp strm; /* pointer back to this zlib stream */
96 int status; /* as the name implies */
97 Bytef *pending_buf; /* output still pending */
98 ulg pending_buf_size; /* size of pending_buf */
99 Bytef *pending_out; /* next pending byte to output to the stream */
100 uInt pending; /* nb of bytes in the pending buffer */
101 int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
102 gz_headerp gzhead; /* gzip header information to write */
103 uInt gzindex; /* where in extra, name, or comment */
104 Byte method; /* STORED (for zip only) or DEFLATED */
105 int last_flush; /* value of flush param for previous deflate call */
109 uInt w_size; /* LZ77 window size (32K by default) */
110 uInt w_bits; /* log2(w_size) (8..16) */
111 uInt w_mask; /* w_size - 1 */
113 Bytef *window;
123 ulg window_size;
128 Posf *prev;
134 Posf *head; /* Heads of the hash chains or NIL. */
136 uInt ins_h; /* hash index of string to be inserted */
137 uInt hash_size; /* number of elements in hash table */
138 uInt hash_bits; /* log2(hash_size) */
139 uInt hash_mask; /* hash_size-1 */
141 uInt hash_shift;
148 long block_start;
153 uInt match_length; /* length of best match */
154 IPos prev_match; /* previous match */
155 int match_available; /* set if previous match exists */
156 uInt strstart; /* start of string to insert */
157 uInt match_start; /* start of matching string */
158 uInt lookahead; /* number of valid bytes ahead in window */
160 uInt prev_length;
165 uInt max_chain_length;
171 uInt max_lazy_match;
182 int level; /* compression level (1..9) */
183 int strategy; /* favor or force Huffman coding*/
185 uInt good_match;
188 int nice_match; /* Stop searching when current match exceeds this */
192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
196 struct tree_desc_s l_desc; /* desc. for literal tree */
197 struct tree_desc_s d_desc; /* desc. for distance tree */
198 struct tree_desc_s bl_desc; /* desc. for bit length tree */
200 ush bl_count[MAX_BITS+1];
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
204 int heap_len; /* number of elements in the heap */
205 int heap_max; /* element of largest frequency */
210 uch depth[2*L_CODES+1];
214 uchf *l_buf; /* buffer for literals or lengths */
216 uInt lit_bufsize;
236 uInt last_lit; /* running index in l_buf */
238 ushf *d_buf;
244 ulg opt_len; /* bit length of current block with optimal trees */
245 ulg static_len; /* bit length of current block with static trees */
246 uInt matches; /* number of string matches in current block */
247 int last_eob_len; /* bit length of EOB code for last block */
250 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
251 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
254 ush bi_buf;
258 int bi_valid;
263 ulg high_water;