Lines Matching refs:btree
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 closure_type(b, struct btree, io); in CLOSURE_CALLBACK()
305 closure_type(b, struct btree, io); in CLOSURE_CALLBACK()
320 closure_type(b, struct btree, io); in CLOSURE_CALLBACK()
329 struct btree *b = container_of(cl, struct btree, io); in btree_node_write_endio()
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()
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()
568 const struct btree *a = container_of(_a, struct btree, lock.dep_map); in btree_lock_cmp_fn()
569 const struct btree *b = container_of(_b, struct btree, lock.dep_map); in btree_lock_cmp_fn()
576 const struct btree *b = container_of(map, struct btree, lock.dep_map); in btree_lock_print_fn()
583 static struct btree *mca_bucket_alloc(struct cache_set *c, in mca_bucket_alloc()
590 struct btree *b = kzalloc(sizeof(struct btree), gfp); in mca_bucket_alloc()
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()
750 struct btree *b; in bch_btree_cache_free()
771 b = list_first_entry(&c->btree_cache, struct btree, list); in bch_btree_cache_free()
787 struct btree, list); in bch_btree_cache_free()
855 static struct btree *mca_find(struct cache_set *c, struct bkey *k) in mca_find()
857 struct btree *b; in mca_find()
886 static struct btree *mca_cannibalize(struct cache_set *c, struct btree_op *op, in mca_cannibalize()
889 struct btree *b; in mca_cannibalize()
924 static struct btree *mca_alloc(struct cache_set *c, struct btree_op *op, in mca_alloc()
927 struct btree *b; in mca_alloc()
1007 struct btree *bch_btree_node_get(struct cache_set *c, struct btree_op *op, in bch_btree_node_get()
1009 struct btree *parent) in bch_btree_node_get()
1012 struct btree *b; in bch_btree_node_get()
1064 static void btree_node_prefetch(struct btree *parent, struct bkey *k) in btree_node_prefetch()
1066 struct btree *b; in btree_node_prefetch()
1081 static void btree_node_free(struct btree *b) in btree_node_free()
1121 struct btree *__bch_btree_node_alloc(struct cache_set *c, struct btree_op *op, in __bch_btree_node_alloc()
1123 struct btree *parent) in __bch_btree_node_alloc()
1126 struct btree *b; in __bch_btree_node_alloc()
1164 static struct btree *bch_btree_node_alloc(struct cache_set *c, in bch_btree_node_alloc()
1166 struct btree *parent) in bch_btree_node_alloc()
1171 static struct btree *btree_node_alloc_replacement(struct btree *b, in btree_node_alloc_replacement()
1174 struct btree *n = bch_btree_node_alloc(b->c, op, b->level, b->parent); in btree_node_alloc_replacement()
1186 static void make_btree_freeing_key(struct btree *b, struct bkey *k) in make_btree_freeing_key()
1205 static int btree_check_reserve(struct btree *b, struct btree_op *op) in btree_check_reserve()
1307 static bool btree_gc_mark_node(struct btree *b, struct gc_stat *gc) in btree_gc_mark_node()
1354 struct btree *b;
1358 static int bch_btree_insert_node(struct btree *b, struct btree_op *op,
1363 static int btree_gc_coalesce(struct btree *b, struct btree_op *op, in btree_gc_coalesce()
1367 struct btree *new_nodes[GC_MERGE_NODES]; in btree_gc_coalesce()
1534 static int btree_gc_rewrite_node(struct btree *b, struct btree_op *op, in btree_gc_rewrite_node()
1535 struct btree *replace) in btree_gc_rewrite_node()
1538 struct btree *n; in btree_gc_rewrite_node()
1572 static unsigned int btree_gc_count_keys(struct btree *b) in btree_gc_count_keys()
1612 static int btree_gc_recurse(struct btree *b, struct btree_op *op, in btree_gc_recurse()
1703 static int bch_btree_gc_root(struct btree *b, struct btree_op *op, in bch_btree_gc_root()
1706 struct btree *n = NULL; in bch_btree_gc_root()
1920 static int bch_btree_check_recurse(struct btree *b, struct btree_op *op) in bch_btree_check_recurse()
2176 static bool btree_insert_key(struct btree *b, struct bkey *k, in btree_insert_key()
2195 static size_t insert_u64s_remaining(struct btree *b) in insert_u64s_remaining()
2208 static bool bch_btree_insert_keys(struct btree *b, struct btree_op *op, in bch_btree_insert_keys()
2250 static int btree_split(struct btree *b, struct btree_op *op, in btree_split()
2255 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split()
2384 static int bch_btree_insert_node(struct btree *b, struct btree_op *op, in bch_btree_insert_node()
2440 int bch_btree_insert_check_key(struct btree *b, struct btree_op *op, in bch_btree_insert_check_key()
2485 static int btree_insert_fn(struct btree_op *b_op, struct btree *b) in btree_insert_fn()
2532 void bch_btree_set_root(struct btree *b) in bch_btree_set_root()
2558 static int bch_btree_map_nodes_recurse(struct btree *b, struct btree_op *op, in bch_btree_map_nodes_recurse()
2594 int bch_btree_map_keys_recurse(struct btree *b, struct btree_op *op, in bch_btree_map_keys_recurse()
2655 static int refill_keybuf_fn(struct btree_op *op, struct btree *b, in refill_keybuf_fn()