^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) * btree.c - NILFS B-tree.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) * Written by Koji Sato.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include <linux/string.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include <linux/errno.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #include <linux/pagevec.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include "nilfs.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include "page.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include "btnode.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include "btree.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) #include "alloc.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) #include "dat.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) static void __nilfs_btree_init(struct nilfs_bmap *bmap);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) static struct nilfs_btree_path *nilfs_btree_alloc_path(void)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) int level = NILFS_BTREE_LEVEL_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) path = kmem_cache_alloc(nilfs_btree_path_cache, GFP_NOFS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) for (; level < NILFS_BTREE_LEVEL_MAX; level++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) path[level].bp_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) path[level].bp_index = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) path[level].bp_op = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) return path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) static void nilfs_btree_free_path(struct nilfs_btree_path *path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) int level = NILFS_BTREE_LEVEL_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) for (; level < NILFS_BTREE_LEVEL_MAX; level++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) brelse(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) kmem_cache_free(nilfs_btree_path_cache, path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) * B-tree node operations
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) static int nilfs_btree_get_new_block(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) __u64 ptr, struct buffer_head **bhp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) struct address_space *btnc = &NILFS_BMAP_I(btree)->i_btnode_cache;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) bh = nilfs_btnode_create_block(btnc, ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) if (!bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) set_buffer_nilfs_volatile(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) *bhp = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) static int nilfs_btree_node_get_flags(const struct nilfs_btree_node *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) return node->bn_flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) nilfs_btree_node_set_flags(struct nilfs_btree_node *node, int flags)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) node->bn_flags = flags;
^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) static int nilfs_btree_node_root(const struct nilfs_btree_node *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) return nilfs_btree_node_get_flags(node) & NILFS_BTREE_NODE_ROOT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) static int nilfs_btree_node_get_level(const struct nilfs_btree_node *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) return node->bn_level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) nilfs_btree_node_set_level(struct nilfs_btree_node *node, int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) node->bn_level = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) static int nilfs_btree_node_get_nchildren(const struct nilfs_btree_node *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) return le16_to_cpu(node->bn_nchildren);
^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) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) node->bn_nchildren = cpu_to_le16(nchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) static int nilfs_btree_node_size(const struct nilfs_bmap *btree)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) return i_blocksize(btree->b_inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) static int nilfs_btree_nchildren_per_block(const struct nilfs_bmap *btree)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) return btree->b_nchildren_per_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) static __le64 *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) nilfs_btree_node_dkeys(const struct nilfs_btree_node *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) return (__le64 *)((char *)(node + 1) +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) (nilfs_btree_node_root(node) ?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) 0 : NILFS_BTREE_NODE_EXTRA_PAD_SIZE));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) static __le64 *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) static __u64
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) nilfs_btree_node_get_key(const struct nilfs_btree_node *node, int index)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) return le64_to_cpu(*(nilfs_btree_node_dkeys(node) + index));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) nilfs_btree_node_set_key(struct nilfs_btree_node *node, int index, __u64 key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) *(nilfs_btree_node_dkeys(node) + index) = cpu_to_le64(key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) static __u64
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) nilfs_btree_node_get_ptr(const struct nilfs_btree_node *node, int index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) int ncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) nilfs_btree_node_set_ptr(struct nilfs_btree_node *node, int index, __u64 ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) int ncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) *(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr);
^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) static void nilfs_btree_node_init(struct nilfs_btree_node *node, int flags,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) int level, int nchildren, int ncmax,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) const __u64 *keys, const __u64 *ptrs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) __le64 *dkeys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) __le64 *dptrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) nilfs_btree_node_set_flags(node, flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) nilfs_btree_node_set_level(node, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) nilfs_btree_node_set_nchildren(node, nchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) dkeys = nilfs_btree_node_dkeys(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) dptrs = nilfs_btree_node_dptrs(node, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) for (i = 0; i < nchildren; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) dkeys[i] = cpu_to_le64(keys[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) dptrs[i] = cpu_to_le64(ptrs[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) /* Assume the buffer heads corresponding to left and right are locked. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) static void nilfs_btree_node_move_left(struct nilfs_btree_node *left,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) struct nilfs_btree_node *right,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) int n, int lncmax, int rncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) __le64 *ldkeys, *rdkeys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) __le64 *ldptrs, *rdptrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) int lnchildren, rnchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) ldkeys = nilfs_btree_node_dkeys(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) ldptrs = nilfs_btree_node_dptrs(left, lncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) lnchildren = nilfs_btree_node_get_nchildren(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) rdkeys = nilfs_btree_node_dkeys(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) rdptrs = nilfs_btree_node_dptrs(right, rncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) rnchildren = nilfs_btree_node_get_nchildren(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) memcpy(ldkeys + lnchildren, rdkeys, n * sizeof(*rdkeys));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) memcpy(ldptrs + lnchildren, rdptrs, n * sizeof(*rdptrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) memmove(rdkeys, rdkeys + n, (rnchildren - n) * sizeof(*rdkeys));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) memmove(rdptrs, rdptrs + n, (rnchildren - n) * sizeof(*rdptrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) lnchildren += n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) rnchildren -= n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) nilfs_btree_node_set_nchildren(left, lnchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) nilfs_btree_node_set_nchildren(right, rnchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) /* Assume that the buffer heads corresponding to left and right are locked. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) static void nilfs_btree_node_move_right(struct nilfs_btree_node *left,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) struct nilfs_btree_node *right,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) int n, int lncmax, int rncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) __le64 *ldkeys, *rdkeys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) __le64 *ldptrs, *rdptrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) int lnchildren, rnchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) ldkeys = nilfs_btree_node_dkeys(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) ldptrs = nilfs_btree_node_dptrs(left, lncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) lnchildren = nilfs_btree_node_get_nchildren(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) rdkeys = nilfs_btree_node_dkeys(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) rdptrs = nilfs_btree_node_dptrs(right, rncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) rnchildren = nilfs_btree_node_get_nchildren(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) memmove(rdkeys + n, rdkeys, rnchildren * sizeof(*rdkeys));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) memmove(rdptrs + n, rdptrs, rnchildren * sizeof(*rdptrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) memcpy(rdkeys, ldkeys + lnchildren - n, n * sizeof(*rdkeys));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) memcpy(rdptrs, ldptrs + lnchildren - n, n * sizeof(*rdptrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) lnchildren -= n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) rnchildren += n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) nilfs_btree_node_set_nchildren(left, lnchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) nilfs_btree_node_set_nchildren(right, rnchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) /* Assume that the buffer head corresponding to node is locked. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) static void nilfs_btree_node_insert(struct nilfs_btree_node *node, int index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) __u64 key, __u64 ptr, int ncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) __le64 *dkeys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) __le64 *dptrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) int nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) dkeys = nilfs_btree_node_dkeys(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) dptrs = nilfs_btree_node_dptrs(node, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) if (index < nchildren) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) memmove(dkeys + index + 1, dkeys + index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) (nchildren - index) * sizeof(*dkeys));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) memmove(dptrs + index + 1, dptrs + index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) (nchildren - index) * sizeof(*dptrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) dkeys[index] = cpu_to_le64(key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) dptrs[index] = cpu_to_le64(ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) nchildren++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) nilfs_btree_node_set_nchildren(node, nchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) /* Assume that the buffer head corresponding to node is locked. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) static void nilfs_btree_node_delete(struct nilfs_btree_node *node, int index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) __u64 *keyp, __u64 *ptrp, int ncmax)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) __u64 key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) __le64 *dkeys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) __le64 *dptrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) int nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) dkeys = nilfs_btree_node_dkeys(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) dptrs = nilfs_btree_node_dptrs(node, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) key = le64_to_cpu(dkeys[index]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) ptr = le64_to_cpu(dptrs[index]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) if (keyp != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) *keyp = key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) if (ptrp != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) *ptrp = ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) if (index < nchildren - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) memmove(dkeys + index, dkeys + index + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) (nchildren - index - 1) * sizeof(*dkeys));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) memmove(dptrs + index, dptrs + index + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) (nchildren - index - 1) * sizeof(*dptrs));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) nchildren--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) nilfs_btree_node_set_nchildren(node, nchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) static int nilfs_btree_node_lookup(const struct nilfs_btree_node *node,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) __u64 key, int *indexp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) __u64 nkey;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) int index, low, high, s;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) /* binary search */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) low = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) high = nilfs_btree_node_get_nchildren(node) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) index = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) s = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) while (low <= high) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) index = (low + high) / 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) nkey = nilfs_btree_node_get_key(node, index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) if (nkey == key) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) s = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) } else if (nkey < key) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) low = index + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) s = -1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) high = index - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) s = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) /* adjust index */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317) if (nilfs_btree_node_get_level(node) > NILFS_BTREE_LEVEL_NODE_MIN) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) if (s > 0 && index > 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) index--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) } else if (s < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) *indexp = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) return s == 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) * nilfs_btree_node_broken - verify consistency of btree node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) * @node: btree node block to be examined
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) * @size: node size (in bytes)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) * @inode: host inode of btree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) * @blocknr: block number
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) * Return Value: If node is broken, 1 is returned. Otherwise, 0 is returned.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) static int nilfs_btree_node_broken(const struct nilfs_btree_node *node,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) size_t size, struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) sector_t blocknr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) int level, flags, nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) int ret = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) flags = nilfs_btree_node_get_flags(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) level >= NILFS_BTREE_LEVEL_MAX ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) (flags & NILFS_BTREE_NODE_ROOT) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) nchildren < 0 ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) nilfs_crit(inode->i_sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) "bad btree node (ino=%lu, blocknr=%llu): level = %d, flags = 0x%x, nchildren = %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) inode->i_ino, (unsigned long long)blocknr, level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) flags, nchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) ret = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) * nilfs_btree_root_broken - verify consistency of btree root node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) * @node: btree root node to be examined
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) * @inode: host inode of btree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) * Return Value: If node is broken, 1 is returned. Otherwise, 0 is returned.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) static int nilfs_btree_root_broken(const struct nilfs_btree_node *node,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) struct inode *inode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) int level, flags, nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) int ret = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) flags = nilfs_btree_node_get_flags(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) if (unlikely(level < NILFS_BTREE_LEVEL_NODE_MIN ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) level >= NILFS_BTREE_LEVEL_MAX ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) nchildren < 0 ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) nilfs_crit(inode->i_sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) "bad btree root (ino=%lu): level = %d, flags = 0x%x, nchildren = %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) inode->i_ino, level, flags, nchildren);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) ret = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) int nilfs_btree_broken_node_block(struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) struct inode *inode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) if (buffer_nilfs_checked(bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) inode = bh->b_page->mapping->host;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) ret = nilfs_btree_node_broken((struct nilfs_btree_node *)bh->b_data,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) bh->b_size, inode, bh->b_blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) if (likely(!ret))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) set_buffer_nilfs_checked(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) static struct nilfs_btree_node *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) nilfs_btree_get_root(const struct nilfs_bmap *btree)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) return (struct nilfs_btree_node *)btree->b_u.u_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) static struct nilfs_btree_node *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) nilfs_btree_get_nonroot_node(const struct nilfs_btree_path *path, int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) return (struct nilfs_btree_node *)path[level].bp_bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) static struct nilfs_btree_node *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) nilfs_btree_get_sib_node(const struct nilfs_btree_path *path, int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) return (struct nilfs_btree_node *)path[level].bp_sib_bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) static int nilfs_btree_height(const struct nilfs_bmap *btree)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) return nilfs_btree_node_get_level(nilfs_btree_get_root(btree)) + 1;
^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) static struct nilfs_btree_node *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) nilfs_btree_get_node(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) const struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) int level, int *ncmaxp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) if (level == nilfs_btree_height(btree) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) *ncmaxp = NILFS_BTREE_ROOT_NCHILDREN_MAX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) *ncmaxp = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) return node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) static int nilfs_btree_bad_node(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) struct nilfs_btree_node *node, int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) if (unlikely(nilfs_btree_node_get_level(node) != level)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) dump_stack();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) nilfs_crit(btree->b_inode->i_sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) "btree level mismatch (ino=%lu): %d != %d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) btree->b_inode->i_ino,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) nilfs_btree_node_get_level(node), level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) return 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) struct nilfs_btree_readahead_info {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) struct nilfs_btree_node *node; /* parent node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) int max_ra_blocks; /* max nof blocks to read ahead */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) int index; /* current index on the parent node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) int ncmax; /* nof children in the parent node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) static int __nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) struct buffer_head **bhp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) const struct nilfs_btree_readahead_info *ra)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) struct address_space *btnc = &NILFS_BMAP_I(btree)->i_btnode_cache;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) struct buffer_head *bh, *ra_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) sector_t submit_ptr = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) ret = nilfs_btnode_submit_block(btnc, ptr, 0, REQ_OP_READ, 0, &bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) &submit_ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) if (ret) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) if (ret != -EEXIST)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) goto out_check;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) if (ra) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) int i, n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) __u64 ptr2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) /* read ahead sibling nodes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) for (n = ra->max_ra_blocks, i = ra->index + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) n > 0 && i < ra->ncmax; n--, i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) ret = nilfs_btnode_submit_block(btnc, ptr2, 0,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) REQ_OP_READ, REQ_RAHEAD,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497) &ra_bh, &submit_ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) if (likely(!ret || ret == -EEXIST))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) brelse(ra_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) else if (ret != -EBUSY)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) if (!buffer_locked(bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) goto out_no_wait;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) wait_on_buffer(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) out_no_wait:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510) if (!buffer_uptodate(bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) nilfs_err(btree->b_inode->i_sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) "I/O error reading b-tree node block (ino=%lu, blocknr=%llu)",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513) btree->b_inode->i_ino, (unsigned long long)ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) out_check:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519) if (nilfs_btree_broken_node_block(bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) clear_buffer_uptodate(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525) *bhp = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) return 0;
^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 int nilfs_btree_get_block(const struct nilfs_bmap *btree, __u64 ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530) struct buffer_head **bhp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) return __nilfs_btree_get_block(btree, ptr, bhp, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) static int nilfs_btree_do_lookup(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) __u64 key, __u64 *ptrp, int minlevel,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538) int readahead)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) struct nilfs_btree_readahead_info p, *ra;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) int level, index, found, ncmax, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547) if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) return -ENOENT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) found = nilfs_btree_node_lookup(node, key, &index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) ptr = nilfs_btree_node_get_ptr(node, index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) path[level].bp_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) path[level].bp_index = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) ncmax = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558) while (--level >= minlevel) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) ra = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560) if (level == NILFS_BTREE_LEVEL_NODE_MIN && readahead) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) p.node = nilfs_btree_get_node(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) &p.ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) p.index = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564) p.max_ra_blocks = 7;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565) ra = &p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) ret = __nilfs_btree_get_block(btree, ptr, &path[level].bp_bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) ra);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) if (nilfs_btree_bad_node(btree, node, level))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575) if (!found)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) found = nilfs_btree_node_lookup(node, key, &index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 578) index = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 579) if (index < ncmax) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 580) ptr = nilfs_btree_node_get_ptr(node, index, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582) WARN_ON(found || level != NILFS_BTREE_LEVEL_NODE_MIN);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) /* insert */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) ptr = NILFS_BMAP_INVALID_PTR;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586) path[level].bp_index = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588) if (!found)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589) return -ENOENT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) if (ptrp != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592) *ptrp = ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597) static int nilfs_btree_do_lookup_last(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603) int index, level, ncmax, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) index = nilfs_btree_node_get_nchildren(node) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607) if (index < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608) return -ENOENT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610) ptr = nilfs_btree_node_get_ptr(node, index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612) path[level].bp_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613) path[level].bp_index = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614) ncmax = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616) for (level--; level > 0; level--) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617) ret = nilfs_btree_get_block(btree, ptr, &path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621) if (nilfs_btree_bad_node(btree, node, level))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) index = nilfs_btree_node_get_nchildren(node) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624) ptr = nilfs_btree_node_get_ptr(node, index, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) path[level].bp_index = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 627)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 628) if (keyp != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 629) *keyp = nilfs_btree_node_get_key(node, index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630) if (ptrp != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631) *ptrp = ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637) * nilfs_btree_get_next_key - get next valid key from btree path array
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) * @btree: bmap struct of btree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639) * @path: array of nilfs_btree_path struct
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640) * @minlevel: start level
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641) * @nextkey: place to store the next valid key
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643) * Return Value: If a next key was found, 0 is returned. Otherwise,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644) * -ENOENT is returned.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646) static int nilfs_btree_get_next_key(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647) const struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648) int minlevel, __u64 *nextkey)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651) int maxlevel = nilfs_btree_height(btree) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652) int index, next_adj, level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654) /* Next index is already set to bp_index for leaf nodes. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) next_adj = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656) for (level = minlevel; level <= maxlevel; level++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) if (level == maxlevel)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662) index = path[level].bp_index + next_adj;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663) if (index < nilfs_btree_node_get_nchildren(node)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664) /* Next key is in this node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665) *nextkey = nilfs_btree_node_get_key(node, index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668) /* For non-leaf nodes, next index is stored at bp_index + 1. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669) next_adj = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671) return -ENOENT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 674) static int nilfs_btree_lookup(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 675) __u64 key, int level, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 676) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684) ret = nilfs_btree_do_lookup(btree, path, key, ptrp, level, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 691) static int nilfs_btree_lookup_contig(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 692) __u64 key, __u64 *ptrp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 693) unsigned int maxblocks)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) struct inode *dat = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698) __u64 ptr, ptr2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699) sector_t blocknr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700) int level = NILFS_BTREE_LEVEL_NODE_MIN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701) int ret, cnt, index, maxlevel, ncmax;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702) struct nilfs_btree_readahead_info p;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708) ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712) if (NILFS_BMAP_USE_VBN(btree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) dat = nilfs_bmap_get_dat(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) ret = nilfs_dat_translate(dat, ptr, &blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 715) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 716) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 717) ptr = blocknr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 718) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 719) cnt = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 720) if (cnt == maxblocks)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 721) goto end;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 722)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 723) maxlevel = nilfs_btree_height(btree) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 724) node = nilfs_btree_get_node(btree, path, level, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 725) index = path[level].bp_index + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 726) for (;;) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 727) while (index < nilfs_btree_node_get_nchildren(node)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 728) if (nilfs_btree_node_get_key(node, index) !=
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 729) key + cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 730) goto end;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 731) ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 732) if (dat) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 733) ret = nilfs_dat_translate(dat, ptr2, &blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 734) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 735) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 736) ptr2 = blocknr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 737) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 738) if (ptr2 != ptr + cnt || ++cnt == maxblocks)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 739) goto end;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 740) index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 741) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 742) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 743) if (level == maxlevel)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 744) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 745)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 746) /* look-up right sibling node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 747) p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 748) p.index = path[level + 1].bp_index + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 749) p.max_ra_blocks = 7;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 750) if (p.index >= nilfs_btree_node_get_nchildren(p.node) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 751) nilfs_btree_node_get_key(p.node, p.index) != key + cnt)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 752) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 753) ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 754) path[level + 1].bp_index = p.index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 755)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 756) brelse(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 757) path[level].bp_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 758)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 759) ret = __nilfs_btree_get_block(btree, ptr2, &path[level].bp_bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 760) &p);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 761) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 762) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 763) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 764) ncmax = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 765) index = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 766) path[level].bp_index = index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 767) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 768) end:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 769) *ptrp = ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 770) ret = cnt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 771) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 772) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 773) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 774) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 775)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 776) static void nilfs_btree_promote_key(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 777) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 778) int level, __u64 key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 779) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 780) if (level < nilfs_btree_height(btree) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 781) do {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 782) nilfs_btree_node_set_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 783) nilfs_btree_get_nonroot_node(path, level),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 784) path[level].bp_index, key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 785) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 786) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 787) } while ((path[level].bp_index == 0) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 788) (++level < nilfs_btree_height(btree) - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 789) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 790)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 791) /* root */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 792) if (level == nilfs_btree_height(btree) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 793) nilfs_btree_node_set_key(nilfs_btree_get_root(btree),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 794) path[level].bp_index, key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 795) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 796) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 797)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 798) static void nilfs_btree_do_insert(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 799) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 800) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 801) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 802) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 803) int ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 804)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 805) if (level < nilfs_btree_height(btree) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 806) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 807) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 808) nilfs_btree_node_insert(node, path[level].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 809) *keyp, *ptrp, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 810) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 811) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 812)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 813) if (path[level].bp_index == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 814) nilfs_btree_promote_key(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 815) nilfs_btree_node_get_key(node,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 816) 0));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 817) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 818) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 819) nilfs_btree_node_insert(node, path[level].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 820) *keyp, *ptrp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 821) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 822) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 823) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 824)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 825) static void nilfs_btree_carry_left(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 826) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 827) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 828) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 829) struct nilfs_btree_node *node, *left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 830) int nchildren, lnchildren, n, move, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 831)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 832) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 833) left = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 834) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 835) lnchildren = nilfs_btree_node_get_nchildren(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 836) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 837) move = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 838)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 839) n = (nchildren + lnchildren + 1) / 2 - lnchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 840) if (n > path[level].bp_index) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 841) /* move insert point */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 842) n--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 843) move = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 844) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 845)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 846) nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 847)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 848) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 849) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 850) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 851) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 852)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 853) nilfs_btree_promote_key(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 854) nilfs_btree_node_get_key(node, 0));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 855)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 856) if (move) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 857) brelse(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 858) path[level].bp_bh = path[level].bp_sib_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 859) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 860) path[level].bp_index += lnchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 861) path[level + 1].bp_index--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 862) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 863) brelse(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 864) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 865) path[level].bp_index -= n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 866) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 867)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 868) nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 869) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 870)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 871) static void nilfs_btree_carry_right(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 872) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 873) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 874) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 875) struct nilfs_btree_node *node, *right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 876) int nchildren, rnchildren, n, move, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 877)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 878) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 879) right = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 880) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 881) rnchildren = nilfs_btree_node_get_nchildren(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 882) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 883) move = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 884)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 885) n = (nchildren + rnchildren + 1) / 2 - rnchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 886) if (n > nchildren - path[level].bp_index) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 887) /* move insert point */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 888) n--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 889) move = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 890) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 891)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 892) nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 893)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 894) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 895) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 896) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 897) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 898)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 899) path[level + 1].bp_index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 900) nilfs_btree_promote_key(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 901) nilfs_btree_node_get_key(right, 0));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 902) path[level + 1].bp_index--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 903)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 904) if (move) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 905) brelse(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 906) path[level].bp_bh = path[level].bp_sib_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 907) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 908) path[level].bp_index -= nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 909) path[level + 1].bp_index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 910) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 911) brelse(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 912) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 913) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 914)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 915) nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 916) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 917)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 918) static void nilfs_btree_split(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 919) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 920) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 921) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 922) struct nilfs_btree_node *node, *right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 923) int nchildren, n, move, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 924)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 925) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 926) right = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 927) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 928) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 929) move = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 930)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 931) n = (nchildren + 1) / 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 932) if (n > nchildren - path[level].bp_index) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 933) n--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 934) move = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 935) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 936)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 937) nilfs_btree_node_move_right(node, right, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 938)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 939) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 940) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 941) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 942) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 943)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 944) if (move) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 945) path[level].bp_index -= nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 946) nilfs_btree_node_insert(right, path[level].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 947) *keyp, *ptrp, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 948)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 949) *keyp = nilfs_btree_node_get_key(right, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 950) *ptrp = path[level].bp_newreq.bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 951)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 952) brelse(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 953) path[level].bp_bh = path[level].bp_sib_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 954) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 955) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 956) nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 957)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 958) *keyp = nilfs_btree_node_get_key(right, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 959) *ptrp = path[level].bp_newreq.bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 960)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 961) brelse(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 962) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 963) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 964)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 965) path[level + 1].bp_index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 966) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 967)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 968) static void nilfs_btree_grow(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 969) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 970) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 971) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 972) struct nilfs_btree_node *root, *child;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 973) int n, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 974)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 975) root = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 976) child = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 977) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 978)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 979) n = nilfs_btree_node_get_nchildren(root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 980)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 981) nilfs_btree_node_move_right(root, child, n,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 982) NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 983) nilfs_btree_node_set_level(root, level + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 984)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 985) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 986) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 987)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 988) path[level].bp_bh = path[level].bp_sib_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 989) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 990)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 991) nilfs_btree_do_insert(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 992)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 993) *keyp = nilfs_btree_node_get_key(child, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 994) *ptrp = path[level].bp_newreq.bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 995) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 996)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 997) static __u64 nilfs_btree_find_near(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 998) const struct nilfs_btree_path *path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 999) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1000) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1001) int level, ncmax;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1002)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1003) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1004) return NILFS_BMAP_INVALID_PTR;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1005)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1006) /* left sibling */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1007) level = NILFS_BTREE_LEVEL_NODE_MIN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1008) if (path[level].bp_index > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1009) node = nilfs_btree_get_node(btree, path, level, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1010) return nilfs_btree_node_get_ptr(node,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1011) path[level].bp_index - 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1012) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1013) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1014)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1015) /* parent */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1016) level = NILFS_BTREE_LEVEL_NODE_MIN + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1017) if (level <= nilfs_btree_height(btree) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1018) node = nilfs_btree_get_node(btree, path, level, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1019) return nilfs_btree_node_get_ptr(node, path[level].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1020) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1021) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1022)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1023) return NILFS_BMAP_INVALID_PTR;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1024) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1025)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1026) static __u64 nilfs_btree_find_target_v(const struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1027) const struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1028) __u64 key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1029) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1030) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1031)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1032) ptr = nilfs_bmap_find_target_seq(btree, key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1033) if (ptr != NILFS_BMAP_INVALID_PTR)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1034) /* sequential access */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1035) return ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1036)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1037) ptr = nilfs_btree_find_near(btree, path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1038) if (ptr != NILFS_BMAP_INVALID_PTR)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1039) /* near */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1040) return ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1041)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1042) /* block group */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1043) return nilfs_bmap_find_target_in_group(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1044) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1045)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1046) static int nilfs_btree_prepare_insert(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1047) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1048) int *levelp, __u64 key, __u64 ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1049) struct nilfs_bmap_stats *stats)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1050) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1051) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1052) struct nilfs_btree_node *node, *parent, *sib;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1053) __u64 sibptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1054) int pindex, level, ncmax, ncblk, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1055) struct inode *dat = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1056)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1057) stats->bs_nblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1058) level = NILFS_BTREE_LEVEL_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1059)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1060) /* allocate a new ptr for data block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1061) if (NILFS_BMAP_USE_VBN(btree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1062) path[level].bp_newreq.bpr_ptr =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1063) nilfs_btree_find_target_v(btree, path, key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1064) dat = nilfs_bmap_get_dat(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1065) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1066)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1067) ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1068) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1069) goto err_out_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1070)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1071) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1072)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1073) for (level = NILFS_BTREE_LEVEL_NODE_MIN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1074) level < nilfs_btree_height(btree) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1075) level++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1076) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1077) if (nilfs_btree_node_get_nchildren(node) < ncblk) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1078) path[level].bp_op = nilfs_btree_do_insert;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1079) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1080) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1081) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1082)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1083) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1084) pindex = path[level + 1].bp_index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1085)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1086) /* left sibling */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1087) if (pindex > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1088) sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1089) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1090) ret = nilfs_btree_get_block(btree, sibptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1091) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1092) goto err_out_child_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1093) sib = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1094) if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1095) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1096) path[level].bp_op = nilfs_btree_carry_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1097) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1098) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1099) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1100) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1101) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1102) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1103)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1104) /* right sibling */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1105) if (pindex < nilfs_btree_node_get_nchildren(parent) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1106) sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1107) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1108) ret = nilfs_btree_get_block(btree, sibptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1109) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1110) goto err_out_child_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1111) sib = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1112) if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1113) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1114) path[level].bp_op = nilfs_btree_carry_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1115) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1116) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1117) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1118) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1119) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1120) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1121)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1122) /* split */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1123) path[level].bp_newreq.bpr_ptr =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1124) path[level - 1].bp_newreq.bpr_ptr + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1125) ret = nilfs_bmap_prepare_alloc_ptr(btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1126) &path[level].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1127) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1128) goto err_out_child_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1129) ret = nilfs_btree_get_new_block(btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1130) path[level].bp_newreq.bpr_ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1131) &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1132) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1133) goto err_out_curr_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1134)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1135) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1136)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1137) sib = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1138) nilfs_btree_node_init(sib, 0, level, 0, ncblk, NULL, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1139) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1140) path[level].bp_op = nilfs_btree_split;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1141) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1142)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1143) /* root */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1144) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1145) if (nilfs_btree_node_get_nchildren(node) <
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1146) NILFS_BTREE_ROOT_NCHILDREN_MAX) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1147) path[level].bp_op = nilfs_btree_do_insert;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1148) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1149) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1150) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1152) /* grow */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1153) path[level].bp_newreq.bpr_ptr = path[level - 1].bp_newreq.bpr_ptr + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1154) ret = nilfs_bmap_prepare_alloc_ptr(btree, &path[level].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1155) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1156) goto err_out_child_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1157) ret = nilfs_btree_get_new_block(btree, path[level].bp_newreq.bpr_ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1158) &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1159) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1160) goto err_out_curr_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1161)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1162) nilfs_btree_node_init((struct nilfs_btree_node *)bh->b_data,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1163) 0, level, 0, ncblk, NULL, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1164) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1165) path[level].bp_op = nilfs_btree_grow;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1166)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1167) level++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1168) path[level].bp_op = nilfs_btree_do_insert;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1169)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1170) /* a newly-created node block and a data block are added */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1171) stats->bs_nblocks += 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1172)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1173) /* success */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1174) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1175) *levelp = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1176) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1177)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1178) /* error */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1179) err_out_curr_node:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1180) nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1181) err_out_child_node:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1182) for (level--; level > NILFS_BTREE_LEVEL_DATA; level--) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1183) nilfs_btnode_delete(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1184) nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1185)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1186) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1187)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1188) nilfs_bmap_abort_alloc_ptr(btree, &path[level].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1189) err_out_data:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1190) *levelp = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1191) stats->bs_nblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1192) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1193) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1194)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1195) static void nilfs_btree_commit_insert(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1196) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1197) int maxlevel, __u64 key, __u64 ptr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1198) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1199) struct inode *dat = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1200) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1201)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1202) set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1203) ptr = path[NILFS_BTREE_LEVEL_DATA].bp_newreq.bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1204) if (NILFS_BMAP_USE_VBN(btree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1205) nilfs_bmap_set_target_v(btree, key, ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1206) dat = nilfs_bmap_get_dat(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1207) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1208)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1209) for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1210) nilfs_bmap_commit_alloc_ptr(btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1211) &path[level - 1].bp_newreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1212) path[level].bp_op(btree, path, level, &key, &ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1213) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1214)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1215) if (!nilfs_bmap_dirty(btree))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1216) nilfs_bmap_set_dirty(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1217) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1218)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1219) static int nilfs_btree_insert(struct nilfs_bmap *btree, __u64 key, __u64 ptr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1220) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1221) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1222) struct nilfs_bmap_stats stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1223) int level, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1224)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1225) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1226) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1227) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1228)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1229) ret = nilfs_btree_do_lookup(btree, path, key, NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1230) NILFS_BTREE_LEVEL_NODE_MIN, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1231) if (ret != -ENOENT) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1232) if (ret == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1233) ret = -EEXIST;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1234) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1235) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1236)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1237) ret = nilfs_btree_prepare_insert(btree, path, &level, key, ptr, &stats);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1238) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1239) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1240) nilfs_btree_commit_insert(btree, path, level, key, ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1241) nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1242)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1243) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1244) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1245) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1246) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1247)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1248) static void nilfs_btree_do_delete(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1249) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1250) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1251) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1252) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1253) int ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1254)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1255) if (level < nilfs_btree_height(btree) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1256) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1257) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1258) nilfs_btree_node_delete(node, path[level].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1259) keyp, ptrp, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1260) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1261) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1262) if (path[level].bp_index == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1263) nilfs_btree_promote_key(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1264) nilfs_btree_node_get_key(node, 0));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1265) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1266) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1267) nilfs_btree_node_delete(node, path[level].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1268) keyp, ptrp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1269) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1270) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1271) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1272)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1273) static void nilfs_btree_borrow_left(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1274) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1275) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1276) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1277) struct nilfs_btree_node *node, *left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1278) int nchildren, lnchildren, n, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1279)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1280) nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1281)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1282) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1283) left = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1284) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1285) lnchildren = nilfs_btree_node_get_nchildren(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1286) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1287)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1288) n = (nchildren + lnchildren) / 2 - nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1289)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1290) nilfs_btree_node_move_right(left, node, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1291)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1292) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1293) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1294) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1295) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1296)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1297) nilfs_btree_promote_key(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1298) nilfs_btree_node_get_key(node, 0));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1299)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1300) brelse(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1301) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1302) path[level].bp_index += n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1303) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1304)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1305) static void nilfs_btree_borrow_right(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1306) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1307) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1308) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1309) struct nilfs_btree_node *node, *right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1310) int nchildren, rnchildren, n, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1311)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1312) nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1313)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1314) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1315) right = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1316) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1317) rnchildren = nilfs_btree_node_get_nchildren(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1318) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1319)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1320) n = (nchildren + rnchildren) / 2 - nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1321)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1322) nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1323)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1324) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1325) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1326) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1327) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1328)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1329) path[level + 1].bp_index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1330) nilfs_btree_promote_key(btree, path, level + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1331) nilfs_btree_node_get_key(right, 0));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1332) path[level + 1].bp_index--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1333)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1334) brelse(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1335) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1336) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1337)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1338) static void nilfs_btree_concat_left(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1339) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1340) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1341) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1342) struct nilfs_btree_node *node, *left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1343) int n, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1344)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1345) nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1346)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1347) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1348) left = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1349) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1350)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1351) n = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1352)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1353) nilfs_btree_node_move_left(left, node, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1354)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1355) if (!buffer_dirty(path[level].bp_sib_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1356) mark_buffer_dirty(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1357)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1358) nilfs_btnode_delete(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1359) path[level].bp_bh = path[level].bp_sib_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1360) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1361) path[level].bp_index += nilfs_btree_node_get_nchildren(left);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1362) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1363)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1364) static void nilfs_btree_concat_right(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1365) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1366) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1367) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1368) struct nilfs_btree_node *node, *right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1369) int n, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1370)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1371) nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1372)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1373) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1374) right = nilfs_btree_get_sib_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1375) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1376)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1377) n = nilfs_btree_node_get_nchildren(right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1378)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1379) nilfs_btree_node_move_left(node, right, n, ncblk, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1380)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1381) if (!buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1382) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1383)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1384) nilfs_btnode_delete(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1385) path[level].bp_sib_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1386) path[level + 1].bp_index++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1387) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1388)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1389) static void nilfs_btree_shrink(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1390) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1391) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1392) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1393) struct nilfs_btree_node *root, *child;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1394) int n, ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1395)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1396) nilfs_btree_do_delete(btree, path, level, keyp, ptrp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1398) root = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1399) child = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1400) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1401)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1402) nilfs_btree_node_delete(root, 0, NULL, NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1403) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1404) nilfs_btree_node_set_level(root, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1405) n = nilfs_btree_node_get_nchildren(child);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1406) nilfs_btree_node_move_left(root, child, n,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1407) NILFS_BTREE_ROOT_NCHILDREN_MAX, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1408)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1409) nilfs_btnode_delete(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1410) path[level].bp_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1411) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1412)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1413) static void nilfs_btree_nop(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1414) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1415) int level, __u64 *keyp, __u64 *ptrp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1416) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1417) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1418)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1419) static int nilfs_btree_prepare_delete(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1420) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1421) int *levelp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1422) struct nilfs_bmap_stats *stats,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1423) struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1424) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1425) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1426) struct nilfs_btree_node *node, *parent, *sib;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1427) __u64 sibptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1428) int pindex, dindex, level, ncmin, ncmax, ncblk, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1429)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1430) ret = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1431) stats->bs_nblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1432) ncmin = NILFS_BTREE_NODE_NCHILDREN_MIN(nilfs_btree_node_size(btree));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1433) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1434)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1435) for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1436) level < nilfs_btree_height(btree) - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1437) level++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1438) node = nilfs_btree_get_nonroot_node(path, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1439) path[level].bp_oldreq.bpr_ptr =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1440) nilfs_btree_node_get_ptr(node, dindex, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1441) ret = nilfs_bmap_prepare_end_ptr(btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1442) &path[level].bp_oldreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1443) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1444) goto err_out_child_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1445)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1446) if (nilfs_btree_node_get_nchildren(node) > ncmin) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1447) path[level].bp_op = nilfs_btree_do_delete;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1448) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1449) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1450) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1451)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1452) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1453) pindex = path[level + 1].bp_index;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1454) dindex = pindex;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1455)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1456) if (pindex > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1457) /* left sibling */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1458) sibptr = nilfs_btree_node_get_ptr(parent, pindex - 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1459) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1460) ret = nilfs_btree_get_block(btree, sibptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1461) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1462) goto err_out_curr_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1463) sib = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1464) if (nilfs_btree_node_get_nchildren(sib) > ncmin) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1465) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1466) path[level].bp_op = nilfs_btree_borrow_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1467) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1468) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1469) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1470) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1471) path[level].bp_op = nilfs_btree_concat_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1472) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1473) /* continue; */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1474) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1475) } else if (pindex <
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1476) nilfs_btree_node_get_nchildren(parent) - 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1477) /* right sibling */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1478) sibptr = nilfs_btree_node_get_ptr(parent, pindex + 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1479) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1480) ret = nilfs_btree_get_block(btree, sibptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1481) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1482) goto err_out_curr_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1483) sib = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1484) if (nilfs_btree_node_get_nchildren(sib) > ncmin) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1485) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1486) path[level].bp_op = nilfs_btree_borrow_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1487) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1488) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1489) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1490) path[level].bp_sib_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1491) path[level].bp_op = nilfs_btree_concat_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1492) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1493) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1494) * When merging right sibling node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1495) * into the current node, pointer to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1496) * the right sibling node must be
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1497) * terminated instead. The adjustment
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1498) * below is required for that.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1499) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1500) dindex = pindex + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1501) /* continue; */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1502) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1503) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1504) /* no siblings */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1505) /* the only child of the root node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1506) WARN_ON(level != nilfs_btree_height(btree) - 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1507) if (nilfs_btree_node_get_nchildren(node) - 1 <=
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1508) NILFS_BTREE_ROOT_NCHILDREN_MAX) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1509) path[level].bp_op = nilfs_btree_shrink;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1510) stats->bs_nblocks += 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1511) level++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1512) path[level].bp_op = nilfs_btree_nop;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1513) goto shrink_root_child;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1514) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1515) path[level].bp_op = nilfs_btree_do_delete;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1516) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1517) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1518) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1519) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1520) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1521)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1522) /* child of the root node is deleted */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1523) path[level].bp_op = nilfs_btree_do_delete;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1524) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1525)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1526) shrink_root_child:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1527) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1528) path[level].bp_oldreq.bpr_ptr =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1529) nilfs_btree_node_get_ptr(node, dindex,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1530) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1531)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1532) ret = nilfs_bmap_prepare_end_ptr(btree, &path[level].bp_oldreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1533) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1534) goto err_out_child_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1535)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1536) /* success */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1537) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1538) *levelp = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1539) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1540)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1541) /* error */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1542) err_out_curr_node:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1543) nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1544) err_out_child_node:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1545) for (level--; level >= NILFS_BTREE_LEVEL_NODE_MIN; level--) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1546) brelse(path[level].bp_sib_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1547) nilfs_bmap_abort_end_ptr(btree, &path[level].bp_oldreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1548) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1549) *levelp = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1550) stats->bs_nblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1551) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1552) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1553)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1554) static void nilfs_btree_commit_delete(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1555) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1556) int maxlevel, struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1557) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1558) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1559)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1560) for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1561) nilfs_bmap_commit_end_ptr(btree, &path[level].bp_oldreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1562) path[level].bp_op(btree, path, level, NULL, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1563) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1564)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1565) if (!nilfs_bmap_dirty(btree))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1566) nilfs_bmap_set_dirty(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1567) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1568)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1569) static int nilfs_btree_delete(struct nilfs_bmap *btree, __u64 key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1570)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1571) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1572) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1573) struct nilfs_bmap_stats stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1574) struct inode *dat;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1575) int level, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1576)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1577) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1578) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1579) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1580)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1581) ret = nilfs_btree_do_lookup(btree, path, key, NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1582) NILFS_BTREE_LEVEL_NODE_MIN, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1583) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1584) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1585)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1586)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1587) dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1588)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1589) ret = nilfs_btree_prepare_delete(btree, path, &level, &stats, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1590) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1591) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1592) nilfs_btree_commit_delete(btree, path, level, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1593) nilfs_inode_sub_blocks(btree->b_inode, stats.bs_nblocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1594)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1595) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1596) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1597) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1598) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1599)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1600) static int nilfs_btree_seek_key(const struct nilfs_bmap *btree, __u64 start,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1601) __u64 *keyp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1602) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1603) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1604) const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1605) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1606)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1607) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1608) if (!path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1609) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1610)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1611) ret = nilfs_btree_do_lookup(btree, path, start, NULL, minlevel, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1612) if (!ret)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1613) *keyp = start;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1614) else if (ret == -ENOENT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1615) ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1616)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1617) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1618) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1619) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1620)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1621) static int nilfs_btree_last_key(const struct nilfs_bmap *btree, __u64 *keyp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1622) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1623) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1624) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1625)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1626) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1627) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1628) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1629)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1630) ret = nilfs_btree_do_lookup_last(btree, path, keyp, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1631)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1632) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1633)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1634) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1635) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1636)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1637) static int nilfs_btree_check_delete(struct nilfs_bmap *btree, __u64 key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1638) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1639) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1640) struct nilfs_btree_node *root, *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1641) __u64 maxkey, nextmaxkey;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1642) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1643) int nchildren, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1644)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1645) root = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1646) switch (nilfs_btree_height(btree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1647) case 2:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1648) bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1649) node = root;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1650) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1651) case 3:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1652) nchildren = nilfs_btree_node_get_nchildren(root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1653) if (nchildren > 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1654) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1655) ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1656) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1657) ret = nilfs_btree_get_block(btree, ptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1658) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1659) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1660) node = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1661) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1662) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1663) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1664) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1665)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1666) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1667) maxkey = nilfs_btree_node_get_key(node, nchildren - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1668) nextmaxkey = (nchildren > 1) ?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1669) nilfs_btree_node_get_key(node, nchildren - 2) : 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1670) if (bh != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1671) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1672)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1673) return (maxkey == key) && (nextmaxkey < NILFS_BMAP_LARGE_LOW);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1674) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1675)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1676) static int nilfs_btree_gather_data(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1677) __u64 *keys, __u64 *ptrs, int nitems)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1678) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1679) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1680) struct nilfs_btree_node *node, *root;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1681) __le64 *dkeys;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1682) __le64 *dptrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1683) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1684) int nchildren, ncmax, i, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1685)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1686) root = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1687) switch (nilfs_btree_height(btree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1688) case 2:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1689) bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1690) node = root;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1691) ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1692) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1693) case 3:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1694) nchildren = nilfs_btree_node_get_nchildren(root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1695) WARN_ON(nchildren > 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1696) ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1697) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1698) ret = nilfs_btree_get_block(btree, ptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1699) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1700) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1701) node = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1702) ncmax = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1703) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1704) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1705) node = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1706) return -EINVAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1707) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1708)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1709) nchildren = nilfs_btree_node_get_nchildren(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1710) if (nchildren < nitems)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1711) nitems = nchildren;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1712) dkeys = nilfs_btree_node_dkeys(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1713) dptrs = nilfs_btree_node_dptrs(node, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1714) for (i = 0; i < nitems; i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1715) keys[i] = le64_to_cpu(dkeys[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1716) ptrs[i] = le64_to_cpu(dptrs[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1717) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1718)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1719) if (bh != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1720) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1721)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1722) return nitems;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1723) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1724)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1725) static int
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1726) nilfs_btree_prepare_convert_and_insert(struct nilfs_bmap *btree, __u64 key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1727) union nilfs_bmap_ptr_req *dreq,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1728) union nilfs_bmap_ptr_req *nreq,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1729) struct buffer_head **bhp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1730) struct nilfs_bmap_stats *stats)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1731) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1732) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1733) struct inode *dat = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1734) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1735)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1736) stats->bs_nblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1737)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1738) /* for data */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1739) /* cannot find near ptr */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1740) if (NILFS_BMAP_USE_VBN(btree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1741) dreq->bpr_ptr = nilfs_btree_find_target_v(btree, NULL, key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1742) dat = nilfs_bmap_get_dat(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1743) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1744)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1745) ret = nilfs_bmap_prepare_alloc_ptr(btree, dreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1746) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1747) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1748)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1749) *bhp = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1750) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1751) if (nreq != NULL) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1752) nreq->bpr_ptr = dreq->bpr_ptr + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1753) ret = nilfs_bmap_prepare_alloc_ptr(btree, nreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1754) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1755) goto err_out_dreq;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1756)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1757) ret = nilfs_btree_get_new_block(btree, nreq->bpr_ptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1758) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1759) goto err_out_nreq;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1760)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1761) *bhp = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1762) stats->bs_nblocks++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1763) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1764)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1765) /* success */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1766) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1767)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1768) /* error */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1769) err_out_nreq:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1770) nilfs_bmap_abort_alloc_ptr(btree, nreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1771) err_out_dreq:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1772) nilfs_bmap_abort_alloc_ptr(btree, dreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1773) stats->bs_nblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1774) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1775)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1776) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1777)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1778) static void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1779) nilfs_btree_commit_convert_and_insert(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1780) __u64 key, __u64 ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1781) const __u64 *keys, const __u64 *ptrs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1782) int n,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1783) union nilfs_bmap_ptr_req *dreq,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1784) union nilfs_bmap_ptr_req *nreq,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1785) struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1786) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1787) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1788) struct inode *dat;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1789) __u64 tmpptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1790) int ncblk;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1791)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1792) /* free resources */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1793) if (btree->b_ops->bop_clear != NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1794) btree->b_ops->bop_clear(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1795)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1796) /* ptr must be a pointer to a buffer head. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1797) set_buffer_nilfs_volatile((struct buffer_head *)((unsigned long)ptr));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1798)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1799) /* convert and insert */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1800) dat = NILFS_BMAP_USE_VBN(btree) ? nilfs_bmap_get_dat(btree) : NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1801) __nilfs_btree_init(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1802) if (nreq != NULL) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1803) nilfs_bmap_commit_alloc_ptr(btree, dreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1804) nilfs_bmap_commit_alloc_ptr(btree, nreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1805)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1806) /* create child node at level 1 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1807) node = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1808) ncblk = nilfs_btree_nchildren_per_block(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1809) nilfs_btree_node_init(node, 0, 1, n, ncblk, keys, ptrs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1810) nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr, ncblk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1811) if (!buffer_dirty(bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1812) mark_buffer_dirty(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1813) if (!nilfs_bmap_dirty(btree))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1814) nilfs_bmap_set_dirty(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1815)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1816) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1817)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1818) /* create root node at level 2 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1819) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1820) tmpptr = nreq->bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1821) nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 2, 1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1822) NILFS_BTREE_ROOT_NCHILDREN_MAX,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1823) &keys[0], &tmpptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1824) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1825) nilfs_bmap_commit_alloc_ptr(btree, dreq, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1826)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1827) /* create root node at level 1 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1828) node = nilfs_btree_get_root(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1829) nilfs_btree_node_init(node, NILFS_BTREE_NODE_ROOT, 1, n,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1830) NILFS_BTREE_ROOT_NCHILDREN_MAX,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1831) keys, ptrs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1832) nilfs_btree_node_insert(node, n, key, dreq->bpr_ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1833) NILFS_BTREE_ROOT_NCHILDREN_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1834) if (!nilfs_bmap_dirty(btree))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1835) nilfs_bmap_set_dirty(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1836) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1837)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1838) if (NILFS_BMAP_USE_VBN(btree))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1839) nilfs_bmap_set_target_v(btree, key, dreq->bpr_ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1840) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1841)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1842) /**
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1843) * nilfs_btree_convert_and_insert -
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1844) * @bmap:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1845) * @key:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1846) * @ptr:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1847) * @keys:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1848) * @ptrs:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1849) * @n:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1850) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1851) int nilfs_btree_convert_and_insert(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1852) __u64 key, __u64 ptr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1853) const __u64 *keys, const __u64 *ptrs, int n)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1854) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1855) struct buffer_head *bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1856) union nilfs_bmap_ptr_req dreq, nreq, *di, *ni;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1857) struct nilfs_bmap_stats stats;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1858) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1859)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1860) if (n + 1 <= NILFS_BTREE_ROOT_NCHILDREN_MAX) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1861) di = &dreq;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1862) ni = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1863) } else if ((n + 1) <= NILFS_BTREE_NODE_NCHILDREN_MAX(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1864) nilfs_btree_node_size(btree))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1865) di = &dreq;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1866) ni = &nreq;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1867) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1868) di = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1869) ni = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1870) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1871) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1872)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1873) ret = nilfs_btree_prepare_convert_and_insert(btree, key, di, ni, &bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1874) &stats);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1875) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1876) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1877) nilfs_btree_commit_convert_and_insert(btree, key, ptr, keys, ptrs, n,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1878) di, ni, bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1879) nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1880) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1881) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1882)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1883) static int nilfs_btree_propagate_p(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1884) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1885) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1886) struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1887) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1888) while ((++level < nilfs_btree_height(btree) - 1) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1889) !buffer_dirty(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1890) mark_buffer_dirty(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1891)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1892) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1893) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1894)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1895) static int nilfs_btree_prepare_update_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1896) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1897) int level, struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1898) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1899) struct nilfs_btree_node *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1900) int ncmax, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1901)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1902) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1903) path[level].bp_oldreq.bpr_ptr =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1904) nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1905) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1906) path[level].bp_newreq.bpr_ptr = path[level].bp_oldreq.bpr_ptr + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1907) ret = nilfs_dat_prepare_update(dat, &path[level].bp_oldreq.bpr_req,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1908) &path[level].bp_newreq.bpr_req);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1909) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1910) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1911)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1912) if (buffer_nilfs_node(path[level].bp_bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1913) path[level].bp_ctxt.oldkey = path[level].bp_oldreq.bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1914) path[level].bp_ctxt.newkey = path[level].bp_newreq.bpr_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1915) path[level].bp_ctxt.bh = path[level].bp_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1916) ret = nilfs_btnode_prepare_change_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1917) &NILFS_BMAP_I(btree)->i_btnode_cache,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1918) &path[level].bp_ctxt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1919) if (ret < 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1920) nilfs_dat_abort_update(dat,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1921) &path[level].bp_oldreq.bpr_req,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1922) &path[level].bp_newreq.bpr_req);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1923) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1924) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1925) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1926)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1927) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1928) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1929)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1930) static void nilfs_btree_commit_update_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1931) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1932) int level, struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1933) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1934) struct nilfs_btree_node *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1935) int ncmax;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1936)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1937) nilfs_dat_commit_update(dat, &path[level].bp_oldreq.bpr_req,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1938) &path[level].bp_newreq.bpr_req,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1939) btree->b_ptr_type == NILFS_BMAP_PTR_VS);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1940)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1941) if (buffer_nilfs_node(path[level].bp_bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1942) nilfs_btnode_commit_change_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1943) &NILFS_BMAP_I(btree)->i_btnode_cache,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1944) &path[level].bp_ctxt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1945) path[level].bp_bh = path[level].bp_ctxt.bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1946) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1947) set_buffer_nilfs_volatile(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1948)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1949) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1950) nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1951) path[level].bp_newreq.bpr_ptr, ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1952) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1953)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1954) static void nilfs_btree_abort_update_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1955) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1956) int level, struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1957) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1958) nilfs_dat_abort_update(dat, &path[level].bp_oldreq.bpr_req,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1959) &path[level].bp_newreq.bpr_req);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1960) if (buffer_nilfs_node(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1961) nilfs_btnode_abort_change_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1962) &NILFS_BMAP_I(btree)->i_btnode_cache,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1963) &path[level].bp_ctxt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1964) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1965)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1966) static int nilfs_btree_prepare_propagate_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1967) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1968) int minlevel, int *maxlevelp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1969) struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1970) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1971) int level, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1972)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1973) level = minlevel;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1974) if (!buffer_nilfs_volatile(path[level].bp_bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1975) ret = nilfs_btree_prepare_update_v(btree, path, level, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1976) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1977) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1978) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1979) while ((++level < nilfs_btree_height(btree) - 1) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1980) !buffer_dirty(path[level].bp_bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1981)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1982) WARN_ON(buffer_nilfs_volatile(path[level].bp_bh));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1983) ret = nilfs_btree_prepare_update_v(btree, path, level, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1984) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1985) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1986) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1987)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1988) /* success */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1989) *maxlevelp = level - 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1990) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1991)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1992) /* error */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1993) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1994) while (--level > minlevel)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1995) nilfs_btree_abort_update_v(btree, path, level, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1996) if (!buffer_nilfs_volatile(path[level].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1997) nilfs_btree_abort_update_v(btree, path, level, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1998) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1999) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2000)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2001) static void nilfs_btree_commit_propagate_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2002) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2003) int minlevel, int maxlevel,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2004) struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2005) struct inode *dat)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2006) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2007) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2008)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2009) if (!buffer_nilfs_volatile(path[minlevel].bp_bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2010) nilfs_btree_commit_update_v(btree, path, minlevel, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2011)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2012) for (level = minlevel + 1; level <= maxlevel; level++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2013) nilfs_btree_commit_update_v(btree, path, level, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2014) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2015)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2016) static int nilfs_btree_propagate_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2017) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2018) int level, struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2019) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2020) int maxlevel = 0, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2021) struct nilfs_btree_node *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2022) struct inode *dat = nilfs_bmap_get_dat(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2023) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2024) int ncmax;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2025)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2026) get_bh(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2027) path[level].bp_bh = bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2028) ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2029) dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2030) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2031) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2032)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2033) if (buffer_nilfs_volatile(path[level].bp_bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2034) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2035) ptr = nilfs_btree_node_get_ptr(parent,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2036) path[level + 1].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2037) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2038) ret = nilfs_dat_mark_dirty(dat, ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2039) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2040) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2041) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2042)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2043) nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2044)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2045) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2046) brelse(path[level].bp_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2047) path[level].bp_bh = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2048) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2049) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2050)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2051) static int nilfs_btree_propagate(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2052) struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2053) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2054) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2055) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2056) __u64 key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2057) int level, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2058)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2059) WARN_ON(!buffer_dirty(bh));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2060)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2061) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2062) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2063) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2064)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2065) if (buffer_nilfs_node(bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2066) node = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2067) key = nilfs_btree_node_get_key(node, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2068) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2069) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2070) key = nilfs_bmap_data_get_key(btree, bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2071) level = NILFS_BTREE_LEVEL_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2072) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2073)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2074) ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2075) if (ret < 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2076) if (unlikely(ret == -ENOENT))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2077) nilfs_crit(btree->b_inode->i_sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2078) "writing node/leaf block does not appear in b-tree (ino=%lu) at key=%llu, level=%d",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2079) btree->b_inode->i_ino,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2080) (unsigned long long)key, level);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2081) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2082) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2083)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2084) ret = NILFS_BMAP_USE_VBN(btree) ?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2085) nilfs_btree_propagate_v(btree, path, level, bh) :
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2086) nilfs_btree_propagate_p(btree, path, level, bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2087)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2088) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2089) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2090)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2091) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2092) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2093)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2094) static int nilfs_btree_propagate_gc(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2095) struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2096) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2097) return nilfs_dat_mark_dirty(nilfs_bmap_get_dat(btree), bh->b_blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2098) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2099)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2100) static void nilfs_btree_add_dirty_buffer(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2101) struct list_head *lists,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2102) struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2103) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2104) struct list_head *head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2105) struct buffer_head *cbh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2106) struct nilfs_btree_node *node, *cnode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2107) __u64 key, ckey;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2108) int level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2109)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2110) get_bh(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2111) node = (struct nilfs_btree_node *)bh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2112) key = nilfs_btree_node_get_key(node, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2113) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2114) if (level < NILFS_BTREE_LEVEL_NODE_MIN ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2115) level >= NILFS_BTREE_LEVEL_MAX) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2116) dump_stack();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2117) nilfs_warn(btree->b_inode->i_sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2118) "invalid btree level: %d (key=%llu, ino=%lu, blocknr=%llu)",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2119) level, (unsigned long long)key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2120) btree->b_inode->i_ino,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2121) (unsigned long long)bh->b_blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2122) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2123) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2124)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2125) list_for_each(head, &lists[level]) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2126) cbh = list_entry(head, struct buffer_head, b_assoc_buffers);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2127) cnode = (struct nilfs_btree_node *)cbh->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2128) ckey = nilfs_btree_node_get_key(cnode, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2129) if (key < ckey)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2130) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2131) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2132) list_add_tail(&bh->b_assoc_buffers, head);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2133) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2134)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2135) static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2136) struct list_head *listp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2137) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2138) struct address_space *btcache = &NILFS_BMAP_I(btree)->i_btnode_cache;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2139) struct list_head lists[NILFS_BTREE_LEVEL_MAX];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2140) struct pagevec pvec;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2141) struct buffer_head *bh, *head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2142) pgoff_t index = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2143) int level, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2144)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2145) for (level = NILFS_BTREE_LEVEL_NODE_MIN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2146) level < NILFS_BTREE_LEVEL_MAX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2147) level++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2148) INIT_LIST_HEAD(&lists[level]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2149)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2150) pagevec_init(&pvec);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2152) while (pagevec_lookup_tag(&pvec, btcache, &index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2153) PAGECACHE_TAG_DIRTY)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2154) for (i = 0; i < pagevec_count(&pvec); i++) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2155) bh = head = page_buffers(pvec.pages[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2156) do {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2157) if (buffer_dirty(bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2158) nilfs_btree_add_dirty_buffer(btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2159) lists, bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2160) } while ((bh = bh->b_this_page) != head);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2161) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2162) pagevec_release(&pvec);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2163) cond_resched();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2164) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2165)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2166) for (level = NILFS_BTREE_LEVEL_NODE_MIN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2167) level < NILFS_BTREE_LEVEL_MAX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2168) level++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2169) list_splice_tail(&lists[level], listp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2170) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2171)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2172) static int nilfs_btree_assign_p(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2173) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2174) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2175) struct buffer_head **bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2176) sector_t blocknr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2177) union nilfs_binfo *binfo)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2178) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2179) struct nilfs_btree_node *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2180) __u64 key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2181) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2182) int ncmax, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2183)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2184) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2185) ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2186) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2187) if (buffer_nilfs_node(*bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2188) path[level].bp_ctxt.oldkey = ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2189) path[level].bp_ctxt.newkey = blocknr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2190) path[level].bp_ctxt.bh = *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2191) ret = nilfs_btnode_prepare_change_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2192) &NILFS_BMAP_I(btree)->i_btnode_cache,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2193) &path[level].bp_ctxt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2194) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2195) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2196) nilfs_btnode_commit_change_key(
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2197) &NILFS_BMAP_I(btree)->i_btnode_cache,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2198) &path[level].bp_ctxt);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2199) *bh = path[level].bp_ctxt.bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2200) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2201)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2202) nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2203) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2204)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2205) key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2206) /* on-disk format */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2207) binfo->bi_dat.bi_blkoff = cpu_to_le64(key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2208) binfo->bi_dat.bi_level = level;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2209)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2210) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2211) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2212)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2213) static int nilfs_btree_assign_v(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2214) struct nilfs_btree_path *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2215) int level,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2216) struct buffer_head **bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2217) sector_t blocknr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2218) union nilfs_binfo *binfo)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2219) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2220) struct nilfs_btree_node *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2221) struct inode *dat = nilfs_bmap_get_dat(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2222) __u64 key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2223) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2224) union nilfs_bmap_ptr_req req;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2225) int ncmax, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2226)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2227) parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2228) ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2229) ncmax);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2230) req.bpr_ptr = ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2231) ret = nilfs_dat_prepare_start(dat, &req.bpr_req);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2232) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2233) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2234) nilfs_dat_commit_start(dat, &req.bpr_req, blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2235)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2236) key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2237) /* on-disk format */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2238) binfo->bi_v.bi_vblocknr = cpu_to_le64(ptr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2239) binfo->bi_v.bi_blkoff = cpu_to_le64(key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2240)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2241) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2242) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2243)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2244) static int nilfs_btree_assign(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2245) struct buffer_head **bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2246) sector_t blocknr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2247) union nilfs_binfo *binfo)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2248) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2249) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2250) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2251) __u64 key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2252) int level, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2253)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2254) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2255) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2256) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2257)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2258) if (buffer_nilfs_node(*bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2259) node = (struct nilfs_btree_node *)(*bh)->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2260) key = nilfs_btree_node_get_key(node, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2261) level = nilfs_btree_node_get_level(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2262) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2263) key = nilfs_bmap_data_get_key(btree, *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2264) level = NILFS_BTREE_LEVEL_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2265) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2266)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2267) ret = nilfs_btree_do_lookup(btree, path, key, NULL, level + 1, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2268) if (ret < 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2269) WARN_ON(ret == -ENOENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2270) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2271) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2272)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2273) ret = NILFS_BMAP_USE_VBN(btree) ?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2274) nilfs_btree_assign_v(btree, path, level, bh, blocknr, binfo) :
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2275) nilfs_btree_assign_p(btree, path, level, bh, blocknr, binfo);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2276)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2277) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2278) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2279)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2280) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2281) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2282)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2283) static int nilfs_btree_assign_gc(struct nilfs_bmap *btree,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2284) struct buffer_head **bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2285) sector_t blocknr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2286) union nilfs_binfo *binfo)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2287) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2288) struct nilfs_btree_node *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2289) __u64 key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2290) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2291)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2292) ret = nilfs_dat_move(nilfs_bmap_get_dat(btree), (*bh)->b_blocknr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2293) blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2294) if (ret < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2295) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2296)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2297) if (buffer_nilfs_node(*bh)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2298) node = (struct nilfs_btree_node *)(*bh)->b_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2299) key = nilfs_btree_node_get_key(node, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2300) } else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2301) key = nilfs_bmap_data_get_key(btree, *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2302)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2303) /* on-disk format */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2304) binfo->bi_v.bi_vblocknr = cpu_to_le64((*bh)->b_blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2305) binfo->bi_v.bi_blkoff = cpu_to_le64(key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2306)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2307) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2308) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2309)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2310) static int nilfs_btree_mark(struct nilfs_bmap *btree, __u64 key, int level)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2311) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2312) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2313) struct nilfs_btree_path *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2314) __u64 ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2315) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2316)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2317) path = nilfs_btree_alloc_path();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2318) if (path == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2319) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2320)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2321) ret = nilfs_btree_do_lookup(btree, path, key, &ptr, level + 1, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2322) if (ret < 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2323) WARN_ON(ret == -ENOENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2324) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2325) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2326) ret = nilfs_btree_get_block(btree, ptr, &bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2327) if (ret < 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2328) WARN_ON(ret == -ENOENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2329) goto out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2330) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2331)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2332) if (!buffer_dirty(bh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2333) mark_buffer_dirty(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2334) brelse(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2335) if (!nilfs_bmap_dirty(btree))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2336) nilfs_bmap_set_dirty(btree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2337)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2338) out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2339) nilfs_btree_free_path(path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2340) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2341) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2342)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2343) static const struct nilfs_bmap_operations nilfs_btree_ops = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2344) .bop_lookup = nilfs_btree_lookup,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2345) .bop_lookup_contig = nilfs_btree_lookup_contig,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2346) .bop_insert = nilfs_btree_insert,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2347) .bop_delete = nilfs_btree_delete,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2348) .bop_clear = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2349)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2350) .bop_propagate = nilfs_btree_propagate,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2351)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2352) .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2353)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2354) .bop_assign = nilfs_btree_assign,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2355) .bop_mark = nilfs_btree_mark,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2356)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2357) .bop_seek_key = nilfs_btree_seek_key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2358) .bop_last_key = nilfs_btree_last_key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2359)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2360) .bop_check_insert = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2361) .bop_check_delete = nilfs_btree_check_delete,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2362) .bop_gather_data = nilfs_btree_gather_data,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2363) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2364)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2365) static const struct nilfs_bmap_operations nilfs_btree_ops_gc = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2366) .bop_lookup = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2367) .bop_lookup_contig = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2368) .bop_insert = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2369) .bop_delete = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2370) .bop_clear = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2371)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2372) .bop_propagate = nilfs_btree_propagate_gc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2373)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2374) .bop_lookup_dirty_buffers = nilfs_btree_lookup_dirty_buffers,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2375)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2376) .bop_assign = nilfs_btree_assign_gc,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2377) .bop_mark = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2378)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2379) .bop_seek_key = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2380) .bop_last_key = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2381)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2382) .bop_check_insert = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2383) .bop_check_delete = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2384) .bop_gather_data = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2385) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2386)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2387) static void __nilfs_btree_init(struct nilfs_bmap *bmap)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2388) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2389) bmap->b_ops = &nilfs_btree_ops;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2390) bmap->b_nchildren_per_block =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2391) NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2392) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2393)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2394) int nilfs_btree_init(struct nilfs_bmap *bmap)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2395) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2396) int ret = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2398) __nilfs_btree_init(bmap);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2399)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2400) if (nilfs_btree_root_broken(nilfs_btree_get_root(bmap), bmap->b_inode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2401) ret = -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2402) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2403) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2404)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2405) void nilfs_btree_init_gc(struct nilfs_bmap *bmap)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2406) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2407) bmap->b_ops = &nilfs_btree_ops_gc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2408) bmap->b_nchildren_per_block =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2409) NILFS_BTREE_NODE_NCHILDREN_MAX(nilfs_btree_node_size(bmap));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2410) }
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags