| 1 | /* |
1 | /* |
| 2 | * Copyright (c) 2000-2002 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, |
| 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 | * |
|
|
| 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 | * |
13 | * |
| 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- |
| … | |
… | |
| 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 | #include "lzfP.h" |
37 | #include "lzfP.h" |
| 30 | |
38 | |
| 31 | #define HSIZE (1 << (HLOG)) |
39 | #define HSIZE (1 << (HLOG)) |
| … | |
… | |
| 34 | * don't play with this unless you benchmark! |
42 | * don't play with this unless you benchmark! |
| 35 | * decompression is not dependent on the hash function |
43 | * decompression is not dependent on the hash function |
| 36 | * the hashing function might seem strange, just believe me |
44 | * the hashing function might seem strange, just believe me |
| 37 | * it works ;) |
45 | * it works ;) |
| 38 | */ |
46 | */ |
|
|
47 | #ifndef FRST |
| 39 | #define FRST(p) (((p[0]) << 8) + p[1]) |
48 | # define FRST(p) (((p[0]) << 8) | p[1]) |
| 40 | #define NEXT(v,p) (((v) << 8) + p[2]) |
49 | # define NEXT(v,p) (((v) << 8) | p[2]) |
| 41 | #define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) + h*3) & (HSIZE - 1)) |
50 | # define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) |
|
|
51 | /*# define IDX(h) ((ip[0] * 121 ^ ip[1] * 33 ^ ip[2] * 1) & (HSIZE-1))*/ |
|
|
52 | #endif |
| 42 | /* |
53 | /* |
| 43 | * IDX works because it is very similar to a multiplicative hash, e.g. |
54 | * IDX works because it is very similar to a multiplicative hash, e.g. |
| 44 | * (h * 57321 >> (3*8 - HLOG)) |
55 | * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1)) |
|
|
56 | * the latter is also quite fast on newer CPUs, and compresses similarly. |
|
|
57 | * |
| 45 | * the next one is also quite good, albeit slow ;) |
58 | * the next one is also quite good, albeit slow ;) |
| 46 | * (int)(cos(h & 0xffffff) * 1e6) |
59 | * (int)(cos(h & 0xffffff) * 1e6) |
| 47 | */ |
60 | */ |
| 48 | |
61 | |
| 49 | #if 0 |
62 | #if 0 |
| 50 | /* original lzv-like hash function */ |
63 | /* original lzv-like hash function, much worse and thus slower */ |
| 51 | # define FRST(p) (p[0] << 5) ^ p[1] |
64 | # define FRST(p) (p[0] << 5) ^ p[1] |
| 52 | # define NEXT(v,p) ((v) << 5) ^ p[2] |
65 | # define NEXT(v,p) ((v) << 5) ^ p[2] |
| 53 | # define IDX(h) ((h) & (HSIZE - 1)) |
66 | # define IDX(h) ((h) & (HSIZE - 1)) |
| 54 | #endif |
67 | #endif |
| 55 | |
68 | |
| 56 | #define MAX_LIT (1 << 5) |
69 | #define MAX_LIT (1 << 5) |
| 57 | #define MAX_OFF (1 << 13) |
70 | #define MAX_OFF (1 << 13) |
| 58 | #define MAX_REF ((1 << 8) + (1 << 3)) |
71 | #define MAX_REF ((1 << 8) + (1 << 3)) |
|
|
72 | |
|
|
73 | #if (__i386 || __amd64) && __GNUC__ >= 3 |
|
|
74 | # define lzf_movsb(dst, src, len) \ |
|
|
75 | asm ("rep movsb" \ |
|
|
76 | : "=D" (dst), "=S" (src), "=c" (len) \ |
|
|
77 | : "0" (dst), "1" (src), "2" (len)); |
|
|
78 | #endif |
| 59 | |
79 | |
| 60 | /* |
80 | /* |
| 61 | * compressed format |
81 | * compressed format |
| 62 | * |
82 | * |
| 63 | * 000LLLLL <L+1> ; literal |
83 | * 000LLLLL <L+1> ; literal |
| 64 | * LLLOOOOO oooooooo ; backref L |
84 | * LLLooooo oooooooo ; backref L |
| 65 | * 111OOOOO LLLLLLLL oooooooo ; backref L+7 |
85 | * 111ooooo LLLLLLLL oooooooo ; backref L+7 |
| 66 | * |
86 | * |
| 67 | */ |
87 | */ |
| 68 | |
88 | |
| 69 | unsigned int |
89 | unsigned int |
| 70 | lzf_compress (const void *const in_data, unsigned int in_len, |
90 | lzf_compress (const void *const in_data, unsigned int in_len, |
| 71 | void *out_data, unsigned int out_len) |
91 | void *out_data, unsigned int out_len |
|
|
92 | #if LZF_STATE_ARG |
|
|
93 | , LZF_STATE htab |
|
|
94 | #endif |
|
|
95 | ) |
| 72 | { |
96 | { |
| 73 | const u8 *htab[HSIZE]; |
97 | #if !LZF_STATE_ARG |
|
|
98 | LZF_STATE htab; |
|
|
99 | #endif |
| 74 | const u8 **hslot; |
100 | const u8 **hslot; |
| 75 | const u8 *ip = in_data; |
101 | const u8 *ip = (const u8 *)in_data; |
| 76 | u8 *op = out_data; |
102 | u8 *op = (u8 *)out_data; |
| 77 | const u8 *in_end = ip + in_len; |
103 | const u8 *in_end = ip + in_len; |
| 78 | u8 *out_end = op + out_len; |
104 | u8 *out_end = op + out_len; |
| 79 | const u8 *ref; |
105 | const u8 *ref; |
| 80 | |
106 | |
| 81 | unsigned int hval = FRST (ip); |
107 | unsigned int hval = FRST (ip); |
| 82 | unsigned long off; |
108 | unsigned long off; |
| 83 | int lit = 0; |
109 | int lit = 0; |
| 84 | |
110 | |
| 85 | #if INIT_HTAB |
111 | #if INIT_HTAB |
| 86 | # if USE_MEMCPY |
|
|
| 87 | memset (htab, 0, sizeof (htab)); |
112 | memset (htab, 0, sizeof (htab)); |
| 88 | # else |
113 | # if 0 |
| 89 | for (hslot = htab; hslot < htab + HSIZE; hslot++) |
114 | for (hslot = htab; hslot < htab + HSIZE; hslot++) |
| 90 | *hslot++ = ip; |
115 | *hslot++ = ip; |
| 91 | # endif |
116 | # endif |
| 92 | #endif |
117 | #endif |
| 93 | |
118 | |
| 94 | do |
119 | for (;;) |
| 95 | { |
120 | { |
|
|
121 | if (ip < in_end - 2) |
|
|
122 | { |
| 96 | hval = NEXT (hval, ip); |
123 | hval = NEXT (hval, ip); |
| 97 | hslot = htab + IDX (hval); |
124 | hslot = htab + IDX (hval); |
| 98 | ref = *hslot; *hslot = ip; |
125 | ref = *hslot; *hslot = ip; |
| 99 | |
126 | |
| 100 | if (1 |
127 | if (1 |
| 101 | #if INIT_HTAB && !USE_MEMCPY |
128 | #if INIT_HTAB && !USE_MEMCPY |
| 102 | && ref < ip /* the next test will actually take care of this, but it is faster */ |
129 | && ref < ip /* the next test will actually take care of this, but this is faster */ |
| 103 | #endif |
130 | #endif |
| 104 | && (off = ip - ref - 1) < MAX_OFF |
131 | && (off = ip - ref - 1) < MAX_OFF |
| 105 | && ip + 4 < in_end |
132 | && ip + 4 < in_end |
| 106 | && ref > (u8 *)in_data |
133 | && ref > (u8 *)in_data |
| 107 | #if STRICT_ALIGN |
134 | #if STRICT_ALIGN |
| 108 | && ref[0] == ip[0] |
135 | && ref[0] == ip[0] |
| 109 | && ref[1] == ip[1] |
136 | && ref[1] == ip[1] |
| 110 | && ref[2] == ip[2] |
137 | && ref[2] == ip[2] |
| 111 | #else |
138 | #else |
| 112 | && *(u16 *)ref == *(u16 *)ip |
139 | && *(u16 *)ref == *(u16 *)ip |
| 113 | && ref[2] == ip[2] |
140 | && ref[2] == ip[2] |
| 114 | #endif |
141 | #endif |
| 115 | ) |
142 | ) |
| 116 | { |
143 | { |
| 117 | /* match found at *ref++ */ |
144 | /* match found at *ref++ */ |
| 118 | unsigned int len = 2; |
145 | unsigned int len = 2; |
| 119 | unsigned int maxlen = in_end - ip - len; |
146 | unsigned int maxlen = in_end - ip - len; |
| 120 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
147 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
| 121 | |
148 | |
| 122 | do |
149 | if (op + lit + 1 + 3 >= out_end) |
| 123 | len++; |
150 | return 0; |
|
|
151 | |
|
|
152 | do |
|
|
153 | len++; |
| 124 | while (len < maxlen && ref[len] == ip[len]); |
154 | while (len < maxlen && ref[len] == ip[len]); |
| 125 | |
155 | |
| 126 | if (op + lit + 1 + 3 >= out_end) |
156 | if (lit) |
| 127 | return 0; |
157 | { |
| 128 | |
|
|
| 129 | if (lit) |
|
|
| 130 | { |
|
|
| 131 | *op++ = lit - 1; |
158 | *op++ = lit - 1; |
| 132 | lit = -lit; |
159 | lit = -lit; |
| 133 | do |
160 | do |
| 134 | *op++ = ip[lit]; |
161 | *op++ = ip[lit]; |
| 135 | while (++lit); |
162 | while (++lit); |
| 136 | } |
163 | } |
| 137 | |
164 | |
| 138 | len -= 2; |
165 | len -= 2; |
| 139 | ip++; |
166 | ip++; |
| 140 | |
167 | |
| 141 | if (len < 7) |
168 | if (len < 7) |
| 142 | { |
169 | { |
| 143 | *op++ = (off >> 8) + (len << 5); |
170 | *op++ = (off >> 8) + (len << 5); |
| 144 | } |
171 | } |
| 145 | else |
172 | else |
| 146 | { |
173 | { |
| 147 | *op++ = (off >> 8) + ( 7 << 5); |
174 | *op++ = (off >> 8) + ( 7 << 5); |
| 148 | *op++ = len - 7; |
175 | *op++ = len - 7; |
| 149 | } |
176 | } |
| 150 | |
177 | |
| 151 | *op++ = off; |
178 | *op++ = off; |
| 152 | |
179 | |
| 153 | #if ULTRA_FAST |
180 | #if ULTRA_FAST || VERY_FAST |
| 154 | ip += len; |
181 | ip += len; |
|
|
182 | #if VERY_FAST && !ULTRA_FAST |
|
|
183 | --ip; |
|
|
184 | #endif |
| 155 | hval = FRST (ip); |
185 | hval = FRST (ip); |
|
|
186 | |
| 156 | hval = NEXT (hval, ip); |
187 | hval = NEXT (hval, ip); |
| 157 | htab[IDX (hval)] = ip; |
188 | htab[IDX (hval)] = ip; |
| 158 | ip++; |
189 | ip++; |
| 159 | #else |
190 | |
| 160 | do |
191 | #if VERY_FAST && !ULTRA_FAST |
| 161 | { |
|
|
| 162 | hval = NEXT (hval, ip); |
192 | hval = NEXT (hval, ip); |
| 163 | htab[IDX (hval)] = ip; |
193 | htab[IDX (hval)] = ip; |
|
|
194 | ip++; |
|
|
195 | #endif |
|
|
196 | #else |
|
|
197 | do |
|
|
198 | { |
|
|
199 | hval = NEXT (hval, ip); |
|
|
200 | htab[IDX (hval)] = ip; |
|
|
201 | ip++; |
|
|
202 | } |
|
|
203 | while (len--); |
|
|
204 | #endif |
|
|
205 | continue; |
|
|
206 | } |
|
|
207 | } |
|
|
208 | else if (ip == in_end) |
|
|
209 | break; |
|
|
210 | |
|
|
211 | /* one more literal byte we must copy */ |
|
|
212 | lit++; |
| 164 | ip++; |
213 | ip++; |
| 165 | } |
|
|
| 166 | while (len--); |
|
|
| 167 | #endif |
|
|
| 168 | } |
|
|
| 169 | else |
|
|
| 170 | { |
|
|
| 171 | /* one more literal byte we must copy */ |
|
|
| 172 | lit++; |
|
|
| 173 | ip++; |
|
|
| 174 | |
214 | |
| 175 | if (lit == MAX_LIT) |
215 | if (lit == MAX_LIT) |
| 176 | { |
216 | { |
| 177 | if (op + 1 + MAX_LIT >= out_end) |
217 | if (op + 1 + MAX_LIT >= out_end) |
| 178 | return 0; |
218 | return 0; |
| 179 | |
219 | |
| 180 | *op++ = MAX_LIT - 1; |
220 | *op++ = MAX_LIT - 1; |
| 181 | #if USE_MEMCPY |
221 | |
| 182 | memcpy (op, ip - MAX_LIT, MAX_LIT); |
222 | #ifdef lzf_movsb |
| 183 | op += MAX_LIT; |
223 | ip -= lit; |
| 184 | lit = 0; |
224 | lzf_movsb (op, ip, lit); |
| 185 | #else |
225 | #else |
| 186 | lit = -lit; |
226 | lit = -lit; |
| 187 | do |
227 | do |
| 188 | *op++ = ip[lit]; |
228 | *op++ = ip[lit]; |
| 189 | while (++lit); |
229 | while (++lit); |
| 190 | #endif |
230 | #endif |
| 191 | } |
231 | } |
| 192 | } |
|
|
| 193 | } |
232 | } |
| 194 | while (ip < in_end); |
|
|
| 195 | |
233 | |
| 196 | if (lit) |
234 | if (lit) |
| 197 | { |
235 | { |
| 198 | if (op + lit + 1 >= out_end) |
236 | if (op + lit + 1 >= out_end) |
| 199 | return 0; |
237 | return 0; |
| 200 | |
238 | |
| 201 | *op++ = lit - 1; |
239 | *op++ = lit - 1; |
|
|
240 | #ifdef lzf_movsb |
|
|
241 | ip -= lit; |
|
|
242 | lzf_movsb (op, ip, lit); |
|
|
243 | #else |
| 202 | lit = -lit; |
244 | lit = -lit; |
| 203 | do |
245 | do |
| 204 | *op++ = ip[lit]; |
246 | *op++ = ip[lit]; |
| 205 | while (++lit); |
247 | while (++lit); |
|
|
248 | #endif |
| 206 | } |
249 | } |
| 207 | |
250 | |
| 208 | return op - (u8 *) out_data; |
251 | return op - (u8 *) out_data; |
| 209 | } |
252 | } |
|
|
253 | |
