116 #define btree(fn, key, b, op, ...)					\  macro
120 	struct btree *_child = bch_btree_node_get((b)->c, op, key, l,	\
140 		struct btree *_b = (c)->root;				\
157 static inline struct bset *write_block(struct btree *b)  in write_block()
162 static void bch_btree_init_next(struct btree *b)  in bch_btree_init_next()
189 static uint64_t btree_csum_set(struct btree *b, struct bset *i)  in btree_csum_set()
198 void bch_btree_node_read_done(struct btree *b)  in bch_btree_node_read_done()
287 static void bch_btree_node_read(struct btree *b)  in bch_btree_node_read()
325 static void btree_complete_write(struct btree *b, struct btree_write *w)  in btree_complete_write()
342 	struct btree *b = container_of(cl, struct btree, io);  in btree_node_write_unlock()
349 	struct btree *b = container_of(cl, struct btree, io);  in __btree_node_write_done()
364 	struct btree *b = container_of(cl, struct btree, io);  in btree_node_write_done()
377 	struct btree *b = container_of(cl, struct btree, io);  in btree_node_write_endio()
386 static void do_btree_node_write(struct btree *b)  in do_btree_node_write()
446 void __bch_btree_node_write(struct btree *b, struct closure *parent)  in __bch_btree_node_write()
477 void bch_btree_node_write(struct btree *b, struct closure *parent)  in bch_btree_node_write()
495 static void bch_btree_node_write_sync(struct btree *b)  in bch_btree_node_write_sync()
510 	struct btree *b = container_of(to_delayed_work(w), struct btree, work);  in btree_node_write_work()
518 static void bch_btree_leaf_dirty(struct btree *b, atomic_t *journal_ref)  in bch_btree_leaf_dirty()
562 static void mca_data_free(struct btree *b)  in mca_data_free()
572 static void mca_bucket_free(struct btree *b)  in mca_bucket_free()
586 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)  in mca_data_alloc()
600 static struct btree *mca_bucket_alloc(struct cache_set *c,  in mca_bucket_alloc()
603 	struct btree *b = kzalloc(sizeof(struct btree), gfp);  in mca_bucket_alloc()
620 static int mca_reap(struct btree *b, unsigned min_order, bool flush)  in mca_reap()
665 	struct btree *b, *t;  in bch_mca_scan()
708 		b = list_first_entry(&c->btree_cache, struct btree, list);  in bch_mca_scan()
741 	struct btree *b;  in bch_btree_cache_free()
761 		b = list_first_entry(&c->btree_cache, struct btree, list);  in bch_btree_cache_free()
772 				     struct btree, list);  in bch_btree_cache_free()
823 static struct btree *mca_find(struct cache_set *c, struct bkey *k)  in mca_find()
825 	struct btree *b;  in mca_find()
852 static struct btree *mca_cannibalize(struct cache_set *c, struct btree_op *op,  in mca_cannibalize()
855 	struct btree *b;  in mca_cannibalize()
888 static struct btree *mca_alloc(struct cache_set *c, struct btree_op *op,  in mca_alloc()
891 	struct btree *b;  in mca_alloc()
968 struct btree *bch_btree_node_get(struct cache_set *c, struct btree_op *op,  in bch_btree_node_get()
970 				 struct btree *parent)  in bch_btree_node_get()
973 	struct btree *b;  in bch_btree_node_get()
1026 static void btree_node_prefetch(struct btree *parent, struct bkey *k)  in btree_node_prefetch()
1028 	struct btree *b;  in btree_node_prefetch()
1043 static void btree_node_free(struct btree *b)  in btree_node_free()
1065 struct btree *__bch_btree_node_alloc(struct cache_set *c, struct btree_op *op,  in __bch_btree_node_alloc()
1067 				     struct btree *parent)  in __bch_btree_node_alloc()
1070 	struct btree *b = ERR_PTR(-EAGAIN);  in __bch_btree_node_alloc()
1107 static struct btree *bch_btree_node_alloc(struct cache_set *c,  in bch_btree_node_alloc()
1109 					  struct btree *parent)  in bch_btree_node_alloc()
1114 static struct btree *btree_node_alloc_replacement(struct btree *b,  in btree_node_alloc_replacement()
1117 	struct btree *n = bch_btree_node_alloc(b->c, op, b->level, b->parent);  in btree_node_alloc_replacement()
1128 static void make_btree_freeing_key(struct btree *b, struct bkey *k)  in make_btree_freeing_key()
1147 static int btree_check_reserve(struct btree *b, struct btree_op *op)  in btree_check_reserve()
1245 static bool btree_gc_mark_node(struct btree *b, struct gc_stat *gc)  in btree_gc_mark_node()
1290 	struct btree	*b;
1294 static int bch_btree_insert_node(struct btree *, struct btree_op *,
1297 static int btree_gc_coalesce(struct btree *b, struct btree_op *op,  in btree_gc_coalesce()
1301 	struct btree *new_nodes[GC_MERGE_NODES];  in btree_gc_coalesce()
1464 static int btree_gc_rewrite_node(struct btree *b, struct btree_op *op,  in btree_gc_rewrite_node()
1465 				 struct btree *replace)  in btree_gc_rewrite_node()
1468 	struct btree *n;  in btree_gc_rewrite_node()
1500 static unsigned btree_gc_count_keys(struct btree *b)  in btree_gc_count_keys()
1512 static int btree_gc_recurse(struct btree *b, struct btree_op *op,  in btree_gc_recurse()
1595 static int bch_btree_gc_root(struct btree *b, struct btree_op *op,  in bch_btree_gc_root()
1598 	struct btree *n = NULL;  in bch_btree_gc_root()
1809 static int bch_btree_check_recurse(struct btree *b, struct btree_op *op)  in bch_btree_check_recurse()
1830 				ret = btree(check_recurse, p, b, op);  in bch_btree_check_recurse()
1886 static bool btree_insert_key(struct btree *b, struct bkey *k,  in btree_insert_key()
1905 static size_t insert_u64s_remaining(struct btree *b)  in insert_u64s_remaining()
1918 static bool bch_btree_insert_keys(struct btree *b, struct btree_op *op,  in bch_btree_insert_keys()
1960 static int btree_split(struct btree *b, struct btree_op *op,  in btree_split()
1965 	struct btree *n1, *n2 = NULL, *n3 = NULL;  in btree_split()
2094 static int bch_btree_insert_node(struct btree *b, struct btree_op *op,  in bch_btree_insert_node()
2150 int bch_btree_insert_check_key(struct btree *b, struct btree_op *op,  in bch_btree_insert_check_key()
2195 static int btree_insert_fn(struct btree_op *b_op, struct btree *b)  in btree_insert_fn()
2242 void bch_btree_set_root(struct btree *b)  in bch_btree_set_root()
2268 static int bch_btree_map_nodes_recurse(struct btree *b, struct btree_op *op,  in bch_btree_map_nodes_recurse()
2282 			ret = btree(map_nodes_recurse, k, b,  in bch_btree_map_nodes_recurse()
2303 static int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op,  in bch_btree_map_keys_recurse()
2316 			: btree(map_keys_recurse, k, b, op, from, fn, flags);  in bch_btree_map_keys_recurse()
2362 static int refill_keybuf_fn(struct btree_op *op, struct btree *b,  in refill_keybuf_fn()