| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <title>activemq-cpp-3.3.0: src/main/decaf/internal/util/zip/deflate.h Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <link href="navtree.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="navtree.js"></script> |
| <script type="text/javascript" src="resize.js"></script> |
| <script type="text/javascript"> |
| $(document).ready(initResizable); |
| </script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css"/> |
| </head> |
| <body> |
| <!-- Generated by Doxygen 1.7.3 --> |
| <div id="top"> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td style="padding-left: 0.5em;"> |
| <div id="projectname">activemq-cpp-3.3.0</div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <div id="navrow1" class="tabs"> |
| <ul class="tablist"> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="namespaces.html"><span>Namespaces</span></a></li> |
| <li><a href="annotated.html"><span>Data Structures</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| </ul> |
| </div> |
| <div id="navrow2" class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| <li><a href="globals.html"><span>Globals</span></a></li> |
| </ul> |
| </div> |
| </div> |
| <div id="side-nav" class="ui-resizable side-nav-resizable"> |
| <div id="nav-tree"> |
| <div id="nav-tree-contents"> |
| </div> |
| </div> |
| <div id="splitbar" style="-moz-user-select:none;" |
| class="ui-resizable-handle"> |
| </div> |
| </div> |
| <script type="text/javascript"> |
| initNavTree('deflate_8h.html',''); |
| </script> |
| <div id="doc-content"> |
| <div class="header"> |
| <div class="headertitle"> |
| <h1>src/main/decaf/internal/util/zip/deflate.h</h1> </div> |
| </div> |
| <div class="contents"> |
| <a href="deflate_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* deflate.h -- internal compression state</span> |
| <a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 1995-2010 Jean-loup Gailly</span> |
| <a name="l00003"></a>00003 <span class="comment"> * For conditions of distribution and use, see copyright notice in zlib.h</span> |
| <a name="l00004"></a>00004 <span class="comment"> */</span> |
| <a name="l00005"></a>00005 |
| <a name="l00006"></a>00006 <span class="comment">/* WARNING: this file should *not* be used by applications. It is</span> |
| <a name="l00007"></a>00007 <span class="comment"> part of the implementation of the compression library and is</span> |
| <a name="l00008"></a>00008 <span class="comment"> subject to change. Applications should only use zlib.h.</span> |
| <a name="l00009"></a>00009 <span class="comment"> */</span> |
| <a name="l00010"></a>00010 |
| <a name="l00011"></a>00011 <span class="comment">/* @(#) $Id$ */</span> |
| <a name="l00012"></a>00012 |
| <a name="l00013"></a>00013 <span class="preprocessor">#ifndef DEFLATE_H</span> |
| <a name="l00014"></a>00014 <span class="preprocessor"></span><span class="preprocessor">#define DEFLATE_H</span> |
| <a name="l00015"></a>00015 <span class="preprocessor"></span> |
| <a name="l00016"></a>00016 <span class="preprocessor">#include "<a class="code" href="zutil_8h.html">zutil.h</a>"</span> |
| <a name="l00017"></a>00017 |
| <a name="l00018"></a>00018 <span class="comment">/* define NO_GZIP when compiling if you want to disable gzip header and</span> |
| <a name="l00019"></a>00019 <span class="comment"> trailer creation by deflate(). NO_GZIP would be used to avoid linking in</span> |
| <a name="l00020"></a>00020 <span class="comment"> the crc code when it is not needed. For shared libraries, gzip encoding</span> |
| <a name="l00021"></a>00021 <span class="comment"> should be left enabled. */</span> |
| <a name="l00022"></a>00022 <span class="preprocessor">#ifndef NO_GZIP</span> |
| <a name="l00023"></a><a class="code" href="deflate_8h.html#a9564352992f7a4001386d1c8e2977571">00023</a> <span class="preprocessor"></span><span class="preprocessor"># define GZIP</span> |
| <a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#endif</span> |
| <a name="l00025"></a>00025 <span class="preprocessor"></span> |
| <a name="l00026"></a>00026 <span class="comment">/* ===========================================================================</span> |
| <a name="l00027"></a>00027 <span class="comment"> * Internal compression state.</span> |
| <a name="l00028"></a>00028 <span class="comment"> */</span> |
| <a name="l00029"></a>00029 |
| <a name="l00030"></a><a class="code" href="deflate_8h.html#a8dd3b78c666b6592944b2acf1706e611">00030</a> <span class="preprocessor">#define LENGTH_CODES 29</span> |
| <a name="l00031"></a>00031 <span class="preprocessor"></span><span class="comment">/* number of length codes, not counting the special END_BLOCK code */</span> |
| <a name="l00032"></a>00032 |
| <a name="l00033"></a><a class="code" href="deflate_8h.html#a3f59145500c9de746e7dc49fb98c29ef">00033</a> <span class="preprocessor">#define LITERALS 256</span> |
| <a name="l00034"></a>00034 <span class="preprocessor"></span><span class="comment">/* number of literal bytes 0..255 */</span> |
| <a name="l00035"></a>00035 |
| <a name="l00036"></a><a class="code" href="deflate_8h.html#a2b0cc00cc6a7d521fba8d208a1cae477">00036</a> <span class="preprocessor">#define L_CODES (LITERALS+1+LENGTH_CODES)</span> |
| <a name="l00037"></a>00037 <span class="preprocessor"></span><span class="comment">/* number of Literal or Length codes, including the END_BLOCK code */</span> |
| <a name="l00038"></a>00038 |
| <a name="l00039"></a><a class="code" href="deflate_8h.html#a8798a9a526623abbd88fedb0727e21aa">00039</a> <span class="preprocessor">#define D_CODES 30</span> |
| <a name="l00040"></a>00040 <span class="preprocessor"></span><span class="comment">/* number of distance codes */</span> |
| <a name="l00041"></a>00041 |
| <a name="l00042"></a><a class="code" href="deflate_8h.html#a9e19158a493307d4f211cdf223da8319">00042</a> <span class="preprocessor">#define BL_CODES 19</span> |
| <a name="l00043"></a>00043 <span class="preprocessor"></span><span class="comment">/* number of codes used to transfer the bit lengths */</span> |
| <a name="l00044"></a>00044 |
| <a name="l00045"></a><a class="code" href="deflate_8h.html#a1b45302695680930829cac31d65e41e1">00045</a> <span class="preprocessor">#define HEAP_SIZE (2*L_CODES+1)</span> |
| <a name="l00046"></a>00046 <span class="preprocessor"></span><span class="comment">/* maximum heap size */</span> |
| <a name="l00047"></a>00047 |
| <a name="l00048"></a><a class="code" href="deflate_8h.html#a51c241e7ad52441b8d4c1fd5f498b3b9">00048</a> <span class="preprocessor">#define MAX_BITS 15</span> |
| <a name="l00049"></a>00049 <span class="preprocessor"></span><span class="comment">/* All codes must not exceed MAX_BITS bits */</span> |
| <a name="l00050"></a>00050 |
| <a name="l00051"></a><a class="code" href="deflate_8h.html#a96cb576b9a3b5f8cb90bd4bb7ee449d2">00051</a> <span class="preprocessor">#define INIT_STATE 42</span> |
| <a name="l00052"></a><a class="code" href="deflate_8h.html#affc01bd472ba5f5ad1519c40e20a3778">00052</a> <span class="preprocessor"></span><span class="preprocessor">#define EXTRA_STATE 69</span> |
| <a name="l00053"></a><a class="code" href="deflate_8h.html#acec08b85e51457d214b759d489785e99">00053</a> <span class="preprocessor"></span><span class="preprocessor">#define NAME_STATE 73</span> |
| <a name="l00054"></a><a class="code" href="deflate_8h.html#a06c47936258e98a0c4ca38dd31a5f6c7">00054</a> <span class="preprocessor"></span><span class="preprocessor">#define COMMENT_STATE 91</span> |
| <a name="l00055"></a><a class="code" href="deflate_8h.html#a09dffa22705cbe81ca94b8b379d43682">00055</a> <span class="preprocessor"></span><span class="preprocessor">#define HCRC_STATE 103</span> |
| <a name="l00056"></a><a class="code" href="deflate_8h.html#a4821f69a5605c2618cd4dc4d3f60979c">00056</a> <span class="preprocessor"></span><span class="preprocessor">#define BUSY_STATE 113</span> |
| <a name="l00057"></a><a class="code" href="deflate_8h.html#a0474cba74b039aa45fe9412c1de86bed">00057</a> <span class="preprocessor"></span><span class="preprocessor">#define FINISH_STATE 666</span> |
| <a name="l00058"></a>00058 <span class="preprocessor"></span><span class="comment">/* Stream status */</span> |
| <a name="l00059"></a>00059 |
| <a name="l00060"></a>00060 |
| <a name="l00061"></a>00061 <span class="comment">/* Data structure describing a single value and its code string. */</span> |
| <a name="l00062"></a><a class="code" href="structct__data__s.html">00062</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structct__data__s.html">ct_data_s</a> { |
| <a name="l00063"></a>00063 <span class="keyword">union </span>{ |
| <a name="l00064"></a><a class="code" href="structct__data__s.html#a67cd3c3267ba768c4494b36d5929c4bf">00064</a> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="structct__data__s.html#a67cd3c3267ba768c4494b36d5929c4bf">freq</a>; <span class="comment">/* frequency count */</span> |
| <a name="l00065"></a><a class="code" href="structct__data__s.html#a242f709ab288db2d155e28ce98c510c5">00065</a> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="structct__data__s.html#a242f709ab288db2d155e28ce98c510c5">code</a>; <span class="comment">/* bit string */</span> |
| <a name="l00066"></a>00066 } <a class="code" href="structct__data__s.html#a4f9c9f1c63d48a747d49c9f441a5c8c0">fc</a>; |
| <a name="l00067"></a>00067 <span class="keyword">union </span>{ |
| <a name="l00068"></a><a class="code" href="structct__data__s.html#a73955d00dbdac5ad4027804a00726bfa">00068</a> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="structct__data__s.html#a73955d00dbdac5ad4027804a00726bfa">dad</a>; <span class="comment">/* father node in Huffman tree */</span> |
| <a name="l00069"></a><a class="code" href="structct__data__s.html#ad7f6929b2907e046dfbc8f091b494cfb">00069</a> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="structct__data__s.html#ad7f6929b2907e046dfbc8f091b494cfb">len</a>; <span class="comment">/* length of bit string */</span> |
| <a name="l00070"></a>00070 } <a class="code" href="structct__data__s.html#a1de4b7880172e0218dc66e04573627d8">dl</a>; |
| <a name="l00071"></a>00071 } <a class="code" href="zconf_8h.html#aef060b3456fdcc093a7210a762d5f2ed">FAR</a> <a class="code" href="deflate_8h.html#a0a4b5df3b2254c627b8a59e038963118">ct_data</a>; |
| <a name="l00072"></a>00072 |
| <a name="l00073"></a><a class="code" href="deflate_8h.html#a8bab2775fa423836b05f407d2f8bf6e2">00073</a> <span class="preprocessor">#define Freq fc.freq</span> |
| <a name="l00074"></a><a class="code" href="deflate_8h.html#a068e76e6034d06450385bc98b69ea53e">00074</a> <span class="preprocessor"></span><span class="preprocessor">#define Code fc.code</span> |
| <a name="l00075"></a><a class="code" href="deflate_8h.html#ad76da95d6074d29bacb152bc46d189d5">00075</a> <span class="preprocessor"></span><span class="preprocessor">#define Dad dl.dad</span> |
| <a name="l00076"></a><a class="code" href="deflate_8h.html#a4490e644c06783cc69ad87c121e39e94">00076</a> <span class="preprocessor"></span><span class="preprocessor">#define Len dl.len</span> |
| <a name="l00077"></a>00077 <span class="preprocessor"></span> |
| <a name="l00078"></a><a class="code" href="deflate_8h.html#a905910aabf6aabbe79ff0832e4a664cc">00078</a> <span class="keyword">typedef</span> <span class="keyword">struct </span>static_tree_desc_s <a class="code" href="deflate_8h.html#a905910aabf6aabbe79ff0832e4a664cc">static_tree_desc</a>; |
| <a name="l00079"></a>00079 |
| <a name="l00080"></a><a class="code" href="structtree__desc__s.html">00080</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structtree__desc__s.html">tree_desc_s</a> { |
| <a name="l00081"></a><a class="code" href="structtree__desc__s.html#a5c79989c018b96c729e88e41f98a4920">00081</a> <a class="code" href="structct__data__s.html">ct_data</a> *<a class="code" href="structtree__desc__s.html#a5c79989c018b96c729e88e41f98a4920">dyn_tree</a>; <span class="comment">/* the dynamic tree */</span> |
| <a name="l00082"></a><a class="code" href="structtree__desc__s.html#a11f42f2c0464693def462dcfdd871002">00082</a> <span class="keywordtype">int</span> <a class="code" href="structtree__desc__s.html#a11f42f2c0464693def462dcfdd871002">max_code</a>; <span class="comment">/* largest code with non zero frequency */</span> |
| <a name="l00083"></a><a class="code" href="structtree__desc__s.html#a7f237428776ee85058bb7f7f11900dd2">00083</a> <a class="code" href="deflate_8h.html#a905910aabf6aabbe79ff0832e4a664cc">static_tree_desc</a> *<a class="code" href="structtree__desc__s.html#a7f237428776ee85058bb7f7f11900dd2">stat_desc</a>; <span class="comment">/* the corresponding static tree */</span> |
| <a name="l00084"></a>00084 } <a class="code" href="zconf_8h.html#aef060b3456fdcc093a7210a762d5f2ed">FAR</a> <a class="code" href="deflate_8h.html#ae978a66d78f0d68f945f48951f9151ff">tree_desc</a>; |
| <a name="l00085"></a>00085 |
| <a name="l00086"></a><a class="code" href="deflate_8h.html#a80a8610ae675eaeead82013bacde10a1">00086</a> <span class="keyword">typedef</span> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="deflate_8h.html#a80a8610ae675eaeead82013bacde10a1">Pos</a>; |
| <a name="l00087"></a><a class="code" href="deflate_8h.html#a7fc422ecb86afdd5f330dad6f7c1136b">00087</a> <span class="keyword">typedef</span> <a class="code" href="deflate_8h.html#a80a8610ae675eaeead82013bacde10a1">Pos</a> <a class="code" href="zconf_8h.html#aef060b3456fdcc093a7210a762d5f2ed">FAR</a> <a class="code" href="deflate_8h.html#a7fc422ecb86afdd5f330dad6f7c1136b">Posf</a>; |
| <a name="l00088"></a><a class="code" href="deflate_8h.html#ada696b787a46d01634b6365afcec1a9e">00088</a> <span class="keyword">typedef</span> <span class="keywordtype">unsigned</span> <a class="code" href="deflate_8h.html#ada696b787a46d01634b6365afcec1a9e">IPos</a>; |
| <a name="l00089"></a>00089 |
| <a name="l00090"></a>00090 <span class="comment">/* A Pos is an index in the character window. We use short instead of int to</span> |
| <a name="l00091"></a>00091 <span class="comment"> * save space in the various tables. IPos is used only for parameter passing.</span> |
| <a name="l00092"></a>00092 <span class="comment"> */</span> |
| <a name="l00093"></a>00093 |
| <a name="l00094"></a><a class="code" href="structinternal__state.html">00094</a> <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structinternal__state.html">internal_state</a> { |
| <a name="l00095"></a><a class="code" href="structinternal__state.html#aaf558a49ab8c6caea3d131c6b913db42">00095</a> <a class="code" href="zlib_8h.html#a6ede25c84d3c9f8632305866acffb1d6">z_streamp</a> <a class="code" href="structinternal__state.html#aaf558a49ab8c6caea3d131c6b913db42">strm</a>; <span class="comment">/* pointer back to this zlib stream */</span> |
| <a name="l00096"></a><a class="code" href="structinternal__state.html#a8756cacdbac452a2633f87e06fae6c52">00096</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#a8756cacdbac452a2633f87e06fae6c52">status</a>; <span class="comment">/* as the name implies */</span> |
| <a name="l00097"></a><a class="code" href="structinternal__state.html#ae5f393e8d0d569da6038749768f65b94">00097</a> <a class="code" href="zconf_8h.html#aeb722a888064be47e12d05f692e0f407">Bytef</a> *<a class="code" href="structinternal__state.html#ae5f393e8d0d569da6038749768f65b94">pending_buf</a>; <span class="comment">/* output still pending */</span> |
| <a name="l00098"></a><a class="code" href="structinternal__state.html#a9100ecccf2f8bb474f0bcc7c69f55c27">00098</a> <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> <a class="code" href="structinternal__state.html#a9100ecccf2f8bb474f0bcc7c69f55c27">pending_buf_size</a>; <span class="comment">/* size of pending_buf */</span> |
| <a name="l00099"></a><a class="code" href="structinternal__state.html#a6e15ed78675c3c7bdb312623b5eceb7a">00099</a> <a class="code" href="zconf_8h.html#aeb722a888064be47e12d05f692e0f407">Bytef</a> *<a class="code" href="structinternal__state.html#a6e15ed78675c3c7bdb312623b5eceb7a">pending_out</a>; <span class="comment">/* next pending byte to output to the stream */</span> |
| <a name="l00100"></a><a class="code" href="structinternal__state.html#ac92f5b70c269be4685539daef10b15a3">00100</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#ac92f5b70c269be4685539daef10b15a3">pending</a>; <span class="comment">/* nb of bytes in the pending buffer */</span> |
| <a name="l00101"></a><a class="code" href="structinternal__state.html#ae80327ea7ad4ad0ef5baeef5ef3a6807">00101</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#ae80327ea7ad4ad0ef5baeef5ef3a6807">wrap</a>; <span class="comment">/* bit 0 true for zlib, bit 1 true for gzip */</span> |
| <a name="l00102"></a><a class="code" href="structinternal__state.html#ac023d0c9e6112dfe6cbd049a56484997">00102</a> <a class="code" href="zlib_8h.html#a40e9dcc294796d99b25e98fb06477fc8">gz_headerp</a> <a class="code" href="structinternal__state.html#ac023d0c9e6112dfe6cbd049a56484997">gzhead</a>; <span class="comment">/* gzip header information to write */</span> |
| <a name="l00103"></a><a class="code" href="structinternal__state.html#a5e09188a83aadfcb0db60b0765596aa1">00103</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a5e09188a83aadfcb0db60b0765596aa1">gzindex</a>; <span class="comment">/* where in extra, name, or comment */</span> |
| <a name="l00104"></a><a class="code" href="structinternal__state.html#aeb38f8a255e975e703595577ea43220b">00104</a> <a class="code" href="zconf_8h.html#ae3a497195d617519e5353ea7b417940f">Byte</a> <a class="code" href="structinternal__state.html#aeb38f8a255e975e703595577ea43220b">method</a>; <span class="comment">/* STORED (for zip only) or DEFLATED */</span> |
| <a name="l00105"></a><a class="code" href="structinternal__state.html#aa9517fd4120306e1f07a05563a6fe40b">00105</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#aa9517fd4120306e1f07a05563a6fe40b">last_flush</a>; <span class="comment">/* value of flush param for previous deflate call */</span> |
| <a name="l00106"></a>00106 |
| <a name="l00107"></a>00107 <span class="comment">/* used by deflate.c: */</span> |
| <a name="l00108"></a>00108 |
| <a name="l00109"></a><a class="code" href="structinternal__state.html#a875579bf4d0e9d9f9c04ff288d22bb90">00109</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a875579bf4d0e9d9f9c04ff288d22bb90">w_size</a>; <span class="comment">/* LZ77 window size (32K by default) */</span> |
| <a name="l00110"></a><a class="code" href="structinternal__state.html#a016f4538a10e71ab601017a052c0a05f">00110</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a016f4538a10e71ab601017a052c0a05f">w_bits</a>; <span class="comment">/* log2(w_size) (8..16) */</span> |
| <a name="l00111"></a><a class="code" href="structinternal__state.html#a19aca516cb19d15cd0c2ea3c72cbe9a5">00111</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a19aca516cb19d15cd0c2ea3c72cbe9a5">w_mask</a>; <span class="comment">/* w_size - 1 */</span> |
| <a name="l00112"></a>00112 |
| <a name="l00113"></a><a class="code" href="structinternal__state.html#a8d5cccc7e4dd85927c84bb8efc645533">00113</a> <a class="code" href="zconf_8h.html#aeb722a888064be47e12d05f692e0f407">Bytef</a> *<a class="code" href="structinternal__state.html#a8d5cccc7e4dd85927c84bb8efc645533">window</a>; |
| <a name="l00114"></a>00114 <span class="comment">/* Sliding window. Input bytes are read into the second half of the window,</span> |
| <a name="l00115"></a>00115 <span class="comment"> * and move to the first half later to keep a dictionary of at least wSize</span> |
| <a name="l00116"></a>00116 <span class="comment"> * bytes. With this organization, matches are limited to a distance of</span> |
| <a name="l00117"></a>00117 <span class="comment"> * wSize-MAX_MATCH bytes, but this ensures that IO is always</span> |
| <a name="l00118"></a>00118 <span class="comment"> * performed with a length multiple of the block size. Also, it limits</span> |
| <a name="l00119"></a>00119 <span class="comment"> * the window size to 64K, which is quite useful on MSDOS.</span> |
| <a name="l00120"></a>00120 <span class="comment"> * To do: use the user input buffer as sliding window.</span> |
| <a name="l00121"></a>00121 <span class="comment"> */</span> |
| <a name="l00122"></a>00122 |
| <a name="l00123"></a><a class="code" href="structinternal__state.html#a4e45f5ef1c4d9d599a5fb11fa283806c">00123</a> <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> <a class="code" href="structinternal__state.html#a4e45f5ef1c4d9d599a5fb11fa283806c">window_size</a>; |
| <a name="l00124"></a>00124 <span class="comment">/* Actual size of window: 2*wSize, except when the user input buffer</span> |
| <a name="l00125"></a>00125 <span class="comment"> * is directly used as sliding window.</span> |
| <a name="l00126"></a>00126 <span class="comment"> */</span> |
| <a name="l00127"></a>00127 |
| <a name="l00128"></a><a class="code" href="structinternal__state.html#a93a7407be4c9df81f71a389eb1ff6c57">00128</a> <a class="code" href="deflate_8h.html#a7fc422ecb86afdd5f330dad6f7c1136b">Posf</a> *<a class="code" href="structinternal__state.html#a93a7407be4c9df81f71a389eb1ff6c57">prev</a>; |
| <a name="l00129"></a>00129 <span class="comment">/* Link to older string with same hash index. To limit the size of this</span> |
| <a name="l00130"></a>00130 <span class="comment"> * array to 64K, this link is maintained only for the last 32K strings.</span> |
| <a name="l00131"></a>00131 <span class="comment"> * An index in this array is thus a window index modulo 32K.</span> |
| <a name="l00132"></a>00132 <span class="comment"> */</span> |
| <a name="l00133"></a>00133 |
| <a name="l00134"></a><a class="code" href="structinternal__state.html#aafd9ba338599f15de29386ff7a0218f4">00134</a> <a class="code" href="deflate_8h.html#a7fc422ecb86afdd5f330dad6f7c1136b">Posf</a> *<a class="code" href="structinternal__state.html#aafd9ba338599f15de29386ff7a0218f4">head</a>; <span class="comment">/* Heads of the hash chains or NIL. */</span> |
| <a name="l00135"></a>00135 |
| <a name="l00136"></a><a class="code" href="structinternal__state.html#a8cf437698f428195122d3c530929a80c">00136</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a8cf437698f428195122d3c530929a80c">ins_h</a>; <span class="comment">/* hash index of string to be inserted */</span> |
| <a name="l00137"></a><a class="code" href="structinternal__state.html#aad05d6c37eb87eefafca51e05468f349">00137</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#aad05d6c37eb87eefafca51e05468f349">hash_size</a>; <span class="comment">/* number of elements in hash table */</span> |
| <a name="l00138"></a><a class="code" href="structinternal__state.html#a5dbd3a26550651a746a8829210252715">00138</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a5dbd3a26550651a746a8829210252715">hash_bits</a>; <span class="comment">/* log2(hash_size) */</span> |
| <a name="l00139"></a><a class="code" href="structinternal__state.html#a824166a384dcbf6d508c0f6b97a1cb89">00139</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a824166a384dcbf6d508c0f6b97a1cb89">hash_mask</a>; <span class="comment">/* hash_size-1 */</span> |
| <a name="l00140"></a>00140 |
| <a name="l00141"></a><a class="code" href="structinternal__state.html#aec996517ec9d4c0741647c487d2c513c">00141</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#aec996517ec9d4c0741647c487d2c513c">hash_shift</a>; |
| <a name="l00142"></a>00142 <span class="comment">/* Number of bits by which ins_h must be shifted at each input</span> |
| <a name="l00143"></a>00143 <span class="comment"> * step. It must be such that after MIN_MATCH steps, the oldest</span> |
| <a name="l00144"></a>00144 <span class="comment"> * byte no longer takes part in the hash key, that is:</span> |
| <a name="l00145"></a>00145 <span class="comment"> * hash_shift * MIN_MATCH >= hash_bits</span> |
| <a name="l00146"></a>00146 <span class="comment"> */</span> |
| <a name="l00147"></a>00147 |
| <a name="l00148"></a><a class="code" href="structinternal__state.html#a4ba16849758dfa969066693ca2cae880">00148</a> <span class="keywordtype">long</span> <a class="code" href="structinternal__state.html#a4ba16849758dfa969066693ca2cae880">block_start</a>; |
| <a name="l00149"></a>00149 <span class="comment">/* Window position at the beginning of the current output block. Gets</span> |
| <a name="l00150"></a>00150 <span class="comment"> * negative when the window is moved backwards.</span> |
| <a name="l00151"></a>00151 <span class="comment"> */</span> |
| <a name="l00152"></a>00152 |
| <a name="l00153"></a><a class="code" href="structinternal__state.html#aa1506e6907be6f3d4273a1386206ae0c">00153</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#aa1506e6907be6f3d4273a1386206ae0c">match_length</a>; <span class="comment">/* length of best match */</span> |
| <a name="l00154"></a><a class="code" href="structinternal__state.html#a0f5871de1be252ed0496a8b7a30464ef">00154</a> <a class="code" href="deflate_8h.html#ada696b787a46d01634b6365afcec1a9e">IPos</a> <a class="code" href="structinternal__state.html#a0f5871de1be252ed0496a8b7a30464ef">prev_match</a>; <span class="comment">/* previous match */</span> |
| <a name="l00155"></a><a class="code" href="structinternal__state.html#accddba15d8b54ca3f10163fa920599f4">00155</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#accddba15d8b54ca3f10163fa920599f4">match_available</a>; <span class="comment">/* set if previous match exists */</span> |
| <a name="l00156"></a><a class="code" href="structinternal__state.html#a946579b9b86ee466424ffb0a67eb7060">00156</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a946579b9b86ee466424ffb0a67eb7060">strstart</a>; <span class="comment">/* start of string to insert */</span> |
| <a name="l00157"></a><a class="code" href="structinternal__state.html#aced58a85c56daa1c5de41fa5ce75d2e8">00157</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#aced58a85c56daa1c5de41fa5ce75d2e8">match_start</a>; <span class="comment">/* start of matching string */</span> |
| <a name="l00158"></a><a class="code" href="structinternal__state.html#a3a826064126ee19a77f78919e2f9bb1e">00158</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a3a826064126ee19a77f78919e2f9bb1e">lookahead</a>; <span class="comment">/* number of valid bytes ahead in window */</span> |
| <a name="l00159"></a>00159 |
| <a name="l00160"></a><a class="code" href="structinternal__state.html#a7619fb70f9f66ff21b419b8ceac4904c">00160</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a7619fb70f9f66ff21b419b8ceac4904c">prev_length</a>; |
| <a name="l00161"></a>00161 <span class="comment">/* Length of the best match at previous step. Matches not greater than this</span> |
| <a name="l00162"></a>00162 <span class="comment"> * are discarded. This is used in the lazy match evaluation.</span> |
| <a name="l00163"></a>00163 <span class="comment"> */</span> |
| <a name="l00164"></a>00164 |
| <a name="l00165"></a><a class="code" href="structinternal__state.html#ab1ffa7feb159edec170574813fae3279">00165</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#ab1ffa7feb159edec170574813fae3279">max_chain_length</a>; |
| <a name="l00166"></a>00166 <span class="comment">/* To speed up deflation, hash chains are never searched beyond this</span> |
| <a name="l00167"></a>00167 <span class="comment"> * length. A higher limit improves compression ratio but degrades the</span> |
| <a name="l00168"></a>00168 <span class="comment"> * speed.</span> |
| <a name="l00169"></a>00169 <span class="comment"> */</span> |
| <a name="l00170"></a>00170 |
| <a name="l00171"></a><a class="code" href="structinternal__state.html#ab74215ec1c106bf588a7642927d47b84">00171</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#ab74215ec1c106bf588a7642927d47b84">max_lazy_match</a>; |
| <a name="l00172"></a>00172 <span class="comment">/* Attempt to find a better match only when the current match is strictly</span> |
| <a name="l00173"></a>00173 <span class="comment"> * smaller than this value. This mechanism is used only for compression</span> |
| <a name="l00174"></a>00174 <span class="comment"> * levels >= 4.</span> |
| <a name="l00175"></a>00175 <span class="comment"> */</span> |
| <a name="l00176"></a><a class="code" href="deflate_8h.html#a0aa718c141a5a98e84262fd9fc042dbe">00176</a> <span class="preprocessor"># define max_insert_length max_lazy_match</span> |
| <a name="l00177"></a>00177 <span class="preprocessor"></span> <span class="comment">/* Insert new strings in the hash table only if the match length is not</span> |
| <a name="l00178"></a>00178 <span class="comment"> * greater than this length. This saves time but degrades compression.</span> |
| <a name="l00179"></a>00179 <span class="comment"> * max_insert_length is used only for compression levels <= 3.</span> |
| <a name="l00180"></a>00180 <span class="comment"> */</span> |
| <a name="l00181"></a>00181 |
| <a name="l00182"></a><a class="code" href="structinternal__state.html#a7ad2ab1df80c8cab4ffb97ff84e88c62">00182</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#a7ad2ab1df80c8cab4ffb97ff84e88c62">level</a>; <span class="comment">/* compression level (1..9) */</span> |
| <a name="l00183"></a><a class="code" href="structinternal__state.html#a67219312df7fd2f86e06e6f14700eb28">00183</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#a67219312df7fd2f86e06e6f14700eb28">strategy</a>; <span class="comment">/* favor or force Huffman coding*/</span> |
| <a name="l00184"></a>00184 |
| <a name="l00185"></a><a class="code" href="structinternal__state.html#a68ba00254242017f330dca5e0191bca4">00185</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a68ba00254242017f330dca5e0191bca4">good_match</a>; |
| <a name="l00186"></a>00186 <span class="comment">/* Use a faster search when the previous match is longer than this */</span> |
| <a name="l00187"></a>00187 |
| <a name="l00188"></a><a class="code" href="structinternal__state.html#a39ab99e52138c0628f645bc1e0c69a04">00188</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#a39ab99e52138c0628f645bc1e0c69a04">nice_match</a>; <span class="comment">/* Stop searching when current match exceeds this */</span> |
| <a name="l00189"></a>00189 |
| <a name="l00190"></a>00190 <span class="comment">/* used by trees.c: */</span> |
| <a name="l00191"></a>00191 <span class="comment">/* Didn't use ct_data typedef below to supress compiler warning */</span> |
| <a name="l00192"></a><a class="code" href="structinternal__state.html#ae11867c05d54c575dbc713bbea71266c">00192</a> <span class="keyword">struct </span><a class="code" href="structct__data__s.html">ct_data_s</a> <a class="code" href="structinternal__state.html#ae11867c05d54c575dbc713bbea71266c">dyn_ltree</a>[<a class="code" href="deflate_8h.html#a1b45302695680930829cac31d65e41e1">HEAP_SIZE</a>]; <span class="comment">/* literal and length tree */</span> |
| <a name="l00193"></a><a class="code" href="structinternal__state.html#a42a52476d3cde41e57a6ef2a6a78008f">00193</a> <span class="keyword">struct </span><a class="code" href="structct__data__s.html">ct_data_s</a> <a class="code" href="structinternal__state.html#a42a52476d3cde41e57a6ef2a6a78008f">dyn_dtree</a>[2*<a class="code" href="deflate_8h.html#a8798a9a526623abbd88fedb0727e21aa">D_CODES</a>+1]; <span class="comment">/* distance tree */</span> |
| <a name="l00194"></a><a class="code" href="structinternal__state.html#a98131fc5b64d0d7542bc3621aef19854">00194</a> <span class="keyword">struct </span><a class="code" href="structct__data__s.html">ct_data_s</a> <a class="code" href="structinternal__state.html#a98131fc5b64d0d7542bc3621aef19854">bl_tree</a>[2*<a class="code" href="deflate_8h.html#a9e19158a493307d4f211cdf223da8319">BL_CODES</a>+1]; <span class="comment">/* Huffman tree for bit lengths */</span> |
| <a name="l00195"></a>00195 |
| <a name="l00196"></a><a class="code" href="structinternal__state.html#a0266c4e0250652904e6b4908d8da84a9">00196</a> <span class="keyword">struct </span><a class="code" href="structtree__desc__s.html">tree_desc_s</a> <a class="code" href="structinternal__state.html#a0266c4e0250652904e6b4908d8da84a9">l_desc</a>; <span class="comment">/* desc. for literal tree */</span> |
| <a name="l00197"></a><a class="code" href="structinternal__state.html#ab2fddb383d3055b6ec81c7fef14e99d8">00197</a> <span class="keyword">struct </span><a class="code" href="structtree__desc__s.html">tree_desc_s</a> <a class="code" href="structinternal__state.html#ab2fddb383d3055b6ec81c7fef14e99d8">d_desc</a>; <span class="comment">/* desc. for distance tree */</span> |
| <a name="l00198"></a><a class="code" href="structinternal__state.html#aa0e5da102c35a7e7d22dd1894039393b">00198</a> <span class="keyword">struct </span><a class="code" href="structtree__desc__s.html">tree_desc_s</a> <a class="code" href="structinternal__state.html#aa0e5da102c35a7e7d22dd1894039393b">bl_desc</a>; <span class="comment">/* desc. for bit length tree */</span> |
| <a name="l00199"></a>00199 |
| <a name="l00200"></a><a class="code" href="structinternal__state.html#abf9e786c8e5b4ab5d620ab123208034c">00200</a> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="structinternal__state.html#abf9e786c8e5b4ab5d620ab123208034c">bl_count</a>[<a class="code" href="deflate_8h.html#a51c241e7ad52441b8d4c1fd5f498b3b9">MAX_BITS</a>+1]; |
| <a name="l00201"></a>00201 <span class="comment">/* number of codes at each bit length for an optimal tree */</span> |
| <a name="l00202"></a>00202 |
| <a name="l00203"></a><a class="code" href="structinternal__state.html#ad7edb9b1d387e631bc6fde1cad0af758">00203</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#ad7edb9b1d387e631bc6fde1cad0af758">heap</a>[2*<a class="code" href="deflate_8h.html#a2b0cc00cc6a7d521fba8d208a1cae477">L_CODES</a>+1]; <span class="comment">/* heap used to build the Huffman trees */</span> |
| <a name="l00204"></a><a class="code" href="structinternal__state.html#a0659e23b0188ac16db58f98ae2b67b6b">00204</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#a0659e23b0188ac16db58f98ae2b67b6b">heap_len</a>; <span class="comment">/* number of elements in the heap */</span> |
| <a name="l00205"></a><a class="code" href="structinternal__state.html#aa8c78bbfa5d71f3ccc55445a62897f47">00205</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#aa8c78bbfa5d71f3ccc55445a62897f47">heap_max</a>; <span class="comment">/* element of largest frequency */</span> |
| <a name="l00206"></a>00206 <span class="comment">/* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.</span> |
| <a name="l00207"></a>00207 <span class="comment"> * The same heap array is used to build all trees.</span> |
| <a name="l00208"></a>00208 <span class="comment"> */</span> |
| <a name="l00209"></a>00209 |
| <a name="l00210"></a><a class="code" href="structinternal__state.html#a8e525b4f3dfa38b3bbcb8b427e333570">00210</a> <a class="code" href="zutil_8h.html#af3307af5922c72924a837559c801a8a4">uch</a> <a class="code" href="structinternal__state.html#a8e525b4f3dfa38b3bbcb8b427e333570">depth</a>[2*<a class="code" href="deflate_8h.html#a2b0cc00cc6a7d521fba8d208a1cae477">L_CODES</a>+1]; |
| <a name="l00211"></a>00211 <span class="comment">/* Depth of each subtree used as tie breaker for trees of equal frequency</span> |
| <a name="l00212"></a>00212 <span class="comment"> */</span> |
| <a name="l00213"></a>00213 |
| <a name="l00214"></a><a class="code" href="structinternal__state.html#a5e6c4269e29696b192e02fd01381e400">00214</a> <a class="code" href="zutil_8h.html#aaa6fdf02a2fdaf3731f17a19920ddb0b">uchf</a> *<a class="code" href="structinternal__state.html#a5e6c4269e29696b192e02fd01381e400">l_buf</a>; <span class="comment">/* buffer for literals or lengths */</span> |
| <a name="l00215"></a>00215 |
| <a name="l00216"></a><a class="code" href="structinternal__state.html#a25ad7fc0094e412144b4201df2126bbb">00216</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a25ad7fc0094e412144b4201df2126bbb">lit_bufsize</a>; |
| <a name="l00217"></a>00217 <span class="comment">/* Size of match buffer for literals/lengths. There are 4 reasons for</span> |
| <a name="l00218"></a>00218 <span class="comment"> * limiting lit_bufsize to 64K:</span> |
| <a name="l00219"></a>00219 <span class="comment"> * - frequencies can be kept in 16 bit counters</span> |
| <a name="l00220"></a>00220 <span class="comment"> * - if compression is not successful for the first block, all input</span> |
| <a name="l00221"></a>00221 <span class="comment"> * data is still in the window so we can still emit a stored block even</span> |
| <a name="l00222"></a>00222 <span class="comment"> * when input comes from standard input. (This can also be done for</span> |
| <a name="l00223"></a>00223 <span class="comment"> * all blocks if lit_bufsize is not greater than 32K.)</span> |
| <a name="l00224"></a>00224 <span class="comment"> * - if compression is not successful for a file smaller than 64K, we can</span> |
| <a name="l00225"></a>00225 <span class="comment"> * even emit a stored file instead of a stored block (saving 5 bytes).</span> |
| <a name="l00226"></a>00226 <span class="comment"> * This is applicable only for zip (not gzip or zlib).</span> |
| <a name="l00227"></a>00227 <span class="comment"> * - creating new Huffman trees less frequently may not provide fast</span> |
| <a name="l00228"></a>00228 <span class="comment"> * adaptation to changes in the input data statistics. (Take for</span> |
| <a name="l00229"></a>00229 <span class="comment"> * example a binary file with poorly compressible code followed by</span> |
| <a name="l00230"></a>00230 <span class="comment"> * a highly compressible string table.) Smaller buffer sizes give</span> |
| <a name="l00231"></a>00231 <span class="comment"> * fast adaptation but have of course the overhead of transmitting</span> |
| <a name="l00232"></a>00232 <span class="comment"> * trees more frequently.</span> |
| <a name="l00233"></a>00233 <span class="comment"> * - I can't count above 4</span> |
| <a name="l00234"></a>00234 <span class="comment"> */</span> |
| <a name="l00235"></a>00235 |
| <a name="l00236"></a><a class="code" href="structinternal__state.html#a01689001a8f8c7dfa46a439b7ae0708a">00236</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#a01689001a8f8c7dfa46a439b7ae0708a">last_lit</a>; <span class="comment">/* running index in l_buf */</span> |
| <a name="l00237"></a>00237 |
| <a name="l00238"></a><a class="code" href="structinternal__state.html#ac636c34c1c08dc9d2f9c199ce2caa99d">00238</a> <a class="code" href="zutil_8h.html#ab854e4722acf30ada8a7a71b58d1b238">ushf</a> *<a class="code" href="structinternal__state.html#ac636c34c1c08dc9d2f9c199ce2caa99d">d_buf</a>; |
| <a name="l00239"></a>00239 <span class="comment">/* Buffer for distances. To simplify the code, d_buf and l_buf have</span> |
| <a name="l00240"></a>00240 <span class="comment"> * the same number of elements. To use different lengths, an extra flag</span> |
| <a name="l00241"></a>00241 <span class="comment"> * array would be necessary.</span> |
| <a name="l00242"></a>00242 <span class="comment"> */</span> |
| <a name="l00243"></a>00243 |
| <a name="l00244"></a><a class="code" href="structinternal__state.html#a2f6efee5d2057aba8bca2c1a58cf418a">00244</a> <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> <a class="code" href="structinternal__state.html#a2f6efee5d2057aba8bca2c1a58cf418a">opt_len</a>; <span class="comment">/* bit length of current block with optimal trees */</span> |
| <a name="l00245"></a><a class="code" href="structinternal__state.html#a8a83e269866761afa3a7b4641ba5ff91">00245</a> <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> <a class="code" href="structinternal__state.html#a8a83e269866761afa3a7b4641ba5ff91">static_len</a>; <span class="comment">/* bit length of current block with static trees */</span> |
| <a name="l00246"></a><a class="code" href="structinternal__state.html#ac0f10ec7237615f6b632f2f4d14872ef">00246</a> <a class="code" href="zconf_8h.html#a87d141052bcd5ec8a80812a565c70369">uInt</a> <a class="code" href="structinternal__state.html#ac0f10ec7237615f6b632f2f4d14872ef">matches</a>; <span class="comment">/* number of string matches in current block */</span> |
| <a name="l00247"></a><a class="code" href="structinternal__state.html#abf71c5672f4fce10f6f6a99eb30f72e1">00247</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#abf71c5672f4fce10f6f6a99eb30f72e1">last_eob_len</a>; <span class="comment">/* bit length of EOB code for last block */</span> |
| <a name="l00248"></a>00248 |
| <a name="l00249"></a>00249 <span class="preprocessor">#ifdef DEBUG</span> |
| <a name="l00250"></a>00250 <span class="preprocessor"></span> <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> compressed_len; <span class="comment">/* total bit length of compressed file mod 2^32 */</span> |
| <a name="l00251"></a>00251 <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> bits_sent; <span class="comment">/* bit length of compressed data sent mod 2^32 */</span> |
| <a name="l00252"></a>00252 <span class="preprocessor">#endif</span> |
| <a name="l00253"></a>00253 <span class="preprocessor"></span> |
| <a name="l00254"></a><a class="code" href="structinternal__state.html#a6880946d081053778f5f544b04603d13">00254</a> <a class="code" href="zutil_8h.html#a3754180d606d4ed15468d15d9665aa2e">ush</a> <a class="code" href="structinternal__state.html#a6880946d081053778f5f544b04603d13">bi_buf</a>; |
| <a name="l00255"></a>00255 <span class="comment">/* Output buffer. bits are inserted starting at the bottom (least</span> |
| <a name="l00256"></a>00256 <span class="comment"> * significant bits).</span> |
| <a name="l00257"></a>00257 <span class="comment"> */</span> |
| <a name="l00258"></a><a class="code" href="structinternal__state.html#a241f3606e41a3aa0ef22868a41bd9a0f">00258</a> <span class="keywordtype">int</span> <a class="code" href="structinternal__state.html#a241f3606e41a3aa0ef22868a41bd9a0f">bi_valid</a>; |
| <a name="l00259"></a>00259 <span class="comment">/* Number of valid bits in bi_buf. All bits above the last valid bit</span> |
| <a name="l00260"></a>00260 <span class="comment"> * are always zero.</span> |
| <a name="l00261"></a>00261 <span class="comment"> */</span> |
| <a name="l00262"></a>00262 |
| <a name="l00263"></a><a class="code" href="structinternal__state.html#a85439cd585435b2590039339139d25cb">00263</a> <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> <a class="code" href="structinternal__state.html#a85439cd585435b2590039339139d25cb">high_water</a>; |
| <a name="l00264"></a>00264 <span class="comment">/* High water mark offset in window for initialized bytes -- bytes above</span> |
| <a name="l00265"></a>00265 <span class="comment"> * this are set to zero in order to avoid memory check warnings when</span> |
| <a name="l00266"></a>00266 <span class="comment"> * longest match routines access bytes past the input. This is then</span> |
| <a name="l00267"></a>00267 <span class="comment"> * updated to the new high water mark.</span> |
| <a name="l00268"></a>00268 <span class="comment"> */</span> |
| <a name="l00269"></a>00269 |
| <a name="l00270"></a>00270 } <a class="code" href="zconf_8h.html#aef060b3456fdcc093a7210a762d5f2ed">FAR</a> <a class="code" href="deflate_8h.html#aeaabc84f4830ec10deb9b64bd719617a">deflate_state</a>; |
| <a name="l00271"></a>00271 |
| <a name="l00272"></a>00272 <span class="comment">/* Output a byte on the stream.</span> |
| <a name="l00273"></a>00273 <span class="comment"> * IN assertion: there is enough room in pending_buf.</span> |
| <a name="l00274"></a>00274 <span class="comment"> */</span> |
| <a name="l00275"></a><a class="code" href="deflate_8h.html#a662a0774c0de95a9f1309019d52e914b">00275</a> <span class="preprocessor">#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}</span> |
| <a name="l00276"></a>00276 <span class="preprocessor"></span> |
| <a name="l00277"></a>00277 |
| <a name="l00278"></a><a class="code" href="deflate_8h.html#aab627bcc7d38e658a93d395c50180cb8">00278</a> <span class="preprocessor">#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)</span> |
| <a name="l00279"></a>00279 <span class="preprocessor"></span><span class="comment">/* Minimum amount of lookahead, except at the end of the input file.</span> |
| <a name="l00280"></a>00280 <span class="comment"> * See deflate.c for comments about the MIN_MATCH+1.</span> |
| <a name="l00281"></a>00281 <span class="comment"> */</span> |
| <a name="l00282"></a>00282 |
| <a name="l00283"></a><a class="code" href="deflate_8h.html#a1bac515806be1e59d7306b4126b0cca4">00283</a> <span class="preprocessor">#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)</span> |
| <a name="l00284"></a>00284 <span class="preprocessor"></span><span class="comment">/* In order to simplify the code, particularly on 16 bit machines, match</span> |
| <a name="l00285"></a>00285 <span class="comment"> * distances are limited to MAX_DIST instead of WSIZE.</span> |
| <a name="l00286"></a>00286 <span class="comment"> */</span> |
| <a name="l00287"></a>00287 |
| <a name="l00288"></a><a class="code" href="deflate_8h.html#ac2836f69eb1551bb9699e4dd87dfbdc0">00288</a> <span class="preprocessor">#define WIN_INIT MAX_MATCH</span> |
| <a name="l00289"></a>00289 <span class="preprocessor"></span><span class="comment">/* Number of bytes after end of data in window to initialize in order to avoid</span> |
| <a name="l00290"></a>00290 <span class="comment"> memory checker errors from longest match routines */</span> |
| <a name="l00291"></a>00291 |
| <a name="l00292"></a>00292 <span class="comment">/* in trees.c */</span> |
| <a name="l00293"></a>00293 <span class="keywordtype">void</span> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _tr_init <a class="code" href="zconf_8h.html#aa6c3c093d0900e1d96d07c91b53c1b5d">OF</a>((<a class="code" href="structinternal__state.html">deflate_state</a> *s)); |
| <a name="l00294"></a>00294 <span class="keywordtype">int</span> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _tr_tally <a class="code" href="zconf_8h.html#aa6c3c093d0900e1d96d07c91b53c1b5d">OF</a>((<a class="code" href="structinternal__state.html">deflate_state</a> *s, <span class="keywordtype">unsigned</span> dist, <span class="keywordtype">unsigned</span> lc)); |
| <a name="l00295"></a>00295 <span class="keywordtype">void</span> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _tr_flush_block <a class="code" href="zconf_8h.html#aa6c3c093d0900e1d96d07c91b53c1b5d">OF</a>((<a class="code" href="structinternal__state.html">deflate_state</a> *s, <a class="code" href="zconf_8h.html#a0f3f92a9c02f6f688bf081aabf230212">charf</a> *buf, |
| <a name="l00296"></a>00296 <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> stored_len, <span class="keywordtype">int</span> last)); |
| <a name="l00297"></a>00297 <span class="keywordtype">void</span> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _tr_align <a class="code" href="zconf_8h.html#aa6c3c093d0900e1d96d07c91b53c1b5d">OF</a>((<a class="code" href="structinternal__state.html">deflate_state</a> *s)); |
| <a name="l00298"></a>00298 <span class="keywordtype">void</span> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _tr_stored_block <a class="code" href="zconf_8h.html#aa6c3c093d0900e1d96d07c91b53c1b5d">OF</a>((<a class="code" href="structinternal__state.html">deflate_state</a> *s, <a class="code" href="zconf_8h.html#a0f3f92a9c02f6f688bf081aabf230212">charf</a> *buf, |
| <a name="l00299"></a>00299 <a class="code" href="zutil_8h.html#abd6f60bf9450af2ecb94097a32c19a64">ulg</a> stored_len, <span class="keywordtype">int</span> last)); |
| <a name="l00300"></a>00300 |
| <a name="l00301"></a><a class="code" href="deflate_8h.html#a578b4336ef92d19278e0a0d95699def5">00301</a> <span class="preprocessor">#define d_code(dist) \</span> |
| <a name="l00302"></a>00302 <span class="preprocessor"> ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])</span> |
| <a name="l00303"></a>00303 <span class="preprocessor"></span><span class="comment">/* Mapping from a distance to a distance code. dist is the distance - 1 and</span> |
| <a name="l00304"></a>00304 <span class="comment"> * must not have side effects. _dist_code[256] and _dist_code[257] are never</span> |
| <a name="l00305"></a>00305 <span class="comment"> * used.</span> |
| <a name="l00306"></a>00306 <span class="comment"> */</span> |
| <a name="l00307"></a>00307 |
| <a name="l00308"></a>00308 <span class="preprocessor">#ifndef DEBUG</span> |
| <a name="l00309"></a>00309 <span class="preprocessor"></span><span class="comment">/* Inline versions of _tr_tally for speed: */</span> |
| <a name="l00310"></a>00310 |
| <a name="l00311"></a>00311 <span class="preprocessor">#if defined(GEN_TREES_H) || !defined(STDC)</span> |
| <a name="l00312"></a>00312 <span class="preprocessor"></span> <span class="keyword">extern</span> <a class="code" href="zutil_8h.html#af3307af5922c72924a837559c801a8a4">uch</a> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> <a class="code" href="deflate_8h.html#ac88cdfc823257dd30e51939e7f2e18d5">_length_code</a>[]; |
| <a name="l00313"></a>00313 <span class="keyword">extern</span> <a class="code" href="zutil_8h.html#af3307af5922c72924a837559c801a8a4">uch</a> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> <a class="code" href="deflate_8h.html#af6c8544687b8a2a44e9638c796dce61e">_dist_code</a>[]; |
| <a name="l00314"></a>00314 <span class="preprocessor">#else</span> |
| <a name="l00315"></a>00315 <span class="preprocessor"></span> <span class="keyword">extern</span> <span class="keyword">const</span> <a class="code" href="zutil_8h.html#af3307af5922c72924a837559c801a8a4">uch</a> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _length_code[]; |
| <a name="l00316"></a>00316 <span class="keyword">extern</span> <span class="keyword">const</span> <a class="code" href="zutil_8h.html#af3307af5922c72924a837559c801a8a4">uch</a> <a class="code" href="gzguts_8h.html#a59d4d7ef4d73655c759211ec33a5d44f">ZLIB_INTERNAL</a> _dist_code[]; |
| <a name="l00317"></a>00317 <span class="preprocessor">#endif</span> |
| <a name="l00318"></a>00318 <span class="preprocessor"></span> |
| <a name="l00319"></a><a class="code" href="deflate_8h.html#af3b11322da0fb4ec60a5ccc28e2554df">00319</a> <span class="preprocessor"># define _tr_tally_lit(s, c, flush) \</span> |
| <a name="l00320"></a>00320 <span class="preprocessor"> { uch cc = (c); \</span> |
| <a name="l00321"></a>00321 <span class="preprocessor"> s->d_buf[s->last_lit] = 0; \</span> |
| <a name="l00322"></a>00322 <span class="preprocessor"> s->l_buf[s->last_lit++] = cc; \</span> |
| <a name="l00323"></a>00323 <span class="preprocessor"> s->dyn_ltree[cc].Freq++; \</span> |
| <a name="l00324"></a>00324 <span class="preprocessor"> flush = (s->last_lit == s->lit_bufsize-1); \</span> |
| <a name="l00325"></a>00325 <span class="preprocessor"> }</span> |
| <a name="l00326"></a><a class="code" href="deflate_8h.html#a68f55cdd396ad603d9f0b01afdbdf592">00326</a> <span class="preprocessor"></span><span class="preprocessor"># define _tr_tally_dist(s, distance, length, flush) \</span> |
| <a name="l00327"></a>00327 <span class="preprocessor"> { uch len = (length); \</span> |
| <a name="l00328"></a>00328 <span class="preprocessor"> ush dist = (distance); \</span> |
| <a name="l00329"></a>00329 <span class="preprocessor"> s->d_buf[s->last_lit] = dist; \</span> |
| <a name="l00330"></a>00330 <span class="preprocessor"> s->l_buf[s->last_lit++] = len; \</span> |
| <a name="l00331"></a>00331 <span class="preprocessor"> dist--; \</span> |
| <a name="l00332"></a>00332 <span class="preprocessor"> s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \</span> |
| <a name="l00333"></a>00333 <span class="preprocessor"> s->dyn_dtree[d_code(dist)].Freq++; \</span> |
| <a name="l00334"></a>00334 <span class="preprocessor"> flush = (s->last_lit == s->lit_bufsize-1); \</span> |
| <a name="l00335"></a>00335 <span class="preprocessor"> }</span> |
| <a name="l00336"></a>00336 <span class="preprocessor"></span><span class="preprocessor">#else</span> |
| <a name="l00337"></a>00337 <span class="preprocessor"></span><span class="preprocessor"># define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)</span> |
| <a name="l00338"></a>00338 <span class="preprocessor"></span><span class="preprocessor"># define _tr_tally_dist(s, distance, length, flush) \</span> |
| <a name="l00339"></a>00339 <span class="preprocessor"> flush = _tr_tally(s, distance, length)</span> |
| <a name="l00340"></a>00340 <span class="preprocessor"></span><span class="preprocessor">#endif</span> |
| <a name="l00341"></a>00341 <span class="preprocessor"></span> |
| <a name="l00342"></a>00342 <span class="preprocessor">#endif </span><span class="comment">/* DEFLATE_H */</span> |
| </pre></div></div> |
| </div> |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="deflate_8h.html">deflate.h</a> </li> |
| <li class="footer">Generated on Tue Apr 12 2011 for activemq-cpp-3.3.0 by  |
| <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li> |
| </ul> |
| </div> |
| |
| </body> |
| </html> |
