summaryrefslogtreecommitdiff
path: root/fs/bcachefs/debug.c
diff options
context:
space:
mode:
authorKent Overstreet <kent.overstreet@gmail.com>2021-03-21 16:55:25 -0400
committerKent Overstreet <kent.overstreet@gmail.com>2022-04-17 15:42:50 -0400
commit5a6f4b6c60af9f44e5250621d9cae559fc47fd82 (patch)
treefed2ce6e23a6f92649779e7be6f10cef9a5d35e5 /fs/bcachefs/debug.c
parentbec38dd42da41f510c549280cb52e4a07af29dcd (diff)
bcachefs: Replace bch2_btree_iter_next() calls with bch2_btree_iter_advance
The way btree iterators work internally has been changing, particularly with the iter->real_pos changes, and bch2_btree_iter_next() is no longer hyper optimized - it's just advance followed by peek, so it's more efficient to just call advance where we're not using the return value of bch2_btree_iter_next(). Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
Diffstat (limited to 'fs/bcachefs/debug.c')
-rw-r--r--fs/bcachefs/debug.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/fs/bcachefs/debug.c b/fs/bcachefs/debug.c
index cce747da8b9e..c6d49f44aa01 100644
--- a/fs/bcachefs/debug.c
+++ b/fs/bcachefs/debug.c
@@ -356,7 +356,7 @@ static ssize_t bch2_read_bfloat_failed(struct file *file, char __user *buf,
if (err)
break;
- bch2_btree_iter_next(iter);
+ bch2_btree_iter_advance(iter);
i->from = iter->pos;
err = flush_buf(i);