mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-08-26 19:00:25 +00:00
Btrfs: make tree_search_offset more flexible in its searching
Sometimes we end up freeing a reserved extent because we don't need it, however this means that its possible for transaction->last_alloc to point to the middle of a free area. When we search for free space in find_free_space we do a tree_search_offset with contains set to 0, because we want it to find the next best free area if we do not have an offset starting on the given offset. Unfortunately that currently means that if the offset we were given as a hint points to the middle of a free area, we won't find anything. This is especially bad if we happened to last allocate from the big huge chunk of a newly formed block group, since we won't find anything and have to go back and search the long way around. This fixes this problem by making it so that we return the free space area regardless of the contains variable. This made cache missing happen _alot_ less, and speeds things up considerably. Signed-off-by: Josef Bacik <jbacik@redhat.com>
This commit is contained in:
parent
a3dddf3fc8
commit
37d3cdddf5
1 changed files with 2 additions and 2 deletions
|
@ -90,8 +90,8 @@ static struct btrfs_free_space *tree_search_offset(struct rb_root *root,
|
|||
ret = entry;
|
||||
n = n->rb_left;
|
||||
} else if (offset > entry->offset) {
|
||||
if (contains &&
|
||||
(entry->offset + entry->bytes - 1) >= offset) {
|
||||
if ((entry->offset + entry->bytes - 1) >= offset &&
|
||||
bytes <= entry->bytes) {
|
||||
ret = entry;
|
||||
break;
|
||||
}
|
||||
|
|
Loading…
Reference in a new issue