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, |
… | |
… | |
37 | */ |
37 | */ |
38 | |
38 | |
39 | #ifndef LZFP_h |
39 | #ifndef LZFP_h |
40 | #define LZFP_h |
40 | #define LZFP_h |
41 | |
41 | |
42 | #define STANDALONE /* at the moment, this is ok. */ |
42 | #define STANDALONE 1 /* at the moment, this is ok. */ |
43 | |
43 | |
44 | #ifndef STANDALONE |
44 | #ifndef STANDALONE |
45 | # include "lzf.h" |
45 | # include "lzf.h" |
46 | #endif |
46 | #endif |
47 | |
47 | |
48 | /* |
48 | /* |
49 | * size of hashtable is (1 << HLOG) * sizeof (char *) |
49 | * size of hashtable is (1 << HLOG) * sizeof (char *) |
50 | * decompression is independent of the hash table size |
50 | * decompression is independent of the hash table size |
51 | * the difference between 15 and 14 is very small |
51 | * the difference between 15 and 14 is very small |
52 | * for small blocks (and 14 is also faster). |
52 | * for small blocks (and 14 is usually a but faster). |
53 | * For a low-memory configuration, use HLOG == 13; |
53 | * For a low-memory/faster configuration, use HLOG == 13; |
54 | * For best compression, use 15 or 16. |
54 | * For best compression, use 15 or 16 (or more). |
55 | */ |
55 | */ |
56 | #ifndef HLOG |
56 | #ifndef HLOG |
57 | # define HLOG 14 |
57 | # define HLOG 14 |
58 | #endif |
58 | #endif |
59 | |
59 | |
60 | /* |
60 | /* |
|
|
61 | * sacrifice very little compression quality in favour of compression speed. |
|
|
62 | * This gives almost the same compression as the default code, and is |
|
|
63 | * (very roughly) 15% faster. This is the preferable mode of operation. |
|
|
64 | */ |
|
|
65 | |
|
|
66 | #ifndef VERY_FAST |
|
|
67 | # define VERY_FAST 1 |
|
|
68 | #endif |
|
|
69 | |
|
|
70 | /* |
61 | * sacrifice some compression quality in favour of compression speed. |
71 | * sacrifice some more compression quality in favour of compression speed. |
62 | * (roughly 1-2% worse compression for large blocks and |
72 | * (roughly 1-2% worse compression for large blocks and |
63 | * 9-10% for small, redundant, blocks and >>20% better speed in both cases) |
73 | * 9-10% for small, redundant, blocks and >>20% better speed in both cases) |
64 | * In short: enable this for binary data, disable this for text data. |
74 | * In short: when in need for speed, enable this for binary data, |
|
|
75 | * possibly disable this for text data. |
65 | */ |
76 | */ |
66 | #ifndef ULTRA_FAST |
77 | #ifndef ULTRA_FAST |
67 | # define ULTRA_FAST 1 |
78 | # define ULTRA_FAST 0 |
68 | #endif |
79 | #endif |
69 | |
80 | |
70 | /* |
81 | /* |
71 | * unconditionally aligning does not cost very much, so do it if unsure |
82 | * unconditionally aligning does not cost very much, so do it if unsure |
72 | */ |
83 | */ |
73 | #ifndef STRICT_ALIGN |
84 | #ifndef STRICT_ALIGN |
74 | # define STRICT_ALIGN !defined(__i386) |
85 | # define STRICT_ALIGN !(defined(__i386) || defined (__amd64)) |
75 | #endif |
86 | #endif |
76 | |
87 | |
77 | /* |
88 | /* |
78 | * use string functions to copy memory. |
89 | * use string functions to copy memory. |
79 | * this is usually a loss, even with glibc's optimized memcpy |
90 | * this is usually a loss, even with glibc's optimized memcpy |
… | |
… | |
81 | #ifndef USE_MEMCPY |
92 | #ifndef USE_MEMCPY |
82 | # define USE_MEMCPY 0 |
93 | # define USE_MEMCPY 0 |
83 | #endif |
94 | #endif |
84 | |
95 | |
85 | /* |
96 | /* |
86 | * you may choose to pre-set the hash table (might be faster on modern cpus |
97 | * you may choose to pre-set the hash table (might be faster on some |
87 | * and large (>>64k) blocks) |
98 | * modern cpus and large (>>64k) blocks) |
88 | */ |
99 | */ |
89 | #ifndef INIT_HTAB |
100 | #ifndef INIT_HTAB |
90 | # define INIT_HTAB 0 |
101 | # define INIT_HTAB 0 |
91 | #endif |
102 | #endif |
92 | |
103 | |
… | |
… | |
126 | # undef STRICT_ALIGN |
137 | # undef STRICT_ALIGN |
127 | # define STRICT_ALIGN 1 |
138 | # define STRICT_ALIGN 1 |
128 | # endif |
139 | # endif |
129 | #endif |
140 | #endif |
130 | |
141 | |
|
|
142 | #if ULTRA_FAST |
|
|
143 | # if defined(VERY_FAST) |
|
|
144 | # undef VERY_FAST |
|
|
145 | # endif |
|
|
146 | #endif |
|
|
147 | |
131 | #if USE_MEMCPY || INIT_HTAB |
148 | #if USE_MEMCPY || INIT_HTAB |
132 | # ifdef __cplusplus |
149 | # ifdef __cplusplus |
133 | # include <cstring> |
150 | # include <cstring> |
134 | # else |
151 | # else |
135 | # include <string.h> |
152 | # include <string.h> |