Searched refs:bset_tree_last (Results 1 – 9 of 9) sorted by relevance
234 static inline struct bset_tree *bset_tree_last(struct btree_keys *b) in bset_tree_last() function 271 struct bset_tree *t = bset_tree_last(b); in bch_btree_keys_u64s_remaining() 287 struct bset *i = bset_tree_last(b)->data; in bset_next_set()
653 struct bset_tree *t = bset_tree_last(b); in bch_bset_build_unwritten_tree() 692 struct bset_tree *t = bset_tree_last(b); in bch_bset_build_written_tree() 743 for (t = b->set; t <= bset_tree_last(b); t++) in bch_bset_fix_invalidated_key() 860 struct bset_tree *t = bset_tree_last(b); in bch_bset_insert() 880 struct bset *i = bset_tree_last(b)->data; in bch_btree_insert_key() 1117 for (; start <= bset_tree_last(b); start++) { in __bch_btree_iter_stack_init()
187 return bset_tree_last(&b->keys)->data; in btree_bset_last()
273 btree_bkey_last(b, bset_tree_last(b))); in bch2_btree_keys_u64s_remaining() 296 struct bset_tree *t = bset_tree_last(b); in want_new_bset()
684 static inline struct bset_tree *bset_tree_last(struct btree *b) in bset_tree_last() function 731 return bset(b, bset_tree_last(b)); in btree_bset_last()
812 BUG_ON((void *) bne < (void *) btree_bkey_last(b, bset_tree_last(b))); in bch2_bset_init_next() 993 struct bset_tree *t = bset_tree_last(b); in bch2_bset_insert() 1032 struct bset_tree *t = bset_tree_last(b); in bch2_bset_delete()
218 k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b)); in bch2_btree_bset_insert_key() 297 struct bset_tree *t = bset_tree_last(b); in bch2_btree_insert_key_leaf()
453 t == bset_tree_last(b)); in bch2_btree_build_aux_trees() 2622 BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b)); in bch2_btree_post_write_cleanup()
1249 btree_bkey_last(b, bset_tree_last(b))); in bch2_btree_update_start()