projects / linux-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 46fee69) | patch
bcachefs: should_compact_all()
authorKent Overstreet <kent.overstreet@linux.dev>
Fri, 28 Oct 2022 22:56:31 +0000 (18:56 -0400)
committerKent Overstreet <kent.overstreet@linux.dev>
Sun, 22 Oct 2023 21:09:45 +0000 (17:09 -0400)
commit2cb75179694a646e192247cd56b62cf375af3ae9
tree463d72b6ee7e644566aeae2e92cb6958711d85d5tree | snapshot
parent46fee692eebb850b8478531e185fb5a5f942d3eacommit | diff
bcachefs: should_compact_all()

This factors out a properly-documented helper for deciding when we want
to sort a btree node with MAX_BSETS bsets down to a single bset.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
fs/bcachefs/btree_io.c diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)