Searched refs:bset_tree_last (Results 1 – 9 of 9) sorted by relevance
235 static inline struct bset_tree *bset_tree_last(struct btree_keys *b) in bset_tree_last() function272 struct bset_tree *t = bset_tree_last(b); in bch_btree_keys_u64s_remaining()288 struct bset *i = bset_tree_last(b)->data; in bset_next_set()
657 struct bset_tree *t = bset_tree_last(b); in bch_bset_build_unwritten_tree()696 struct bset_tree *t = bset_tree_last(b); in bch_bset_build_written_tree()747 for (t = b->set; t <= bset_tree_last(b); t++) in bch_bset_fix_invalidated_key()864 struct bset_tree *t = bset_tree_last(b); in bch_bset_insert()884 struct bset *i = bset_tree_last(b)->data; in bch_btree_insert_key()1130 for (; start <= bset_tree_last(b); start++) { in __bch_btree_iter_init()
187 return bset_tree_last(&b->keys)->data; in btree_bset_last()
430 top = bch_bset_search(b, bset_tree_last(b), in bch_extent_insert_fixup()
256 btree_bkey_last(b, bset_tree_last(b))); in bch2_btree_keys_u64s_remaining()279 struct bset_tree *t = bset_tree_last(b); in want_new_bset()
641 static inline struct bset_tree *bset_tree_last(struct btree *b) in bset_tree_last() function688 return bset(b, bset_tree_last(b)); in btree_bset_last()
804 BUG_ON((void *) bne < (void *) btree_bkey_last(b, bset_tree_last(b))); in bch2_bset_init_next()985 struct bset_tree *t = bset_tree_last(b); in bch2_bset_insert()1024 struct bset_tree *t = bset_tree_last(b); in bch2_bset_delete()
215 k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b)); in bch2_btree_bset_insert_key()294 struct bset_tree *t = bset_tree_last(b); in bch2_btree_insert_key_leaf()
449 t == bset_tree_last(b)); in bch2_btree_build_aux_trees()2308 BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b)); in bch2_btree_post_write_cleanup()