deflate.h 12 KB

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