projects / linux.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: fbb2e65) | patch
btrfs: avoid searching twice for previous node when merging free space entries
authorFilipe Manana <fdmanana@suse.com>
Thu, 4 May 2023 11:04:20 +0000 (12:04 +0100)
committerDavid Sterba <dsterba@suse.com>
Mon, 19 Jun 2023 11:59:23 +0000 (13:59 +0200)
commit9085f42571e53b56b0087237d2e6258f47424938
tree3afbc432d2313724c850731f197f8b9eaf6ca05ftree | snapshot
parentfbb2e654d898f141a2cde37074535d9cec10b03acommit | diff
btrfs: avoid searching twice for previous node when merging free space entries

At try_merge_free_space(), avoid calling twice rb_prev() to find the
previous node, as that requires looping through the red black tree, so
store the result of the rb_prev() call and then use it.

Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
fs/btrfs/free-space-cache.c diff | blob | history
ep93xx device tree rework repo: git://git.maquefel.me/linux.git