Home
last modified time | relevance | path

Searched refs:bkey_le (Results 1 – 8 of 8) sorted by relevance

/fs/bcachefs/
A Dbkey.h158 static __always_inline bool bkey_le(struct bpos l, struct bpos r) in bkey_le() function
172 return bkey_le(r, l); in bkey_ge()
A Dio_misc.c466 bkey_le(k.k->p, POS(inum.inum, src_offset))) in __bch2_resume_logged_op_finsert()
A Ddirent.c495 if (bkey_le(dst_pos, src_iter.pos) && in bch2_dirent_rename()
A Dbtree_update.c224 if (bkey_le(old.k->p, new.k->p)) { in bch2_trans_update_extent_overwrite()
A Dextents.c1624 if (bkey_le(where, bkey_start_pos(k.k))) in bch2_cut_front_s()
A Dbtree_iter.c339 bkey_le(pos, path->l[0].b->key.k.p)) in __bch2_assert_pos_locked()
2741 iter->flags & BTREE_ITER_is_extents ? bkey_le(k.k->p, end) : in bch2_btree_iter_peek_prev_min()
A Dfs.c1451 bkey_le(bpos_max(iter.pos, bkey_start_pos(k.k)), in bch2_next_fiemap_extent()
A Dfsck.c1693 BUG_ON(bkey_le(pos1, bkey_start_pos(&pos2))); in overlapping_extents_found()

Completed in 43 milliseconds