Lines Matching defs:b
45 int bch2_btree_node_check_topology(struct btree_trans *trans, struct btree *b) in bch2_btree_node_check_topology()
155 static void __bch2_btree_calc_format(struct bkey_format_state *s, struct btree *b) in __bch2_btree_calc_format()
168 static struct bkey_format bch2_btree_calc_format(struct btree *b) in bch2_btree_calc_format()
208 static bool bch2_btree_node_format_fits(struct bch_fs *c, struct btree *b, in bch2_btree_node_format_fits()
219 static void __btree_node_free(struct btree_trans *trans, struct btree *b) in __btree_node_free()
238 struct btree *b) in bch2_btree_node_free_inmem()
258 struct btree *b) in bch2_btree_node_free_never_used()
294 struct btree *b; in __bch2_btree_node_alloc() local
369 struct btree *b; in bch2_btree_node_alloc() local
417 static void btree_set_min(struct btree *b, struct bpos pos) in btree_set_min()
424 static void btree_set_max(struct btree *b, struct bpos pos) in btree_set_max()
430 static struct btree *bch2_btree_node_alloc_replacement(struct btree_update *as, in bch2_btree_node_alloc_replacement()
461 struct btree *b = bch2_btree_node_alloc(as, trans, level); in __btree_root_alloc() local
482 struct btree *b = p->b[--p->nr]; in bch2_btree_reserve_put() local
514 struct btree *b; in bch2_btree_reserve_get() local
582 struct keylist *keys, struct btree *b) in btree_update_add_key()
655 struct btree *b; in btree_update_nodes_written() local
866 static void btree_update_updated_node(struct btree_update *as, struct btree *b) in btree_update_updated_node()
908 static void btree_update_updated_root(struct btree_update *as, struct btree *b) in btree_update_updated_root()
943 static void bch2_btree_update_add_new_node(struct btree_update *as, struct btree *b) in bch2_btree_update_add_new_node()
973 static void btree_update_drop_new_node(struct bch_fs *c, struct btree *b) in btree_update_drop_new_node()
1007 static void bch2_btree_update_get_open_buckets(struct btree_update *as, struct btree *b) in bch2_btree_update_get_open_buckets()
1026 struct btree *b) in bch2_btree_interior_update_will_free_node()
1281 static void bch2_btree_set_root_inmem(struct bch_fs *c, struct btree *b) in bch2_btree_set_root_inmem()
1298 struct btree *b, in bch2_btree_set_root()
1339 struct btree *b, in bch2_insert_fixup_btree_ptr()
1398 struct btree *b, in bch2_btree_insert_keys_interior()
1448 struct btree *b, in __btree_split_node()
1567 struct btree *b, in btree_split_insert_keys()
1583 btree_path_idx_t path, struct btree *b, in btree_split()
1773 btree_path_idx_t path_idx, struct btree *b, in bch2_btree_insert_node()
1848 struct btree *b = path_l(trans->paths + path)->b; in bch2_btree_split_leaf() local
1880 struct btree *n, *b = bch2_btree_id_root(c, path->btree_id)->b; in __btree_increase_depth() local
1919 struct btree *b = bch2_btree_id_root(c, trans->paths[path].btree_id)->b; in bch2_btree_increase_depth() local
1945 struct btree *b, *m, *n, *prev, *next, *parent; in __bch2_foreground_maybe_merge() local
2131 struct btree *b, in bch2_btree_node_rewrite()
2210 struct btree *b = bch2_btree_iter_peek_node(&iter); in async_btree_node_rewrite_trans() local
2268 void bch2_btree_node_rewrite_async(struct bch_fs *c, struct btree *b) in bch2_btree_node_rewrite_async()
2349 struct btree *b, struct btree *new_hash, in __bch2_btree_node_update_key()
2446 struct btree *b, struct bkey_i *new_key, in bch2_btree_node_update_key()
2493 struct btree *b, struct bkey_i *new_key, in bch2_btree_node_update_key_get_iter()
2531 void bch2_btree_set_root_for_read(struct bch_fs *c, struct btree *b) in bch2_btree_set_root_for_read()
2542 struct btree *b; in bch2_btree_root_alloc_fake_trans() local