Home
last modified time | relevance | path

Searched refs:bpos_ge (Results 1 – 9 of 9) sorted by relevance

/linux-6.12.1/fs/bcachefs/
Dkeylist.c48 bpos_ge(k->k.p, bkey_next(k)->k.p)); in bch2_verify_keylist_sorted()
Dbackpointers.c234 if (bpos_ge(*bp_pos, bp_end_pos)) in bch2_get_next_backpointer()
253 if (bpos_ge(k.k->p, bp_end_pos)) in bch2_get_next_backpointer()
Dbkey.h130 static __always_inline bool bpos_ge(struct bpos l, struct bpos r) in bpos_ge() function
Dbtree_gc.c242 if (bpos_ge(prev->data->min_key, cur->data->min_key)) { /* fully? */ in btree_check_node_boundaries()
253 if (bpos_ge(expected_start, cur->data->max_key)) { /* fully? */ in btree_check_node_boundaries()
Dbtree_journal_iter.c614 bpos_ge(i->k->k.p, start) && in bch2_shoot_down_journal_keys()
Dbtree_iter.c2062 bpos_ge(i->k->k.p, k->k ? k->k->p : end)) { in bch2_btree_trans_peek_prev_updates()
2078 bpos_ge(i->k->k.p, path->pos) && in bch2_btree_trans_peek_updates()
2502 ? bpos_ge(bkey_start_pos(k.k), search_key) in bch2_btree_iter_peek_prev()
Dextents.c202 bkey_fsck_err_on(bpos_ge(bp.v->min_key, bp.k->p), in bch2_btree_ptr_v2_validate()
Dbtree_io.c93 BUG_ON(bpos_ge(l.p, bkey_start_pos(&r))); in verify_no_dups()
Dfsck.c1786 if (bpos_ge(k2.k->p, pos2.p)) in overlapping_extents_found()