1 | /* |
1 | /* |
2 | * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de> |
2 | * Copyright (c) 2000-2010,2012 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 | * |
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, |
… | |
… | |
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. |
27 | * |
24 | * |
28 | * Alternatively, the contents of this file may be used under the terms of |
25 | * 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 |
26 | * the GNU General Public License ("GPL") version 2 or any later version, |
30 | * provisions of the GPL are applicable instead of the above. If you wish to |
27 | * in which case the provisions of the GPL are applicable instead of |
31 | * allow the use of your version of this file only under the terms of the |
28 | * the above. If you wish to allow the use of your version of this file |
32 | * GPL and not to allow others to use your version of this file under the |
29 | * only under the terms of the GPL and not to allow others to use your |
33 | * BSD license, indicate your decision by deleting the provisions above and |
30 | * version of this file under the BSD license, indicate your decision |
34 | * replace them with the notice and other provisions required by the GPL. If |
31 | * by deleting the provisions above and replace them with the notice |
35 | * you do not delete the provisions above, a recipient may use your version |
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 |
36 | * of this file under either the BSD or the GPL. |
34 | * either the BSD or the GPL. |
37 | */ |
35 | */ |
38 | |
36 | |
39 | #include "lzfP.h" |
37 | #include "lzfP.h" |
40 | |
38 | |
41 | #define HSIZE (1 << (HLOG)) |
39 | #define HSIZE (1 << (HLOG)) |
42 | |
40 | |
43 | /* |
41 | /* |
44 | * don't play with this unless you benchmark! |
42 | * don't play with this unless you benchmark! |
45 | * decompression is not dependent on the hash function |
43 | * the data format is not dependent on the hash function. |
46 | * the hashing function might seem strange, just believe me |
44 | * the hash function might seem strange, just believe me, |
47 | * it works ;) |
45 | * it works ;) |
48 | */ |
46 | */ |
49 | #ifndef FRST |
47 | #ifndef FRST |
50 | # define FRST(p) (((p[0]) << 8) | p[1]) |
48 | # define FRST(p) (((p[0]) << 8) | p[1]) |
51 | # define NEXT(v,p) (((v) << 8) | p[2]) |
49 | # define NEXT(v,p) (((v) << 8) | p[2]) |
|
|
50 | # if MULTIPLICATION_IS_SLOW |
|
|
51 | # if ULTRA_FAST |
|
|
52 | # define IDX(h) ((( h >> (3*8 - HLOG)) - h ) & (HSIZE - 1)) |
|
|
53 | # elif VERY_FAST |
|
|
54 | # define IDX(h) ((( h >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) |
|
|
55 | # else |
52 | # define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) |
56 | # define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) |
53 | //# define IDX(h) ((ip[0] * 121 ^ ip[1] * 33 ^ ip[2] * 1) & (HSIZE-1)) |
57 | # endif |
|
|
58 | # else |
|
|
59 | /* this one was developed with sesse, |
|
|
60 | * and is very similar to the one in snappy. |
|
|
61 | * it does need a modern enough cpu with a fast multiplication. |
|
|
62 | */ |
|
|
63 | # define IDX(h) (((h * 0x1e35a7bdU) >> (32 - HLOG - 8)) & (HSIZE - 1)) |
54 | #endif |
64 | # endif |
55 | /* |
65 | #endif |
56 | * IDX works because it is very similar to a multiplicative hash, e.g. |
|
|
57 | * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1)) |
|
|
58 | * the latter is also quite fast on newer CPUs, and compresses similarly. |
|
|
59 | * |
|
|
60 | * the next one is also quite good, albeit slow ;) |
|
|
61 | * (int)(cos(h & 0xffffff) * 1e6) |
|
|
62 | */ |
|
|
63 | |
66 | |
64 | #if 0 |
67 | #if 0 |
65 | /* original lzv-like hash function, much worse and thus slower */ |
68 | /* original lzv-like hash function, much worse and thus slower */ |
66 | # define FRST(p) (p[0] << 5) ^ p[1] |
69 | # define FRST(p) (p[0] << 5) ^ p[1] |
67 | # define NEXT(v,p) ((v) << 5) ^ p[2] |
70 | # define NEXT(v,p) ((v) << 5) ^ p[2] |
68 | # define IDX(h) ((h) & (HSIZE - 1)) |
71 | # define IDX(h) ((h) & (HSIZE - 1)) |
69 | #endif |
72 | #endif |
70 | |
73 | |
71 | #define MAX_LIT (1 << 5) |
74 | #if __GNUC__ >= 3 |
72 | #define MAX_OFF (1 << 13) |
75 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
73 | #define MAX_REF ((1 << 8) + (1 << 3)) |
76 | # define inline inline |
|
|
77 | #else |
|
|
78 | # define expect(expr,value) (expr) |
|
|
79 | # define inline static |
|
|
80 | #endif |
|
|
81 | |
|
|
82 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
83 | #define expect_true(expr) expect ((expr) != 0, 1) |
74 | |
84 | |
75 | /* |
85 | /* |
76 | * compressed format |
86 | * compressed format |
77 | * |
87 | * |
78 | * 000LLLLL <L+1> ; literal |
88 | * 000LLLLL <L+1> ; literal, L+1=1..33 octets |
79 | * LLLooooo oooooooo ; backref L |
89 | * LLLooooo oooooooo ; backref L+1=1..7 octets, o+1=1..4096 offset |
80 | * 111ooooo LLLLLLLL oooooooo ; backref L+7 |
90 | * 111ooooo LLLLLLLL oooooooo ; backref L+8 octets, o+1=1..4096 offset |
81 | * |
91 | * |
82 | */ |
92 | */ |
83 | |
93 | |
84 | unsigned int |
94 | unsigned int |
85 | lzf_compress (const void *const in_data, unsigned int in_len, |
95 | lzf_compress (const void *const in_data, unsigned int in_len, |
… | |
… | |
90 | ) |
100 | ) |
91 | { |
101 | { |
92 | #if !LZF_STATE_ARG |
102 | #if !LZF_STATE_ARG |
93 | LZF_STATE htab; |
103 | LZF_STATE htab; |
94 | #endif |
104 | #endif |
95 | const u8 **hslot; |
|
|
96 | const u8 *ip = (const u8 *)in_data; |
105 | const u8 *ip = (const u8 *)in_data; |
97 | u8 *op = (u8 *)out_data; |
106 | u8 *op = (u8 *)out_data; |
98 | const u8 *in_end = ip + in_len; |
107 | const u8 *in_end = ip + in_len; |
99 | u8 *out_end = op + out_len; |
108 | u8 *out_end = op + out_len; |
100 | const u8 *ref; |
109 | const u8 *ref; |
101 | |
110 | |
102 | unsigned int hval = FRST (ip); |
111 | /* off requires a type wide enough to hold a general pointer difference. |
|
|
112 | * ISO C doesn't have that (size_t might not be enough and ptrdiff_t only |
|
|
113 | * works for differences within a single object). We also assume that |
|
|
114 | * no bit pattern traps. Since the only platform that is both non-POSIX |
|
|
115 | * and fails to support both assumptions is windows 64 bit, we make a |
|
|
116 | * special workaround for it. |
|
|
117 | */ |
|
|
118 | #if defined (_WIN32) && defined (_M_X64) |
|
|
119 | /* workaround for missing POSIX compliance */ |
|
|
120 | #if __GNUC__ |
|
|
121 | unsigned long long off; |
|
|
122 | #else |
|
|
123 | unsigned __int64 off; |
|
|
124 | #endif |
|
|
125 | #else |
103 | unsigned long off; |
126 | unsigned long off; |
104 | int lit = 0; |
127 | #endif |
|
|
128 | unsigned int hval; |
|
|
129 | int lit; |
|
|
130 | |
|
|
131 | if (!in_len || !out_len) |
|
|
132 | return 0; |
105 | |
133 | |
106 | #if INIT_HTAB |
134 | #if INIT_HTAB |
107 | # if USE_MEMCPY |
|
|
108 | memset (htab, 0, sizeof (htab)); |
135 | memset (htab, 0, sizeof (LZF_STATE)); |
109 | # else |
|
|
110 | for (hslot = htab; hslot < htab + HSIZE; hslot++) |
|
|
111 | *hslot++ = ip; |
|
|
112 | # endif |
136 | #endif |
113 | #endif |
|
|
114 | |
137 | |
115 | for (;;) |
138 | lit = 0; op++; /* start run */ |
|
|
139 | |
|
|
140 | hval = FRST (ip); |
|
|
141 | while (ip < in_end - 2) |
116 | { |
142 | { |
117 | if (ip < in_end - 2) |
143 | LZF_HSLOT *hslot; |
|
|
144 | |
|
|
145 | hval = NEXT (hval, ip); |
|
|
146 | hslot = htab + IDX (hval); |
|
|
147 | ref = *hslot + LZF_HSLOT_BIAS; *hslot = ip - LZF_HSLOT_BIAS; |
|
|
148 | |
|
|
149 | if (1 |
|
|
150 | #if INIT_HTAB |
|
|
151 | && ref < ip /* the next test will actually take care of this, but this is faster */ |
|
|
152 | #endif |
|
|
153 | && (off = ip - ref - 1) < LZF_MAX_OFF |
|
|
154 | && ref > (u8 *)in_data |
|
|
155 | && ref[2] == ip[2] |
|
|
156 | #if STRICT_ALIGN |
|
|
157 | && ((ref[1] << 8) | ref[0]) == ((ip[1] << 8) | ip[0]) |
|
|
158 | #else |
|
|
159 | && *(u16 *)ref == *(u16 *)ip |
|
|
160 | #endif |
|
|
161 | ) |
118 | { |
162 | { |
119 | hval = NEXT (hval, ip); |
|
|
120 | hslot = htab + IDX (hval); |
|
|
121 | ref = *hslot; *hslot = ip; |
|
|
122 | |
|
|
123 | if (1 |
|
|
124 | #if INIT_HTAB && !USE_MEMCPY |
|
|
125 | && ref < ip /* the next test will actually take care of this, but this is faster */ |
|
|
126 | #endif |
|
|
127 | && (off = ip - ref - 1) < MAX_OFF |
|
|
128 | && ip + 4 < in_end |
|
|
129 | && ref > (u8 *)in_data |
|
|
130 | #if STRICT_ALIGN |
|
|
131 | && ref[0] == ip[0] |
|
|
132 | && ref[1] == ip[1] |
|
|
133 | && ref[2] == ip[2] |
|
|
134 | #else |
|
|
135 | && *(u16 *)ref == *(u16 *)ip |
|
|
136 | && ref[2] == ip[2] |
|
|
137 | #endif |
|
|
138 | ) |
|
|
139 | { |
|
|
140 | /* match found at *ref++ */ |
163 | /* match found at *ref++ */ |
141 | unsigned int len = 2; |
164 | unsigned int len = 2; |
142 | unsigned int maxlen = in_end - ip - len; |
165 | unsigned int maxlen = in_end - ip - len; |
143 | maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
166 | maxlen = maxlen > LZF_MAX_REF ? LZF_MAX_REF : maxlen; |
144 | |
167 | |
145 | if (op + lit + 1 + 3 >= out_end) |
168 | if (expect_false (op + 3 + 1 >= out_end)) /* first a faster conservative test */ |
|
|
169 | if (op - !lit + 3 + 1 >= out_end) /* second the exact but rare test */ |
146 | return 0; |
170 | return 0; |
|
|
171 | |
|
|
172 | op [- lit - 1] = lit - 1; /* stop run */ |
|
|
173 | op -= !lit; /* undo run if length is zero */ |
|
|
174 | |
|
|
175 | for (;;) |
|
|
176 | { |
|
|
177 | if (expect_true (maxlen > 16)) |
|
|
178 | { |
|
|
179 | len++; if (ref [len] != ip [len]) break; |
|
|
180 | len++; if (ref [len] != ip [len]) break; |
|
|
181 | len++; if (ref [len] != ip [len]) break; |
|
|
182 | len++; if (ref [len] != ip [len]) break; |
|
|
183 | |
|
|
184 | len++; if (ref [len] != ip [len]) break; |
|
|
185 | len++; if (ref [len] != ip [len]) break; |
|
|
186 | len++; if (ref [len] != ip [len]) break; |
|
|
187 | len++; if (ref [len] != ip [len]) break; |
|
|
188 | |
|
|
189 | len++; if (ref [len] != ip [len]) break; |
|
|
190 | len++; if (ref [len] != ip [len]) break; |
|
|
191 | len++; if (ref [len] != ip [len]) break; |
|
|
192 | len++; if (ref [len] != ip [len]) break; |
|
|
193 | |
|
|
194 | len++; if (ref [len] != ip [len]) break; |
|
|
195 | len++; if (ref [len] != ip [len]) break; |
|
|
196 | len++; if (ref [len] != ip [len]) break; |
|
|
197 | len++; if (ref [len] != ip [len]) break; |
|
|
198 | } |
147 | |
199 | |
148 | do |
200 | do |
149 | len++; |
201 | len++; |
150 | while (len < maxlen && ref[len] == ip[len]); |
202 | while (len < maxlen && ref[len] == ip[len]); |
151 | |
203 | |
152 | if (lit) |
|
|
153 | { |
204 | break; |
154 | *op++ = lit - 1; |
|
|
155 | lit = -lit; |
|
|
156 | do |
|
|
157 | *op++ = ip[lit]; |
|
|
158 | while (++lit); |
|
|
159 | } |
205 | } |
160 | |
206 | |
|
|
207 | len -= 2; /* len is now #octets - 1 */ |
|
|
208 | ip++; |
|
|
209 | |
|
|
210 | if (len < 7) |
|
|
211 | { |
|
|
212 | *op++ = (off >> 8) + (len << 5); |
|
|
213 | } |
|
|
214 | else |
|
|
215 | { |
|
|
216 | *op++ = (off >> 8) + ( 7 << 5); |
161 | len -= 2; |
217 | *op++ = len - 7; |
|
|
218 | } |
|
|
219 | |
|
|
220 | *op++ = off; |
|
|
221 | |
|
|
222 | lit = 0; op++; /* start run */ |
|
|
223 | |
|
|
224 | ip += len + 1; |
|
|
225 | |
|
|
226 | if (expect_false (ip >= in_end - 2)) |
|
|
227 | break; |
|
|
228 | |
|
|
229 | #if ULTRA_FAST || VERY_FAST |
|
|
230 | --ip; |
|
|
231 | # if VERY_FAST && !ULTRA_FAST |
|
|
232 | --ip; |
|
|
233 | # endif |
|
|
234 | hval = FRST (ip); |
|
|
235 | |
|
|
236 | hval = NEXT (hval, ip); |
|
|
237 | htab[IDX (hval)] = ip - LZF_HSLOT_BIAS; |
|
|
238 | ip++; |
|
|
239 | |
|
|
240 | # if VERY_FAST && !ULTRA_FAST |
|
|
241 | hval = NEXT (hval, ip); |
|
|
242 | htab[IDX (hval)] = ip - LZF_HSLOT_BIAS; |
|
|
243 | ip++; |
|
|
244 | # endif |
|
|
245 | #else |
|
|
246 | ip -= len + 1; |
|
|
247 | |
|
|
248 | do |
|
|
249 | { |
|
|
250 | hval = NEXT (hval, ip); |
|
|
251 | htab[IDX (hval)] = ip - LZF_HSLOT_BIAS; |
162 | ip++; |
252 | ip++; |
163 | |
|
|
164 | if (len < 7) |
|
|
165 | { |
|
|
166 | *op++ = (off >> 8) + (len << 5); |
|
|
167 | } |
253 | } |
168 | else |
|
|
169 | { |
|
|
170 | *op++ = (off >> 8) + ( 7 << 5); |
|
|
171 | *op++ = len - 7; |
|
|
172 | } |
|
|
173 | |
|
|
174 | *op++ = off; |
|
|
175 | |
|
|
176 | #if ULTRA_FAST || VERY_FAST |
|
|
177 | ip += len; |
|
|
178 | #if VERY_FAST && !ULTRA_FAST |
|
|
179 | --ip; |
|
|
180 | #endif |
|
|
181 | hval = FRST (ip); |
|
|
182 | |
|
|
183 | hval = NEXT (hval, ip); |
|
|
184 | htab[IDX (hval)] = ip; |
|
|
185 | ip++; |
|
|
186 | |
|
|
187 | #if VERY_FAST && !ULTRA_FAST |
|
|
188 | hval = NEXT (hval, ip); |
|
|
189 | htab[IDX (hval)] = ip; |
|
|
190 | ip++; |
|
|
191 | #endif |
|
|
192 | #else |
|
|
193 | do |
|
|
194 | { |
|
|
195 | hval = NEXT (hval, ip); |
|
|
196 | htab[IDX (hval)] = ip; |
|
|
197 | ip++; |
|
|
198 | } |
|
|
199 | while (len--); |
254 | while (len--); |
200 | #endif |
255 | #endif |
201 | continue; |
|
|
202 | } |
|
|
203 | } |
256 | } |
204 | else if (ip == in_end) |
257 | else |
205 | break; |
|
|
206 | |
|
|
207 | /* one more literal byte we must copy */ |
|
|
208 | lit++; |
|
|
209 | ip++; |
|
|
210 | |
|
|
211 | if (lit == MAX_LIT) |
|
|
212 | { |
258 | { |
213 | if (op + 1 + MAX_LIT >= out_end) |
259 | /* one more literal byte we must copy */ |
|
|
260 | if (expect_false (op >= out_end)) |
214 | return 0; |
261 | return 0; |
215 | |
262 | |
216 | *op++ = MAX_LIT - 1; |
263 | lit++; *op++ = *ip++; |
217 | #if USE_MEMCPY |
264 | |
218 | memcpy (op, ip - MAX_LIT, MAX_LIT); |
265 | if (expect_false (lit == LZF_MAX_LIT)) |
219 | op += MAX_LIT; |
|
|
220 | lit = 0; |
|
|
221 | #else |
|
|
222 | lit = -lit; |
|
|
223 | do |
266 | { |
224 | *op++ = ip[lit]; |
267 | op [- lit - 1] = lit - 1; /* stop run */ |
225 | while (++lit); |
268 | lit = 0; op++; /* start run */ |
226 | #endif |
269 | } |
227 | } |
270 | } |
228 | } |
271 | } |
229 | |
272 | |
230 | if (lit) |
273 | if (op + 3 > out_end) /* at most 3 bytes can be missing here */ |
|
|
274 | return 0; |
|
|
275 | |
|
|
276 | while (ip < in_end) |
231 | { |
277 | { |
232 | if (op + lit + 1 >= out_end) |
278 | lit++; *op++ = *ip++; |
233 | return 0; |
|
|
234 | |
279 | |
235 | *op++ = lit - 1; |
280 | if (expect_false (lit == LZF_MAX_LIT)) |
236 | lit = -lit; |
281 | { |
237 | do |
282 | op [- lit - 1] = lit - 1; /* stop run */ |
238 | *op++ = ip[lit]; |
283 | lit = 0; op++; /* start run */ |
239 | while (++lit); |
284 | } |
240 | } |
285 | } |
241 | |
286 | |
|
|
287 | op [- lit - 1] = lit - 1; /* end run */ |
|
|
288 | op -= !lit; /* undo run if length is zero */ |
|
|
289 | |
242 | return op - (u8 *) out_data; |
290 | return op - (u8 *)out_data; |
243 | } |
291 | } |
|
|
292 | |