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