liblzf/lzfP.h

/*
 * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
 *
 * Redistribution and use in source and binary forms, with or without modifica-
 * tion, are permitted provided that the following conditions are met:
 *
 *   1.  Redistributions of source code must retain the above copyright notice,
 *       this list of conditions and the following disclaimer.
 *
 *   2.  Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO
 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 * OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Alternatively, the contents of this file may be used under the terms of
 * the GNU General Public License ("GPL") version 2 or any later version,
 * in which case the provisions of the GPL are applicable instead of
 * the above. If you wish to allow the use of your version of this file
 * only under the terms of the GPL and not to allow others to use your
 * version of this file under the BSD license, indicate your decision
 * by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL. If you do not delete the
 * provisions above, a recipient may use your version of this file under
 * either the BSD or the GPL.
 */

#ifndef LZFP_h
#define LZFP_h

#define STANDALONE 1 /* at the moment, this is ok. */

#ifndef STANDALONE
# include "lzf.h"
#endif

/*
 * Size of hashtable is (1 << HLOG) * sizeof (char *)
 * decompression is independent of the hash table size
 * the difference between 15 and 14 is very small
 * for small blocks (and 14 is usually a bit faster).
 * For a low-memory/faster configuration, use HLOG == 13;
 * For best compression, use 15 or 16 (or more, up to 22).
 */
#ifndef HLOG
# define HLOG 16
#endif

/*
 * Sacrifice very little compression quality in favour of compression speed.
 * This gives almost the same compression as the default code, and is
 * (very roughly) 15% faster. This is the preferred mode of operation.
 */
#ifndef VERY_FAST
# define VERY_FAST 1
#endif

/*
 * Sacrifice some more compression quality in favour of compression speed.
 * (roughly 1-2% worse compression for large blocks and
 * 9-10% for small, redundant, blocks and >>20% better speed in both cases)
 * In short: when in need for speed, enable this for binary data,
 * possibly disable this for text data.
 */
#ifndef ULTRA_FAST
# define ULTRA_FAST 0
#endif

/*
 * Unconditionally aligning does not cost very much, so do it if unsure
 */
#ifndef STRICT_ALIGN
# define STRICT_ALIGN !(defined(__i386) || defined (__amd64))
#endif

/*
 * You may choose to pre-set the hash table (might be faster on some
 * modern cpus and large (>>64k) blocks, and also makes compression
 * deterministic/repeatable when the configuration otherwise is the same).
 */
#ifndef INIT_HTAB
# define INIT_HTAB 1
#endif

/*
 * Avoid assigning values to errno variable? for some embedding purposes
 * (linux kernel for example), this is necessary. NOTE: this breaks
 * the documentation in lzf.h. Avoiding errno has no speed impact.
 */
#ifndef AVOID_ERRNO
# define AVOID_ERRNO 0
#endif

/*
 * Whether to pass the LZF_STATE variable as argument, or allocate it
 * on the stack. For small-stack environments, define this to 1.
 * NOTE: this breaks the prototype in lzf.h.
 */
#ifndef LZF_STATE_ARG
# define LZF_STATE_ARG 0
#endif

/*
 * Whether to add extra checks for input validity in lzf_decompress
 * and return EINVAL if the input stream has been corrupted. This
 * only shields against overflowing the input buffer and will not
 * detect most corrupted streams.
 * This check is not normally noticeable on modern hardware
 * (<1% slowdown), but might slow down older cpus considerably.
 */
#ifndef CHECK_INPUT
# define CHECK_INPUT 1
#endif

/*
 * Whether the target CPU has a slow multiplication. This affects
 * the default hash function for the compressor, and enables a slightly
 * worse hash function that needs only shifts.
 */
#ifndef MULTIPLICATION_IS_SLOW
# define MULTIPLICATION_IS_SLOW 0
#endif

/*
 * If defined, then this data type will be used for storing offsets.
 * This can be useful if you want to use a huge hashtable, want to
 * conserve memory, or both, and your data fits into e.g. 64kb.
 * If instead you want to compress data > 4GB, then it's better to
 * to "#define LZF_USE_OFFSETS 0" instead.
 */
/*#define LZF_HSLOT unsigned short*/

/*
 * Whether to store pointers or offsets inside the hash table. On
 * 64 bit architetcures, pointers take up twice as much space,
 * and might also be slower. Default is to autodetect.
 */
/*#define LZF_USE_OFFSETS autodetect */

/*
 * Whether to optimise code for size, at the expense of speed. Use
 * this when you are extremely tight on memory, perhaps in combination
 * with AVOID_ERRNO 1 and CHECK_INPUT 0.
 */
#ifndef OPTIMISE_SIZE
# ifdef __OPTIMIZE_SIZE__
#  define OPTIMISE_SIZE 1
# else
#  define OPTIMISE_SIZE 0
# endif
#endif

/*****************************************************************************/
/* nothing should be changed below */

#ifdef __cplusplus
# include <cstring>
# include <climits>
using namespace std;
#else
# include <string.h>
# include <limits.h>
#endif

#if ULTRA_FAST
# undef VERY_FAST
#endif

#ifndef LZF_USE_OFFSETS
# ifdef _WIN32
#  define LZF_USE_OFFSETS defined(_M_X64)
# else
#  if __cplusplus > 199711L
#   include <cstdint>
#  else
#   include <stdint.h>
#  endif
#  define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
# endif
#endif

typedef unsigned char u8;

#ifdef LZF_HSLOT
# define LZF_HSLOT_BIAS ((const u8 *)in_data)
#else
# if LZF_USE_OFFSETS
#  define LZF_HSLOT_BIAS ((const u8 *)in_data)
   typedef unsigned int LZF_HSLOT;
# else
#  define LZF_HSLOT_BIAS 0
   typedef const u8 *LZF_HSLOT;
# endif
#endif

#if USHRT_MAX == 65535
   typedef unsigned short u16;
#elif UINT_MAX == 65535
   typedef unsigned int u16;
#else
# undef STRICT_ALIGN
# define STRICT_ALIGN 1
#endif

#define LZF_MAX_LIT (1 <<  5)
#define LZF_MAX_OFF (1 << 13)
#define LZF_MAX_REF ((1 << 8) + (1 << 3))

typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];

typedef struct
{
  const u8 *first [1 << (6+8)]; /* most recent occurance of a match */
  u16 prev [LZF_MAX_OFF]; /* how many bytes to go backwards for the next match */
} LZF_STATE_BEST[1];

#endif

Revision:	1.31
Committed:	Mon Jun 29 23:34:41 2015 UTC (8 years, 10 months ago) by root
Content type:	text/plain
Branch:	MAIN
CVS Tags:	HEAD
Changes since 1.30:	+15 -5 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	/*
2	root	1.16	* Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
3	root	1.29	*
4	root	1.1	* Redistribution and use in source and binary forms, with or without modifica-
5			* tion, are permitted provided that the following conditions are met:
6	root	1.29	*
7	root	1.1	* 1. Redistributions of source code must retain the above copyright notice,
8			* this list of conditions and the following disclaimer.
9	root	1.29	*
10	root	1.1	* 2. Redistributions in binary form must reproduce the above copyright
11			* notice, this list of conditions and the following disclaimer in the
12			* documentation and/or other materials provided with the distribution.
13	root	1.29	*
14	root	1.1	* 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-
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-
18			* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19			* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
20			* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
21			* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
22			* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
23			* OF THE POSSIBILITY OF SUCH DAMAGE.
24	pcg	1.8	*
25			* Alternatively, the contents of this file may be used under the terms of
26	root	1.17	* 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.
35	root	1.1	*/
36
37			#ifndef LZFP_h
38			#define LZFP_h
39
40	root	1.11	#define STANDALONE 1 /* at the moment, this is ok. */
41	root	1.1
42			#ifndef STANDALONE
43			# include "lzf.h"
44			#endif
45
46			/*
47	root	1.12	* Size of hashtable is (1 << HLOG) * sizeof (char *)
48	root	1.1	* decompression is independent of the hash table size
49			* the difference between 15 and 14 is very small
50	root	1.12	* for small blocks (and 14 is usually a bit faster).
51	root	1.11	* For a low-memory/faster configuration, use HLOG == 13;
52	root	1.24	* For best compression, use 15 or 16 (or more, up to 22).
53	root	1.1	*/
54			#ifndef HLOG
55	root	1.19	# define HLOG 16
56	root	1.1	#endif
57
58			/*
59	root	1.12	* Sacrifice very little compression quality in favour of compression speed.
60	root	1.11	* This gives almost the same compression as the default code, and is
61	root	1.18	* (very roughly) 15% faster. This is the preferred mode of operation.
62	root	1.11	*/
63			#ifndef VERY_FAST
64			# define VERY_FAST 1
65			#endif
66
67			/*
68	root	1.12	* Sacrifice some more compression quality in favour of compression speed.
69	root	1.1	* (roughly 1-2% worse compression for large blocks and
70	root	1.2	* 9-10% for small, redundant, blocks and >>20% better speed in both cases)
71	root	1.11	* In short: when in need for speed, enable this for binary data,
72			* possibly disable this for text data.
73	root	1.1	*/
74			#ifndef ULTRA_FAST
75	root	1.11	# define ULTRA_FAST 0
76	root	1.1	#endif
77
78			/*
79	root	1.12	* Unconditionally aligning does not cost very much, so do it if unsure
80	root	1.1	*/
81			#ifndef STRICT_ALIGN
82	root	1.11	# define STRICT_ALIGN !(defined(__i386) \|\| defined (__amd64))
83	root	1.1	#endif
84
85			/*
86	root	1.12	* You may choose to pre-set the hash table (might be faster on some
87	root	1.14	* modern cpus and large (>>64k) blocks, and also makes compression
88			* deterministic/repeatable when the configuration otherwise is the same).
89	root	1.1	*/
90			#ifndef INIT_HTAB
91	root	1.26	# define INIT_HTAB 1
92	root	1.1	#endif
93
94	pcg	1.5	/*
95	root	1.12	* Avoid assigning values to errno variable? for some embedding purposes
96	root	1.20	* (linux kernel for example), this is necessary. NOTE: this breaks
97	root	1.21	* the documentation in lzf.h. Avoiding errno has no speed impact.
98	pcg	1.5	*/
99			#ifndef AVOID_ERRNO
100			# define AVOID_ERRNO 0
101			#endif
102
103			/*
104	root	1.20	* Whether to pass the LZF_STATE variable as argument, or allocate it
105	pcg	1.7	* on the stack. For small-stack environments, define this to 1.
106	pcg	1.6	* NOTE: this breaks the prototype in lzf.h.
107	pcg	1.5	*/
108			#ifndef LZF_STATE_ARG
109	pcg	1.7	# define LZF_STATE_ARG 0
110	pcg	1.5	#endif
111
112	root	1.12	/*
113	root	1.20	* Whether to add extra checks for input validity in lzf_decompress
114	root	1.12	* 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	root	1.20	* This check is not normally noticeable on modern hardware
118	root	1.12	* (<1% slowdown), but might slow down older cpus considerably.
119			*/
120			#ifndef CHECK_INPUT
121	root	1.13	# define CHECK_INPUT 1
122	root	1.12	#endif
123
124	root	1.22	/*
125	root	1.26	* 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	root	1.22	* 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	root	1.26	/#define LZF_USE_OFFSETS autodetect /
148	root	1.22
149	root	1.30	/*
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
162	root	1.1	/*****************************************************************************/
163			/* nothing should be changed below */
164
165	root	1.21	#ifdef __cplusplus
166			# include <cstring>
167	root	1.22	# include <climits>
168	root	1.21	using namespace std;
169			#else
170			# include <string.h>
171	root	1.22	# include <limits.h>
172			#endif
173
174	root	1.31	#if ULTRA_FAST
175			# undef VERY_FAST
176			#endif
177
178	root	1.22	#ifndef LZF_USE_OFFSETS
179	root	1.28	# ifdef _WIN32
180	root	1.22	# define LZF_USE_OFFSETS defined(_M_X64)
181			# else
182	root	1.23	# if __cplusplus > 199711L
183	root	1.22	# include <cstdint>
184			# else
185			# include <stdint.h>
186			# endif
187			# define LZF_USE_OFFSETS (UINTPTR_MAX > 0xffffffffU)
188			# endif
189	root	1.21	#endif
190
191	root	1.1	typedef unsigned char u8;
192	pcg	1.5
193	root	1.26	#ifdef LZF_HSLOT
194	root	1.22	# define LZF_HSLOT_BIAS ((const u8 *)in_data)
195			#else
196	root	1.26	# if LZF_USE_OFFSETS
197			# define LZF_HSLOT_BIAS ((const u8 *)in_data)
198			typedef unsigned int LZF_HSLOT;
199			# else
200			# define LZF_HSLOT_BIAS 0
201			typedef const u8 *LZF_HSLOT;
202			# endif
203	root	1.22	#endif
204
205	root	1.27	#if USHRT_MAX == 65535
206			typedef unsigned short u16;
207			#elif UINT_MAX == 65535
208			typedef unsigned int u16;
209			#else
210			# undef STRICT_ALIGN
211			# define STRICT_ALIGN 1
212	root	1.1	#endif
213
214	root	1.31	#define LZF_MAX_LIT (1 << 5)
215			#define LZF_MAX_OFF (1 << 13)
216			#define LZF_MAX_REF ((1 << 8) + (1 << 3))
217
218			typedef LZF_HSLOT LZF_STATE[1 << (HLOG)];
219
220			typedef struct
221			{
222			const u8 first [1 << (6+8)]; / most recent occurance of a match */
223			u16 prev [LZF_MAX_OFF]; /* how many bytes to go backwards for the next match */
224			} LZF_STATE_BEST[1];
225	root	1.1
226			#endif
227