1 #ifndef _BCACHEFS_BTREE_CACHE_H
2 #define _BCACHEFS_BTREE_CACHE_H
5 #include "btree_types.h"
10 extern const char * const bch2_btree_ids[];
12 void bch2_recalc_btree_reserve(struct bch_fs *);
14 void bch2_btree_node_hash_remove(struct btree_cache *, struct btree *);
15 int __bch2_btree_node_hash_insert(struct btree_cache *, struct btree *);
16 int bch2_btree_node_hash_insert(struct btree_cache *, struct btree *,
17 unsigned, enum btree_id);
19 void bch2_btree_cache_cannibalize_unlock(struct bch_fs *);
20 int bch2_btree_cache_cannibalize_lock(struct bch_fs *, struct closure *);
22 struct btree *bch2_btree_node_mem_alloc(struct bch_fs *);
24 struct btree *bch2_btree_node_get(struct bch_fs *, struct btree_iter *,
25 const struct bkey_i *, unsigned,
28 struct btree *bch2_btree_node_get_sibling(struct bch_fs *, struct btree_iter *,
30 enum btree_node_sibling);
32 void bch2_btree_node_prefetch(struct bch_fs *, const struct bkey_i *,
33 unsigned, enum btree_id);
35 void bch2_fs_btree_cache_exit(struct bch_fs *);
36 int bch2_fs_btree_cache_init(struct bch_fs *);
37 void bch2_fs_btree_cache_init_early(struct btree_cache *);
39 #define PTR_HASH(_k) (bkey_i_to_extent_c(_k)->v._data[0])
41 /* is btree node in hash table? */
42 static inline bool btree_node_hashed(struct btree *b)
44 return bkey_extent_is_data(&b->key.k) && PTR_HASH(&b->key);
47 #define for_each_cached_btree(_b, _c, _tbl, _iter, _pos) \
48 for ((_tbl) = rht_dereference_rcu((_c)->btree_cache.table.tbl, \
49 &(_c)->btree_cache.table), \
50 _iter = 0; _iter < (_tbl)->size; _iter++) \
51 rht_for_each_entry_rcu((_b), (_pos), _tbl, _iter, hash)
53 static inline size_t btree_bytes(struct bch_fs *c)
55 return c->opts.btree_node_size << 9;
58 static inline size_t btree_max_u64s(struct bch_fs *c)
60 return (btree_bytes(c) - sizeof(struct btree_node)) / sizeof(u64);
63 static inline size_t btree_page_order(struct bch_fs *c)
65 return get_order(btree_bytes(c));
68 static inline size_t btree_pages(struct bch_fs *c)
70 return 1 << btree_page_order(c);
73 static inline unsigned btree_blocks(struct bch_fs *c)
75 return c->opts.btree_node_size >> c->block_bits;
78 #define BTREE_SPLIT_THRESHOLD(c) (btree_blocks(c) * 3 / 4)
80 #define BTREE_FOREGROUND_MERGE_THRESHOLD(c) (btree_max_u64s(c) * 1 / 3)
81 #define BTREE_FOREGROUND_MERGE_HYSTERESIS(c) \
82 (BTREE_FOREGROUND_MERGE_THRESHOLD(c) + \
83 (BTREE_FOREGROUND_MERGE_THRESHOLD(c) << 2))
85 #define btree_node_root(_c, _b) ((_c)->btree_roots[(_b)->btree_id].b)
87 int bch2_print_btree_node(struct bch_fs *, struct btree *,
90 #endif /* _BCACHEFS_BTREE_CACHE_H */