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 84*91c481ffSChao Yu static struct extent_node *__lookup_extent_tree(struct f2fs_sb_info *sbi, 85*91c481ffSChao 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 93*91c481ffSChao Yu if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) { 94*91c481ffSChao Yu stat_inc_cached_node_hit(sbi); 95f8b703daSFan Li return en; 96a28ef1f5SChao Yu } 97*91c481ffSChao Yu } 98a28ef1f5SChao Yu 99a28ef1f5SChao Yu while (node) { 100a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 101a28ef1f5SChao Yu 102a28ef1f5SChao Yu if (fofs < en->ei.fofs) 103a28ef1f5SChao Yu node = node->rb_left; 104a28ef1f5SChao Yu else if (fofs >= en->ei.fofs + en->ei.len) 105a28ef1f5SChao Yu node = node->rb_right; 106a28ef1f5SChao Yu else 107a28ef1f5SChao Yu return en; 108a28ef1f5SChao Yu } 109a28ef1f5SChao Yu return NULL; 110a28ef1f5SChao Yu } 111a28ef1f5SChao Yu 112a28ef1f5SChao Yu static struct extent_node *__try_back_merge(struct f2fs_sb_info *sbi, 113a28ef1f5SChao Yu struct extent_tree *et, struct extent_node *en) 114a28ef1f5SChao Yu { 115a28ef1f5SChao Yu struct extent_node *prev; 116a28ef1f5SChao Yu struct rb_node *node; 117a28ef1f5SChao Yu 118a28ef1f5SChao Yu node = rb_prev(&en->rb_node); 119a28ef1f5SChao Yu if (!node) 120a28ef1f5SChao Yu return NULL; 121a28ef1f5SChao Yu 122a28ef1f5SChao Yu prev = rb_entry(node, struct extent_node, rb_node); 123a28ef1f5SChao Yu if (__is_back_mergeable(&en->ei, &prev->ei)) { 124a28ef1f5SChao Yu en->ei.fofs = prev->ei.fofs; 125a28ef1f5SChao Yu en->ei.blk = prev->ei.blk; 126a28ef1f5SChao Yu en->ei.len += prev->ei.len; 127a28ef1f5SChao Yu __detach_extent_node(sbi, et, prev); 128a28ef1f5SChao Yu return prev; 129a28ef1f5SChao Yu } 130a28ef1f5SChao Yu return NULL; 131a28ef1f5SChao Yu } 132a28ef1f5SChao Yu 133a28ef1f5SChao Yu static struct extent_node *__try_front_merge(struct f2fs_sb_info *sbi, 134a28ef1f5SChao Yu struct extent_tree *et, struct extent_node *en) 135a28ef1f5SChao Yu { 136a28ef1f5SChao Yu struct extent_node *next; 137a28ef1f5SChao Yu struct rb_node *node; 138a28ef1f5SChao Yu 139a28ef1f5SChao Yu node = rb_next(&en->rb_node); 140a28ef1f5SChao Yu if (!node) 141a28ef1f5SChao Yu return NULL; 142a28ef1f5SChao Yu 143a28ef1f5SChao Yu next = rb_entry(node, struct extent_node, rb_node); 144a28ef1f5SChao Yu if (__is_front_mergeable(&en->ei, &next->ei)) { 145a28ef1f5SChao Yu en->ei.len += next->ei.len; 146a28ef1f5SChao Yu __detach_extent_node(sbi, et, next); 147a28ef1f5SChao Yu return next; 148a28ef1f5SChao Yu } 149a28ef1f5SChao Yu return NULL; 150a28ef1f5SChao Yu } 151a28ef1f5SChao Yu 152a28ef1f5SChao Yu static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi, 153a28ef1f5SChao Yu struct extent_tree *et, struct extent_info *ei, 154a28ef1f5SChao Yu struct extent_node **den) 155a28ef1f5SChao Yu { 156a28ef1f5SChao Yu struct rb_node **p = &et->root.rb_node; 157a28ef1f5SChao Yu struct rb_node *parent = NULL; 158a28ef1f5SChao Yu struct extent_node *en; 159a28ef1f5SChao Yu 160a28ef1f5SChao Yu while (*p) { 161a28ef1f5SChao Yu parent = *p; 162a28ef1f5SChao Yu en = rb_entry(parent, struct extent_node, rb_node); 163a28ef1f5SChao Yu 164a28ef1f5SChao Yu if (ei->fofs < en->ei.fofs) { 165a28ef1f5SChao Yu if (__is_front_mergeable(ei, &en->ei)) { 166a28ef1f5SChao Yu f2fs_bug_on(sbi, !den); 167a28ef1f5SChao Yu en->ei.fofs = ei->fofs; 168a28ef1f5SChao Yu en->ei.blk = ei->blk; 169a28ef1f5SChao Yu en->ei.len += ei->len; 170a28ef1f5SChao Yu *den = __try_back_merge(sbi, et, en); 171a28ef1f5SChao Yu goto update_out; 172a28ef1f5SChao Yu } 173a28ef1f5SChao Yu p = &(*p)->rb_left; 174a28ef1f5SChao Yu } else if (ei->fofs >= en->ei.fofs + en->ei.len) { 175a28ef1f5SChao Yu if (__is_back_mergeable(ei, &en->ei)) { 176a28ef1f5SChao Yu f2fs_bug_on(sbi, !den); 177a28ef1f5SChao Yu en->ei.len += ei->len; 178a28ef1f5SChao Yu *den = __try_front_merge(sbi, et, en); 179a28ef1f5SChao Yu goto update_out; 180a28ef1f5SChao Yu } 181a28ef1f5SChao Yu p = &(*p)->rb_right; 182a28ef1f5SChao Yu } else { 183a28ef1f5SChao Yu f2fs_bug_on(sbi, 1); 184a28ef1f5SChao Yu } 185a28ef1f5SChao Yu } 186a28ef1f5SChao Yu 187a28ef1f5SChao Yu en = __attach_extent_node(sbi, et, ei, parent, p); 188a28ef1f5SChao Yu if (!en) 189a28ef1f5SChao Yu return NULL; 190a28ef1f5SChao Yu update_out: 191a28ef1f5SChao Yu if (en->ei.len > et->largest.len) 192a28ef1f5SChao Yu et->largest = en->ei; 193a28ef1f5SChao Yu et->cached_en = en; 194a28ef1f5SChao Yu return en; 195a28ef1f5SChao Yu } 196a28ef1f5SChao Yu 197a28ef1f5SChao Yu static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi, 198a28ef1f5SChao Yu struct extent_tree *et, bool free_all) 199a28ef1f5SChao Yu { 200a28ef1f5SChao Yu struct rb_node *node, *next; 201a28ef1f5SChao Yu struct extent_node *en; 202a28ef1f5SChao Yu unsigned int count = et->count; 203a28ef1f5SChao Yu 204a28ef1f5SChao Yu node = rb_first(&et->root); 205a28ef1f5SChao Yu while (node) { 206a28ef1f5SChao Yu next = rb_next(node); 207a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 208a28ef1f5SChao Yu 209a28ef1f5SChao Yu if (free_all) { 210a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 211a28ef1f5SChao Yu if (!list_empty(&en->list)) 212a28ef1f5SChao Yu list_del_init(&en->list); 213a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 214a28ef1f5SChao Yu } 215a28ef1f5SChao Yu 216a28ef1f5SChao Yu if (free_all || list_empty(&en->list)) { 217a28ef1f5SChao Yu __detach_extent_node(sbi, et, en); 218a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, en); 219a28ef1f5SChao Yu } 220a28ef1f5SChao Yu node = next; 221a28ef1f5SChao Yu } 222a28ef1f5SChao Yu 223a28ef1f5SChao Yu return count - et->count; 224a28ef1f5SChao Yu } 225a28ef1f5SChao Yu 226a28ef1f5SChao Yu void f2fs_drop_largest_extent(struct inode *inode, pgoff_t fofs) 227a28ef1f5SChao Yu { 228a28ef1f5SChao Yu struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; 229a28ef1f5SChao Yu 230a28ef1f5SChao Yu if (largest->fofs <= fofs && largest->fofs + largest->len > fofs) 231a28ef1f5SChao Yu largest->len = 0; 232a28ef1f5SChao Yu } 233a28ef1f5SChao Yu 234a28ef1f5SChao Yu void f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 235a28ef1f5SChao Yu { 236a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 237a28ef1f5SChao Yu struct extent_tree *et; 238a28ef1f5SChao Yu struct extent_node *en; 239a28ef1f5SChao Yu struct extent_info ei; 240a28ef1f5SChao Yu 241a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 242a28ef1f5SChao Yu return; 243a28ef1f5SChao Yu 244a28ef1f5SChao Yu et = __grab_extent_tree(inode); 245a28ef1f5SChao Yu 246a28ef1f5SChao Yu if (!i_ext || le32_to_cpu(i_ext->len) < F2FS_MIN_EXTENT_LEN) 247a28ef1f5SChao Yu return; 248a28ef1f5SChao Yu 249a28ef1f5SChao Yu set_extent_info(&ei, le32_to_cpu(i_ext->fofs), 250a28ef1f5SChao Yu le32_to_cpu(i_ext->blk), le32_to_cpu(i_ext->len)); 251a28ef1f5SChao Yu 252a28ef1f5SChao Yu write_lock(&et->lock); 253a28ef1f5SChao Yu if (et->count) 254a28ef1f5SChao Yu goto out; 255a28ef1f5SChao Yu 256a28ef1f5SChao Yu en = __insert_extent_tree(sbi, et, &ei, NULL); 257a28ef1f5SChao Yu if (en) { 258a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 259a28ef1f5SChao Yu list_add_tail(&en->list, &sbi->extent_list); 260a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 261a28ef1f5SChao Yu } 262a28ef1f5SChao Yu out: 263a28ef1f5SChao Yu write_unlock(&et->lock); 264a28ef1f5SChao Yu } 265a28ef1f5SChao Yu 266a28ef1f5SChao Yu static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, 267a28ef1f5SChao Yu struct extent_info *ei) 268a28ef1f5SChao Yu { 269a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 270a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 271a28ef1f5SChao Yu struct extent_node *en; 272a28ef1f5SChao Yu bool ret = false; 273a28ef1f5SChao Yu 274a28ef1f5SChao Yu f2fs_bug_on(sbi, !et); 275a28ef1f5SChao Yu 276a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_start(inode, pgofs); 277a28ef1f5SChao Yu 278a28ef1f5SChao Yu read_lock(&et->lock); 279a28ef1f5SChao Yu 280a28ef1f5SChao Yu if (et->largest.fofs <= pgofs && 281a28ef1f5SChao Yu et->largest.fofs + et->largest.len > pgofs) { 282a28ef1f5SChao Yu *ei = et->largest; 283a28ef1f5SChao Yu ret = true; 284727edac5SChao Yu stat_inc_read_hit(sbi); 285*91c481ffSChao Yu stat_inc_largest_node_hit(sbi); 286a28ef1f5SChao Yu goto out; 287a28ef1f5SChao Yu } 288a28ef1f5SChao Yu 289*91c481ffSChao Yu en = __lookup_extent_tree(sbi, et, pgofs); 290a28ef1f5SChao Yu if (en) { 291a28ef1f5SChao Yu *ei = en->ei; 292a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 293a28ef1f5SChao Yu if (!list_empty(&en->list)) 294a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 295a28ef1f5SChao Yu et->cached_en = en; 296a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 297a28ef1f5SChao Yu ret = true; 298727edac5SChao Yu stat_inc_read_hit(sbi); 299a28ef1f5SChao Yu } 300a28ef1f5SChao Yu out: 301727edac5SChao Yu stat_inc_total_hit(sbi); 302a28ef1f5SChao Yu read_unlock(&et->lock); 303a28ef1f5SChao Yu 304a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 305a28ef1f5SChao Yu return ret; 306a28ef1f5SChao Yu } 307a28ef1f5SChao Yu 3080f825ee6SFan Li 3090f825ee6SFan Li /* 3100f825ee6SFan Li * lookup extent at @fofs, if hit, return the extent 3110f825ee6SFan Li * if not, return NULL and 3120f825ee6SFan Li * @prev_ex: extent before fofs 3130f825ee6SFan Li * @next_ex: extent after fofs 3140f825ee6SFan Li * @insert_p: insert point for new extent at fofs 3150f825ee6SFan Li * in order to simpfy the insertion after. 3160f825ee6SFan Li * tree must stay unchanged between lookup and insertion. 3170f825ee6SFan Li */ 3180f825ee6SFan Li static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et, 319*91c481ffSChao Yu unsigned int fofs, 320*91c481ffSChao Yu struct extent_node **prev_ex, 3210f825ee6SFan Li struct extent_node **next_ex, 3220f825ee6SFan Li struct rb_node ***insert_p, 3230f825ee6SFan Li struct rb_node **insert_parent) 3240f825ee6SFan Li { 3250f825ee6SFan Li struct rb_node **pnode = &et->root.rb_node; 3260f825ee6SFan Li struct rb_node *parent = NULL, *tmp_node; 3270f825ee6SFan Li struct extent_node *en; 3280f825ee6SFan Li 3290f825ee6SFan Li if (et->cached_en) { 3300f825ee6SFan Li struct extent_info *cei = &et->cached_en->ei; 3310f825ee6SFan Li 3320f825ee6SFan Li if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) 3330f825ee6SFan Li return et->cached_en; 3340f825ee6SFan Li } 3350f825ee6SFan Li 3360f825ee6SFan Li while (*pnode) { 3370f825ee6SFan Li parent = *pnode; 3380f825ee6SFan Li en = rb_entry(*pnode, struct extent_node, rb_node); 3390f825ee6SFan Li 3400f825ee6SFan Li if (fofs < en->ei.fofs) 3410f825ee6SFan Li pnode = &(*pnode)->rb_left; 3420f825ee6SFan Li else if (fofs >= en->ei.fofs + en->ei.len) 3430f825ee6SFan Li pnode = &(*pnode)->rb_right; 3440f825ee6SFan Li else 3450f825ee6SFan Li return en; 3460f825ee6SFan Li } 3470f825ee6SFan Li 3480f825ee6SFan Li *insert_p = pnode; 3490f825ee6SFan Li *insert_parent = parent; 3500f825ee6SFan Li 3510f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 3520f825ee6SFan Li tmp_node = parent; 3530f825ee6SFan Li if (parent && fofs > en->ei.fofs) 3540f825ee6SFan Li tmp_node = rb_next(parent); 3550f825ee6SFan Li *next_ex = tmp_node ? 3560f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3570f825ee6SFan Li 3580f825ee6SFan Li tmp_node = parent; 3590f825ee6SFan Li if (parent && fofs < en->ei.fofs) 3600f825ee6SFan Li tmp_node = rb_prev(parent); 3610f825ee6SFan Li *prev_ex = tmp_node ? 3620f825ee6SFan Li rb_entry(tmp_node, struct extent_node, rb_node) : NULL; 3630f825ee6SFan Li 3640f825ee6SFan Li return NULL; 3650f825ee6SFan Li } 3660f825ee6SFan Li 3670f825ee6SFan Li static struct extent_node *__insert_extent_tree_ret(struct f2fs_sb_info *sbi, 3680f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 3690f825ee6SFan Li struct extent_node **den, 3700f825ee6SFan Li struct extent_node *prev_ex, 3710f825ee6SFan Li struct extent_node *next_ex, 3720f825ee6SFan Li struct rb_node **insert_p, 3730f825ee6SFan Li struct rb_node *insert_parent) 3740f825ee6SFan Li { 3750f825ee6SFan Li struct rb_node **p = &et->root.rb_node; 3760f825ee6SFan Li struct rb_node *parent = NULL; 3770f825ee6SFan Li struct extent_node *en = NULL; 3780f825ee6SFan Li int merged = 0; 3790f825ee6SFan Li 3800f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 3810f825ee6SFan Li f2fs_bug_on(sbi, !den); 3820f825ee6SFan Li merged = 1; 3830f825ee6SFan Li prev_ex->ei.len += ei->len; 3840f825ee6SFan Li ei = &prev_ex->ei; 3850f825ee6SFan Li en = prev_ex; 3860f825ee6SFan Li } 3870f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 3880f825ee6SFan Li f2fs_bug_on(sbi, !den); 3890f825ee6SFan Li if (merged++) { 3900f825ee6SFan Li __detach_extent_node(sbi, et, prev_ex); 3910f825ee6SFan Li *den = prev_ex; 3920f825ee6SFan Li } 3930f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 3940f825ee6SFan Li next_ex->ei.blk = ei->blk; 3950f825ee6SFan Li next_ex->ei.len += ei->len; 3960f825ee6SFan Li en = next_ex; 3970f825ee6SFan Li } 3980f825ee6SFan Li if (merged) 3990f825ee6SFan Li goto update_out; 4000f825ee6SFan Li 4010f825ee6SFan Li if (insert_p && insert_parent) { 4020f825ee6SFan Li parent = insert_parent; 4030f825ee6SFan Li p = insert_p; 4040f825ee6SFan Li goto do_insert; 4050f825ee6SFan Li } 4060f825ee6SFan Li 4070f825ee6SFan Li while (*p) { 4080f825ee6SFan Li parent = *p; 4090f825ee6SFan Li en = rb_entry(parent, struct extent_node, rb_node); 4100f825ee6SFan Li 4110f825ee6SFan Li if (ei->fofs < en->ei.fofs) 4120f825ee6SFan Li p = &(*p)->rb_left; 4130f825ee6SFan Li else if (ei->fofs >= en->ei.fofs + en->ei.len) 4140f825ee6SFan Li p = &(*p)->rb_right; 4150f825ee6SFan Li else 4160f825ee6SFan Li f2fs_bug_on(sbi, 1); 4170f825ee6SFan Li } 4180f825ee6SFan Li do_insert: 4190f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 4200f825ee6SFan Li if (!en) 4210f825ee6SFan Li return NULL; 4220f825ee6SFan Li update_out: 4230f825ee6SFan Li if (en->ei.len > et->largest.len) 4240f825ee6SFan Li et->largest = en->ei; 4250f825ee6SFan Li et->cached_en = en; 4260f825ee6SFan Li return en; 4270f825ee6SFan Li } 4280f825ee6SFan Li 429a28ef1f5SChao Yu /* return true, if on-disk extent should be updated */ 430a28ef1f5SChao Yu static bool f2fs_update_extent_tree(struct inode *inode, pgoff_t fofs, 431a28ef1f5SChao Yu block_t blkaddr) 432a28ef1f5SChao Yu { 433a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 434a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 435a28ef1f5SChao Yu struct extent_node *en = NULL, *en1 = NULL, *en2 = NULL, *en3 = NULL; 4360f825ee6SFan Li struct extent_node *den = NULL, *prev_ex = NULL, *next_ex = NULL; 437a28ef1f5SChao Yu struct extent_info ei, dei, prev; 4380f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 439a28ef1f5SChao Yu unsigned int endofs; 440a28ef1f5SChao Yu 441a28ef1f5SChao Yu if (!et) 442a28ef1f5SChao Yu return false; 443a28ef1f5SChao Yu 444a28ef1f5SChao Yu trace_f2fs_update_extent_tree(inode, fofs, blkaddr); 445a28ef1f5SChao Yu 446a28ef1f5SChao Yu write_lock(&et->lock); 447a28ef1f5SChao Yu 448a28ef1f5SChao Yu if (is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT)) { 449a28ef1f5SChao Yu write_unlock(&et->lock); 450a28ef1f5SChao Yu return false; 451a28ef1f5SChao Yu } 452a28ef1f5SChao Yu 453a28ef1f5SChao Yu prev = et->largest; 454a28ef1f5SChao Yu dei.len = 0; 455a28ef1f5SChao Yu 456a28ef1f5SChao Yu /* we do not guarantee that the largest extent is cached all the time */ 457a28ef1f5SChao Yu f2fs_drop_largest_extent(inode, fofs); 458a28ef1f5SChao Yu 459a28ef1f5SChao Yu /* 1. lookup and remove existing extent info in cache */ 4600f825ee6SFan Li en = __lookup_extent_tree_ret(et, fofs, &prev_ex, &next_ex, 4610f825ee6SFan Li &insert_p, &insert_parent); 462a28ef1f5SChao Yu if (!en) 463a28ef1f5SChao Yu goto update_extent; 464a28ef1f5SChao Yu 465a28ef1f5SChao Yu dei = en->ei; 466a28ef1f5SChao Yu __detach_extent_node(sbi, et, en); 467a28ef1f5SChao Yu 4680f825ee6SFan Li /* 2. if extent can be split, try to split it */ 469a28ef1f5SChao Yu if (dei.len > F2FS_MIN_EXTENT_LEN) { 470a28ef1f5SChao Yu /* insert left part of split extent into cache */ 471a28ef1f5SChao Yu if (fofs - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 472a28ef1f5SChao Yu set_extent_info(&ei, dei.fofs, dei.blk, 473a28ef1f5SChao Yu fofs - dei.fofs); 4740f825ee6SFan Li en1 = __insert_extent_tree_ret(sbi, et, &ei, NULL, 4750f825ee6SFan Li NULL, NULL, NULL, NULL); 476a28ef1f5SChao Yu } 477a28ef1f5SChao Yu 478a28ef1f5SChao Yu /* insert right part of split extent into cache */ 479a28ef1f5SChao Yu endofs = dei.fofs + dei.len - 1; 480a28ef1f5SChao Yu if (endofs - fofs >= F2FS_MIN_EXTENT_LEN) { 481a28ef1f5SChao Yu set_extent_info(&ei, fofs + 1, 482a28ef1f5SChao Yu fofs - dei.fofs + dei.blk + 1, endofs - fofs); 4830f825ee6SFan Li en2 = __insert_extent_tree_ret(sbi, et, &ei, NULL, 4840f825ee6SFan Li NULL, NULL, NULL, NULL); 485a28ef1f5SChao Yu } 486a28ef1f5SChao Yu } 487a28ef1f5SChao Yu 488a28ef1f5SChao Yu update_extent: 489a28ef1f5SChao Yu /* 3. update extent in extent cache */ 490a28ef1f5SChao Yu if (blkaddr) { 491a28ef1f5SChao Yu set_extent_info(&ei, fofs, blkaddr, 1); 4920f825ee6SFan Li en3 = __insert_extent_tree_ret(sbi, et, &ei, &den, 4930f825ee6SFan Li prev_ex, next_ex, insert_p, insert_parent); 494a28ef1f5SChao Yu 495a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 496a28ef1f5SChao Yu if (dei.len >= 1 && 497a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 498a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 499a28ef1f5SChao Yu et->largest.len = 0; 500a28ef1f5SChao Yu set_inode_flag(F2FS_I(inode), FI_NO_EXTENT); 501a28ef1f5SChao Yu } 502a28ef1f5SChao Yu } 503a28ef1f5SChao Yu 504a28ef1f5SChao Yu /* 4. update in global extent list */ 505a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 506a28ef1f5SChao Yu if (en && !list_empty(&en->list)) 507a28ef1f5SChao Yu list_del(&en->list); 508a28ef1f5SChao Yu /* 509a28ef1f5SChao Yu * en1 and en2 split from en, they will become more and more smaller 510a28ef1f5SChao Yu * fragments after splitting several times. So if the length is smaller 511a28ef1f5SChao Yu * than F2FS_MIN_EXTENT_LEN, we will not add them into extent tree. 512a28ef1f5SChao Yu */ 513a28ef1f5SChao Yu if (en1) 514a28ef1f5SChao Yu list_add_tail(&en1->list, &sbi->extent_list); 515a28ef1f5SChao Yu if (en2) 516a28ef1f5SChao Yu list_add_tail(&en2->list, &sbi->extent_list); 517a28ef1f5SChao Yu if (en3) { 518a28ef1f5SChao Yu if (list_empty(&en3->list)) 519a28ef1f5SChao Yu list_add_tail(&en3->list, &sbi->extent_list); 520a28ef1f5SChao Yu else 521a28ef1f5SChao Yu list_move_tail(&en3->list, &sbi->extent_list); 522a28ef1f5SChao Yu } 523a28ef1f5SChao Yu if (den && !list_empty(&den->list)) 524a28ef1f5SChao Yu list_del(&den->list); 525a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 526a28ef1f5SChao Yu 527a28ef1f5SChao Yu /* 5. release extent node */ 528a28ef1f5SChao Yu if (en) 529a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, en); 530a28ef1f5SChao Yu if (den) 531a28ef1f5SChao Yu kmem_cache_free(extent_node_slab, den); 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); 573a28ef1f5SChao Yu 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 597a28ef1f5SChao Yu while ((found = radix_tree_gang_lookup(root, 598a28ef1f5SChao Yu (void **)treevec, ino, EXT_TREE_VEC_SIZE))) { 599a28ef1f5SChao Yu unsigned i; 600a28ef1f5SChao Yu 601a28ef1f5SChao Yu ino = treevec[found - 1]->ino + 1; 602a28ef1f5SChao Yu for (i = 0; i < found; i++) { 603a28ef1f5SChao Yu struct extent_tree *et = treevec[i]; 604a28ef1f5SChao Yu 605a28ef1f5SChao Yu write_lock(&et->lock); 606a28ef1f5SChao Yu node_cnt += __free_extent_tree(sbi, et, false); 607a28ef1f5SChao Yu write_unlock(&et->lock); 608a28ef1f5SChao Yu 609a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 610a28ef1f5SChao Yu break; 611a28ef1f5SChao Yu } 612a28ef1f5SChao Yu } 613a28ef1f5SChao Yu unlock_out: 614a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 615a28ef1f5SChao Yu out: 616a28ef1f5SChao Yu trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); 617a28ef1f5SChao Yu 618a28ef1f5SChao Yu return node_cnt + tree_cnt; 619a28ef1f5SChao Yu } 620a28ef1f5SChao Yu 621a28ef1f5SChao Yu unsigned int f2fs_destroy_extent_node(struct inode *inode) 622a28ef1f5SChao Yu { 623a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 624a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 625a28ef1f5SChao Yu unsigned int node_cnt = 0; 626a28ef1f5SChao Yu 627a28ef1f5SChao Yu if (!et) 628a28ef1f5SChao Yu return 0; 629a28ef1f5SChao Yu 630a28ef1f5SChao Yu write_lock(&et->lock); 631a28ef1f5SChao Yu node_cnt = __free_extent_tree(sbi, et, true); 632a28ef1f5SChao Yu write_unlock(&et->lock); 633a28ef1f5SChao Yu 634a28ef1f5SChao Yu return node_cnt; 635a28ef1f5SChao Yu } 636a28ef1f5SChao Yu 637a28ef1f5SChao Yu void f2fs_destroy_extent_tree(struct inode *inode) 638a28ef1f5SChao Yu { 639a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 640a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 641a28ef1f5SChao Yu unsigned int node_cnt = 0; 642a28ef1f5SChao Yu 643a28ef1f5SChao Yu if (!et) 644a28ef1f5SChao Yu return; 645a28ef1f5SChao Yu 646a28ef1f5SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && et->count) { 647a28ef1f5SChao Yu atomic_dec(&et->refcount); 648a28ef1f5SChao Yu return; 649a28ef1f5SChao Yu } 650a28ef1f5SChao Yu 651a28ef1f5SChao Yu /* free all extent info belong to this extent tree */ 652a28ef1f5SChao Yu node_cnt = f2fs_destroy_extent_node(inode); 653a28ef1f5SChao Yu 654a28ef1f5SChao Yu /* delete extent tree entry in radix tree */ 655a28ef1f5SChao Yu down_write(&sbi->extent_tree_lock); 656a28ef1f5SChao Yu atomic_dec(&et->refcount); 657a28ef1f5SChao Yu f2fs_bug_on(sbi, atomic_read(&et->refcount) || et->count); 658a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 659a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 660a28ef1f5SChao Yu sbi->total_ext_tree--; 661a28ef1f5SChao Yu up_write(&sbi->extent_tree_lock); 662a28ef1f5SChao Yu 663a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 664a28ef1f5SChao Yu 665a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 666a28ef1f5SChao Yu } 667a28ef1f5SChao Yu 668a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 669a28ef1f5SChao Yu struct extent_info *ei) 670a28ef1f5SChao Yu { 671a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 672a28ef1f5SChao Yu return false; 673a28ef1f5SChao Yu 674a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 675a28ef1f5SChao Yu } 676a28ef1f5SChao Yu 677a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 678a28ef1f5SChao Yu { 679a28ef1f5SChao Yu struct f2fs_inode_info *fi = F2FS_I(dn->inode); 680a28ef1f5SChao Yu pgoff_t fofs; 681a28ef1f5SChao Yu 682a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 683a28ef1f5SChao Yu return; 684a28ef1f5SChao Yu 685a28ef1f5SChao Yu f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR); 686a28ef1f5SChao Yu 687a28ef1f5SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) + 688a28ef1f5SChao Yu dn->ofs_in_node; 689a28ef1f5SChao Yu 690a28ef1f5SChao Yu if (f2fs_update_extent_tree(dn->inode, fofs, dn->data_blkaddr)) 691a28ef1f5SChao Yu sync_inode_page(dn); 692a28ef1f5SChao Yu } 693a28ef1f5SChao Yu 694a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 695a28ef1f5SChao Yu { 696a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 697a28ef1f5SChao Yu init_rwsem(&sbi->extent_tree_lock); 698a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 699a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 700a28ef1f5SChao Yu sbi->total_ext_tree = 0; 701a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 702a28ef1f5SChao Yu } 703a28ef1f5SChao Yu 704a28ef1f5SChao Yu int __init create_extent_cache(void) 705a28ef1f5SChao Yu { 706a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 707a28ef1f5SChao Yu sizeof(struct extent_tree)); 708a28ef1f5SChao Yu if (!extent_tree_slab) 709a28ef1f5SChao Yu return -ENOMEM; 710a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 711a28ef1f5SChao Yu sizeof(struct extent_node)); 712a28ef1f5SChao Yu if (!extent_node_slab) { 713a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 714a28ef1f5SChao Yu return -ENOMEM; 715a28ef1f5SChao Yu } 716a28ef1f5SChao Yu return 0; 717a28ef1f5SChao Yu } 718a28ef1f5SChao Yu 719a28ef1f5SChao Yu void destroy_extent_cache(void) 720a28ef1f5SChao Yu { 721a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 722a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 723a28ef1f5SChao Yu } 724