this code is rarely invoked, so - we had a few bugs left from basing it
off of bch2_journal_keys_peek_max()...

Signed-off-by: Kent Overstreet <kent.overstr...@linux.dev>
---
 fs/bcachefs/btree_journal_iter.c | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/fs/bcachefs/btree_journal_iter.c b/fs/bcachefs/btree_journal_iter.c
index cf7398751644..de996c848e43 100644
--- a/fs/bcachefs/btree_journal_iter.c
+++ b/fs/bcachefs/btree_journal_iter.c
@@ -141,8 +141,8 @@ struct bkey_i *bch2_journal_keys_peek_prev_min(struct 
bch_fs *c, enum btree_id b
        if (!*idx)
                *idx = __bch2_journal_key_search(keys, btree_id, level, pos);
 
-       while (*idx &&
-              __journal_key_cmp(btree_id, level, end_pos, idx_to_key(keys, 
*idx - 1)) <= 0) {
+       while (*idx < keys->nr &&
+              __journal_key_cmp(btree_id, level, end_pos, idx_to_key(keys, 
*idx - 1)) >= 0) {
                (*idx)++;
                iters++;
                if (iters == 10) {
-- 
2.50.0


Reply via email to