87241caa43
Firstly, now our read-ahead clustering is on a file descriptor basis and not on a per-vnode basis. This will allow multiple processes reading the same file to take advantage of read-ahead clustering. Secondly, there previously was a problem with large reads still using the ramp-up algorithm. Of course, that was bogus, and now we read the entire "chunk" off of the disk in one operation. The read-ahead clustering algorithm should use less CPU than the previous also (I hope :-)). |
||
---|---|---|
.. | ||
COPYRIGHT.INFO | ||
ext2_alloc.c | ||
ext2_balloc.c | ||
ext2_bmap.c | ||
ext2_extern.h | ||
ext2_fs_i.h | ||
ext2_fs_sb.h | ||
ext2_fs.h | ||
ext2_ihash.c | ||
ext2_inode_cnv.c | ||
ext2_inode.c | ||
ext2_linux_balloc.c | ||
ext2_linux_ialloc.c | ||
ext2_lookup.c | ||
ext2_mount.h | ||
ext2_readwrite.c | ||
ext2_subr.c | ||
ext2_vfsops.c | ||
ext2_vnops.c | ||
fs.h | ||
i386-bitops.h | ||
inode.h |