ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/liblzf/lzfP.h
(Generate patch)

Comparing liblzf/lzfP.h (file contents):
Revision 1.16 by root, Fri Nov 2 12:39:20 2007 UTC vs.
Revision 1.25 by root, Fri Mar 4 16:42:21 2011 UTC

… …
21 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- 21 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
22 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED 22 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
23 * OF THE POSSIBILITY OF SUCH DAMAGE. 23 * OF THE POSSIBILITY OF SUCH DAMAGE.
24 * 24 *
25 * Alternatively, the contents of this file may be used under the terms of 25 * Alternatively, the contents of this file may be used under the terms of
26 * the GNU General Public License version 2 (the "GPL"), in which case the 26 * the GNU General Public License ("GPL") version 2 or any later version,
27 * provisions of the GPL are applicable instead of the above. If you wish to 27 * in which case the provisions of the GPL are applicable instead of
28 * allow the use of your version of this file only under the terms of the 28 * the above. If you wish to allow the use of your version of this file
29 * GPL and not to allow others to use your version of this file under the 29 * only under the terms of the GPL and not to allow others to use your
30 * BSD license, indicate your decision by deleting the provisions above and 30 * version of this file under the BSD license, indicate your decision
31 * replace them with the notice and other provisions required by the GPL. If 31 * by deleting the provisions above and replace them with the notice
32 * you do not delete the provisions above, a recipient may use your version 32 * and other provisions required by the GPL. If you do not delete the
33 * provisions above, a recipient may use your version of this file under
33 * of this file under either the BSD or the GPL. 34 * either the BSD or the GPL.
34 */ 35 */
35 36
36#ifndef LZFP_h 37#ifndef LZFP_h
37#define LZFP_h 38#define LZFP_h
38 39
… …
46 * Size of hashtable is (1 << HLOG) * sizeof (char *) 47 * Size of hashtable is (1 << HLOG) * sizeof (char *)
47 * decompression is independent of the hash table size 48 * decompression is independent of the hash table size
48 * the difference between 15 and 14 is very small 49 * the difference between 15 and 14 is very small
49 * for small blocks (and 14 is usually a bit faster). 50 * for small blocks (and 14 is usually a bit faster).
50 * For a low-memory/faster configuration, use HLOG == 13; 51 * For a low-memory/faster configuration, use HLOG == 13;
51 * For best compression, use 15 or 16 (or more). 52 * For best compression, use 15 or 16 (or more, up to 22).
52 */ 53 */
53#ifndef HLOG 54#ifndef HLOG
54# define HLOG 15 55# define HLOG 16
55#endif 56#endif
56 57
57/* 58/*
58 * Sacrifice very little compression quality in favour of compression speed. 59 * Sacrifice very little compression quality in favour of compression speed.
59 * This gives almost the same compression as the default code, and is 60 * This gives almost the same compression as the default code, and is
60 * (very roughly) 15% faster. This is the preferable mode of operation. 61 * (very roughly) 15% faster. This is the preferred mode of operation.
61 */ 62 */
62
63#ifndef VERY_FAST 63#ifndef VERY_FAST
64# define VERY_FAST 1 64# define VERY_FAST 1
65#endif 65#endif
66 66
67/* 67/*
… …
91# define INIT_HTAB 0 91# define INIT_HTAB 0
92#endif 92#endif
93 93
94/* 94/*
95 * Avoid assigning values to errno variable? for some embedding purposes 95 * Avoid assigning values to errno variable? for some embedding purposes
96 * (linux kernel for example), this is neccessary. NOTE: this breaks 96 * (linux kernel for example), this is necessary. NOTE: this breaks
97 * the documentation in lzf.h. 97 * the documentation in lzf.h. Avoiding errno has no speed impact.
98 */ 98 */
99#ifndef AVOID_ERRNO 99#ifndef AVOID_ERRNO
100# define AVOID_ERRNO 0 100# define AVOID_ERRNO 0
101#endif 101#endif
102 102
103/* 103/*
104 * Wether to pass the LZF_STATE variable as argument, or allocate it 104 * Whether to pass the LZF_STATE variable as argument, or allocate it
105 * on the stack. For small-stack environments, define this to 1. 105 * on the stack. For small-stack environments, define this to 1.
106 * NOTE: this breaks the prototype in lzf.h. 106 * NOTE: this breaks the prototype in lzf.h.
107 */ 107 */
108#ifndef LZF_STATE_ARG 108#ifndef LZF_STATE_ARG
109# define LZF_STATE_ARG 0 109# define LZF_STATE_ARG 0
110#endif 110#endif
111 111
112/* 112/*
113 * Wether to add extra checks for input validity in lzf_decompress 113 * Whether to add extra checks for input validity in lzf_decompress
114 * and return EINVAL if the input stream has been corrupted. This 114 * and return EINVAL if the input stream has been corrupted. This
115 * only shields against overflowing the input buffer and will not 115 * only shields against overflowing the input buffer and will not
116 * detect most corrupted streams. 116 * detect most corrupted streams.
117 * This check is not normally noticable on modern hardware 117 * This check is not normally noticeable on modern hardware
118 * (<1% slowdown), but might slow down older cpus considerably. 118 * (<1% slowdown), but might slow down older cpus considerably.
119 */ 119 */
120#ifndef CHECK_INPUT 120#ifndef CHECK_INPUT
121# define CHECK_INPUT 1 121# define CHECK_INPUT 1
122#endif 122#endif
123 123
124/*
125 * Whether to store pointers or offsets inside the hash table. On
126 * 64 bit architetcures, pointers take up twice as much space,
127 * and might also be slower. Default is to autodetect.
128 */
129/*#define LZF_USER_OFFSETS autodetect */
130
124/*****************************************************************************/ 131/*****************************************************************************/
125/* nothing should be changed below */ 132/* nothing should be changed below */
126 133
134#ifdef __cplusplus
135# include <cstring>
136# include <climits>
137using namespace std;
138#else
139# include <string.h>
140# include <limits.h>
141#endif
142
143#ifndef LZF_USE_OFFSETS
144# if defined (WIN32) || defined (_WIN32)
145# define LZF_USE_OFFSETS defined(_M_X64)
146# else
147# if __cplusplus > 199711L
148# include <cstdint>
149# else
150# include <stdint.h>
151# endif
152# define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
153# endif
154#endif
155
127typedef unsigned char u8; 156typedef unsigned char u8;
128 157
158#if LZF_USE_OFFSETS
159# define LZF_HSLOT_BIAS ((const u8 *)in_data)
160 typedef unsigned int LZF_HSLOT;
161#else
162# define LZF_HSLOT_BIAS 0
163 typedef const u8 *LZF_HSLOT;
164#endif
165
129typedef const u8 *LZF_STATE[1 << (HLOG)]; 166typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
130 167
131#if !STRICT_ALIGN 168#if !STRICT_ALIGN
132/* for unaligned accesses we need a 16 bit datatype. */ 169/* for unaligned accesses we need a 16 bit datatype. */
133# include <limits.h>
134# if USHRT_MAX == 65535 170# if USHRT_MAX == 65535
135 typedef unsigned short u16; 171 typedef unsigned short u16;
136# elif UINT_MAX == 65535 172# elif UINT_MAX == 65535
137 typedef unsigned int u16; 173 typedef unsigned int u16;
138# else 174# else
… …
140# define STRICT_ALIGN 1 176# define STRICT_ALIGN 1
141# endif 177# endif
142#endif 178#endif
143 179
144#if ULTRA_FAST 180#if ULTRA_FAST
145# if defined(VERY_FAST)
146# undef VERY_FAST 181# undef VERY_FAST
147# endif
148#endif
149
150#if INIT_HTAB
151# ifdef __cplusplus
152# include <cstring>
153# else
154# include <string.h>
155# endif
156#endif 182#endif
157 183
158#endif 184#endif
159 185

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines