Searched refs:bpos_lt (Results 1 - 10 of 10) sorted by relevance

/linux-master/fs/bcachefs/
H A Dbtree_node_scan.c289 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 Dbkey.h110 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 Dbtree_gc.c206 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 Dbkey_methods.c245 bkey_fsck_err_on(bpos_lt(k.k->p, b->data->min_key), c, err,
H A Dbtree_journal_iter.c426 bpos_lt(btree_k.k->p, iter->pos))
431 bpos_lt(journal_k.k->p, iter->pos))
H A Dbset.c92 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 Dbackpointers.c555 if (bpos_lt(bucket, s->bucket_start) ||
H A Dbtree_trans_commit.c161 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key));
H A Dbtree_iter.c100 return bpos_lt(path->pos, b->data->min_key);
1889 BUG_ON(bpos_lt(b->key.k.p, iter->pos));
H A Dbtree_io.c676 BUG_ON(bpos_lt(k.k->p, b->data->min_key));

Completed in 310 milliseconds