Searched refs:bpos_lt (Results 1 – 10 of 10) sorted by relevance
| /linux-6.12.1/fs/bcachefs/ |
| D | bkey.h | 111 static __always_inline bool bpos_lt(struct bpos l, struct bpos r) in bpos_lt() function
127 return bpos_lt(r, l); in bpos_gt()
144 return bpos_lt(l, r) ? l : r; in bpos_min()
|
| D | btree_node_scan.c | 314 bpos_lt(n->min_key, start->max_key); in handle_overwrites()
453 bpos_lt((_f)->nodes.data[_idx].min_key, _search.max_key); \
521 n.range_updated |= bpos_lt(n.min_key, node_min); in bch2_get_scanned_nodes()
|
| D | btree_gc.c | 224 if (bpos_lt(expected_start, cur->data->min_key)) { /* gap */ in btree_check_node_boundaries()
226 bpos_lt(*pulled_from_scan, cur->data->min_key)) { in btree_check_node_boundaries()
290 bpos_lt(*pulled_from_scan, b->key.k.p)) { in btree_repair_node_end()
332 BUG_ON(bpos_lt(k.k->p, b->data->min_key)); in bch2_btree_repair_topology_recurse()
|
| D | btree_journal_iter.c | 411 bpos_lt(btree_k.k->p, iter->pos)) in bch2_btree_and_journal_iter_peek()
416 bpos_lt(journal_k.k->p, iter->pos)) in bch2_btree_and_journal_iter_peek()
|
| D | bset.c | 92 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()
|
| D | bkey_methods.c | 243 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), in bch2_bkey_in_btree_node()
|
| D | backpointers.c | 549 if (bpos_lt(bucket, s->bucket_start) || in check_bp_exists()
|
| D | btree_trans_commit.c | 163 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
|
| D | btree_iter.c | 100 return bpos_lt(path->pos, b->data->min_key); in btree_path_pos_before_node()
1910 BUG_ON(bpos_lt(b->key.k.p, iter->pos)); in bch2_btree_iter_peek_node()
|
| D | btree_io.c | 675 BUG_ON(bpos_lt(k.k->p, b->data->min_key)); in bch2_btree_node_drop_keys_outside_node()
|