fs/f2fs/extent_cache.c

   1 /*
   2  * f2fs extent cache support
   3  *
   4  * Copyright (c) 2015 Motorola Mobility
   5  * Copyright (c) 2015 Samsung Electronics
   6  * Authors: Jaegeuk Kim <jaegeuk@kernel.org>
   7  *          Chao Yu <chao2.yu@samsung.com>
   8  *
   9  * This program is free software; you can redistribute it and/or modify
  10  * it under the terms of the GNU General Public License version 2 as
  11  * published by the Free Software Foundation.
  12  */
  13
  14 #include <linux/fs.h>
  15 #include <linux/f2fs_fs.h>
  16
  17 #include "f2fs.h"
  18 #include "node.h"
  19 #include <trace/events/f2fs.h>
  20
  21 static struct kmem_cache *extent_tree_slab;
  22 static struct kmem_cache *extent_node_slab;
  23
  24 static struct extent_node *__attach_extent_node(struct f2fs_sb_info *sbi,
  25                                 struct extent_tree *et, struct extent_info *ei,
  26                                 struct rb_node *parent, struct rb_node **p)
  27 {
  28         struct extent_node *en;
  29
  30         en = kmem_cache_alloc(extent_node_slab, GFP_ATOMIC);
  31         if (!en)
  32                 return NULL;
  33
  34         en->ei = *ei;
  35         INIT_LIST_HEAD(&en->list);
  36         en->et = et;
  37
  38         rb_link_node(&en->rb_node, parent, p);
  39         rb_insert_color(&en->rb_node, &et->root);
  40         atomic_inc(&et->node_cnt);
  41         atomic_inc(&sbi->total_ext_node);
  42         return en;
  43 }
  44
  45 static void __detach_extent_node(struct f2fs_sb_info *sbi,
  46                                 struct extent_tree *et, struct extent_node *en)
  47 {
  48         rb_erase(&en->rb_node, &et->root);
  49         atomic_dec(&et->node_cnt);
  50         atomic_dec(&sbi->total_ext_node);
  51
  52         if (et->cached_en == en)
  53                 et->cached_en = NULL;
  54         kmem_cache_free(extent_node_slab, en);
  55 }
  56
  57 /*
  58  * Flow to release an extent_node:
  59  * 1. list_del_init
  60  * 2. __detach_extent_node
  61  * 3. kmem_cache_free.
  62  */
  63 static void __release_extent_node(struct f2fs_sb_info *sbi,
  64                         struct extent_tree *et, struct extent_node *en)
  65 {
  66         spin_lock(&sbi->extent_lock);
  67         f2fs_bug_on(sbi, list_empty(&en->list));
  68         list_del_init(&en->list);
  69         spin_unlock(&sbi->extent_lock);
  70
  71         __detach_extent_node(sbi, et, en);
  72 }
  73
  74 static struct extent_tree *__grab_extent_tree(struct inode *inode)
  75 {
  76         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
  77         struct extent_tree *et;
  78         nid_t ino = inode->i_ino;
  79
  80         down_write(&sbi->extent_tree_lock);
  81         et = radix_tree_lookup(&sbi->extent_tree_root, ino);
  82         if (!et) {
  83                 et = f2fs_kmem_cache_alloc(extent_tree_slab, GFP_NOFS);
  84                 f2fs_radix_tree_insert(&sbi->extent_tree_root, ino, et);
  85                 memset(et, 0, sizeof(struct extent_tree));
  86                 et->ino = ino;
  87                 et->root = RB_ROOT;
  88                 et->cached_en = NULL;
  89                 rwlock_init(&et->lock);
  90                 INIT_LIST_HEAD(&et->list);
  91                 atomic_set(&et->node_cnt, 0);
  92                 atomic_inc(&sbi->total_ext_tree);
  93         } else {
  94                 atomic_dec(&sbi->total_zombie_tree);
  95                 list_del_init(&et->list);
  96         }
  97         up_write(&sbi->extent_tree_lock);
  98
  99         /* never died until evict_inode */
 100         F2FS_I(inode)->extent_tree = et;
 101
 102         return et;
 103 }
 104
 105 static struct extent_node *__lookup_extent_tree(struct f2fs_sb_info *sbi,
 106                                 struct extent_tree *et, unsigned int fofs)
 107 {
 108         struct rb_node *node = et->root.rb_node;
 109         struct extent_node *en = et->cached_en;
 110
 111         if (en) {
 112                 struct extent_info *cei = &en->ei;
 113
 114                 if (cei->fofs <= fofs && cei->fofs + cei->len > fofs) {
 115                         stat_inc_cached_node_hit(sbi);
 116                         return en;
 117                 }
 118         }
 119
 120         while (node) {
 121                 en = rb_entry(node, struct extent_node, rb_node);
 122
 123                 if (fofs < en->ei.fofs) {
 124                         node = node->rb_left;
 125                 } else if (fofs >= en->ei.fofs + en->ei.len) {
 126                         node = node->rb_right;
 127                 } else {
 128                         stat_inc_rbtree_node_hit(sbi);
 129                         return en;
 130                 }
 131         }
 132         return NULL;
 133 }
 134
 135 static struct extent_node *__init_extent_tree(struct f2fs_sb_info *sbi,
 136                                 struct extent_tree *et, struct extent_info *ei)
 137 {
 138         struct rb_node **p = &et->root.rb_node;
 139         struct extent_node *en;
 140
 141         en = __attach_extent_node(sbi, et, ei, NULL, p);
 142         if (!en)
 143                 return NULL;
 144
 145         et->largest = en->ei;
 146         et->cached_en = en;
 147         return en;
 148 }
 149
 150 static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi,
 151                                         struct extent_tree *et)
 152 {
 153         struct rb_node *node, *next;
 154         struct extent_node *en;
 155         unsigned int count = atomic_read(&et->node_cnt);
 156
 157         node = rb_first(&et->root);
 158         while (node) {
 159                 next = rb_next(node);
 160                 en = rb_entry(node, struct extent_node, rb_node);
 161                 __release_extent_node(sbi, et, en);
 162                 node = next;
 163         }
 164
 165         return count - atomic_read(&et->node_cnt);
 166 }
 167
 168 static void __drop_largest_extent(struct inode *inode,
 169                                         pgoff_t fofs, unsigned int len)
 170 {
 171         struct extent_info *largest = &F2FS_I(inode)->extent_tree->largest;
 172
 173         if (fofs < largest->fofs + largest->len && fofs + len > largest->fofs) {
 174                 largest->len = 0;
 175                 f2fs_mark_inode_dirty_sync(inode);
 176         }
 177 }
 178
 179 /* return true, if inode page is changed */
 180 static bool __f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext)
 181 {
 182         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 183         struct extent_tree *et;
 184         struct extent_node *en;
 185         struct extent_info ei;
 186
 187         if (!f2fs_may_extent_tree(inode)) {
 188                 /* drop largest extent */
 189                 if (i_ext && i_ext->len) {
 190                         i_ext->len = 0;
 191                         return true;
 192                 }
 193                 return false;
 194         }
 195
 196         et = __grab_extent_tree(inode);
 197
 198         if (!i_ext || !i_ext->len)
 199                 return false;
 200
 201         get_extent_info(&ei, i_ext);
 202
 203         write_lock(&et->lock);
 204         if (atomic_read(&et->node_cnt))
 205                 goto out;
 206
 207         en = __init_extent_tree(sbi, et, &ei);
 208         if (en) {
 209                 spin_lock(&sbi->extent_lock);
 210                 list_add_tail(&en->list, &sbi->extent_list);
 211                 spin_unlock(&sbi->extent_lock);
 212         }
 213 out:
 214         write_unlock(&et->lock);
 215         return false;
 216 }
 217
 218 bool f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext)
 219 {
 220         bool ret =  __f2fs_init_extent_tree(inode, i_ext);
 221
 222         if (!F2FS_I(inode)->extent_tree)
 223                 set_inode_flag(inode, FI_NO_EXTENT);
 224
 225         return ret;
 226 }
 227
 228 static bool f2fs_lookup_extent_tree(struct inode *inode, pgoff_t pgofs,
 229                                                         struct extent_info *ei)
 230 {
 231         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 232         struct extent_tree *et = F2FS_I(inode)->extent_tree;
 233         struct extent_node *en;
 234         bool ret = false;
 235
 236         f2fs_bug_on(sbi, !et);
 237
 238         trace_f2fs_lookup_extent_tree_start(inode, pgofs);
 239
 240         read_lock(&et->lock);
 241
 242         if (et->largest.fofs <= pgofs &&
 243                         et->largest.fofs + et->largest.len > pgofs) {
 244                 *ei = et->largest;
 245                 ret = true;
 246                 stat_inc_largest_node_hit(sbi);
 247                 goto out;
 248         }
 249
 250         en = __lookup_extent_tree(sbi, et, pgofs);
 251         if (en) {
 252                 *ei = en->ei;
 253                 spin_lock(&sbi->extent_lock);
 254                 if (!list_empty(&en->list)) {
 255                         list_move_tail(&en->list, &sbi->extent_list);
 256                         et->cached_en = en;
 257                 }
 258                 spin_unlock(&sbi->extent_lock);
 259                 ret = true;
 260         }
 261 out:
 262         stat_inc_total_hit(sbi);
 263         read_unlock(&et->lock);
 264
 265         trace_f2fs_lookup_extent_tree_end(inode, pgofs, ei);
 266         return ret;
 267 }
 268
 269
 270 /*
 271  * lookup extent at @fofs, if hit, return the extent
 272  * if not, return NULL and
 273  * @prev_ex: extent before fofs
 274  * @next_ex: extent after fofs
 275  * @insert_p: insert point for new extent at fofs
 276  * in order to simpfy the insertion after.
 277  * tree must stay unchanged between lookup and insertion.
 278  */
 279 static struct extent_node *__lookup_extent_tree_ret(struct extent_tree *et,
 280                                 unsigned int fofs,
 281                                 struct extent_node **prev_ex,
 282                                 struct extent_node **next_ex,
 283                                 struct rb_node ***insert_p,
 284                                 struct rb_node **insert_parent)
 285 {
 286         struct rb_node **pnode = &et->root.rb_node;
 287         struct rb_node *parent = NULL, *tmp_node;
 288         struct extent_node *en = et->cached_en;
 289
 290         *insert_p = NULL;
 291         *insert_parent = NULL;
 292         *prev_ex = NULL;
 293         *next_ex = NULL;
 294
 295         if (RB_EMPTY_ROOT(&et->root))
 296                 return NULL;
 297
 298         if (en) {
 299                 struct extent_info *cei = &en->ei;
 300
 301                 if (cei->fofs <= fofs && cei->fofs + cei->len > fofs)
 302                         goto lookup_neighbors;
 303         }
 304
 305         while (*pnode) {
 306                 parent = *pnode;
 307                 en = rb_entry(*pnode, struct extent_node, rb_node);
 308
 309                 if (fofs < en->ei.fofs)
 310                         pnode = &(*pnode)->rb_left;
 311                 else if (fofs >= en->ei.fofs + en->ei.len)
 312                         pnode = &(*pnode)->rb_right;
 313                 else
 314                         goto lookup_neighbors;
 315         }
 316
 317         *insert_p = pnode;
 318         *insert_parent = parent;
 319
 320         en = rb_entry(parent, struct extent_node, rb_node);
 321         tmp_node = parent;
 322         if (parent && fofs > en->ei.fofs)
 323                 tmp_node = rb_next(parent);
 324         *next_ex = tmp_node ?
 325                 rb_entry(tmp_node, struct extent_node, rb_node) : NULL;
 326
 327         tmp_node = parent;
 328         if (parent && fofs < en->ei.fofs)
 329                 tmp_node = rb_prev(parent);
 330         *prev_ex = tmp_node ?
 331                 rb_entry(tmp_node, struct extent_node, rb_node) : NULL;
 332         return NULL;
 333
 334 lookup_neighbors:
 335         if (fofs == en->ei.fofs) {
 336                 /* lookup prev node for merging backward later */
 337                 tmp_node = rb_prev(&en->rb_node);
 338                 *prev_ex = tmp_node ?
 339                         rb_entry(tmp_node, struct extent_node, rb_node) : NULL;
 340         }
 341         if (fofs == en->ei.fofs + en->ei.len - 1) {
 342                 /* lookup next node for merging frontward later */
 343                 tmp_node = rb_next(&en->rb_node);
 344                 *next_ex = tmp_node ?
 345                         rb_entry(tmp_node, struct extent_node, rb_node) : NULL;
 346         }
 347         return en;
 348 }
 349
 350 static struct extent_node *__try_merge_extent_node(struct inode *inode,
 351                                 struct extent_tree *et, struct extent_info *ei,
 352                                 struct extent_node *prev_ex,
 353                                 struct extent_node *next_ex)
 354 {
 355         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 356         struct extent_node *en = NULL;
 357
 358         if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei)) {
 359                 prev_ex->ei.len += ei->len;
 360                 ei = &prev_ex->ei;
 361                 en = prev_ex;
 362         }
 363
 364         if (next_ex && __is_front_mergeable(ei, &next_ex->ei)) {
 365                 next_ex->ei.fofs = ei->fofs;
 366                 next_ex->ei.blk = ei->blk;
 367                 next_ex->ei.len += ei->len;
 368                 if (en)
 369                         __release_extent_node(sbi, et, prev_ex);
 370
 371                 en = next_ex;
 372         }
 373
 374         if (!en)
 375                 return NULL;
 376
 377         __try_update_largest_extent(inode, et, en);
 378
 379         spin_lock(&sbi->extent_lock);
 380         if (!list_empty(&en->list)) {
 381                 list_move_tail(&en->list, &sbi->extent_list);
 382                 et->cached_en = en;
 383         }
 384         spin_unlock(&sbi->extent_lock);
 385         return en;
 386 }
 387
 388 static struct extent_node *__insert_extent_tree(struct inode *inode,
 389                                 struct extent_tree *et, struct extent_info *ei,
 390                                 struct rb_node **insert_p,
 391                                 struct rb_node *insert_parent)
 392 {
 393         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 394         struct rb_node **p = &et->root.rb_node;
 395         struct rb_node *parent = NULL;
 396         struct extent_node *en = NULL;
 397
 398         if (insert_p && insert_parent) {
 399                 parent = insert_parent;
 400                 p = insert_p;
 401                 goto do_insert;
 402         }
 403
 404         while (*p) {
 405                 parent = *p;
 406                 en = rb_entry(parent, struct extent_node, rb_node);
 407
 408                 if (ei->fofs < en->ei.fofs)
 409                         p = &(*p)->rb_left;
 410                 else if (ei->fofs >= en->ei.fofs + en->ei.len)
 411                         p = &(*p)->rb_right;
 412                 else
 413                         f2fs_bug_on(sbi, 1);
 414         }
 415 do_insert:
 416         en = __attach_extent_node(sbi, et, ei, parent, p);
 417         if (!en)
 418                 return NULL;
 419
 420         __try_update_largest_extent(inode, et, en);
 421
 422         /* update in global extent list */
 423         spin_lock(&sbi->extent_lock);
 424         list_add_tail(&en->list, &sbi->extent_list);
 425         et->cached_en = en;
 426         spin_unlock(&sbi->extent_lock);
 427         return en;
 428 }
 429
 430 static unsigned int f2fs_update_extent_tree_range(struct inode *inode,
 431                                 pgoff_t fofs, block_t blkaddr, unsigned int len)
 432 {
 433         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 434         struct extent_tree *et = F2FS_I(inode)->extent_tree;
 435         struct extent_node *en = NULL, *en1 = NULL;
 436         struct extent_node *prev_en = NULL, *next_en = NULL;
 437         struct extent_info ei, dei, prev;
 438         struct rb_node **insert_p = NULL, *insert_parent = NULL;
 439         unsigned int end = fofs + len;
 440         unsigned int pos = (unsigned int)fofs;
 441
 442         if (!et)
 443                 return false;
 444
 445         trace_f2fs_update_extent_tree_range(inode, fofs, blkaddr, len);
 446
 447         write_lock(&et->lock);
 448
 449         if (is_inode_flag_set(inode, FI_NO_EXTENT)) {
 450                 write_unlock(&et->lock);
 451                 return false;
 452         }
 453
 454         prev = et->largest;
 455         dei.len = 0;
 456
 457         /*
 458          * drop largest extent before lookup, in case it's already
 459          * been shrunk from extent tree
 460          */
 461         __drop_largest_extent(inode, fofs, len);
 462
 463         /* 1. lookup first extent node in range [fofs, fofs + len - 1] */
 464         en = __lookup_extent_tree_ret(et, fofs, &prev_en, &next_en,
 465                                         &insert_p, &insert_parent);
 466         if (!en)
 467                 en = next_en;
 468
 469         /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */
 470         while (en && en->ei.fofs < end) {
 471                 unsigned int org_end;
 472                 int parts = 0;  /* # of parts current extent split into */
 473
 474                 next_en = en1 = NULL;
 475
 476                 dei = en->ei;
 477                 org_end = dei.fofs + dei.len;
 478                 f2fs_bug_on(sbi, pos >= org_end);
 479
 480                 if (pos > dei.fofs &&   pos - dei.fofs >= F2FS_MIN_EXTENT_LEN) {
 481                         en->ei.len = pos - en->ei.fofs;
 482                         prev_en = en;
 483                         parts = 1;
 484                 }
 485
 486                 if (end < org_end && org_end - end >= F2FS_MIN_EXTENT_LEN) {
 487                         if (parts) {
 488                                 set_extent_info(&ei, end,
 489                                                 end - dei.fofs + dei.blk,
 490                                                 org_end - end);
 491                                 en1 = __insert_extent_tree(inode, et, &ei,
 492                                                         NULL, NULL);
 493                                 next_en = en1;
 494                         } else {
 495                                 en->ei.fofs = end;
 496                                 en->ei.blk += end - dei.fofs;
 497                                 en->ei.len -= end - dei.fofs;
 498                                 next_en = en;
 499                         }
 500                         parts++;
 501                 }
 502
 503                 if (!next_en) {
 504                         struct rb_node *node = rb_next(&en->rb_node);
 505
 506                         next_en = node ?
 507                                 rb_entry(node, struct extent_node, rb_node)
 508                                 : NULL;
 509                 }
 510
 511                 if (parts)
 512                         __try_update_largest_extent(inode, et, en);
 513                 else
 514                         __release_extent_node(sbi, et, en);
 515
 516                 /*
 517                  * if original extent is split into zero or two parts, extent
 518                  * tree has been altered by deletion or insertion, therefore
 519                  * invalidate pointers regard to tree.
 520                  */
 521                 if (parts != 1) {
 522                         insert_p = NULL;
 523                         insert_parent = NULL;
 524                 }
 525                 en = next_en;
 526         }
 527
 528         /* 3. update extent in extent cache */
 529         if (blkaddr) {
 530
 531                 set_extent_info(&ei, fofs, blkaddr, len);
 532                 if (!__try_merge_extent_node(inode, et, &ei, prev_en, next_en))
 533                         __insert_extent_tree(inode, et, &ei,
 534                                                 insert_p, insert_parent);
 535
 536                 /* give up extent_cache, if split and small updates happen */
 537                 if (dei.len >= 1 &&
 538                                 prev.len < F2FS_MIN_EXTENT_LEN &&
 539                                 et->largest.len < F2FS_MIN_EXTENT_LEN) {
 540                         __drop_largest_extent(inode, 0, UINT_MAX);
 541                         set_inode_flag(inode, FI_NO_EXTENT);
 542                 }
 543         }
 544
 545         if (is_inode_flag_set(inode, FI_NO_EXTENT))
 546                 __free_extent_tree(sbi, et);
 547
 548         write_unlock(&et->lock);
 549
 550         return !__is_extent_same(&prev, &et->largest);
 551 }
 552
 553 unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink)
 554 {
 555         struct extent_tree *et, *next;
 556         struct extent_node *en;
 557         unsigned int node_cnt = 0, tree_cnt = 0;
 558         int remained;
 559
 560         if (!test_opt(sbi, EXTENT_CACHE))
 561                 return 0;
 562
 563         if (!atomic_read(&sbi->total_zombie_tree))
 564                 goto free_node;
 565
 566         if (!down_write_trylock(&sbi->extent_tree_lock))
 567                 goto out;
 568
 569         /* 1. remove unreferenced extent tree */
 570         list_for_each_entry_safe(et, next, &sbi->zombie_list, list) {
 571                 if (atomic_read(&et->node_cnt)) {
 572                         write_lock(&et->lock);
 573                         node_cnt += __free_extent_tree(sbi, et);
 574                         write_unlock(&et->lock);
 575                 }
 576                 f2fs_bug_on(sbi, atomic_read(&et->node_cnt));
 577                 list_del_init(&et->list);
 578                 radix_tree_delete(&sbi->extent_tree_root, et->ino);
 579                 kmem_cache_free(extent_tree_slab, et);
 580                 atomic_dec(&sbi->total_ext_tree);
 581                 atomic_dec(&sbi->total_zombie_tree);
 582                 tree_cnt++;
 583
 584                 if (node_cnt + tree_cnt >= nr_shrink)
 585                         goto unlock_out;
 586                 cond_resched();
 587         }
 588         up_write(&sbi->extent_tree_lock);
 589
 590 free_node:
 591         /* 2. remove LRU extent entries */
 592         if (!down_write_trylock(&sbi->extent_tree_lock))
 593                 goto out;
 594
 595         remained = nr_shrink - (node_cnt + tree_cnt);
 596
 597         spin_lock(&sbi->extent_lock);
 598         for (; remained > 0; remained--) {
 599                 if (list_empty(&sbi->extent_list))
 600                         break;
 601                 en = list_first_entry(&sbi->extent_list,
 602                                         struct extent_node, list);
 603                 et = en->et;
 604                 if (!write_trylock(&et->lock)) {
 605                         /* refresh this extent node's position in extent list */
 606                         list_move_tail(&en->list, &sbi->extent_list);
 607                         continue;
 608                 }
 609
 610                 list_del_init(&en->list);
 611                 spin_unlock(&sbi->extent_lock);
 612
 613                 __detach_extent_node(sbi, et, en);
 614
 615                 write_unlock(&et->lock);
 616                 node_cnt++;
 617                 spin_lock(&sbi->extent_lock);
 618         }
 619         spin_unlock(&sbi->extent_lock);
 620
 621 unlock_out:
 622         up_write(&sbi->extent_tree_lock);
 623 out:
 624         trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt);
 625
 626         return node_cnt + tree_cnt;
 627 }
 628
 629 unsigned int f2fs_destroy_extent_node(struct inode *inode)
 630 {
 631         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 632         struct extent_tree *et = F2FS_I(inode)->extent_tree;
 633         unsigned int node_cnt = 0;
 634
 635         if (!et || !atomic_read(&et->node_cnt))
 636                 return 0;
 637
 638         write_lock(&et->lock);
 639         node_cnt = __free_extent_tree(sbi, et);
 640         write_unlock(&et->lock);
 641
 642         return node_cnt;
 643 }
 644
 645 void f2fs_drop_extent_tree(struct inode *inode)
 646 {
 647         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 648         struct extent_tree *et = F2FS_I(inode)->extent_tree;
 649
 650         if (!f2fs_may_extent_tree(inode))
 651                 return;
 652
 653         set_inode_flag(inode, FI_NO_EXTENT);
 654
 655         write_lock(&et->lock);
 656         __free_extent_tree(sbi, et);
 657         __drop_largest_extent(inode, 0, UINT_MAX);
 658         write_unlock(&et->lock);
 659 }
 660
 661 void f2fs_destroy_extent_tree(struct inode *inode)
 662 {
 663         struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
 664         struct extent_tree *et = F2FS_I(inode)->extent_tree;
 665         unsigned int node_cnt = 0;
 666
 667         if (!et)
 668                 return;
 669
 670         if (inode->i_nlink && !is_bad_inode(inode) &&
 671                                         atomic_read(&et->node_cnt)) {
 672                 down_write(&sbi->extent_tree_lock);
 673                 list_add_tail(&et->list, &sbi->zombie_list);
 674                 atomic_inc(&sbi->total_zombie_tree);
 675                 up_write(&sbi->extent_tree_lock);
 676                 return;
 677         }
 678
 679         /* free all extent info belong to this extent tree */
 680         node_cnt = f2fs_destroy_extent_node(inode);
 681
 682         /* delete extent tree entry in radix tree */
 683         down_write(&sbi->extent_tree_lock);
 684         f2fs_bug_on(sbi, atomic_read(&et->node_cnt));
 685         radix_tree_delete(&sbi->extent_tree_root, inode->i_ino);
 686         kmem_cache_free(extent_tree_slab, et);
 687         atomic_dec(&sbi->total_ext_tree);
 688         up_write(&sbi->extent_tree_lock);
 689
 690         F2FS_I(inode)->extent_tree = NULL;
 691
 692         trace_f2fs_destroy_extent_tree(inode, node_cnt);
 693 }
 694
 695 bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs,
 696                                         struct extent_info *ei)
 697 {
 698         if (!f2fs_may_extent_tree(inode))
 699                 return false;
 700
 701         return f2fs_lookup_extent_tree(inode, pgofs, ei);
 702 }
 703
 704 void f2fs_update_extent_cache(struct dnode_of_data *dn)
 705 {
 706         pgoff_t fofs;
 707         block_t blkaddr;
 708
 709         if (!f2fs_may_extent_tree(dn->inode))
 710                 return;
 711
 712         if (dn->data_blkaddr == NEW_ADDR)
 713                 blkaddr = NULL_ADDR;
 714         else
 715                 blkaddr = dn->data_blkaddr;
 716
 717         fofs = start_bidx_of_node(ofs_of_node(dn->node_page), dn->inode) +
 718                                                                 dn->ofs_in_node;
 719         f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, 1);
 720 }
 721
 722 void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
 723                                 pgoff_t fofs, block_t blkaddr, unsigned int len)
 724
 725 {
 726         if (!f2fs_may_extent_tree(dn->inode))
 727                 return;
 728
 729         f2fs_update_extent_tree_range(dn->inode, fofs, blkaddr, len);
 730 }
 731
 732 void init_extent_cache_info(struct f2fs_sb_info *sbi)
 733 {
 734         INIT_RADIX_TREE(&sbi->extent_tree_root, GFP_NOIO);
 735         init_rwsem(&sbi->extent_tree_lock);
 736         INIT_LIST_HEAD(&sbi->extent_list);
 737         spin_lock_init(&sbi->extent_lock);
 738         atomic_set(&sbi->total_ext_tree, 0);
 739         INIT_LIST_HEAD(&sbi->zombie_list);
 740         atomic_set(&sbi->total_zombie_tree, 0);
 741         atomic_set(&sbi->total_ext_node, 0);
 742 }
 743
 744 int __init create_extent_cache(void)
 745 {
 746         extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree",
 747                         sizeof(struct extent_tree));
 748         if (!extent_tree_slab)
 749                 return -ENOMEM;
 750         extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node",
 751                         sizeof(struct extent_node));
 752         if (!extent_node_slab) {
 753                 kmem_cache_destroy(extent_tree_slab);
 754                 return -ENOMEM;
 755         }
 756         return 0;
 757 }
 758
 759 void destroy_extent_cache(void)
 760 {
 761         kmem_cache_destroy(extent_node_slab);
 762         kmem_cache_destroy(extent_tree_slab);
 763 }