nuclear@26: /* deflate.h -- internal compression state nuclear@26: * Copyright (C) 1995-2004 Jean-loup Gailly nuclear@26: * For conditions of distribution and use, see copyright notice in zlib.h nuclear@26: */ nuclear@26: nuclear@26: /* WARNING: this file should *not* be used by applications. It is nuclear@26: part of the implementation of the compression library and is nuclear@26: subject to change. Applications should only use zlib.h. nuclear@26: */ nuclear@26: nuclear@26: /* @(#) $Id$ */ nuclear@26: nuclear@26: #ifndef DEFLATE_H nuclear@26: #define DEFLATE_H nuclear@26: nuclear@26: #include "zutil.h" nuclear@26: nuclear@26: /* define NO_GZIP when compiling if you want to disable gzip header and nuclear@26: trailer creation by deflate(). NO_GZIP would be used to avoid linking in nuclear@26: the crc code when it is not needed. For shared libraries, gzip encoding nuclear@26: should be left enabled. */ nuclear@26: #ifndef NO_GZIP nuclear@26: # define GZIP nuclear@26: #endif nuclear@26: nuclear@26: /* =========================================================================== nuclear@26: * Internal compression state. nuclear@26: */ nuclear@26: nuclear@26: #define LENGTH_CODES 29 nuclear@26: /* number of length codes, not counting the special END_BLOCK code */ nuclear@26: nuclear@26: #define LITERALS 256 nuclear@26: /* number of literal bytes 0..255 */ nuclear@26: nuclear@26: #define L_CODES (LITERALS+1+LENGTH_CODES) nuclear@26: /* number of Literal or Length codes, including the END_BLOCK code */ nuclear@26: nuclear@26: #define D_CODES 30 nuclear@26: /* number of distance codes */ nuclear@26: nuclear@26: #define BL_CODES 19 nuclear@26: /* number of codes used to transfer the bit lengths */ nuclear@26: nuclear@26: #define HEAP_SIZE (2*L_CODES+1) nuclear@26: /* maximum heap size */ nuclear@26: nuclear@26: #define MAX_BITS 15 nuclear@26: /* All codes must not exceed MAX_BITS bits */ nuclear@26: nuclear@26: #define INIT_STATE 42 nuclear@26: #define EXTRA_STATE 69 nuclear@26: #define NAME_STATE 73 nuclear@26: #define COMMENT_STATE 91 nuclear@26: #define HCRC_STATE 103 nuclear@26: #define BUSY_STATE 113 nuclear@26: #define FINISH_STATE 666 nuclear@26: /* Stream status */ nuclear@26: nuclear@26: nuclear@26: /* Data structure describing a single value and its code string. */ nuclear@26: typedef struct ct_data_s { nuclear@26: union { nuclear@26: ush freq; /* frequency count */ nuclear@26: ush code; /* bit string */ nuclear@26: } fc; nuclear@26: union { nuclear@26: ush dad; /* father node in Huffman tree */ nuclear@26: ush len; /* length of bit string */ nuclear@26: } dl; nuclear@26: } FAR ct_data; nuclear@26: nuclear@26: #define Freq fc.freq nuclear@26: #define Code fc.code nuclear@26: #define Dad dl.dad nuclear@26: #define Len dl.len nuclear@26: nuclear@26: typedef struct static_tree_desc_s static_tree_desc; nuclear@26: nuclear@26: typedef struct tree_desc_s { nuclear@26: ct_data *dyn_tree; /* the dynamic tree */ nuclear@26: int max_code; /* largest code with non zero frequency */ nuclear@26: static_tree_desc *stat_desc; /* the corresponding static tree */ nuclear@26: } FAR tree_desc; nuclear@26: nuclear@26: typedef ush Pos; nuclear@26: typedef Pos FAR Posf; nuclear@26: typedef unsigned IPos; nuclear@26: nuclear@26: /* A Pos is an index in the character window. We use short instead of int to nuclear@26: * save space in the various tables. IPos is used only for parameter passing. nuclear@26: */ nuclear@26: nuclear@26: typedef struct internal_state { nuclear@26: z_streamp strm; /* pointer back to this zlib stream */ nuclear@26: int status; /* as the name implies */ nuclear@26: Bytef *pending_buf; /* output still pending */ nuclear@26: ulg pending_buf_size; /* size of pending_buf */ nuclear@26: Bytef *pending_out; /* next pending byte to output to the stream */ nuclear@26: uInt pending; /* nb of bytes in the pending buffer */ nuclear@26: int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ nuclear@26: gz_headerp gzhead; /* gzip header information to write */ nuclear@26: uInt gzindex; /* where in extra, name, or comment */ nuclear@26: Byte method; /* STORED (for zip only) or DEFLATED */ nuclear@26: int last_flush; /* value of flush param for previous deflate call */ nuclear@26: nuclear@26: /* used by deflate.c: */ nuclear@26: nuclear@26: uInt w_size; /* LZ77 window size (32K by default) */ nuclear@26: uInt w_bits; /* log2(w_size) (8..16) */ nuclear@26: uInt w_mask; /* w_size - 1 */ nuclear@26: nuclear@26: Bytef *window; nuclear@26: /* Sliding window. Input bytes are read into the second half of the window, nuclear@26: * and move to the first half later to keep a dictionary of at least wSize nuclear@26: * bytes. With this organization, matches are limited to a distance of nuclear@26: * wSize-MAX_MATCH bytes, but this ensures that IO is always nuclear@26: * performed with a length multiple of the block size. Also, it limits nuclear@26: * the window size to 64K, which is quite useful on MSDOS. nuclear@26: * To do: use the user input buffer as sliding window. nuclear@26: */ nuclear@26: nuclear@26: ulg window_size; nuclear@26: /* Actual size of window: 2*wSize, except when the user input buffer nuclear@26: * is directly used as sliding window. nuclear@26: */ nuclear@26: nuclear@26: Posf *prev; nuclear@26: /* Link to older string with same hash index. To limit the size of this nuclear@26: * array to 64K, this link is maintained only for the last 32K strings. nuclear@26: * An index in this array is thus a window index modulo 32K. nuclear@26: */ nuclear@26: nuclear@26: Posf *head; /* Heads of the hash chains or NIL. */ nuclear@26: nuclear@26: uInt ins_h; /* hash index of string to be inserted */ nuclear@26: uInt hash_size; /* number of elements in hash table */ nuclear@26: uInt hash_bits; /* log2(hash_size) */ nuclear@26: uInt hash_mask; /* hash_size-1 */ nuclear@26: nuclear@26: uInt hash_shift; nuclear@26: /* Number of bits by which ins_h must be shifted at each input nuclear@26: * step. It must be such that after MIN_MATCH steps, the oldest nuclear@26: * byte no longer takes part in the hash key, that is: nuclear@26: * hash_shift * MIN_MATCH >= hash_bits nuclear@26: */ nuclear@26: nuclear@26: long block_start; nuclear@26: /* Window position at the beginning of the current output block. Gets nuclear@26: * negative when the window is moved backwards. nuclear@26: */ nuclear@26: nuclear@26: uInt match_length; /* length of best match */ nuclear@26: IPos prev_match; /* previous match */ nuclear@26: int match_available; /* set if previous match exists */ nuclear@26: uInt strstart; /* start of string to insert */ nuclear@26: uInt match_start; /* start of matching string */ nuclear@26: uInt lookahead; /* number of valid bytes ahead in window */ nuclear@26: nuclear@26: uInt prev_length; nuclear@26: /* Length of the best match at previous step. Matches not greater than this nuclear@26: * are discarded. This is used in the lazy match evaluation. nuclear@26: */ nuclear@26: nuclear@26: uInt max_chain_length; nuclear@26: /* To speed up deflation, hash chains are never searched beyond this nuclear@26: * length. A higher limit improves compression ratio but degrades the nuclear@26: * speed. nuclear@26: */ nuclear@26: nuclear@26: uInt max_lazy_match; nuclear@26: /* Attempt to find a better match only when the current match is strictly nuclear@26: * smaller than this value. This mechanism is used only for compression nuclear@26: * levels >= 4. nuclear@26: */ nuclear@26: # define max_insert_length max_lazy_match nuclear@26: /* Insert new strings in the hash table only if the match length is not nuclear@26: * greater than this length. This saves time but degrades compression. nuclear@26: * max_insert_length is used only for compression levels <= 3. nuclear@26: */ nuclear@26: nuclear@26: int level; /* compression level (1..9) */ nuclear@26: int strategy; /* favor or force Huffman coding*/ nuclear@26: nuclear@26: uInt good_match; nuclear@26: /* Use a faster search when the previous match is longer than this */ nuclear@26: nuclear@26: int nice_match; /* Stop searching when current match exceeds this */ nuclear@26: nuclear@26: /* used by trees.c: */ nuclear@26: /* Didn't use ct_data typedef below to supress compiler warning */ nuclear@26: struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ nuclear@26: struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ nuclear@26: struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ nuclear@26: nuclear@26: struct tree_desc_s l_desc; /* desc. for literal tree */ nuclear@26: struct tree_desc_s d_desc; /* desc. for distance tree */ nuclear@26: struct tree_desc_s bl_desc; /* desc. for bit length tree */ nuclear@26: nuclear@26: ush bl_count[MAX_BITS+1]; nuclear@26: /* number of codes at each bit length for an optimal tree */ nuclear@26: nuclear@26: int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ nuclear@26: int heap_len; /* number of elements in the heap */ nuclear@26: int heap_max; /* element of largest frequency */ nuclear@26: /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. nuclear@26: * The same heap array is used to build all trees. nuclear@26: */ nuclear@26: nuclear@26: uch depth[2*L_CODES+1]; nuclear@26: /* Depth of each subtree used as tie breaker for trees of equal frequency nuclear@26: */ nuclear@26: nuclear@26: uchf *l_buf; /* buffer for literals or lengths */ nuclear@26: nuclear@26: uInt lit_bufsize; nuclear@26: /* Size of match buffer for literals/lengths. There are 4 reasons for nuclear@26: * limiting lit_bufsize to 64K: nuclear@26: * - frequencies can be kept in 16 bit counters nuclear@26: * - if compression is not successful for the first block, all input nuclear@26: * data is still in the window so we can still emit a stored block even nuclear@26: * when input comes from standard input. (This can also be done for nuclear@26: * all blocks if lit_bufsize is not greater than 32K.) nuclear@26: * - if compression is not successful for a file smaller than 64K, we can nuclear@26: * even emit a stored file instead of a stored block (saving 5 bytes). nuclear@26: * This is applicable only for zip (not gzip or zlib). nuclear@26: * - creating new Huffman trees less frequently may not provide fast nuclear@26: * adaptation to changes in the input data statistics. (Take for nuclear@26: * example a binary file with poorly compressible code followed by nuclear@26: * a highly compressible string table.) Smaller buffer sizes give nuclear@26: * fast adaptation but have of course the overhead of transmitting nuclear@26: * trees more frequently. nuclear@26: * - I can't count above 4 nuclear@26: */ nuclear@26: nuclear@26: uInt last_lit; /* running index in l_buf */ nuclear@26: nuclear@26: ushf *d_buf; nuclear@26: /* Buffer for distances. To simplify the code, d_buf and l_buf have nuclear@26: * the same number of elements. To use different lengths, an extra flag nuclear@26: * array would be necessary. nuclear@26: */ nuclear@26: nuclear@26: ulg opt_len; /* bit length of current block with optimal trees */ nuclear@26: ulg static_len; /* bit length of current block with static trees */ nuclear@26: uInt matches; /* number of string matches in current block */ nuclear@26: int last_eob_len; /* bit length of EOB code for last block */ nuclear@26: nuclear@26: #ifdef DEBUG nuclear@26: ulg compressed_len; /* total bit length of compressed file mod 2^32 */ nuclear@26: ulg bits_sent; /* bit length of compressed data sent mod 2^32 */ nuclear@26: #endif nuclear@26: nuclear@26: ush bi_buf; nuclear@26: /* Output buffer. bits are inserted starting at the bottom (least nuclear@26: * significant bits). nuclear@26: */ nuclear@26: int bi_valid; nuclear@26: /* Number of valid bits in bi_buf. All bits above the last valid bit nuclear@26: * are always zero. nuclear@26: */ nuclear@26: nuclear@26: } FAR deflate_state; nuclear@26: nuclear@26: /* Output a byte on the stream. nuclear@26: * IN assertion: there is enough room in pending_buf. nuclear@26: */ nuclear@26: #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);} nuclear@26: nuclear@26: nuclear@26: #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) nuclear@26: /* Minimum amount of lookahead, except at the end of the input file. nuclear@26: * See deflate.c for comments about the MIN_MATCH+1. nuclear@26: */ nuclear@26: nuclear@26: #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) nuclear@26: /* In order to simplify the code, particularly on 16 bit machines, match nuclear@26: * distances are limited to MAX_DIST instead of WSIZE. nuclear@26: */ nuclear@26: nuclear@26: /* in trees.c */ nuclear@26: void _tr_init OF((deflate_state *s)); nuclear@26: int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc)); nuclear@26: void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len, nuclear@26: int eof)); nuclear@26: void _tr_align OF((deflate_state *s)); nuclear@26: void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len, nuclear@26: int eof)); nuclear@26: nuclear@26: #define d_code(dist) \ nuclear@26: ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) nuclear@26: /* Mapping from a distance to a distance code. dist is the distance - 1 and nuclear@26: * must not have side effects. _dist_code[256] and _dist_code[257] are never nuclear@26: * used. nuclear@26: */ nuclear@26: nuclear@26: #ifndef DEBUG nuclear@26: /* Inline versions of _tr_tally for speed: */ nuclear@26: nuclear@26: #if defined(GEN_TREES_H) || !defined(STDC) nuclear@26: extern uch _length_code[]; nuclear@26: extern uch _dist_code[]; nuclear@26: #else nuclear@26: extern const uch _length_code[]; nuclear@26: extern const uch _dist_code[]; nuclear@26: #endif nuclear@26: nuclear@26: # define _tr_tally_lit(s, c, flush) \ nuclear@26: { uch cc = (c); \ nuclear@26: s->d_buf[s->last_lit] = 0; \ nuclear@26: s->l_buf[s->last_lit++] = cc; \ nuclear@26: s->dyn_ltree[cc].Freq++; \ nuclear@26: flush = (s->last_lit == s->lit_bufsize-1); \ nuclear@26: } nuclear@26: # define _tr_tally_dist(s, distance, length, flush) \ nuclear@26: { uch len = (length); \ nuclear@26: ush dist = (distance); \ nuclear@26: s->d_buf[s->last_lit] = dist; \ nuclear@26: s->l_buf[s->last_lit++] = len; \ nuclear@26: dist--; \ nuclear@26: s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ nuclear@26: s->dyn_dtree[d_code(dist)].Freq++; \ nuclear@26: flush = (s->last_lit == s->lit_bufsize-1); \ nuclear@26: } nuclear@26: #else nuclear@26: # define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c) nuclear@26: # define _tr_tally_dist(s, distance, length, flush) \ nuclear@26: flush = _tr_tally(s, distance, length) nuclear@26: #endif nuclear@26: nuclear@26: #endif /* DEFLATE_H */