projects / linux-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 43b9fec) | patch
bcachefs: Fix accidental O(n^2) in fiemap
authorKent Overstreet <kent.overstreet@linux.dev>
Wed, 14 May 2025 17:40:47 +0000 (13:40 -0400)
committerKent Overstreet <kent.overstreet@linux.dev>
Wed, 14 May 2025 21:05:19 +0000 (17:05 -0400)
commita12cb6f758177fcf9bdb7d18b4724eaa29023740
tree35d86a97aec43455b9e3cc291fd4a3f93fe2f1d0tree
parent43b9fece2d9687cde58cc7eec4548dd1c35e2198commit | diff
bcachefs: Fix accidental O(n^2) in fiemap

Since bch2_seek_pagecache_data() searches for dirty data, we only want
to call it for holes in the extents btree - otherwise we have an
accidental O(n^2), as we repeatedly search the same range.

Reported-by: Marcin Mirosław <marcin@mejor.pl>
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
fs/bcachefs/fs.c diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)