Messages in this thread | | | Date | Wed, 9 Jun 1999 07:11:16 +0200 | From | Jamie Lokier <> | Subject | treescan 0.5 - optimised search for files in a directory tree |
| |
Very occasionally people have discussed here how fast their version of `find' runs on BSD vs. Linux, written in Perl or not. There's also the odd discussion of how to make `ls' faster.
I wrote a similar program for arcane reasons (make Squid start faster), realised how to optimise the I/O for that case, and then tweaked the program a bit more. Time to announce it.
You can find the full announcement (posted to comp.os.linux.announce) and source at:
http://www.tantalophile.demon.co.uk/treescan/ANNOUNCE http://www.tantalophile.demon.co.uk/treescan/treescan-0.5.tar.gz
Here's the intro:
Description -----------
Treescan finds all the files in a directory tree and prints their names, using an optimised disk access strategy.
It is similar to `find -print'. The added feature is that Treescan optimises the I/O in various ways. It is sometimes much faster than the naive strategy used by `find'.
There is an option to prime the system cache with the inodes of all the files found. This often makes a subsequent program (such as `squid', `find', `du' etc.) run faster.
Enjoy, -- Jamie
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |