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.12 by root, Tue Jun 19 21:25:01 2007 UTC vs.
Revision 1.31 by root, Tue May 6 22:49:18 2008 UTC

1/* 1/*
2 * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de> 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-
… …
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))
… …
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 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
52# define IDX(h) ((((h ^ (h << 5)) >> (3*8 - HLOG)) - h*5) & (HSIZE - 1)) 55# 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)) 56# endif
54#endif 57#endif
55/* 58/*
56 * 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.
57 * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1)) 60 * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1))
58 * the latter is also quite fast on newer CPUs, and compresses similarly. 61 * the latter is also quite fast on newer CPUs, and compresses similarly.
… …
69#endif 72#endif
70 73
71#define MAX_LIT (1 << 5) 74#define MAX_LIT (1 << 5)
72#define MAX_OFF (1 << 13) 75#define MAX_OFF (1 << 13)
73#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)
74 88
75/* 89/*
76 * compressed format 90 * compressed format
77 * 91 *
78 * 000LLLLL <L+1> ; literal 92 * 000LLLLL <L+1> ; literal
… …
97 u8 *op = (u8 *)out_data; 111 u8 *op = (u8 *)out_data;
98 const u8 *in_end = ip + in_len; 112 const u8 *in_end = ip + in_len;
99 u8 *out_end = op + out_len; 113 u8 *out_end = op + out_len;
100 const u8 *ref; 114 const u8 *ref;
101 115
102 unsigned int hval = FRST (ip); 116 unsigned int hval;
117#if WIN32
118 unsigned _int64 off; /* workaround for microsoft bug (they claim to support POSIX) */
119#else
103 unsigned long off; 120 unsigned long off;
104 int lit = 0; 121#endif
122 int lit;
123
124 if (!in_len || !out_len)
125 return 0;
105 126
106#if INIT_HTAB 127#if INIT_HTAB
107# if USE_MEMCPY
108 memset (htab, 0, sizeof (htab)); 128 memset (htab, 0, sizeof (htab));
109# else 129# if 0
110 for (hslot = htab; hslot < htab + HSIZE; hslot++) 130 for (hslot = htab; hslot < htab + HSIZE; hslot++)
111 *hslot++ = ip; 131 *hslot++ = ip;
112# endif 132# endif
113#endif 133#endif
114 134
115 for (;;) 135 lit = 0; op++; /* start run */
136
137 hval = FRST (ip);
138 while (ip < in_end - 2)
116 { 139 {
117 if (ip < in_end - 2) 140 hval = NEXT (hval, ip);
141 hslot = htab + IDX (hval);
142 ref = *hslot; *hslot = ip;
143
144 if (1
145#if INIT_HTAB
146 && ref < ip /* the next test will actually take care of this, but this is faster */
147#endif
148 && (off = ip - ref - 1) < MAX_OFF
149 && ip + 4 < in_end
150 && ref > (u8 *)in_data
151#if STRICT_ALIGN
152 && ref[0] == ip[0]
153 && ref[1] == ip[1]
154 && ref[2] == ip[2]
155#else
156 && *(u16 *)ref == *(u16 *)ip
157 && ref[2] == ip[2]
158#endif
159 )
118 { 160 {
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++ */ 161 /* match found at *ref++ */
141 unsigned int len = 2; 162 unsigned int len = 2;
142 unsigned int maxlen = in_end - ip - len; 163 unsigned int maxlen = in_end - ip - len;
143 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; 164 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
144 165
145 if (op + lit + 1 + 3 >= out_end) 166 op [- lit - 1] = lit - 1; /* stop run */
167 op -= !lit; /* undo run if length is zero */
168
169 if (expect_false (op + 3 + 1 >= out_end))
146 return 0; 170 return 0;
171
172 for (;;)
173 {
174 if (expect_true (maxlen > 16))
175 {
176 len++; if (ref [len] != ip [len]) break;
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
181 len++; if (ref [len] != ip [len]) break;
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
186 len++; if (ref [len] != ip [len]) break;
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
191 len++; if (ref [len] != ip [len]) break;
192 len++; if (ref [len] != ip [len]) break;
193 len++; if (ref [len] != ip [len]) break;
194 len++; if (ref [len] != ip [len]) break;
195 }
147 196
148 do 197 do
149 len++; 198 len++;
150 while (len < maxlen && ref[len] == ip[len]); 199 while (len < maxlen && ref[len] == ip[len]);
151 200
152 if (lit)
153 { 201 break;
154 *op++ = lit - 1;
155 lit = -lit;
156 do
157 *op++ = ip[lit];
158 while (++lit);
159 } 202 }
160 203
161 len -= 2; 204 len -= 2;
162 ip++; 205 ip++;
163 206
164 if (len < 7) 207 if (len < 7)
165 { 208 {
166 *op++ = (off >> 8) + (len << 5); 209 *op++ = (off >> 8) + (len << 5);
167 } 210 }
168 else 211 else
169 { 212 {
170 *op++ = (off >> 8) + ( 7 << 5); 213 *op++ = (off >> 8) + ( 7 << 5);
171 *op++ = len - 7; 214 *op++ = len - 7;
172 } 215 }
173 216
174 *op++ = off; 217 *op++ = off;
175 218
176#if ULTRA_FAST || VERY_FAST 219#if ULTRA_FAST || VERY_FAST
177 ip += len; 220 ip += len;
178#if VERY_FAST && !ULTRA_FAST 221#if VERY_FAST && !ULTRA_FAST
179 --ip; 222 --ip;
180#endif 223#endif
181 hval = FRST (ip); 224 hval = FRST (ip);
182 225
226 hval = NEXT (hval, ip);
227 htab[IDX (hval)] = ip;
228 ip++;
229
230#if VERY_FAST && !ULTRA_FAST
231 hval = NEXT (hval, ip);
232 htab[IDX (hval)] = ip;
233 ip++;
234#endif
235#else
236 do
237 {
183 hval = NEXT (hval, ip); 238 hval = NEXT (hval, ip);
184 htab[IDX (hval)] = ip; 239 htab[IDX (hval)] = ip;
185 ip++; 240 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 } 241 }
199 while (len--); 242 while (len--);
200#endif 243#endif
201 continue; 244
202 } 245 lit = 0; op++; /* start run */
203 } 246 }
204 else if (ip == in_end) 247 else
205 break;
206
207 /* one more literal byte we must copy */
208 lit++;
209 ip++;
210
211 if (lit == MAX_LIT)
212 { 248 {
213 if (op + 1 + MAX_LIT >= out_end) 249 /* one more literal byte we must copy */
250 if (expect_false (op >= out_end))
214 return 0; 251 return 0;
215 252
216 *op++ = MAX_LIT - 1; 253 lit++; *op++ = *ip++;
217#if USE_MEMCPY 254
218 memcpy (op, ip - MAX_LIT, MAX_LIT); 255 if (expect_false (lit == MAX_LIT))
219 op += MAX_LIT;
220 lit = 0;
221#else
222 lit = -lit;
223 do 256 {
224 *op++ = ip[lit]; 257 op [- lit - 1] = lit - 1; /* stop run */
225 while (++lit); 258 lit = 0; op++; /* start run */
226#endif 259 }
227 } 260 }
228 } 261 }
229 262
230 if (lit) 263 if (op + 3 > out_end) /* at most 3 bytes can be missing here */
264 return 0;
265
266 while (ip < in_end)
231 { 267 {
232 if (op + lit + 1 >= out_end) 268 lit++; *op++ = *ip++;
233 return 0;
234 269
235 *op++ = lit - 1; 270 if (expect_false (lit == MAX_LIT))
236 lit = -lit; 271 {
237 do 272 op [- lit - 1] = lit - 1; /* stop run */
238 *op++ = ip[lit]; 273 lit = 0; op++; /* start run */
239 while (++lit); 274 }
240 } 275 }
241 276
277 op [- lit - 1] = lit - 1; /* end run */
278 op -= !lit; /* undo run if length is zero */
279
242 return op - (u8 *) out_data; 280 return op - (u8 *)out_data;
243} 281}
282

Diff Legend

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