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; 73*7441ccefSJaegeuk Kim atomic_inc(&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 167a28ef1f5SChao Yu void f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 168a28ef1f5SChao Yu { 169a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 170a28ef1f5SChao Yu struct extent_tree *et; 171a28ef1f5SChao Yu struct extent_node *en; 172a28ef1f5SChao Yu struct extent_info ei; 173a28ef1f5SChao Yu 174a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 175a28ef1f5SChao Yu return; 176a28ef1f5SChao Yu 177a28ef1f5SChao Yu et = __grab_extent_tree(inode); 178a28ef1f5SChao Yu 179a28ef1f5SChao Yu if (!i_ext || le32_to_cpu(i_ext->len) < F2FS_MIN_EXTENT_LEN) 180a28ef1f5SChao Yu return; 181a28ef1f5SChao Yu 182a28ef1f5SChao Yu set_extent_info(&ei, le32_to_cpu(i_ext->fofs), 183a28ef1f5SChao Yu le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); 184a28ef1f5SChao Yu 185a28ef1f5SChao Yu write_lock(&et->lock); 186a28ef1f5SChao Yu if (et->count) 187a28ef1f5SChao Yu goto out; 188a28ef1f5SChao Yu 189a6f78345SChao Yu en = __init_extent_tree(sbi, et, &ei); 190a28ef1f5SChao Yu if (en) { 191a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 192a28ef1f5SChao Yu list_add_tail(&en->list, &sbi->extent_list); 193a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 194a28ef1f5SChao Yu } 195a28ef1f5SChao Yu out: 196a28ef1f5SChao Yu write_unlock(&et->lock); 197a28ef1f5SChao Yu } 198a28ef1f5SChao Yu 199a28ef1f5SChao Yu static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, 200a28ef1f5SChao Yu struct extent_info *ei) 201a28ef1f5SChao Yu { 202a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 203a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 204a28ef1f5SChao Yu struct extent_node *en; 205a28ef1f5SChao Yu bool ret = false; 206a28ef1f5SChao Yu 207a28ef1f5SChao Yu f2fs_bug_on(sbi, !et); 208a28ef1f5SChao Yu 209a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_start(inode, pgofs); 210a28ef1f5SChao Yu 211a28ef1f5SChao Yu read_lock(&et->lock); 212a28ef1f5SChao Yu 213a28ef1f5SChao Yu if (et->largest.fofs <= pgofs && 214a28ef1f5SChao Yu et->largest.fofs + et->largest.len > pgofs) { 215a28ef1f5SChao Yu *ei = et->largest; 216a28ef1f5SChao Yu ret = true; 21791c481ffSChao Yu stat_inc_largest_node_hit(sbi); 218a28ef1f5SChao Yu goto out; 219a28ef1f5SChao Yu } 220a28ef1f5SChao Yu 22191c481ffSChao Yu en = __lookup_extent_tree(sbi, et, pgofs); 222a28ef1f5SChao Yu if (en) { 223a28ef1f5SChao Yu *ei = en->ei; 224a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 225a28ef1f5SChao Yu if (!list_empty(&en->list)) 226a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 227a28ef1f5SChao Yu et->cached_en = en; 228a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 229a28ef1f5SChao Yu ret = true; 230a28ef1f5SChao Yu } 231a28ef1f5SChao Yu out: 232727edac5SChao Yu stat_inc_total_hit(sbi); 233a28ef1f5SChao Yu read_unlock(&et->lock); 234a28ef1f5SChao Yu 235a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 236a28ef1f5SChao Yu return ret; 237a28ef1f5SChao Yu } 238a28ef1f5SChao Yu 2390f825ee6SFan Li 2400f825ee6SFan Li /* 2410f825ee6SFan Li * lookup extent at @fofs, if hit, return the extent 2420f825ee6SFan Li * if not, return NULL and 2430f825ee6SFan Li * @prev_ex: extent before fofs 2440f825ee6SFan Li * @next_ex: extent after fofs 2450f825ee6SFan Li * @insert_p: insert point for new extent at fofs 2460f825ee6SFan Li * in order to simpfy the insertion after. 2470f825ee6SFan Li * tree must stay unchanged between lookup and insertion. 2480f825ee6SFan Li */ 2490f825ee6SFan Li static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, 25091c481ffSChao Yu unsigned int fofs, 25191c481ffSChao Yu struct extent_node **prev_ex, 2520f825ee6SFan Li struct extent_node **next_ex, 2530f825ee6SFan Li struct rb_node ***insert_p, 2540f825ee6SFan Li struct rb_node **insert_parent) 2550f825ee6SFan Li { 2560f825ee6SFan Li struct rb_node **pnode = &et->root.rb_node; 2570f825ee6SFan Li struct rb_node *parent = NULL, *tmp_node; 258dac2ddefSChao Yu struct extent_node *en = et->cached_en; 2590f825ee6SFan Li 260dac2ddefSChao Yu *insert_p = NULL; 261dac2ddefSChao Yu *insert_parent = NULL; 262dac2ddefSChao Yu *prev_ex = NULL; 263dac2ddefSChao Yu *next_ex = NULL; 264dac2ddefSChao Yu 265dac2ddefSChao Yu if (RB_EMPTY_ROOT(&et->root)) 266dac2ddefSChao Yu return NULL; 267dac2ddefSChao Yu 268dac2ddefSChao Yu if (en) { 269dac2ddefSChao Yu struct extent_info *cei = &en->ei; 2700f825ee6SFan Li 2710f825ee6SFan Li if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) 272dac2ddefSChao Yu goto lookup_neighbors; 2730f825ee6SFan Li } 2740f825ee6SFan Li 2750f825ee6SFan Li while (*pnode) { 2760f825ee6SFan Li parent = *pnode; 2770f825ee6SFan Li en = rb_entry(*pnode, struct extent_node, rb_node); 2780f825ee6SFan Li 2790f825ee6SFan Li if (fofs < en->ei.fofs) 2800f825ee6SFan Li pnode = &(*pnode)->rb_left; 2810f825ee6SFan Li else if (fofs >= en->ei.fofs + en->ei.len) 2820f825ee6SFan Li pnode = &(*pnode)->rb_right; 2830f825ee6SFan Li else 284dac2ddefSChao Yu goto lookup_neighbors; 2850f825ee6SFan Li } 2860f825ee6SFan Li 2870f825ee6SFan Li *insert_p = pnode; 2880f825ee6SFan Li *insert_parent = parent; 2890f825ee6SFan Li 2900f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 2910f825ee6SFan Li tmp_node = parent; 2920f825ee6SFan Li if (parent && fofs > en->ei.fofs) 2930f825ee6SFan Li tmp_node = rb_next(parent); 2940f825ee6SFan Li *next_ex = tmp_node ? 2950f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 2960f825ee6SFan Li 2970f825ee6SFan Li tmp_node = parent; 2980f825ee6SFan Li if (parent && fofs < en->ei.fofs) 2990f825ee6SFan Li tmp_node = rb_prev(parent); 3000f825ee6SFan Li *prev_ex = tmp_node ? 3010f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3020f825ee6SFan Li return NULL; 303dac2ddefSChao Yu 304dac2ddefSChao Yu lookup_neighbors: 305dac2ddefSChao Yu if (fofs == en->ei.fofs) { 306dac2ddefSChao Yu /* lookup prev node for merging backward later */ 307dac2ddefSChao Yu tmp_node = rb_prev(&en->rb_node); 308dac2ddefSChao Yu *prev_ex = tmp_node ? 309dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 310dac2ddefSChao Yu } 311dac2ddefSChao Yu if (fofs == en->ei.fofs + en->ei.len - 1) { 312dac2ddefSChao Yu /* lookup next node for merging frontward later */ 313dac2ddefSChao Yu tmp_node = rb_next(&en->rb_node); 314dac2ddefSChao Yu *next_ex = tmp_node ? 315dac2ddefSChao Yu rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 316dac2ddefSChao Yu } 317dac2ddefSChao Yu return en; 3180f825ee6SFan Li } 3190f825ee6SFan Li 320ef05e221SChao Yu static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi, 3210f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 3220f825ee6SFan Li struct extent_node **den, 3230f825ee6SFan Li struct extent_node *prev_ex, 324ef05e221SChao Yu struct extent_node *next_ex) 3250f825ee6SFan Li { 3260f825ee6SFan Li struct extent_node *en = NULL; 3270f825ee6SFan Li 3280f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 3290f825ee6SFan Li prev_ex->ei.len += ei->len; 3300f825ee6SFan Li ei = &prev_ex->ei; 3310f825ee6SFan Li en = prev_ex; 3320f825ee6SFan Li } 333ef05e221SChao Yu 3340f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 335ef05e221SChao Yu if (en) { 3360f825ee6SFan Li __detach_extent_node(sbi, et, prev_ex); 3370f825ee6SFan Li *den = prev_ex; 3380f825ee6SFan Li } 3390f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 3400f825ee6SFan Li next_ex->ei.blk = ei->blk; 3410f825ee6SFan Li next_ex->ei.len += ei->len; 3420f825ee6SFan Li en = next_ex; 3430f825ee6SFan Li } 344ef05e221SChao Yu 345ef05e221SChao Yu if (en) { 3464abd3f5aSChao Yu __try_update_largest_extent(et, en); 347ef05e221SChao Yu et->cached_en = en; 348ef05e221SChao Yu } 349ef05e221SChao Yu return en; 350ef05e221SChao Yu } 351ef05e221SChao Yu 352ef05e221SChao Yu static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, 353ef05e221SChao Yu struct extent_tree *et, struct extent_info *ei, 354ef05e221SChao Yu struct rb_node **insert_p, 355ef05e221SChao Yu struct rb_node *insert_parent) 356ef05e221SChao Yu { 357ef05e221SChao Yu struct rb_node **p = &et->root.rb_node; 358ef05e221SChao Yu struct rb_node *parent = NULL; 359ef05e221SChao Yu struct extent_node *en = NULL; 3600f825ee6SFan Li 3610f825ee6SFan Li if (insert_p && insert_parent) { 3620f825ee6SFan Li parent = insert_parent; 3630f825ee6SFan Li p = insert_p; 3640f825ee6SFan Li goto do_insert; 3650f825ee6SFan Li } 3660f825ee6SFan Li 3670f825ee6SFan Li while (*p) { 3680f825ee6SFan Li parent = *p; 3690f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3700f825ee6SFan Li 3710f825ee6SFan Li if (ei->fofs < en->ei.fofs) 3720f825ee6SFan Li p = &(*p)->rb_left; 3730f825ee6SFan Li else if (ei->fofs >= en->ei.fofs + en->ei.len) 3740f825ee6SFan Li p = &(*p)->rb_right; 3750f825ee6SFan Li else 3760f825ee6SFan Li f2fs_bug_on(sbi, 1); 3770f825ee6SFan Li } 3780f825ee6SFan Li do_insert: 3790f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 3800f825ee6SFan Li if (!en) 3810f825ee6SFan Li return NULL; 382ef05e221SChao Yu 3834abd3f5aSChao Yu __try_update_largest_extent(et, en); 3840f825ee6SFan Li et->cached_en = en; 3850f825ee6SFan Li return en; 3860f825ee6SFan Li } 3870f825ee6SFan Li 388514053e4SJaegeuk Kim static unsigned int f2fs_update_extent_tree_range(struct inode *inode, 38919b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 390a28ef1f5SChao Yu { 391a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 392a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 3934d1fa815SFan Li struct extent_node *en = NULL, *en1 = NULL; 39419b2c30dSChao Yu struct extent_node *prev_en = NULL, *next_en = NULL; 395a28ef1f5SChao Yu struct extent_info ei, dei, prev; 3960f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 39719b2c30dSChao Yu unsigned int end = fofs + len; 39819b2c30dSChao Yu unsigned int pos = (unsigned int)fofs; 399a28ef1f5SChao Yu 400a28ef1f5SChao Yu if (!et) 401a28ef1f5SChao Yu return false; 402a28ef1f5SChao Yu 403744288c7SChao Yu trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len); 404744288c7SChao Yu 405a28ef1f5SChao Yu write_lock(&et->lock); 406a28ef1f5SChao Yu 407a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { 408a28ef1f5SChao Yu write_unlock(&et->lock); 409a28ef1f5SChao Yu return false; 410a28ef1f5SChao Yu } 411a28ef1f5SChao Yu 412a28ef1f5SChao Yu prev = et->largest; 413a28ef1f5SChao Yu dei.len = 0; 414a28ef1f5SChao Yu 4154d1fa815SFan Li /* 4164d1fa815SFan Li * drop largest extent before lookup, in case it's already 4174d1fa815SFan Li * been shrunk from extent tree 4184d1fa815SFan Li */ 41941a099deSFan Li __drop_largest_extent(inode, fofs, len); 420a28ef1f5SChao Yu 42119b2c30dSChao Yu /* 1. lookup first extent node in range [fofs, fofs + len - 1] */ 42219b2c30dSChao Yu en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en, 4230f825ee6SFan Li &insert_p, &insert_parent); 4244d1fa815SFan Li if (!en) 42519b2c30dSChao Yu en = next_en; 42619b2c30dSChao Yu 42719b2c30dSChao Yu /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */ 4284d1fa815SFan Li while (en && en->ei.fofs < end) { 4294d1fa815SFan Li unsigned int org_end; 4304d1fa815SFan Li int parts = 0; /* # of parts current extent split into */ 43119b2c30dSChao Yu 4324d1fa815SFan Li next_en = en1 = NULL; 433a28ef1f5SChao Yu 434a28ef1f5SChao Yu dei = en->ei; 4354d1fa815SFan Li org_end = dei.fofs + dei.len; 4364d1fa815SFan Li f2fs_bug_on(sbi, pos >= org_end); 43719b2c30dSChao Yu 4384d1fa815SFan Li if (pos > dei.fofs && pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 4394d1fa815SFan Li en->ei.len = pos - en->ei.fofs; 4404d1fa815SFan Li prev_en = en; 4414d1fa815SFan Li parts = 1; 44219b2c30dSChao Yu } 44319b2c30dSChao Yu 4444d1fa815SFan Li if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) { 4454d1fa815SFan Li if (parts) { 4464d1fa815SFan Li set_extent_info(&ei, end, 4474d1fa815SFan Li end - dei.fofs + dei.blk, 4484d1fa815SFan Li org_end - end); 4494d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 4504d1fa815SFan Li NULL, NULL); 4514d1fa815SFan Li next_en = en1; 4524d1fa815SFan Li } else { 45319b2c30dSChao Yu en->ei.fofs = end; 45419b2c30dSChao Yu en->ei.blk += end - dei.fofs; 45519b2c30dSChao Yu en->ei.len -= end - dei.fofs; 4564d1fa815SFan Li next_en = en; 4574d1fa815SFan Li } 4584d1fa815SFan Li parts++; 45919b2c30dSChao Yu } 46019b2c30dSChao Yu 4614d1fa815SFan Li if (!next_en) { 4624d1fa815SFan Li struct rb_node *node = rb_next(&en->rb_node); 4634d1fa815SFan Li 4644d1fa815SFan Li next_en = node ? 4654d1fa815SFan Li rb_entry(node, struct extent_node, rb_node) 4664d1fa815SFan Li : NULL; 4674d1fa815SFan Li } 4684d1fa815SFan Li 4694abd3f5aSChao Yu if (parts) 4704abd3f5aSChao Yu __try_update_largest_extent(et, en); 4714abd3f5aSChao Yu else 4724d1fa815SFan Li __detach_extent_node(sbi, et, en); 47319b2c30dSChao Yu 47419b2c30dSChao Yu /* 4754d1fa815SFan Li * if original extent is split into zero or two parts, extent 4764d1fa815SFan Li * tree has been altered by deletion or insertion, therefore 4774d1fa815SFan Li * invalidate pointers regard to tree. 47819b2c30dSChao Yu */ 4794d1fa815SFan Li if (parts != 1) { 48019b2c30dSChao Yu insert_p = NULL; 48119b2c30dSChao Yu insert_parent = NULL; 48219b2c30dSChao Yu } 48319b2c30dSChao Yu 4844d1fa815SFan Li /* update in global extent list */ 48519b2c30dSChao Yu spin_lock(&sbi->extent_lock); 4864d1fa815SFan Li if (!parts && !list_empty(&en->list)) 48719b2c30dSChao Yu list_del(&en->list); 48819b2c30dSChao Yu if (en1) 48919b2c30dSChao Yu list_add_tail(&en1->list, &sbi->extent_list); 49019b2c30dSChao Yu spin_unlock(&sbi->extent_lock); 49119b2c30dSChao Yu 4924d1fa815SFan Li /* release extent node */ 4934d1fa815SFan Li if (!parts) 49419b2c30dSChao Yu kmem_cache_free(extent_node_slab, en); 4954d1fa815SFan Li 4964d1fa815SFan Li en = next_en; 49719b2c30dSChao Yu } 498a28ef1f5SChao Yu 499a28ef1f5SChao Yu /* 3. update extent in extent cache */ 500a28ef1f5SChao Yu if (blkaddr) { 50119b2c30dSChao Yu struct extent_node *den = NULL; 50219b2c30dSChao Yu 50319b2c30dSChao Yu set_extent_info(&ei, fofs, blkaddr, len); 5044d1fa815SFan Li en1 = __try_merge_extent_node(sbi, et, &ei, &den, 50519b2c30dSChao Yu prev_en, next_en); 5064d1fa815SFan Li if (!en1) 5074d1fa815SFan Li en1 = __insert_extent_tree(sbi, et, &ei, 508ef05e221SChao Yu insert_p, insert_parent); 509a28ef1f5SChao Yu 510a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 511a28ef1f5SChao Yu if (dei.len >= 1 && 512a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 513a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 514a28ef1f5SChao Yu et->largest.len = 0; 515a28ef1f5SChao Yu set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); 516a28ef1f5SChao Yu } 517a28ef1f5SChao Yu 518a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 5194d1fa815SFan Li if (en1) { 5204d1fa815SFan Li if (list_empty(&en1->list)) 5214d1fa815SFan Li list_add_tail(&en1->list, &sbi->extent_list); 522a28ef1f5SChao Yu else 5234d1fa815SFan Li list_move_tail(&en1->list, &sbi->extent_list); 524a28ef1f5SChao Yu } 525a28ef1f5SChao Yu if (den && !list_empty(&den->list)) 526a28ef1f5SChao Yu list_del(&den->list); 527a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 528a28ef1f5SChao Yu 529a28ef1f5SChao Yu if (den) 530a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, den); 53119b2c30dSChao Yu } 532a28ef1f5SChao Yu 533a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) 534a28ef1f5SChao Yu __free_extent_tree(sbi, et, true); 535a28ef1f5SChao Yu 536a28ef1f5SChao Yu write_unlock(&et->lock); 537a28ef1f5SChao Yu 538a28ef1f5SChao Yu return !__is_extent_same(&prev, &et->largest); 539a28ef1f5SChao Yu } 540a28ef1f5SChao Yu 541a28ef1f5SChao Yu unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) 542a28ef1f5SChao Yu { 543a28ef1f5SChao Yu struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; 544a28ef1f5SChao Yu struct extent_node *en, *tmp; 545a28ef1f5SChao Yu unsigned long ino = F2FS_ROOT_INO(sbi); 546a28ef1f5SChao Yu struct radix_tree_root *root = &sbi->extent_tree_root; 547a28ef1f5SChao Yu unsigned int found; 548a28ef1f5SChao Yu unsigned int node_cnt = 0, tree_cnt = 0; 549a28ef1f5SChao Yu int remained; 550a28ef1f5SChao Yu 551a28ef1f5SChao Yu if (!test_opt(sbi, EXTENT_CACHE)) 552a28ef1f5SChao Yu return 0; 553a28ef1f5SChao Yu 554a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 555a28ef1f5SChao Yu goto out; 556a28ef1f5SChao Yu 557a28ef1f5SChao Yu /* 1. remove unreferenced extent tree */ 558a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 559a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 560a28ef1f5SChao Yu unsigned i; 561a28ef1f5SChao Yu 562a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 563a28ef1f5SChao Yu for (i = 0; i < found; i++) { 564a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 565a28ef1f5SChao Yu 566a28ef1f5SChao Yu if (!atomic_read(&et->refcount)) { 567a28ef1f5SChao Yu write_lock(&et->lock); 568a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, true); 569a28ef1f5SChao Yu write_unlock(&et->lock); 570a28ef1f5SChao Yu 571a28ef1f5SChao Yu radix_tree_delete(root, et->ino); 572a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 573*7441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 574a28ef1f5SChao Yu tree_cnt++; 575a28ef1f5SChao Yu 576a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 577a28ef1f5SChao Yu goto unlock_out; 578a28ef1f5SChao Yu } 579a28ef1f5SChao Yu } 580a28ef1f5SChao Yu } 581a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 582a28ef1f5SChao Yu 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); 594a28ef1f5SChao Yu } 595a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 596a28ef1f5SChao Yu 597100136acSChao Yu /* 598100136acSChao Yu * reset ino for searching victims from beginning of global extent tree. 599100136acSChao Yu */ 600100136acSChao Yu ino = F2FS_ROOT_INO(sbi); 601100136acSChao Yu 602a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 603a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 604a28ef1f5SChao Yu unsigned i; 605a28ef1f5SChao Yu 606a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 607a28ef1f5SChao Yu for (i = 0; i < found; i++) { 608a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 609a28ef1f5SChao Yu 610760de791SJaegeuk Kim if (write_trylock(&et->lock)) { 611a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, false); 612a28ef1f5SChao Yu write_unlock(&et->lock); 613760de791SJaegeuk Kim } 614a28ef1f5SChao Yu 615a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 616beaa57ddSChao Yu goto unlock_out; 617a28ef1f5SChao Yu } 618a28ef1f5SChao Yu } 619a28ef1f5SChao Yu unlock_out: 620a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 621a28ef1f5SChao Yu out: 622a28ef1f5SChao Yu trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); 623a28ef1f5SChao Yu 624a28ef1f5SChao Yu return node_cnt + tree_cnt; 625a28ef1f5SChao Yu } 626a28ef1f5SChao Yu 627a28ef1f5SChao Yu unsigned int f2fs_destroy_extent_node(struct inode *inode) 628a28ef1f5SChao Yu { 629a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 630a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 631a28ef1f5SChao Yu unsigned int node_cnt = 0; 632a28ef1f5SChao Yu 633a28ef1f5SChao Yu if (!et) 634a28ef1f5SChao Yu return 0; 635a28ef1f5SChao Yu 636a28ef1f5SChao Yu write_lock(&et->lock); 637a28ef1f5SChao Yu node_cnt = __free_extent_tree(sbi, et, true); 638a28ef1f5SChao Yu write_unlock(&et->lock); 639a28ef1f5SChao Yu 640a28ef1f5SChao Yu return node_cnt; 641a28ef1f5SChao Yu } 642a28ef1f5SChao Yu 643a28ef1f5SChao Yu void f2fs_destroy_extent_tree(struct inode *inode) 644a28ef1f5SChao Yu { 645a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 646a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 647a28ef1f5SChao Yu unsigned int node_cnt = 0; 648a28ef1f5SChao Yu 649a28ef1f5SChao Yu if (!et) 650a28ef1f5SChao Yu return; 651a28ef1f5SChao Yu 652a28ef1f5SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && et->count) { 653a28ef1f5SChao Yu atomic_dec(&et->refcount); 654a28ef1f5SChao Yu return; 655a28ef1f5SChao Yu } 656a28ef1f5SChao Yu 657a28ef1f5SChao Yu /* free all extent info belong to this extent tree */ 658a28ef1f5SChao Yu node_cnt = f2fs_destroy_extent_node(inode); 659a28ef1f5SChao Yu 660a28ef1f5SChao Yu /* delete extent tree entry in radix tree */ 661a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 662a28ef1f5SChao Yu atomic_dec(&et->refcount); 663a28ef1f5SChao Yu f2fs_bug_on(sbi, atomic_read(&et->refcount) || et->count); 664a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 665a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 666*7441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 667a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 668a28ef1f5SChao Yu 669a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 670a28ef1f5SChao Yu 671a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 672a28ef1f5SChao Yu } 673a28ef1f5SChao Yu 674a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 675a28ef1f5SChao Yu struct extent_info *ei) 676a28ef1f5SChao Yu { 677a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 678a28ef1f5SChao Yu return false; 679a28ef1f5SChao Yu 680a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 681a28ef1f5SChao Yu } 682a28ef1f5SChao Yu 683a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 684a28ef1f5SChao Yu { 685a28ef1f5SChao Yu struct f2fs_inode_info *fi = F2FS_I(dn->inode); 686a28ef1f5SChao Yu pgoff_t fofs; 687a28ef1f5SChao Yu 688a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 689a28ef1f5SChao Yu return; 690a28ef1f5SChao Yu 691a28ef1f5SChao Yu f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); 692a28ef1f5SChao Yu 69319b2c30dSChao Yu 694a28ef1f5SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + 695a28ef1f5SChao Yu dn->ofs_in_node; 696a28ef1f5SChao Yu 69719b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, dn->data_blkaddr, 1)) 69819b2c30dSChao Yu sync_inode_page(dn); 69919b2c30dSChao Yu } 70019b2c30dSChao Yu 70119b2c30dSChao Yu void f2fs_update_extent_cache_range(struct dnode_of_data *dn, 70219b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 70319b2c30dSChao Yu 70419b2c30dSChao Yu { 70519b2c30dSChao Yu if (!f2fs_may_extent_tree(dn->inode)) 70619b2c30dSChao Yu return; 70719b2c30dSChao Yu 70819b2c30dSChao Yu if (f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len)) 709a28ef1f5SChao Yu sync_inode_page(dn); 710a28ef1f5SChao Yu } 711a28ef1f5SChao Yu 712a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 713a28ef1f5SChao Yu { 714a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 715a28ef1f5SChao Yu init_rwsem(&sbi->extent_tree_lock); 716a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 717a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 718*7441ccefSJaegeuk Kim atomic_set(&sbi->total_ext_tree, 0); 719a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 720a28ef1f5SChao Yu } 721a28ef1f5SChao Yu 722a28ef1f5SChao Yu int __init create_extent_cache(void) 723a28ef1f5SChao Yu { 724a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 725a28ef1f5SChao Yu sizeof(struct extent_tree)); 726a28ef1f5SChao Yu if (!extent_tree_slab) 727a28ef1f5SChao Yu return -ENOMEM; 728a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 729a28ef1f5SChao Yu sizeof(struct extent_node)); 730a28ef1f5SChao Yu if (!extent_node_slab) { 731a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 732a28ef1f5SChao Yu return -ENOMEM; 733a28ef1f5SChao Yu } 734a28ef1f5SChao Yu return 0; 735a28ef1f5SChao Yu } 736a28ef1f5SChao Yu 737a28ef1f5SChao Yu void destroy_extent_cache(void) 738a28ef1f5SChao Yu { 739a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 740a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 741a28ef1f5SChao Yu } 742