aboutsummaryrefslogtreecommitdiffstats
path: root/tools/perf/scripts/python/export-to-postgresql.py
diff options
context:
space:
mode:
authorFilipe Manana <fdmanana@suse.com>2025-04-17 16:44:34 +0100
committerDavid Sterba <dsterba@suse.com>2025-05-15 14:30:51 +0200
commiteeb808422f9be2ca8ba30c0ef1d68f04c7654d87 (patch)
treef3b0f0b77ccb5bf16c19a2ce40fbd4709cee6577 /tools/perf/scripts/python/export-to-postgresql.py
parentbtrfs: avoid unnecessary next node searches when clearing bits from extent range (diff)
downloadlinux-rng-eeb808422f9be2ca8ba30c0ef1d68f04c7654d87.tar.xz
linux-rng-eeb808422f9be2ca8ba30c0ef1d68f04c7654d87.zip
btrfs: avoid repeated extent state processing when converting extent bits
When converting 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>
Diffstat (limited to 'tools/perf/scripts/python/export-to-postgresql.py')
0 files changed, 0 insertions, 0 deletions