Home
last modified time | relevance | path

Searched refs:bpos_gt (Results 1 – 14 of 14) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbkey.h118 static __always_inline bool bpos_gt(struct bpos l, struct bpos r) in bpos_gt() function
142 return bpos_gt(l, r) ? l : r; in bpos_max()
H A Dbtree_node_scan.c327 bpos_gt(l->max_key, r->min_key)); in nodes_overlap()
575 n.range_updated |= bpos_gt(n.max_key, node_max); in bch2_get_scanned_nodes()
H A Dbkey_methods.c264 bkey_fsck_err_on(bpos_gt(k.k->p, b->data->max_key), in bch2_bkey_in_btree_node()
H A Dbtree_iter.c106 return bpos_gt(path->pos, b->key.k.p); in btree_path_pos_after_node()
2440 if (unlikely(iter->flags & BTREE_ITER_all_snapshots ? bpos_gt(iter_pos, end) : in bch2_btree_iter_peek_max()
2531 if (!k.k || bpos_gt(k.k->p, search_key)) { in __bch2_btree_iter_peek_prev()
2534 BUG_ON(k.k && bpos_gt(k.k->p, search_key)); in __bch2_btree_iter_peek_prev()
2692 EBUG_ON(iter->flags & BTREE_ITER_all_snapshots ? bpos_gt(k.k->p, iter->pos) : in bch2_btree_iter_peek_prev_min()
H A Dbtree_journal_iter.c582 if (ret.k && iter->b && bpos_gt(ret.k->p, iter->b->data->max_key)) in bch2_btree_and_journal_iter_peek()
H A Dbtree_write_buffer.c366 bpos_gt(k->k.k.p, path->l[0].b->key.k.p)) { in bch2_btree_write_buffer_flush_locked()
H A Ddebug.c451 if (bpos_gt(l->b->key.k.p, i->prev_node)) { in bch2_read_bfloat_failed()
H A Dbtree_trans_commit.c164 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key()
H A Dbtree_gc.c358 BUG_ON(bpos_gt(k.k->p, b->data->max_key)); in bch2_btree_repair_topology_recurse()
H A Dbackpointers.c533 bpos_gt(bp->k.p, s->bp_end)) in check_bp_exists()
H A Dbset.c1308 EBUG_ON(bpos_gt(*search, b->data->max_key)); in bch2_btree_node_iter_init()
H A Dec.c122 bpos_gt(k.k->p, POS(0, U32_MAX)), in bch2_stripe_validate()
H A Dbtree_io.c678 BUG_ON(bpos_gt(k.k->p, b->data->max_key)); in bch2_btree_node_drop_keys_outside_node()
H A Dfsck.c1650 if (bpos_gt(k2.k->p, pos2.p) || in overlapping_extents_found()