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

Comparing liblzf/lzfP.h (file contents):
Revision 1.5 by pcg, Tue Dec 23 04:52:00 2003 UTC vs.
Revision 1.15 by root, Thu Jun 21 22:11:34 2007 UTC

1/* 1/*
2 * Copyright (c) 2000-2003 Marc Alexander Lehmann <pcg@goof.com> 2 * Copyright (c) 2000-2005 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,
… …
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; 22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- 24 * 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 25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26 * OF THE POSSIBILITY OF SUCH DAMAGE. 26 * OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * 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
30 * provisions of the GPL are applicable instead of the above. If you wish to
31 * allow the use of your version of this file only under the terms of the
32 * GPL and not to allow others to use your version of this file under the
33 * BSD license, indicate your decision by deleting the provisions above and
34 * replace them with the notice and other provisions required by the GPL. If
35 * you do not delete the provisions above, a recipient may use your version
36 * of this file under either the BSD or the GPL.
27 */ 37 */
28 38
29#ifndef LZFP_h 39#ifndef LZFP_h
30#define LZFP_h 40#define LZFP_h
31 41
32#define STANDALONE /* at the moment, this is ok. */ 42#define STANDALONE 1 /* at the moment, this is ok. */
33 43
34#ifndef STANDALONE 44#ifndef STANDALONE
35# include "lzf.h" 45# include "lzf.h"
36#endif 46#endif
37 47
38/* 48/*
39 * size of hashtable is (1 << HLOG) * sizeof (char *) 49 * Size of hashtable is (1 << HLOG) * sizeof (char *)
40 * decompression is independent of the hash table size 50 * decompression is independent of the hash table size
41 * the difference between 15 and 14 is very small 51 * the difference between 15 and 14 is very small
42 * for small blocks (and 14 is also faster). 52 * for small blocks (and 14 is usually a bit faster).
43 * For a low-memory configuration, use HLOG == 13; 53 * For a low-memory/faster configuration, use HLOG == 13;
44 * For best compression, use 15 or 16. 54 * For best compression, use 15 or 16 (or more).
45 */ 55 */
46#ifndef HLOG 56#ifndef HLOG
47# define HLOG 14 57# define HLOG 15
48#endif 58#endif
49 59
50/* 60/*
51 * sacrifice some compression quality in favour of compression speed. 61 * Sacrifice very little compression quality in favour of compression speed.
52 * (roughly 1-2% worse compression for large blocks and 62 * 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) 63 * (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 */ 64 */
65
56#ifndef ULTRA_FAST 66#ifndef VERY_FAST
57# define ULTRA_FAST 1 67# define VERY_FAST 1
58#endif 68#endif
59 69
60/* 70/*
61 * unconditionally aligning does not cost very much, so do it if unsure 71 * Sacrifice some more compression quality in favour of compression speed.
72 * (roughly 1-2% worse compression for large blocks and
73 * 9-10% for small, redundant, blocks and >>20% better speed in both cases)
74 * In short: when in need for speed, enable this for binary data,
75 * possibly disable this for text data.
62 */ 76 */
63#ifndef STRICT_ALIGN 77#ifndef ULTRA_FAST
64# define STRICT_ALIGN !defined(__i386) 78# define ULTRA_FAST 0
65#endif 79#endif
66 80
67/* 81/*
68 * use string functions to copy memory. 82 * 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 */ 83 */
71#ifndef USE_MEMCPY 84#ifndef STRICT_ALIGN
72# define USE_MEMCPY 0 85# define STRICT_ALIGN !(defined(__i386) || defined (__amd64))
73#endif 86#endif
74 87
75/* 88/*
76 * you may choose to pre-set the hash table (might be faster on modern cpus 89 * You may choose to pre-set the hash table (might be faster on some
77 * and large (>>64k) blocks) 90 * modern cpus and large (>>64k) blocks, and also makes compression
91 * deterministic/repeatable when the configuration otherwise is the same).
78 */ 92 */
79#ifndef INIT_HTAB 93#ifndef INIT_HTAB
80# define INIT_HTAB 0 94# define INIT_HTAB 0
81#endif 95#endif
82 96
83/* 97/*
84 * avoid assigning values to errno variable? for some embedding purposes 98 * Avoid assigning values to errno variable? for some embedding purposes
85 * (linux kernel for example), this is not 99 * (linux kernel for example), this is neccessary. NOTE: this breaks
100 * the documentation in lzf.h.
86 */ 101 */
87#ifndef AVOID_ERRNO 102#ifndef AVOID_ERRNO
88# define AVOID_ERRNO 0 103# define AVOID_ERRNO 0
89#endif 104#endif
90 105
91/* 106/*
92 * Wether to pass the LZF_STATE variable as argument, or allocate it 107 * Wether to pass the LZF_STATE variable as argument, or allocate it
93 * on the stack. For small-stack environments, define this to zero. 108 * on the stack. For small-stack environments, define this to 1.
109 * NOTE: this breaks the prototype in lzf.h.
94 */ 110 */
95#ifndef LZF_STATE_ARG 111#ifndef LZF_STATE_ARG
96# define LZF_STATE_ARG 1 112# define LZF_STATE_ARG 0
113#endif
114
115/*
116 * Wether to add extra checks for input validity in lzf_decompress
117 * and return EINVAL if the input stream has been corrupted. This
118 * only shields against overflowing the input buffer and will not
119 * detect most corrupted streams.
120 * This check is not normally noticable on modern hardware
121 * (<1% slowdown), but might slow down older cpus considerably.
122 */
123#ifndef CHECK_INPUT
124# define CHECK_INPUT 1
97#endif 125#endif
98 126
99/*****************************************************************************/ 127/*****************************************************************************/
100/* nothing should be changed below */ 128/* nothing should be changed below */
101 129
… …
114# undef STRICT_ALIGN 142# undef STRICT_ALIGN
115# define STRICT_ALIGN 1 143# define STRICT_ALIGN 1
116# endif 144# endif
117#endif 145#endif
118 146
119#if USE_MEMCPY || INIT_HTAB 147#if ULTRA_FAST
148# if defined(VERY_FAST)
149# undef VERY_FAST
150# endif
151#endif
152
153#if INIT_HTAB
154# ifdef __cplusplus
155# include <cstring>
156# else
120# include <string.h> 157# include <string.h>
158# endif
121#endif 159#endif
122 160
123#endif 161#endif
124 162

Diff Legend

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