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); 246*42926744SJaegeuk Kim if (!list_empty(&en->list)) { 247a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 248a28ef1f5SChao Yu et->cached_en = en; 249*42926744SJaegeuk Kim } 250a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 251a28ef1f5SChao Yu ret = true; 252a28ef1f5SChao Yu } 253a28ef1f5SChao Yu out: 254727edac5SChao Yu stat_inc_total_hit(sbi); 255a28ef1f5SChao Yu read_unlock(&et->lock); 256a28ef1f5SChao Yu 257a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 258a28ef1f5SChao Yu return ret; 259a28ef1f5SChao Yu } 260a28ef1f5SChao Yu 2610f825ee6SFan Li 2620f825ee6SFan Li /* 2630f825ee6SFan Li * lookup extent at @fofs, if hit, return the extent 2640f825ee6SFan Li * if not, return NULL and 2650f825ee6SFan Li * @prev_ex: extent before fofs 2660f825ee6SFan Li * @next_ex: extent after fofs 2670f825ee6SFan Li * @insert_p: insert point for new extent at fofs 2680f825ee6SFan Li * in order to simpfy the insertion after. 2690f825ee6SFan Li * tree must stay unchanged between lookup and insertion. 2700f825ee6SFan Li */ 2710f825ee6SFan Li static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, 27291c481ffSChao Yu unsigned int fofs, 27391c481ffSChao Yu struct extent_node **prev_ex, 2740f825ee6SFan Li struct extent_node **next_ex, 2750f825ee6SFan Li struct rb_node ***insert_p, 2760f825ee6SFan Li struct rb_node **insert_parent) 2770f825ee6SFan Li { 2780f825ee6SFan Li struct rb_node **pnode = &et->root.rb_node; 2790f825ee6SFan Li struct rb_node *parent = NULL, *tmp_node; 280dac2ddefSChao Yu struct extent_node *en = et->cached_en; 2810f825ee6SFan Li 282dac2ddefSChao Yu *insert_p = NULL; 283dac2ddefSChao Yu *insert_parent = NULL; 284dac2ddefSChao Yu *prev_ex = NULL; 285dac2ddefSChao Yu *next_ex = NULL; 286dac2ddefSChao Yu 287dac2ddefSChao Yu if (RB_EMPTY_ROOT(&et->root)) 288dac2ddefSChao Yu return NULL; 289dac2ddefSChao Yu 290dac2ddefSChao Yu if (en) { 291dac2ddefSChao Yu struct extent_info *cei = &en->ei; 2920f825ee6SFan Li 2930f825ee6SFan Li if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) 294dac2ddefSChao Yu goto lookup_neighbors; 2950f825ee6SFan Li } 2960f825ee6SFan Li 2970f825ee6SFan Li while (*pnode) { 2980f825ee6SFan Li parent = *pnode; 2990f825ee6SFan Li en = rb_entry(*pnode, struct extent_node, rb_node); 3000f825ee6SFan Li 3010f825ee6SFan Li if (fofs < en->ei.fofs) 3020f825ee6SFan Li pnode = &(*pnode)->rb_left; 3030f825ee6SFan Li else if (fofs >= en->ei.fofs + en->ei.len) 3040f825ee6SFan Li pnode = &(*pnode)->rb_right; 3050f825ee6SFan Li else 306dac2ddefSChao Yu goto lookup_neighbors; 3070f825ee6SFan Li } 3080f825ee6SFan Li 3090f825ee6SFan Li *insert_p = pnode; 3100f825ee6SFan Li *insert_parent = parent; 3110f825ee6SFan Li 3120f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3130f825ee6SFan Li tmp_node = parent; 3140f825ee6SFan Li if (parent && fofs > en->ei.fofs) 3150f825ee6SFan Li tmp_node = rb_next(parent); 3160f825ee6SFan Li *next_ex = tmp_node ? 3170f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3180f825ee6SFan Li 3190f825ee6SFan Li tmp_node = parent; 3200f825ee6SFan Li if (parent && fofs < en->ei.fofs) 3210f825ee6SFan Li tmp_node = rb_prev(parent); 3220f825ee6SFan Li *prev_ex = tmp_node ? 3230f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3240f825ee6SFan Li return NULL; 325dac2ddefSChao Yu 326dac2ddefSChao Yu lookup_neighbors: 327dac2ddefSChao Yu if (fofs == en->ei.fofs) { 328dac2ddefSChao Yu /* lookup prev node for merging backward later */ 329dac2ddefSChao Yu tmp_node = rb_prev(&en->rb_node); 330dac2ddefSChao Yu *prev_ex = tmp_node ? 331dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 332dac2ddefSChao Yu } 333dac2ddefSChao Yu if (fofs == en->ei.fofs + en->ei.len - 1) { 334dac2ddefSChao Yu /* lookup next node for merging frontward later */ 335dac2ddefSChao Yu tmp_node = rb_next(&en->rb_node); 336dac2ddefSChao Yu *next_ex = tmp_node ? 337dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 338dac2ddefSChao Yu } 339dac2ddefSChao Yu return en; 3400f825ee6SFan Li } 3410f825ee6SFan Li 342ef05e221SChao Yu static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi, 3430f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 3440f825ee6SFan Li struct extent_node *prev_ex, 345ef05e221SChao Yu struct extent_node *next_ex) 3460f825ee6SFan Li { 3470f825ee6SFan Li struct extent_node *en = NULL; 3480f825ee6SFan Li 3490f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 3500f825ee6SFan Li prev_ex->ei.len += ei->len; 3510f825ee6SFan Li ei = &prev_ex->ei; 3520f825ee6SFan Li en = prev_ex; 3530f825ee6SFan Li } 354ef05e221SChao Yu 3550f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 356a03f01f2SHou Pengyang if (en) 357a03f01f2SHou Pengyang __release_extent_node(sbi, et, prev_ex); 3580f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 3590f825ee6SFan Li next_ex->ei.blk = ei->blk; 3600f825ee6SFan Li next_ex->ei.len += ei->len; 3610f825ee6SFan Li en = next_ex; 3620f825ee6SFan Li } 363ef05e221SChao Yu 36443a2fa18SJaegeuk Kim if (!en) 36543a2fa18SJaegeuk Kim return NULL; 36643a2fa18SJaegeuk Kim 3674abd3f5aSChao Yu __try_update_largest_extent(et, en); 36843a2fa18SJaegeuk Kim 36943a2fa18SJaegeuk Kim spin_lock(&sbi->extent_lock); 370*42926744SJaegeuk Kim if (!list_empty(&en->list)) { 37143a2fa18SJaegeuk Kim list_move_tail(&en->list, &sbi->extent_list); 372*42926744SJaegeuk Kim et->cached_en = en; 373*42926744SJaegeuk Kim } 37443a2fa18SJaegeuk Kim spin_unlock(&sbi->extent_lock); 375ef05e221SChao Yu return en; 376ef05e221SChao Yu } 377ef05e221SChao Yu 378ef05e221SChao Yu static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, 379ef05e221SChao Yu struct extent_tree *et, struct extent_info *ei, 380ef05e221SChao Yu struct rb_node **insert_p, 381ef05e221SChao Yu struct rb_node *insert_parent) 382ef05e221SChao Yu { 383ef05e221SChao Yu struct rb_node **p = &et->root.rb_node; 384ef05e221SChao Yu struct rb_node *parent = NULL; 385ef05e221SChao Yu struct extent_node *en = NULL; 3860f825ee6SFan Li 3870f825ee6SFan Li if (insert_p && insert_parent) { 3880f825ee6SFan Li parent = insert_parent; 3890f825ee6SFan Li p = insert_p; 3900f825ee6SFan Li goto do_insert; 3910f825ee6SFan Li } 3920f825ee6SFan Li 3930f825ee6SFan Li while (*p) { 3940f825ee6SFan Li parent = *p; 3950f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3960f825ee6SFan Li 3970f825ee6SFan Li if (ei->fofs < en->ei.fofs) 3980f825ee6SFan Li p = &(*p)->rb_left; 3990f825ee6SFan Li else if (ei->fofs >= en->ei.fofs + en->ei.len) 4000f825ee6SFan Li p = &(*p)->rb_right; 4010f825ee6SFan Li else 4020f825ee6SFan Li f2fs_bug_on(sbi, 1); 4030f825ee6SFan Li } 4040f825ee6SFan Li do_insert: 4050f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 4060f825ee6SFan Li if (!en) 4070f825ee6SFan Li return NULL; 408ef05e221SChao Yu 4094abd3f5aSChao Yu __try_update_largest_extent(et, en); 41043a2fa18SJaegeuk Kim 41143a2fa18SJaegeuk Kim /* update in global extent list */ 41243a2fa18SJaegeuk Kim spin_lock(&sbi->extent_lock); 41343a2fa18SJaegeuk Kim list_add_tail(&en->list, &sbi->extent_list); 414*42926744SJaegeuk Kim et->cached_en = en; 41543a2fa18SJaegeuk Kim spin_unlock(&sbi->extent_lock); 4160f825ee6SFan Li return en; 4170f825ee6SFan Li } 4180f825ee6SFan Li 419514053e4SJaegeuk Kim static unsigned int f2fs_update_extent_tree_range(struct inode *inode, 42019b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 421a28ef1f5SChao Yu { 422a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 423a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 4244d1fa815SFan Li struct extent_node *en = NULL, *en1 = NULL; 42519b2c30dSChao Yu struct extent_node *prev_en = NULL, *next_en = NULL; 426a28ef1f5SChao Yu struct extent_info ei, dei, prev; 4270f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 42819b2c30dSChao Yu unsigned int end = fofs + len; 42919b2c30dSChao Yu unsigned int pos = (unsigned int)fofs; 430a28ef1f5SChao Yu 431a28ef1f5SChao Yu if (!et) 432a28ef1f5SChao Yu return false; 433a28ef1f5SChao Yu 434744288c7SChao Yu trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len); 435744288c7SChao Yu 436a28ef1f5SChao Yu write_lock(&et->lock); 437a28ef1f5SChao Yu 438a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { 439a28ef1f5SChao Yu write_unlock(&et->lock); 440a28ef1f5SChao Yu return false; 441a28ef1f5SChao Yu } 442a28ef1f5SChao Yu 443a28ef1f5SChao Yu prev = et->largest; 444a28ef1f5SChao Yu dei.len = 0; 445a28ef1f5SChao Yu 4464d1fa815SFan Li /* 4474d1fa815SFan Li * drop largest extent before lookup, in case it's already 4484d1fa815SFan Li * been shrunk from extent tree 4494d1fa815SFan Li */ 45041a099deSFan Li __drop_largest_extent(inode, fofs, len); 451a28ef1f5SChao Yu 45219b2c30dSChao Yu /* 1. lookup first extent node in range [fofs, fofs + len - 1] */ 45319b2c30dSChao Yu en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en, 4540f825ee6SFan Li &insert_p, &insert_parent); 4554d1fa815SFan Li if (!en) 45619b2c30dSChao Yu en = next_en; 45719b2c30dSChao Yu 45819b2c30dSChao Yu /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */ 4594d1fa815SFan Li while (en && en->ei.fofs < end) { 4604d1fa815SFan Li unsigned int org_end; 4614d1fa815SFan Li int parts = 0; /* # of parts current extent split into */ 46219b2c30dSChao Yu 4634d1fa815SFan Li next_en = en1 = NULL; 464a28ef1f5SChao Yu 465a28ef1f5SChao Yu dei = en->ei; 4664d1fa815SFan Li org_end = dei.fofs + dei.len; 4674d1fa815SFan Li f2fs_bug_on(sbi, pos >= org_end); 46819b2c30dSChao Yu 4694d1fa815SFan Li if (pos > dei.fofs && pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 4704d1fa815SFan Li en->ei.len = pos - en->ei.fofs; 4714d1fa815SFan Li prev_en = en; 4724d1fa815SFan Li parts = 1; 47319b2c30dSChao Yu } 47419b2c30dSChao Yu 4754d1fa815SFan Li if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) { 4764d1fa815SFan Li if (parts) { 4774d1fa815SFan Li set_extent_info(&ei, end, 4784d1fa815SFan Li end - dei.fofs + dei.blk, 4794d1fa815SFan Li org_end - end); 4804d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 4814d1fa815SFan Li NULL, NULL); 4824d1fa815SFan Li next_en = en1; 4834d1fa815SFan Li } else { 48419b2c30dSChao Yu en->ei.fofs = end; 48519b2c30dSChao Yu en->ei.blk += end - dei.fofs; 48619b2c30dSChao Yu en->ei.len -= end - dei.fofs; 4874d1fa815SFan Li next_en = en; 4884d1fa815SFan Li } 4894d1fa815SFan Li parts++; 49019b2c30dSChao Yu } 49119b2c30dSChao Yu 4924d1fa815SFan Li if (!next_en) { 4934d1fa815SFan Li struct rb_node *node = rb_next(&en->rb_node); 4944d1fa815SFan Li 4954d1fa815SFan Li next_en = node ? 4964d1fa815SFan Li rb_entry(node, struct extent_node, rb_node) 4974d1fa815SFan Li : NULL; 4984d1fa815SFan Li } 4994d1fa815SFan Li 5004abd3f5aSChao Yu if (parts) 5014abd3f5aSChao Yu __try_update_largest_extent(et, en); 5024abd3f5aSChao Yu else 503a03f01f2SHou Pengyang __release_extent_node(sbi, et, en); 50419b2c30dSChao Yu 50519b2c30dSChao Yu /* 5064d1fa815SFan Li * if original extent is split into zero or two parts, extent 5074d1fa815SFan Li * tree has been altered by deletion or insertion, therefore 5084d1fa815SFan Li * invalidate pointers regard to tree. 50919b2c30dSChao Yu */ 5104d1fa815SFan Li if (parts != 1) { 51119b2c30dSChao Yu insert_p = NULL; 51219b2c30dSChao Yu insert_parent = NULL; 51319b2c30dSChao Yu } 5144d1fa815SFan Li en = next_en; 51519b2c30dSChao Yu } 516a28ef1f5SChao Yu 517a28ef1f5SChao Yu /* 3. update extent in extent cache */ 518a28ef1f5SChao Yu if (blkaddr) { 51919b2c30dSChao Yu 52019b2c30dSChao Yu set_extent_info(&ei, fofs, blkaddr, len); 52143a2fa18SJaegeuk Kim if (!__try_merge_extent_node(sbi, et, &ei, prev_en, next_en)) 52243a2fa18SJaegeuk Kim __insert_extent_tree(sbi, et, &ei, 523ef05e221SChao Yu insert_p, insert_parent); 524a28ef1f5SChao Yu 525a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 526a28ef1f5SChao Yu if (dei.len >= 1 && 527a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 528a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 529a28ef1f5SChao Yu et->largest.len = 0; 530a28ef1f5SChao Yu set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); 531a28ef1f5SChao Yu } 53219b2c30dSChao Yu } 533a28ef1f5SChao Yu 534a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) 535a28ef1f5SChao Yu __free_extent_tree(sbi, et, true); 536a28ef1f5SChao Yu 537a28ef1f5SChao Yu write_unlock(&et->lock); 538a28ef1f5SChao Yu 539a28ef1f5SChao Yu return !__is_extent_same(&prev, &et->largest); 540a28ef1f5SChao Yu } 541a28ef1f5SChao Yu 542a28ef1f5SChao Yu unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) 543a28ef1f5SChao Yu { 544a28ef1f5SChao Yu struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; 545137d09f0SJaegeuk Kim struct extent_tree *et, *next; 546a28ef1f5SChao Yu struct extent_node *en, *tmp; 547a28ef1f5SChao Yu unsigned long ino = F2FS_ROOT_INO(sbi); 548a28ef1f5SChao Yu unsigned int found; 549a28ef1f5SChao Yu unsigned int node_cnt = 0, tree_cnt = 0; 550a28ef1f5SChao Yu int remained; 55174fd8d99SJaegeuk Kim bool do_free = false; 552a28ef1f5SChao Yu 553a28ef1f5SChao Yu if (!test_opt(sbi, EXTENT_CACHE)) 554a28ef1f5SChao Yu return 0; 555a28ef1f5SChao Yu 55674fd8d99SJaegeuk Kim if (!atomic_read(&sbi->total_zombie_tree)) 55774fd8d99SJaegeuk Kim goto free_node; 55874fd8d99SJaegeuk Kim 559a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 560a28ef1f5SChao Yu goto out; 561a28ef1f5SChao Yu 562a28ef1f5SChao Yu /* 1. remove unreferenced extent tree */ 563137d09f0SJaegeuk Kim list_for_each_entry_safe(et, next, &sbi->zombie_list, list) { 5649b72a388SChao Yu if (atomic_read(&et->node_cnt)) { 565a28ef1f5SChao Yu write_lock(&et->lock); 566a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, true); 567a28ef1f5SChao Yu write_unlock(&et->lock); 5689b72a388SChao Yu } 569a28ef1f5SChao Yu 570137d09f0SJaegeuk Kim list_del_init(&et->list); 571137d09f0SJaegeuk Kim radix_tree_delete(&sbi->extent_tree_root, et->ino); 572a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 5737441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 57474fd8d99SJaegeuk Kim atomic_dec(&sbi->total_zombie_tree); 575a28ef1f5SChao Yu tree_cnt++; 576a28ef1f5SChao Yu 577a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 578a28ef1f5SChao Yu goto unlock_out; 579a28ef1f5SChao Yu } 580a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 581a28ef1f5SChao Yu 58274fd8d99SJaegeuk Kim free_node: 583a28ef1f5SChao Yu /* 2. remove LRU extent entries */ 584a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 585a28ef1f5SChao Yu goto out; 586a28ef1f5SChao Yu 587a28ef1f5SChao Yu remained = nr_shrink - (node_cnt + tree_cnt); 588a28ef1f5SChao Yu 589a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 590a28ef1f5SChao Yu list_for_each_entry_safe(en, tmp, &sbi->extent_list, list) { 591a28ef1f5SChao Yu if (!remained--) 592a28ef1f5SChao Yu break; 593a28ef1f5SChao Yu list_del_init(&en->list); 59474fd8d99SJaegeuk Kim do_free = true; 595a28ef1f5SChao Yu } 596a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 597a28ef1f5SChao Yu 59874fd8d99SJaegeuk Kim if (do_free == false) 59974fd8d99SJaegeuk Kim goto unlock_out; 60074fd8d99SJaegeuk Kim 601100136acSChao Yu /* 602100136acSChao Yu * reset ino for searching victims from beginning of global extent tree. 603100136acSChao Yu */ 604100136acSChao Yu ino = F2FS_ROOT_INO(sbi); 605100136acSChao Yu 606137d09f0SJaegeuk Kim while ((found = radix_tree_gang_lookup(&sbi->extent_tree_root, 607a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 608a28ef1f5SChao Yu unsigned i; 609a28ef1f5SChao Yu 610a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 611a28ef1f5SChao Yu for (i = 0; i < found; i++) { 612a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 613a28ef1f5SChao Yu 6149b72a388SChao Yu if (!atomic_read(&et->node_cnt)) 6159b72a388SChao Yu continue; 6169b72a388SChao Yu 617760de791SJaegeuk Kim if (write_trylock(&et->lock)) { 618a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, false); 619a28ef1f5SChao Yu write_unlock(&et->lock); 620760de791SJaegeuk Kim } 621a28ef1f5SChao Yu 622a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 623beaa57ddSChao Yu goto unlock_out; 624a28ef1f5SChao Yu } 625a28ef1f5SChao Yu } 626a28ef1f5SChao Yu unlock_out: 627a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 628a28ef1f5SChao Yu out: 629a28ef1f5SChao Yu trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); 630a28ef1f5SChao Yu 631a28ef1f5SChao Yu return node_cnt + tree_cnt; 632a28ef1f5SChao Yu } 633a28ef1f5SChao Yu 634a28ef1f5SChao Yu unsigned int f2fs_destroy_extent_node(struct inode *inode) 635a28ef1f5SChao Yu { 636a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 637a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 638a28ef1f5SChao Yu unsigned int node_cnt = 0; 639a28ef1f5SChao Yu 6409b72a388SChao Yu if (!et || !atomic_read(&et->node_cnt)) 641a28ef1f5SChao Yu return 0; 642a28ef1f5SChao Yu 643a28ef1f5SChao Yu write_lock(&et->lock); 644a28ef1f5SChao Yu node_cnt = __free_extent_tree(sbi, et, true); 645a28ef1f5SChao Yu write_unlock(&et->lock); 646a28ef1f5SChao Yu 647a28ef1f5SChao Yu return node_cnt; 648a28ef1f5SChao Yu } 649a28ef1f5SChao Yu 650a28ef1f5SChao Yu void f2fs_destroy_extent_tree(struct inode *inode) 651a28ef1f5SChao Yu { 652a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 653a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 654a28ef1f5SChao Yu unsigned int node_cnt = 0; 655a28ef1f5SChao Yu 656a28ef1f5SChao Yu if (!et) 657a28ef1f5SChao Yu return; 658a28ef1f5SChao Yu 65968e35385SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && 66068e35385SChao Yu atomic_read(&et->node_cnt)) { 661137d09f0SJaegeuk Kim down_write(&sbi->extent_tree_lock); 662137d09f0SJaegeuk Kim list_add_tail(&et->list, &sbi->zombie_list); 66374fd8d99SJaegeuk Kim atomic_inc(&sbi->total_zombie_tree); 664137d09f0SJaegeuk Kim up_write(&sbi->extent_tree_lock); 665a28ef1f5SChao Yu return; 666a28ef1f5SChao Yu } 667a28ef1f5SChao Yu 668a28ef1f5SChao Yu /* free all extent info belong to this extent tree */ 669a28ef1f5SChao Yu node_cnt = f2fs_destroy_extent_node(inode); 670a28ef1f5SChao Yu 671a28ef1f5SChao Yu /* delete extent tree entry in radix tree */ 672a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 67368e35385SChao Yu f2fs_bug_on(sbi, atomic_read(&et->node_cnt)); 674a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 675a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 6767441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 677a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 678a28ef1f5SChao Yu 679a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 680a28ef1f5SChao Yu 681a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 682a28ef1f5SChao Yu } 683a28ef1f5SChao Yu 684a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 685a28ef1f5SChao Yu struct extent_info *ei) 686a28ef1f5SChao Yu { 687a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 688a28ef1f5SChao Yu return false; 689a28ef1f5SChao Yu 690a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 691a28ef1f5SChao Yu } 692a28ef1f5SChao Yu 693a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 694a28ef1f5SChao Yu { 695a28ef1f5SChao Yu struct f2fs_inode_info *fi = F2FS_I(dn->inode); 696a28ef1f5SChao Yu pgoff_t fofs; 697a28ef1f5SChao Yu 698a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 699a28ef1f5SChao Yu return; 700a28ef1f5SChao Yu 701a28ef1f5SChao Yu f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); 702a28ef1f5SChao Yu 70319b2c30dSChao Yu 704a28ef1f5SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + 705a28ef1f5SChao Yu dn->ofs_in_node; 706a28ef1f5SChao Yu 70719b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, dn->data_blkaddr, 1)) 70819b2c30dSChao Yu sync_inode_page(dn); 70919b2c30dSChao Yu } 71019b2c30dSChao Yu 71119b2c30dSChao Yu void f2fs_update_extent_cache_range(struct dnode_of_data *dn, 71219b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 71319b2c30dSChao Yu 71419b2c30dSChao Yu { 71519b2c30dSChao Yu if (!f2fs_may_extent_tree(dn->inode)) 71619b2c30dSChao Yu return; 71719b2c30dSChao Yu 71819b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len)) 719a28ef1f5SChao Yu sync_inode_page(dn); 720a28ef1f5SChao Yu } 721a28ef1f5SChao Yu 722a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 723a28ef1f5SChao Yu { 724a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 725a28ef1f5SChao Yu init_rwsem(&sbi->extent_tree_lock); 726a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 727a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 7287441ccefSJaegeuk Kim atomic_set(&sbi->total_ext_tree, 0); 729137d09f0SJaegeuk Kim INIT_LIST_HEAD(&sbi->zombie_list); 73074fd8d99SJaegeuk Kim atomic_set(&sbi->total_zombie_tree, 0); 731a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 732a28ef1f5SChao Yu } 733a28ef1f5SChao Yu 734a28ef1f5SChao Yu int __init create_extent_cache(void) 735a28ef1f5SChao Yu { 736a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 737a28ef1f5SChao Yu sizeof(struct extent_tree)); 738a28ef1f5SChao Yu if (!extent_tree_slab) 739a28ef1f5SChao Yu return -ENOMEM; 740a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 741a28ef1f5SChao Yu sizeof(struct extent_node)); 742a28ef1f5SChao Yu if (!extent_node_slab) { 743a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 744a28ef1f5SChao Yu return -ENOMEM; 745a28ef1f5SChao Yu } 746a28ef1f5SChao Yu return 0; 747a28ef1f5SChao Yu } 748a28ef1f5SChao Yu 749a28ef1f5SChao Yu void destroy_extent_cache(void) 750a28ef1f5SChao Yu { 751a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 752a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 753a28ef1f5SChao Yu } 754