104 #define insert_lock(s, b)	((b)->level <= (s)->lock)  argument
107 static inline struct bset *write_block(struct btree *b)  in write_block()
112 static void bch_btree_init_next(struct btree *b)  in bch_btree_init_next()
139 static uint64_t btree_csum_set(struct btree *b, struct bset *i)  in btree_csum_set()
148 void bch_btree_node_read_done(struct btree *b)  in bch_btree_node_read_done()
243 static void bch_btree_node_read(struct btree *b)  in bch_btree_node_read()
281 static void btree_complete_write(struct btree *b, struct btree_write *w)  in btree_complete_write()
298 	struct btree *b = container_of(cl, struct btree, io);  in btree_node_write_unlock()  local
305 	struct btree *b = container_of(cl, struct btree, io);  in __btree_node_write_done()  local
320 	struct btree *b = container_of(cl, struct btree, io);  in btree_node_write_done()  local
329 	struct btree *b = container_of(cl, struct btree, io);  in btree_node_write_endio()  local
338 static void do_btree_node_write(struct btree *b)  in do_btree_node_write()
403 void __bch_btree_node_write(struct btree *b, struct closure *parent)  in __bch_btree_node_write()
434 void bch_btree_node_write(struct btree *b, struct closure *parent)  in bch_btree_node_write()
452 static void bch_btree_node_write_sync(struct btree *b)  in bch_btree_node_write_sync()
467 	struct btree *b = container_of(to_delayed_work(w), struct btree, work);  in btree_node_write_work()  local
475 static void bch_btree_leaf_dirty(struct btree *b, atomic_t *journal_ref)  in bch_btree_leaf_dirty()
524 static void mca_data_free(struct btree *b)  in mca_data_free()
534 static void mca_bucket_free(struct btree *b)  in mca_bucket_free()
548 static void mca_data_alloc(struct btree *b, struct bkey *k, gfp_t gfp)  in mca_data_alloc()
569 	const struct btree *b = container_of(_b, struct btree, lock.dep_map);  in btree_lock_cmp_fn()  local
576 	const struct btree *b = container_of(map, struct btree, lock.dep_map);  in btree_lock_print_fn()  local
590 	struct btree *b = kzalloc(sizeof(struct btree), gfp);  in mca_bucket_alloc()  local
608 static int mca_reap(struct btree *b, unsigned int min_order, bool flush)  in mca_reap()
671 	struct btree *b, *t;  in bch_mca_scan()  local
750 	struct btree *b;  in bch_btree_cache_free()  local
852 	struct btree *b;  in mca_find()  local
884 	struct btree *b;  in mca_cannibalize()  local
922 	struct btree *b;  in mca_alloc()  local
1004 	struct btree *b;  in bch_btree_node_get()  local
1058 	struct btree *b;  in btree_node_prefetch()  local
1073 static void btree_node_free(struct btree *b)  in btree_node_free()
1114 	struct btree *b;  in __bch_btree_node_alloc()  local
1159 static struct btree *btree_node_alloc_replacement(struct btree *b,  in btree_node_alloc_replacement()
1174 static void make_btree_freeing_key(struct btree *b, struct bkey *k)  in make_btree_freeing_key()
1193 static int btree_check_reserve(struct btree *b, struct btree_op *op)  in btree_check_reserve()
1268 #define btree_mark_key(b, k)	__bch_btree_mark_key(b->c, b->level, k)  argument
1277 			struct bucket *b = PTR_BUCKET(c, k, i);  in bch_initial_mark_key()  local
1295 static bool btree_gc_mark_node(struct btree *b, struct gc_stat *gc)  in btree_gc_mark_node()
1340 	struct btree	*b;  member
1349 static int btree_gc_coalesce(struct btree *b, struct btree_op *op,  in btree_gc_coalesce()
1520 static int btree_gc_rewrite_node(struct btree *b, struct btree_op *op,  in btree_gc_rewrite_node()
1556 static unsigned int btree_gc_count_keys(struct btree *b)  in btree_gc_count_keys()
1594 static int btree_gc_recurse(struct btree *b, struct btree_op *op,  in btree_gc_recurse()
1684 static int bch_btree_gc_root(struct btree *b, struct btree_op *op,  in bch_btree_gc_root()
1722 	struct bucket *b;  in btree_gc_start()  local
1746 	struct bucket *b;  in bch_btree_gc_finish()  local
1896 static int bch_btree_check_recurse(struct btree *b, struct btree_op *op)  in bch_btree_check_recurse()
2111 	struct bucket *b;  in bch_initial_gc_finish()  local
2146 static bool btree_insert_key(struct btree *b, struct bkey *k,  in btree_insert_key()
2165 static size_t insert_u64s_remaining(struct btree *b)  in insert_u64s_remaining()
2178 static bool bch_btree_insert_keys(struct btree *b, struct btree_op *op,  in bch_btree_insert_keys()
2220 static int btree_split(struct btree *b, struct btree_op *op,  in btree_split()
2354 static int bch_btree_insert_node(struct btree *b, struct btree_op *op,  in bch_btree_insert_node()
2410 int bch_btree_insert_check_key(struct btree *b, struct btree_op *op,  in bch_btree_insert_check_key()
2455 static int btree_insert_fn(struct btree_op *b_op, struct btree *b)  in btree_insert_fn()
2502 void bch_btree_set_root(struct btree *b)  in bch_btree_set_root()
2528 static int bch_btree_map_nodes_recurse(struct btree *b, struct btree_op *op,  in bch_btree_map_nodes_recurse()
2563 int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op,  in bch_btree_map_keys_recurse()
2623 static int refill_keybuf_fn(struct btree_op *op, struct btree *b,  in refill_keybuf_fn()