Home
last modified time | relevance | path

Searched refs:btree_bkey_last (Results 1 – 6 of 6) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbset.c268 BUG_ON(next != btree_bkey_last(b, t) && in bch2_verify_insert_pos()
271 if (next != btree_bkey_last(b, t) && in bch2_verify_insert_pos()
490 EBUG_ON(k >= btree_bkey_last(b, t)); in rw_aux_tree_set()
529 BUG_ON(k >= btree_bkey_last(b, t)); in bch2_bset_verify_rw_aux_tree()
718 if (k >= btree_bkey_last(b, t)) { in __build_ro_aux_tree()
827 k > btree_bkey_last(b, t)); in __bkey_prev()
896 : btree_bkey_last(b, t); in rw_aux_tree_insert_entry()
1188 while (m != btree_bkey_last(b, t) && in bch2_bset_search_linear()
1194 while (m != btree_bkey_last(b, t) && in bch2_bset_search_linear()
1354 btree_bkey_last(b, t)); in bch2_btree_node_iter_init_from_start()
[all …]
H A Dbtree_update_interior.h263 btree_bkey_last(b, bset_tree_last(b))); in bch2_btree_keys_u64s_remaining()
288 (void *) btree_bkey_last(b, t)); in want_new_bset()
H A Dbset.h216 _k != btree_bkey_last(_b, _t); \
H A Dbtree_io.c237 (void *) btree_bkey_last(b, t - 1)); in bch2_drop_whiteouts()
255 end = btree_bkey_last(b, t); in bch2_drop_whiteouts()
317 btree_bkey_last(b, t)); in btree_node_sort()
2329 btree_bkey_last(b, t)); in __bch2_btree_node_write()
2530 BUG_ON((void *) btree_bkey_last(b, bset_tree_last(b)) > write_block(b)); in bch2_btree_post_write_cleanup()
H A Dbtree_types.h716 #define btree_bkey_last(_b, _t) \ macro
H A Dbtree_iter.c390 bch2_btree_node_iter_push(iter, b, k, btree_bkey_last(b, t)); in btree_node_iter_set_set_pos()
427 const struct bkey_packed *end = btree_bkey_last(b, t); in __bch2_btree_node_iter_fix()