diff options
| author | Kent Overstreet <kent.overstreet@gmail.com> | 2021-12-28 06:11:54 +0300 |
|---|---|---|
| committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-10-23 00:08:55 +0300 |
| commit | c043a3303c11cdf53ee98db67cee11931b626e22 (patch) | |
| tree | 02923ad08073d428d469cfbd3d91ab31e885f065 /fs/bcachefs/bkey_sort.h | |
| parent | 9620c3ec2fa83e18f52e99b3dd2e8451446ca17e (diff) | |
| download | linux-c043a3303c11cdf53ee98db67cee11931b626e22.tar.xz | |
bcachefs: Fix bch2_btree_cache_scan()
It was counting nodes on the freed list that it skips - because we want
to leave a few so that btree splits don't touch the allocator - as nodes
that it touched, meaning that if it was called with <= 3 nodes to
reclaim, and those nodes were on the freed list, it would never do any
work.
Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
Diffstat (limited to 'fs/bcachefs/bkey_sort.h')
0 files changed, 0 insertions, 0 deletions