11e9a6b47SJoerg Sonnenberger /* deflate.h -- internal compression state 2*e041647aSSascha Wildner * Copyright (C) 1995-2016 Jean-loup Gailly 31e9a6b47SJoerg Sonnenberger * For conditions of distribution and use, see copyright notice in zlib.h 41e9a6b47SJoerg Sonnenberger */ 51e9a6b47SJoerg Sonnenberger 61e9a6b47SJoerg Sonnenberger /* WARNING: this file should *not* be used by applications. It is 71e9a6b47SJoerg Sonnenberger part of the implementation of the compression library and is 81e9a6b47SJoerg Sonnenberger subject to change. Applications should only use zlib.h. 91e9a6b47SJoerg Sonnenberger */ 101e9a6b47SJoerg Sonnenberger 111e9a6b47SJoerg Sonnenberger /* @(#) $Id$ */ 121e9a6b47SJoerg Sonnenberger 131e9a6b47SJoerg Sonnenberger #ifndef DEFLATE_H 141e9a6b47SJoerg Sonnenberger #define DEFLATE_H 151e9a6b47SJoerg Sonnenberger 161e9a6b47SJoerg Sonnenberger #include "zutil.h" 171e9a6b47SJoerg Sonnenberger 181e9a6b47SJoerg Sonnenberger /* define NO_GZIP when compiling if you want to disable gzip header and 191e9a6b47SJoerg Sonnenberger trailer creation by deflate(). NO_GZIP would be used to avoid linking in 201e9a6b47SJoerg Sonnenberger the crc code when it is not needed. For shared libraries, gzip encoding 211e9a6b47SJoerg Sonnenberger should be left enabled. */ 221e9a6b47SJoerg Sonnenberger #ifndef NO_GZIP 231e9a6b47SJoerg Sonnenberger # define GZIP 241e9a6b47SJoerg Sonnenberger #endif 251e9a6b47SJoerg Sonnenberger 261e9a6b47SJoerg Sonnenberger /* =========================================================================== 271e9a6b47SJoerg Sonnenberger * Internal compression state. 281e9a6b47SJoerg Sonnenberger */ 291e9a6b47SJoerg Sonnenberger 301e9a6b47SJoerg Sonnenberger #define LENGTH_CODES 29 311e9a6b47SJoerg Sonnenberger /* number of length codes, not counting the special END_BLOCK code */ 321e9a6b47SJoerg Sonnenberger 331e9a6b47SJoerg Sonnenberger #define LITERALS 256 341e9a6b47SJoerg Sonnenberger /* number of literal bytes 0..255 */ 351e9a6b47SJoerg Sonnenberger 361e9a6b47SJoerg Sonnenberger #define L_CODES (LITERALS+1+LENGTH_CODES) 371e9a6b47SJoerg Sonnenberger /* number of Literal or Length codes, including the END_BLOCK code */ 381e9a6b47SJoerg Sonnenberger 391e9a6b47SJoerg Sonnenberger #define D_CODES 30 401e9a6b47SJoerg Sonnenberger /* number of distance codes */ 411e9a6b47SJoerg Sonnenberger 421e9a6b47SJoerg Sonnenberger #define BL_CODES 19 431e9a6b47SJoerg Sonnenberger /* number of codes used to transfer the bit lengths */ 441e9a6b47SJoerg Sonnenberger 451e9a6b47SJoerg Sonnenberger #define HEAP_SIZE (2*L_CODES+1) 461e9a6b47SJoerg Sonnenberger /* maximum heap size */ 471e9a6b47SJoerg Sonnenberger 481e9a6b47SJoerg Sonnenberger #define MAX_BITS 15 491e9a6b47SJoerg Sonnenberger /* All codes must not exceed MAX_BITS bits */ 501e9a6b47SJoerg Sonnenberger 51712f98b7SJohn Marino #define Buf_size 16 52712f98b7SJohn Marino /* size of bit buffer in bi_buf */ 53712f98b7SJohn Marino 54*e041647aSSascha Wildner #define INIT_STATE 42 /* zlib header -> BUSY_STATE */ 55*e041647aSSascha Wildner #ifdef GZIP 56*e041647aSSascha Wildner # define GZIP_STATE 57 /* gzip header -> BUSY_STATE | EXTRA_STATE */ 57*e041647aSSascha Wildner #endif 58*e041647aSSascha Wildner #define EXTRA_STATE 69 /* gzip extra block -> NAME_STATE */ 59*e041647aSSascha Wildner #define NAME_STATE 73 /* gzip file name -> COMMENT_STATE */ 60*e041647aSSascha Wildner #define COMMENT_STATE 91 /* gzip comment -> HCRC_STATE */ 61*e041647aSSascha Wildner #define HCRC_STATE 103 /* gzip header CRC -> BUSY_STATE */ 62*e041647aSSascha Wildner #define BUSY_STATE 113 /* deflate -> FINISH_STATE */ 63*e041647aSSascha Wildner #define FINISH_STATE 666 /* stream complete */ 641e9a6b47SJoerg Sonnenberger /* Stream status */ 651e9a6b47SJoerg Sonnenberger 661e9a6b47SJoerg Sonnenberger 671e9a6b47SJoerg Sonnenberger /* Data structure describing a single value and its code string. */ 681e9a6b47SJoerg Sonnenberger typedef struct ct_data_s { 691e9a6b47SJoerg Sonnenberger union { 701e9a6b47SJoerg Sonnenberger ush freq; /* frequency count */ 711e9a6b47SJoerg Sonnenberger ush code; /* bit string */ 721e9a6b47SJoerg Sonnenberger } fc; 731e9a6b47SJoerg Sonnenberger union { 741e9a6b47SJoerg Sonnenberger ush dad; /* father node in Huffman tree */ 751e9a6b47SJoerg Sonnenberger ush len; /* length of bit string */ 761e9a6b47SJoerg Sonnenberger } dl; 771e9a6b47SJoerg Sonnenberger } FAR ct_data; 781e9a6b47SJoerg Sonnenberger 791e9a6b47SJoerg Sonnenberger #define Freq fc.freq 801e9a6b47SJoerg Sonnenberger #define Code fc.code 811e9a6b47SJoerg Sonnenberger #define Dad dl.dad 821e9a6b47SJoerg Sonnenberger #define Len dl.len 831e9a6b47SJoerg Sonnenberger 841e9a6b47SJoerg Sonnenberger typedef struct static_tree_desc_s static_tree_desc; 851e9a6b47SJoerg Sonnenberger 861e9a6b47SJoerg Sonnenberger typedef struct tree_desc_s { 871e9a6b47SJoerg Sonnenberger ct_data *dyn_tree; /* the dynamic tree */ 881e9a6b47SJoerg Sonnenberger int max_code; /* largest code with non zero frequency */ 89*e041647aSSascha Wildner const static_tree_desc *stat_desc; /* the corresponding static tree */ 901e9a6b47SJoerg Sonnenberger } FAR tree_desc; 911e9a6b47SJoerg Sonnenberger 921e9a6b47SJoerg Sonnenberger typedef ush Pos; 931e9a6b47SJoerg Sonnenberger typedef Pos FAR Posf; 941e9a6b47SJoerg Sonnenberger typedef unsigned IPos; 951e9a6b47SJoerg Sonnenberger 961e9a6b47SJoerg Sonnenberger /* A Pos is an index in the character window. We use short instead of int to 971e9a6b47SJoerg Sonnenberger * save space in the various tables. IPos is used only for parameter passing. 981e9a6b47SJoerg Sonnenberger */ 991e9a6b47SJoerg Sonnenberger 1001e9a6b47SJoerg Sonnenberger typedef struct internal_state { 1011e9a6b47SJoerg Sonnenberger z_streamp strm; /* pointer back to this zlib stream */ 1021e9a6b47SJoerg Sonnenberger int status; /* as the name implies */ 1031e9a6b47SJoerg Sonnenberger Bytef *pending_buf; /* output still pending */ 1041e9a6b47SJoerg Sonnenberger ulg pending_buf_size; /* size of pending_buf */ 1051e9a6b47SJoerg Sonnenberger Bytef *pending_out; /* next pending byte to output to the stream */ 106*e041647aSSascha Wildner ulg pending; /* nb of bytes in the pending buffer */ 1071e9a6b47SJoerg Sonnenberger int wrap; /* bit 0 true for zlib, bit 1 true for gzip */ 1081e9a6b47SJoerg Sonnenberger gz_headerp gzhead; /* gzip header information to write */ 109*e041647aSSascha Wildner ulg gzindex; /* where in extra, name, or comment */ 11053ddf67cSJohn Marino Byte method; /* can only be DEFLATED */ 1111e9a6b47SJoerg Sonnenberger int last_flush; /* value of flush param for previous deflate call */ 1121e9a6b47SJoerg Sonnenberger 1131e9a6b47SJoerg Sonnenberger /* used by deflate.c: */ 1141e9a6b47SJoerg Sonnenberger 1151e9a6b47SJoerg Sonnenberger uInt w_size; /* LZ77 window size (32K by default) */ 1161e9a6b47SJoerg Sonnenberger uInt w_bits; /* log2(w_size) (8..16) */ 1171e9a6b47SJoerg Sonnenberger uInt w_mask; /* w_size - 1 */ 1181e9a6b47SJoerg Sonnenberger 1191e9a6b47SJoerg Sonnenberger Bytef *window; 1201e9a6b47SJoerg Sonnenberger /* Sliding window. Input bytes are read into the second half of the window, 1211e9a6b47SJoerg Sonnenberger * and move to the first half later to keep a dictionary of at least wSize 1221e9a6b47SJoerg Sonnenberger * bytes. With this organization, matches are limited to a distance of 1231e9a6b47SJoerg Sonnenberger * wSize-MAX_MATCH bytes, but this ensures that IO is always 1241e9a6b47SJoerg Sonnenberger * performed with a length multiple of the block size. Also, it limits 1251e9a6b47SJoerg Sonnenberger * the window size to 64K, which is quite useful on MSDOS. 1261e9a6b47SJoerg Sonnenberger * To do: use the user input buffer as sliding window. 1271e9a6b47SJoerg Sonnenberger */ 1281e9a6b47SJoerg Sonnenberger 1291e9a6b47SJoerg Sonnenberger ulg window_size; 1301e9a6b47SJoerg Sonnenberger /* Actual size of window: 2*wSize, except when the user input buffer 1311e9a6b47SJoerg Sonnenberger * is directly used as sliding window. 1321e9a6b47SJoerg Sonnenberger */ 1331e9a6b47SJoerg Sonnenberger 1341e9a6b47SJoerg Sonnenberger Posf *prev; 1351e9a6b47SJoerg Sonnenberger /* Link to older string with same hash index. To limit the size of this 1361e9a6b47SJoerg Sonnenberger * array to 64K, this link is maintained only for the last 32K strings. 1371e9a6b47SJoerg Sonnenberger * An index in this array is thus a window index modulo 32K. 1381e9a6b47SJoerg Sonnenberger */ 1391e9a6b47SJoerg Sonnenberger 1401e9a6b47SJoerg Sonnenberger Posf *head; /* Heads of the hash chains or NIL. */ 1411e9a6b47SJoerg Sonnenberger 1421e9a6b47SJoerg Sonnenberger uInt ins_h; /* hash index of string to be inserted */ 1431e9a6b47SJoerg Sonnenberger uInt hash_size; /* number of elements in hash table */ 1441e9a6b47SJoerg Sonnenberger uInt hash_bits; /* log2(hash_size) */ 1451e9a6b47SJoerg Sonnenberger uInt hash_mask; /* hash_size-1 */ 1461e9a6b47SJoerg Sonnenberger 1471e9a6b47SJoerg Sonnenberger uInt hash_shift; 1481e9a6b47SJoerg Sonnenberger /* Number of bits by which ins_h must be shifted at each input 1491e9a6b47SJoerg Sonnenberger * step. It must be such that after MIN_MATCH steps, the oldest 1501e9a6b47SJoerg Sonnenberger * byte no longer takes part in the hash key, that is: 1511e9a6b47SJoerg Sonnenberger * hash_shift * MIN_MATCH >= hash_bits 1521e9a6b47SJoerg Sonnenberger */ 1531e9a6b47SJoerg Sonnenberger 1541e9a6b47SJoerg Sonnenberger long block_start; 1551e9a6b47SJoerg Sonnenberger /* Window position at the beginning of the current output block. Gets 1561e9a6b47SJoerg Sonnenberger * negative when the window is moved backwards. 1571e9a6b47SJoerg Sonnenberger */ 1581e9a6b47SJoerg Sonnenberger 1591e9a6b47SJoerg Sonnenberger uInt match_length; /* length of best match */ 1601e9a6b47SJoerg Sonnenberger IPos prev_match; /* previous match */ 1611e9a6b47SJoerg Sonnenberger int match_available; /* set if previous match exists */ 1621e9a6b47SJoerg Sonnenberger uInt strstart; /* start of string to insert */ 1631e9a6b47SJoerg Sonnenberger uInt match_start; /* start of matching string */ 1641e9a6b47SJoerg Sonnenberger uInt lookahead; /* number of valid bytes ahead in window */ 1651e9a6b47SJoerg Sonnenberger 1661e9a6b47SJoerg Sonnenberger uInt prev_length; 1671e9a6b47SJoerg Sonnenberger /* Length of the best match at previous step. Matches not greater than this 1681e9a6b47SJoerg Sonnenberger * are discarded. This is used in the lazy match evaluation. 1691e9a6b47SJoerg Sonnenberger */ 1701e9a6b47SJoerg Sonnenberger 1711e9a6b47SJoerg Sonnenberger uInt max_chain_length; 1721e9a6b47SJoerg Sonnenberger /* To speed up deflation, hash chains are never searched beyond this 1731e9a6b47SJoerg Sonnenberger * length. A higher limit improves compression ratio but degrades the 1741e9a6b47SJoerg Sonnenberger * speed. 1751e9a6b47SJoerg Sonnenberger */ 1761e9a6b47SJoerg Sonnenberger 1771e9a6b47SJoerg Sonnenberger uInt max_lazy_match; 1781e9a6b47SJoerg Sonnenberger /* Attempt to find a better match only when the current match is strictly 1791e9a6b47SJoerg Sonnenberger * smaller than this value. This mechanism is used only for compression 1801e9a6b47SJoerg Sonnenberger * levels >= 4. 1811e9a6b47SJoerg Sonnenberger */ 1821e9a6b47SJoerg Sonnenberger # define max_insert_length max_lazy_match 1831e9a6b47SJoerg Sonnenberger /* Insert new strings in the hash table only if the match length is not 1841e9a6b47SJoerg Sonnenberger * greater than this length. This saves time but degrades compression. 1851e9a6b47SJoerg Sonnenberger * max_insert_length is used only for compression levels <= 3. 1861e9a6b47SJoerg Sonnenberger */ 1871e9a6b47SJoerg Sonnenberger 1881e9a6b47SJoerg Sonnenberger int level; /* compression level (1..9) */ 1891e9a6b47SJoerg Sonnenberger int strategy; /* favor or force Huffman coding*/ 1901e9a6b47SJoerg Sonnenberger 1911e9a6b47SJoerg Sonnenberger uInt good_match; 1921e9a6b47SJoerg Sonnenberger /* Use a faster search when the previous match is longer than this */ 1931e9a6b47SJoerg Sonnenberger 1941e9a6b47SJoerg Sonnenberger int nice_match; /* Stop searching when current match exceeds this */ 1951e9a6b47SJoerg Sonnenberger 1961e9a6b47SJoerg Sonnenberger /* used by trees.c: */ 197712f98b7SJohn Marino /* Didn't use ct_data typedef below to suppress compiler warning */ 1981e9a6b47SJoerg Sonnenberger struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 1991e9a6b47SJoerg Sonnenberger struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 2001e9a6b47SJoerg Sonnenberger struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 2011e9a6b47SJoerg Sonnenberger 2021e9a6b47SJoerg Sonnenberger struct tree_desc_s l_desc; /* desc. for literal tree */ 2031e9a6b47SJoerg Sonnenberger struct tree_desc_s d_desc; /* desc. for distance tree */ 2041e9a6b47SJoerg Sonnenberger struct tree_desc_s bl_desc; /* desc. for bit length tree */ 2051e9a6b47SJoerg Sonnenberger 2061e9a6b47SJoerg Sonnenberger ush bl_count[MAX_BITS+1]; 2071e9a6b47SJoerg Sonnenberger /* number of codes at each bit length for an optimal tree */ 2081e9a6b47SJoerg Sonnenberger 2091e9a6b47SJoerg Sonnenberger int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ 2101e9a6b47SJoerg Sonnenberger int heap_len; /* number of elements in the heap */ 2111e9a6b47SJoerg Sonnenberger int heap_max; /* element of largest frequency */ 2121e9a6b47SJoerg Sonnenberger /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. 2131e9a6b47SJoerg Sonnenberger * The same heap array is used to build all trees. 2141e9a6b47SJoerg Sonnenberger */ 2151e9a6b47SJoerg Sonnenberger 2161e9a6b47SJoerg Sonnenberger uch depth[2*L_CODES+1]; 2171e9a6b47SJoerg Sonnenberger /* Depth of each subtree used as tie breaker for trees of equal frequency 2181e9a6b47SJoerg Sonnenberger */ 2191e9a6b47SJoerg Sonnenberger 2201e9a6b47SJoerg Sonnenberger uchf *l_buf; /* buffer for literals or lengths */ 2211e9a6b47SJoerg Sonnenberger 2221e9a6b47SJoerg Sonnenberger uInt lit_bufsize; 2231e9a6b47SJoerg Sonnenberger /* Size of match buffer for literals/lengths. There are 4 reasons for 2241e9a6b47SJoerg Sonnenberger * limiting lit_bufsize to 64K: 2251e9a6b47SJoerg Sonnenberger * - frequencies can be kept in 16 bit counters 2261e9a6b47SJoerg Sonnenberger * - if compression is not successful for the first block, all input 2271e9a6b47SJoerg Sonnenberger * data is still in the window so we can still emit a stored block even 2281e9a6b47SJoerg Sonnenberger * when input comes from standard input. (This can also be done for 2291e9a6b47SJoerg Sonnenberger * all blocks if lit_bufsize is not greater than 32K.) 2301e9a6b47SJoerg Sonnenberger * - if compression is not successful for a file smaller than 64K, we can 2311e9a6b47SJoerg Sonnenberger * even emit a stored file instead of a stored block (saving 5 bytes). 2321e9a6b47SJoerg Sonnenberger * This is applicable only for zip (not gzip or zlib). 2331e9a6b47SJoerg Sonnenberger * - creating new Huffman trees less frequently may not provide fast 2341e9a6b47SJoerg Sonnenberger * adaptation to changes in the input data statistics. (Take for 2351e9a6b47SJoerg Sonnenberger * example a binary file with poorly compressible code followed by 2361e9a6b47SJoerg Sonnenberger * a highly compressible string table.) Smaller buffer sizes give 2371e9a6b47SJoerg Sonnenberger * fast adaptation but have of course the overhead of transmitting 2381e9a6b47SJoerg Sonnenberger * trees more frequently. 2391e9a6b47SJoerg Sonnenberger * - I can't count above 4 2401e9a6b47SJoerg Sonnenberger */ 2411e9a6b47SJoerg Sonnenberger 2421e9a6b47SJoerg Sonnenberger uInt last_lit; /* running index in l_buf */ 2431e9a6b47SJoerg Sonnenberger 2441e9a6b47SJoerg Sonnenberger ushf *d_buf; 2451e9a6b47SJoerg Sonnenberger /* Buffer for distances. To simplify the code, d_buf and l_buf have 2461e9a6b47SJoerg Sonnenberger * the same number of elements. To use different lengths, an extra flag 2471e9a6b47SJoerg Sonnenberger * array would be necessary. 2481e9a6b47SJoerg Sonnenberger */ 2491e9a6b47SJoerg Sonnenberger 2501e9a6b47SJoerg Sonnenberger ulg opt_len; /* bit length of current block with optimal trees */ 2511e9a6b47SJoerg Sonnenberger ulg static_len; /* bit length of current block with static trees */ 2521e9a6b47SJoerg Sonnenberger uInt matches; /* number of string matches in current block */ 253712f98b7SJohn Marino uInt insert; /* bytes at end of window left to insert */ 2541e9a6b47SJoerg Sonnenberger 255*e041647aSSascha Wildner #ifdef ZLIB_DEBUG 2561e9a6b47SJoerg Sonnenberger ulg compressed_len; /* total bit length of compressed file mod 2^32 */ 2571e9a6b47SJoerg Sonnenberger ulg bits_sent; /* bit length of compressed data sent mod 2^32 */ 2581e9a6b47SJoerg Sonnenberger #endif 2591e9a6b47SJoerg Sonnenberger 2601e9a6b47SJoerg Sonnenberger ush bi_buf; 2611e9a6b47SJoerg Sonnenberger /* Output buffer. bits are inserted starting at the bottom (least 2621e9a6b47SJoerg Sonnenberger * significant bits). 2631e9a6b47SJoerg Sonnenberger */ 2641e9a6b47SJoerg Sonnenberger int bi_valid; 2651e9a6b47SJoerg Sonnenberger /* Number of valid bits in bi_buf. All bits above the last valid bit 2661e9a6b47SJoerg Sonnenberger * are always zero. 2671e9a6b47SJoerg Sonnenberger */ 2681e9a6b47SJoerg Sonnenberger 269fe927c51SPeter Avalos ulg high_water; 270fe927c51SPeter Avalos /* High water mark offset in window for initialized bytes -- bytes above 271fe927c51SPeter Avalos * this are set to zero in order to avoid memory check warnings when 272fe927c51SPeter Avalos * longest match routines access bytes past the input. This is then 273fe927c51SPeter Avalos * updated to the new high water mark. 274fe927c51SPeter Avalos */ 275fe927c51SPeter Avalos 2761e9a6b47SJoerg Sonnenberger } FAR deflate_state; 2771e9a6b47SJoerg Sonnenberger 2781e9a6b47SJoerg Sonnenberger /* Output a byte on the stream. 2791e9a6b47SJoerg Sonnenberger * IN assertion: there is enough room in pending_buf. 2801e9a6b47SJoerg Sonnenberger */ 281*e041647aSSascha Wildner #define put_byte(s, c) {s->pending_buf[s->pending++] = (Bytef)(c);} 2821e9a6b47SJoerg Sonnenberger 2831e9a6b47SJoerg Sonnenberger 2841e9a6b47SJoerg Sonnenberger #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) 2851e9a6b47SJoerg Sonnenberger /* Minimum amount of lookahead, except at the end of the input file. 2861e9a6b47SJoerg Sonnenberger * See deflate.c for comments about the MIN_MATCH+1. 2871e9a6b47SJoerg Sonnenberger */ 2881e9a6b47SJoerg Sonnenberger 2891e9a6b47SJoerg Sonnenberger #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) 2901e9a6b47SJoerg Sonnenberger /* In order to simplify the code, particularly on 16 bit machines, match 2911e9a6b47SJoerg Sonnenberger * distances are limited to MAX_DIST instead of WSIZE. 2921e9a6b47SJoerg Sonnenberger */ 2931e9a6b47SJoerg Sonnenberger 294fe927c51SPeter Avalos #define WIN_INIT MAX_MATCH 295fe927c51SPeter Avalos /* Number of bytes after end of data in window to initialize in order to avoid 296fe927c51SPeter Avalos memory checker errors from longest match routines */ 297fe927c51SPeter Avalos 2981e9a6b47SJoerg Sonnenberger /* in trees.c */ 299fe927c51SPeter Avalos void ZLIB_INTERNAL _tr_init OF((deflate_state *s)); 300fe927c51SPeter Avalos int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc)); 301fe927c51SPeter Avalos void ZLIB_INTERNAL _tr_flush_block OF((deflate_state *s, charf *buf, 302fe927c51SPeter Avalos ulg stored_len, int last)); 303712f98b7SJohn Marino void ZLIB_INTERNAL _tr_flush_bits OF((deflate_state *s)); 304fe927c51SPeter Avalos void ZLIB_INTERNAL _tr_align OF((deflate_state *s)); 305fe927c51SPeter Avalos void ZLIB_INTERNAL _tr_stored_block OF((deflate_state *s, charf *buf, 306fe927c51SPeter Avalos ulg stored_len, int last)); 3071e9a6b47SJoerg Sonnenberger 3081e9a6b47SJoerg Sonnenberger #define d_code(dist) \ 3091e9a6b47SJoerg Sonnenberger ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) 3101e9a6b47SJoerg Sonnenberger /* Mapping from a distance to a distance code. dist is the distance - 1 and 3111e9a6b47SJoerg Sonnenberger * must not have side effects. _dist_code[256] and _dist_code[257] are never 3121e9a6b47SJoerg Sonnenberger * used. 3131e9a6b47SJoerg Sonnenberger */ 3141e9a6b47SJoerg Sonnenberger 315*e041647aSSascha Wildner #ifndef ZLIB_DEBUG 3161e9a6b47SJoerg Sonnenberger /* Inline versions of _tr_tally for speed: */ 3171e9a6b47SJoerg Sonnenberger 3181e9a6b47SJoerg Sonnenberger #if defined(GEN_TREES_H) || !defined(STDC) 319fe927c51SPeter Avalos extern uch ZLIB_INTERNAL _length_code[]; 320fe927c51SPeter Avalos extern uch ZLIB_INTERNAL _dist_code[]; 3211e9a6b47SJoerg Sonnenberger #else 322fe927c51SPeter Avalos extern const uch ZLIB_INTERNAL _length_code[]; 323fe927c51SPeter Avalos extern const uch ZLIB_INTERNAL _dist_code[]; 3241e9a6b47SJoerg Sonnenberger #endif 3251e9a6b47SJoerg Sonnenberger 3261e9a6b47SJoerg Sonnenberger # define _tr_tally_lit(s, c, flush) \ 3271e9a6b47SJoerg Sonnenberger { uch cc = (c); \ 3281e9a6b47SJoerg Sonnenberger s->d_buf[s->last_lit] = 0; \ 3291e9a6b47SJoerg Sonnenberger s->l_buf[s->last_lit++] = cc; \ 3301e9a6b47SJoerg Sonnenberger s->dyn_ltree[cc].Freq++; \ 3311e9a6b47SJoerg Sonnenberger flush = (s->last_lit == s->lit_bufsize-1); \ 3321e9a6b47SJoerg Sonnenberger } 3331e9a6b47SJoerg Sonnenberger # define _tr_tally_dist(s, distance, length, flush) \ 334*e041647aSSascha Wildner { uch len = (uch)(length); \ 335*e041647aSSascha Wildner ush dist = (ush)(distance); \ 3361e9a6b47SJoerg Sonnenberger s->d_buf[s->last_lit] = dist; \ 3371e9a6b47SJoerg Sonnenberger s->l_buf[s->last_lit++] = len; \ 3381e9a6b47SJoerg Sonnenberger dist--; \ 3391e9a6b47SJoerg Sonnenberger s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \ 3401e9a6b47SJoerg Sonnenberger s->dyn_dtree[d_code(dist)].Freq++; \ 3411e9a6b47SJoerg Sonnenberger flush = (s->last_lit == s->lit_bufsize-1); \ 3421e9a6b47SJoerg Sonnenberger } 3431e9a6b47SJoerg Sonnenberger #else 3441e9a6b47SJoerg Sonnenberger # define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c) 3451e9a6b47SJoerg Sonnenberger # define _tr_tally_dist(s, distance, length, flush) \ 3461e9a6b47SJoerg Sonnenberger flush = _tr_tally(s, distance, length) 3471e9a6b47SJoerg Sonnenberger #endif 3481e9a6b47SJoerg Sonnenberger 3491e9a6b47SJoerg Sonnenberger #endif /* DEFLATE_H */ 350