Wei Chang Shen / DMemWin

Dependencies:   emwin_lib

Fork of DMemWin by Embedded Artists

png/deflate.h@2:0e2ef1edf01b, 2016-06-02 (annotated)

Committer:
destinyXfate
Date:
Thu Jun 02 04:52:54 2016 +0000
Revision:
2:0e2ef1edf01b
;

Who changed what in which revision?

UserRevisionLine numberNew contents of line
destinyXfate 2:0e2ef1edf01b 1 /* deflate.h -- internal compression state
destinyXfate 2:0e2ef1edf01b 2 * Copyright (C) 1995-2004 Jean-loup Gailly
destinyXfate 2:0e2ef1edf01b 3 * For conditions of distribution and use, see copyright notice in zlib.h
destinyXfate 2:0e2ef1edf01b 4 */
destinyXfate 2:0e2ef1edf01b 5
destinyXfate 2:0e2ef1edf01b 6 /* WARNING: this file should *not* be used by applications. It is
destinyXfate 2:0e2ef1edf01b 7 part of the implementation of the compression library and is
destinyXfate 2:0e2ef1edf01b 8 subject to change. Applications should only use zlib.h.
destinyXfate 2:0e2ef1edf01b 9 */
destinyXfate 2:0e2ef1edf01b 10
destinyXfate 2:0e2ef1edf01b 11 /* @(#) $Id$ */
destinyXfate 2:0e2ef1edf01b 12
destinyXfate 2:0e2ef1edf01b 13 #ifndef DEFLATE_H
destinyXfate 2:0e2ef1edf01b 14 #define DEFLATE_H
destinyXfate 2:0e2ef1edf01b 15
destinyXfate 2:0e2ef1edf01b 16 #include "zutil.h"
destinyXfate 2:0e2ef1edf01b 17
destinyXfate 2:0e2ef1edf01b 18 /* define NO_GZIP when compiling if you want to disable gzip header and
destinyXfate 2:0e2ef1edf01b 19 trailer creation by deflate(). NO_GZIP would be used to avoid linking in
destinyXfate 2:0e2ef1edf01b 20 the crc code when it is not needed. For shared libraries, gzip encoding
destinyXfate 2:0e2ef1edf01b 21 should be left enabled. */
destinyXfate 2:0e2ef1edf01b 22 #ifndef NO_GZIP
destinyXfate 2:0e2ef1edf01b 23 # define GZIP
destinyXfate 2:0e2ef1edf01b 24 #endif
destinyXfate 2:0e2ef1edf01b 25
destinyXfate 2:0e2ef1edf01b 26 /* ===========================================================================
destinyXfate 2:0e2ef1edf01b 27 * Internal compression state.
destinyXfate 2:0e2ef1edf01b 28 */
destinyXfate 2:0e2ef1edf01b 29
destinyXfate 2:0e2ef1edf01b 30 #define LENGTH_CODES 29
destinyXfate 2:0e2ef1edf01b 31 /* number of length codes, not counting the special END_BLOCK code */
destinyXfate 2:0e2ef1edf01b 32
destinyXfate 2:0e2ef1edf01b 33 #define LITERALS 256
destinyXfate 2:0e2ef1edf01b 34 /* number of literal bytes 0..255 */
destinyXfate 2:0e2ef1edf01b 35
destinyXfate 2:0e2ef1edf01b 36 #define L_CODES (LITERALS+1+LENGTH_CODES)
destinyXfate 2:0e2ef1edf01b 37 /* number of Literal or Length codes, including the END_BLOCK code */
destinyXfate 2:0e2ef1edf01b 38
destinyXfate 2:0e2ef1edf01b 39 #define D_CODES 30
destinyXfate 2:0e2ef1edf01b 40 /* number of distance codes */
destinyXfate 2:0e2ef1edf01b 41
destinyXfate 2:0e2ef1edf01b 42 #define BL_CODES 19
destinyXfate 2:0e2ef1edf01b 43 /* number of codes used to transfer the bit lengths */
destinyXfate 2:0e2ef1edf01b 44
destinyXfate 2:0e2ef1edf01b 45 #define HEAP_SIZE (2*L_CODES+1)
destinyXfate 2:0e2ef1edf01b 46 /* maximum heap size */
destinyXfate 2:0e2ef1edf01b 47
destinyXfate 2:0e2ef1edf01b 48 #define MAX_BITS 15
destinyXfate 2:0e2ef1edf01b 49 /* All codes must not exceed MAX_BITS bits */
destinyXfate 2:0e2ef1edf01b 50
destinyXfate 2:0e2ef1edf01b 51 #define INIT_STATE 42
destinyXfate 2:0e2ef1edf01b 52 #define EXTRA_STATE 69
destinyXfate 2:0e2ef1edf01b 53 #define NAME_STATE 73
destinyXfate 2:0e2ef1edf01b 54 #define COMMENT_STATE 91
destinyXfate 2:0e2ef1edf01b 55 #define HCRC_STATE 103
destinyXfate 2:0e2ef1edf01b 56 #define BUSY_STATE 113
destinyXfate 2:0e2ef1edf01b 57 #define FINISH_STATE 666
destinyXfate 2:0e2ef1edf01b 58 /* Stream status */
destinyXfate 2:0e2ef1edf01b 59
destinyXfate 2:0e2ef1edf01b 60
destinyXfate 2:0e2ef1edf01b 61 /* Data structure describing a single value and its code string. */
destinyXfate 2:0e2ef1edf01b 62 typedef struct ct_data_s {
destinyXfate 2:0e2ef1edf01b 63 union {
destinyXfate 2:0e2ef1edf01b 64 ush freq; /* frequency count */
destinyXfate 2:0e2ef1edf01b 65 ush code; /* bit string */
destinyXfate 2:0e2ef1edf01b 66 } fc;
destinyXfate 2:0e2ef1edf01b 67 union {
destinyXfate 2:0e2ef1edf01b 68 ush dad; /* father node in Huffman tree */
destinyXfate 2:0e2ef1edf01b 69 ush len; /* length of bit string */
destinyXfate 2:0e2ef1edf01b 70 } dl;
destinyXfate 2:0e2ef1edf01b 71 } FAR ct_data;
destinyXfate 2:0e2ef1edf01b 72
destinyXfate 2:0e2ef1edf01b 73 #define Freq fc.freq
destinyXfate 2:0e2ef1edf01b 74 #define Code fc.code
destinyXfate 2:0e2ef1edf01b 75 #define Dad dl.dad
destinyXfate 2:0e2ef1edf01b 76 #define Len dl.len
destinyXfate 2:0e2ef1edf01b 77
destinyXfate 2:0e2ef1edf01b 78 typedef struct static_tree_desc_s static_tree_desc;
destinyXfate 2:0e2ef1edf01b 79
destinyXfate 2:0e2ef1edf01b 80 typedef struct tree_desc_s {
destinyXfate 2:0e2ef1edf01b 81 ct_data *dyn_tree; /* the dynamic tree */
destinyXfate 2:0e2ef1edf01b 82 int max_code; /* largest code with non zero frequency */
destinyXfate 2:0e2ef1edf01b 83 static_tree_desc *stat_desc; /* the corresponding static tree */
destinyXfate 2:0e2ef1edf01b 84 } FAR tree_desc;
destinyXfate 2:0e2ef1edf01b 85
destinyXfate 2:0e2ef1edf01b 86 typedef ush Pos;
destinyXfate 2:0e2ef1edf01b 87 typedef Pos FAR Posf;
destinyXfate 2:0e2ef1edf01b 88 typedef unsigned IPos;
destinyXfate 2:0e2ef1edf01b 89
destinyXfate 2:0e2ef1edf01b 90 /* A Pos is an index in the character window. We use short instead of int to
destinyXfate 2:0e2ef1edf01b 91 * save space in the various tables. IPos is used only for parameter passing.
destinyXfate 2:0e2ef1edf01b 92 */
destinyXfate 2:0e2ef1edf01b 93
destinyXfate 2:0e2ef1edf01b 94 typedef struct internal_state {
destinyXfate 2:0e2ef1edf01b 95 z_streamp strm; /* pointer back to this zlib stream */
destinyXfate 2:0e2ef1edf01b 96 int status; /* as the name implies */
destinyXfate 2:0e2ef1edf01b 97 Bytef *pending_buf; /* output still pending */
destinyXfate 2:0e2ef1edf01b 98 ulg pending_buf_size; /* size of pending_buf */
destinyXfate 2:0e2ef1edf01b 99 Bytef *pending_out; /* next pending byte to output to the stream */
destinyXfate 2:0e2ef1edf01b 100 uInt pending; /* nb of bytes in the pending buffer */
destinyXfate 2:0e2ef1edf01b 101 int wrap; /* bit 0 true for zlib, bit 1 true for gzip */
destinyXfate 2:0e2ef1edf01b 102 gz_headerp gzhead; /* gzip header information to write */
destinyXfate 2:0e2ef1edf01b 103 uInt gzindex; /* where in extra, name, or comment */
destinyXfate 2:0e2ef1edf01b 104 Byte method; /* STORED (for zip only) or DEFLATED */
destinyXfate 2:0e2ef1edf01b 105 int last_flush; /* value of flush param for previous deflate call */
destinyXfate 2:0e2ef1edf01b 106
destinyXfate 2:0e2ef1edf01b 107 /* used by deflate.c: */
destinyXfate 2:0e2ef1edf01b 108
destinyXfate 2:0e2ef1edf01b 109 uInt w_size; /* LZ77 window size (32K by default) */
destinyXfate 2:0e2ef1edf01b 110 uInt w_bits; /* log2(w_size) (8..16) */
destinyXfate 2:0e2ef1edf01b 111 uInt w_mask; /* w_size - 1 */
destinyXfate 2:0e2ef1edf01b 112
destinyXfate 2:0e2ef1edf01b 113 Bytef *window;
destinyXfate 2:0e2ef1edf01b 114 /* Sliding window. Input bytes are read into the second half of the window,
destinyXfate 2:0e2ef1edf01b 115 * and move to the first half later to keep a dictionary of at least wSize
destinyXfate 2:0e2ef1edf01b 116 * bytes. With this organization, matches are limited to a distance of
destinyXfate 2:0e2ef1edf01b 117 * wSize-MAX_MATCH bytes, but this ensures that IO is always
destinyXfate 2:0e2ef1edf01b 118 * performed with a length multiple of the block size. Also, it limits
destinyXfate 2:0e2ef1edf01b 119 * the window size to 64K, which is quite useful on MSDOS.
destinyXfate 2:0e2ef1edf01b 120 * To do: use the user input buffer as sliding window.
destinyXfate 2:0e2ef1edf01b 121 */
destinyXfate 2:0e2ef1edf01b 122
destinyXfate 2:0e2ef1edf01b 123 ulg window_size;
destinyXfate 2:0e2ef1edf01b 124 /* Actual size of window: 2*wSize, except when the user input buffer
destinyXfate 2:0e2ef1edf01b 125 * is directly used as sliding window.
destinyXfate 2:0e2ef1edf01b 126 */
destinyXfate 2:0e2ef1edf01b 127
destinyXfate 2:0e2ef1edf01b 128 Posf *prev;
destinyXfate 2:0e2ef1edf01b 129 /* Link to older string with same hash index. To limit the size of this
destinyXfate 2:0e2ef1edf01b 130 * array to 64K, this link is maintained only for the last 32K strings.
destinyXfate 2:0e2ef1edf01b 131 * An index in this array is thus a window index modulo 32K.
destinyXfate 2:0e2ef1edf01b 132 */
destinyXfate 2:0e2ef1edf01b 133
destinyXfate 2:0e2ef1edf01b 134 Posf *head; /* Heads of the hash chains or NIL. */
destinyXfate 2:0e2ef1edf01b 135
destinyXfate 2:0e2ef1edf01b 136 uInt ins_h; /* hash index of string to be inserted */
destinyXfate 2:0e2ef1edf01b 137 uInt hash_size; /* number of elements in hash table */
destinyXfate 2:0e2ef1edf01b 138 uInt hash_bits; /* log2(hash_size) */
destinyXfate 2:0e2ef1edf01b 139 uInt hash_mask; /* hash_size-1 */
destinyXfate 2:0e2ef1edf01b 140
destinyXfate 2:0e2ef1edf01b 141 uInt hash_shift;
destinyXfate 2:0e2ef1edf01b 142 /* Number of bits by which ins_h must be shifted at each input
destinyXfate 2:0e2ef1edf01b 143 * step. It must be such that after MIN_MATCH steps, the oldest
destinyXfate 2:0e2ef1edf01b 144 * byte no longer takes part in the hash key, that is:
destinyXfate 2:0e2ef1edf01b 145 * hash_shift * MIN_MATCH >= hash_bits
destinyXfate 2:0e2ef1edf01b 146 */
destinyXfate 2:0e2ef1edf01b 147
destinyXfate 2:0e2ef1edf01b 148 long block_start;
destinyXfate 2:0e2ef1edf01b 149 /* Window position at the beginning of the current output block. Gets
destinyXfate 2:0e2ef1edf01b 150 * negative when the window is moved backwards.
destinyXfate 2:0e2ef1edf01b 151 */
destinyXfate 2:0e2ef1edf01b 152
destinyXfate 2:0e2ef1edf01b 153 uInt match_length; /* length of best match */
destinyXfate 2:0e2ef1edf01b 154 IPos prev_match; /* previous match */
destinyXfate 2:0e2ef1edf01b 155 int match_available; /* set if previous match exists */
destinyXfate 2:0e2ef1edf01b 156 uInt strstart; /* start of string to insert */
destinyXfate 2:0e2ef1edf01b 157 uInt match_start; /* start of matching string */
destinyXfate 2:0e2ef1edf01b 158 uInt lookahead; /* number of valid bytes ahead in window */
destinyXfate 2:0e2ef1edf01b 159
destinyXfate 2:0e2ef1edf01b 160 uInt prev_length;
destinyXfate 2:0e2ef1edf01b 161 /* Length of the best match at previous step. Matches not greater than this
destinyXfate 2:0e2ef1edf01b 162 * are discarded. This is used in the lazy match evaluation.
destinyXfate 2:0e2ef1edf01b 163 */
destinyXfate 2:0e2ef1edf01b 164
destinyXfate 2:0e2ef1edf01b 165 uInt max_chain_length;
destinyXfate 2:0e2ef1edf01b 166 /* To speed up deflation, hash chains are never searched beyond this
destinyXfate 2:0e2ef1edf01b 167 * length. A higher limit improves compression ratio but degrades the
destinyXfate 2:0e2ef1edf01b 168 * speed.
destinyXfate 2:0e2ef1edf01b 169 */
destinyXfate 2:0e2ef1edf01b 170
destinyXfate 2:0e2ef1edf01b 171 uInt max_lazy_match;
destinyXfate 2:0e2ef1edf01b 172 /* Attempt to find a better match only when the current match is strictly
destinyXfate 2:0e2ef1edf01b 173 * smaller than this value. This mechanism is used only for compression
destinyXfate 2:0e2ef1edf01b 174 * levels >= 4.
destinyXfate 2:0e2ef1edf01b 175 */
destinyXfate 2:0e2ef1edf01b 176 # define max_insert_length max_lazy_match
destinyXfate 2:0e2ef1edf01b 177 /* Insert new strings in the hash table only if the match length is not
destinyXfate 2:0e2ef1edf01b 178 * greater than this length. This saves time but degrades compression.
destinyXfate 2:0e2ef1edf01b 179 * max_insert_length is used only for compression levels <= 3.
destinyXfate 2:0e2ef1edf01b 180 */
destinyXfate 2:0e2ef1edf01b 181
destinyXfate 2:0e2ef1edf01b 182 int level; /* compression level (1..9) */
destinyXfate 2:0e2ef1edf01b 183 int strategy; /* favor or force Huffman coding*/
destinyXfate 2:0e2ef1edf01b 184
destinyXfate 2:0e2ef1edf01b 185 uInt good_match;
destinyXfate 2:0e2ef1edf01b 186 /* Use a faster search when the previous match is longer than this */
destinyXfate 2:0e2ef1edf01b 187
destinyXfate 2:0e2ef1edf01b 188 int nice_match; /* Stop searching when current match exceeds this */
destinyXfate 2:0e2ef1edf01b 189
destinyXfate 2:0e2ef1edf01b 190 /* used by trees.c: */
destinyXfate 2:0e2ef1edf01b 191 /* Didn't use ct_data typedef below to supress compiler warning */
destinyXfate 2:0e2ef1edf01b 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
destinyXfate 2:0e2ef1edf01b 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
destinyXfate 2:0e2ef1edf01b 194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
destinyXfate 2:0e2ef1edf01b 195
destinyXfate 2:0e2ef1edf01b 196 struct tree_desc_s l_desc; /* desc. for literal tree */
destinyXfate 2:0e2ef1edf01b 197 struct tree_desc_s d_desc; /* desc. for distance tree */
destinyXfate 2:0e2ef1edf01b 198 struct tree_desc_s bl_desc; /* desc. for bit length tree */
destinyXfate 2:0e2ef1edf01b 199
destinyXfate 2:0e2ef1edf01b 200 ush bl_count[MAX_BITS+1];
destinyXfate 2:0e2ef1edf01b 201 /* number of codes at each bit length for an optimal tree */
destinyXfate 2:0e2ef1edf01b 202
destinyXfate 2:0e2ef1edf01b 203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
destinyXfate 2:0e2ef1edf01b 204 int heap_len; /* number of elements in the heap */
destinyXfate 2:0e2ef1edf01b 205 int heap_max; /* element of largest frequency */
destinyXfate 2:0e2ef1edf01b 206 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
destinyXfate 2:0e2ef1edf01b 207 * The same heap array is used to build all trees.
destinyXfate 2:0e2ef1edf01b 208 */
destinyXfate 2:0e2ef1edf01b 209
destinyXfate 2:0e2ef1edf01b 210 uch depth[2*L_CODES+1];
destinyXfate 2:0e2ef1edf01b 211 /* Depth of each subtree used as tie breaker for trees of equal frequency
destinyXfate 2:0e2ef1edf01b 212 */
destinyXfate 2:0e2ef1edf01b 213
destinyXfate 2:0e2ef1edf01b 214 uchf *l_buf; /* buffer for literals or lengths */
destinyXfate 2:0e2ef1edf01b 215
destinyXfate 2:0e2ef1edf01b 216 uInt lit_bufsize;
destinyXfate 2:0e2ef1edf01b 217 /* Size of match buffer for literals/lengths. There are 4 reasons for
destinyXfate 2:0e2ef1edf01b 218 * limiting lit_bufsize to 64K:
destinyXfate 2:0e2ef1edf01b 219 * - frequencies can be kept in 16 bit counters
destinyXfate 2:0e2ef1edf01b 220 * - if compression is not successful for the first block, all input
destinyXfate 2:0e2ef1edf01b 221 * data is still in the window so we can still emit a stored block even
destinyXfate 2:0e2ef1edf01b 222 * when input comes from standard input. (This can also be done for
destinyXfate 2:0e2ef1edf01b 223 * all blocks if lit_bufsize is not greater than 32K.)
destinyXfate 2:0e2ef1edf01b 224 * - if compression is not successful for a file smaller than 64K, we can
destinyXfate 2:0e2ef1edf01b 225 * even emit a stored file instead of a stored block (saving 5 bytes).
destinyXfate 2:0e2ef1edf01b 226 * This is applicable only for zip (not gzip or zlib).
destinyXfate 2:0e2ef1edf01b 227 * - creating new Huffman trees less frequently may not provide fast
destinyXfate 2:0e2ef1edf01b 228 * adaptation to changes in the input data statistics. (Take for
destinyXfate 2:0e2ef1edf01b 229 * example a binary file with poorly compressible code followed by
destinyXfate 2:0e2ef1edf01b 230 * a highly compressible string table.) Smaller buffer sizes give
destinyXfate 2:0e2ef1edf01b 231 * fast adaptation but have of course the overhead of transmitting
destinyXfate 2:0e2ef1edf01b 232 * trees more frequently.
destinyXfate 2:0e2ef1edf01b 233 * - I can't count above 4
destinyXfate 2:0e2ef1edf01b 234 */
destinyXfate 2:0e2ef1edf01b 235
destinyXfate 2:0e2ef1edf01b 236 uInt last_lit; /* running index in l_buf */
destinyXfate 2:0e2ef1edf01b 237
destinyXfate 2:0e2ef1edf01b 238 ushf *d_buf;
destinyXfate 2:0e2ef1edf01b 239 /* Buffer for distances. To simplify the code, d_buf and l_buf have
destinyXfate 2:0e2ef1edf01b 240 * the same number of elements. To use different lengths, an extra flag
destinyXfate 2:0e2ef1edf01b 241 * array would be necessary.
destinyXfate 2:0e2ef1edf01b 242 */
destinyXfate 2:0e2ef1edf01b 243
destinyXfate 2:0e2ef1edf01b 244 ulg opt_len; /* bit length of current block with optimal trees */
destinyXfate 2:0e2ef1edf01b 245 ulg static_len; /* bit length of current block with static trees */
destinyXfate 2:0e2ef1edf01b 246 uInt matches; /* number of string matches in current block */
destinyXfate 2:0e2ef1edf01b 247 int last_eob_len; /* bit length of EOB code for last block */
destinyXfate 2:0e2ef1edf01b 248
destinyXfate 2:0e2ef1edf01b 249 #ifdef DEBUG
destinyXfate 2:0e2ef1edf01b 250 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
destinyXfate 2:0e2ef1edf01b 251 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
destinyXfate 2:0e2ef1edf01b 252 #endif
destinyXfate 2:0e2ef1edf01b 253
destinyXfate 2:0e2ef1edf01b 254 ush bi_buf;
destinyXfate 2:0e2ef1edf01b 255 /* Output buffer. bits are inserted starting at the bottom (least
destinyXfate 2:0e2ef1edf01b 256 * significant bits).
destinyXfate 2:0e2ef1edf01b 257 */
destinyXfate 2:0e2ef1edf01b 258 int bi_valid;
destinyXfate 2:0e2ef1edf01b 259 /* Number of valid bits in bi_buf. All bits above the last valid bit
destinyXfate 2:0e2ef1edf01b 260 * are always zero.
destinyXfate 2:0e2ef1edf01b 261 */
destinyXfate 2:0e2ef1edf01b 262
destinyXfate 2:0e2ef1edf01b 263 } FAR deflate_state;
destinyXfate 2:0e2ef1edf01b 264
destinyXfate 2:0e2ef1edf01b 265 /* Output a byte on the stream.
destinyXfate 2:0e2ef1edf01b 266 * IN assertion: there is enough room in pending_buf.
destinyXfate 2:0e2ef1edf01b 267 */
destinyXfate 2:0e2ef1edf01b 268 #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}
destinyXfate 2:0e2ef1edf01b 269
destinyXfate 2:0e2ef1edf01b 270
destinyXfate 2:0e2ef1edf01b 271 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
destinyXfate 2:0e2ef1edf01b 272 /* Minimum amount of lookahead, except at the end of the input file.
destinyXfate 2:0e2ef1edf01b 273 * See deflate.c for comments about the MIN_MATCH+1.
destinyXfate 2:0e2ef1edf01b 274 */
destinyXfate 2:0e2ef1edf01b 275
destinyXfate 2:0e2ef1edf01b 276 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
destinyXfate 2:0e2ef1edf01b 277 /* In order to simplify the code, particularly on 16 bit machines, match
destinyXfate 2:0e2ef1edf01b 278 * distances are limited to MAX_DIST instead of WSIZE.
destinyXfate 2:0e2ef1edf01b 279 */
destinyXfate 2:0e2ef1edf01b 280
destinyXfate 2:0e2ef1edf01b 281 /* in trees.c */
destinyXfate 2:0e2ef1edf01b 282 void _tr_init OF((deflate_state *s));
destinyXfate 2:0e2ef1edf01b 283 int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
destinyXfate 2:0e2ef1edf01b 284 void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
destinyXfate 2:0e2ef1edf01b 285 int eof));
destinyXfate 2:0e2ef1edf01b 286 void _tr_align OF((deflate_state *s));
destinyXfate 2:0e2ef1edf01b 287 void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
destinyXfate 2:0e2ef1edf01b 288 int eof));
destinyXfate 2:0e2ef1edf01b 289
destinyXfate 2:0e2ef1edf01b 290 #define d_code(dist) \
destinyXfate 2:0e2ef1edf01b 291 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
destinyXfate 2:0e2ef1edf01b 292 /* Mapping from a distance to a distance code. dist is the distance - 1 and
destinyXfate 2:0e2ef1edf01b 293 * must not have side effects. _dist_code[256] and _dist_code[257] are never
destinyXfate 2:0e2ef1edf01b 294 * used.
destinyXfate 2:0e2ef1edf01b 295 */
destinyXfate 2:0e2ef1edf01b 296
destinyXfate 2:0e2ef1edf01b 297 #ifndef DEBUG
destinyXfate 2:0e2ef1edf01b 298 /* Inline versions of _tr_tally for speed: */
destinyXfate 2:0e2ef1edf01b 299
destinyXfate 2:0e2ef1edf01b 300 #if defined(GEN_TREES_H) || !defined(STDC)
destinyXfate 2:0e2ef1edf01b 301 extern uch _length_code[];
destinyXfate 2:0e2ef1edf01b 302 extern uch _dist_code[];
destinyXfate 2:0e2ef1edf01b 303 #else
destinyXfate 2:0e2ef1edf01b 304 extern const uch _length_code[];
destinyXfate 2:0e2ef1edf01b 305 extern const uch _dist_code[];
destinyXfate 2:0e2ef1edf01b 306 #endif
destinyXfate 2:0e2ef1edf01b 307
destinyXfate 2:0e2ef1edf01b 308 # define _tr_tally_lit(s, c, flush) \
destinyXfate 2:0e2ef1edf01b 309 { uch cc = (c); \
destinyXfate 2:0e2ef1edf01b 310 s->d_buf[s->last_lit] = 0; \
destinyXfate 2:0e2ef1edf01b 311 s->l_buf[s->last_lit++] = cc; \
destinyXfate 2:0e2ef1edf01b 312 s->dyn_ltree[cc].Freq++; \
destinyXfate 2:0e2ef1edf01b 313 flush = (s->last_lit == s->lit_bufsize-1); \
destinyXfate 2:0e2ef1edf01b 314 }
destinyXfate 2:0e2ef1edf01b 315 # define _tr_tally_dist(s, distance, length, flush) \
destinyXfate 2:0e2ef1edf01b 316 { uch len = (length); \
destinyXfate 2:0e2ef1edf01b 317 ush dist = (distance); \
destinyXfate 2:0e2ef1edf01b 318 s->d_buf[s->last_lit] = dist; \
destinyXfate 2:0e2ef1edf01b 319 s->l_buf[s->last_lit++] = len; \
destinyXfate 2:0e2ef1edf01b 320 dist--; \
destinyXfate 2:0e2ef1edf01b 321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
destinyXfate 2:0e2ef1edf01b 322 s->dyn_dtree[d_code(dist)].Freq++; \
destinyXfate 2:0e2ef1edf01b 323 flush = (s->last_lit == s->lit_bufsize-1); \
destinyXfate 2:0e2ef1edf01b 324 }
destinyXfate 2:0e2ef1edf01b 325 #else
destinyXfate 2:0e2ef1edf01b 326 # define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
destinyXfate 2:0e2ef1edf01b 327 # define _tr_tally_dist(s, distance, length, flush) \
destinyXfate 2:0e2ef1edf01b 328 flush = _tr_tally(s, distance, length)
destinyXfate 2:0e2ef1edf01b 329 #endif
destinyXfate 2:0e2ef1edf01b 330
destinyXfate 2:0e2ef1edf01b 331 #endif /* DEFLATE_H */
destinyXfate 2:0e2ef1edf01b 332