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); 39a28ef1f5SChao Yu et->count++; 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); 48a28ef1f5SChao Yu et->count--; 49a28ef1f5SChao Yu atomic_dec(&sbi->total_ext_node); 50a28ef1f5SChao Yu 51a28ef1f5SChao Yu if (et->cached_en == en) 52a28ef1f5SChao Yu et->cached_en = NULL; 53a28ef1f5SChao Yu } 54a28ef1f5SChao Yu 55a28ef1f5SChao Yu static struct extent_tree *__grab_extent_tree(struct inode *inode) 56a28ef1f5SChao Yu { 57a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 58a28ef1f5SChao Yu struct extent_tree *et; 59a28ef1f5SChao Yu nid_t ino = inode->i_ino; 60a28ef1f5SChao Yu 61a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 62a28ef1f5SChao Yu et = radix_tree_lookup(&sbi->extent_tree_root, ino); 63a28ef1f5SChao Yu if (!et) { 64a28ef1f5SChao Yu et = f2fs_kmem_cache_alloc(extent_tree_slab, GFP_NOFS); 65a28ef1f5SChao Yu f2fs_radix_tree_insert(&sbi->extent_tree_root, ino, et); 66a28ef1f5SChao Yu memset(et, 0, sizeof(struct extent_tree)); 67a28ef1f5SChao Yu et->ino = ino; 68a28ef1f5SChao Yu et->root = RB_ROOT; 69a28ef1f5SChao Yu et->cached_en = NULL; 70a28ef1f5SChao Yu rwlock_init(&et->lock); 71a28ef1f5SChao Yu atomic_set(&et->refcount, 0); 72a28ef1f5SChao Yu et->count = 0; 73a28ef1f5SChao Yu sbi->total_ext_tree++; 74a28ef1f5SChao Yu } 75a28ef1f5SChao Yu atomic_inc(&et->refcount); 76a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 77a28ef1f5SChao Yu 78a28ef1f5SChao Yu /* never died until evict_inode */ 79a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = et; 80a28ef1f5SChao Yu 81a28ef1f5SChao Yu return et; 82a28ef1f5SChao Yu } 83a28ef1f5SChao Yu 8491c481ffSChao Yu static struct extent_node *__lookup_extent_tree(struct f2fs_sb_info *sbi, 8591c481ffSChao Yu struct extent_tree *et, unsigned int fofs) 86a28ef1f5SChao Yu { 87a28ef1f5SChao Yu struct rb_node *node = et->root.rb_node; 88f8b703daSFan Li struct extent_node *en = et->cached_en; 89a28ef1f5SChao Yu 90f8b703daSFan Li if (en) { 91f8b703daSFan Li struct extent_info *cei = &en->ei; 92a28ef1f5SChao Yu 9391c481ffSChao Yu if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) { 9491c481ffSChao Yu stat_inc_cached_node_hit(sbi); 95f8b703daSFan Li return en; 96a28ef1f5SChao Yu } 9791c481ffSChao Yu } 98a28ef1f5SChao Yu 99a28ef1f5SChao Yu while (node) { 100a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 101a28ef1f5SChao Yu 102029e13ccSChao Yu if (fofs < en->ei.fofs) { 103a28ef1f5SChao Yu node = node->rb_left; 104029e13ccSChao Yu } else if (fofs >= en->ei.fofs + en->ei.len) { 105a28ef1f5SChao Yu node = node->rb_right; 106029e13ccSChao Yu } else { 107029e13ccSChao Yu stat_inc_rbtree_node_hit(sbi); 108a28ef1f5SChao Yu return en; 109a28ef1f5SChao Yu } 110029e13ccSChao Yu } 111a28ef1f5SChao Yu return NULL; 112a28ef1f5SChao Yu } 113a28ef1f5SChao Yu 114a6f78345SChao Yu static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi, 115a6f78345SChao Yu struct extent_tree *et, struct extent_info *ei) 116a28ef1f5SChao Yu { 117a28ef1f5SChao Yu struct rb_node **p = &et->root.rb_node; 118a28ef1f5SChao Yu struct extent_node *en; 119a28ef1f5SChao Yu 120a6f78345SChao Yu en = __attach_extent_node(sbi, et, ei, NULL, p); 121a28ef1f5SChao Yu if (!en) 122a28ef1f5SChao Yu return NULL; 123a6f78345SChao Yu 124a28ef1f5SChao Yu et->largest = en->ei; 125a28ef1f5SChao Yu et->cached_en = en; 126a28ef1f5SChao Yu return en; 127a28ef1f5SChao Yu } 128a28ef1f5SChao Yu 129a28ef1f5SChao Yu static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi, 130a28ef1f5SChao Yu struct extent_tree *et, bool free_all) 131a28ef1f5SChao Yu { 132a28ef1f5SChao Yu struct rb_node *node, *next; 133a28ef1f5SChao Yu struct extent_node *en; 134a28ef1f5SChao Yu unsigned int count = et->count; 135a28ef1f5SChao Yu 136a28ef1f5SChao Yu node = rb_first(&et->root); 137a28ef1f5SChao Yu while (node) { 138a28ef1f5SChao Yu next = rb_next(node); 139a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 140a28ef1f5SChao Yu 141a28ef1f5SChao Yu if (free_all) { 142a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 143a28ef1f5SChao Yu if (!list_empty(&en->list)) 144a28ef1f5SChao Yu list_del_init(&en->list); 145a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 146a28ef1f5SChao Yu } 147a28ef1f5SChao Yu 148a28ef1f5SChao Yu if (free_all || list_empty(&en->list)) { 149a28ef1f5SChao Yu __detach_extent_node(sbi, et, en); 150a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, en); 151a28ef1f5SChao Yu } 152a28ef1f5SChao Yu node = next; 153a28ef1f5SChao Yu } 154a28ef1f5SChao Yu 155a28ef1f5SChao Yu return count - et->count; 156a28ef1f5SChao Yu } 157a28ef1f5SChao Yu 15841a099deSFan Li static void __drop_largest_extent(struct inode *inode, 15941a099deSFan Li pgoff_t fofs, unsigned int len) 160a28ef1f5SChao Yu { 161a28ef1f5SChao Yu struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; 162a28ef1f5SChao Yu 16341a099deSFan Li if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs) 164a28ef1f5SChao Yu largest->len = 0; 165a28ef1f5SChao Yu } 166a28ef1f5SChao Yu 16754d71856SChao Yu void f2fs_drop_largest_extent(struct inode *inode, pgoff_t fofs) 16854d71856SChao Yu { 16954d71856SChao Yu if (!f2fs_may_extent_tree(inode)) 17054d71856SChao Yu return; 17154d71856SChao Yu 17241a099deSFan Li __drop_largest_extent(inode, fofs, 1); 17354d71856SChao Yu } 17454d71856SChao Yu 175a28ef1f5SChao Yu void f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 176a28ef1f5SChao Yu { 177a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 178a28ef1f5SChao Yu struct extent_tree *et; 179a28ef1f5SChao Yu struct extent_node *en; 180a28ef1f5SChao Yu struct extent_info ei; 181a28ef1f5SChao Yu 182a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 183a28ef1f5SChao Yu return; 184a28ef1f5SChao Yu 185a28ef1f5SChao Yu et = __grab_extent_tree(inode); 186a28ef1f5SChao Yu 187a28ef1f5SChao Yu if (!i_ext || le32_to_cpu(i_ext->len) < F2FS_MIN_EXTENT_LEN) 188a28ef1f5SChao Yu return; 189a28ef1f5SChao Yu 190a28ef1f5SChao Yu set_extent_info(&ei, le32_to_cpu(i_ext->fofs), 191a28ef1f5SChao Yu le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); 192a28ef1f5SChao Yu 193a28ef1f5SChao Yu write_lock(&et->lock); 194a28ef1f5SChao Yu if (et->count) 195a28ef1f5SChao Yu goto out; 196a28ef1f5SChao Yu 197a6f78345SChao Yu en = __init_extent_tree(sbi, et, &ei); 198a28ef1f5SChao Yu if (en) { 199a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 200a28ef1f5SChao Yu list_add_tail(&en->list, &sbi->extent_list); 201a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 202a28ef1f5SChao Yu } 203a28ef1f5SChao Yu out: 204a28ef1f5SChao Yu write_unlock(&et->lock); 205a28ef1f5SChao Yu } 206a28ef1f5SChao Yu 207a28ef1f5SChao Yu static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, 208a28ef1f5SChao Yu struct extent_info *ei) 209a28ef1f5SChao Yu { 210a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 211a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 212a28ef1f5SChao Yu struct extent_node *en; 213a28ef1f5SChao Yu bool ret = false; 214a28ef1f5SChao Yu 215a28ef1f5SChao Yu f2fs_bug_on(sbi, !et); 216a28ef1f5SChao Yu 217a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_start(inode, pgofs); 218a28ef1f5SChao Yu 219a28ef1f5SChao Yu read_lock(&et->lock); 220a28ef1f5SChao Yu 221a28ef1f5SChao Yu if (et->largest.fofs <= pgofs && 222a28ef1f5SChao Yu et->largest.fofs + et->largest.len > pgofs) { 223a28ef1f5SChao Yu *ei = et->largest; 224a28ef1f5SChao Yu ret = true; 22591c481ffSChao Yu stat_inc_largest_node_hit(sbi); 226a28ef1f5SChao Yu goto out; 227a28ef1f5SChao Yu } 228a28ef1f5SChao Yu 22991c481ffSChao Yu en = __lookup_extent_tree(sbi, et, pgofs); 230a28ef1f5SChao Yu if (en) { 231a28ef1f5SChao Yu *ei = en->ei; 232a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 233a28ef1f5SChao Yu if (!list_empty(&en->list)) 234a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 235a28ef1f5SChao Yu et->cached_en = en; 236a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 237a28ef1f5SChao Yu ret = true; 238a28ef1f5SChao Yu } 239a28ef1f5SChao Yu out: 240727edac5SChao Yu stat_inc_total_hit(sbi); 241a28ef1f5SChao Yu read_unlock(&et->lock); 242a28ef1f5SChao Yu 243a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 244a28ef1f5SChao Yu return ret; 245a28ef1f5SChao Yu } 246a28ef1f5SChao Yu 2470f825ee6SFan Li 2480f825ee6SFan Li /* 2490f825ee6SFan Li * lookup extent at @fofs, if hit, return the extent 2500f825ee6SFan Li * if not, return NULL and 2510f825ee6SFan Li * @prev_ex: extent before fofs 2520f825ee6SFan Li * @next_ex: extent after fofs 2530f825ee6SFan Li * @insert_p: insert point for new extent at fofs 2540f825ee6SFan Li * in order to simpfy the insertion after. 2550f825ee6SFan Li * tree must stay unchanged between lookup and insertion. 2560f825ee6SFan Li */ 2570f825ee6SFan Li static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, 25891c481ffSChao Yu unsigned int fofs, 25991c481ffSChao Yu struct extent_node **prev_ex, 2600f825ee6SFan Li struct extent_node **next_ex, 2610f825ee6SFan Li struct rb_node ***insert_p, 2620f825ee6SFan Li struct rb_node **insert_parent) 2630f825ee6SFan Li { 2640f825ee6SFan Li struct rb_node **pnode = &et->root.rb_node; 2650f825ee6SFan Li struct rb_node *parent = NULL, *tmp_node; 266dac2ddefSChao Yu struct extent_node *en = et->cached_en; 2670f825ee6SFan Li 268dac2ddefSChao Yu *insert_p = NULL; 269dac2ddefSChao Yu *insert_parent = NULL; 270dac2ddefSChao Yu *prev_ex = NULL; 271dac2ddefSChao Yu *next_ex = NULL; 272dac2ddefSChao Yu 273dac2ddefSChao Yu if (RB_EMPTY_ROOT(&et->root)) 274dac2ddefSChao Yu return NULL; 275dac2ddefSChao Yu 276dac2ddefSChao Yu if (en) { 277dac2ddefSChao Yu struct extent_info *cei = &en->ei; 2780f825ee6SFan Li 2790f825ee6SFan Li if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) 280dac2ddefSChao Yu goto lookup_neighbors; 2810f825ee6SFan Li } 2820f825ee6SFan Li 2830f825ee6SFan Li while (*pnode) { 2840f825ee6SFan Li parent = *pnode; 2850f825ee6SFan Li en = rb_entry(*pnode, struct extent_node, rb_node); 2860f825ee6SFan Li 2870f825ee6SFan Li if (fofs < en->ei.fofs) 2880f825ee6SFan Li pnode = &(*pnode)->rb_left; 2890f825ee6SFan Li else if (fofs >= en->ei.fofs + en->ei.len) 2900f825ee6SFan Li pnode = &(*pnode)->rb_right; 2910f825ee6SFan Li else 292dac2ddefSChao Yu goto lookup_neighbors; 2930f825ee6SFan Li } 2940f825ee6SFan Li 2950f825ee6SFan Li *insert_p = pnode; 2960f825ee6SFan Li *insert_parent = parent; 2970f825ee6SFan Li 2980f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 2990f825ee6SFan Li tmp_node = parent; 3000f825ee6SFan Li if (parent && fofs > en->ei.fofs) 3010f825ee6SFan Li tmp_node = rb_next(parent); 3020f825ee6SFan Li *next_ex = tmp_node ? 3030f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3040f825ee6SFan Li 3050f825ee6SFan Li tmp_node = parent; 3060f825ee6SFan Li if (parent && fofs < en->ei.fofs) 3070f825ee6SFan Li tmp_node = rb_prev(parent); 3080f825ee6SFan Li *prev_ex = tmp_node ? 3090f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3100f825ee6SFan Li return NULL; 311dac2ddefSChao Yu 312dac2ddefSChao Yu lookup_neighbors: 313dac2ddefSChao Yu if (fofs == en->ei.fofs) { 314dac2ddefSChao Yu /* lookup prev node for merging backward later */ 315dac2ddefSChao Yu tmp_node = rb_prev(&en->rb_node); 316dac2ddefSChao Yu *prev_ex = tmp_node ? 317dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 318dac2ddefSChao Yu } 319dac2ddefSChao Yu if (fofs == en->ei.fofs + en->ei.len - 1) { 320dac2ddefSChao Yu /* lookup next node for merging frontward later */ 321dac2ddefSChao Yu tmp_node = rb_next(&en->rb_node); 322dac2ddefSChao Yu *next_ex = tmp_node ? 323dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 324dac2ddefSChao Yu } 325dac2ddefSChao Yu return en; 3260f825ee6SFan Li } 3270f825ee6SFan Li 328ef05e221SChao Yu static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi, 3290f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 3300f825ee6SFan Li struct extent_node **den, 3310f825ee6SFan Li struct extent_node *prev_ex, 332ef05e221SChao Yu struct extent_node *next_ex) 3330f825ee6SFan Li { 3340f825ee6SFan Li struct extent_node *en = NULL; 3350f825ee6SFan Li 3360f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 3370f825ee6SFan Li prev_ex->ei.len += ei->len; 3380f825ee6SFan Li ei = &prev_ex->ei; 3390f825ee6SFan Li en = prev_ex; 3400f825ee6SFan Li } 341ef05e221SChao Yu 3420f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 343ef05e221SChao Yu if (en) { 3440f825ee6SFan Li __detach_extent_node(sbi, et, prev_ex); 3450f825ee6SFan Li *den = prev_ex; 3460f825ee6SFan Li } 3470f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 3480f825ee6SFan Li next_ex->ei.blk = ei->blk; 3490f825ee6SFan Li next_ex->ei.len += ei->len; 3500f825ee6SFan Li en = next_ex; 3510f825ee6SFan Li } 352ef05e221SChao Yu 353ef05e221SChao Yu if (en) { 354ef05e221SChao Yu if (en->ei.len > et->largest.len) 355ef05e221SChao Yu et->largest = en->ei; 356ef05e221SChao Yu et->cached_en = en; 357ef05e221SChao Yu } 358ef05e221SChao Yu return en; 359ef05e221SChao Yu } 360ef05e221SChao Yu 361ef05e221SChao Yu static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, 362ef05e221SChao Yu struct extent_tree *et, struct extent_info *ei, 363ef05e221SChao Yu struct rb_node **insert_p, 364ef05e221SChao Yu struct rb_node *insert_parent) 365ef05e221SChao Yu { 366ef05e221SChao Yu struct rb_node **p = &et->root.rb_node; 367ef05e221SChao Yu struct rb_node *parent = NULL; 368ef05e221SChao Yu struct extent_node *en = NULL; 3690f825ee6SFan Li 3700f825ee6SFan Li if (insert_p && insert_parent) { 3710f825ee6SFan Li parent = insert_parent; 3720f825ee6SFan Li p = insert_p; 3730f825ee6SFan Li goto do_insert; 3740f825ee6SFan Li } 3750f825ee6SFan Li 3760f825ee6SFan Li while (*p) { 3770f825ee6SFan Li parent = *p; 3780f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3790f825ee6SFan Li 3800f825ee6SFan Li if (ei->fofs < en->ei.fofs) 3810f825ee6SFan Li p = &(*p)->rb_left; 3820f825ee6SFan Li else if (ei->fofs >= en->ei.fofs + en->ei.len) 3830f825ee6SFan Li p = &(*p)->rb_right; 3840f825ee6SFan Li else 3850f825ee6SFan Li f2fs_bug_on(sbi, 1); 3860f825ee6SFan Li } 3870f825ee6SFan Li do_insert: 3880f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 3890f825ee6SFan Li if (!en) 3900f825ee6SFan Li return NULL; 391ef05e221SChao Yu 3920f825ee6SFan Li if (en->ei.len > et->largest.len) 3930f825ee6SFan Li et->largest = en->ei; 3940f825ee6SFan Li et->cached_en = en; 3950f825ee6SFan Li return en; 3960f825ee6SFan Li } 3970f825ee6SFan Li 398514053e4SJaegeuk Kim static unsigned int f2fs_update_extent_tree_range(struct inode *inode, 39919b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 400a28ef1f5SChao Yu { 401a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 402a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 403*4d1fa815SFan Li struct extent_node *en = NULL, *en1 = NULL; 40419b2c30dSChao Yu struct extent_node *prev_en = NULL, *next_en = NULL; 405a28ef1f5SChao Yu struct extent_info ei, dei, prev; 4060f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 40719b2c30dSChao Yu unsigned int end = fofs + len; 40819b2c30dSChao Yu unsigned int pos = (unsigned int)fofs; 409a28ef1f5SChao Yu 410a28ef1f5SChao Yu if (!et) 411a28ef1f5SChao Yu return false; 412a28ef1f5SChao Yu 413744288c7SChao Yu trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len); 414744288c7SChao Yu 415a28ef1f5SChao Yu write_lock(&et->lock); 416a28ef1f5SChao Yu 417a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { 418a28ef1f5SChao Yu write_unlock(&et->lock); 419a28ef1f5SChao Yu return false; 420a28ef1f5SChao Yu } 421a28ef1f5SChao Yu 422a28ef1f5SChao Yu prev = et->largest; 423a28ef1f5SChao Yu dei.len = 0; 424a28ef1f5SChao Yu 425*4d1fa815SFan Li /* 426*4d1fa815SFan Li * drop largest extent before lookup, in case it's already 427*4d1fa815SFan Li * been shrunk from extent tree 428*4d1fa815SFan Li */ 42941a099deSFan Li __drop_largest_extent(inode, fofs, len); 430a28ef1f5SChao Yu 43119b2c30dSChao Yu /* 1. lookup first extent node in range [fofs, fofs + len - 1] */ 43219b2c30dSChao Yu en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en, 4330f825ee6SFan Li &insert_p, &insert_parent); 434*4d1fa815SFan Li if (!en) 43519b2c30dSChao Yu en = next_en; 43619b2c30dSChao Yu 43719b2c30dSChao Yu /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */ 438*4d1fa815SFan Li while (en && en->ei.fofs < end) { 439*4d1fa815SFan Li unsigned int org_end; 440*4d1fa815SFan Li int parts = 0; /* # of parts current extent split into */ 44119b2c30dSChao Yu 442*4d1fa815SFan Li next_en = en1 = NULL; 443a28ef1f5SChao Yu 444a28ef1f5SChao Yu dei = en->ei; 445*4d1fa815SFan Li org_end = dei.fofs + dei.len; 446*4d1fa815SFan Li f2fs_bug_on(sbi, pos >= org_end); 44719b2c30dSChao Yu 448*4d1fa815SFan Li if (pos > dei.fofs && pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 449*4d1fa815SFan Li en->ei.len = pos - en->ei.fofs; 450*4d1fa815SFan Li prev_en = en; 451*4d1fa815SFan Li parts = 1; 45219b2c30dSChao Yu } 45319b2c30dSChao Yu 454*4d1fa815SFan Li if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) { 455*4d1fa815SFan Li if (parts) { 456*4d1fa815SFan Li set_extent_info(&ei, end, 457*4d1fa815SFan Li end - dei.fofs + dei.blk, 458*4d1fa815SFan Li org_end - end); 459*4d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 460*4d1fa815SFan Li NULL, NULL); 461*4d1fa815SFan Li next_en = en1; 462*4d1fa815SFan Li } else { 46319b2c30dSChao Yu en->ei.fofs = end; 46419b2c30dSChao Yu en->ei.blk += end - dei.fofs; 46519b2c30dSChao Yu en->ei.len -= end - dei.fofs; 466*4d1fa815SFan Li next_en = en; 467*4d1fa815SFan Li } 468*4d1fa815SFan Li parts++; 46919b2c30dSChao Yu } 47019b2c30dSChao Yu 471*4d1fa815SFan Li if (!next_en) { 472*4d1fa815SFan Li struct rb_node *node = rb_next(&en->rb_node); 473*4d1fa815SFan Li 474*4d1fa815SFan Li next_en = node ? 475*4d1fa815SFan Li rb_entry(node, struct extent_node, rb_node) 476*4d1fa815SFan Li : NULL; 477*4d1fa815SFan Li } 478*4d1fa815SFan Li 479*4d1fa815SFan Li if (parts) { 480*4d1fa815SFan Li if (en->ei.len > et->largest.len) 48119b2c30dSChao Yu et->largest = en->ei; 482*4d1fa815SFan Li } else { 483*4d1fa815SFan Li __detach_extent_node(sbi, et, en); 48419b2c30dSChao Yu } 48519b2c30dSChao Yu 48619b2c30dSChao Yu /* 487*4d1fa815SFan Li * if original extent is split into zero or two parts, extent 488*4d1fa815SFan Li * tree has been altered by deletion or insertion, therefore 489*4d1fa815SFan Li * invalidate pointers regard to tree. 49019b2c30dSChao Yu */ 491*4d1fa815SFan Li if (parts != 1) { 49219b2c30dSChao Yu insert_p = NULL; 49319b2c30dSChao Yu insert_parent = NULL; 49419b2c30dSChao Yu } 49519b2c30dSChao Yu 496*4d1fa815SFan Li /* update in global extent list */ 49719b2c30dSChao Yu spin_lock(&sbi->extent_lock); 498*4d1fa815SFan Li if (!parts && !list_empty(&en->list)) 49919b2c30dSChao Yu list_del(&en->list); 50019b2c30dSChao Yu if (en1) 50119b2c30dSChao Yu list_add_tail(&en1->list, &sbi->extent_list); 50219b2c30dSChao Yu spin_unlock(&sbi->extent_lock); 50319b2c30dSChao Yu 504*4d1fa815SFan Li /* release extent node */ 505*4d1fa815SFan Li if (!parts) 50619b2c30dSChao Yu kmem_cache_free(extent_node_slab, en); 507*4d1fa815SFan Li 508*4d1fa815SFan Li en = next_en; 50919b2c30dSChao Yu } 510a28ef1f5SChao Yu 511a28ef1f5SChao Yu /* 3. update extent in extent cache */ 512a28ef1f5SChao Yu if (blkaddr) { 51319b2c30dSChao Yu struct extent_node *den = NULL; 51419b2c30dSChao Yu 51519b2c30dSChao Yu set_extent_info(&ei, fofs, blkaddr, len); 516*4d1fa815SFan Li en1 = __try_merge_extent_node(sbi, et, &ei, &den, 51719b2c30dSChao Yu prev_en, next_en); 518*4d1fa815SFan Li if (!en1) 519*4d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 520ef05e221SChao Yu insert_p, insert_parent); 521a28ef1f5SChao Yu 522a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 523a28ef1f5SChao Yu if (dei.len >= 1 && 524a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 525a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 526a28ef1f5SChao Yu et->largest.len = 0; 527a28ef1f5SChao Yu set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); 528a28ef1f5SChao Yu } 529a28ef1f5SChao Yu 530a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 531*4d1fa815SFan Li if (en1) { 532*4d1fa815SFan Li if (list_empty(&en1->list)) 533*4d1fa815SFan Li list_add_tail(&en1->list, &sbi->extent_list); 534a28ef1f5SChao Yu else 535*4d1fa815SFan Li list_move_tail(&en1->list, &sbi->extent_list); 536a28ef1f5SChao Yu } 537a28ef1f5SChao Yu if (den && !list_empty(&den->list)) 538a28ef1f5SChao Yu list_del(&den->list); 539a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 540a28ef1f5SChao Yu 541a28ef1f5SChao Yu if (den) 542a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, den); 54319b2c30dSChao Yu } 544a28ef1f5SChao Yu 545a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) 546a28ef1f5SChao Yu __free_extent_tree(sbi, et, true); 547a28ef1f5SChao Yu 548a28ef1f5SChao Yu write_unlock(&et->lock); 549a28ef1f5SChao Yu 550a28ef1f5SChao Yu return !__is_extent_same(&prev, &et->largest); 551a28ef1f5SChao Yu } 552a28ef1f5SChao Yu 553a28ef1f5SChao Yu unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) 554a28ef1f5SChao Yu { 555a28ef1f5SChao Yu struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; 556a28ef1f5SChao Yu struct extent_node *en, *tmp; 557a28ef1f5SChao Yu unsigned long ino = F2FS_ROOT_INO(sbi); 558a28ef1f5SChao Yu struct radix_tree_root *root = &sbi->extent_tree_root; 559a28ef1f5SChao Yu unsigned int found; 560a28ef1f5SChao Yu unsigned int node_cnt = 0, tree_cnt = 0; 561a28ef1f5SChao Yu int remained; 562a28ef1f5SChao Yu 563a28ef1f5SChao Yu if (!test_opt(sbi, EXTENT_CACHE)) 564a28ef1f5SChao Yu return 0; 565a28ef1f5SChao Yu 566a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 567a28ef1f5SChao Yu goto out; 568a28ef1f5SChao Yu 569a28ef1f5SChao Yu /* 1. remove unreferenced extent tree */ 570a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 571a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 572a28ef1f5SChao Yu unsigned i; 573a28ef1f5SChao Yu 574a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 575a28ef1f5SChao Yu for (i = 0; i < found; i++) { 576a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 577a28ef1f5SChao Yu 578a28ef1f5SChao Yu if (!atomic_read(&et->refcount)) { 579a28ef1f5SChao Yu write_lock(&et->lock); 580a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, true); 581a28ef1f5SChao Yu write_unlock(&et->lock); 582a28ef1f5SChao Yu 583a28ef1f5SChao Yu radix_tree_delete(root, et->ino); 584a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 585a28ef1f5SChao Yu sbi->total_ext_tree--; 586a28ef1f5SChao Yu tree_cnt++; 587a28ef1f5SChao Yu 588a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 589a28ef1f5SChao Yu goto unlock_out; 590a28ef1f5SChao Yu } 591a28ef1f5SChao Yu } 592a28ef1f5SChao Yu } 593a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 594a28ef1f5SChao Yu 595a28ef1f5SChao Yu /* 2. remove LRU extent entries */ 596a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 597a28ef1f5SChao Yu goto out; 598a28ef1f5SChao Yu 599a28ef1f5SChao Yu remained = nr_shrink - (node_cnt + tree_cnt); 600a28ef1f5SChao Yu 601a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 602a28ef1f5SChao Yu list_for_each_entry_safe(en, tmp, &sbi->extent_list, list) { 603a28ef1f5SChao Yu if (!remained--) 604a28ef1f5SChao Yu break; 605a28ef1f5SChao Yu list_del_init(&en->list); 606a28ef1f5SChao Yu } 607a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 608a28ef1f5SChao Yu 609100136acSChao Yu /* 610100136acSChao Yu * reset ino for searching victims from beginning of global extent tree. 611100136acSChao Yu */ 612100136acSChao Yu ino = F2FS_ROOT_INO(sbi); 613100136acSChao Yu 614a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 615a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 616a28ef1f5SChao Yu unsigned i; 617a28ef1f5SChao Yu 618a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 619a28ef1f5SChao Yu for (i = 0; i < found; i++) { 620a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 621a28ef1f5SChao Yu 622a28ef1f5SChao Yu write_lock(&et->lock); 623a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, false); 624a28ef1f5SChao Yu write_unlock(&et->lock); 625a28ef1f5SChao Yu 626a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 627a28ef1f5SChao Yu break; 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 644a28ef1f5SChao Yu if (!et) 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 663a28ef1f5SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && et->count) { 664a28ef1f5SChao Yu atomic_dec(&et->refcount); 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); 673a28ef1f5SChao Yu atomic_dec(&et->refcount); 674a28ef1f5SChao Yu f2fs_bug_on(sbi, atomic_read(&et->refcount) || et->count); 675a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 676a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 677a28ef1f5SChao Yu sbi->total_ext_tree--; 678a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 679a28ef1f5SChao Yu 680a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 681a28ef1f5SChao Yu 682a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 683a28ef1f5SChao Yu } 684a28ef1f5SChao Yu 685a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 686a28ef1f5SChao Yu struct extent_info *ei) 687a28ef1f5SChao Yu { 688a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 689a28ef1f5SChao Yu return false; 690a28ef1f5SChao Yu 691a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 692a28ef1f5SChao Yu } 693a28ef1f5SChao Yu 694a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 695a28ef1f5SChao Yu { 696a28ef1f5SChao Yu struct f2fs_inode_info *fi = F2FS_I(dn->inode); 697a28ef1f5SChao Yu pgoff_t fofs; 698a28ef1f5SChao Yu 699a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 700a28ef1f5SChao Yu return; 701a28ef1f5SChao Yu 702a28ef1f5SChao Yu f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); 703a28ef1f5SChao Yu 70419b2c30dSChao Yu 705a28ef1f5SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + 706a28ef1f5SChao Yu dn->ofs_in_node; 707a28ef1f5SChao Yu 70819b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, dn->data_blkaddr, 1)) 70919b2c30dSChao Yu sync_inode_page(dn); 71019b2c30dSChao Yu } 71119b2c30dSChao Yu 71219b2c30dSChao Yu void f2fs_update_extent_cache_range(struct dnode_of_data *dn, 71319b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 71419b2c30dSChao Yu 71519b2c30dSChao Yu { 71619b2c30dSChao Yu if (!f2fs_may_extent_tree(dn->inode)) 71719b2c30dSChao Yu return; 71819b2c30dSChao Yu 71919b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len)) 720a28ef1f5SChao Yu sync_inode_page(dn); 721a28ef1f5SChao Yu } 722a28ef1f5SChao Yu 723a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 724a28ef1f5SChao Yu { 725a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 726a28ef1f5SChao Yu init_rwsem(&sbi->extent_tree_lock); 727a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 728a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 729a28ef1f5SChao Yu sbi->total_ext_tree = 0; 730a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 731a28ef1f5SChao Yu } 732a28ef1f5SChao Yu 733a28ef1f5SChao Yu int __init create_extent_cache(void) 734a28ef1f5SChao Yu { 735a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 736a28ef1f5SChao Yu sizeof(struct extent_tree)); 737a28ef1f5SChao Yu if (!extent_tree_slab) 738a28ef1f5SChao Yu return -ENOMEM; 739a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 740a28ef1f5SChao Yu sizeof(struct extent_node)); 741a28ef1f5SChao Yu if (!extent_node_slab) { 742a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 743a28ef1f5SChao Yu return -ENOMEM; 744a28ef1f5SChao Yu } 745a28ef1f5SChao Yu return 0; 746a28ef1f5SChao Yu } 747a28ef1f5SChao Yu 748a28ef1f5SChao Yu void destroy_extent_cache(void) 749a28ef1f5SChao Yu { 750a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 751a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 752a28ef1f5SChao Yu } 753