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.20 by root, Tue Nov 13 08:38:49 2007 UTC vs.
Revision 1.31 by root, Tue May 6 22:49:18 2008 UTC

45 * it works ;) 45 * it works ;)
46 */ 46 */
47#ifndef FRST 47#ifndef FRST
48# define FRST(p) (((p[0]) << 8) | p[1]) 48# define FRST(p) (((p[0]) << 8) | p[1])
49# 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
50# 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))
51/*# define IDX(h) ((ip[0] * 121 ^ ip[1] * 33 ^ ip[2] * 1) & (HSIZE-1))*/ 56# endif
52#endif 57#endif
53/* 58/*
54 * 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.
55 * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1)) 60 * ((h * 57321 >> (3*8 - HLOG)) & (HSIZE - 1))
56 * 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.
67#endif 72#endif
68 73
69#define MAX_LIT (1 << 5) 74#define MAX_LIT (1 << 5)
70#define MAX_OFF (1 << 13) 75#define MAX_OFF (1 << 13)
71#define MAX_REF ((1 << 8) + (1 << 3)) 76#define MAX_REF ((1 << 8) + (1 << 3))
72
73#if (__i386 || __amd64) && __GNUC__ >= 3
74# define lzf_movsb(dst, src, len) \
75 asm ("rep movsb" \
76 : "=D" (dst), "=S" (src), "=c" (len) \
77 : "0" (dst), "1" (src), "2" (len));
78#endif
79 77
80#if __GNUC__ >= 3 78#if __GNUC__ >= 3
81# define expect(expr,value) __builtin_expect ((expr),(value)) 79# define expect(expr,value) __builtin_expect ((expr),(value))
82# define inline inline 80# define inline inline
83#else 81#else
113 u8 *op = (u8 *)out_data; 111 u8 *op = (u8 *)out_data;
114 const u8 *in_end = ip + in_len; 112 const u8 *in_end = ip + in_len;
115 u8 *out_end = op + out_len; 113 u8 *out_end = op + out_len;
116 const u8 *ref; 114 const u8 *ref;
117 115
118 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
119 unsigned long off; 120 unsigned long off;
120 int lit = 0; 121#endif
122 int lit;
123
124 if (!in_len || !out_len)
125 return 0;
121 126
122#if INIT_HTAB 127#if INIT_HTAB
123 memset (htab, 0, sizeof (htab)); 128 memset (htab, 0, sizeof (htab));
124# if 0 129# if 0
125 for (hslot = htab; hslot < htab + HSIZE; hslot++) 130 for (hslot = htab; hslot < htab + HSIZE; hslot++)
126 *hslot++ = ip; 131 *hslot++ = ip;
127# endif 132# endif
128#endif 133#endif
129 134
130 for (;;) 135 lit = 0; op++; /* start run */
136
137 hval = FRST (ip);
138 while (ip < in_end - 2)
131 { 139 {
132 if (expect_true (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 )
133 { 160 {
161 /* match found at *ref++ */
162 unsigned int len = 2;
163 unsigned int maxlen = in_end - ip - len;
164 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
165
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))
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 }
196
197 do
198 len++;
199 while (len < maxlen && ref[len] == ip[len]);
200
201 break;
202 }
203
204 len -= 2;
205 ip++;
206
207 if (len < 7)
208 {
209 *op++ = (off >> 8) + (len << 5);
210 }
211 else
212 {
213 *op++ = (off >> 8) + ( 7 << 5);
214 *op++ = len - 7;
215 }
216
217 *op++ = off;
218
219#if ULTRA_FAST || VERY_FAST
220 ip += len;
221#if VERY_FAST && !ULTRA_FAST
222 --ip;
223#endif
224 hval = FRST (ip);
225
134 hval = NEXT (hval, ip); 226 hval = NEXT (hval, ip);
135 hslot = htab + IDX (hval); 227 htab[IDX (hval)] = ip;
136 ref = *hslot; *hslot = ip;
137
138 if (1
139#if INIT_HTAB && !USE_MEMCPY
140 && ref < ip /* the next test will actually take care of this, but this is faster */
141#endif
142 && (off = ip - ref - 1) < MAX_OFF
143 && ip + 4 < in_end
144 && ref > (u8 *)in_data
145#if STRICT_ALIGN
146 x x x
147 && ref[0] == ip[0]
148 && ref[1] == ip[1]
149 && ref[2] == ip[2]
150#else
151 && *(u16 *)ref == *(u16 *)ip
152 && ref[2] == ip[2]
153#endif
154 )
155 {
156 /* match found at *ref++ */
157 unsigned int len = 2;
158 unsigned int maxlen = in_end - ip - len;
159 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
160
161 if (expect_false (op + lit + 1 + 3 >= out_end))
162 return 0;
163
164 if (expect_false (lit))
165 {
166 *op++ = lit - 1;
167 lit = -lit;
168 do
169 *op++ = ip[lit];
170 while (expect_false (++lit));
171 }
172
173 for (;;)
174 {
175 if (expect_true (maxlen > 16))
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 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 len++; if (ref [len] != ip [len]) break;
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 len++; if (ref [len] != ip [len]) break;
191 len++; if (ref [len] != ip [len]) break;
192 len++; if (ref [len] != ip [len]) break;
193 }
194
195 do
196 len++;
197 while (len < maxlen && ref[len] == ip[len]);
198
199 break;
200 }
201
202 len -= 2;
203 ip++; 228 ip++;
204 229
205 if (len < 7)
206 {
207 *op++ = (off >> 8) + (len << 5);
208 }
209 else
210 {
211 *op++ = (off >> 8) + ( 7 << 5);
212 *op++ = len - 7;
213 }
214
215 *op++ = off;
216
217#if ULTRA_FAST || VERY_FAST
218 ip += len;
219#if VERY_FAST && !ULTRA_FAST 230#if VERY_FAST && !ULTRA_FAST
231 hval = NEXT (hval, ip);
232 htab[IDX (hval)] = ip;
220 --ip; 233 ip++;
221#endif 234#endif
222 hval = FRST (ip); 235#else
223 236 do
237 {
224 hval = NEXT (hval, ip); 238 hval = NEXT (hval, ip);
225 htab[IDX (hval)] = ip; 239 htab[IDX (hval)] = ip;
226 ip++; 240 ip++;
227
228#if VERY_FAST && !ULTRA_FAST
229 hval = NEXT (hval, ip);
230 htab[IDX (hval)] = ip;
231 ip++;
232#endif
233#else
234 do
235 {
236 hval = NEXT (hval, ip);
237 htab[IDX (hval)] = ip;
238 ip++;
239 } 241 }
240 while (len--); 242 while (len--);
241#endif 243#endif
242 continue; 244
243 } 245 lit = 0; op++; /* start run */
244 } 246 }
245 else if (expect_false (ip == in_end)) 247 else
246 break; 248 {
247
248 /* one more literal byte we must copy */ 249 /* one more literal byte we must copy */
249 lit++; 250 if (expect_false (op >= out_end))
250 ip++; 251 return 0;
252
253 lit++; *op++ = *ip++;
254
255 if (expect_false (lit == MAX_LIT))
256 {
257 op [- lit - 1] = lit - 1; /* stop run */
258 lit = 0; op++; /* start run */
259 }
260 }
261 }
262
263 if (op + 3 > out_end) /* at most 3 bytes can be missing here */
264 return 0;
265
266 while (ip < in_end)
267 {
268 lit++; *op++ = *ip++;
251 269
252 if (expect_false (lit == MAX_LIT)) 270 if (expect_false (lit == MAX_LIT))
253 { 271 {
254 if (op + 1 + MAX_LIT >= out_end) 272 op [- lit - 1] = lit - 1; /* stop run */
255 return 0; 273 lit = 0; op++; /* start run */
256
257 *op++ = MAX_LIT - 1;
258
259#ifdef lzf_movsb
260 ip -= MAX_LIT;
261 lzf_movsb (op, ip, lit);
262#else
263 lit = -lit;
264 do
265 *op++ = ip[lit];
266 while (++lit);
267#endif
268 } 274 }
269 } 275 }
270 276
271 if (lit) 277 op [- lit - 1] = lit - 1; /* end run */
272 { 278 op -= !lit; /* undo run if length is zero */
273 if (op + lit + 1 >= out_end)
274 return 0;
275 279
276 *op++ = lit - 1;
277#ifdef lzf_movsb
278 ip -= lit;
279 lzf_movsb (op, ip, lit);
280#else
281 lit = -lit;
282 do
283 *op++ = ip[lit];
284 while (++lit);
285#endif
286 }
287
288 return op - (u8 *) out_data; 280 return op - (u8 *)out_data;
289} 281}
290 282

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines