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

Comparing liblzf/lzfP.h (file contents):
Revision 1.6 by pcg, Tue Dec 23 04:58:04 2003 UTC vs.
Revision 1.29 by root, Mon Dec 10 20:21:28 2012 UTC

1/* 1/*
2 * Copyright (c) 2000-2003 Marc Alexander Lehmann <pcg@goof.com> 2 * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
3 * 3 *
4 * Redistribution and use in source and binary forms, with or without modifica- 4 * Redistribution and use in source and binary forms, with or without modifica-
5 * tion, are permitted provided that the following conditions are met: 5 * tion, are permitted provided that the following conditions are met:
6 * 6 *
7 * 1. Redistributions of source code must retain the above copyright notice, 7 * 1. Redistributions of source code must retain the above copyright notice,
8 * this list of conditions and the following disclaimer. 8 * this list of conditions and the following disclaimer.
9 * 9 *
10 * 2. Redistributions in binary form must reproduce the above copyright 10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the 11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution. 12 * documentation and/or other materials provided with the distribution.
13 * 13 *
14 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- 15 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 16 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- 17 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 18 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 20 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- 21 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25 * 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
26 * OF THE POSSIBILITY OF SUCH DAMAGE. 23 * OF THE POSSIBILITY OF SUCH DAMAGE.
24 *
25 * Alternatively, the contents of this file may be used under the terms of
26 * the GNU General Public License ("GPL") version 2 or any later version,
27 * in which case the provisions of the GPL are applicable instead of
28 * the above. If you wish to allow the use of your version of this file
29 * only under the terms of the GPL and not to allow others to use your
30 * version of this file under the BSD license, indicate your decision
31 * by deleting the provisions above and replace them with the notice
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
34 * either the BSD or the GPL.
27 */ 35 */
28 36
29#ifndef LZFP_h 37#ifndef LZFP_h
30#define LZFP_h 38#define LZFP_h
31 39
32#define STANDALONE /* at the moment, this is ok. */ 40#define STANDALONE 1 /* at the moment, this is ok. */
33 41
34#ifndef STANDALONE 42#ifndef STANDALONE
35# include "lzf.h" 43# include "lzf.h"
36#endif 44#endif
37 45
38/* 46/*
39 * size of hashtable is (1 << HLOG) * sizeof (char *) 47 * Size of hashtable is (1 << HLOG) * sizeof (char *)
40 * decompression is independent of the hash table size 48 * decompression is independent of the hash table size
41 * the difference between 15 and 14 is very small 49 * the difference between 15 and 14 is very small
42 * for small blocks (and 14 is also faster). 50 * for small blocks (and 14 is usually a bit faster).
43 * For a low-memory configuration, use HLOG == 13; 51 * For a low-memory/faster configuration, use HLOG == 13;
44 * For best compression, use 15 or 16. 52 * For best compression, use 15 or 16 (or more, up to 22).
45 */ 53 */
46#ifndef HLOG 54#ifndef HLOG
47# define HLOG 14 55# define HLOG 16
48#endif 56#endif
49 57
50/* 58/*
59 * Sacrifice very little compression quality in favour of compression speed.
60 * This gives almost the same compression as the default code, and is
61 * (very roughly) 15% faster. This is the preferred mode of operation.
62 */
63#ifndef VERY_FAST
64# define VERY_FAST 1
65#endif
66
67/*
51 * sacrifice some compression quality in favour of compression speed. 68 * Sacrifice some more compression quality in favour of compression speed.
52 * (roughly 1-2% worse compression for large blocks and 69 * (roughly 1-2% worse compression for large blocks and
53 * 9-10% for small, redundant, blocks and >>20% better speed in both cases) 70 * 9-10% for small, redundant, blocks and >>20% better speed in both cases)
54 * In short: enable this for binary data, disable this for text data. 71 * In short: when in need for speed, enable this for binary data,
72 * possibly disable this for text data.
55 */ 73 */
56#ifndef ULTRA_FAST 74#ifndef ULTRA_FAST
57# define ULTRA_FAST 1 75# define ULTRA_FAST 0
58#endif 76#endif
59 77
60/* 78/*
61 * unconditionally aligning does not cost very much, so do it if unsure 79 * Unconditionally aligning does not cost very much, so do it if unsure
62 */ 80 */
63#ifndef STRICT_ALIGN 81#ifndef STRICT_ALIGN
64# define STRICT_ALIGN !defined(__i386) 82# define STRICT_ALIGN !(defined(__i386) || defined (__amd64))
65#endif 83#endif
66 84
67/* 85/*
68 * use string functions to copy memory.
69 * this is usually a loss, even with glibc's optimized memcpy
70 */
71#ifndef USE_MEMCPY
72# define USE_MEMCPY 0
73#endif
74
75/*
76 * you may choose to pre-set the hash table (might be faster on modern cpus 86 * You may choose to pre-set the hash table (might be faster on some
77 * and large (>>64k) blocks) 87 * modern cpus and large (>>64k) blocks, and also makes compression
88 * deterministic/repeatable when the configuration otherwise is the same).
78 */ 89 */
79#ifndef INIT_HTAB 90#ifndef INIT_HTAB
80# define INIT_HTAB 0 91# define INIT_HTAB 1
81#endif 92#endif
82 93
83/* 94/*
84 * avoid assigning values to errno variable? for some embedding purposes 95 * Avoid assigning values to errno variable? for some embedding purposes
85 * (linux kernel for example), this is neccessary. NOTE: this breaks 96 * (linux kernel for example), this is necessary. NOTE: this breaks
86 * the documentation in lzf.h. 97 * the documentation in lzf.h. Avoiding errno has no speed impact.
87 */ 98 */
88#ifndef AVOID_ERRNO 99#ifndef AVOID_ERRNO
89# define AVOID_ERRNO 0 100# define AVOID_ERRNO 0
90#endif 101#endif
91 102
92/* 103/*
93 * 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
94 * on the stack. For small-stack environments, define this to zero. 105 * on the stack. For small-stack environments, define this to 1.
95 * NOTE: this breaks the prototype in lzf.h. 106 * NOTE: this breaks the prototype in lzf.h.
96 */ 107 */
97#ifndef LZF_STATE_ARG 108#ifndef LZF_STATE_ARG
98# define LZF_STATE_ARG 1 109# define LZF_STATE_ARG 0
99#endif 110#endif
111
112/*
113 * Whether to add extra checks for input validity in lzf_decompress
114 * and return EINVAL if the input stream has been corrupted. This
115 * only shields against overflowing the input buffer and will not
116 * detect most corrupted streams.
117 * This check is not normally noticeable on modern hardware
118 * (<1% slowdown), but might slow down older cpus considerably.
119 */
120#ifndef CHECK_INPUT
121# define CHECK_INPUT 1
122#endif
123
124/*
125 * Whether the target CPU has a slow multiplication. This affects
126 * the default hash function for the compressor, and enables a slightly
127 * worse hash function that needs only shifts.
128 */
129#ifndef MULTIPLICATION_IS_SLOW
130# define MULTIPLICATION_IS_SLOW 0
131#endif
132
133/*
134 * If defined, then this data type will be used for storing offsets.
135 * This can be useful if you want to use a huge hashtable, want to
136 * conserve memory, or both, and your data fits into e.g. 64kb.
137 * If instead you want to compress data > 4GB, then it's better to
138 * to "#define LZF_USE_OFFSETS 0" instead.
139 */
140/*#define LZF_HSLOT unsigned short*/
141
142/*
143 * Whether to store pointers or offsets inside the hash table. On
144 * 64 bit architetcures, pointers take up twice as much space,
145 * and might also be slower. Default is to autodetect.
146 */
147/*#define LZF_USE_OFFSETS autodetect */
100 148
101/*****************************************************************************/ 149/*****************************************************************************/
102/* nothing should be changed below */ 150/* nothing should be changed below */
103 151
152#ifdef __cplusplus
153# include <cstring>
154# include <climits>
155using namespace std;
156#else
157# include <string.h>
158# include <limits.h>
159#endif
160
161#ifndef LZF_USE_OFFSETS
162# ifdef _WIN32
163# define LZF_USE_OFFSETS defined(_M_X64)
164# else
165# if __cplusplus > 199711L
166# include <cstdint>
167# else
168# include <stdint.h>
169# endif
170# define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
171# endif
172#endif
173
104typedef unsigned char u8; 174typedef unsigned char u8;
105 175
106typedef const u8 *LZF_STATE[1 << (HLOG)]; 176#ifdef LZF_HSLOT
107 177# define LZF_HSLOT_BIAS ((const u8 *)in_data)
108#if !STRICT_ALIGN 178#else
109/* for unaligned accesses we need a 16 bit datatype. */ 179# if LZF_USE_OFFSETS
110# include <limits.h> 180# define LZF_HSLOT_BIAS ((const u8 *)in_data)
111# if USHRT_MAX == 65535
112 typedef unsigned short u16;
113# elif UINT_MAX == 65535
114 typedef unsigned int u16; 181 typedef unsigned int LZF_HSLOT;
115# else 182# else
116# undef STRICT_ALIGN 183# define LZF_HSLOT_BIAS 0
117# define STRICT_ALIGN 1 184 typedef const u8 *LZF_HSLOT;
118# endif 185# endif
119#endif 186#endif
120 187
121#if USE_MEMCPY || INIT_HTAB 188typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
122# include <string.h>
123#endif
124 189
190#if USHRT_MAX == 65535
191 typedef unsigned short u16;
192#elif UINT_MAX == 65535
193 typedef unsigned int u16;
194#else
195# undef STRICT_ALIGN
196# define STRICT_ALIGN 1
125#endif 197#endif
126 198
199#if ULTRA_FAST
200# undef VERY_FAST
201#endif
202
203#endif
204

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines