| … | |
… | |
| 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 |
| … | |
… | |
| 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 |
190 | #if !STRICT_ALIGN |
