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

Comparing Compress-LZF/lzf_c.c (file contents):
Revision 1.7 by root, Fri Nov 2 12:36:14 2007 UTC vs.
Revision 1.8 by root, Tue Nov 13 21:50:54 2007 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.
… …
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))
74 77
75#if (__i386 || __amd64) && __GNUC__ >= 3 78#if __GNUC__ >= 3
76# define lzf_movsb(dst, src, len) \ 79# define expect(expr,value) __builtin_expect ((expr),(value))
77 asm ("rep movsb" \ 80# define inline inline
78 : "=D" (dst), "=S" (src), "=c" (len) \ 81#else
79 : "0" (dst), "1" (src), "2" (len)); 82# define expect(expr,value) (expr)
83# define inline static
80#endif 84#endif
85
86#define expect_false(expr) expect ((expr) != 0, 0)
87#define expect_true(expr) expect ((expr) != 0, 1)
81 88
82/* 89/*
83 * compressed format 90 * compressed format
84 * 91 *
85 * 000LLLLL <L+1> ; literal 92 * 000LLLLL <L+1> ; literal
… …
104 u8 *op = (u8 *)out_data; 111 u8 *op = (u8 *)out_data;
105 const u8 *in_end = ip + in_len; 112 const u8 *in_end = ip + in_len;
106 u8 *out_end = op + out_len; 113 u8 *out_end = op + out_len;
107 const u8 *ref; 114 const u8 *ref;
108 115
109 unsigned int hval = FRST (ip); 116 unsigned int hval;
110 unsigned long off; 117 unsigned long off;
111 int lit = 0; 118 int lit;
119
120 if (!in_len || !out_len)
121 return 0;
112 122
113#if INIT_HTAB 123#if INIT_HTAB
114 memset (htab, 0, sizeof (htab)); 124 memset (htab, 0, sizeof (htab));
115# if 0 125# if 0
116 for (hslot = htab; hslot < htab + HSIZE; hslot++) 126 for (hslot = htab; hslot < htab + HSIZE; hslot++)
117 *hslot++ = ip; 127 *hslot++ = ip;
118# endif 128# endif
119#endif 129#endif
120 130
121 for (;;) 131 lit = 0; op++; /* start run */
132
133 hval = FRST (ip);
134 while (ip < in_end - 2)
122 { 135 {
123 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 )
124 { 156 {
125 hval = NEXT (hval, ip);
126 hslot = htab + IDX (hval);
127 ref = *hslot; *hslot = ip;
128
129 if (1
130#if INIT_HTAB && !USE_MEMCPY
131 && ref < ip /* the next test will actually take care of this, but this is faster */
132#endif
133 && (off = ip - ref - 1) < MAX_OFF
134 && ip + 4 < in_end
135 && ref > (u8 *)in_data
136#if STRICT_ALIGN
137 && ref[0] == ip[0]
138 && ref[1] == ip[1]
139 && ref[2] == ip[2]
140#else
141 && *(u16 *)ref == *(u16 *)ip
142 && ref[2] == ip[2]
143#endif
144 )
145 {
146 /* match found at *ref++ */ 157 /* match found at *ref++ */
147 unsigned int len = 2; 158 unsigned int len = 2;
148 unsigned int maxlen = in_end - ip - len; 159 unsigned int maxlen = in_end - ip - len;
149 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; 160 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
150 161
151 if (op + lit + 1 + 3 >= out_end) 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))
152 return 0; 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 }
153 192
154 do 193 do
155 len++; 194 len++;
156 while (len < maxlen && ref[len] == ip[len]); 195 while (len < maxlen && ref[len] == ip[len]);
157 196
158 if (lit)
159 { 197 break;
160 *op++ = lit - 1;
161 lit = -lit;
162 do
163 *op++ = ip[lit];
164 while (++lit);
165 } 198 }
166 199
167 len -= 2; 200 len -= 2;
168 ip++; 201 ip++;
169 202
170 if (len < 7) 203 if (len < 7)
171 { 204 {
172 *op++ = (off >> 8) + (len << 5); 205 *op++ = (off >> 8) + (len << 5);
173 } 206 }
174 else 207 else
175 { 208 {
176 *op++ = (off >> 8) + ( 7 << 5); 209 *op++ = (off >> 8) + ( 7 << 5);
177 *op++ = len - 7; 210 *op++ = len - 7;
178 } 211 }
179 212
180 *op++ = off; 213 *op++ = off;
181 214
182#if ULTRA_FAST || VERY_FAST 215#if ULTRA_FAST || VERY_FAST
183 ip += len; 216 ip += len;
184#if VERY_FAST && !ULTRA_FAST 217#if VERY_FAST && !ULTRA_FAST
185 --ip; 218 --ip;
186#endif 219#endif
187 hval = FRST (ip); 220 hval = FRST (ip);
188 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 {
189 hval = NEXT (hval, ip); 234 hval = NEXT (hval, ip);
190 htab[IDX (hval)] = ip; 235 htab[IDX (hval)] = ip;
191 ip++; 236 ip++;
192
193#if VERY_FAST && !ULTRA_FAST
194 hval = NEXT (hval, ip);
195 htab[IDX (hval)] = ip;
196 ip++;
197#endif
198#else
199 do
200 {
201 hval = NEXT (hval, ip);
202 htab[IDX (hval)] = ip;
203 ip++;
204 } 237 }
205 while (len--); 238 while (len--);
206#endif 239#endif
207 continue; 240
208 } 241 lit = 0; op++; /* start run */
209 } 242 }
210 else if (ip == in_end) 243 else
211 break;
212
213 /* one more literal byte we must copy */
214 lit++;
215 ip++;
216
217 if (lit == MAX_LIT)
218 { 244 {
219 if (op + 1 + MAX_LIT >= out_end) 245 /* one more literal byte we must copy */
246 if (expect_false (op >= out_end))
220 return 0; 247 return 0;
221 248
222 *op++ = MAX_LIT - 1; 249 lit++; *op++ = *ip++;
223 250
224#ifdef lzf_movsb 251 if (expect_false (lit == MAX_LIT))
225 ip -= lit;
226 lzf_movsb (op, ip, lit);
227#else
228 lit = -lit;
229 do 252 {
230 *op++ = ip[lit]; 253 op [- lit - 1] = lit - 1; /* stop run */
231 while (++lit); 254 lit = 0; op++; /* start run */
232#endif 255 }
233 } 256 }
234 } 257 }
235 258
236 if (lit) 259 if (op + 2 > out_end) /* at most 2 bytes can be missing here */
260 return 0;
261
262 while (ip < in_end)
237 { 263 {
238 if (op + lit + 1 >= out_end) 264 lit++; *op++ = *ip++;
239 return 0;
240
241 *op++ = lit - 1;
242#ifdef lzf_movsb
243 ip -= lit;
244 lzf_movsb (op, ip, lit);
245#else
246 lit = -lit;
247 do
248 *op++ = ip[lit];
249 while (++lit);
250#endif
251 } 265 }
252 266
267 op [- lit - 1] = lit - 1; /* end run */
268 op -= !lit; /* undo run if length is zero */
269
253 return op - (u8 *) out_data; 270 return op - (u8 *)out_data;
254} 271}
255 272

Diff Legend

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