diff options
| author | Kent Overstreet <kent.overstreet@gmail.com> | 2020-06-12 22:29:48 -0400 |
|---|---|---|
| committer | Kent Overstreet <kent.overstreet@linux.dev> | 2023-10-22 17:08:41 -0400 |
| commit | bd2bb273a09b93e2a7d79d30458ab5f6f0b3757a (patch) | |
| tree | 8ed7c91566eaef19f442b0a763cf43e08fb72faa /fs/bcachefs/journal.c | |
| parent | 515282ac7d847d567dd3ba802edf34316368bb14 (diff) | |
bcachefs: Don't deadlock when btree node reuse changes lock ordering
Btree node lock ordering is based on the logical key. However, 'struct
btree' may be reused for a different btree node under memory pressure.
This patch uses the new six lock callback to check if a btree node is no
longer the node we wanted to lock before blocking.
Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
Diffstat (limited to 'fs/bcachefs/journal.c')
0 files changed, 0 insertions, 0 deletions