1 | /* |
1 | /* |
2 | * Copyright (c) 2000-2007 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 | * 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 |
15 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
15 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
16 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
16 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
17 | * 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- |
18 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
18 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
… | |
… | |
47 | * Size of hashtable is (1 << HLOG) * sizeof (char *) |
47 | * Size of hashtable is (1 << HLOG) * sizeof (char *) |
48 | * decompression is independent of the hash table size |
48 | * decompression is independent of the hash table size |
49 | * the difference between 15 and 14 is very small |
49 | * the difference between 15 and 14 is very small |
50 | * for small blocks (and 14 is usually a bit faster). |
50 | * for small blocks (and 14 is usually a bit faster). |
51 | * For a low-memory/faster configuration, use HLOG == 13; |
51 | * For a low-memory/faster configuration, use HLOG == 13; |
52 | * For best compression, use 15 or 16 (or more, up to 23). |
52 | * For best compression, use 15 or 16 (or more, up to 22). |
53 | */ |
53 | */ |
54 | #ifndef HLOG |
54 | #ifndef HLOG |
55 | # define HLOG 16 |
55 | # define HLOG 16 |
56 | #endif |
56 | #endif |
57 | |
57 | |
… | |
… | |
86 | * 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 |
87 | * modern cpus and large (>>64k) blocks, and also makes compression |
87 | * modern cpus and large (>>64k) blocks, and also makes compression |
88 | * deterministic/repeatable when the configuration otherwise is the same). |
88 | * deterministic/repeatable when the configuration otherwise is the same). |
89 | */ |
89 | */ |
90 | #ifndef INIT_HTAB |
90 | #ifndef INIT_HTAB |
91 | # define INIT_HTAB 0 |
91 | # define INIT_HTAB 1 |
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 necessary. NOTE: this breaks |
96 | * (linux kernel for example), this is necessary. NOTE: this breaks |
… | |
… | |
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 | /* |
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 | /* |
125 | * Whether to store pointers or offsets inside the hash table. On |
143 | * Whether to store pointers or offsets inside the hash table. On |
126 | * 64 bit architetcures, pointers take up twice as much space, |
144 | * 64 bit architetcures, pointers take up twice as much space, |
127 | * and might also be slower. Default is to autodetect. |
145 | * and might also be slower. Default is to autodetect. |
128 | */ |
146 | */ |
129 | /*#define LZF_USER_OFFSETS autodetect */ |
147 | /*#define LZF_USE_OFFSETS autodetect */ |
130 | |
148 | |
131 | /*****************************************************************************/ |
149 | /*****************************************************************************/ |
132 | /* nothing should be changed below */ |
150 | /* nothing should be changed below */ |
133 | |
151 | |
134 | #ifdef __cplusplus |
152 | #ifdef __cplusplus |
… | |
… | |
139 | # include <string.h> |
157 | # include <string.h> |
140 | # include <limits.h> |
158 | # include <limits.h> |
141 | #endif |
159 | #endif |
142 | |
160 | |
143 | #ifndef LZF_USE_OFFSETS |
161 | #ifndef LZF_USE_OFFSETS |
144 | # if defined (WIN32) |
162 | # ifdef _WIN32 |
145 | # define LZF_USE_OFFSETS defined(_M_X64) |
163 | # define LZF_USE_OFFSETS defined(_M_X64) |
146 | # else |
164 | # else |
147 | # if __cplusplus > 199711L |
165 | # if __cplusplus > 199711L |
148 | # include <cstdint> |
166 | # include <cstdint> |
149 | # else |
167 | # else |
… | |
… | |
153 | # endif |
171 | # endif |
154 | #endif |
172 | #endif |
155 | |
173 | |
156 | typedef unsigned char u8; |
174 | typedef unsigned char u8; |
157 | |
175 | |
158 | #if LZF_USE_OFFSETS |
176 | #ifdef LZF_HSLOT |
159 | # define LZF_HSLOT_BIAS ((const u8 *)in_data) |
177 | # define LZF_HSLOT_BIAS ((const u8 *)in_data) |
160 | typedef unsigned int LZF_HSLOT; |
|
|
161 | #else |
178 | #else |
|
|
179 | # if LZF_USE_OFFSETS |
|
|
180 | # define LZF_HSLOT_BIAS ((const u8 *)in_data) |
|
|
181 | typedef unsigned int LZF_HSLOT; |
|
|
182 | # else |
162 | # define LZF_HSLOT_BIAS 0 |
183 | # define LZF_HSLOT_BIAS 0 |
163 | typedef const u8 *LZF_HSLOT; |
184 | typedef const u8 *LZF_HSLOT; |
|
|
185 | # endif |
164 | #endif |
186 | #endif |
165 | |
187 | |
166 | typedef LZF_HSLOT LZF_STATE[1 << (HLOG)]; |
188 | typedef LZF_HSLOT LZF_STATE[1 << (HLOG)]; |
167 | |
189 | |
168 | #if !STRICT_ALIGN |
|
|
169 | /* for unaligned accesses we need a 16 bit datatype. */ |
|
|
170 | # if USHRT_MAX == 65535 |
190 | #if USHRT_MAX == 65535 |
171 | typedef unsigned short u16; |
191 | typedef unsigned short u16; |
172 | # elif UINT_MAX == 65535 |
192 | #elif UINT_MAX == 65535 |
173 | typedef unsigned int u16; |
193 | typedef unsigned int u16; |
174 | # else |
194 | #else |
175 | # undef STRICT_ALIGN |
195 | # undef STRICT_ALIGN |
176 | # define STRICT_ALIGN 1 |
196 | # define STRICT_ALIGN 1 |
177 | # endif |
|
|
178 | #endif |
197 | #endif |
179 | |
198 | |
180 | #if ULTRA_FAST |
199 | #if ULTRA_FAST |
181 | # undef VERY_FAST |
200 | # undef VERY_FAST |
182 | #endif |
201 | #endif |