Home
last modified time | relevance | path

Searched refs:bch2_btree_iter_peek_max (Results 1 – 9 of 9) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dtests.c354 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end()
357 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end()
376 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end_extents()
379 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end_extents()
495 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_snapshot_filter()
679 k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)); in __do_delete()
H A Dio_misc.c172 k = bch2_btree_iter_peek_max(trans, iter, end_pos); in bch2_fpunch_at()
433 : bch2_btree_iter_peek_max(trans, &iter, POS(inum.inum, U64_MAX)); in __bch2_resume_logged_op_finsert()
H A Dbtree_iter.h403 struct bkey_s_c bch2_btree_iter_peek_max(struct btree_trans *, struct btree_iter *, struct bpos);
409 return bch2_btree_iter_peek_max(trans, iter, SPOS_MAX); in bch2_btree_iter_peek()
702 return bch2_btree_iter_peek_max(trans, iter, end); in bch2_btree_iter_peek_max_type()
H A Dbtree_update.c299 k = bch2_btree_iter_peek_max(trans, &iter, POS(insert->k.p.inode, U64_MAX)); in bch2_trans_update_extent()
326 k = bch2_btree_iter_peek_max(trans, &iter, POS(insert->k.p.inode, U64_MAX)); in bch2_trans_update_extent()
716 while ((k = bch2_btree_iter_peek_max(trans, &iter, end)).k) { in bch2_btree_delete_range_trans()
H A Dalloc_background.c1068 k = bch2_btree_iter_peek_max(trans, &iter2, end); in bch2_get_key_or_hole()
2207 k = bch2_btree_iter_peek_max(trans, iter, lru_pos(ca->dev_idx, U64_MAX, LRU_TIME_MAX)); in next_lru_key()
H A Dbtree_iter.c2328 struct bkey_s_c bch2_btree_iter_peek_max(struct btree_trans *trans, struct btree_iter *iter, in bch2_btree_iter_peek_max() function
2825 k = bch2_btree_iter_peek_max(trans, &iter2, end); in bch2_btree_iter_peek_slot()
2836 k = bch2_btree_iter_peek_max(trans, iter, end); in bch2_btree_iter_peek_slot()
H A Dinode.c1015 k = bch2_btree_iter_peek_max(trans, &iter, end); in bch2_inode_delete_keys()
H A Dfsck.c1613 k1 = bch2_btree_iter_peek_max(trans, &iter1, POS(pos1.inode, U64_MAX)); in overlapping_extents_found()
1638 k2 = bch2_btree_iter_peek_max(trans, &iter2, POS(pos1.inode, U64_MAX)); in overlapping_extents_found()
H A Dfs.c1427 bch2_btree_iter_peek_max(trans, &iter, POS(inode->ei_inum.inum, end)); in bch2_next_fiemap_extent()