f2fs: drop largest extent by range
PATCH 1/2 f2fs: drop largest extent by range
now we update extent by range, fofs may not be on the largest extent if the new extent overlaps with it. so add a new function to drop largest extent properly.
Signed-off-by Fan li <[email protected]>
--- fs/f2fs/extent_cache.c | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-)
fs/f2fs/extent_cache.c +5 -4
@@ -155,11 +155,12 @@ static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi,return count - et->count; } -static void __drop_largest_extent (struct inode *inode,pgoff_t fofs) +static void __drop_largest_extent (struct inode *inode, +pgoff_t fofs,unsigned int len) {struct extent_info *largest = &F2FS_I (inode)->extent_tree->largest; -if (largest->fofs <= fofs && largest->fofs + largest->len > fofs) +if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs) largest->len =0 ; }
@@ -168,7 +169,7 @@ void f2fs_drop_largest_extent(struct inode *inode, pgoff_t fofs)if (!f2fs_may_extent_tree (inode))return ; -__drop_largest_extent (inode, fofs); +__drop_largest_extent (inode, fofs,1 ); }void f2fs_init_extent_tree (struct inode *inode,struct f2fs_extent *i_ext)
@@ -422,7 +423,7 @@ static unsigned int f2fs_update_extent_tree_range(struct inode *inode, dei.len =0 ;/* we do not guarantee that the largest extent is cached all the time */ -__drop_largest_extent (inode, fofs); +__drop_largest_extent (inode, fofs, len);/* 1. lookup first extent node in range [fofs, fofs + len - 1] */ en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en,
--
1.7.9.5
------------------------------------------------------------------------------
Monitor Your Dynamic Infrastructure at Any Scale With Datadog! Get real-time metrics from all of your servers, apps and tools in one place.
SourceForge users - Click here to start your Free Trial of Datadog now!
http://pubads.g.doubleclick.net/gampad/clk?id=241902991&iu=/4140