152 static inline bool btree_node_ ## flag(struct btree *b)			\
153 {	return test_bit(BTREE_NODE_ ## flag, &b->flags); }		\
155 static inline void set_btree_node_ ## flag(struct btree *b)		\
156 {	set_bit(BTREE_NODE_ ## flag, &b->flags); }
170 static inline struct btree_write *btree_current_write(struct btree *b)  in btree_current_write()  argument
172 	return b->writes + btree_node_write_idx(b);  in btree_current_write()
175 static inline struct btree_write *btree_prev_write(struct btree *b)  in btree_prev_write()  argument
177 	return b->writes + (btree_node_write_idx(b) ^ 1);  in btree_prev_write()
180 static inline struct bset *btree_bset_first(struct btree *b)  in btree_bset_first()  argument
182 	return b->keys.set->data;  in btree_bset_first()
185 static inline struct bset *btree_bset_last(struct btree *b)  in btree_bset_last()  argument
187 	return bset_tree_last(&b->keys)->data;  in btree_bset_last()
190 static inline unsigned int bset_block_offset(struct btree *b, struct bset *i)  in bset_block_offset()  argument
192 	return bset_sector_offset(&b->keys, i) >> b->c->block_bits;  in bset_block_offset()
204 #define for_each_cached_btree(b, c, iter)				\  argument
208 		hlist_for_each_entry_rcu((b), (c)->bucket_hash + iter, hash)
248 static inline void rw_lock(bool w, struct btree *b, int level)  in rw_lock()  argument
250 	w ? down_write_nested(&b->lock, level + 1)  in rw_lock()
251 	  : down_read_nested(&b->lock, level + 1);  in rw_lock()
253 		b->seq++;  in rw_lock()
256 static inline void rw_unlock(bool w, struct btree *b)  in rw_unlock()  argument
259 		b->seq++;  in rw_unlock()
260 	(w ? up_write : up_read)(&b->lock);  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);
275 int bch_btree_insert_check_key(struct btree *b, struct btree_op *op,
328 #define bcache_btree(fn, key, b, op, ...)				\  argument
330 	int _r, l = (b)->level - 1;					\
332 	struct btree *_child = bch_btree_node_get((b)->c, op, key, l,	\
333 						  _w, b);		\
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,