1 // SPDX-License-Identifier: GPL-2.0
3 * f2fs extent cache support
5 * Copyright (c) 2015 Motorola Mobility
6 * Copyright (c) 2015 Samsung Electronics
7 * Authors: Jaegeuk Kim <jaegeuk@kernel.org>
8 * Chao Yu <chao2.yu@samsung.com>
12 #include <linux/f2fs_fs.h>
16 #include <trace/events/f2fs.h>
18 bool sanity_check_extent_cache(struct inode *inode)
20 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
21 struct f2fs_inode_info *fi = F2FS_I(inode);
22 struct extent_info *ei;
24 if (!fi->extent_tree[EX_READ])
27 ei = &fi->extent_tree[EX_READ]->largest;
30 (!f2fs_is_valid_blkaddr(sbi, ei->blk,
31 DATA_GENERIC_ENHANCE) ||
32 !f2fs_is_valid_blkaddr(sbi, ei->blk + ei->len - 1,
33 DATA_GENERIC_ENHANCE))) {
34 set_sbi_flag(sbi, SBI_NEED_FSCK);
35 f2fs_warn(sbi, "%s: inode (ino=%lx) extent info [%u, %u, %u] is incorrect, run fsck to fix",
36 __func__, inode->i_ino,
37 ei->blk, ei->fofs, ei->len);
43 static void __set_extent_info(struct extent_info *ei,
44 unsigned int fofs, unsigned int len,
45 block_t blk, bool keep_clen,
46 enum extent_type type)
51 if (type == EX_READ) {
55 #ifdef CONFIG_F2FS_FS_COMPRESSION
61 static bool __may_read_extent_tree(struct inode *inode)
63 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
65 if (!test_opt(sbi, READ_EXTENT_CACHE))
67 if (is_inode_flag_set(inode, FI_NO_EXTENT))
69 if (is_inode_flag_set(inode, FI_COMPRESSED_FILE) &&
70 !f2fs_sb_has_readonly(sbi))
72 return S_ISREG(inode->i_mode);
75 static bool __init_may_extent_tree(struct inode *inode, enum extent_type type)
78 return __may_read_extent_tree(inode);
82 static bool __may_extent_tree(struct inode *inode, enum extent_type type)
85 * for recovered files during mount do not create extents
86 * if shrinker is not registered.
88 if (list_empty(&F2FS_I_SB(inode)->s_list))
91 return __init_may_extent_tree(inode, type);
94 static void __try_update_largest_extent(struct extent_tree *et,
95 struct extent_node *en)
97 if (et->type != EX_READ)
99 if (en->ei.len <= et->largest.len)
102 et->largest = en->ei;
103 et->largest_updated = true;
106 static bool __is_extent_mergeable(struct extent_info *back,
107 struct extent_info *front, enum extent_type type)
109 if (type == EX_READ) {
110 #ifdef CONFIG_F2FS_FS_COMPRESSION
111 if (back->c_len && back->len != back->c_len)
113 if (front->c_len && front->len != front->c_len)
116 return (back->fofs + back->len == front->fofs &&
117 back->blk + back->len == front->blk);
122 static bool __is_back_mergeable(struct extent_info *cur,
123 struct extent_info *back, enum extent_type type)
125 return __is_extent_mergeable(back, cur, type);
128 static bool __is_front_mergeable(struct extent_info *cur,
129 struct extent_info *front, enum extent_type type)
131 return __is_extent_mergeable(cur, front, type);
134 static struct rb_entry *__lookup_rb_tree_fast(struct rb_entry *cached_re,
138 if (cached_re->ofs <= ofs &&
139 cached_re->ofs + cached_re->len > ofs) {
146 static struct rb_entry *__lookup_rb_tree_slow(struct rb_root_cached *root,
149 struct rb_node *node = root->rb_root.rb_node;
153 re = rb_entry(node, struct rb_entry, rb_node);
156 node = node->rb_left;
157 else if (ofs >= re->ofs + re->len)
158 node = node->rb_right;
165 struct rb_entry *f2fs_lookup_rb_tree(struct rb_root_cached *root,
166 struct rb_entry *cached_re, unsigned int ofs)
170 re = __lookup_rb_tree_fast(cached_re, ofs);
172 return __lookup_rb_tree_slow(root, ofs);
177 struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi,
178 struct rb_root_cached *root,
179 struct rb_node **parent,
180 unsigned int ofs, bool *leftmost)
182 struct rb_node **p = &root->rb_root.rb_node;
187 re = rb_entry(*parent, struct rb_entry, rb_node);
191 } else if (ofs >= re->ofs + re->len) {
203 * lookup rb entry in position of @ofs in rb-tree,
204 * if hit, return the entry, otherwise, return NULL
205 * @prev_ex: extent before ofs
206 * @next_ex: extent after ofs
207 * @insert_p: insert point for new extent at ofs
208 * in order to simpfy the insertion after.
209 * tree must stay unchanged between lookup and insertion.
211 struct rb_entry *f2fs_lookup_rb_tree_ret(struct rb_root_cached *root,
212 struct rb_entry *cached_re,
214 struct rb_entry **prev_entry,
215 struct rb_entry **next_entry,
216 struct rb_node ***insert_p,
217 struct rb_node **insert_parent,
218 bool force, bool *leftmost)
220 struct rb_node **pnode = &root->rb_root.rb_node;
221 struct rb_node *parent = NULL, *tmp_node;
222 struct rb_entry *re = cached_re;
225 *insert_parent = NULL;
229 if (RB_EMPTY_ROOT(&root->rb_root))
233 if (re->ofs <= ofs && re->ofs + re->len > ofs)
234 goto lookup_neighbors;
242 re = rb_entry(*pnode, struct rb_entry, rb_node);
245 pnode = &(*pnode)->rb_left;
246 } else if (ofs >= re->ofs + re->len) {
247 pnode = &(*pnode)->rb_right;
251 goto lookup_neighbors;
256 *insert_parent = parent;
258 re = rb_entry(parent, struct rb_entry, rb_node);
260 if (parent && ofs > re->ofs)
261 tmp_node = rb_next(parent);
262 *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
265 if (parent && ofs < re->ofs)
266 tmp_node = rb_prev(parent);
267 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
271 if (ofs == re->ofs || force) {
272 /* lookup prev node for merging backward later */
273 tmp_node = rb_prev(&re->rb_node);
274 *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
276 if (ofs == re->ofs + re->len - 1 || force) {
277 /* lookup next node for merging frontward later */
278 tmp_node = rb_next(&re->rb_node);
279 *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node);
284 bool f2fs_check_rb_tree_consistence(struct f2fs_sb_info *sbi,
285 struct rb_root_cached *root)
287 #ifdef CONFIG_F2FS_CHECK_FS
288 struct rb_node *cur = rb_first_cached(root), *next;
289 struct rb_entry *cur_re, *next_re;
299 cur_re = rb_entry(cur, struct rb_entry, rb_node);
300 next_re = rb_entry(next, struct rb_entry, rb_node);
302 if (cur_re->ofs + cur_re->len > next_re->ofs) {
303 f2fs_info(sbi, "inconsistent rbtree, cur(%u, %u) next(%u, %u)",
304 cur_re->ofs, cur_re->len,
305 next_re->ofs, next_re->len);
314 static struct kmem_cache *extent_tree_slab;
315 static struct kmem_cache *extent_node_slab;
317 static struct extent_node *__attach_extent_node(struct f2fs_sb_info *sbi,
318 struct extent_tree *et, struct extent_info *ei,
319 struct rb_node *parent, struct rb_node **p,
322 struct extent_tree_info *eti = &sbi->extent_tree[et->type];
323 struct extent_node *en;
325 en = f2fs_kmem_cache_alloc(extent_node_slab, GFP_ATOMIC, false, sbi);
330 INIT_LIST_HEAD(&en->list);
333 rb_link_node(&en->rb_node, parent, p);
334 rb_insert_color_cached(&en->rb_node, &et->root, leftmost);
335 atomic_inc(&et->node_cnt);
336 atomic_inc(&eti->total_ext_node);
340 static void __detach_extent_node(struct f2fs_sb_info *sbi,
341 struct extent_tree *et, struct extent_node *en)
343 struct extent_tree_info *eti = &sbi->extent_tree[et->type];
345 rb_erase_cached(&en->rb_node, &et->root);
346 atomic_dec(&et->node_cnt);
347 atomic_dec(&eti->total_ext_node);
349 if (et->cached_en == en)
350 et->cached_en = NULL;
351 kmem_cache_free(extent_node_slab, en);
355 * Flow to release an extent_node:
357 * 2. __detach_extent_node
358 * 3. kmem_cache_free.
360 static void __release_extent_node(struct f2fs_sb_info *sbi,
361 struct extent_tree *et, struct extent_node *en)
363 struct extent_tree_info *eti = &sbi->extent_tree[et->type];
365 spin_lock(&eti->extent_lock);
366 f2fs_bug_on(sbi, list_empty(&en->list));
367 list_del_init(&en->list);
368 spin_unlock(&eti->extent_lock);
370 __detach_extent_node(sbi, et, en);
373 static struct extent_tree *__grab_extent_tree(struct inode *inode,
374 enum extent_type type)
376 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
377 struct extent_tree_info *eti = &sbi->extent_tree[type];
378 struct extent_tree *et;
379 nid_t ino = inode->i_ino;
381 mutex_lock(&eti->extent_tree_lock);
382 et = radix_tree_lookup(&eti->extent_tree_root, ino);
384 et = f2fs_kmem_cache_alloc(extent_tree_slab,
385 GFP_NOFS, true, NULL);
386 f2fs_radix_tree_insert(&eti->extent_tree_root, ino, et);
387 memset(et, 0, sizeof(struct extent_tree));
390 et->root = RB_ROOT_CACHED;
391 et->cached_en = NULL;
392 rwlock_init(&et->lock);
393 INIT_LIST_HEAD(&et->list);
394 atomic_set(&et->node_cnt, 0);
395 atomic_inc(&eti->total_ext_tree);
397 atomic_dec(&eti->total_zombie_tree);
398 list_del_init(&et->list);
400 mutex_unlock(&eti->extent_tree_lock);
402 /* never died until evict_inode */
403 F2FS_I(inode)->extent_tree[type] = et;
408 static unsigned int __free_extent_tree(struct f2fs_sb_info *sbi,
409 struct extent_tree *et)
411 struct rb_node *node, *next;
412 struct extent_node *en;
413 unsigned int count = atomic_read(&et->node_cnt);
415 node = rb_first_cached(&et->root);
417 next = rb_next(node);
418 en = rb_entry(node, struct extent_node, rb_node);
419 __release_extent_node(sbi, et, en);
423 return count - atomic_read(&et->node_cnt);
426 static void __drop_largest_extent(struct extent_tree *et,
427 pgoff_t fofs, unsigned int len)
429 if (fofs < et->largest.fofs + et->largest.len &&
430 fofs + len > et->largest.fofs) {
432 et->largest_updated = true;
436 void f2fs_init_read_extent_tree(struct inode *inode, struct page *ipage)
438 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
439 struct extent_tree_info *eti = &sbi->extent_tree[EX_READ];
440 struct f2fs_extent *i_ext = &F2FS_INODE(ipage)->i_ext;
441 struct extent_tree *et;
442 struct extent_node *en;
443 struct extent_info ei;
445 if (!__may_extent_tree(inode, EX_READ)) {
446 /* drop largest read extent */
447 if (i_ext && i_ext->len) {
448 f2fs_wait_on_page_writeback(ipage, NODE, true, true);
450 set_page_dirty(ipage);
455 et = __grab_extent_tree(inode, EX_READ);
457 if (!i_ext || !i_ext->len)
460 get_read_extent_info(&ei, i_ext);
462 write_lock(&et->lock);
463 if (atomic_read(&et->node_cnt))
466 en = __attach_extent_node(sbi, et, &ei, NULL,
467 &et->root.rb_root.rb_node, true);
469 et->largest = en->ei;
472 spin_lock(&eti->extent_lock);
473 list_add_tail(&en->list, &eti->extent_list);
474 spin_unlock(&eti->extent_lock);
477 write_unlock(&et->lock);
479 if (!F2FS_I(inode)->extent_tree[EX_READ])
480 set_inode_flag(inode, FI_NO_EXTENT);
483 void f2fs_init_extent_tree(struct inode *inode)
485 /* initialize read cache */
486 if (__init_may_extent_tree(inode, EX_READ))
487 __grab_extent_tree(inode, EX_READ);
490 static bool __lookup_extent_tree(struct inode *inode, pgoff_t pgofs,
491 struct extent_info *ei, enum extent_type type)
493 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
494 struct extent_tree_info *eti = &sbi->extent_tree[type];
495 struct extent_tree *et = F2FS_I(inode)->extent_tree[type];
496 struct extent_node *en;
502 trace_f2fs_lookup_extent_tree_start(inode, pgofs, type);
504 read_lock(&et->lock);
506 if (type == EX_READ &&
507 et->largest.fofs <= pgofs &&
508 et->largest.fofs + et->largest.len > pgofs) {
511 stat_inc_largest_node_hit(sbi);
515 en = (struct extent_node *)f2fs_lookup_rb_tree(&et->root,
516 (struct rb_entry *)et->cached_en, pgofs);
520 if (en == et->cached_en)
521 stat_inc_cached_node_hit(sbi, type);
523 stat_inc_rbtree_node_hit(sbi, type);
526 spin_lock(&eti->extent_lock);
527 if (!list_empty(&en->list)) {
528 list_move_tail(&en->list, &eti->extent_list);
531 spin_unlock(&eti->extent_lock);
534 stat_inc_total_hit(sbi, type);
535 read_unlock(&et->lock);
538 trace_f2fs_lookup_read_extent_tree_end(inode, pgofs, ei);
542 static struct extent_node *__try_merge_extent_node(struct f2fs_sb_info *sbi,
543 struct extent_tree *et, struct extent_info *ei,
544 struct extent_node *prev_ex,
545 struct extent_node *next_ex)
547 struct extent_tree_info *eti = &sbi->extent_tree[et->type];
548 struct extent_node *en = NULL;
550 if (prev_ex && __is_back_mergeable(ei, &prev_ex->ei, et->type)) {
551 prev_ex->ei.len += ei->len;
556 if (next_ex && __is_front_mergeable(ei, &next_ex->ei, et->type)) {
557 next_ex->ei.fofs = ei->fofs;
558 next_ex->ei.len += ei->len;
559 if (et->type == EX_READ)
560 next_ex->ei.blk = ei->blk;
562 __release_extent_node(sbi, et, prev_ex);
570 __try_update_largest_extent(et, en);
572 spin_lock(&eti->extent_lock);
573 if (!list_empty(&en->list)) {
574 list_move_tail(&en->list, &eti->extent_list);
577 spin_unlock(&eti->extent_lock);
581 static struct extent_node *__insert_extent_tree(struct f2fs_sb_info *sbi,
582 struct extent_tree *et, struct extent_info *ei,
583 struct rb_node **insert_p,
584 struct rb_node *insert_parent,
587 struct extent_tree_info *eti = &sbi->extent_tree[et->type];
589 struct rb_node *parent = NULL;
590 struct extent_node *en = NULL;
592 if (insert_p && insert_parent) {
593 parent = insert_parent;
600 p = f2fs_lookup_rb_tree_for_insert(sbi, &et->root, &parent,
601 ei->fofs, &leftmost);
603 en = __attach_extent_node(sbi, et, ei, parent, p, leftmost);
607 __try_update_largest_extent(et, en);
609 /* update in global extent list */
610 spin_lock(&eti->extent_lock);
611 list_add_tail(&en->list, &eti->extent_list);
613 spin_unlock(&eti->extent_lock);
617 static void __update_extent_tree_range(struct inode *inode,
618 struct extent_info *tei, enum extent_type type)
620 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
621 struct extent_tree *et = F2FS_I(inode)->extent_tree[type];
622 struct extent_node *en = NULL, *en1 = NULL;
623 struct extent_node *prev_en = NULL, *next_en = NULL;
624 struct extent_info ei, dei, prev;
625 struct rb_node **insert_p = NULL, *insert_parent = NULL;
626 unsigned int fofs = tei->fofs, len = tei->len;
627 unsigned int end = fofs + len;
628 bool updated = false;
629 bool leftmost = false;
635 trace_f2fs_update_read_extent_tree_range(inode, fofs, len,
637 write_lock(&et->lock);
639 if (type == EX_READ) {
640 if (is_inode_flag_set(inode, FI_NO_EXTENT)) {
641 write_unlock(&et->lock);
649 * drop largest extent before lookup, in case it's already
650 * been shrunk from extent tree
652 __drop_largest_extent(et, fofs, len);
655 /* 1. lookup first extent node in range [fofs, fofs + len - 1] */
656 en = (struct extent_node *)f2fs_lookup_rb_tree_ret(&et->root,
657 (struct rb_entry *)et->cached_en, fofs,
658 (struct rb_entry **)&prev_en,
659 (struct rb_entry **)&next_en,
660 &insert_p, &insert_parent, false,
665 /* 2. invlidate all extent nodes in range [fofs, fofs + len - 1] */
666 while (en && en->ei.fofs < end) {
667 unsigned int org_end;
668 int parts = 0; /* # of parts current extent split into */
670 next_en = en1 = NULL;
673 org_end = dei.fofs + dei.len;
674 f2fs_bug_on(sbi, fofs >= org_end);
676 if (fofs > dei.fofs && (type != EX_READ ||
677 fofs - dei.fofs >= F2FS_MIN_EXTENT_LEN)) {
678 en->ei.len = fofs - en->ei.fofs;
683 if (end < org_end && (type != EX_READ ||
684 org_end - end >= F2FS_MIN_EXTENT_LEN)) {
686 __set_extent_info(&ei,
688 end - dei.fofs + dei.blk, false,
690 en1 = __insert_extent_tree(sbi, et, &ei,
694 __set_extent_info(&en->ei,
695 end, en->ei.len - (end - dei.fofs),
696 en->ei.blk + (end - dei.fofs), true,
704 struct rb_node *node = rb_next(&en->rb_node);
706 next_en = rb_entry_safe(node, struct extent_node,
711 __try_update_largest_extent(et, en);
713 __release_extent_node(sbi, et, en);
716 * if original extent is split into zero or two parts, extent
717 * tree has been altered by deletion or insertion, therefore
718 * invalidate pointers regard to tree.
722 insert_parent = NULL;
727 /* 3. update extent in read extent cache */
728 BUG_ON(type != EX_READ);
731 __set_extent_info(&ei, fofs, len, tei->blk, false, EX_READ);
732 if (!__try_merge_extent_node(sbi, et, &ei, prev_en, next_en))
733 __insert_extent_tree(sbi, et, &ei,
734 insert_p, insert_parent, leftmost);
736 /* give up extent_cache, if split and small updates happen */
738 prev.len < F2FS_MIN_EXTENT_LEN &&
739 et->largest.len < F2FS_MIN_EXTENT_LEN) {
741 et->largest_updated = true;
742 set_inode_flag(inode, FI_NO_EXTENT);
746 if (is_inode_flag_set(inode, FI_NO_EXTENT))
747 __free_extent_tree(sbi, et);
749 if (et->largest_updated) {
750 et->largest_updated = false;
754 write_unlock(&et->lock);
757 f2fs_mark_inode_dirty_sync(inode, true);
760 #ifdef CONFIG_F2FS_FS_COMPRESSION
761 void f2fs_update_read_extent_tree_range_compressed(struct inode *inode,
762 pgoff_t fofs, block_t blkaddr, unsigned int llen,
765 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
766 struct extent_tree *et = F2FS_I(inode)->extent_tree[EX_READ];
767 struct extent_node *en = NULL;
768 struct extent_node *prev_en = NULL, *next_en = NULL;
769 struct extent_info ei;
770 struct rb_node **insert_p = NULL, *insert_parent = NULL;
771 bool leftmost = false;
773 trace_f2fs_update_read_extent_tree_range(inode, fofs, llen,
776 /* it is safe here to check FI_NO_EXTENT w/o et->lock in ro image */
777 if (is_inode_flag_set(inode, FI_NO_EXTENT))
780 write_lock(&et->lock);
782 en = (struct extent_node *)f2fs_lookup_rb_tree_ret(&et->root,
783 (struct rb_entry *)et->cached_en, fofs,
784 (struct rb_entry **)&prev_en,
785 (struct rb_entry **)&next_en,
786 &insert_p, &insert_parent, false,
791 __set_extent_info(&ei, fofs, llen, blkaddr, true, EX_READ);
794 if (!__try_merge_extent_node(sbi, et, &ei, prev_en, next_en))
795 __insert_extent_tree(sbi, et, &ei,
796 insert_p, insert_parent, leftmost);
798 write_unlock(&et->lock);
802 static void __update_extent_cache(struct dnode_of_data *dn, enum extent_type type)
804 struct extent_info ei;
806 if (!__may_extent_tree(dn->inode, type))
809 ei.fofs = f2fs_start_bidx_of_node(ofs_of_node(dn->node_page), dn->inode) +
813 if (type == EX_READ) {
814 if (dn->data_blkaddr == NEW_ADDR)
817 ei.blk = dn->data_blkaddr;
819 __update_extent_tree_range(dn->inode, &ei, type);
822 static unsigned int __shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink,
823 enum extent_type type)
825 struct extent_tree_info *eti = &sbi->extent_tree[type];
826 struct extent_tree *et, *next;
827 struct extent_node *en;
828 unsigned int node_cnt = 0, tree_cnt = 0;
831 if (!atomic_read(&eti->total_zombie_tree))
834 if (!mutex_trylock(&eti->extent_tree_lock))
837 /* 1. remove unreferenced extent tree */
838 list_for_each_entry_safe(et, next, &eti->zombie_list, list) {
839 if (atomic_read(&et->node_cnt)) {
840 write_lock(&et->lock);
841 node_cnt += __free_extent_tree(sbi, et);
842 write_unlock(&et->lock);
844 f2fs_bug_on(sbi, atomic_read(&et->node_cnt));
845 list_del_init(&et->list);
846 radix_tree_delete(&eti->extent_tree_root, et->ino);
847 kmem_cache_free(extent_tree_slab, et);
848 atomic_dec(&eti->total_ext_tree);
849 atomic_dec(&eti->total_zombie_tree);
852 if (node_cnt + tree_cnt >= nr_shrink)
856 mutex_unlock(&eti->extent_tree_lock);
859 /* 2. remove LRU extent entries */
860 if (!mutex_trylock(&eti->extent_tree_lock))
863 remained = nr_shrink - (node_cnt + tree_cnt);
865 spin_lock(&eti->extent_lock);
866 for (; remained > 0; remained--) {
867 if (list_empty(&eti->extent_list))
869 en = list_first_entry(&eti->extent_list,
870 struct extent_node, list);
872 if (!write_trylock(&et->lock)) {
873 /* refresh this extent node's position in extent list */
874 list_move_tail(&en->list, &eti->extent_list);
878 list_del_init(&en->list);
879 spin_unlock(&eti->extent_lock);
881 __detach_extent_node(sbi, et, en);
883 write_unlock(&et->lock);
885 spin_lock(&eti->extent_lock);
887 spin_unlock(&eti->extent_lock);
890 mutex_unlock(&eti->extent_tree_lock);
892 trace_f2fs_shrink_extent_tree(sbi, node_cnt, tree_cnt, type);
894 return node_cnt + tree_cnt;
897 /* read extent cache operations */
898 bool f2fs_lookup_read_extent_cache(struct inode *inode, pgoff_t pgofs,
899 struct extent_info *ei)
901 if (!__may_extent_tree(inode, EX_READ))
904 return __lookup_extent_tree(inode, pgofs, ei, EX_READ);
907 void f2fs_update_read_extent_cache(struct dnode_of_data *dn)
909 return __update_extent_cache(dn, EX_READ);
912 void f2fs_update_read_extent_cache_range(struct dnode_of_data *dn,
913 pgoff_t fofs, block_t blkaddr, unsigned int len)
915 struct extent_info ei = {
921 if (!__may_extent_tree(dn->inode, EX_READ))
924 __update_extent_tree_range(dn->inode, &ei, EX_READ);
927 unsigned int f2fs_shrink_read_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink)
929 if (!test_opt(sbi, READ_EXTENT_CACHE))
932 return __shrink_extent_tree(sbi, nr_shrink, EX_READ);
935 static unsigned int __destroy_extent_node(struct inode *inode,
936 enum extent_type type)
938 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
939 struct extent_tree *et = F2FS_I(inode)->extent_tree[type];
940 unsigned int node_cnt = 0;
942 if (!et || !atomic_read(&et->node_cnt))
945 write_lock(&et->lock);
946 node_cnt = __free_extent_tree(sbi, et);
947 write_unlock(&et->lock);
952 void f2fs_destroy_extent_node(struct inode *inode)
954 __destroy_extent_node(inode, EX_READ);
957 static void __drop_extent_tree(struct inode *inode, enum extent_type type)
959 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
960 struct extent_tree *et = F2FS_I(inode)->extent_tree[type];
961 bool updated = false;
963 if (!__may_extent_tree(inode, type))
966 write_lock(&et->lock);
967 __free_extent_tree(sbi, et);
968 if (type == EX_READ) {
969 set_inode_flag(inode, FI_NO_EXTENT);
970 if (et->largest.len) {
975 write_unlock(&et->lock);
977 f2fs_mark_inode_dirty_sync(inode, true);
980 void f2fs_drop_extent_tree(struct inode *inode)
982 __drop_extent_tree(inode, EX_READ);
985 static void __destroy_extent_tree(struct inode *inode, enum extent_type type)
987 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
988 struct extent_tree_info *eti = &sbi->extent_tree[type];
989 struct extent_tree *et = F2FS_I(inode)->extent_tree[type];
990 unsigned int node_cnt = 0;
995 if (inode->i_nlink && !is_bad_inode(inode) &&
996 atomic_read(&et->node_cnt)) {
997 mutex_lock(&eti->extent_tree_lock);
998 list_add_tail(&et->list, &eti->zombie_list);
999 atomic_inc(&eti->total_zombie_tree);
1000 mutex_unlock(&eti->extent_tree_lock);
1004 /* free all extent info belong to this extent tree */
1005 node_cnt = __destroy_extent_node(inode, type);
1007 /* delete extent tree entry in radix tree */
1008 mutex_lock(&eti->extent_tree_lock);
1009 f2fs_bug_on(sbi, atomic_read(&et->node_cnt));
1010 radix_tree_delete(&eti->extent_tree_root, inode->i_ino);
1011 kmem_cache_free(extent_tree_slab, et);
1012 atomic_dec(&eti->total_ext_tree);
1013 mutex_unlock(&eti->extent_tree_lock);
1015 F2FS_I(inode)->extent_tree[type] = NULL;
1017 trace_f2fs_destroy_extent_tree(inode, node_cnt, type);
1020 void f2fs_destroy_extent_tree(struct inode *inode)
1022 __destroy_extent_tree(inode, EX_READ);
1025 static void __init_extent_tree_info(struct extent_tree_info *eti)
1027 INIT_RADIX_TREE(&eti->extent_tree_root, GFP_NOIO);
1028 mutex_init(&eti->extent_tree_lock);
1029 INIT_LIST_HEAD(&eti->extent_list);
1030 spin_lock_init(&eti->extent_lock);
1031 atomic_set(&eti->total_ext_tree, 0);
1032 INIT_LIST_HEAD(&eti->zombie_list);
1033 atomic_set(&eti->total_zombie_tree, 0);
1034 atomic_set(&eti->total_ext_node, 0);
1037 void f2fs_init_extent_cache_info(struct f2fs_sb_info *sbi)
1039 __init_extent_tree_info(&sbi->extent_tree[EX_READ]);
1042 int __init f2fs_create_extent_cache(void)
1044 extent_tree_slab = f2fs_kmem_cache_create("f2fs_extent_tree",
1045 sizeof(struct extent_tree));
1046 if (!extent_tree_slab)
1048 extent_node_slab = f2fs_kmem_cache_create("f2fs_extent_node",
1049 sizeof(struct extent_node));
1050 if (!extent_node_slab) {
1051 kmem_cache_destroy(extent_tree_slab);
1057 void f2fs_destroy_extent_cache(void)
1059 kmem_cache_destroy(extent_node_slab);
1060 kmem_cache_destroy(extent_tree_slab);