• C
    Btrfs: do less aggressive btree readahead · a7175319
    Chris Mason 提交于
    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: NChris Mason <chris.mason@oracle.com>
    a7175319
ctree.c 101.3 KB