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 114*a6f78345SChao Yu static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi, 115*a6f78345SChao 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 120*a6f78345SChao Yu en = __attach_extent_node(sbi, et, ei, NULL, p); 121a28ef1f5SChao Yu if (!en) 122a28ef1f5SChao Yu return NULL; 123*a6f78345SChao 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 158a28ef1f5SChao Yu void f2fs_drop_largest_extent(struct inode *inode, pgoff_t fofs) 159a28ef1f5SChao Yu { 160a28ef1f5SChao Yu struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; 161a28ef1f5SChao Yu 162a28ef1f5SChao Yu if (largest->fofs <= fofs && largest->fofs + largest->len > fofs) 163a28ef1f5SChao Yu largest->len = 0; 164a28ef1f5SChao Yu } 165a28ef1f5SChao Yu 166a28ef1f5SChao Yu void f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 167a28ef1f5SChao Yu { 168a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 169a28ef1f5SChao Yu struct extent_tree *et; 170a28ef1f5SChao Yu struct extent_node *en; 171a28ef1f5SChao Yu struct extent_info ei; 172a28ef1f5SChao Yu 173a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 174a28ef1f5SChao Yu return; 175a28ef1f5SChao Yu 176a28ef1f5SChao Yu et = __grab_extent_tree(inode); 177a28ef1f5SChao Yu 178a28ef1f5SChao Yu if (!i_ext || le32_to_cpu(i_ext->len) < F2FS_MIN_EXTENT_LEN) 179a28ef1f5SChao Yu return; 180a28ef1f5SChao Yu 181a28ef1f5SChao Yu set_extent_info(&ei, le32_to_cpu(i_ext->fofs), 182a28ef1f5SChao Yu le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); 183a28ef1f5SChao Yu 184a28ef1f5SChao Yu write_lock(&et->lock); 185a28ef1f5SChao Yu if (et->count) 186a28ef1f5SChao Yu goto out; 187a28ef1f5SChao Yu 188*a6f78345SChao Yu en = __init_extent_tree(sbi, et, &ei); 189a28ef1f5SChao Yu if (en) { 190a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 191a28ef1f5SChao Yu list_add_tail(&en->list, &sbi->extent_list); 192a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 193a28ef1f5SChao Yu } 194a28ef1f5SChao Yu out: 195a28ef1f5SChao Yu write_unlock(&et->lock); 196a28ef1f5SChao Yu } 197a28ef1f5SChao Yu 198a28ef1f5SChao Yu static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, 199a28ef1f5SChao Yu struct extent_info *ei) 200a28ef1f5SChao Yu { 201a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 202a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 203a28ef1f5SChao Yu struct extent_node *en; 204a28ef1f5SChao Yu bool ret = false; 205a28ef1f5SChao Yu 206a28ef1f5SChao Yu f2fs_bug_on(sbi, !et); 207a28ef1f5SChao Yu 208a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_start(inode, pgofs); 209a28ef1f5SChao Yu 210a28ef1f5SChao Yu read_lock(&et->lock); 211a28ef1f5SChao Yu 212a28ef1f5SChao Yu if (et->largest.fofs <= pgofs && 213a28ef1f5SChao Yu et->largest.fofs + et->largest.len > pgofs) { 214a28ef1f5SChao Yu *ei = et->largest; 215a28ef1f5SChao Yu ret = true; 21691c481ffSChao Yu stat_inc_largest_node_hit(sbi); 217a28ef1f5SChao Yu goto out; 218a28ef1f5SChao Yu } 219a28ef1f5SChao Yu 22091c481ffSChao Yu en = __lookup_extent_tree(sbi, et, pgofs); 221a28ef1f5SChao Yu if (en) { 222a28ef1f5SChao Yu *ei = en->ei; 223a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 224a28ef1f5SChao Yu if (!list_empty(&en->list)) 225a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 226a28ef1f5SChao Yu et->cached_en = en; 227a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 228a28ef1f5SChao Yu ret = true; 229a28ef1f5SChao Yu } 230a28ef1f5SChao Yu out: 231727edac5SChao Yu stat_inc_total_hit(sbi); 232a28ef1f5SChao Yu read_unlock(&et->lock); 233a28ef1f5SChao Yu 234a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 235a28ef1f5SChao Yu return ret; 236a28ef1f5SChao Yu } 237a28ef1f5SChao Yu 2380f825ee6SFan Li 2390f825ee6SFan Li /* 2400f825ee6SFan Li * lookup extent at @fofs, if hit, return the extent 2410f825ee6SFan Li * if not, return NULL and 2420f825ee6SFan Li * @prev_ex: extent before fofs 2430f825ee6SFan Li * @next_ex: extent after fofs 2440f825ee6SFan Li * @insert_p: insert point for new extent at fofs 2450f825ee6SFan Li * in order to simpfy the insertion after. 2460f825ee6SFan Li * tree must stay unchanged between lookup and insertion. 2470f825ee6SFan Li */ 2480f825ee6SFan Li static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, 24991c481ffSChao Yu unsigned int fofs, 25091c481ffSChao Yu struct extent_node **prev_ex, 2510f825ee6SFan Li struct extent_node **next_ex, 2520f825ee6SFan Li struct rb_node ***insert_p, 2530f825ee6SFan Li struct rb_node **insert_parent) 2540f825ee6SFan Li { 2550f825ee6SFan Li struct rb_node **pnode = &et->root.rb_node; 2560f825ee6SFan Li struct rb_node *parent = NULL, *tmp_node; 2570f825ee6SFan Li struct extent_node *en; 2580f825ee6SFan Li 2590f825ee6SFan Li if (et->cached_en) { 2600f825ee6SFan Li struct extent_info *cei = &et->cached_en->ei; 2610f825ee6SFan Li 2620f825ee6SFan Li if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) 2630f825ee6SFan Li return et->cached_en; 2640f825ee6SFan Li } 2650f825ee6SFan Li 2660f825ee6SFan Li while (*pnode) { 2670f825ee6SFan Li parent = *pnode; 2680f825ee6SFan Li en = rb_entry(*pnode, struct extent_node, rb_node); 2690f825ee6SFan Li 2700f825ee6SFan Li if (fofs < en->ei.fofs) 2710f825ee6SFan Li pnode = &(*pnode)->rb_left; 2720f825ee6SFan Li else if (fofs >= en->ei.fofs + en->ei.len) 2730f825ee6SFan Li pnode = &(*pnode)->rb_right; 2740f825ee6SFan Li else 2750f825ee6SFan Li return en; 2760f825ee6SFan Li } 2770f825ee6SFan Li 2780f825ee6SFan Li *insert_p = pnode; 2790f825ee6SFan Li *insert_parent = parent; 2800f825ee6SFan Li 2810f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 2820f825ee6SFan Li tmp_node = parent; 2830f825ee6SFan Li if (parent && fofs > en->ei.fofs) 2840f825ee6SFan Li tmp_node = rb_next(parent); 2850f825ee6SFan Li *next_ex = tmp_node ? 2860f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 2870f825ee6SFan Li 2880f825ee6SFan Li tmp_node = parent; 2890f825ee6SFan Li if (parent && fofs < en->ei.fofs) 2900f825ee6SFan Li tmp_node = rb_prev(parent); 2910f825ee6SFan Li *prev_ex = tmp_node ? 2920f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 2930f825ee6SFan Li 2940f825ee6SFan Li return NULL; 2950f825ee6SFan Li } 2960f825ee6SFan Li 2970f825ee6SFan Li static struct extent_node *__insert_extent_tree_ret(struct f2fs_sb_info *sbi, 2980f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 2990f825ee6SFan Li struct extent_node **den, 3000f825ee6SFan Li struct extent_node *prev_ex, 3010f825ee6SFan Li struct extent_node *next_ex, 3020f825ee6SFan Li struct rb_node **insert_p, 3030f825ee6SFan Li struct rb_node *insert_parent) 3040f825ee6SFan Li { 3050f825ee6SFan Li struct rb_node **p = &et->root.rb_node; 3060f825ee6SFan Li struct rb_node *parent = NULL; 3070f825ee6SFan Li struct extent_node *en = NULL; 3080f825ee6SFan Li int merged = 0; 3090f825ee6SFan Li 3100f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 3110f825ee6SFan Li f2fs_bug_on(sbi, !den); 3120f825ee6SFan Li merged = 1; 3130f825ee6SFan Li prev_ex->ei.len += ei->len; 3140f825ee6SFan Li ei = &prev_ex->ei; 3150f825ee6SFan Li en = prev_ex; 3160f825ee6SFan Li } 3170f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 3180f825ee6SFan Li f2fs_bug_on(sbi, !den); 3190f825ee6SFan Li if (merged++) { 3200f825ee6SFan Li __detach_extent_node(sbi, et, prev_ex); 3210f825ee6SFan Li *den = prev_ex; 3220f825ee6SFan Li } 3230f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 3240f825ee6SFan Li next_ex->ei.blk = ei->blk; 3250f825ee6SFan Li next_ex->ei.len += ei->len; 3260f825ee6SFan Li en = next_ex; 3270f825ee6SFan Li } 3280f825ee6SFan Li if (merged) 3290f825ee6SFan Li goto update_out; 3300f825ee6SFan Li 3310f825ee6SFan Li if (insert_p && insert_parent) { 3320f825ee6SFan Li parent = insert_parent; 3330f825ee6SFan Li p = insert_p; 3340f825ee6SFan Li goto do_insert; 3350f825ee6SFan Li } 3360f825ee6SFan Li 3370f825ee6SFan Li while (*p) { 3380f825ee6SFan Li parent = *p; 3390f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3400f825ee6SFan Li 3410f825ee6SFan Li if (ei->fofs < en->ei.fofs) 3420f825ee6SFan Li p = &(*p)->rb_left; 3430f825ee6SFan Li else if (ei->fofs >= en->ei.fofs + en->ei.len) 3440f825ee6SFan Li p = &(*p)->rb_right; 3450f825ee6SFan Li else 3460f825ee6SFan Li f2fs_bug_on(sbi, 1); 3470f825ee6SFan Li } 3480f825ee6SFan Li do_insert: 3490f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 3500f825ee6SFan Li if (!en) 3510f825ee6SFan Li return NULL; 3520f825ee6SFan Li update_out: 3530f825ee6SFan Li if (en->ei.len > et->largest.len) 3540f825ee6SFan Li et->largest = en->ei; 3550f825ee6SFan Li et->cached_en = en; 3560f825ee6SFan Li return en; 3570f825ee6SFan Li } 3580f825ee6SFan Li 359a28ef1f5SChao Yu /* return true, if on-disk extent should be updated */ 360a28ef1f5SChao Yu static bool f2fs_update_extent_tree(struct inode *inode, pgoff_t fofs, 361a28ef1f5SChao Yu block_t blkaddr) 362a28ef1f5SChao Yu { 363a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 364a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 365a28ef1f5SChao Yu struct extent_node *en = NULL, *en1 = NULL, *en2 = NULL, *en3 = NULL; 3660f825ee6SFan Li struct extent_node *den = NULL, *prev_ex = NULL, *next_ex = NULL; 367a28ef1f5SChao Yu struct extent_info ei, dei, prev; 3680f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 369a28ef1f5SChao Yu unsigned int endofs; 370a28ef1f5SChao Yu 371a28ef1f5SChao Yu if (!et) 372a28ef1f5SChao Yu return false; 373a28ef1f5SChao Yu 374a28ef1f5SChao Yu trace_f2fs_update_extent_tree(inode, fofs, blkaddr); 375a28ef1f5SChao Yu 376a28ef1f5SChao Yu write_lock(&et->lock); 377a28ef1f5SChao Yu 378a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { 379a28ef1f5SChao Yu write_unlock(&et->lock); 380a28ef1f5SChao Yu return false; 381a28ef1f5SChao Yu } 382a28ef1f5SChao Yu 383a28ef1f5SChao Yu prev = et->largest; 384a28ef1f5SChao Yu dei.len = 0; 385a28ef1f5SChao Yu 386a28ef1f5SChao Yu /* we do not guarantee that the largest extent is cached all the time */ 387a28ef1f5SChao Yu f2fs_drop_largest_extent(inode, fofs); 388a28ef1f5SChao Yu 389a28ef1f5SChao Yu /* 1. lookup and remove existing extent info in cache */ 3900f825ee6SFan Li en = __lookup_extent_tree_ret(et, fofs, &prev_ex, &next_ex, 3910f825ee6SFan Li &insert_p, &insert_parent); 392a28ef1f5SChao Yu if (!en) 393a28ef1f5SChao Yu goto update_extent; 394a28ef1f5SChao Yu 395a28ef1f5SChao Yu dei = en->ei; 396a28ef1f5SChao Yu __detach_extent_node(sbi, et, en); 397a28ef1f5SChao Yu 3980f825ee6SFan Li /* 2. if extent can be split, try to split it */ 399a28ef1f5SChao Yu if (dei.len > F2FS_MIN_EXTENT_LEN) { 400a28ef1f5SChao Yu /* insert left part of split extent into cache */ 401a28ef1f5SChao Yu if (fofs - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 402a28ef1f5SChao Yu set_extent_info(&ei, dei.fofs, dei.blk, 403a28ef1f5SChao Yu fofs - dei.fofs); 4040f825ee6SFan Li en1 = __insert_extent_tree_ret(sbi, et, &ei, NULL, 4050f825ee6SFan Li NULL, NULL, NULL, NULL); 406a28ef1f5SChao Yu } 407a28ef1f5SChao Yu 408a28ef1f5SChao Yu /* insert right part of split extent into cache */ 409a28ef1f5SChao Yu endofs = dei.fofs + dei.len - 1; 410a28ef1f5SChao Yu if (endofs - fofs >= F2FS_MIN_EXTENT_LEN) { 411a28ef1f5SChao Yu set_extent_info(&ei, fofs + 1, 412a28ef1f5SChao Yu fofs - dei.fofs + dei.blk + 1, endofs - fofs); 4130f825ee6SFan Li en2 = __insert_extent_tree_ret(sbi, et, &ei, NULL, 4140f825ee6SFan Li NULL, NULL, NULL, NULL); 415a28ef1f5SChao Yu } 416a28ef1f5SChao Yu } 417a28ef1f5SChao Yu 418a28ef1f5SChao Yu update_extent: 419a28ef1f5SChao Yu /* 3. update extent in extent cache */ 420a28ef1f5SChao Yu if (blkaddr) { 421a28ef1f5SChao Yu set_extent_info(&ei, fofs, blkaddr, 1); 4220f825ee6SFan Li en3 = __insert_extent_tree_ret(sbi, et, &ei, &den, 4230f825ee6SFan Li prev_ex, next_ex, insert_p, insert_parent); 424a28ef1f5SChao Yu 425a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 426a28ef1f5SChao Yu if (dei.len >= 1 && 427a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 428a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 429a28ef1f5SChao Yu et->largest.len = 0; 430a28ef1f5SChao Yu set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); 431a28ef1f5SChao Yu } 432a28ef1f5SChao Yu } 433a28ef1f5SChao Yu 434a28ef1f5SChao Yu /* 4. update in global extent list */ 435a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 436a28ef1f5SChao Yu if (en && !list_empty(&en->list)) 437a28ef1f5SChao Yu list_del(&en->list); 438a28ef1f5SChao Yu /* 439a28ef1f5SChao Yu * en1 and en2 split from en, they will become more and more smaller 440a28ef1f5SChao Yu * fragments after splitting several times. So if the length is smaller 441a28ef1f5SChao Yu * than F2FS_MIN_EXTENT_LEN, we will not add them into extent tree. 442a28ef1f5SChao Yu */ 443a28ef1f5SChao Yu if (en1) 444a28ef1f5SChao Yu list_add_tail(&en1->list, &sbi->extent_list); 445a28ef1f5SChao Yu if (en2) 446a28ef1f5SChao Yu list_add_tail(&en2->list, &sbi->extent_list); 447a28ef1f5SChao Yu if (en3) { 448a28ef1f5SChao Yu if (list_empty(&en3->list)) 449a28ef1f5SChao Yu list_add_tail(&en3->list, &sbi->extent_list); 450a28ef1f5SChao Yu else 451a28ef1f5SChao Yu list_move_tail(&en3->list, &sbi->extent_list); 452a28ef1f5SChao Yu } 453a28ef1f5SChao Yu if (den && !list_empty(&den->list)) 454a28ef1f5SChao Yu list_del(&den->list); 455a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 456a28ef1f5SChao Yu 457a28ef1f5SChao Yu /* 5. release extent node */ 458a28ef1f5SChao Yu if (en) 459a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, en); 460a28ef1f5SChao Yu if (den) 461a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, den); 462a28ef1f5SChao Yu 463a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) 464a28ef1f5SChao Yu __free_extent_tree(sbi, et, true); 465a28ef1f5SChao Yu 466a28ef1f5SChao Yu write_unlock(&et->lock); 467a28ef1f5SChao Yu 468a28ef1f5SChao Yu return !__is_extent_same(&prev, &et->largest); 469a28ef1f5SChao Yu } 470a28ef1f5SChao Yu 471a28ef1f5SChao Yu unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) 472a28ef1f5SChao Yu { 473a28ef1f5SChao Yu struct extent_tree *treevec[EXT_TREE_VEC_SIZE]; 474a28ef1f5SChao Yu struct extent_node *en, *tmp; 475a28ef1f5SChao Yu unsigned long ino = F2FS_ROOT_INO(sbi); 476a28ef1f5SChao Yu struct radix_tree_root *root = &sbi->extent_tree_root; 477a28ef1f5SChao Yu unsigned int found; 478a28ef1f5SChao Yu unsigned int node_cnt = 0, tree_cnt = 0; 479a28ef1f5SChao Yu int remained; 480a28ef1f5SChao Yu 481a28ef1f5SChao Yu if (!test_opt(sbi, EXTENT_CACHE)) 482a28ef1f5SChao Yu return 0; 483a28ef1f5SChao Yu 484a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 485a28ef1f5SChao Yu goto out; 486a28ef1f5SChao Yu 487a28ef1f5SChao Yu /* 1. remove unreferenced extent tree */ 488a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 489a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 490a28ef1f5SChao Yu unsigned i; 491a28ef1f5SChao Yu 492a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 493a28ef1f5SChao Yu for (i = 0; i < found; i++) { 494a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 495a28ef1f5SChao Yu 496a28ef1f5SChao Yu if (!atomic_read(&et->refcount)) { 497a28ef1f5SChao Yu write_lock(&et->lock); 498a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, true); 499a28ef1f5SChao Yu write_unlock(&et->lock); 500a28ef1f5SChao Yu 501a28ef1f5SChao Yu radix_tree_delete(root, et->ino); 502a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 503a28ef1f5SChao Yu sbi->total_ext_tree--; 504a28ef1f5SChao Yu tree_cnt++; 505a28ef1f5SChao Yu 506a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 507a28ef1f5SChao Yu goto unlock_out; 508a28ef1f5SChao Yu } 509a28ef1f5SChao Yu } 510a28ef1f5SChao Yu } 511a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 512a28ef1f5SChao Yu 513a28ef1f5SChao Yu /* 2. remove LRU extent entries */ 514a28ef1f5SChao Yu if (!down_write_trylock(&sbi->extent_tree_lock)) 515a28ef1f5SChao Yu goto out; 516a28ef1f5SChao Yu 517a28ef1f5SChao Yu remained = nr_shrink - (node_cnt + tree_cnt); 518a28ef1f5SChao Yu 519a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 520a28ef1f5SChao Yu list_for_each_entry_safe(en, tmp, &sbi->extent_list, list) { 521a28ef1f5SChao Yu if (!remained--) 522a28ef1f5SChao Yu break; 523a28ef1f5SChao Yu list_del_init(&en->list); 524a28ef1f5SChao Yu } 525a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 526a28ef1f5SChao Yu 527a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 528a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 529a28ef1f5SChao Yu unsigned i; 530a28ef1f5SChao Yu 531a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 532a28ef1f5SChao Yu for (i = 0; i < found; i++) { 533a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 534a28ef1f5SChao Yu 535a28ef1f5SChao Yu write_lock(&et->lock); 536a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, false); 537a28ef1f5SChao Yu write_unlock(&et->lock); 538a28ef1f5SChao Yu 539a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 540a28ef1f5SChao Yu break; 541a28ef1f5SChao Yu } 542a28ef1f5SChao Yu } 543a28ef1f5SChao Yu unlock_out: 544a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 545a28ef1f5SChao Yu out: 546a28ef1f5SChao Yu trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); 547a28ef1f5SChao Yu 548a28ef1f5SChao Yu return node_cnt + tree_cnt; 549a28ef1f5SChao Yu } 550a28ef1f5SChao Yu 551a28ef1f5SChao Yu unsigned int f2fs_destroy_extent_node(struct inode *inode) 552a28ef1f5SChao Yu { 553a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 554a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 555a28ef1f5SChao Yu unsigned int node_cnt = 0; 556a28ef1f5SChao Yu 557a28ef1f5SChao Yu if (!et) 558a28ef1f5SChao Yu return 0; 559a28ef1f5SChao Yu 560a28ef1f5SChao Yu write_lock(&et->lock); 561a28ef1f5SChao Yu node_cnt = __free_extent_tree(sbi, et, true); 562a28ef1f5SChao Yu write_unlock(&et->lock); 563a28ef1f5SChao Yu 564a28ef1f5SChao Yu return node_cnt; 565a28ef1f5SChao Yu } 566a28ef1f5SChao Yu 567a28ef1f5SChao Yu void f2fs_destroy_extent_tree(struct inode *inode) 568a28ef1f5SChao Yu { 569a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 570a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 571a28ef1f5SChao Yu unsigned int node_cnt = 0; 572a28ef1f5SChao Yu 573a28ef1f5SChao Yu if (!et) 574a28ef1f5SChao Yu return; 575a28ef1f5SChao Yu 576a28ef1f5SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && et->count) { 577a28ef1f5SChao Yu atomic_dec(&et->refcount); 578a28ef1f5SChao Yu return; 579a28ef1f5SChao Yu } 580a28ef1f5SChao Yu 581a28ef1f5SChao Yu /* free all extent info belong to this extent tree */ 582a28ef1f5SChao Yu node_cnt = f2fs_destroy_extent_node(inode); 583a28ef1f5SChao Yu 584a28ef1f5SChao Yu /* delete extent tree entry in radix tree */ 585a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 586a28ef1f5SChao Yu atomic_dec(&et->refcount); 587a28ef1f5SChao Yu f2fs_bug_on(sbi, atomic_read(&et->refcount) || et->count); 588a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 589a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 590a28ef1f5SChao Yu sbi->total_ext_tree--; 591a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 592a28ef1f5SChao Yu 593a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 594a28ef1f5SChao Yu 595a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 596a28ef1f5SChao Yu } 597a28ef1f5SChao Yu 598a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 599a28ef1f5SChao Yu struct extent_info *ei) 600a28ef1f5SChao Yu { 601a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 602a28ef1f5SChao Yu return false; 603a28ef1f5SChao Yu 604a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 605a28ef1f5SChao Yu } 606a28ef1f5SChao Yu 607a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 608a28ef1f5SChao Yu { 609a28ef1f5SChao Yu struct f2fs_inode_info *fi = F2FS_I(dn->inode); 610a28ef1f5SChao Yu pgoff_t fofs; 611a28ef1f5SChao Yu 612a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 613a28ef1f5SChao Yu return; 614a28ef1f5SChao Yu 615a28ef1f5SChao Yu f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); 616a28ef1f5SChao Yu 617a28ef1f5SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + 618a28ef1f5SChao Yu dn->ofs_in_node; 619a28ef1f5SChao Yu 620a28ef1f5SChao Yu if (f2fs_update_extent_tree(dn->inode, fofs, dn->data_blkaddr)) 621a28ef1f5SChao Yu sync_inode_page(dn); 622a28ef1f5SChao Yu } 623a28ef1f5SChao Yu 624a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 625a28ef1f5SChao Yu { 626a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 627a28ef1f5SChao Yu init_rwsem(&sbi->extent_tree_lock); 628a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 629a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 630a28ef1f5SChao Yu sbi->total_ext_tree = 0; 631a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 632a28ef1f5SChao Yu } 633a28ef1f5SChao Yu 634a28ef1f5SChao Yu int __init create_extent_cache(void) 635a28ef1f5SChao Yu { 636a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 637a28ef1f5SChao Yu sizeof(struct extent_tree)); 638a28ef1f5SChao Yu if (!extent_tree_slab) 639a28ef1f5SChao Yu return -ENOMEM; 640a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 641a28ef1f5SChao Yu sizeof(struct extent_node)); 642a28ef1f5SChao Yu if (!extent_node_slab) { 643a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 644a28ef1f5SChao Yu return -ENOMEM; 645a28ef1f5SChao Yu } 646a28ef1f5SChao Yu return 0; 647a28ef1f5SChao Yu } 648a28ef1f5SChao Yu 649a28ef1f5SChao Yu void destroy_extent_cache(void) 650a28ef1f5SChao Yu { 651a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 652a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 653a28ef1f5SChao Yu } 654