Searched refs:bkey_lt (Results 1 – 12 of 12) sorted by relevance
| /fs/bcachefs/ |
| A D | bkey.h | 151 static __always_inline bool bkey_lt(struct bpos l, struct bpos r) in bkey_lt() function
167 return bkey_lt(r, l); in bkey_gt()
183 return bkey_lt(l, r) ? l : r; in bkey_min()
|
| A D | btree_update.c | 176 unsigned front_split = bkey_lt(bkey_start_pos(old.k), new_start); in bch2_trans_update_extent_overwrite()
297 bool done = bkey_lt(insert->k.p, k.k->p); in bch2_trans_update_extent()
|
| A D | reflink.c | 639 bkey_lt(dst_iter.pos, dst_end)) { in bch2_remap_range()
679 if (bkey_lt(src_want, src_iter.pos)) { in bch2_remap_range()
|
| A D | btree_iter.c | 269 (bkey_lt(iter->pos, bkey_start_pos(&iter->k)) || in __bch2_btree_iter_verify_entry_exit()
2648 bkey_lt(bkey_start_pos(k.k), iter->pos))) in bch2_btree_iter_peek_prev_min()
2695 if (unlikely(bkey_lt(k.k->p, end))) in bch2_btree_iter_peek_prev_min()
2742 bkey_lt(k.k->p, end))) in bch2_btree_iter_peek_prev_min()
2909 if (bkey_lt(iter->pos, next)) { in bch2_btree_iter_peek_slot()
|
| A D | extents.h | 722 int cmp1 = bkey_lt(k->p, m->p); in bch2_extent_overlap()
|
| A D | io_misc.c | 474 bkey_lt(bkey_start_pos(k.k), src_pos)) { in __bch2_resume_logged_op_finsert()
|
| A D | subvolume.c | 239 bkey_fsck_err_on(bkey_lt(k.k->p, SUBVOL_POS_MIN) || in bch2_subvolume_validate()
|
| A D | dirent.c | 496 bkey_lt(src_iter.pos, dst_iter.pos)) { in bch2_dirent_rename()
|
| A D | snapshot.c | 43 bkey_lt(k.k->p, POS(0, 1)), in bch2_snapshot_tree_validate()
238 bkey_lt(k.k->p, POS(0, 1)), in bch2_snapshot_validate()
|
| A D | inode.c | 1029 bkey_lt(k.k->p, POS(0, max))) { in bch2_inode_create()
|
| A D | move.c | 617 if (bkey_lt(reflink_pos, bkey_start_pos(k.k))) { in bch2_lookup_indirect_extent_for_move()
|
| A D | extents.c | 1709 EBUG_ON(bkey_lt(where, bkey_start_pos(k.k))); in bch2_cut_back_s()
|
Completed in 49 milliseconds