Searched refs:bpos_cmp (Results 1 - 11 of 11) sorted by relevance

/linux-master/fs/bcachefs/
H A Dbbpos.h11 return cmp_int(l.btree, r.btree) ?: bpos_cmp(l.pos, r.pos);
16 if (bpos_cmp(pos.pos, SPOS_MAX)) {
H A Dbkey_cmp.h103 EBUG_ON(ret != bpos_cmp(bkey_unpack_pos(b, l),
126 return bpos_cmp(((struct bkey *) l)->p, ((struct bkey *) r)->p);
H A Dbtree_gc.h46 bpos_cmp(l.pos, r.pos);
H A Dbtree_node_scan.c117 bpos_cmp(l->min_key, r->min_key) ?:
294 if (bpos_cmp(start->max_key, n->max_key) >= 0)
304 BUG_ON(bpos_cmp(n->min_key, start->min_key) <= 0);
418 bpos_cmp(l->max_key, r->min_key);
H A Dbset.h288 return bpos_cmp(packed_to_bkey_c(l)->p, *r);
H A Dbkey.c1028 return bpos_cmp(bkey_unpack_pos_format_checked(b, l), *r);
1047 ? bpos_cmp(l_unpacked->p, *r)
H A Dbkey.h134 static __always_inline int bpos_cmp(struct bpos l, struct bpos r) function
H A Dbtree_iter.c51 bpos_cmp(l->pos, r_pos) ?:
660 bpos_cmp(i->k->k.p, b->data->min_key) >= 0 &&
661 bpos_cmp(i->k->k.p, b->data->max_key) <= 0) {
1262 int cmp = bpos_cmp(new_pos, trans->paths[path_idx].pos);
H A Dbtree_journal_iter.c26 bpos_cmp(l_pos, r->k->k.p));
H A Dbtree_update.c23 bpos_cmp(l->k->k.p, r->k->k.p);
H A Dmove.c881 bpos_cmp(b->key.k.p, end.pos)) > 0)

Completed in 212 milliseconds