projects / linux-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 15bc094) | patch
bcachefs: Always rebuild aux search trees when node boundaries change
authorKent Overstreet <kent.overstreet@gmail.com>
Wed, 17 Aug 2022 18:20:48 +0000 (14:20 -0400)
committerKent Overstreet <kent.overstreet@linux.dev>
Sun, 22 Oct 2023 21:09:38 +0000 (17:09 -0400)
commitbbf4288401519a7554201caf9b945c79f29753b3
treeb11e5a578999a8d9b9c79acefe0632e23a284d4btree | snapshot
parent15bc0948e73d9a858a6b69fc4eb34d176436044ccommit | diff
bcachefs: Always rebuild aux search trees when node boundaries change

Topology repair may change btree node min/max keys: when it does so, we
need to always rebuild eytzinger search trees because nodes directly
depend on those values.

This fixes a bug found by the 'kill_btree_node' test, where we'd pop an
assertion in bch2_bset_search_linear().

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