1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/compressionlibs/ziplib/test/oldezlib/EZLib/deflate.h Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,318 @@
1.4 +/* deflate.h -- internal compression state
1.5 + * Copyright (C) 1995-1998 Jean-loup Gailly
1.6 + * For conditions of distribution and use, see copyright notice in zlib.h
1.7 + */
1.8 +
1.9 +/* WARNING: this file should *not* be used by applications. It is
1.10 + part of the implementation of the compression library and is
1.11 + subject to change. Applications should only use zlib.h.
1.12 + */
1.13 +
1.14 +/* @(#) $Id$ */
1.15 +
1.16 +#ifndef _DEFLATE_H
1.17 +#define _DEFLATE_H
1.18 +
1.19 +#include "zutil.h"
1.20 +
1.21 +/* ===========================================================================
1.22 + * Internal compression state.
1.23 + */
1.24 +
1.25 +#define LENGTH_CODES 29
1.26 +/* number of length codes, not counting the special END_BLOCK code */
1.27 +
1.28 +#define LITERALS 256
1.29 +/* number of literal bytes 0..255 */
1.30 +
1.31 +#define L_CODES (LITERALS+1+LENGTH_CODES)
1.32 +/* number of Literal or Length codes, including the END_BLOCK code */
1.33 +
1.34 +#define D_CODES 30
1.35 +/* number of distance codes */
1.36 +
1.37 +#define BL_CODES 19
1.38 +/* number of codes used to transfer the bit lengths */
1.39 +
1.40 +#define HEAP_SIZE (2*L_CODES+1)
1.41 +/* maximum heap size */
1.42 +
1.43 +#define MAX_BITS 15
1.44 +/* All codes must not exceed MAX_BITS bits */
1.45 +
1.46 +#define INIT_STATE 42
1.47 +#define BUSY_STATE 113
1.48 +#define FINISH_STATE 666
1.49 +/* Stream status */
1.50 +
1.51 +
1.52 +/* Data structure describing a single value and its code string. */
1.53 +typedef struct ct_data_s {
1.54 + union {
1.55 + ush freq; /* frequency count */
1.56 + ush code; /* bit string */
1.57 + } fc;
1.58 + union {
1.59 + ush dad; /* father node in Huffman tree */
1.60 + ush len; /* length of bit string */
1.61 + } dl;
1.62 +} FAR ct_data;
1.63 +
1.64 +#define Freq fc.freq
1.65 +#define Code fc.code
1.66 +#define Dad dl.dad
1.67 +#define Len dl.len
1.68 +
1.69 +typedef struct static_tree_desc_s static_tree_desc;
1.70 +
1.71 +typedef struct tree_desc_s {
1.72 + ct_data *dyn_tree; /* the dynamic tree */
1.73 + int max_code; /* largest code with non zero frequency */
1.74 + const static_tree_desc *stat_desc; /* the corresponding static tree */
1.75 +} FAR tree_desc;
1.76 +
1.77 +typedef ush Pos;
1.78 +typedef Pos FAR Posf;
1.79 +typedef unsigned IPos;
1.80 +
1.81 +/* A Pos is an index in the character window. We use short instead of int to
1.82 + * save space in the various tables. IPos is used only for parameter passing.
1.83 + */
1.84 +
1.85 +typedef struct internal_state {
1.86 + z_streamp strm; /* pointer back to this zlib stream */
1.87 + int status; /* as the name implies */
1.88 + Bytef *pending_buf; /* output still pending */
1.89 + ulg pending_buf_size; /* size of pending_buf */
1.90 + Bytef *pending_out; /* next pending byte to output to the stream */
1.91 + int pending; /* nb of bytes in the pending buffer */
1.92 + int noheader; /* suppress zlib header and adler32 */
1.93 + Byte data_type; /* UNKNOWN, BINARY or ASCII */
1.94 + Byte method; /* STORED (for zip only) or DEFLATED */
1.95 + int last_flush; /* value of flush param for previous deflate call */
1.96 +
1.97 + /* used by deflate.c: */
1.98 +
1.99 + uInt w_size; /* LZ77 window size (32K by default) */
1.100 + uInt w_bits; /* log2(w_size) (8..16) */
1.101 + uInt w_mask; /* w_size - 1 */
1.102 +
1.103 + Bytef *window;
1.104 + /* Sliding window. Input bytes are read into the second half of the window,
1.105 + * and move to the first half later to keep a dictionary of at least wSize
1.106 + * bytes. With this organization, matches are limited to a distance of
1.107 + * wSize-MAX_MATCH bytes, but this ensures that IO is always
1.108 + * performed with a length multiple of the block size. Also, it limits
1.109 + * the window size to 64K, which is quite useful on MSDOS.
1.110 + * To do: use the user input buffer as sliding window.
1.111 + */
1.112 +
1.113 + ulg window_size;
1.114 + /* Actual size of window: 2*wSize, except when the user input buffer
1.115 + * is directly used as sliding window.
1.116 + */
1.117 +
1.118 + Posf *prev;
1.119 + /* Link to older string with same hash index. To limit the size of this
1.120 + * array to 64K, this link is maintained only for the last 32K strings.
1.121 + * An index in this array is thus a window index modulo 32K.
1.122 + */
1.123 +
1.124 + Posf *head; /* Heads of the hash chains or NIL. */
1.125 +
1.126 + uInt ins_h; /* hash index of string to be inserted */
1.127 + uInt hash_size; /* number of elements in hash table */
1.128 + uInt hash_bits; /* log2(hash_size) */
1.129 + uInt hash_mask; /* hash_size-1 */
1.130 +
1.131 + uInt hash_shift;
1.132 + /* Number of bits by which ins_h must be shifted at each input
1.133 + * step. It must be such that after MIN_MATCH steps, the oldest
1.134 + * byte no longer takes part in the hash key, that is:
1.135 + * hash_shift * MIN_MATCH >= hash_bits
1.136 + */
1.137 +
1.138 + long block_start;
1.139 + /* Window position at the beginning of the current output block. Gets
1.140 + * negative when the window is moved backwards.
1.141 + */
1.142 +
1.143 + uInt match_length; /* length of best match */
1.144 + IPos prev_match; /* previous match */
1.145 + int match_available; /* set if previous match exists */
1.146 + uInt strstart; /* start of string to insert */
1.147 + uInt match_start; /* start of matching string */
1.148 + uInt lookahead; /* number of valid bytes ahead in window */
1.149 +
1.150 + uInt prev_length;
1.151 + /* Length of the best match at previous step. Matches not greater than this
1.152 + * are discarded. This is used in the lazy match evaluation.
1.153 + */
1.154 +
1.155 + uInt max_chain_length;
1.156 + /* To speed up deflation, hash chains are never searched beyond this
1.157 + * length. A higher limit improves compression ratio but degrades the
1.158 + * speed.
1.159 + */
1.160 +
1.161 + uInt max_lazy_match;
1.162 + /* Attempt to find a better match only when the current match is strictly
1.163 + * smaller than this value. This mechanism is used only for compression
1.164 + * levels >= 4.
1.165 + */
1.166 +# define max_insert_length max_lazy_match
1.167 + /* Insert new strings in the hash table only if the match length is not
1.168 + * greater than this length. This saves time but degrades compression.
1.169 + * max_insert_length is used only for compression levels <= 3.
1.170 + */
1.171 +
1.172 + int level; /* compression level (1..9) */
1.173 + int strategy; /* favor or force Huffman coding*/
1.174 +
1.175 + uInt good_match;
1.176 + /* Use a faster search when the previous match is longer than this */
1.177 +
1.178 + int nice_match; /* Stop searching when current match exceeds this */
1.179 +
1.180 + /* used by trees.c: */
1.181 + /* Didn't use ct_data typedef below to supress compiler warning */
1.182 + struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1.183 + struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
1.184 + struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
1.185 +
1.186 + struct tree_desc_s l_desc; /* desc. for literal tree */
1.187 + struct tree_desc_s d_desc; /* desc. for distance tree */
1.188 + struct tree_desc_s bl_desc; /* desc. for bit length tree */
1.189 +
1.190 + ush bl_count[MAX_BITS+1];
1.191 + /* number of codes at each bit length for an optimal tree */
1.192 +
1.193 + int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
1.194 + int heap_len; /* number of elements in the heap */
1.195 + int heap_max; /* element of largest frequency */
1.196 + /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
1.197 + * The same heap array is used to build all trees.
1.198 + */
1.199 +
1.200 + uch depth[2*L_CODES+1];
1.201 + /* Depth of each subtree used as tie breaker for trees of equal frequency
1.202 + */
1.203 +
1.204 + uchf *l_buf; /* buffer for literals or lengths */
1.205 +
1.206 + uInt lit_bufsize;
1.207 + /* Size of match buffer for literals/lengths. There are 4 reasons for
1.208 + * limiting lit_bufsize to 64K:
1.209 + * - frequencies can be kept in 16 bit counters
1.210 + * - if compression is not successful for the first block, all input
1.211 + * data is still in the window so we can still emit a stored block even
1.212 + * when input comes from standard input. (This can also be done for
1.213 + * all blocks if lit_bufsize is not greater than 32K.)
1.214 + * - if compression is not successful for a file smaller than 64K, we can
1.215 + * even emit a stored file instead of a stored block (saving 5 bytes).
1.216 + * This is applicable only for zip (not gzip or zlib).
1.217 + * - creating new Huffman trees less frequently may not provide fast
1.218 + * adaptation to changes in the input data statistics. (Take for
1.219 + * example a binary file with poorly compressible code followed by
1.220 + * a highly compressible string table.) Smaller buffer sizes give
1.221 + * fast adaptation but have of course the overhead of transmitting
1.222 + * trees more frequently.
1.223 + * - I can't count above 4
1.224 + */
1.225 +
1.226 + uInt last_lit; /* running index in l_buf */
1.227 +
1.228 + ushf *d_buf;
1.229 + /* Buffer for distances. To simplify the code, d_buf and l_buf have
1.230 + * the same number of elements. To use different lengths, an extra flag
1.231 + * array would be necessary.
1.232 + */
1.233 +
1.234 + ulg opt_len; /* bit length of current block with optimal trees */
1.235 + ulg static_len; /* bit length of current block with static trees */
1.236 + uInt matches; /* number of string matches in current block */
1.237 + int last_eob_len; /* bit length of EOB code for last block */
1.238 +
1.239 +#ifdef DEBUG
1.240 + ulg compressed_len; /* total bit length of compressed file mod 2^32 */
1.241 + ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
1.242 +#endif
1.243 +
1.244 + ush bi_buf;
1.245 + /* Output buffer. bits are inserted starting at the bottom (least
1.246 + * significant bits).
1.247 + */
1.248 + int bi_valid;
1.249 + /* Number of valid bits in bi_buf. All bits above the last valid bit
1.250 + * are always zero.
1.251 + */
1.252 +
1.253 +} FAR deflate_state;
1.254 +
1.255 +/* Output a byte on the stream.
1.256 + * IN assertion: there is enough room in pending_buf.
1.257 + */
1.258 +#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}
1.259 +
1.260 +
1.261 +#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
1.262 +/* Minimum amount of lookahead, except at the end of the input file.
1.263 + * See deflate.c for comments about the MIN_MATCH+1.
1.264 + */
1.265 +
1.266 +#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
1.267 +/* In order to simplify the code, particularly on 16 bit machines, match
1.268 + * distances are limited to MAX_DIST instead of WSIZE.
1.269 + */
1.270 +
1.271 + /* in trees.c */
1.272 +void _tr_init OF((deflate_state *s));
1.273 +int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
1.274 +void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
1.275 + int eof));
1.276 +void _tr_align OF((deflate_state *s));
1.277 +void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
1.278 + int eof));
1.279 +
1.280 +#define d_code(dist) \
1.281 + ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
1.282 +/* Mapping from a distance to a distance code. dist is the distance - 1 and
1.283 + * must not have side effects. _dist_code[256] and _dist_code[257] are never
1.284 + * used.
1.285 + */
1.286 +
1.287 +#ifndef DEBUG
1.288 +/* Inline versions of _tr_tally for speed: */
1.289 +
1.290 +#if defined(GEN_TREES_H) || !defined(STDC)
1.291 + extern uch _length_code[];
1.292 + extern uch _dist_code[];
1.293 +#else
1.294 + extern const uch _length_code[];
1.295 + extern const uch _dist_code[];
1.296 +#endif
1.297 +
1.298 +# define _tr_tally_lit(s, c, flush) \
1.299 + { uch cc = (c); \
1.300 + s->d_buf[s->last_lit] = 0; \
1.301 + s->l_buf[s->last_lit++] = cc; \
1.302 + s->dyn_ltree[cc].Freq++; \
1.303 + flush = (s->last_lit == s->lit_bufsize-1); \
1.304 + }
1.305 +# define _tr_tally_dist(s, distance, length, flush) \
1.306 + { uch len = STATIC_CAST(uch,length); \
1.307 + ush dist = STATIC_CAST(ush,distance); \
1.308 + s->d_buf[s->last_lit] = dist; \
1.309 + s->l_buf[s->last_lit++] = len; \
1.310 + dist--; \
1.311 + s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1.312 + s->dyn_dtree[d_code(dist)].Freq++; \
1.313 + flush = (s->last_lit == s->lit_bufsize-1); \
1.314 + }
1.315 +#else
1.316 +# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
1.317 +# define _tr_tally_dist(s, distance, length, flush) \
1.318 + flush = _tr_tally(s, distance, length)
1.319 +#endif
1.320 +
1.321 +#endif