Searched refs:bpos_cmp (Results 1 – 14 of 14) sorted by relevance
| /fs/bcachefs/ |
| A D | bbpos.h | 11 return cmp_int(l.btree, r.btree) ?: bpos_cmp(l.pos, r.pos); in bbpos_cmp()
16 if (bpos_cmp(pos.pos, SPOS_MAX)) { in bbpos_successor()
|
| A D | bkey_cmp.h | 103 EBUG_ON(ret != bpos_cmp(bkey_unpack_pos(b, l), in __bch2_bkey_cmp_packed_format_checked_inlined()
126 return bpos_cmp(((struct bkey *) l)->p, ((struct bkey *) r)->p); in bch2_bkey_cmp_packed_inlined()
|
| A D | btree_node_scan.c | 106 bpos_cmp(l->min_key, r->min_key) ?: in found_btree_node_cmp_pos()
339 if (bpos_cmp(l->max_key, r->max_key) >= 0) in handle_overwrites()
355 if (bpos_cmp(l->max_key, r->max_key) >= 0) in handle_overwrites()
492 bpos_cmp(l->max_key, r->min_key); in found_btree_node_range_start_cmp()
|
| A D | btree_gc.h | 65 bpos_cmp(l.pos, r.pos); in gc_pos_cmp()
|
| A D | btree_journal_iter.h | 46 bpos_cmp(l_pos, r->k->k.p); in __journal_key_cmp()
|
| A D | btree_write_buffer.h | 42 return cmp_int(l->btree, r->btree) ?: bpos_cmp(l->k.k.p, r->k.k.p); in wb_key_cmp()
|
| A D | disk_accounting.h | 129 return bpos_cmp(*l, *r); in accounting_pos_cmp()
|
| A D | bset.h | 288 return bpos_cmp(packed_to_bkey_c(l)->p, *r); in bkey_cmp_p_or_unp()
|
| A D | bkey.c | 1023 return bpos_cmp(bkey_unpack_pos_format_checked(b, l), *r); in __bch2_bkey_cmp_left_packed_format_checked()
1042 ? bpos_cmp(l_unpacked->p, *r) in __bch2_bkey_cmp_left_packed()
|
| A D | bkey.h | 128 static __always_inline int bpos_cmp(struct bpos l, struct bpos r) in bpos_cmp() function
|
| A D | btree_iter.c | 52 bpos_cmp(l->pos, r_pos) ?: in __btree_path_cmp()
650 bpos_cmp(i->k->k.p, b->data->min_key) >= 0 && in bch2_trans_revalidate_updates_in_node()
651 bpos_cmp(i->k->k.p, b->data->max_key) <= 0) { in bch2_trans_revalidate_updates_in_node()
1288 int cmp = bpos_cmp(new_pos, trans->paths[path_idx].pos); in __bch2_btree_path_set_pos()
|
| A D | rebalance.c | 804 int cmp = bpos_cmp(extent_k.k ? extent_k.k->p : SPOS_MAX, in check_rebalance_work_one()
|
| A D | btree_update.c | 25 bpos_cmp(l->k->k.p, r->k->k.p); in btree_insert_entry_cmp()
|
| A D | move.c | 1137 bpos_cmp(b->key.k.p, end.pos)) > 0) in bch2_move_btree()
|
Completed in 32 milliseconds