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.16 by root, Mon Nov 5 23:28:40 2007 UTC vs.
Revision 1.44 by root, Tue Jun 1 09:11:33 2010 UTC

1/* 1/*
2 * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de> 2 * Copyright (c) 2000-2010 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,
38 38
39#define HSIZE (1 << (HLOG)) 39#define HSIZE (1 << (HLOG))
40 40
41/* 41/*
42 * don't play with this unless you benchmark! 42 * don't play with this unless you benchmark!
43 * decompression is not dependent on the hash function 43 * the data format is not dependent on the hash function.
44 * the hashing function might seem strange, just believe me 44 * the hash function might seem strange, just believe me,
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.
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 77
73#if (__i386 || __amd64) && __GNUC__ >= 3 78#if __GNUC__ >= 3
74# define lzf_movsb(dst, src, len) \ 79# define expect(expr,value) __builtin_expect ((expr),(value))
75 asm ("rep movsb" \ 80# define inline inline
76 : "=D" (dst), "=S" (src), "=c" (len) \ 81#else
77 : "0" (dst), "1" (src), "2" (len)); 82# define expect(expr,value) (expr)
83# define inline static
78#endif 84#endif
85
86#define expect_false(expr) expect ((expr) != 0, 0)
87#define expect_true(expr) expect ((expr) != 0, 1)
79 88
80/* 89/*
81 * compressed format 90 * compressed format
82 * 91 *
83 * 000LLLLL <L+1> ; literal 92 * 000LLLLL <L+1> ; literal, L+1=1..33 octets
84 * LLLooooo oooooooo ; backref L 93 * LLLooooo oooooooo ; backref L+1=1..7 octets, o+1=1..4096 offset
85 * 111ooooo LLLLLLLL oooooooo ; backref L+7 94 * 111ooooo LLLLLLLL oooooooo ; backref L+8 octets, o+1=1..4096 offset
86 * 95 *
87 */ 96 */
88 97
89unsigned int 98unsigned int
90lzf_compress (const void *const in_data, unsigned int in_len, 99lzf_compress (const void *const in_data, unsigned int in_len,
95 ) 104 )
96{ 105{
97#if !LZF_STATE_ARG 106#if !LZF_STATE_ARG
98 LZF_STATE htab; 107 LZF_STATE htab;
99#endif 108#endif
100 const u8 **hslot;
101 const u8 *ip = (const u8 *)in_data; 109 const u8 *ip = (const u8 *)in_data;
102 u8 *op = (u8 *)out_data; 110 u8 *op = (u8 *)out_data;
103 const u8 *in_end = ip + in_len; 111 const u8 *in_end = ip + in_len;
104 u8 *out_end = op + out_len; 112 u8 *out_end = op + out_len;
105 const u8 *ref; 113 const u8 *ref;
106 114
107 unsigned int hval = FRST (ip); 115 /* off requires a type wide enough to hold a general pointer difference.
116 * ISO C doesn't have that (size_t might not be enough and ptrdiff_t only
117 * works for differences within a single object). We also assume that no
118 * no bit pattern traps. Since the only platform that is both non-POSIX
119 * and fails to support both assumptions is windows 64 bit, we make a
120 * special workaround for it.
121 */
122#if defined (WIN32) && defined (_M_X64)
123 unsigned _int64 off; /* workaround for missing POSIX compliance */
124#else
108 unsigned long off; 125 unsigned long off;
109 int lit = 0; 126#endif
127 unsigned int hval;
128 int lit;
129
130 if (!in_len || !out_len)
131 return 0;
110 132
111#if INIT_HTAB 133#if INIT_HTAB
112 memset (htab, 0, sizeof (htab)); 134 memset (htab, 0, sizeof (htab));
113# if 0
114 for (hslot = htab; hslot < htab + HSIZE; hslot++)
115 *hslot++ = ip;
116# endif 135#endif
117#endif
118 136
119 for (;;) 137 lit = 0; op++; /* start run */
138
139 hval = FRST (ip);
140 while (ip < in_end - 2)
120 { 141 {
121 if (ip < in_end - 2) 142 LZF_HSLOT *hslot;
143
144 hval = NEXT (hval, ip);
145 hslot = htab + IDX (hval);
146 ref = *hslot + LZF_HSLOT_BIAS; *hslot = ip - LZF_HSLOT_BIAS;
147
148 if (1
149#if INIT_HTAB
150 && ref < ip /* the next test will actually take care of this, but this is faster */
151#endif
152 && (off = ip - ref - 1) < MAX_OFF
153 && ref > (u8 *)in_data
154 && ref[2] == ip[2]
155#if STRICT_ALIGN
156 && ((ref[1] << 8) | ref[0]) == ((ip[1] << 8) | ip[0])
157#else
158 && *(u16 *)ref == *(u16 *)ip
159#endif
160 )
122 { 161 {
123 hval = NEXT (hval, ip);
124 hslot = htab + IDX (hval);
125 ref = *hslot; *hslot = ip;
126
127 if (1
128#if INIT_HTAB && !USE_MEMCPY
129 && ref < ip /* the next test will actually take care of this, but this is faster */
130#endif
131 && (off = ip - ref - 1) < MAX_OFF
132 && ip + 4 < in_end
133 && ref > (u8 *)in_data
134#if STRICT_ALIGN
135 && ref[0] == ip[0]
136 && ref[1] == ip[1]
137 && ref[2] == ip[2]
138#else
139 && *(u16 *)ref == *(u16 *)ip
140 && ref[2] == ip[2]
141#endif
142 )
143 {
144 /* match found at *ref++ */ 162 /* match found at *ref++ */
145 unsigned int len = 2; 163 unsigned int len = 2;
146 unsigned int maxlen = in_end - ip - len; 164 unsigned int maxlen = in_end - ip - len;
147 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen; 165 maxlen = maxlen > MAX_REF ? MAX_REF : maxlen;
148 166
149 if (op + lit + 1 + 3 >= out_end) 167 if (expect_false (op + 3 + 1 >= out_end)) /* first a faster conservative test */
168 if (op - !lit + 3 + 1 >= out_end) /* second the exact but rare test */
150 return 0; 169 return 0;
170
171 op [- lit - 1] = lit - 1; /* stop run */
172 op -= !lit; /* undo run if length is zero */
173
174 for (;;)
175 {
176 if (expect_true (maxlen > 16))
177 {
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
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
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
193 len++; if (ref [len] != ip [len]) break;
194 len++; if (ref [len] != ip [len]) break;
195 len++; if (ref [len] != ip [len]) break;
196 len++; if (ref [len] != ip [len]) break;
197 }
151 198
152 do 199 do
153 len++; 200 len++;
154 while (len < maxlen && ref[len] == ip[len]); 201 while (len < maxlen && ref[len] == ip[len]);
155 202
156 if (lit)
157 { 203 break;
158 *op++ = lit - 1;
159 lit = -lit;
160 do
161 *op++ = ip[lit];
162 while (++lit);
163 } 204 }
164 205
206 len -= 2; /* len is now #octets - 1 */
207 ip++;
208
209 if (len < 7)
210 {
211 *op++ = (off >> 8) + (len << 5);
212 }
213 else
214 {
215 *op++ = (off >> 8) + ( 7 << 5);
165 len -= 2; 216 *op++ = len - 7;
217 }
218
219 *op++ = off;
220
221 lit = 0; op++; /* start run */
222
223 ip += len + 1;
224
225 if (expect_false (ip >= in_end - 2))
226 break;
227
228#if ULTRA_FAST || VERY_FAST
229 --ip;
230# if VERY_FAST && !ULTRA_FAST
231 --ip;
232# endif
233 hval = FRST (ip);
234
235 hval = NEXT (hval, ip);
236 htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
237 ip++;
238
239# if VERY_FAST && !ULTRA_FAST
240 hval = NEXT (hval, ip);
241 htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
242 ip++;
243# endif
244#else
245 ip -= len + 1;
246
247 do
248 {
249 hval = NEXT (hval, ip);
250 htab[IDX (hval)] = ip - LZF_HSLOT_BIAS;
166 ip++; 251 ip++;
167
168 if (len < 7)
169 {
170 *op++ = (off >> 8) + (len << 5);
171 } 252 }
172 else
173 {
174 *op++ = (off >> 8) + ( 7 << 5);
175 *op++ = len - 7;
176 }
177
178 *op++ = off;
179
180#if ULTRA_FAST || VERY_FAST
181 ip += len;
182#if VERY_FAST && !ULTRA_FAST
183 --ip;
184#endif
185 hval = FRST (ip);
186
187 hval = NEXT (hval, ip);
188 htab[IDX (hval)] = ip;
189 ip++;
190
191#if VERY_FAST && !ULTRA_FAST
192 hval = NEXT (hval, ip);
193 htab[IDX (hval)] = ip;
194 ip++;
195#endif
196#else
197 do
198 {
199 hval = NEXT (hval, ip);
200 htab[IDX (hval)] = ip;
201 ip++;
202 }
203 while (len--); 253 while (len--);
204#endif 254#endif
205 continue;
206 }
207 } 255 }
208 else if (ip == in_end) 256 else
209 break;
210
211 /* one more literal byte we must copy */
212 lit++;
213 ip++;
214
215 if (lit == MAX_LIT)
216 { 257 {
217 if (op + 1 + MAX_LIT >= out_end) 258 /* one more literal byte we must copy */
259 if (expect_false (op >= out_end))
218 return 0; 260 return 0;
219 261
220 *op++ = MAX_LIT - 1; 262 lit++; *op++ = *ip++;
221 263
222#ifdef lzf_movsb 264 if (expect_false (lit == MAX_LIT))
223 ip -= lit;
224 lzf_movsb (op, ip, lit);
225#else
226 lit = -lit;
227 do 265 {
228 *op++ = ip[lit]; 266 op [- lit - 1] = lit - 1; /* stop run */
229 while (++lit); 267 lit = 0; op++; /* start run */
230#endif 268 }
231 } 269 }
232 } 270 }
233 271
234 if (lit) 272 if (op + 3 > out_end) /* at most 3 bytes can be missing here */
273 return 0;
274
275 while (ip < in_end)
235 { 276 {
236 if (op + lit + 1 >= out_end) 277 lit++; *op++ = *ip++;
237 return 0;
238 278
239 *op++ = lit - 1; 279 if (expect_false (lit == MAX_LIT))
240#ifdef lzf_movsb 280 {
241 ip -= lit; 281 op [- lit - 1] = lit - 1; /* stop run */
242 lzf_movsb (op, ip, lit); 282 lit = 0; op++; /* start run */
243#else 283 }
244 lit = -lit;
245 do
246 *op++ = ip[lit];
247 while (++lit);
248#endif
249 } 284 }
250 285
286 op [- lit - 1] = lit - 1; /* end run */
287 op -= !lit; /* undo run if length is zero */
288
251 return op - (u8 *) out_data; 289 return op - (u8 *)out_data;
252} 290}
253 291

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines