1 | /* |
1 | /* |
2 | * Copyright (c) 2000 Marc Alexander Lehmann <pcg@goof.com> |
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, |
… | |
… | |
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, |
22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
23 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
20 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
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. |
|
|
24 | * |
|
|
25 | * Alternatively, the contents of this file may be used under the terms of |
|
|
26 | * 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. |
27 | */ |
35 | */ |
28 | |
36 | |
29 | #ifndef LZFP_h |
37 | #ifndef LZFP_h |
30 | #define LZFP_h |
38 | #define LZFP_h |
31 | |
39 | |
32 | #define STANDALONE /* at the moment, this is ok. */ |
40 | #define STANDALONE 1 /* at the moment, this is ok. */ |
33 | |
41 | |
34 | #ifndef STANDALONE |
42 | #ifndef STANDALONE |
35 | # include "lzf.h" |
43 | # include "lzf.h" |
36 | #endif |
44 | #endif |
37 | |
45 | |
38 | /* |
46 | /* |
39 | * size of hashtable is (1 << HLOG) * sizeof (char *) |
47 | * Size of hashtable is (1 << HLOG) * sizeof (char *) |
40 | * decompression is independent of the hash table size |
48 | * decompression is independent of the hash table size |
41 | * the difference between 15 and 14 is very small |
49 | * the difference between 15 and 14 is very small |
42 | * for small blocks (and 14 is also faster). |
50 | * for small blocks (and 14 is usually a bit faster). |
43 | * For a low-memory configuration, use HLOG == 13; |
51 | * For a low-memory/faster configuration, use HLOG == 13; |
44 | * For best compression, use 15 or 16. |
52 | * For best compression, use 15 or 16 (or more). |
45 | */ |
53 | */ |
46 | #ifndef HLOG |
54 | #ifndef HLOG |
47 | # define HLOG 14 |
55 | # define HLOG 15 |
48 | #endif |
56 | #endif |
49 | |
57 | |
50 | /* |
58 | /* |
51 | * sacrifice some compression quality in favour of compression speed. |
59 | * Sacrifice very little compression quality in favour of compression speed. |
52 | * (roughly 1-2% worse compression for large blocks and |
60 | * This gives almost the same compression as the default code, and is |
53 | * 9-10% for small, redundant, blocks and 20% better speed in both cases) |
61 | * (very roughly) 15% faster. This is the preferable mode of operation. |
54 | * In short: enable this for binary data, disable this for text data. |
|
|
55 | */ |
62 | */ |
|
|
63 | |
56 | #ifndef ULTRA_FAST |
64 | #ifndef VERY_FAST |
57 | # define ULTRA_FAST 1 |
65 | # define VERY_FAST 1 |
58 | #endif |
66 | #endif |
59 | |
67 | |
60 | /* |
68 | /* |
61 | * unconditionally aligning does not cost very much, so do it if unsure |
69 | * Sacrifice some more compression quality in favour of compression speed. |
|
|
70 | * (roughly 1-2% worse compression for large blocks and |
|
|
71 | * 9-10% for small, redundant, blocks and >>20% better speed in both cases) |
|
|
72 | * In short: when in need for speed, enable this for binary data, |
|
|
73 | * possibly disable this for text data. |
62 | */ |
74 | */ |
63 | #ifndef STRICT_ALIGN |
75 | #ifndef ULTRA_FAST |
64 | # define STRICT_ALIGN !defined(__i386) |
76 | # define ULTRA_FAST 0 |
65 | #endif |
77 | #endif |
66 | |
78 | |
67 | /* |
79 | /* |
68 | * use string functions to copy memory. |
80 | * Unconditionally aligning does not cost very much, so do it if unsure |
69 | * this is usually a loss, even with glibc's optimized memcpy |
|
|
70 | */ |
81 | */ |
71 | #ifndef USE_MEMCPY |
82 | #ifndef STRICT_ALIGN |
72 | # define USE_MEMCPY 0 |
83 | # define STRICT_ALIGN !(defined(__i386) || defined (__amd64)) |
73 | #endif |
84 | #endif |
74 | |
85 | |
75 | /* |
86 | /* |
76 | * you may choose to pre-set the hash table (might be faster on modern cpus |
87 | * You may choose to pre-set the hash table (might be faster on some |
77 | * and large (>>64k) blocks) |
88 | * modern cpus and large (>>64k) blocks, and also makes compression |
|
|
89 | * deterministic/repeatable when the configuration otherwise is the same). |
78 | */ |
90 | */ |
79 | #ifndef INIT_HTAB |
91 | #ifndef INIT_HTAB |
80 | # define INIT_HTAB 0 |
92 | # define INIT_HTAB 0 |
|
|
93 | #endif |
|
|
94 | |
|
|
95 | /* |
|
|
96 | * Avoid assigning values to errno variable? for some embedding purposes |
|
|
97 | * (linux kernel for example), this is neccessary. NOTE: this breaks |
|
|
98 | * the documentation in lzf.h. |
|
|
99 | */ |
|
|
100 | #ifndef AVOID_ERRNO |
|
|
101 | # define AVOID_ERRNO 0 |
|
|
102 | #endif |
|
|
103 | |
|
|
104 | /* |
|
|
105 | * Wether to pass the LZF_STATE variable as argument, or allocate it |
|
|
106 | * on the stack. For small-stack environments, define this to 1. |
|
|
107 | * NOTE: this breaks the prototype in lzf.h. |
|
|
108 | */ |
|
|
109 | #ifndef LZF_STATE_ARG |
|
|
110 | # define LZF_STATE_ARG 0 |
|
|
111 | #endif |
|
|
112 | |
|
|
113 | /* |
|
|
114 | * Wether to add extra checks for input validity in lzf_decompress |
|
|
115 | * and return EINVAL if the input stream has been corrupted. This |
|
|
116 | * only shields against overflowing the input buffer and will not |
|
|
117 | * detect most corrupted streams. |
|
|
118 | * This check is not normally noticable on modern hardware |
|
|
119 | * (<1% slowdown), but might slow down older cpus considerably. |
|
|
120 | */ |
|
|
121 | #ifndef CHECK_INPUT |
|
|
122 | # define CHECK_INPUT 1 |
81 | #endif |
123 | #endif |
82 | |
124 | |
83 | /*****************************************************************************/ |
125 | /*****************************************************************************/ |
84 | /* nothing should be changed below */ |
126 | /* nothing should be changed below */ |
85 | |
127 | |
86 | typedef unsigned char u8; |
128 | typedef unsigned char u8; |
|
|
129 | |
|
|
130 | typedef const u8 *LZF_STATE[1 << (HLOG)]; |
87 | |
131 | |
88 | #if !STRICT_ALIGN |
132 | #if !STRICT_ALIGN |
89 | /* for unaligned accesses we need a 16 bit datatype. */ |
133 | /* for unaligned accesses we need a 16 bit datatype. */ |
90 | # include <limits.h> |
134 | # include <limits.h> |
91 | # if USHRT_MAX == 65535 |
135 | # if USHRT_MAX == 65535 |
92 | typedef unsigned short u16; |
136 | typedef unsigned short u16; |
93 | # elif UINT_MAX == 65535 |
137 | # elif UINT_MAX == 65535 |
94 | typedef unsigned int u16; |
138 | typedef unsigned int u16; |
95 | # else |
139 | # else |
96 | # warn need 16 bit datatype when STRICT_ALIGN == 0, this is non-fatal |
|
|
97 | # undef STRICT_ALIGN |
140 | # undef STRICT_ALIGN |
98 | # define STRICT_ALIGN 1 |
141 | # define STRICT_ALIGN 1 |
99 | # endif |
142 | # endif |
100 | #endif |
143 | #endif |
101 | |
144 | |
102 | #if USE_MEMCPY || INIT_HTAB |
145 | #if ULTRA_FAST |
|
|
146 | # if defined(VERY_FAST) |
|
|
147 | # undef VERY_FAST |
|
|
148 | # endif |
|
|
149 | #endif |
|
|
150 | |
|
|
151 | #if INIT_HTAB |
|
|
152 | # ifdef __cplusplus |
|
|
153 | # include <cstring> |
|
|
154 | # else |
103 | # include <string.h> |
155 | # include <string.h> |
|
|
156 | # endif |
104 | #endif |
157 | #endif |
105 | |
158 | |
106 | #endif |
159 | #endif |
107 | |
160 | |