Home
last modified time | relevance | path

Searched refs:bpos_lt (Results 1 – 11 of 11) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbkey.h104 static __always_inline bool bpos_lt(struct bpos l, struct bpos r) in bpos_lt() function
120 return bpos_lt(r, l); in bpos_gt()
137 return bpos_lt(l, r) ? l : r; in bpos_min()
H A Dbtree_gc.c248 if (bpos_lt(expected_start, cur->data->min_key)) { /* gap */ in btree_check_node_boundaries()
250 bpos_lt(*pulled_from_scan, cur->data->min_key)) { in btree_check_node_boundaries()
315 bpos_lt(*pulled_from_scan, b->key.k.p)) { in btree_repair_node_end()
357 BUG_ON(bpos_lt(k.k->p, b->data->min_key)); in bch2_btree_repair_topology_recurse()
H A Dbtree_node_scan.c502 bpos_lt((_f)->nodes.data[_idx].min_key, _search.max_key); \
572 n.range_updated |= bpos_lt(n.min_key, node_min); in bch2_get_scanned_nodes()
H A Dbtree_journal_iter.c569 bpos_lt(btree_k.k->p, iter->pos)) in bch2_btree_and_journal_iter_peek()
574 bpos_lt(journal_k.k->p, iter->pos)) in bch2_btree_and_journal_iter_peek()
H A Dbset.c92 if (bpos_lt(n.p, k.k->p)) { in bch2_dump_bset()
1051 if (bpos_lt(rw_aux_tree(b, t)[m].k, *search)) in bset_search_write_set()
1307 EBUG_ON(bpos_lt(*search, b->data->min_key)); in bch2_btree_node_iter_init()
H A Dbkey_methods.c260 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), in bch2_bkey_in_btree_node()
H A Dbtree_iter.c100 return bpos_lt(path->pos, b->data->min_key); in btree_path_pos_before_node()
1916 BUG_ON(bpos_lt(b->key.k.p, iter->pos)); in bch2_btree_iter_peek_node()
2631 if (s && bpos_lt(k.k->p, SPOS(s->pos.inode, s->pos.offset, iter->snapshot))) { in bch2_btree_iter_peek_prev_min()
2696 if (unlikely(iter->flags & BTREE_ITER_all_snapshots ? bpos_lt(k.k->p, end) : in bch2_btree_iter_peek_prev_min()
H A Ddata_update.c491 while (bpos_lt(update->op.pos, update->k.k->k.p)) { in bch2_update_unwritten_extent()
H A Dbtree_trans_commit.c163 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
H A Dbackpointers.c532 if (bpos_lt(bp->k.p, s->bp_start) || in check_bp_exists()
H A Dbtree_io.c677 BUG_ON(bpos_lt(k.k->p, b->data->min_key)); in bch2_btree_node_drop_keys_outside_node()