Searched refs:bpos_min (Results 1 – 7 of 7) sorted by relevance
| /fs/bcachefs/ |
| A D | extent_update.c | 51 *end = bpos_min(*end, k.k->p); in count_iters_for_insert()
61 *end = bpos_min(*end, k.k->p); in count_iters_for_insert()
69 unsigned sectors = bpos_min(*end, p.k->p).offset - in count_iters_for_insert()
90 *end = bpos_min(*end, pos); in count_iters_for_insert()
|
| A D | bkey.h | 135 static inline struct bpos bpos_min(struct bpos l, struct bpos r) in bpos_min() function
|
| A D | btree_node_scan.c | 580 n.max_key = bpos_min(n.max_key, node_max); in bch2_get_scanned_nodes()
|
| A D | btree_update.c | 732 bpos_min(end, k.k->p).offset - in bch2_btree_delete_range_trans()
|
| A D | fs-io.c | 672 hole_end = bpos_min(k.k->p, end_pos).offset; in __bchfs_fallocate()
|
| A D | inode.c | 1111 bpos_min(end, k.k->p).offset - in bch2_inode_delete_keys()
|
| A D | btree_iter.c | 2749 iter->pos = bpos_min(iter->pos, k.k->p);; in bch2_btree_iter_peek_prev_min()
|
Completed in 27 milliseconds