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 2154c2258cSChao Yu static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re, 2254c2258cSChao Yu unsigned int ofs) 2354c2258cSChao Yu { 2454c2258cSChao Yu if (cached_re) { 2554c2258cSChao Yu if (cached_re->ofs <= ofs && 2654c2258cSChao Yu cached_re->ofs + cached_re->len > ofs) { 2754c2258cSChao Yu return cached_re; 2854c2258cSChao Yu } 2954c2258cSChao Yu } 3054c2258cSChao Yu return NULL; 3154c2258cSChao Yu } 3254c2258cSChao Yu 3354c2258cSChao Yu static struct rb_entry *__lookup_rb_tree_slow(struct rb_root *root, 3454c2258cSChao Yu unsigned int ofs) 3554c2258cSChao Yu { 3654c2258cSChao Yu struct rb_node *node = root->rb_node; 3754c2258cSChao Yu struct rb_entry *re; 3854c2258cSChao Yu 3954c2258cSChao Yu while (node) { 4054c2258cSChao Yu re = rb_entry(node, struct rb_entry, rb_node); 4154c2258cSChao Yu 4254c2258cSChao Yu if (ofs < re->ofs) 4354c2258cSChao Yu node = node->rb_left; 4454c2258cSChao Yu else if (ofs >= re->ofs + re->len) 4554c2258cSChao Yu node = node->rb_right; 4654c2258cSChao Yu else 4754c2258cSChao Yu return re; 4854c2258cSChao Yu } 4954c2258cSChao Yu return NULL; 5054c2258cSChao Yu } 5154c2258cSChao Yu 52004b6862SChao Yu struct rb_entry *__lookup_rb_tree(struct rb_root *root, 5354c2258cSChao Yu struct rb_entry *cached_re, unsigned int ofs) 5454c2258cSChao Yu { 5554c2258cSChao Yu struct rb_entry *re; 5654c2258cSChao Yu 5754c2258cSChao Yu re = __lookup_rb_tree_fast(cached_re, ofs); 5854c2258cSChao Yu if (!re) 5954c2258cSChao Yu return __lookup_rb_tree_slow(root, ofs); 6054c2258cSChao Yu 6154c2258cSChao Yu return re; 6254c2258cSChao Yu } 6354c2258cSChao Yu 64004b6862SChao Yu struct rb_node **__lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi, 6554c2258cSChao Yu struct rb_root *root, struct rb_node **parent, 6654c2258cSChao Yu unsigned int ofs) 6754c2258cSChao Yu { 6854c2258cSChao Yu struct rb_node **p = &root->rb_node; 6954c2258cSChao Yu struct rb_entry *re; 7054c2258cSChao Yu 7154c2258cSChao Yu while (*p) { 7254c2258cSChao Yu *parent = *p; 7354c2258cSChao Yu re = rb_entry(*parent, struct rb_entry, rb_node); 7454c2258cSChao Yu 7554c2258cSChao Yu if (ofs < re->ofs) 7654c2258cSChao Yu p = &(*p)->rb_left; 7754c2258cSChao Yu else if (ofs >= re->ofs + re->len) 7854c2258cSChao Yu p = &(*p)->rb_right; 7954c2258cSChao Yu else 8054c2258cSChao Yu f2fs_bug_on(sbi, 1); 8154c2258cSChao Yu } 8254c2258cSChao Yu 8354c2258cSChao Yu return p; 8454c2258cSChao Yu } 8554c2258cSChao Yu 8654c2258cSChao Yu /* 8754c2258cSChao Yu * lookup rb entry in position of @ofs in rb-tree, 8854c2258cSChao Yu * if hit, return the entry, otherwise, return NULL 8954c2258cSChao Yu * @prev_ex: extent before ofs 9054c2258cSChao Yu * @next_ex: extent after ofs 9154c2258cSChao Yu * @insert_p: insert point for new extent at ofs 9254c2258cSChao Yu * in order to simpfy the insertion after. 9354c2258cSChao Yu * tree must stay unchanged between lookup and insertion. 9454c2258cSChao Yu */ 95004b6862SChao Yu struct rb_entry *__lookup_rb_tree_ret(struct rb_root *root, 9654c2258cSChao Yu struct rb_entry *cached_re, 9754c2258cSChao Yu unsigned int ofs, 9854c2258cSChao Yu struct rb_entry **prev_entry, 9954c2258cSChao Yu struct rb_entry **next_entry, 10054c2258cSChao Yu struct rb_node ***insert_p, 101004b6862SChao Yu struct rb_node **insert_parent, 102004b6862SChao Yu bool force) 10354c2258cSChao Yu { 10454c2258cSChao Yu struct rb_node **pnode = &root->rb_node; 10554c2258cSChao Yu struct rb_node *parent = NULL, *tmp_node; 10654c2258cSChao Yu struct rb_entry *re = cached_re; 10754c2258cSChao Yu 10854c2258cSChao Yu *insert_p = NULL; 10954c2258cSChao Yu *insert_parent = NULL; 11054c2258cSChao Yu *prev_entry = NULL; 11154c2258cSChao Yu *next_entry = NULL; 11254c2258cSChao Yu 11354c2258cSChao Yu if (RB_EMPTY_ROOT(root)) 11454c2258cSChao Yu return NULL; 11554c2258cSChao Yu 11654c2258cSChao Yu if (re) { 11754c2258cSChao Yu if (re->ofs <= ofs && re->ofs + re->len > ofs) 11854c2258cSChao Yu goto lookup_neighbors; 11954c2258cSChao Yu } 12054c2258cSChao Yu 12154c2258cSChao Yu while (*pnode) { 12254c2258cSChao Yu parent = *pnode; 12354c2258cSChao Yu re = rb_entry(*pnode, struct rb_entry, rb_node); 12454c2258cSChao Yu 12554c2258cSChao Yu if (ofs < re->ofs) 12654c2258cSChao Yu pnode = &(*pnode)->rb_left; 12754c2258cSChao Yu else if (ofs >= re->ofs + re->len) 12854c2258cSChao Yu pnode = &(*pnode)->rb_right; 12954c2258cSChao Yu else 13054c2258cSChao Yu goto lookup_neighbors; 13154c2258cSChao Yu } 13254c2258cSChao Yu 13354c2258cSChao Yu *insert_p = pnode; 13454c2258cSChao Yu *insert_parent = parent; 13554c2258cSChao Yu 13654c2258cSChao Yu re = rb_entry(parent, struct rb_entry, rb_node); 13754c2258cSChao Yu tmp_node = parent; 13854c2258cSChao Yu if (parent && ofs > re->ofs) 13954c2258cSChao Yu tmp_node = rb_next(parent); 14054c2258cSChao Yu *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); 14154c2258cSChao Yu 14254c2258cSChao Yu tmp_node = parent; 14354c2258cSChao Yu if (parent && ofs < re->ofs) 14454c2258cSChao Yu tmp_node = rb_prev(parent); 14554c2258cSChao Yu *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); 14654c2258cSChao Yu return NULL; 14754c2258cSChao Yu 14854c2258cSChao Yu lookup_neighbors: 149004b6862SChao Yu if (ofs == re->ofs || force) { 15054c2258cSChao Yu /* lookup prev node for merging backward later */ 15154c2258cSChao Yu tmp_node = rb_prev(&re->rb_node); 15254c2258cSChao Yu *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); 15354c2258cSChao Yu } 154004b6862SChao Yu if (ofs == re->ofs + re->len - 1 || force) { 15554c2258cSChao Yu /* lookup next node for merging frontward later */ 15654c2258cSChao Yu tmp_node = rb_next(&re->rb_node); 15754c2258cSChao Yu *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); 15854c2258cSChao Yu } 15954c2258cSChao Yu return re; 16054c2258cSChao Yu } 16154c2258cSChao Yu 162df0f6b44SChao Yu bool __check_rb_tree_consistence(struct f2fs_sb_info *sbi, 163df0f6b44SChao Yu struct rb_root *root) 164df0f6b44SChao Yu { 165df0f6b44SChao Yu #ifdef CONFIG_F2FS_CHECK_FS 166df0f6b44SChao Yu struct rb_node *cur = rb_first(root), *next; 167df0f6b44SChao Yu struct rb_entry *cur_re, *next_re; 168df0f6b44SChao Yu 169df0f6b44SChao Yu if (!cur) 170df0f6b44SChao Yu return true; 171df0f6b44SChao Yu 172df0f6b44SChao Yu while (cur) { 173df0f6b44SChao Yu next = rb_next(cur); 174df0f6b44SChao Yu if (!next) 175df0f6b44SChao Yu return true; 176df0f6b44SChao Yu 177df0f6b44SChao Yu cur_re = rb_entry(cur, struct rb_entry, rb_node); 178df0f6b44SChao Yu next_re = rb_entry(next, struct rb_entry, rb_node); 179df0f6b44SChao Yu 180df0f6b44SChao Yu if (cur_re->ofs + cur_re->len > next_re->ofs) { 181df0f6b44SChao Yu f2fs_msg(sbi->sb, KERN_INFO, "inconsistent rbtree, " 182df0f6b44SChao Yu "cur(%u, %u) next(%u, %u)", 183df0f6b44SChao Yu cur_re->ofs, cur_re->len, 184df0f6b44SChao Yu next_re->ofs, next_re->len); 185df0f6b44SChao Yu return false; 186df0f6b44SChao Yu } 187df0f6b44SChao Yu 188df0f6b44SChao Yu cur = next; 189df0f6b44SChao Yu } 190df0f6b44SChao Yu #endif 191df0f6b44SChao Yu return true; 192df0f6b44SChao Yu } 193df0f6b44SChao Yu 194a28ef1f5SChao Yu static struct kmem_cache *extent_tree_slab; 195a28ef1f5SChao Yu static struct kmem_cache *extent_node_slab; 196a28ef1f5SChao Yu 197a28ef1f5SChao Yu static struct extent_node *__attach_extent_node(struct f2fs_sb_info *sbi, 198a28ef1f5SChao Yu struct extent_tree *et, struct extent_info *ei, 199a28ef1f5SChao Yu struct rb_node *parent, struct rb_node **p) 200a28ef1f5SChao Yu { 201a28ef1f5SChao Yu struct extent_node *en; 202a28ef1f5SChao Yu 203a28ef1f5SChao Yu en = kmem_cache_alloc(extent_node_slab, GFP_ATOMIC); 204a28ef1f5SChao Yu if (!en) 205a28ef1f5SChao Yu return NULL; 206a28ef1f5SChao Yu 207a28ef1f5SChao Yu en->ei = *ei; 208a28ef1f5SChao Yu INIT_LIST_HEAD(&en->list); 209201ef5e0SHou Pengyang en->et = et; 210a28ef1f5SChao Yu 211a28ef1f5SChao Yu rb_link_node(&en->rb_node, parent, p); 212a28ef1f5SChao Yu rb_insert_color(&en->rb_node, &et->root); 21368e35385SChao Yu atomic_inc(&et->node_cnt); 214a28ef1f5SChao Yu atomic_inc(&sbi->total_ext_node); 215a28ef1f5SChao Yu return en; 216a28ef1f5SChao Yu } 217a28ef1f5SChao Yu 218a28ef1f5SChao Yu static void __detach_extent_node(struct f2fs_sb_info *sbi, 219a28ef1f5SChao Yu struct extent_tree *et, struct extent_node *en) 220a28ef1f5SChao Yu { 221a28ef1f5SChao Yu rb_erase(&en->rb_node, &et->root); 22268e35385SChao Yu atomic_dec(&et->node_cnt); 223a28ef1f5SChao Yu atomic_dec(&sbi->total_ext_node); 224a28ef1f5SChao Yu 225a28ef1f5SChao Yu if (et->cached_en == en) 226a28ef1f5SChao Yu et->cached_en = NULL; 227a03f01f2SHou Pengyang kmem_cache_free(extent_node_slab, en); 228a03f01f2SHou Pengyang } 229a03f01f2SHou Pengyang 230a03f01f2SHou Pengyang /* 231a03f01f2SHou Pengyang * Flow to release an extent_node: 232a03f01f2SHou Pengyang * 1. list_del_init 233a03f01f2SHou Pengyang * 2. __detach_extent_node 234a03f01f2SHou Pengyang * 3. kmem_cache_free. 235a03f01f2SHou Pengyang */ 236a03f01f2SHou Pengyang static void __release_extent_node(struct f2fs_sb_info *sbi, 237a03f01f2SHou Pengyang struct extent_tree *et, struct extent_node *en) 238a03f01f2SHou Pengyang { 239a03f01f2SHou Pengyang spin_lock(&sbi->extent_lock); 240201ef5e0SHou Pengyang f2fs_bug_on(sbi, list_empty(&en->list)); 241a03f01f2SHou Pengyang list_del_init(&en->list); 242a03f01f2SHou Pengyang spin_unlock(&sbi->extent_lock); 243a03f01f2SHou Pengyang 244a03f01f2SHou Pengyang __detach_extent_node(sbi, et, en); 245a28ef1f5SChao Yu } 246a28ef1f5SChao Yu 247a28ef1f5SChao Yu static struct extent_tree *__grab_extent_tree(struct inode *inode) 248a28ef1f5SChao Yu { 249a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 250a28ef1f5SChao Yu struct extent_tree *et; 251a28ef1f5SChao Yu nid_t ino = inode->i_ino; 252a28ef1f5SChao Yu 2535e8256acSYunlei He mutex_lock(&sbi->extent_tree_lock); 254a28ef1f5SChao Yu et = radix_tree_lookup(&sbi->extent_tree_root, ino); 255a28ef1f5SChao Yu if (!et) { 256a28ef1f5SChao Yu et = f2fs_kmem_cache_alloc(extent_tree_slab, GFP_NOFS); 257a28ef1f5SChao Yu f2fs_radix_tree_insert(&sbi->extent_tree_root, ino, et); 258a28ef1f5SChao Yu memset(et, 0, sizeof(struct extent_tree)); 259a28ef1f5SChao Yu et->ino = ino; 260a28ef1f5SChao Yu et->root = RB_ROOT; 261a28ef1f5SChao Yu et->cached_en = NULL; 262a28ef1f5SChao Yu rwlock_init(&et->lock); 263137d09f0SJaegeuk Kim INIT_LIST_HEAD(&et->list); 26468e35385SChao Yu atomic_set(&et->node_cnt, 0); 2657441ccefSJaegeuk Kim atomic_inc(&sbi->total_ext_tree); 26674fd8d99SJaegeuk Kim } else { 26774fd8d99SJaegeuk Kim atomic_dec(&sbi->total_zombie_tree); 268137d09f0SJaegeuk Kim list_del_init(&et->list); 269a28ef1f5SChao Yu } 2705e8256acSYunlei He mutex_unlock(&sbi->extent_tree_lock); 271a28ef1f5SChao Yu 272a28ef1f5SChao Yu /* never died until evict_inode */ 273a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = et; 274a28ef1f5SChao Yu 275a28ef1f5SChao Yu return et; 276a28ef1f5SChao Yu } 277a28ef1f5SChao Yu 278a6f78345SChao Yu static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi, 279a6f78345SChao Yu struct extent_tree *et, struct extent_info *ei) 280a28ef1f5SChao Yu { 281a28ef1f5SChao Yu struct rb_node **p = &et->root.rb_node; 282a28ef1f5SChao Yu struct extent_node *en; 283a28ef1f5SChao Yu 284a6f78345SChao Yu en = __attach_extent_node(sbi, et, ei, NULL, p); 285a28ef1f5SChao Yu if (!en) 286a28ef1f5SChao Yu return NULL; 287a6f78345SChao Yu 288a28ef1f5SChao Yu et->largest = en->ei; 289a28ef1f5SChao Yu et->cached_en = en; 290a28ef1f5SChao Yu return en; 291a28ef1f5SChao Yu } 292a28ef1f5SChao Yu 293a28ef1f5SChao Yu static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi, 294201ef5e0SHou Pengyang struct extent_tree *et) 295a28ef1f5SChao Yu { 296a28ef1f5SChao Yu struct rb_node *node, *next; 297a28ef1f5SChao Yu struct extent_node *en; 29868e35385SChao Yu unsigned int count = atomic_read(&et->node_cnt); 299a28ef1f5SChao Yu 300a28ef1f5SChao Yu node = rb_first(&et->root); 301a28ef1f5SChao Yu while (node) { 302a28ef1f5SChao Yu next = rb_next(node); 303a28ef1f5SChao Yu en = rb_entry(node, struct extent_node, rb_node); 304a03f01f2SHou Pengyang __release_extent_node(sbi, et, en); 305a28ef1f5SChao Yu node = next; 306a28ef1f5SChao Yu } 307a28ef1f5SChao Yu 30868e35385SChao Yu return count - atomic_read(&et->node_cnt); 309a28ef1f5SChao Yu } 310a28ef1f5SChao Yu 31141a099deSFan Li static void __drop_largest_extent(struct inode *inode, 31241a099deSFan Li pgoff_t fofs, unsigned int len) 313a28ef1f5SChao Yu { 314a28ef1f5SChao Yu struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest; 315a28ef1f5SChao Yu 316205b9822SJaegeuk Kim if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs) { 317a28ef1f5SChao Yu largest->len = 0; 3187c45729aSJaegeuk Kim f2fs_mark_inode_dirty_sync(inode, true); 319205b9822SJaegeuk Kim } 320a28ef1f5SChao Yu } 321a28ef1f5SChao Yu 322ed3d1256SJaegeuk Kim /* return true, if inode page is changed */ 323dad48e73SYunlei He static bool __f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 324a28ef1f5SChao Yu { 325a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 326a28ef1f5SChao Yu struct extent_tree *et; 327a28ef1f5SChao Yu struct extent_node *en; 328a28ef1f5SChao Yu struct extent_info ei; 329a28ef1f5SChao Yu 330ed3d1256SJaegeuk Kim if (!f2fs_may_extent_tree(inode)) { 331ed3d1256SJaegeuk Kim /* drop largest extent */ 332ed3d1256SJaegeuk Kim if (i_ext && i_ext->len) { 333ed3d1256SJaegeuk Kim i_ext->len = 0; 334ed3d1256SJaegeuk Kim return true; 335ed3d1256SJaegeuk Kim } 336ed3d1256SJaegeuk Kim return false; 337ed3d1256SJaegeuk Kim } 338a28ef1f5SChao Yu 339a28ef1f5SChao Yu et = __grab_extent_tree(inode); 340a28ef1f5SChao Yu 341ed3d1256SJaegeuk Kim if (!i_ext || !i_ext->len) 342ed3d1256SJaegeuk Kim return false; 343a28ef1f5SChao Yu 344bd933d4fSChao Yu get_extent_info(&ei, i_ext); 345a28ef1f5SChao Yu 346a28ef1f5SChao Yu write_lock(&et->lock); 34768e35385SChao Yu if (atomic_read(&et->node_cnt)) 348a28ef1f5SChao Yu goto out; 349a28ef1f5SChao Yu 350a6f78345SChao Yu en = __init_extent_tree(sbi, et, &ei); 351a28ef1f5SChao Yu if (en) { 352a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 353a28ef1f5SChao Yu list_add_tail(&en->list, &sbi->extent_list); 354a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 355a28ef1f5SChao Yu } 356a28ef1f5SChao Yu out: 357a28ef1f5SChao Yu write_unlock(&et->lock); 358ed3d1256SJaegeuk Kim return false; 359a28ef1f5SChao Yu } 360a28ef1f5SChao Yu 361dad48e73SYunlei He bool f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext) 362dad48e73SYunlei He { 363dad48e73SYunlei He bool ret = __f2fs_init_extent_tree(inode, i_ext); 364dad48e73SYunlei He 365dad48e73SYunlei He if (!F2FS_I(inode)->extent_tree) 366dad48e73SYunlei He set_inode_flag(inode, FI_NO_EXTENT); 367dad48e73SYunlei He 368dad48e73SYunlei He return ret; 369dad48e73SYunlei He } 370dad48e73SYunlei He 371a28ef1f5SChao Yu static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs, 372a28ef1f5SChao Yu struct extent_info *ei) 373a28ef1f5SChao Yu { 374a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 375a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 376a28ef1f5SChao Yu struct extent_node *en; 377a28ef1f5SChao Yu bool ret = false; 378a28ef1f5SChao Yu 379a28ef1f5SChao Yu f2fs_bug_on(sbi, !et); 380a28ef1f5SChao Yu 381a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_start(inode, pgofs); 382a28ef1f5SChao Yu 383a28ef1f5SChao Yu read_lock(&et->lock); 384a28ef1f5SChao Yu 385a28ef1f5SChao Yu if (et->largest.fofs <= pgofs && 386a28ef1f5SChao Yu et->largest.fofs + et->largest.len > pgofs) { 387a28ef1f5SChao Yu *ei = et->largest; 388a28ef1f5SChao Yu ret = true; 38991c481ffSChao Yu stat_inc_largest_node_hit(sbi); 390a28ef1f5SChao Yu goto out; 391a28ef1f5SChao Yu } 392a28ef1f5SChao Yu 39354c2258cSChao Yu en = (struct extent_node *)__lookup_rb_tree(&et->root, 39454c2258cSChao Yu (struct rb_entry *)et->cached_en, pgofs); 39554c2258cSChao Yu if (!en) 39654c2258cSChao Yu goto out; 39754c2258cSChao Yu 39854c2258cSChao Yu if (en == et->cached_en) 39954c2258cSChao Yu stat_inc_cached_node_hit(sbi); 40054c2258cSChao Yu else 40154c2258cSChao Yu stat_inc_rbtree_node_hit(sbi); 40254c2258cSChao Yu 403a28ef1f5SChao Yu *ei = en->ei; 404a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 40542926744SJaegeuk Kim if (!list_empty(&en->list)) { 406a28ef1f5SChao Yu list_move_tail(&en->list, &sbi->extent_list); 407a28ef1f5SChao Yu et->cached_en = en; 40842926744SJaegeuk Kim } 409a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 410a28ef1f5SChao Yu ret = true; 411a28ef1f5SChao Yu out: 412727edac5SChao Yu stat_inc_total_hit(sbi); 413a28ef1f5SChao Yu read_unlock(&et->lock); 414a28ef1f5SChao Yu 415a28ef1f5SChao Yu trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei); 416a28ef1f5SChao Yu return ret; 417a28ef1f5SChao Yu } 418a28ef1f5SChao Yu 419205b9822SJaegeuk Kim static struct extent_node *__try_merge_extent_node(struct inode *inode, 4200f825ee6SFan Li struct extent_tree *et, struct extent_info *ei, 4210f825ee6SFan Li struct extent_node *prev_ex, 422ef05e221SChao Yu struct extent_node *next_ex) 4230f825ee6SFan Li { 424205b9822SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 4250f825ee6SFan Li struct extent_node *en = NULL; 4260f825ee6SFan Li 4270f825ee6SFan Li if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) { 4280f825ee6SFan Li prev_ex->ei.len += ei->len; 4290f825ee6SFan Li ei = &prev_ex->ei; 4300f825ee6SFan Li en = prev_ex; 4310f825ee6SFan Li } 432ef05e221SChao Yu 4330f825ee6SFan Li if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) { 4340f825ee6SFan Li next_ex->ei.fofs = ei->fofs; 4350f825ee6SFan Li next_ex->ei.blk = ei->blk; 4360f825ee6SFan Li next_ex->ei.len += ei->len; 4377855eba4SYunlei He if (en) 4387855eba4SYunlei He __release_extent_node(sbi, et, prev_ex); 4397855eba4SYunlei He 4400f825ee6SFan Li en = next_ex; 4410f825ee6SFan Li } 442ef05e221SChao Yu 44343a2fa18SJaegeuk Kim if (!en) 44443a2fa18SJaegeuk Kim return NULL; 44543a2fa18SJaegeuk Kim 446205b9822SJaegeuk Kim __try_update_largest_extent(inode, et, en); 44743a2fa18SJaegeuk Kim 44843a2fa18SJaegeuk Kim spin_lock(&sbi->extent_lock); 44942926744SJaegeuk Kim if (!list_empty(&en->list)) { 45043a2fa18SJaegeuk Kim list_move_tail(&en->list, &sbi->extent_list); 45142926744SJaegeuk Kim et->cached_en = en; 45242926744SJaegeuk Kim } 45343a2fa18SJaegeuk Kim spin_unlock(&sbi->extent_lock); 454ef05e221SChao Yu return en; 455ef05e221SChao Yu } 456ef05e221SChao Yu 457205b9822SJaegeuk Kim static struct extent_node *__insert_extent_tree(struct inode *inode, 458ef05e221SChao Yu struct extent_tree *et, struct extent_info *ei, 459ef05e221SChao Yu struct rb_node **insert_p, 460ef05e221SChao Yu struct rb_node *insert_parent) 461ef05e221SChao Yu { 462205b9822SJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 463ef05e221SChao Yu struct rb_node **p = &et->root.rb_node; 464ef05e221SChao Yu struct rb_node *parent = NULL; 465ef05e221SChao Yu struct extent_node *en = NULL; 4660f825ee6SFan Li 4670f825ee6SFan Li if (insert_p && insert_parent) { 4680f825ee6SFan Li parent = insert_parent; 4690f825ee6SFan Li p = insert_p; 4700f825ee6SFan Li goto do_insert; 4710f825ee6SFan Li } 4720f825ee6SFan Li 47354c2258cSChao Yu p = __lookup_rb_tree_for_insert(sbi, &et->root, &parent, ei->fofs); 4740f825ee6SFan Li do_insert: 4750f825ee6SFan Li en = __attach_extent_node(sbi, et, ei, parent, p); 4760f825ee6SFan Li if (!en) 4770f825ee6SFan Li return NULL; 478ef05e221SChao Yu 479205b9822SJaegeuk Kim __try_update_largest_extent(inode, et, en); 48043a2fa18SJaegeuk Kim 48143a2fa18SJaegeuk Kim /* update in global extent list */ 48243a2fa18SJaegeuk Kim spin_lock(&sbi->extent_lock); 48343a2fa18SJaegeuk Kim list_add_tail(&en->list, &sbi->extent_list); 48442926744SJaegeuk Kim et->cached_en = en; 48543a2fa18SJaegeuk Kim spin_unlock(&sbi->extent_lock); 4860f825ee6SFan Li return en; 4870f825ee6SFan Li } 4880f825ee6SFan Li 489317e1300SChao Yu static void f2fs_update_extent_tree_range(struct inode *inode, 49019b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 491a28ef1f5SChao Yu { 492a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 493a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 4944d1fa815SFan Li struct extent_node *en = NULL, *en1 = NULL; 49519b2c30dSChao Yu struct extent_node *prev_en = NULL, *next_en = NULL; 496a28ef1f5SChao Yu struct extent_info ei, dei, prev; 4970f825ee6SFan Li struct rb_node **insert_p = NULL, *insert_parent = NULL; 49819b2c30dSChao Yu unsigned int end = fofs + len; 49919b2c30dSChao Yu unsigned int pos = (unsigned int)fofs; 500a28ef1f5SChao Yu 501a28ef1f5SChao Yu if (!et) 502317e1300SChao Yu return; 503a28ef1f5SChao Yu 504744288c7SChao Yu trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len); 505744288c7SChao Yu 506a28ef1f5SChao Yu write_lock(&et->lock); 507a28ef1f5SChao Yu 50891942321SJaegeuk Kim if (is_inode_flag_set(inode, FI_NO_EXTENT)) { 509a28ef1f5SChao Yu write_unlock(&et->lock); 510317e1300SChao Yu return; 511a28ef1f5SChao Yu } 512a28ef1f5SChao Yu 513a28ef1f5SChao Yu prev = et->largest; 514a28ef1f5SChao Yu dei.len = 0; 515a28ef1f5SChao Yu 5164d1fa815SFan Li /* 5174d1fa815SFan Li * drop largest extent before lookup, in case it's already 5184d1fa815SFan Li * been shrunk from extent tree 5194d1fa815SFan Li */ 52041a099deSFan Li __drop_largest_extent(inode, fofs, len); 521a28ef1f5SChao Yu 52219b2c30dSChao Yu /* 1. lookup first extent node in range [fofs, fofs + len - 1] */ 52354c2258cSChao Yu en = (struct extent_node *)__lookup_rb_tree_ret(&et->root, 52454c2258cSChao Yu (struct rb_entry *)et->cached_en, fofs, 52554c2258cSChao Yu (struct rb_entry **)&prev_en, 52654c2258cSChao Yu (struct rb_entry **)&next_en, 527004b6862SChao Yu &insert_p, &insert_parent, false); 5284d1fa815SFan Li if (!en) 52919b2c30dSChao Yu en = next_en; 53019b2c30dSChao Yu 53119b2c30dSChao Yu /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */ 5324d1fa815SFan Li while (en && en->ei.fofs < end) { 5334d1fa815SFan Li unsigned int org_end; 5344d1fa815SFan Li int parts = 0; /* # of parts current extent split into */ 53519b2c30dSChao Yu 5364d1fa815SFan Li next_en = en1 = NULL; 537a28ef1f5SChao Yu 538a28ef1f5SChao Yu dei = en->ei; 5394d1fa815SFan Li org_end = dei.fofs + dei.len; 5404d1fa815SFan Li f2fs_bug_on(sbi, pos >= org_end); 54119b2c30dSChao Yu 5424d1fa815SFan Li if (pos > dei.fofs && pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) { 5434d1fa815SFan Li en->ei.len = pos - en->ei.fofs; 5444d1fa815SFan Li prev_en = en; 5454d1fa815SFan Li parts = 1; 54619b2c30dSChao Yu } 54719b2c30dSChao Yu 5484d1fa815SFan Li if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) { 5494d1fa815SFan Li if (parts) { 5504d1fa815SFan Li set_extent_info(&ei, end, 5514d1fa815SFan Li end - dei.fofs + dei.blk, 5524d1fa815SFan Li org_end - end); 553205b9822SJaegeuk Kim en1 = __insert_extent_tree(inode, et, &ei, 5544d1fa815SFan Li NULL, NULL); 5554d1fa815SFan Li next_en = en1; 5564d1fa815SFan Li } else { 55719b2c30dSChao Yu en->ei.fofs = end; 55819b2c30dSChao Yu en->ei.blk += end - dei.fofs; 55919b2c30dSChao Yu en->ei.len -= end - dei.fofs; 5604d1fa815SFan Li next_en = en; 5614d1fa815SFan Li } 5624d1fa815SFan Li parts++; 56319b2c30dSChao Yu } 56419b2c30dSChao Yu 5654d1fa815SFan Li if (!next_en) { 5664d1fa815SFan Li struct rb_node *node = rb_next(&en->rb_node); 5674d1fa815SFan Li 568ed0b5620SGeliang Tang next_en = rb_entry_safe(node, struct extent_node, 569ed0b5620SGeliang Tang rb_node); 5704d1fa815SFan Li } 5714d1fa815SFan Li 5724abd3f5aSChao Yu if (parts) 573205b9822SJaegeuk Kim __try_update_largest_extent(inode, et, en); 5744abd3f5aSChao Yu else 575a03f01f2SHou Pengyang __release_extent_node(sbi, et, en); 57619b2c30dSChao Yu 57719b2c30dSChao Yu /* 5784d1fa815SFan Li * if original extent is split into zero or two parts, extent 5794d1fa815SFan Li * tree has been altered by deletion or insertion, therefore 5804d1fa815SFan Li * invalidate pointers regard to tree. 58119b2c30dSChao Yu */ 5824d1fa815SFan Li if (parts != 1) { 58319b2c30dSChao Yu insert_p = NULL; 58419b2c30dSChao Yu insert_parent = NULL; 58519b2c30dSChao Yu } 5864d1fa815SFan Li en = next_en; 58719b2c30dSChao Yu } 588a28ef1f5SChao Yu 589a28ef1f5SChao Yu /* 3. update extent in extent cache */ 590a28ef1f5SChao Yu if (blkaddr) { 59119b2c30dSChao Yu 59219b2c30dSChao Yu set_extent_info(&ei, fofs, blkaddr, len); 593205b9822SJaegeuk Kim if (!__try_merge_extent_node(inode, et, &ei, prev_en, next_en)) 594205b9822SJaegeuk Kim __insert_extent_tree(inode, et, &ei, 595ef05e221SChao Yu insert_p, insert_parent); 596a28ef1f5SChao Yu 597a28ef1f5SChao Yu /* give up extent_cache, if split and small updates happen */ 598a28ef1f5SChao Yu if (dei.len >= 1 && 599a28ef1f5SChao Yu prev.len < F2FS_MIN_EXTENT_LEN && 600a28ef1f5SChao Yu et->largest.len < F2FS_MIN_EXTENT_LEN) { 601205b9822SJaegeuk Kim __drop_largest_extent(inode, 0, UINT_MAX); 60291942321SJaegeuk Kim set_inode_flag(inode, FI_NO_EXTENT); 603a28ef1f5SChao Yu } 60419b2c30dSChao Yu } 605a28ef1f5SChao Yu 60691942321SJaegeuk Kim if (is_inode_flag_set(inode, FI_NO_EXTENT)) 607201ef5e0SHou Pengyang __free_extent_tree(sbi, et); 608a28ef1f5SChao Yu 609a28ef1f5SChao Yu write_unlock(&et->lock); 610a28ef1f5SChao Yu } 611a28ef1f5SChao Yu 612a28ef1f5SChao Yu unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink) 613a28ef1f5SChao Yu { 614137d09f0SJaegeuk Kim struct extent_tree *et, *next; 615201ef5e0SHou Pengyang struct extent_node *en; 616a28ef1f5SChao Yu unsigned int node_cnt = 0, tree_cnt = 0; 617a28ef1f5SChao Yu int remained; 618a28ef1f5SChao Yu 619a28ef1f5SChao Yu if (!test_opt(sbi, EXTENT_CACHE)) 620a28ef1f5SChao Yu return 0; 621a28ef1f5SChao Yu 62274fd8d99SJaegeuk Kim if (!atomic_read(&sbi->total_zombie_tree)) 62374fd8d99SJaegeuk Kim goto free_node; 62474fd8d99SJaegeuk Kim 6255e8256acSYunlei He if (!mutex_trylock(&sbi->extent_tree_lock)) 626a28ef1f5SChao Yu goto out; 627a28ef1f5SChao Yu 628a28ef1f5SChao Yu /* 1. remove unreferenced extent tree */ 629137d09f0SJaegeuk Kim list_for_each_entry_safe(et, next, &sbi->zombie_list, list) { 6309b72a388SChao Yu if (atomic_read(&et->node_cnt)) { 631a28ef1f5SChao Yu write_lock(&et->lock); 632201ef5e0SHou Pengyang node_cnt += __free_extent_tree(sbi, et); 633a28ef1f5SChao Yu write_unlock(&et->lock); 6349b72a388SChao Yu } 635201ef5e0SHou Pengyang f2fs_bug_on(sbi, atomic_read(&et->node_cnt)); 636137d09f0SJaegeuk Kim list_del_init(&et->list); 637137d09f0SJaegeuk Kim radix_tree_delete(&sbi->extent_tree_root, et->ino); 638a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 6397441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 64074fd8d99SJaegeuk Kim atomic_dec(&sbi->total_zombie_tree); 641a28ef1f5SChao Yu tree_cnt++; 642a28ef1f5SChao Yu 643a28ef1f5SChao Yu if (node_cnt + tree_cnt >= nr_shrink) 644a28ef1f5SChao Yu goto unlock_out; 6456fe2bc95SJaegeuk Kim cond_resched(); 646a28ef1f5SChao Yu } 6475e8256acSYunlei He mutex_unlock(&sbi->extent_tree_lock); 648a28ef1f5SChao Yu 64974fd8d99SJaegeuk Kim free_node: 650a28ef1f5SChao Yu /* 2. remove LRU extent entries */ 6515e8256acSYunlei He if (!mutex_trylock(&sbi->extent_tree_lock)) 652a28ef1f5SChao Yu goto out; 653a28ef1f5SChao Yu 654a28ef1f5SChao Yu remained = nr_shrink - (node_cnt + tree_cnt); 655a28ef1f5SChao Yu 656a28ef1f5SChao Yu spin_lock(&sbi->extent_lock); 657201ef5e0SHou Pengyang for (; remained > 0; remained--) { 658201ef5e0SHou Pengyang if (list_empty(&sbi->extent_list)) 659a28ef1f5SChao Yu break; 660201ef5e0SHou Pengyang en = list_first_entry(&sbi->extent_list, 661201ef5e0SHou Pengyang struct extent_node, list); 662201ef5e0SHou Pengyang et = en->et; 663201ef5e0SHou Pengyang if (!write_trylock(&et->lock)) { 664201ef5e0SHou Pengyang /* refresh this extent node's position in extent list */ 665201ef5e0SHou Pengyang list_move_tail(&en->list, &sbi->extent_list); 666201ef5e0SHou Pengyang continue; 667201ef5e0SHou Pengyang } 668201ef5e0SHou Pengyang 669a28ef1f5SChao Yu list_del_init(&en->list); 670201ef5e0SHou Pengyang spin_unlock(&sbi->extent_lock); 671201ef5e0SHou Pengyang 672201ef5e0SHou Pengyang __detach_extent_node(sbi, et, en); 673201ef5e0SHou Pengyang 674201ef5e0SHou Pengyang write_unlock(&et->lock); 675201ef5e0SHou Pengyang node_cnt++; 676201ef5e0SHou Pengyang spin_lock(&sbi->extent_lock); 677a28ef1f5SChao Yu } 678a28ef1f5SChao Yu spin_unlock(&sbi->extent_lock); 679a28ef1f5SChao Yu 680a28ef1f5SChao Yu unlock_out: 6815e8256acSYunlei He mutex_unlock(&sbi->extent_tree_lock); 682a28ef1f5SChao Yu out: 683a28ef1f5SChao Yu trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt); 684a28ef1f5SChao Yu 685a28ef1f5SChao Yu return node_cnt + tree_cnt; 686a28ef1f5SChao Yu } 687a28ef1f5SChao Yu 688a28ef1f5SChao Yu unsigned int f2fs_destroy_extent_node(struct inode *inode) 689a28ef1f5SChao Yu { 690a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 691a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 692a28ef1f5SChao Yu unsigned int node_cnt = 0; 693a28ef1f5SChao Yu 6949b72a388SChao Yu if (!et || !atomic_read(&et->node_cnt)) 695a28ef1f5SChao Yu return 0; 696a28ef1f5SChao Yu 697a28ef1f5SChao Yu write_lock(&et->lock); 698201ef5e0SHou Pengyang node_cnt = __free_extent_tree(sbi, et); 699a28ef1f5SChao Yu write_unlock(&et->lock); 700a28ef1f5SChao Yu 701a28ef1f5SChao Yu return node_cnt; 702a28ef1f5SChao Yu } 703a28ef1f5SChao Yu 7045f281fabSJaegeuk Kim void f2fs_drop_extent_tree(struct inode *inode) 7055f281fabSJaegeuk Kim { 7065f281fabSJaegeuk Kim struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 7075f281fabSJaegeuk Kim struct extent_tree *et = F2FS_I(inode)->extent_tree; 7085f281fabSJaegeuk Kim 709*bf617f7aSChao Yu if (!f2fs_may_extent_tree(inode)) 710*bf617f7aSChao Yu return; 711*bf617f7aSChao Yu 7125f281fabSJaegeuk Kim set_inode_flag(inode, FI_NO_EXTENT); 7135f281fabSJaegeuk Kim 7145f281fabSJaegeuk Kim write_lock(&et->lock); 7155f281fabSJaegeuk Kim __free_extent_tree(sbi, et); 7165f281fabSJaegeuk Kim __drop_largest_extent(inode, 0, UINT_MAX); 7175f281fabSJaegeuk Kim write_unlock(&et->lock); 7185f281fabSJaegeuk Kim } 7195f281fabSJaegeuk Kim 720a28ef1f5SChao Yu void f2fs_destroy_extent_tree(struct inode *inode) 721a28ef1f5SChao Yu { 722a28ef1f5SChao Yu struct f2fs_sb_info *sbi = F2FS_I_SB(inode); 723a28ef1f5SChao Yu struct extent_tree *et = F2FS_I(inode)->extent_tree; 724a28ef1f5SChao Yu unsigned int node_cnt = 0; 725a28ef1f5SChao Yu 726a28ef1f5SChao Yu if (!et) 727a28ef1f5SChao Yu return; 728a28ef1f5SChao Yu 72968e35385SChao Yu if (inode->i_nlink && !is_bad_inode(inode) && 73068e35385SChao Yu atomic_read(&et->node_cnt)) { 7315e8256acSYunlei He mutex_lock(&sbi->extent_tree_lock); 732137d09f0SJaegeuk Kim list_add_tail(&et->list, &sbi->zombie_list); 73374fd8d99SJaegeuk Kim atomic_inc(&sbi->total_zombie_tree); 7345e8256acSYunlei He mutex_unlock(&sbi->extent_tree_lock); 735a28ef1f5SChao Yu return; 736a28ef1f5SChao Yu } 737a28ef1f5SChao Yu 738a28ef1f5SChao Yu /* free all extent info belong to this extent tree */ 739a28ef1f5SChao Yu node_cnt = f2fs_destroy_extent_node(inode); 740a28ef1f5SChao Yu 741a28ef1f5SChao Yu /* delete extent tree entry in radix tree */ 7425e8256acSYunlei He mutex_lock(&sbi->extent_tree_lock); 74368e35385SChao Yu f2fs_bug_on(sbi, atomic_read(&et->node_cnt)); 744a28ef1f5SChao Yu radix_tree_delete(&sbi->extent_tree_root, inode->i_ino); 745a28ef1f5SChao Yu kmem_cache_free(extent_tree_slab, et); 7467441ccefSJaegeuk Kim atomic_dec(&sbi->total_ext_tree); 7475e8256acSYunlei He mutex_unlock(&sbi->extent_tree_lock); 748a28ef1f5SChao Yu 749a28ef1f5SChao Yu F2FS_I(inode)->extent_tree = NULL; 750a28ef1f5SChao Yu 751a28ef1f5SChao Yu trace_f2fs_destroy_extent_tree(inode, node_cnt); 752a28ef1f5SChao Yu } 753a28ef1f5SChao Yu 754a28ef1f5SChao Yu bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs, 755a28ef1f5SChao Yu struct extent_info *ei) 756a28ef1f5SChao Yu { 757a28ef1f5SChao Yu if (!f2fs_may_extent_tree(inode)) 758a28ef1f5SChao Yu return false; 759a28ef1f5SChao Yu 760a28ef1f5SChao Yu return f2fs_lookup_extent_tree(inode, pgofs, ei); 761a28ef1f5SChao Yu } 762a28ef1f5SChao Yu 763a28ef1f5SChao Yu void f2fs_update_extent_cache(struct dnode_of_data *dn) 764a28ef1f5SChao Yu { 765a28ef1f5SChao Yu pgoff_t fofs; 766f28b3434SChao Yu block_t blkaddr; 767a28ef1f5SChao Yu 768a28ef1f5SChao Yu if (!f2fs_may_extent_tree(dn->inode)) 769a28ef1f5SChao Yu return; 770a28ef1f5SChao Yu 771f28b3434SChao Yu if (dn->data_blkaddr == NEW_ADDR) 772f28b3434SChao Yu blkaddr = NULL_ADDR; 773f28b3434SChao Yu else 774f28b3434SChao Yu blkaddr = dn->data_blkaddr; 77519b2c30dSChao Yu 77681ca7350SChao Yu fofs = start_bidx_of_node(ofs_of_node(dn->node_page), dn->inode) + 777a28ef1f5SChao Yu dn->ofs_in_node; 778ee6d182fSJaegeuk Kim f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, 1); 77919b2c30dSChao Yu } 78019b2c30dSChao Yu 78119b2c30dSChao Yu void f2fs_update_extent_cache_range(struct dnode_of_data *dn, 78219b2c30dSChao Yu pgoff_t fofs, block_t blkaddr, unsigned int len) 78319b2c30dSChao Yu 78419b2c30dSChao Yu { 78519b2c30dSChao Yu if (!f2fs_may_extent_tree(dn->inode)) 78619b2c30dSChao Yu return; 78719b2c30dSChao Yu 788ee6d182fSJaegeuk Kim f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len); 789a28ef1f5SChao Yu } 790a28ef1f5SChao Yu 791a28ef1f5SChao Yu void init_extent_cache_info(struct f2fs_sb_info *sbi) 792a28ef1f5SChao Yu { 793a28ef1f5SChao Yu INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO); 7945e8256acSYunlei He mutex_init(&sbi->extent_tree_lock); 795a28ef1f5SChao Yu INIT_LIST_HEAD(&sbi->extent_list); 796a28ef1f5SChao Yu spin_lock_init(&sbi->extent_lock); 7977441ccefSJaegeuk Kim atomic_set(&sbi->total_ext_tree, 0); 798137d09f0SJaegeuk Kim INIT_LIST_HEAD(&sbi->zombie_list); 79974fd8d99SJaegeuk Kim atomic_set(&sbi->total_zombie_tree, 0); 800a28ef1f5SChao Yu atomic_set(&sbi->total_ext_node, 0); 801a28ef1f5SChao Yu } 802a28ef1f5SChao Yu 803a28ef1f5SChao Yu int __init create_extent_cache(void) 804a28ef1f5SChao Yu { 805a28ef1f5SChao Yu extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree", 806a28ef1f5SChao Yu sizeof(struct extent_tree)); 807a28ef1f5SChao Yu if (!extent_tree_slab) 808a28ef1f5SChao Yu return -ENOMEM; 809a28ef1f5SChao Yu extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node", 810a28ef1f5SChao Yu sizeof(struct extent_node)); 811a28ef1f5SChao Yu if (!extent_node_slab) { 812a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 813a28ef1f5SChao Yu return -ENOMEM; 814a28ef1f5SChao Yu } 815a28ef1f5SChao Yu return 0; 816a28ef1f5SChao Yu } 817a28ef1f5SChao Yu 818a28ef1f5SChao Yu void destroy_extent_cache(void) 819a28ef1f5SChao Yu { 820a28ef1f5SChao Yu kmem_cache_destroy(extent_node_slab); 821a28ef1f5SChao Yu kmem_cache_destroy(extent_tree_slab); 822a28ef1f5SChao Yu } 823