commit | a717531942f488209dded30f6bc648167bcefa72 | [log] [tgz] |
---|---|---|
author | Chris Mason <chris.mason@oracle.com> | Thu Jan 22 09:23:10 2009 -0500 |
committer | Chris Mason <chris.mason@oracle.com> | Thu Jan 22 09:23:10 2009 -0500 |
tree | f4e0c852d4462574ade5e965585647e7a253abe3 | |
parent | 1506fcc8189cdd4b95e06df7845a09f18b4526a6 [diff] |
Btrfs: do less aggressive btree readahead Just before reading a leaf, btrfs scans the node for blocks that are close by and reads them too. It tries to build up a large window of IO looking for blocks that are within a max distance from the top and bottom of the IO window. This patch changes things to just look for blocks within 64k of the target block. It will trigger less IO and make for lower latencies on the read size. Signed-off-by: Chris Mason <chris.mason@oracle.com>