Searched refs:bpos_lt (Results 1 - 10 of 10) sorted by relevance
/linux-master/fs/bcachefs/ |
H A D | btree_node_scan.c | 289 bpos_lt(n->min_key, start->max_key); 428 bpos_lt((_f)->nodes.data[_idx].min_key, _search.max_key); \ 496 n.range_updated |= bpos_lt(n.min_key, node_min);
|
H A D | bkey.h | 110 static __always_inline bool bpos_lt(struct bpos l, struct bpos r) function 126 return bpos_lt(r, l); 143 return bpos_lt(l, r) ? l : r;
|
H A D | btree_gc.c | 206 if (bpos_lt(expected_start, cur->data->min_key)) { /* gap */ 208 bpos_lt(*pulled_from_scan, cur->data->min_key)) { 271 bpos_lt(*pulled_from_scan, b->key.k.p)) { 313 BUG_ON(bpos_lt(k.k->p, b->data->min_key));
|
H A D | bkey_methods.c | 245 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), c, err,
|
H A D | btree_journal_iter.c | 426 bpos_lt(btree_k.k->p, iter->pos)) 431 bpos_lt(journal_k.k->p, iter->pos))
|
H A D | bset.c | 92 if (bpos_lt(n.p, k.k->p)) { 1074 if (bpos_lt(rw_aux_tree(b, t)[m].k, *search)) 1331 EBUG_ON(bpos_lt(*search, b->data->min_key));
|
H A D | backpointers.c | 555 if (bpos_lt(bucket, s->bucket_start) ||
|
H A D | btree_trans_commit.c | 161 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));
|
H A D | btree_iter.c | 100 return bpos_lt(path->pos, b->data->min_key); 1889 BUG_ON(bpos_lt(b->key.k.p, iter->pos));
|
H A D | btree_io.c | 676 BUG_ON(bpos_lt(k.k->p, b->data->min_key));
|
Completed in 310 milliseconds