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

Comparing liblzf/lzfP.h (file contents):
Revision 1.12 by root, Fri Jul 7 15:34:11 2006 UTC vs.
Revision 1.29 by root, Mon Dec 10 20:21:28 2012 UTC

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
… …
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 bit 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 15 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/*
… …
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
122/* 112/*
123 * Wether to add extra checks for input validity in lzf_decompress 113 * Whether to add extra checks for input validity in lzf_decompress
124 * and return EINVAL if the input stream has been corrupted. This 114 * and return EINVAL if the input stream has been corrupted. This
125 * only shields against overflowing the input buffer and will not 115 * only shields against overflowing the input buffer and will not
126 * detect most corrupted streams. 116 * detect most corrupted streams.
127 * This check is not normally noticable on modern hardware 117 * This check is not normally noticeable on modern hardware
128 * (<1% slowdown), but might slow down older cpus considerably. 118 * (<1% slowdown), but might slow down older cpus considerably.
129 */ 119 */
130#ifndef CHECK_INPUT 120#ifndef CHECK_INPUT
131# define CHECK_INPUT 0 121# define CHECK_INPUT 1
132#endif 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 */
133 148
134/*****************************************************************************/ 149/*****************************************************************************/
135/* nothing should be changed below */ 150/* nothing should be changed below */
136 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
137typedef unsigned char u8; 174typedef unsigned char u8;
138 175
139typedef const u8 *LZF_STATE[1 << (HLOG)]; 176#ifdef LZF_HSLOT
140 177# define LZF_HSLOT_BIAS ((const u8 *)in_data)
141#if !STRICT_ALIGN 178#else
142/* for unaligned accesses we need a 16 bit datatype. */ 179# if LZF_USE_OFFSETS
143# include <limits.h> 180# define LZF_HSLOT_BIAS ((const u8 *)in_data)
144# if USHRT_MAX == 65535
145 typedef unsigned short u16;
146# elif UINT_MAX == 65535
147 typedef unsigned int u16; 181 typedef unsigned int LZF_HSLOT;
148# else 182# else
149# undef STRICT_ALIGN 183# define LZF_HSLOT_BIAS 0
150# define STRICT_ALIGN 1 184 typedef const u8 *LZF_HSLOT;
151# endif 185# endif
152#endif 186#endif
153 187
188typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
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
197#endif
198
154#if ULTRA_FAST 199#if ULTRA_FAST
155# if defined(VERY_FAST)
156# undef VERY_FAST 200# undef VERY_FAST
157# endif 201#endif
158#endif
159 202
160#if USE_MEMCPY || INIT_HTAB
161# ifdef __cplusplus
162# include <cstring>
163# else
164# include <string.h>
165# endif 203#endif
166#endif
167 204
168#endif
169

Diff Legend

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