ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/liblzf/lzf_c.c
(Generate patch)

Comparing liblzf/lzf_c.c (file contents):
Revision 1.5 by pcg, Mon Dec 29 12:48:16 2003 UTC vs.
Revision 1.25 by root, Tue Nov 13 11:02:28 2007 UTC

1/* 1/*
2 * Copyright (c) 2000-2003 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])
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
41#define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) + h*3) & (HSIZE - 1)) 55# define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1))
56# endif
57#endif
42/* 58/*
43 * IDX works because it is very similar to a multiplicative hash, e.g. 59 * IDX works because it is very similar to a multiplicative hash, e.g.
44 * (h * 57321 >> (3*8 - HLOG)) 60 * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1))
61 * the latter is also quite fast on newer CPUs, and compresses similarly.
62 *
45 * the next one is also quite good, albeit slow ;) 63 * the next one is also quite good, albeit slow ;)
46 * (int)(cos(h & 0xffffff) * 1e6) 64 * (int)(cos(h & 0xffffff) * 1e6)
47 */ 65 */
48 66
49#if 0 67#if 0
50/* original lzv-like hash function */ 68/* original lzv-like hash function, much worse and thus slower */
51# define FRST(p) (p[0] << 5) ^ p[1] 69# define FRST(p) (p[0] << 5) ^ p[1]
52# define NEXT(v,p) ((v) << 5) ^ p[2] 70# define NEXT(v,p) ((v) << 5) ^ p[2]
53# define IDX(h) ((h) & (HSIZE - 1)) 71# define IDX(h) ((h) & (HSIZE - 1))
54#endif 72#endif
55 73
56#define MAX_LIT (1 << 5) 74#define MAX_LIT (1 << 5)
57#define MAX_OFF (1 << 13) 75#define MAX_OFF (1 << 13)
58#define MAX_REF ((1 << 8) + (1 << 3)) 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)
59 88
60/* 89/*
61 * compressed format 90 * compressed format
62 * 91 *
63 * 000LLLLL <L+1> ; literal 92 * 000LLLLL <L+1> ; literal
64 * LLLOOOOO oooooooo ; backref L 93 * LLLooooo oooooooo ; backref L
65 * 111OOOOO LLLLLLLL oooooooo ; backref L+7 94 * 111ooooo LLLLLLLL oooooooo ; backref L+7
66 * 95 *
67 */ 96 */
68 97
69unsigned int 98unsigned int
70lzf_compress (const void *const in_data, unsigned int in_len, 99lzf_compress (const void *const in_data, unsigned int in_len,
71 void *out_data, unsigned int out_len 100 void *out_data, unsigned int out_len
72#if LZF_STATE_ARG 101#if LZF_STATE_ARG
73 , LZF_STATE *htab 102 , LZF_STATE htab
74#endif 103#endif
75 ) 104 )
76{ 105{
77#if !LZF_STATE_ARG 106#if !LZF_STATE_ARG
78 LZF_STATE htab; 107 LZF_STATE htab;
… …
82 u8 *op = (u8 *)out_data; 111 u8 *op = (u8 *)out_data;
83 const u8 *in_end = ip + in_len; 112 const u8 *in_end = ip + in_len;
84 u8 *out_end = op + out_len; 113 u8 *out_end = op + out_len;
85 const u8 *ref; 114 const u8 *ref;
86 115
87 unsigned int hval = FRST (ip); 116 unsigned int hval;
88 unsigned long off; 117 unsigned long off;
89 int lit = 0; 118 int lit;
119
120 if (!in_len || !out_len)
121 return 0;
90 122
91#if INIT_HTAB 123#if INIT_HTAB
92# if USE_MEMCPY
93 memset (htab, 0, sizeof (htab)); 124 memset (htab, 0, sizeof (htab));
94# else 125# if 0
95 for (hslot = htab; hslot < htab + HSIZE; hslot++) 126 for (hslot = htab; hslot < htab + HSIZE; hslot++)
96 *hslot++ = ip; 127 *hslot++ = ip;
97# endif 128# endif
98#endif 129#endif
99 130
100 for (;;) 131 lit = 0; op++; /* start run */
132
133 hval = FRST (ip);
134 while (ip < in_end - 2)
101 { 135 {
102 if (ip < in_end - 2) 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 )
103 { 156 {
104 hval = NEXT (hval, ip);
105 hslot = htab + IDX (hval);
106 ref = *hslot; *hslot = ip;
107
108 if (1
109#if INIT_HTAB && !USE_MEMCPY
110 && ref < ip /* the next test will actually take care of this, but this is faster */
111#endif
112 && (off = ip - ref - 1) < MAX_OFF
113 && ip + 4 < in_end
114 && ref > (u8 *)in_data
115#if STRICT_ALIGN
116 && ref[0] == ip[0]
117 && ref[1] == ip[1]
118 && ref[2] == ip[2]
119#else
120 && *(u16 *)ref == *(u16 *)ip
121 && ref[2] == ip[2]
122#endif
123 )
124 {
125 /* match found at *ref++ */ 157 /* match found at *ref++ */
126 unsigned int len = 2; 158 unsigned int len = 2;
127 unsigned int maxlen = in_end - ip - len; 159 unsigned int maxlen = in_end - ip - len;
128 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; 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 }
129 192
130 do 193 do
131 len++; 194 len++;
132 while (len < maxlen && ref[len] == ip[len]); 195 while (len < maxlen && ref[len] == ip[len]);
133 196
134 if (op + lit + 1 + 3 >= out_end)
135 return 0;
136
137 if (lit)
138 { 197 break;
139 *op++ = lit - 1;
140 lit = -lit;
141 do
142 *op++ = ip[lit];
143 while (++lit);
144 } 198 }
145 199
146 len -= 2; 200 len -= 2;
147 ip++; 201 ip++;
148 202
149 if (len < 7) 203 if (len < 7)
150 { 204 {
151 *op++ = (off >> 8) + (len << 5); 205 *op++ = (off >> 8) + (len << 5);
152 } 206 }
153 else 207 else
154 { 208 {
155 *op++ = (off >> 8) + ( 7 << 5); 209 *op++ = (off >> 8) + ( 7 << 5);
156 *op++ = len - 7; 210 *op++ = len - 7;
157 } 211 }
158 212
159 *op++ = off; 213 *op++ = off;
160 214
161#if ULTRA_FAST 215#if ULTRA_FAST || VERY_FAST
162 ip += len; 216 ip += len;
217#if VERY_FAST && !ULTRA_FAST
218 --ip;
219#endif
163 hval = FRST (ip); 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 {
164 hval = NEXT (hval, ip); 234 hval = NEXT (hval, ip);
165 htab[IDX (hval)] = ip; 235 htab[IDX (hval)] = ip;
166 ip++; 236 ip++;
167#else
168 do
169 {
170 hval = NEXT (hval, ip);
171 htab[IDX (hval)] = ip;
172 ip++;
173 } 237 }
174 while (len--); 238 while (len--);
175#endif 239#endif
240 lit = 0; op++; /* start run */
176 continue; 241 continue;
177 }
178 } 242 }
179 else if (ip == in_end)
180 break;
181 243
182 /* one more literal byte we must copy */ 244 /* one more literal byte we must copy */
245
246 if (expect_false (op >= out_end))
247 return 0;
248
183 lit++; 249 lit++;
184 ip++; 250 *op++ = *ip++;
185 251
186 if (lit == MAX_LIT) 252 if (expect_false (lit == MAX_LIT))
187 { 253 {
188 if (op + 1 + MAX_LIT >= out_end) 254 op [- lit - 1] = lit - 1; /* stop run */
189 return 0; 255 lit = 0; op++; /* start run */
190
191 *op++ = MAX_LIT - 1;
192#if USE_MEMCPY
193 memcpy (op, ip - MAX_LIT, MAX_LIT);
194 op += MAX_LIT;
195 lit = 0;
196#else
197 lit = -lit;
198 do
199 *op++ = ip[lit];
200 while (++lit);
201#endif
202 } 256 }
203 } 257 }
204 258
205 if (lit) 259 if (op + 2 >= out_end)
260 return 0;
261
262 while (ip < in_end)
206 { 263 {
207 if (op + lit + 1 >= out_end) 264 lit++;
208 return 0;
209
210 *op++ = lit - 1; 265 *op++ = *ip++;
211 lit = -lit;
212 do
213 *op++ = ip[lit];
214 while (++lit);
215 } 266 }
216 267
268 op [- lit - 1] = lit - 1; /* end run */
269 op -= !lit; /* undo run if length is zero */
270
217 return op - (u8 *) out_data; 271 return op - (u8 *)out_data;
218} 272}
273

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines