diff options
| author | Zheng Liu <wenqing.lz@taobao.com> | 2014-11-25 17:45:37 +0100 |
|---|---|---|
| committer | Theodore Ts'o <tytso@mit.edu> | 2014-11-25 17:45:37 +0100 |
| commit | edaa53cac8fd4b96ed4b8f96c4933158ff2dd337 (patch) | |
| tree | f414417ca79fe9678743ea5af75bd5afb70ad8cd /fs/ext4/ioctl.c | |
| parent | ext4: cache extent hole in extent status tree for ext4_da_map_blocks() (diff) | |
| download | linux-edaa53cac8fd4b96ed4b8f96c4933158ff2dd337.tar.xz linux-edaa53cac8fd4b96ed4b8f96c4933158ff2dd337.zip | |
ext4: change LRU to round-robin in extent status tree shrinker
In this commit we discard the lru algorithm for inodes with extent
status tree because it takes significant effort to maintain a lru list
in extent status tree shrinker and the shrinker can take a long time to
scan this lru list in order to reclaim some objects.
We replace the lru ordering with a simple round-robin. After that we
never need to keep a lru list. That means that the list needn't be
sorted if the shrinker can not reclaim any objects in the first round.
Cc: Andreas Dilger <adilger.kernel@dilger.ca>
Signed-off-by: Zheng Liu <wenqing.lz@taobao.com>
Signed-off-by: Jan Kara <jack@suse.cz>
Signed-off-by: Theodore Ts'o <tytso@mit.edu>
Diffstat (limited to 'fs/ext4/ioctl.c')
| -rw-r--r-- | fs/ext4/ioctl.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/fs/ext4/ioctl.c b/fs/ext4/ioctl.c index bfda18a15592..7b377c41dd81 100644 --- a/fs/ext4/ioctl.c +++ b/fs/ext4/ioctl.c @@ -78,8 +78,8 @@ static void swap_inode_data(struct inode *inode1, struct inode *inode2) memswap(&ei1->i_disksize, &ei2->i_disksize, sizeof(ei1->i_disksize)); ext4_es_remove_extent(inode1, 0, EXT_MAX_BLOCKS); ext4_es_remove_extent(inode2, 0, EXT_MAX_BLOCKS); - ext4_es_lru_del(inode1); - ext4_es_lru_del(inode2); + ext4_es_list_del(inode1); + ext4_es_list_del(inode2); isize = i_size_read(inode1); i_size_write(inode1, i_size_read(inode2)); |