1 |
/* |
2 |
* Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de> |
3 |
* |
4 |
* Redistribution and use in source and binary forms, with or without modifica- |
5 |
* tion, are permitted provided that the following conditions are met: |
6 |
* |
7 |
* 1. Redistributions of source code must retain the above copyright notice, |
8 |
* this list of conditions and the following disclaimer. |
9 |
* |
10 |
* 2. Redistributions in binary form must reproduce the above copyright |
11 |
* notice, this list of conditions and the following disclaimer in the |
12 |
* documentation and/or other materials provided with the distribution. |
13 |
* |
14 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
15 |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
16 |
* CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
17 |
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
18 |
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
20 |
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
21 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
22 |
* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
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. |
35 |
*/ |
36 |
|
37 |
#include "lzfP.h" |
38 |
|
39 |
#define HSIZE (1 << (HLOG)) |
40 |
|
41 |
/* |
42 |
* don't play with this unless you benchmark! |
43 |
* decompression is not dependent on the hash function |
44 |
* the hashing function might seem strange, just believe me |
45 |
* it works ;) |
46 |
*/ |
47 |
#ifndef FRST |
48 |
# define FRST(p) (((p[0]) << 8) | p[1]) |
49 |
# define NEXT(v,p) (((v) << 8) | p[2]) |
50 |
# if ULTRA_FAST |
51 |
# define IDX(h) ((( h >> (3*8 - HLOG)) - h ) & (HSIZE - 1)) |
52 |
# elif VERY_FAST |
53 |
# define IDX(h) ((( h >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) |
54 |
# else |
55 |
# define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) |
56 |
# endif |
57 |
#endif |
58 |
/* |
59 |
* IDX works because it is very similar to a multiplicative hash, e.g. |
60 |
* ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1)) |
61 |
* the latter is also quite fast on newer CPUs, and compresses similarly. |
62 |
* |
63 |
* the next one is also quite good, albeit slow ;) |
64 |
* (int)(cos(h & 0xffffff) * 1e6) |
65 |
*/ |
66 |
|
67 |
#if 0 |
68 |
/* original lzv-like hash function, much worse and thus slower */ |
69 |
# define FRST(p) (p[0] << 5) ^ p[1] |
70 |
# define NEXT(v,p) ((v) << 5) ^ p[2] |
71 |
# define IDX(h) ((h) & (HSIZE - 1)) |
72 |
#endif |
73 |
|
74 |
#define MAX_LIT (1 << 5) |
75 |
#define MAX_OFF (1 << 13) |
76 |
#define MAX_REF ((1 << 8) + (1 << 3)) |
77 |
|
78 |
#if __GNUC__ >= 3 |
79 |
# define expect(expr,value) __builtin_expect ((expr),(value)) |
80 |
# define inline inline |
81 |
#else |
82 |
# define expect(expr,value) (expr) |
83 |
# define inline static |
84 |
#endif |
85 |
|
86 |
#define expect_false(expr) expect ((expr) != 0, 0) |
87 |
#define expect_true(expr) expect ((expr) != 0, 1) |
88 |
|
89 |
/* |
90 |
* compressed format |
91 |
* |
92 |
* 000LLLLL <L+1> ; literal |
93 |
* LLLooooo oooooooo ; backref L |
94 |
* 111ooooo LLLLLLLL oooooooo ; backref L+7 |
95 |
* |
96 |
*/ |
97 |
|
98 |
unsigned int |
99 |
lzf_compress (const void *const in_data, unsigned int in_len, |
100 |
void *out_data, unsigned int out_len |
101 |
#if LZF_STATE_ARG |
102 |
, LZF_STATE htab |
103 |
#endif |
104 |
) |
105 |
{ |
106 |
#if !LZF_STATE_ARG |
107 |
LZF_STATE htab; |
108 |
#endif |
109 |
const u8 **hslot; |
110 |
const u8 *ip = (const u8 *)in_data; |
111 |
u8 *op = (u8 *)out_data; |
112 |
const u8 *in_end = ip + in_len; |
113 |
u8 *out_end = op + out_len; |
114 |
const u8 *ref; |
115 |
|
116 |
unsigned int hval; |
117 |
unsigned long off; |
118 |
int lit; |
119 |
|
120 |
if (!in_len || !out_len) |
121 |
return 0; |
122 |
|
123 |
#if INIT_HTAB |
124 |
memset (htab, 0, sizeof (htab)); |
125 |
# if 0 |
126 |
for (hslot = htab; hslot < htab + HSIZE; hslot++) |
127 |
*hslot++ = ip; |
128 |
# endif |
129 |
#endif |
130 |
|
131 |
lit = 0; op++; /* start run */ |
132 |
|
133 |
hval = FRST (ip); |
134 |
while (ip < in_end - 2) |
135 |
{ |
136 |
hval = NEXT (hval, ip); |
137 |
hslot = htab + IDX (hval); |
138 |
ref = *hslot; *hslot = ip; |
139 |
|
140 |
if (1 |
141 |
#if INIT_HTAB && !USE_MEMCPY |
142 |
&& ref < ip /* the next test will actually take care of this, but this is faster */ |
143 |
#endif |
144 |
&& (off = ip - ref - 1) < MAX_OFF |
145 |
&& ip + 4 < in_end |
146 |
&& ref > (u8 *)in_data |
147 |
#if STRICT_ALIGN |
148 |
&& ref[0] == ip[0] |
149 |
&& ref[1] == ip[1] |
150 |
&& ref[2] == ip[2] |
151 |
#else |
152 |
&& *(u16 *)ref == *(u16 *)ip |
153 |
&& ref[2] == ip[2] |
154 |
#endif |
155 |
) |
156 |
{ |
157 |
/* match found at *ref++ */ |
158 |
unsigned int len = 2; |
159 |
unsigned int maxlen = in_end - ip - len; |
160 |
maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; |
161 |
|
162 |
op [- lit - 1] = lit - 1; /* stop run */ |
163 |
op -= !lit; /* undo run if length is zero */ |
164 |
|
165 |
if (expect_false (op + 3 + 1 >= out_end)) |
166 |
return 0; |
167 |
|
168 |
for (;;) |
169 |
{ |
170 |
if (expect_true (maxlen > 16)) |
171 |
{ |
172 |
len++; if (ref [len] != ip [len]) break; |
173 |
len++; if (ref [len] != ip [len]) break; |
174 |
len++; if (ref [len] != ip [len]) break; |
175 |
len++; if (ref [len] != ip [len]) break; |
176 |
|
177 |
len++; if (ref [len] != ip [len]) break; |
178 |
len++; if (ref [len] != ip [len]) break; |
179 |
len++; if (ref [len] != ip [len]) break; |
180 |
len++; if (ref [len] != ip [len]) break; |
181 |
|
182 |
len++; if (ref [len] != ip [len]) break; |
183 |
len++; if (ref [len] != ip [len]) break; |
184 |
len++; if (ref [len] != ip [len]) break; |
185 |
len++; if (ref [len] != ip [len]) break; |
186 |
|
187 |
len++; if (ref [len] != ip [len]) break; |
188 |
len++; if (ref [len] != ip [len]) break; |
189 |
len++; if (ref [len] != ip [len]) break; |
190 |
len++; if (ref [len] != ip [len]) break; |
191 |
} |
192 |
|
193 |
do |
194 |
len++; |
195 |
while (len < maxlen && ref[len] == ip[len]); |
196 |
|
197 |
break; |
198 |
} |
199 |
|
200 |
len -= 2; |
201 |
ip++; |
202 |
|
203 |
if (len < 7) |
204 |
{ |
205 |
*op++ = (off >> 8) + (len << 5); |
206 |
} |
207 |
else |
208 |
{ |
209 |
*op++ = (off >> 8) + ( 7 << 5); |
210 |
*op++ = len - 7; |
211 |
} |
212 |
|
213 |
*op++ = off; |
214 |
|
215 |
#if ULTRA_FAST || VERY_FAST |
216 |
ip += len; |
217 |
#if VERY_FAST && !ULTRA_FAST |
218 |
--ip; |
219 |
#endif |
220 |
hval = FRST (ip); |
221 |
|
222 |
hval = NEXT (hval, ip); |
223 |
htab[IDX (hval)] = ip; |
224 |
ip++; |
225 |
|
226 |
#if VERY_FAST && !ULTRA_FAST |
227 |
hval = NEXT (hval, ip); |
228 |
htab[IDX (hval)] = ip; |
229 |
ip++; |
230 |
#endif |
231 |
#else |
232 |
do |
233 |
{ |
234 |
hval = NEXT (hval, ip); |
235 |
htab[IDX (hval)] = ip; |
236 |
ip++; |
237 |
} |
238 |
while (len--); |
239 |
#endif |
240 |
|
241 |
lit = 0; op++; /* start run */ |
242 |
} |
243 |
else |
244 |
{ |
245 |
/* one more literal byte we must copy */ |
246 |
if (expect_false (op >= out_end)) |
247 |
return 0; |
248 |
|
249 |
lit++; *op++ = *ip++; |
250 |
|
251 |
if (expect_false (lit == MAX_LIT)) |
252 |
{ |
253 |
op [- lit - 1] = lit - 1; /* stop run */ |
254 |
lit = 0; op++; /* start run */ |
255 |
} |
256 |
} |
257 |
} |
258 |
|
259 |
if (op + 2 > out_end) /* at most 2 bytes can be missing here */ |
260 |
return 0; |
261 |
|
262 |
while (ip < in_end) |
263 |
{ |
264 |
lit++; *op++ = *ip++; |
265 |
} |
266 |
|
267 |
op [- lit - 1] = lit - 1; /* end run */ |
268 |
op -= !lit; /* undo run if length is zero */ |
269 |
|
270 |
return op - (u8 *)out_data; |
271 |
} |
272 |
|