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