| 1 | /* |
1 | /* |
| 2 | * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de> |
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, |
| … | |
… | |
| 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. |
| 27 | * |
24 | * |
| 28 | * 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 |
| 29 | * 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, |
| 30 | * 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 |
| 31 | * 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 |
| 32 | * 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 |
| 33 | * BSD license, indicate your decision by deleting the provisions above and |
30 | * version of this file under the BSD license, indicate your decision |
| 34 | * 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 |
| 35 | * 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 |
| 36 | * of this file under either the BSD or the GPL. |
34 | * either the BSD or the GPL. |
| 37 | */ |
35 | */ |
| 38 | |
36 | |
| 39 | #ifndef LZFP_h |
37 | #ifndef LZFP_h |
| 40 | #define LZFP_h |
38 | #define LZFP_h |
| 41 | |
39 | |
| … | |
… | |
| 44 | #ifndef STANDALONE |
42 | #ifndef STANDALONE |
| 45 | # include "lzf.h" |
43 | # include "lzf.h" |
| 46 | #endif |
44 | #endif |
| 47 | |
45 | |
| 48 | /* |
46 | /* |
| 49 | * size of hashtable is (1 << HLOG) * sizeof (char *) |
47 | * Size of hashtable is (1 << HLOG) * sizeof (char *) |
| 50 | * decompression is independent of the hash table size |
48 | * decompression is independent of the hash table size |
| 51 | * the difference between 15 and 14 is very small |
49 | * the difference between 15 and 14 is very small |
| 52 | * for small blocks (and 14 is usually a but faster). |
50 | * for small blocks (and 14 is usually a bit faster). |
| 53 | * For a low-memory/faster configuration, use HLOG == 13; |
51 | * For a low-memory/faster configuration, use HLOG == 13; |
| 54 | * For best compression, use 15 or 16 (or more). |
52 | * For best compression, use 15 or 16 (or more, up to 22). |
| 55 | */ |
53 | */ |
| 56 | #ifndef HLOG |
54 | #ifndef HLOG |
| 57 | # define HLOG 14 |
55 | # define HLOG 16 |
| 58 | #endif |
56 | #endif |
| 59 | |
57 | |
| 60 | /* |
58 | /* |
| 61 | * sacrifice very little compression quality in favour of compression speed. |
59 | * Sacrifice very little compression quality in favour of compression speed. |
| 62 | * 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 |
| 63 | * (very roughly) 15% faster. This is the preferable mode of operation. |
61 | * (very roughly) 15% faster. This is the preferred mode of operation. |
| 64 | */ |
62 | */ |
| 65 | |
|
|
| 66 | #ifndef VERY_FAST |
63 | #ifndef VERY_FAST |
| 67 | # define VERY_FAST 1 |
64 | # define VERY_FAST 1 |
| 68 | #endif |
65 | #endif |
| 69 | |
66 | |
| 70 | /* |
67 | /* |
| 71 | * sacrifice some more compression quality in favour of compression speed. |
68 | * Sacrifice some more compression quality in favour of compression speed. |
| 72 | * (roughly 1-2% worse compression for large blocks and |
69 | * (roughly 1-2% worse compression for large blocks and |
| 73 | * 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) |
| 74 | * In short: when in need for speed, enable this for binary data, |
71 | * In short: when in need for speed, enable this for binary data, |
| 75 | * possibly disable this for text data. |
72 | * possibly disable this for text data. |
| 76 | */ |
73 | */ |
| 77 | #ifndef ULTRA_FAST |
74 | #ifndef ULTRA_FAST |
| 78 | # define ULTRA_FAST 0 |
75 | # define ULTRA_FAST 0 |
| 79 | #endif |
76 | #endif |
| 80 | |
77 | |
| 81 | /* |
78 | /* |
| 82 | * 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 |
| 83 | */ |
80 | */ |
| 84 | #ifndef STRICT_ALIGN |
81 | #ifndef STRICT_ALIGN |
| 85 | # define STRICT_ALIGN !(defined(__i386) || defined (__amd64)) |
82 | # define STRICT_ALIGN !(defined(__i386) || defined (__amd64)) |
| 86 | #endif |
83 | #endif |
| 87 | |
84 | |
| 88 | /* |
85 | /* |
| 89 | * use string functions to copy memory. |
|
|
| 90 | * this is usually a loss, even with glibc's optimized memcpy |
|
|
| 91 | */ |
|
|
| 92 | #ifndef USE_MEMCPY |
|
|
| 93 | # define USE_MEMCPY 0 |
|
|
| 94 | #endif |
|
|
| 95 | |
|
|
| 96 | /* |
|
|
| 97 | * you may choose to pre-set the hash table (might be faster on some |
86 | * You may choose to pre-set the hash table (might be faster on some |
| 98 | * modern cpus 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). |
| 99 | */ |
89 | */ |
| 100 | #ifndef INIT_HTAB |
90 | #ifndef INIT_HTAB |
| 101 | # define INIT_HTAB 0 |
91 | # define INIT_HTAB 1 |
| 102 | #endif |
92 | #endif |
| 103 | |
93 | |
| 104 | /* |
94 | /* |
| 105 | * avoid assigning values to errno variable? for some embedding purposes |
95 | * Avoid assigning values to errno variable? for some embedding purposes |
| 106 | * (linux kernel for example), this is neccessary. NOTE: this breaks |
96 | * (linux kernel for example), this is necessary. NOTE: this breaks |
| 107 | * the documentation in lzf.h. |
97 | * the documentation in lzf.h. Avoiding errno has no speed impact. |
| 108 | */ |
98 | */ |
| 109 | #ifndef AVOID_ERRNO |
99 | #ifndef AVOID_ERRNO |
| 110 | # define AVOID_ERRNO 0 |
100 | # define AVOID_ERRNO 0 |
| 111 | #endif |
101 | #endif |
| 112 | |
102 | |
| 113 | /* |
103 | /* |
| 114 | * 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 |
| 115 | * on the stack. For small-stack environments, define this to 1. |
105 | * on the stack. For small-stack environments, define this to 1. |
| 116 | * NOTE: this breaks the prototype in lzf.h. |
106 | * NOTE: this breaks the prototype in lzf.h. |
| 117 | */ |
107 | */ |
| 118 | #ifndef LZF_STATE_ARG |
108 | #ifndef LZF_STATE_ARG |
| 119 | # define LZF_STATE_ARG 0 |
109 | # define LZF_STATE_ARG 0 |
| 120 | #endif |
110 | #endif |
| 121 | |
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 */ |
|
|
148 | |
|
|
149 | /* |
|
|
150 | * Whether to optimise code for size, at the expense of speed. Use |
|
|
151 | * this when you are extremely tight on memory, perhaps in combination |
|
|
152 | * with AVOID_ERRNO 1 and CHECK_INPUT 0. |
|
|
153 | */ |
|
|
154 | #ifndef OPTIMISE_SIZE |
|
|
155 | # ifdef __OPTIMIZE_SIZE__ |
|
|
156 | # define OPTIMISE_SIZE 1 |
|
|
157 | # else |
|
|
158 | # define OPTIMISE_SIZE 0 |
|
|
159 | # endif |
|
|
160 | #endif |
|
|
161 | |
| 122 | /*****************************************************************************/ |
162 | /*****************************************************************************/ |
| 123 | /* nothing should be changed below */ |
163 | /* nothing should be changed below */ |
| 124 | |
164 | |
|
|
165 | #ifdef __cplusplus |
|
|
166 | # include <cstring> |
|
|
167 | # include <climits> |
|
|
168 | using namespace std; |
|
|
169 | #else |
|
|
170 | # include <string.h> |
|
|
171 | # include <limits.h> |
|
|
172 | #endif |
|
|
173 | |
|
|
174 | #ifndef LZF_USE_OFFSETS |
|
|
175 | # ifdef _WIN32 |
|
|
176 | # define LZF_USE_OFFSETS defined(_M_X64) |
|
|
177 | # else |
|
|
178 | # if __cplusplus > 199711L |
|
|
179 | # include <cstdint> |
|
|
180 | # else |
|
|
181 | # include <stdint.h> |
|
|
182 | # endif |
|
|
183 | # define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU) |
|
|
184 | # endif |
|
|
185 | #endif |
|
|
186 | |
| 125 | typedef unsigned char u8; |
187 | typedef unsigned char u8; |
| 126 | |
188 | |
| 127 | typedef const u8 *LZF_STATE[1 << (HLOG)]; |
189 | #ifdef LZF_HSLOT |
| 128 | |
190 | # define LZF_HSLOT_BIAS ((const u8 *)in_data) |
| 129 | #if !STRICT_ALIGN |
191 | #else |
| 130 | /* for unaligned accesses we need a 16 bit datatype. */ |
192 | # if LZF_USE_OFFSETS |
| 131 | # include <limits.h> |
193 | # define LZF_HSLOT_BIAS ((const u8 *)in_data) |
| 132 | # if USHRT_MAX == 65535 |
|
|
| 133 | typedef unsigned short u16; |
|
|
| 134 | # elif UINT_MAX == 65535 |
|
|
| 135 | typedef unsigned int u16; |
194 | typedef unsigned int LZF_HSLOT; |
| 136 | # else |
195 | # else |
| 137 | # undef STRICT_ALIGN |
196 | # define LZF_HSLOT_BIAS 0 |
| 138 | # define STRICT_ALIGN 1 |
197 | typedef const u8 *LZF_HSLOT; |
| 139 | # endif |
198 | # endif |
| 140 | #endif |
199 | #endif |
| 141 | |
200 | |
|
|
201 | typedef LZF_HSLOT LZF_STATE[1 << (HLOG)]; |
|
|
202 | |
|
|
203 | #if USHRT_MAX == 65535 |
|
|
204 | typedef unsigned short u16; |
|
|
205 | #elif UINT_MAX == 65535 |
|
|
206 | typedef unsigned int u16; |
|
|
207 | #else |
|
|
208 | # undef STRICT_ALIGN |
|
|
209 | # define STRICT_ALIGN 1 |
|
|
210 | #endif |
|
|
211 | |
| 142 | #if ULTRA_FAST |
212 | #if ULTRA_FAST |
| 143 | # if defined(VERY_FAST) |
|
|
| 144 | # undef VERY_FAST |
213 | # undef VERY_FAST |
| 145 | # endif |
214 | #endif |
| 146 | #endif |
|
|
| 147 | |
215 | |
| 148 | #if USE_MEMCPY || INIT_HTAB |
|
|
| 149 | # ifdef __cplusplus |
|
|
| 150 | # include <cstring> |
|
|
| 151 | # else |
|
|
| 152 | # include <string.h> |
|
|
| 153 | # endif |
216 | #endif |
| 154 | #endif |
|
|
| 155 | |
217 | |
| 156 | #endif |
|
|
| 157 | |
|
|
