Lines Matching refs:btree

14 struct btree;
18 static inline void set_btree_node_dirty_acct(struct bch_fs *c, struct btree *b)  in set_btree_node_dirty_acct()
24 static inline void clear_btree_node_dirty_acct(struct bch_fs *c, struct btree *b)  in clear_btree_node_dirty_acct()
39 	struct btree		*b;
58 void bch2_btree_node_io_unlock(struct btree *);
59 void bch2_btree_node_io_lock(struct btree *);
60 void __bch2_btree_node_wait_on_read(struct btree *);
61 void __bch2_btree_node_wait_on_write(struct btree *);
62 void bch2_btree_node_wait_on_read(struct btree *);
63 void bch2_btree_node_wait_on_write(struct btree *);
70 bool bch2_compact_whiteouts(struct bch_fs *, struct btree *,
73 static inline bool should_compact_bset_lazy(struct btree *b,  in should_compact_bset_lazy()
82 static inline bool bch2_maybe_compact_whiteouts(struct bch_fs *c, struct btree *b)  in bch2_maybe_compact_whiteouts()
122 void bch2_btree_sort_into(struct bch_fs *, struct btree *, struct btree *);
124 void bch2_btree_node_drop_keys_outside_node(struct btree *);
126 void bch2_btree_build_aux_trees(struct btree *);
127 void bch2_btree_init_next(struct btree_trans *, struct btree *);
130 			      struct btree *, bool, bool *);
131 void bch2_btree_node_read(struct btree_trans *, struct btree *, bool);
135 bool bch2_btree_post_write_cleanup(struct bch_fs *, struct btree *);
144 void __bch2_btree_node_write(struct bch_fs *, struct btree *, unsigned);
145 void bch2_btree_node_write(struct bch_fs *, struct btree *,
147 void bch2_btree_node_write_trans(struct btree_trans *, struct btree *,
150 static inline void btree_node_write_if_need(struct btree_trans *trans, struct btree *b,  in btree_node_write_if_need()