07 Jul, 2016
1 commit
-
The readahead nat pages are more likely to be reclaimed quickly, so it'd better
to gather more free nids in advance.And, let's keep some free nids as much as possible.
Signed-off-by: Jaegeuk Kim
31 Dec, 2015
1 commit
-
If there is no candidates for shrinking slab entries, we don't need to traverse
any trees at all.Reviewed-by: Chao Yu
[Jaegeuk Kim: fix missing initialization reported by Yunlei He]
Signed-off-by: Jaegeuk Kim
23 Dec, 2015
1 commit
-
It would be better to use atomic variable for total_extent_tree.
Reviewed-by: Chao Yu
Signed-off-by: Jaegeuk Kim
21 Aug, 2015
1 commit
-
This patch introduces __count_free_nids/try_to_free_nids and registers
them in slab shrinker for shrinking under memory pressure.Signed-off-by: Chao Yu
Signed-off-by: Jaegeuk Kim
05 Aug, 2015
4 commits
-
We don't need to handle the duplicate extent information.
The integrated rule is:
- update on-disk extent with largest one tracked by in-memory extent_cache
- destroy extent_tree for the truncation case
- drop per-inode extent_cache by shrinkerReviewed-by: Chao Yu
Signed-off-by: Jaegeuk Kim -
This patch registers shrinking extent_caches.
Reviewed-by: Chao Yu
Signed-off-by: Jaegeuk Kim -
This patch registers shrinking nat_cache entries.
Reviewed-by: Chao Yu
Signed-off-by: Jaegeuk Kim -
This patch introduces a shrinker targeting to reduce memory footprint consumed
by a number of in-memory f2fs data structures.In addition, it newly adds:
- sbi->umount_mutex to avoid data races on shrinker and put_super
- sbi->shruinker_run_no to not revisit objectsNote that the basic implementation was copied from fs/ubifs/shrinker.c
Reviewed-by: Chao Yu
Signed-off-by: Jaegeuk Kim