117 struct btree {  struct
127 	struct btree		*parent;  argument
152 static inline bool btree_node_ ## flag(struct btree *b)			\  argument
155 static inline void set_btree_node_ ## flag(struct btree *b)		\
170 static inline struct btree_write *btree_current_write(struct btree *b)  in btree_current_write()
175 static inline struct btree_write *btree_prev_write(struct btree *b)  in btree_prev_write()
180 static inline struct bset *btree_bset_first(struct btree *b)  in btree_bset_first()
185 static inline struct bset *btree_bset_last(struct btree *b)  in btree_bset_last()
190 static inline unsigned int bset_block_offset(struct btree *b, struct bset *i)  in bset_block_offset()
248 static inline void rw_lock(bool w, struct btree *b, int level)  in rw_lock()
256 static inline void rw_unlock(bool w, struct btree *b)  in rw_unlock()
263 void bch_btree_node_read_done(struct btree *b);
264 void __bch_btree_node_write(struct btree *b, struct closure *parent);
265 void bch_btree_node_write(struct btree *b, struct closure *parent);
267 void bch_btree_set_root(struct btree *b);
268 struct btree *__bch_btree_node_alloc(struct cache_set *c, struct btree_op *op,
270 				     struct btree *parent);
271 struct btree *bch_btree_node_get(struct cache_set *c, struct btree_op *op,
273 				 struct btree *parent);
275 int bch_btree_insert_check_key(struct btree *b, struct btree_op *op,
332 	struct btree *_child = bch_btree_node_get((b)->c, op, key, l,	\
352 		struct btree *_b = (c)->root;				\
377 typedef int (btree_map_nodes_fn)(struct btree_op *b_op, struct btree *b);
395 typedef int (btree_map_keys_fn)(struct btree_op *op, struct btree *b,
399 int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op,