| … | |
… | |
| 3 | TODO: better autoconf.pm that can return LIBS etc. |
3 | TODO: better autoconf.pm that can return LIBS etc. |
| 4 | TODO: aio_cptree/mvtree |
4 | TODO: aio_cptree/mvtree |
| 5 | TODO: reduce condvar fairness: schedule hot-cache-threads first? |
5 | TODO: reduce condvar fairness: schedule hot-cache-threads first? |
| 6 | TODO: splice/tee/vmsplice? (http://kerneltrap.org/node/6505 http://lwn.net/Articles/178199/) |
6 | TODO: splice/tee/vmsplice? (http://kerneltrap.org/node/6505 http://lwn.net/Articles/178199/) |
| 7 | TODO: aio_fcntl, at least for file-locking |
7 | TODO: aio_fcntl, at least for file-locking |
|
|
8 | |
|
|
9 | - (libeio) replaced quicksort+insertion sort by a tuned radix |
|
|
10 | sort + insertion sort, resulting in comparable runtime (usually |
|
|
11 | faster) to the old version, but without any ill side effects on |
|
|
12 | degenerated (for quicksort) data. |
|
|
13 | - (libeio) correctly sort dirs by inodes if we have perfect type |
|
|
14 | knowledge and DIRS_FIRST is used. |
|
|
15 | - (libeio) internally the wrong DT_* constants were used, but no |
|
|
16 | known system has differing EIO_DT_*/DT_* values, so not an issue. |
|
|
17 | - removed a (harmless) assert that was left over on the code |
|
|
18 | but should not have been. |
|
|
19 | |
|
|
20 | 3.23 Sat Jun 13 16:57:58 CEST 2009 |
|
|
21 | - fix off-by-one bug in aio_readdir that was introduced in the |
|
|
22 | rushed 3.22 release. |
|
|
23 | |
|
|
24 | 3.22 Sat Jun 13 15:32:40 CEST 2009 |
|
|
25 | - speed up readdirx sort algorithm slightly. |
|
|
26 | - bin/treescan was missing from distro tarball. |
|
|
27 | |
|
|
28 | 3.21 Fri Jun 12 18:45:53 CEST 2009 |
|
|
29 | - new options --dirs and --files for treescan. |
|
|
30 | - install bin/treescan by default. |
|
|
31 | - (libeio) aio_readdir can now be cancelled while executing. |
|
|
32 | - fix a printf format string for 64 bit systems (could lead |
|
|
33 | to problems on big endian 64 bit systems). |
|
|
34 | - do not use qsort() but our own algorithm: glibc initialises |
|
|
35 | the whole locale and I/O subsystem inside qsort, causing |
|
|
36 | a stack overflow on 32 bit machines. The new sort uses much less |
|
|
37 | stack and is more than twice as fast in typical situations. |
| 8 | |
38 | |
| 9 | 3.2 Sun Jun 7 20:30:05 CEST 2009 |
39 | 3.2 Sun Jun 7 20:30:05 CEST 2009 |
| 10 | - (libeio) pwrite emulation was even more flawed than intended and did |
40 | - (libeio) pwrite emulation was even more flawed than intended and did |
| 11 | not restore the file offset. |
41 | not restore the file offset. |
| 12 | - add aio_readdirx, which can return inode and filetype and sort |
42 | - add aio_readdirx, which can return inode and filetype and sort |
