|
|
1 | |
|
|
2 | TODO: try unaligned copy again in decompressor |
|
|
3 | TODO: allow size-optimised binaries by avoiding unrolling |
|
|
4 | |
|
|
5 | - switch to a multiplicative hash (developed with Steinar Gunderson), |
|
|
6 | which is faster on modern cpus and compresses a bit better. The old |
|
|
7 | hash function which uses only shifts is still available. |
|
|
8 | - allow user configurable hash table slots, which makes it possible |
|
|
9 | to use e.g. 16 bit offsets for a smaller hashtable (if your data is |
|
|
10 | always < 64kb). |
|
|
11 | - use _WIN32, not WIN32, when testing for windows (fails with bcc), |
|
|
12 | patch by Tamas Tevesz. |
|
|
13 | |
|
|
14 | 3.6 Mon Feb 7 17:37:31 CET 2011 |
|
|
15 | - fixed hash calculation in C♯ version (Tiago Freitas Leal). |
|
|
16 | - unroll copy for small sizes, use memcpy for larger sizes, |
|
|
17 | greatly speeding up decompression in most cases. |
|
|
18 | - finally disable rep movsb - it's a big loss on modern intel cpus, |
|
|
19 | and only a small win on amd cpus. |
|
|
20 | - improve C++ compatibility of the code. |
|
|
21 | - slightly improve compressor speed. |
|
|
22 | - halved memory requirements for compressor on 64 bit architectures, |
|
|
23 | which can improve the speed quite a bit on older cpus. |
|
|
24 | |
|
|
25 | 3.5 Fri May 1 02:28:42 CEST 2009 |
|
|
26 | - lzf_compress did sometimes write one octet past the given output |
|
|
27 | buffer (analyzed and nice testcase by Salvatore Sanfilippo). |
|
|
28 | |
| 1 | 3.4 Tue Sep 2 06:45:00 CEST 2008 |
29 | 3.4 Tue Sep 2 06:45:00 CEST 2008 |
| 2 | - the fix from 3.3 introduced a compression bug, which is fixed in |
30 | - the fix from 3.3 introduced a compression bug, which is fixed in |
| 3 | this release (which explains the mysterious prerelease...). Thanks |
31 | this release (which explains the mysterious prerelease...). Thanks |
| 4 | once more to Clément Calmels. |
32 | once more to Clément Calmels. |
| 5 | |
33 | |
