1a28ef1f5SChao Yu /* 2a28ef1f5SChao Yu * f2fs extent cache support 3a28ef1f5SChao Yu * 4a28ef1f5SChao Yu * Copyright (c) 2015 Motorola Mobility 5a28ef1f5SChao Yu * Copyright (c) 2015 Samsung Electronics 6a28ef1f5SChao Yu * Authors: Jaegeuk Kim <jaegeuk@kernel.org> 7a28ef1f5SChao Yu * Chao Yu <chao2.yu@samsung.com> 8a28ef1f5SChao Yu * 9a28ef1f5SChao Yu * This program is free software; you can redistribute it and/or modify 10a28ef1f5SChao Yu * it under the terms of the GNU General Public License version 2 as 11a28ef1f5SChao Yu * published by the Free Software Foundation. 12a28ef1f5SChao Yu */ 13a28ef1f5SChao Yu 14a28ef1f5SChao Yu #include <linux/fs.h> 15a28ef1f5SChao Yu #include <linux/f2fs_fs.h> 16a28ef1f5SChao Yu 17a28ef1f5SChao Yu #include "f2fs.h" 18a28ef1f5SChao Yu #include "node.h" 19a28ef1f5SChao Yu #include <trace/events/f2fs.h> 20a28ef1f5SChao Yu 21a28ef1f5SChao Yu static struct kmem_cache *extent_tree_slab; 22a28ef1f5SChao Yu static struct kmem_cache *extent_node_slab; 23a28ef1f5SChao Yu 24a28ef1f5SChao Yu static struct extent_node *__attach_extent_node(struct f2fs_sb_info *sbi, 25a28ef1f5SChao Yu struct extent_tree *et, struct extent_info *ei, 26a28ef1f5SChao Yu struct rb_node *parent, struct rb_node **p) 27a28ef1f5SChao Yu { 28a28ef1f5SChao Yu struct extent_node *en; 29a28ef1f5SChao Yu 30a28ef1f5SChao Yu en = kmem_cache_alloc(extent_node_slab, GFP_ATOMIC); 31a28ef1f5SChao Yu if (!en) 32a28ef1f5SChao Yu return NULL; 33a28ef1f5SChao Yu 34a28ef1f5SChao Yu en->ei = *ei; 35a28ef1f5SChao Yu INIT_LIST_HEAD(&en->list); 36a28ef1f5SChao Yu 37a28ef1f5SChao Yu rb_link_node(&en->rb_node, parent, p); 38a28ef1f5SChao Yu rb_insert_color(&en->rb_node, &et->root); 3968e35385SChao Yu atomic_inc(&et->node_cnt); 40a28ef1f5SChao Yu atomic_inc(&sbi->total_ext_node); 41a28ef1f5SChao Yu return en; 42a28ef1f5SChao Yu } 43a28ef1f5SChao Yu 44a28ef1f5SChao Yu static void __detach_extent_node(struct f2fs_sb_info *sbi, 45a28ef1f5SChao Yu struct extent_tree *et, struct extent_node *en) 46a28ef1f5SChao Yu { 47a28ef1f5SChao Yu rb_erase(&en->rb_node, &et->root); 4868e35385SChao Yu atomic_dec(&et->node_cnt); 49a28ef1f5SChao Yu atomic_dec(&sbi->total_ext_node); 50a28ef1f5SChao Yu 51a28ef1f5SChao Yu if (et->cached_en == en) 52a28ef1f5SChao Yu et->cached_en = NULL; 53a03f01f2SHou Pengyang kmem_cache_free(extent_node_slab, en); 54a03f01f2SHou Pengyang } 55a03f01f2SHou Pengyang 56a03f01f2SHou Pengyang /* 57a03f01f2SHou Pengyang * Flow to release an extent_node: 58a03f01f2SHou Pengyang * 1. list_del_init 59a03f01f2SHou Pengyang * 2. __detach_extent_node 60a03f01f2SHou Pengyang * 3. kmem_cache_free. 61a03f01f2SHou Pengyang */ 62a03f01f2SHou Pengyang static void __release_extent_node(struct f2fs_sb_info *sbi, 63a03f01f2SHou Pengyang struct extent_tree *et, struct extent_node *en) 64a03f01f2SHou Pengyang { 65a03f01f2SHou Pengyang spin_lock(&sbi->extent_lock); 66a03f01f2SHou Pengyang if (!list_empty(&en->list)) 67a03f01f2SHou Pengyang list_del_init(&en->list); 68a03f01f2SHou Pengyang spin_unlock(&sbi->extent_lock); 69a03f01f2SHou Pengyang 70a03f01f2SHou Pengyang __detach_extent_node(sbi, et, en); 71a28ef1f5SChao Yu } 72a28ef1f5SChao Yu 73a28ef1f5SChao Yu static struct extent_tree *__grab_extent_tree(struct inode *inode) 74a28ef1f5SChao Yu { 75a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 76a28ef1f5SChao Yu struct extent_tree *et; 77a28ef1f5SChao Yu nid_t ino = inode->i_ino; 78a28ef1f5SChao Yu 79a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 80a28ef1f5SChao Yu et = radix_tree_lookup(&sbi->extent_tree_root, ino); 81a28ef1f5SChao Yu if (!et) { 82a28ef1f5SChao Yu et = f2fs_kmem_cache_alloc(extent_tree_slab, GFP_NOFS); 83a28ef1f5SChao Yu f2fs_radix_tree_insert(&sbi->extent_tree_root, ino, et); 84a28ef1f5SChao Yu memset(et, 0, sizeof(struct extent_tree)); 85a28ef1f5SChao Yu et->ino = ino; 86a28ef1f5SChao Yu et->root = RB_ROOT; 87a28ef1f5SChao Yu et->cached_en = NULL; 88a28ef1f5SChao Yu rwlock_init(&et->lock); 89137d09f0SJaegeuk Kim INIT_LIST_HEAD(&et->list); 9068e35385SChao Yu atomic_set(&et->node_cnt, 0); 917441ccefSJaegeuk Kim atomic_inc(&sbi->total_ext_tree); 9274fd8d99SJaegeuk Kim } else { 9374fd8d99SJaegeuk Kim atomic_dec(&sbi->total_zombie_tree); 94137d09f0SJaegeuk Kim list_del_init(&et->list); 95a28ef1f5SChao Yu } 96a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 97a28ef1f5SChao Yu 98a28ef1f5SChao Yu /* never died until evict_inode */ 99a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = et; 100a28ef1f5SChao Yu 101a28ef1f5SChao Yu return et; 102a28ef1f5SChao Yu } 103a28ef1f5SChao Yu 10491c481ffSChao Yu static struct extent_node *__lookup_extent_tree(struct f2fs_sb_info *sbi, 10591c481ffSChao Yu struct extent_tree *et, unsigned int fofs) 106a28ef1f5SChao Yu { 107a28ef1f5SChao Yu struct rb_node *node = et->root.rb_node; 108f8b703daSFan Li struct extent_node *en = et->cached_en; 109a28ef1f5SChao Yu 110f8b703daSFan Li if (en) { 111f8b703daSFan Li struct extent_info *cei = &en->ei; 112a28ef1f5SChao Yu 11391c481ffSChao Yu if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) { 11491c481ffSChao Yu stat_inc_cached_node_hit(sbi); 115f8b703daSFan Li return en; 116a28ef1f5SChao Yu } 11791c481ffSChao Yu } 118a28ef1f5SChao Yu 119a28ef1f5SChao Yu while (node) { 120a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 121a28ef1f5SChao Yu 122029e13ccSChao Yu if (fofs < en->ei.fofs) { 123a28ef1f5SChao Yu node = node->rb_left; 124029e13ccSChao Yu } else if (fofs >= en->ei.fofs + en->ei.len) { 125a28ef1f5SChao Yu node = node->rb_right; 126029e13ccSChao Yu } else { 127029e13ccSChao Yu stat_inc_rbtree_node_hit(sbi); 128a28ef1f5SChao Yu return en; 129a28ef1f5SChao Yu } 130029e13ccSChao Yu } 131a28ef1f5SChao Yu return NULL; 132a28ef1f5SChao Yu } 133a28ef1f5SChao Yu 134a6f78345SChao Yu static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi, 135a6f78345SChao Yu struct extent_tree *et, struct extent_info *ei) 136a28ef1f5SChao Yu { 137a28ef1f5SChao Yu struct rb_node **p = &et->root.rb_node; 138a28ef1f5SChao Yu struct extent_node *en; 139a28ef1f5SChao Yu 140a6f78345SChao Yu en = __attach_extent_node(sbi, et, ei, NULL, p); 141a28ef1f5SChao Yu if (!en) 142a28ef1f5SChao Yu return NULL; 143a6f78345SChao Yu 144a28ef1f5SChao Yu et->largest = en->ei; 145a28ef1f5SChao Yu et->cached_en = en; 146a28ef1f5SChao Yu return en; 147a28ef1f5SChao Yu } 148a28ef1f5SChao Yu 149a28ef1f5SChao Yu static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi, 150a28ef1f5SChao Yu struct extent_tree *et, bool free_all) 151a28ef1f5SChao Yu { 152a28ef1f5SChao Yu struct rb_node *node, *next; 153a28ef1f5SChao Yu struct extent_node *en; 15468e35385SChao Yu unsigned int count = atomic_read(&et->node_cnt); 155a28ef1f5SChao Yu 156a28ef1f5SChao Yu node = rb_first(&et->root); 157a28ef1f5SChao Yu while (node) { 158a28ef1f5SChao Yu next = rb_next(node); 159a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 160a28ef1f5SChao Yu 161a03f01f2SHou Pengyang if (free_all) 162a03f01f2SHou Pengyang __release_extent_node(sbi, et, en); 163a03f01f2SHou Pengyang else if (list_empty(&en->list)) 164a28ef1f5SChao Yu __detach_extent_node(sbi, et, en); 165a28ef1f5SChao Yu node = next; 166a28ef1f5SChao Yu } 167a28ef1f5SChao Yu 16868e35385SChao Yu return count - atomic_read(&et->node_cnt); 169a28ef1f5SChao Yu } 170a28ef1f5SChao Yu 17141a099deSFan Li static void __drop_largest_extent(struct inode *inode, 17241a099deSFan Li pgoff_t fofs, unsigned int len) 173a28ef1f5SChao Yu { 174a28ef1f5SChao Yu struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; 175a28ef1f5SChao Yu 17641a099deSFan Li if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs) 177a28ef1f5SChao Yu largest->len = 0; 178a28ef1f5SChao Yu } 179a28ef1f5SChao Yu 180ed3d1256SJaegeuk Kim /* return true, if inode page is changed */ 181ed3d1256SJaegeuk Kim bool f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 182a28ef1f5SChao Yu { 183a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 184a28ef1f5SChao Yu struct extent_tree *et; 185a28ef1f5SChao Yu struct extent_node *en; 186a28ef1f5SChao Yu struct extent_info ei; 187a28ef1f5SChao Yu 188ed3d1256SJaegeuk Kim if (!f2fs_may_extent_tree(inode)) { 189ed3d1256SJaegeuk Kim /* drop largest extent */ 190ed3d1256SJaegeuk Kim if (i_ext && i_ext->len) { 191ed3d1256SJaegeuk Kim i_ext->len = 0; 192ed3d1256SJaegeuk Kim return true; 193ed3d1256SJaegeuk Kim } 194ed3d1256SJaegeuk Kim return false; 195ed3d1256SJaegeuk Kim } 196a28ef1f5SChao Yu 197a28ef1f5SChao Yu et = __grab_extent_tree(inode); 198a28ef1f5SChao Yu 199ed3d1256SJaegeuk Kim if (!i_ext || !i_ext->len) 200ed3d1256SJaegeuk Kim return false; 201a28ef1f5SChao Yu 202a28ef1f5SChao Yu set_extent_info(&ei, le32_to_cpu(i_ext->fofs), 203a28ef1f5SChao Yu le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); 204a28ef1f5SChao Yu 205a28ef1f5SChao Yu write_lock(&et->lock); 20668e35385SChao Yu if (atomic_read(&et->node_cnt)) 207a28ef1f5SChao Yu goto out; 208a28ef1f5SChao Yu 209a6f78345SChao Yu en = __init_extent_tree(sbi, et, &ei); 210a28ef1f5SChao Yu if (en) { 211a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 212a28ef1f5SChao Yu list_add_tail(&en->list, &sbi->extent_list); 213a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 214a28ef1f5SChao Yu } 215a28ef1f5SChao Yu out: 216a28ef1f5SChao Yu write_unlock(&et->lock); 217ed3d1256SJaegeuk Kim return false; 218a28ef1f5SChao Yu } 219a28ef1f5SChao Yu 220a28ef1f5SChao Yu static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, 221a28ef1f5SChao Yu struct extent_info *ei) 222a28ef1f5SChao Yu { 223a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 224a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 225a28ef1f5SChao Yu struct extent_node *en; 226a28ef1f5SChao Yu bool ret = false; 227a28ef1f5SChao Yu 228a28ef1f5SChao Yu f2fs_bug_on(sbi, !et); 229a28ef1f5SChao Yu 230a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_start(inode, pgofs); 231a28ef1f5SChao Yu 232a28ef1f5SChao Yu read_lock(&et->lock); 233a28ef1f5SChao Yu 234a28ef1f5SChao Yu if (et->largest.fofs <= pgofs && 235a28ef1f5SChao Yu et->largest.fofs + et->largest.len > pgofs) { 236a28ef1f5SChao Yu *ei = et->largest; 237a28ef1f5SChao Yu ret = true; 23891c481ffSChao Yu stat_inc_largest_node_hit(sbi); 239a28ef1f5SChao Yu goto out; 240a28ef1f5SChao Yu } 241a28ef1f5SChao Yu 24291c481ffSChao Yu en = __lookup_extent_tree(sbi, et, pgofs); 243a28ef1f5SChao Yu if (en) { 244a28ef1f5SChao Yu *ei = en->ei; 245a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 246a28ef1f5SChao Yu if (!list_empty(&en->list)) 247a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 248a28ef1f5SChao Yu et->cached_en = en; 249a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 250a28ef1f5SChao Yu ret = true; 251a28ef1f5SChao Yu } 252a28ef1f5SChao Yu out: 253727edac5SChao Yu stat_inc_total_hit(sbi); 254a28ef1f5SChao Yu read_unlock(&et->lock); 255a28ef1f5SChao Yu 256a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 257a28ef1f5SChao Yu return ret; 258a28ef1f5SChao Yu } 259a28ef1f5SChao Yu 2600f825ee6SFan Li 2610f825ee6SFan Li /* 2620f825ee6SFan Li * lookup extent at @fofs, if hit, return the extent 2630f825ee6SFan Li * if not, return NULL and 2640f825ee6SFan Li * @prev_ex: extent before fofs 2650f825ee6SFan Li * @next_ex: extent after fofs 2660f825ee6SFan Li * @insert_p: insert point for new extent at fofs 2670f825ee6SFan Li * in order to simpfy the insertion after. 2680f825ee6SFan Li * tree must stay unchanged between lookup and insertion. 2690f825ee6SFan Li */ 2700f825ee6SFan Li static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, 27191c481ffSChao Yu unsigned int fofs, 27291c481ffSChao Yu struct extent_node **prev_ex, 2730f825ee6SFan Li struct extent_node **next_ex, 2740f825ee6SFan Li struct rb_node ***insert_p, 2750f825ee6SFan Li struct rb_node **insert_parent) 2760f825ee6SFan Li { 2770f825ee6SFan Li struct rb_node **pnode = &et->root.rb_node; 2780f825ee6SFan Li struct rb_node *parent = NULL, *tmp_node; 279dac2ddefSChao Yu struct extent_node *en = et->cached_en; 2800f825ee6SFan Li 281dac2ddefSChao Yu *insert_p = NULL; 282dac2ddefSChao Yu *insert_parent = NULL; 283dac2ddefSChao Yu *prev_ex = NULL; 284dac2ddefSChao Yu *next_ex = NULL; 285dac2ddefSChao Yu 286dac2ddefSChao Yu if (RB_EMPTY_ROOT(&et->root)) 287dac2ddefSChao Yu return NULL; 288dac2ddefSChao Yu 289dac2ddefSChao Yu if (en) { 290dac2ddefSChao Yu struct extent_info *cei = &en->ei; 2910f825ee6SFan Li 2920f825ee6SFan Li if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) 293dac2ddefSChao Yu goto lookup_neighbors; 2940f825ee6SFan Li } 2950f825ee6SFan Li 2960f825ee6SFan Li while (*pnode) { 2970f825ee6SFan Li parent = *pnode; 2980f825ee6SFan Li en = rb_entry(*pnode, struct extent_node, rb_node); 2990f825ee6SFan Li 3000f825ee6SFan Li if (fofs < en->ei.fofs) 3010f825ee6SFan Li pnode = &(*pnode)->rb_left; 3020f825ee6SFan Li else if (fofs >= en->ei.fofs + en->ei.len) 3030f825ee6SFan Li pnode = &(*pnode)->rb_right; 3040f825ee6SFan Li else 305dac2ddefSChao Yu goto lookup_neighbors; 3060f825ee6SFan Li } 3070f825ee6SFan Li 3080f825ee6SFan Li *insert_p = pnode; 3090f825ee6SFan Li *insert_parent = parent; 3100f825ee6SFan Li 3110f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3120f825ee6SFan Li tmp_node = parent; 3130f825ee6SFan Li if (parent && fofs > en->ei.fofs) 3140f825ee6SFan Li tmp_node = rb_next(parent); 3150f825ee6SFan Li *next_ex = tmp_node ? 3160f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3170f825ee6SFan Li 3180f825ee6SFan Li tmp_node = parent; 3190f825ee6SFan Li if (parent && fofs < en->ei.fofs) 3200f825ee6SFan Li tmp_node = rb_prev(parent); 3210f825ee6SFan Li *prev_ex = tmp_node ? 3220f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3230f825ee6SFan Li return NULL; 324dac2ddefSChao Yu 325dac2ddefSChao Yu lookup_neighbors: 326dac2ddefSChao Yu if (fofs == en->ei.fofs) { 327dac2ddefSChao Yu /* lookup prev node for merging backward later */ 328dac2ddefSChao Yu tmp_node = rb_prev(&en->rb_node); 329dac2ddefSChao Yu *prev_ex = tmp_node ? 330dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 331dac2ddefSChao Yu } 332dac2ddefSChao Yu if (fofs == en->ei.fofs + en->ei.len - 1) { 333dac2ddefSChao Yu /* lookup next node for merging frontward later */ 334dac2ddefSChao Yu tmp_node = rb_next(&en->rb_node); 335dac2ddefSChao Yu *next_ex = tmp_node ? 336dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 337dac2ddefSChao Yu } 338dac2ddefSChao Yu return en; 3390f825ee6SFan Li } 3400f825ee6SFan Li 341ef05e221SChao Yu static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi, 3420f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 3430f825ee6SFan Li struct extent_node *prev_ex, 344ef05e221SChao Yu struct extent_node *next_ex) 3450f825ee6SFan Li { 3460f825ee6SFan Li struct extent_node *en = NULL; 3470f825ee6SFan Li 3480f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 3490f825ee6SFan Li prev_ex->ei.len += ei->len; 3500f825ee6SFan Li ei = &prev_ex->ei; 3510f825ee6SFan Li en = prev_ex; 3520f825ee6SFan Li } 353ef05e221SChao Yu 3540f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 355a03f01f2SHou Pengyang if (en) 356a03f01f2SHou Pengyang __release_extent_node(sbi, et, prev_ex); 3570f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 3580f825ee6SFan Li next_ex->ei.blk = ei->blk; 3590f825ee6SFan Li next_ex->ei.len += ei->len; 3600f825ee6SFan Li en = next_ex; 3610f825ee6SFan Li } 362ef05e221SChao Yu 363ef05e221SChao Yu if (en) { 3644abd3f5aSChao Yu __try_update_largest_extent(et, en); 365ef05e221SChao Yu et->cached_en = en; 366ef05e221SChao Yu } 367ef05e221SChao Yu return en; 368ef05e221SChao Yu } 369ef05e221SChao Yu 370ef05e221SChao Yu static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, 371ef05e221SChao Yu struct extent_tree *et, struct extent_info *ei, 372ef05e221SChao Yu struct rb_node **insert_p, 373ef05e221SChao Yu struct rb_node *insert_parent) 374ef05e221SChao Yu { 375ef05e221SChao Yu struct rb_node **p = &et->root.rb_node; 376ef05e221SChao Yu struct rb_node *parent = NULL; 377ef05e221SChao Yu struct extent_node *en = NULL; 3780f825ee6SFan Li 3790f825ee6SFan Li if (insert_p && insert_parent) { 3800f825ee6SFan Li parent = insert_parent; 3810f825ee6SFan Li p = insert_p; 3820f825ee6SFan Li goto do_insert; 3830f825ee6SFan Li } 3840f825ee6SFan Li 3850f825ee6SFan Li while (*p) { 3860f825ee6SFan Li parent = *p; 3870f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3880f825ee6SFan Li 3890f825ee6SFan Li if (ei->fofs < en->ei.fofs) 3900f825ee6SFan Li p = &(*p)->rb_left; 3910f825ee6SFan Li else if (ei->fofs >= en->ei.fofs + en->ei.len) 3920f825ee6SFan Li p = &(*p)->rb_right; 3930f825ee6SFan Li else 3940f825ee6SFan Li f2fs_bug_on(sbi, 1); 3950f825ee6SFan Li } 3960f825ee6SFan Li do_insert: 3970f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 3980f825ee6SFan Li if (!en) 3990f825ee6SFan Li return NULL; 400ef05e221SChao Yu 4014abd3f5aSChao Yu __try_update_largest_extent(et, en); 4020f825ee6SFan Li et->cached_en = en; 4030f825ee6SFan Li return en; 4040f825ee6SFan Li } 4050f825ee6SFan Li 406514053e4SJaegeuk Kim static unsigned int f2fs_update_extent_tree_range(struct inode *inode, 40719b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 408a28ef1f5SChao Yu { 409a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 410a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 4114d1fa815SFan Li struct extent_node *en = NULL, *en1 = NULL; 41219b2c30dSChao Yu struct extent_node *prev_en = NULL, *next_en = NULL; 413a28ef1f5SChao Yu struct extent_info ei, dei, prev; 4140f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 41519b2c30dSChao Yu unsigned int end = fofs + len; 41619b2c30dSChao Yu unsigned int pos = (unsigned int)fofs; 417a28ef1f5SChao Yu 418a28ef1f5SChao Yu if (!et) 419a28ef1f5SChao Yu return false; 420a28ef1f5SChao Yu 421744288c7SChao Yu trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len); 422744288c7SChao Yu 423a28ef1f5SChao Yu write_lock(&et->lock); 424a28ef1f5SChao Yu 425a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { 426a28ef1f5SChao Yu write_unlock(&et->lock); 427a28ef1f5SChao Yu return false; 428a28ef1f5SChao Yu } 429a28ef1f5SChao Yu 430a28ef1f5SChao Yu prev = et->largest; 431a28ef1f5SChao Yu dei.len = 0; 432a28ef1f5SChao Yu 4334d1fa815SFan Li /* 4344d1fa815SFan Li * drop largest extent before lookup, in case it's already 4354d1fa815SFan Li * been shrunk from extent tree 4364d1fa815SFan Li */ 43741a099deSFan Li __drop_largest_extent(inode, fofs, len); 438a28ef1f5SChao Yu 43919b2c30dSChao Yu /* 1. lookup first extent node in range [fofs, fofs + len - 1] */ 44019b2c30dSChao Yu en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en, 4410f825ee6SFan Li &insert_p, &insert_parent); 4424d1fa815SFan Li if (!en) 44319b2c30dSChao Yu en = next_en; 44419b2c30dSChao Yu 44519b2c30dSChao Yu /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */ 4464d1fa815SFan Li while (en && en->ei.fofs < end) { 4474d1fa815SFan Li unsigned int org_end; 4484d1fa815SFan Li int parts = 0; /* # of parts current extent split into */ 44919b2c30dSChao Yu 4504d1fa815SFan Li next_en = en1 = NULL; 451a28ef1f5SChao Yu 452a28ef1f5SChao Yu dei = en->ei; 4534d1fa815SFan Li org_end = dei.fofs + dei.len; 4544d1fa815SFan Li f2fs_bug_on(sbi, pos >= org_end); 45519b2c30dSChao Yu 4564d1fa815SFan Li if (pos > dei.fofs && pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 4574d1fa815SFan Li en->ei.len = pos - en->ei.fofs; 4584d1fa815SFan Li prev_en = en; 4594d1fa815SFan Li parts = 1; 46019b2c30dSChao Yu } 46119b2c30dSChao Yu 4624d1fa815SFan Li if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) { 4634d1fa815SFan Li if (parts) { 4644d1fa815SFan Li set_extent_info(&ei, end, 4654d1fa815SFan Li end - dei.fofs + dei.blk, 4664d1fa815SFan Li org_end - end); 4674d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 4684d1fa815SFan Li NULL, NULL); 4694d1fa815SFan Li next_en = en1; 4704d1fa815SFan Li } else { 47119b2c30dSChao Yu en->ei.fofs = end; 47219b2c30dSChao Yu en->ei.blk += end - dei.fofs; 47319b2c30dSChao Yu en->ei.len -= end - dei.fofs; 4744d1fa815SFan Li next_en = en; 4754d1fa815SFan Li } 4764d1fa815SFan Li parts++; 47719b2c30dSChao Yu } 47819b2c30dSChao Yu 4794d1fa815SFan Li if (!next_en) { 4804d1fa815SFan Li struct rb_node *node = rb_next(&en->rb_node); 4814d1fa815SFan Li 4824d1fa815SFan Li next_en = node ? 4834d1fa815SFan Li rb_entry(node, struct extent_node, rb_node) 4844d1fa815SFan Li : NULL; 4854d1fa815SFan Li } 4864d1fa815SFan Li 4874abd3f5aSChao Yu if (parts) 4884abd3f5aSChao Yu __try_update_largest_extent(et, en); 4894abd3f5aSChao Yu else 490a03f01f2SHou Pengyang __release_extent_node(sbi, et, en); 49119b2c30dSChao Yu 49219b2c30dSChao Yu /* 4934d1fa815SFan Li * if original extent is split into zero or two parts, extent 4944d1fa815SFan Li * tree has been altered by deletion or insertion, therefore 4954d1fa815SFan Li * invalidate pointers regard to tree. 49619b2c30dSChao Yu */ 4974d1fa815SFan Li if (parts != 1) { 49819b2c30dSChao Yu insert_p = NULL; 49919b2c30dSChao Yu insert_parent = NULL; 50019b2c30dSChao Yu } 50119b2c30dSChao Yu 5024d1fa815SFan Li /* update in global extent list */ 50319b2c30dSChao Yu spin_lock(&sbi->extent_lock); 50419b2c30dSChao Yu if (en1) 50519b2c30dSChao Yu list_add_tail(&en1->list, &sbi->extent_list); 50619b2c30dSChao Yu spin_unlock(&sbi->extent_lock); 50719b2c30dSChao Yu 5084d1fa815SFan Li en = next_en; 50919b2c30dSChao Yu } 510a28ef1f5SChao Yu 511a28ef1f5SChao Yu /* 3. update extent in extent cache */ 512a28ef1f5SChao Yu if (blkaddr) { 51319b2c30dSChao Yu 51419b2c30dSChao Yu set_extent_info(&ei, fofs, blkaddr, len); 515a03f01f2SHou Pengyang en1 = __try_merge_extent_node(sbi, et, &ei, prev_en, next_en); 5164d1fa815SFan Li if (!en1) 5174d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 518ef05e221SChao Yu insert_p, insert_parent); 519a28ef1f5SChao Yu 520a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 521a28ef1f5SChao Yu if (dei.len >= 1 && 522a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 523a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 524a28ef1f5SChao Yu et->largest.len = 0; 525a28ef1f5SChao Yu set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); 526a28ef1f5SChao Yu } 527a28ef1f5SChao Yu 528a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 5294d1fa815SFan Li if (en1) { 5304d1fa815SFan Li if (list_empty(&en1->list)) 5314d1fa815SFan Li list_add_tail(&en1->list, &sbi->extent_list); 532a28ef1f5SChao Yu else 5334d1fa815SFan Li list_move_tail(&en1->list, &sbi->extent_list); 534a28ef1f5SChao Yu } 535a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 53619b2c30dSChao Yu } 537a28ef1f5SChao Yu 538a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) 539a28ef1f5SChao Yu __free_extent_tree(sbi, et, true); 540a28ef1f5SChao Yu 541a28ef1f5SChao Yu write_unlock(&et->lock); 542a28ef1f5SChao Yu 543a28ef1f5SChao Yu return !__is_extent_same(&prev, &et->largest); 544a28ef1f5SChao Yu } 545a28ef1f5SChao Yu 546a28ef1f5SChao Yu unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) 547a28ef1f5SChao Yu { 548a28ef1f5SChao Yu struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; 549137d09f0SJaegeuk Kim struct extent_tree *et, *next; 550a28ef1f5SChao Yu struct extent_node *en, *tmp; 551a28ef1f5SChao Yu unsigned long ino = F2FS_ROOT_INO(sbi); 552a28ef1f5SChao Yu unsigned int found; 553a28ef1f5SChao Yu unsigned int node_cnt = 0, tree_cnt = 0; 554a28ef1f5SChao Yu int remained; 55574fd8d99SJaegeuk Kim bool do_free = false; 556a28ef1f5SChao Yu 557a28ef1f5SChao Yu if (!test_opt(sbi, EXTENT_CACHE)) 558a28ef1f5SChao Yu return 0; 559a28ef1f5SChao Yu 56074fd8d99SJaegeuk Kim if (!atomic_read(&sbi->total_zombie_tree)) 56174fd8d99SJaegeuk Kim goto free_node; 56274fd8d99SJaegeuk Kim 563a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 564a28ef1f5SChao Yu goto out; 565a28ef1f5SChao Yu 566a28ef1f5SChao Yu /* 1. remove unreferenced extent tree */ 567137d09f0SJaegeuk Kim list_for_each_entry_safe(et, next, &sbi->zombie_list, list) { 5689b72a388SChao Yu if (atomic_read(&et->node_cnt)) { 569a28ef1f5SChao Yu write_lock(&et->lock); 570a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, true); 571a28ef1f5SChao Yu write_unlock(&et->lock); 5729b72a388SChao Yu } 573a28ef1f5SChao Yu 574137d09f0SJaegeuk Kim list_del_init(&et->list); 575137d09f0SJaegeuk Kim radix_tree_delete(&sbi->extent_tree_root, et->ino); 576a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 5777441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 57874fd8d99SJaegeuk Kim atomic_dec(&sbi->total_zombie_tree); 579a28ef1f5SChao Yu tree_cnt++; 580a28ef1f5SChao Yu 581a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 582a28ef1f5SChao Yu goto unlock_out; 583a28ef1f5SChao Yu } 584a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 585a28ef1f5SChao Yu 58674fd8d99SJaegeuk Kim free_node: 587a28ef1f5SChao Yu /* 2. remove LRU extent entries */ 588a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 589a28ef1f5SChao Yu goto out; 590a28ef1f5SChao Yu 591a28ef1f5SChao Yu remained = nr_shrink - (node_cnt + tree_cnt); 592a28ef1f5SChao Yu 593a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 594a28ef1f5SChao Yu list_for_each_entry_safe(en, tmp, &sbi->extent_list, list) { 595a28ef1f5SChao Yu if (!remained--) 596a28ef1f5SChao Yu break; 597a28ef1f5SChao Yu list_del_init(&en->list); 59874fd8d99SJaegeuk Kim do_free = true; 599a28ef1f5SChao Yu } 600a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 601a28ef1f5SChao Yu 60274fd8d99SJaegeuk Kim if (do_free == false) 60374fd8d99SJaegeuk Kim goto unlock_out; 60474fd8d99SJaegeuk Kim 605100136acSChao Yu /* 606100136acSChao Yu * reset ino for searching victims from beginning of global extent tree. 607100136acSChao Yu */ 608100136acSChao Yu ino = F2FS_ROOT_INO(sbi); 609100136acSChao Yu 610137d09f0SJaegeuk Kim while ((found = radix_tree_gang_lookup(&sbi->extent_tree_root, 611a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 612a28ef1f5SChao Yu unsigned i; 613a28ef1f5SChao Yu 614a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 615a28ef1f5SChao Yu for (i = 0; i < found; i++) { 616a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 617a28ef1f5SChao Yu 6189b72a388SChao Yu if (!atomic_read(&et->node_cnt)) 6199b72a388SChao Yu continue; 6209b72a388SChao Yu 621760de791SJaegeuk Kim if (write_trylock(&et->lock)) { 622a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, false); 623a28ef1f5SChao Yu write_unlock(&et->lock); 624760de791SJaegeuk Kim } 625a28ef1f5SChao Yu 626a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 627beaa57ddSChao Yu goto unlock_out; 628a28ef1f5SChao Yu } 629a28ef1f5SChao Yu } 630a28ef1f5SChao Yu unlock_out: 631a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 632a28ef1f5SChao Yu out: 633a28ef1f5SChao Yu trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); 634a28ef1f5SChao Yu 635a28ef1f5SChao Yu return node_cnt + tree_cnt; 636a28ef1f5SChao Yu } 637a28ef1f5SChao Yu 638a28ef1f5SChao Yu unsigned int f2fs_destroy_extent_node(struct inode *inode) 639a28ef1f5SChao Yu { 640a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 641a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 642a28ef1f5SChao Yu unsigned int node_cnt = 0; 643a28ef1f5SChao Yu 6449b72a388SChao Yu if (!et || !atomic_read(&et->node_cnt)) 645a28ef1f5SChao Yu return 0; 646a28ef1f5SChao Yu 647a28ef1f5SChao Yu write_lock(&et->lock); 648a28ef1f5SChao Yu node_cnt = __free_extent_tree(sbi, et, true); 649a28ef1f5SChao Yu write_unlock(&et->lock); 650a28ef1f5SChao Yu 651a28ef1f5SChao Yu return node_cnt; 652a28ef1f5SChao Yu } 653a28ef1f5SChao Yu 654a28ef1f5SChao Yu void f2fs_destroy_extent_tree(struct inode *inode) 655a28ef1f5SChao Yu { 656a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 657a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 658a28ef1f5SChao Yu unsigned int node_cnt = 0; 659a28ef1f5SChao Yu 660a28ef1f5SChao Yu if (!et) 661a28ef1f5SChao Yu return; 662a28ef1f5SChao Yu 66368e35385SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && 66468e35385SChao Yu atomic_read(&et->node_cnt)) { 665137d09f0SJaegeuk Kim down_write(&sbi->extent_tree_lock); 666137d09f0SJaegeuk Kim list_add_tail(&et->list, &sbi->zombie_list); 66774fd8d99SJaegeuk Kim atomic_inc(&sbi->total_zombie_tree); 668137d09f0SJaegeuk Kim up_write(&sbi->extent_tree_lock); 669a28ef1f5SChao Yu return; 670a28ef1f5SChao Yu } 671a28ef1f5SChao Yu 672a28ef1f5SChao Yu /* free all extent info belong to this extent tree */ 673a28ef1f5SChao Yu node_cnt = f2fs_destroy_extent_node(inode); 674a28ef1f5SChao Yu 675a28ef1f5SChao Yu /* delete extent tree entry in radix tree */ 676a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 67768e35385SChao Yu f2fs_bug_on(sbi, atomic_read(&et->node_cnt)); 678a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 679a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 6807441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 681a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 682a28ef1f5SChao Yu 683a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 684a28ef1f5SChao Yu 685a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 686a28ef1f5SChao Yu } 687a28ef1f5SChao Yu 688a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 689a28ef1f5SChao Yu struct extent_info *ei) 690a28ef1f5SChao Yu { 691a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 692a28ef1f5SChao Yu return false; 693a28ef1f5SChao Yu 694a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 695a28ef1f5SChao Yu } 696a28ef1f5SChao Yu 697a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 698a28ef1f5SChao Yu { 699a28ef1f5SChao Yu struct f2fs_inode_info *fi = F2FS_I(dn->inode); 700a28ef1f5SChao Yu pgoff_t fofs; 701a28ef1f5SChao Yu 702a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 703a28ef1f5SChao Yu return; 704a28ef1f5SChao Yu 705a28ef1f5SChao Yu f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); 706a28ef1f5SChao Yu 70719b2c30dSChao Yu 708a28ef1f5SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + 709a28ef1f5SChao Yu dn->ofs_in_node; 710a28ef1f5SChao Yu 71119b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, dn->data_blkaddr, 1)) 71219b2c30dSChao Yu sync_inode_page(dn); 71319b2c30dSChao Yu } 71419b2c30dSChao Yu 71519b2c30dSChao Yu void f2fs_update_extent_cache_range(struct dnode_of_data *dn, 71619b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 71719b2c30dSChao Yu 71819b2c30dSChao Yu { 71919b2c30dSChao Yu if (!f2fs_may_extent_tree(dn->inode)) 72019b2c30dSChao Yu return; 72119b2c30dSChao Yu 72219b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len)) 723a28ef1f5SChao Yu sync_inode_page(dn); 724a28ef1f5SChao Yu } 725a28ef1f5SChao Yu 726a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 727a28ef1f5SChao Yu { 728a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 729a28ef1f5SChao Yu init_rwsem(&sbi->extent_tree_lock); 730a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 731a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 7327441ccefSJaegeuk Kim atomic_set(&sbi->total_ext_tree, 0); 733137d09f0SJaegeuk Kim INIT_LIST_HEAD(&sbi->zombie_list); 73474fd8d99SJaegeuk Kim atomic_set(&sbi->total_zombie_tree, 0); 735a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 736a28ef1f5SChao Yu } 737a28ef1f5SChao Yu 738a28ef1f5SChao Yu int __init create_extent_cache(void) 739a28ef1f5SChao Yu { 740a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 741a28ef1f5SChao Yu sizeof(struct extent_tree)); 742a28ef1f5SChao Yu if (!extent_tree_slab) 743a28ef1f5SChao Yu return -ENOMEM; 744a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 745a28ef1f5SChao Yu sizeof(struct extent_node)); 746a28ef1f5SChao Yu if (!extent_node_slab) { 747a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 748a28ef1f5SChao Yu return -ENOMEM; 749a28ef1f5SChao Yu } 750a28ef1f5SChao Yu return 0; 751a28ef1f5SChao Yu } 752a28ef1f5SChao Yu 753a28ef1f5SChao Yu void destroy_extent_cache(void) 754a28ef1f5SChao Yu { 755a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 756a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 757a28ef1f5SChao Yu } 758