blob: 92868e1a48ca363573de30f0f27abc071c18909a [file] [log] [blame]
Ryusuke Konishiae980432018-09-04 15:46:30 -07001/* SPDX-License-Identifier: GPL-2.0+ */
Koji Sato17c76b02009-04-06 19:01:24 -07002/*
Ryusuke Konishi94ee1d92021-11-08 18:35:01 -08003 * NILFS B-tree.
Koji Sato17c76b02009-04-06 19:01:24 -07004 *
5 * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
6 *
Ryusuke Konishi4b420ab2016-05-23 16:23:09 -07007 * Written by Koji Sato.
Koji Sato17c76b02009-04-06 19:01:24 -07008 */
9
10#ifndef _NILFS_BTREE_H
11#define _NILFS_BTREE_H
12
13#include <linux/types.h>
14#include <linux/buffer_head.h>
15#include <linux/list.h>
Ryusuke Konishie63e88b2016-08-02 14:05:30 -070016#include <linux/nilfs2_ondisk.h> /* nilfs_btree_node */
Koji Sato17c76b02009-04-06 19:01:24 -070017#include "btnode.h"
18#include "bmap.h"
19
Koji Sato17c76b02009-04-06 19:01:24 -070020/**
Li Hong41c88bd2010-04-06 00:54:11 +080021 * struct nilfs_btree_path - A path on which B-tree operations are executed
22 * @bp_bh: buffer head of node block
23 * @bp_sib_bh: buffer head of sibling node block
24 * @bp_index: index of child node
25 * @bp_oldreq: ptr end request for old ptr
26 * @bp_newreq: ptr alloc request for new ptr
27 * @bp_op: rebalance operation
28 */
29struct nilfs_btree_path {
30 struct buffer_head *bp_bh;
31 struct buffer_head *bp_sib_bh;
32 int bp_index;
33 union nilfs_bmap_ptr_req bp_oldreq;
34 union nilfs_bmap_ptr_req bp_newreq;
35 struct nilfs_btnode_chkey_ctxt bp_ctxt;
Ryusuke Konishie7c274f2010-07-10 19:09:49 +090036 void (*bp_op)(struct nilfs_bmap *, struct nilfs_btree_path *,
Li Hong41c88bd2010-04-06 00:54:11 +080037 int, __u64 *, __u64 *);
38};
Koji Sato17c76b02009-04-06 19:01:24 -070039
40#define NILFS_BTREE_ROOT_SIZE NILFS_BMAP_SIZE
41#define NILFS_BTREE_ROOT_NCHILDREN_MAX \
42 ((NILFS_BTREE_ROOT_SIZE - sizeof(struct nilfs_btree_node)) / \
43 (sizeof(__le64 /* dkey */) + sizeof(__le64 /* dptr */)))
44#define NILFS_BTREE_ROOT_NCHILDREN_MIN 0
45#define NILFS_BTREE_NODE_EXTRA_PAD_SIZE (sizeof(__le64))
46#define NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) \
47 (((nodesize) - sizeof(struct nilfs_btree_node) - \
48 NILFS_BTREE_NODE_EXTRA_PAD_SIZE) / \
49 (sizeof(__le64 /* dkey */) + sizeof(__le64 /* dptr */)))
50#define NILFS_BTREE_NODE_NCHILDREN_MIN(nodesize) \
51 ((NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) - 1) / 2 + 1)
52#define NILFS_BTREE_KEY_MIN ((__u64)0)
53#define NILFS_BTREE_KEY_MAX (~(__u64)0)
54
Li Hong41c88bd2010-04-06 00:54:11 +080055extern struct kmem_cache *nilfs_btree_path_cache;
Koji Sato17c76b02009-04-06 19:01:24 -070056
Ryusuke Konishi30333422009-05-24 00:09:44 +090057int nilfs_btree_init(struct nilfs_bmap *);
Koji Sato17c76b02009-04-06 19:01:24 -070058int nilfs_btree_convert_and_insert(struct nilfs_bmap *, __u64, __u64,
Ryusuke Konishi30333422009-05-24 00:09:44 +090059 const __u64 *, const __u64 *, int);
Koji Sato17c76b02009-04-06 19:01:24 -070060void nilfs_btree_init_gc(struct nilfs_bmap *);
61
Ryusuke Konishi1d5385b2010-07-16 23:52:40 +090062int nilfs_btree_broken_node_block(struct buffer_head *bh);
63
Koji Sato17c76b02009-04-06 19:01:24 -070064#endif /* _NILFS_BTREE_H */