Lines Matching defs:internal_state
1304 typedef struct internal_state { struct
1305 z_streamp strm; /* pointer back to this zlib stream */
1306 int status; /* as the name implies */
1307 Bytef *pending_buf; /* output still pending */
1308 ulg pending_buf_size; /* size of pending_buf */
1309 Bytef *pending_out; /* next pending byte to output to the stream */
1310 uInt pending; /* nb of bytes in the pending buffer */
1311 int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
1312 gz_headerp gzhead; /* gzip header information to write */
1313 uInt gzindex; /* where in extra, name, or comment */
1314 Byte method; /* STORED (for zip only) or DEFLATED */
1315 int last_flush; /* value of flush param for previous deflate call */
1319 uInt w_size; /* LZ77 window size (32K by default) */
1320 uInt w_bits; /* log2(w_size) (8..16) */
1321 uInt w_mask; /* w_size - 1 */
1323 Bytef *window;
1333 ulg window_size;
1338 Posf *prev;
1344 Posf *head; /* Heads of the hash chains or NIL. */
1346 uInt ins_h; /* hash index of string to be inserted */
1347 uInt hash_size; /* number of elements in hash table */
1348 uInt hash_bits; /* log2(hash_size) */
1349 uInt hash_mask; /* hash_size-1 */
1351 uInt hash_shift;
1358 long block_start;
1363 uInt match_length; /* length of best match */
1364 IPos prev_match; /* previous match */
1365 int match_available; /* set if previous match exists */
1366 uInt strstart; /* start of string to insert */
1367 uInt match_start; /* start of matching string */
1368 uInt lookahead; /* number of valid bytes ahead in window */
1370 uInt prev_length;
1375 uInt max_chain_length;
1381 uInt max_lazy_match;
1392 int level; /* compression level (1..9) */
1393 int strategy; /* favor or force Huffman coding*/
1395 uInt good_match;
1398 int nice_match; /* Stop searching when current match exceeds this */
1402 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1403 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
1404 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
1406 struct tree_desc_s l_desc; /* desc. for literal tree */
1407 struct tree_desc_s d_desc; /* desc. for distance tree */
1408 struct tree_desc_s bl_desc; /* desc. for bit length tree */
1410 ush bl_count[MAX_BITS+1];
1413 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
1414 int heap_len; /* number of elements in the heap */
1415 int heap_max; /* element of largest frequency */
1420 uch depth[2*L_CODES+1];
1424 uchf *l_buf; /* buffer for literals or lengths */
1426 uInt lit_bufsize;
1446 uInt last_lit; /* running index in l_buf */
1448 ushf *d_buf;
1454 ulg opt_len; /* bit length of current block with optimal trees */
1455 ulg static_len; /* bit length of current block with static trees */
1456 uInt matches; /* number of string matches in current block */
1457 int last_eob_len; /* bit length of EOB code for last block */
1460 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
1461 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
1464 ush bi_buf;
1468 int bi_valid;