github-mirror/linux
1
0
Fork 0
mirror of https://github.com/torvalds/linux.git synced 2026-06-05 13:06:59 +02:00
Code Issues Actions Packages Projects Releases Wiki Activity Graph

btrfs: avoid repeated extent state processing when setting extent bits

Browse Source 
When setting bits for an extent range, if we find an extent state with
its start offset greater than current start offset, we insert a new extent
state to cover the gap, with its end offset computed and stored in the
@this_end local variable, and after the insertion we update the current
start offset to @this_end + 1. However if the insert_state() call resulted
in an extent state merge then the end offset of the merged extent may be
greater than @this_end and if that's the case, since we jump to the
'search_again' label, we'll do a full tree search that will leave us in
the same extent state - this is harmless but wastes time by doing a
pointless tree search and extent state processing.

So improve on this by updating the current start offset to the end offset
of the inserted state plus 1. This also removes the use of the @this_end
variable and directly set the value in the prealloc extent state to avoid
any confusion and misuse in the future.

Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Filipe Manana 2025-04-17 16:22:50 +01:00 committed by David Sterba
parent 8faab454c5
commit b61dd9b1cb
1 changed files with 6 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
fs/btrfs/extent-io-tree.c
View File

@ -1199,14 +1199,8 @@ static int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
* extent we found.
*/
if (state->start > start) {
u64 this_end;
struct extent_state *inserted_state;
if (end < last_start)
this_end = end;
else
this_end = last_start - 1;
prealloc = alloc_extent_state_atomic(prealloc);
if (!prealloc)
goto search_again;
@ -1216,7 +1210,11 @@ static int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
* extent.
*/
prealloc->start = start;
prealloc->end = this_end;
if (end < last_start)
prealloc->end = end;
else
prealloc->end = last_start - 1;
inserted_state = insert_state(tree, prealloc, bits, changeset);
if (IS_ERR(inserted_state)) {
ret = PTR_ERR(inserted_state);
@ -1227,7 +1225,7 @@ static int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
cache_state(inserted_state, cached_state);
if (inserted_state == prealloc)
prealloc = NULL;
start = this_end + 1;
start = inserted_state->end + 1;
goto search_again;
}
/*