| … | |
… | |
| 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 | |
8 | |
| 9 | 3.2 |
9 | - speed up readdirx sort algorithm slightly. |
| 10 | TODO: aio_scandir should short-circuit the case of no DT_UNKNOWN. |
10 | |
|
|
11 | 3.21 Fri Jun 12 18:45:53 CEST 2009 |
|
|
12 | - new options --dirs and --files for treescan. |
|
|
13 | - install bin/treescan by default. |
|
|
14 | - (libeio) aio_readdir can now be cancelled while executing. |
|
|
15 | - fix a printf format string for 64 bit systems (could lead |
|
|
16 | to problems on big endian 64 bit systems). |
|
|
17 | - do not use qsort() but our own algorithm: glibc initialises |
|
|
18 | the whole locale and I/O subsystem inside qsort, causing |
|
|
19 | a stack overflow on 32 bit machines. The new sort uses much less |
|
|
20 | stack and is more than twice as fast in typical situations. |
|
|
21 | |
|
|
22 | 3.2 Sun Jun 7 20:30:05 CEST 2009 |
| 11 | - (libeio) pwrite emulation was even more flawed than intended and did |
23 | - (libeio) pwrite emulation was even more flawed than intended and did |
| 12 | not restore the file offset. |
24 | not restore the file offset. |
| 13 | - add aio_readdirx, which can return inode and filetype and sort |
25 | - add aio_readdirx, which can return inode and filetype and sort |
| 14 | the names in various ways. |
26 | the names in various ways. |
| 15 | - unfortunately, utime, chmod, chown on an open file that has just |
27 | - unfortunately, utime, chmod, chown on an open file that has just |
