btrfs: use rb_find_add() in insert_block_entry()

Use the rb-tree helper so we don't open code the search and insert
code.

Signed-off-by: Yangtao Li <frank.li@vivo.com>
Signed-off-by: Pan Chuang <panchuang@vivo.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
Yangtao Li 2025-05-16 11:03:24 +08:00 committed by David Sterba
parent 4044a7ed3b
commit 3f60f4374a

View File

@ -88,27 +88,20 @@ static int block_entry_bytenr_key_cmp(const void *key, const struct rb_node *nod
return 0;
}
static int block_entry_bytenr_cmp(struct rb_node *new, const struct rb_node *existing)
{
const struct block_entry *new_entry = rb_entry(new, struct block_entry, node);
return block_entry_bytenr_key_cmp(&new_entry->bytenr, existing);
}
static struct block_entry *insert_block_entry(struct rb_root *root,
struct block_entry *be)
{
struct rb_node **p = &root->rb_node;
struct rb_node *parent_node = NULL;
struct block_entry *entry;
struct rb_node *node;
while (*p) {
parent_node = *p;
entry = rb_entry(parent_node, struct block_entry, node);
if (entry->bytenr > be->bytenr)
p = &(*p)->rb_left;
else if (entry->bytenr < be->bytenr)
p = &(*p)->rb_right;
else
return entry;
}
rb_link_node(&be->node, parent_node, p);
rb_insert_color(&be->node, root);
return NULL;
node = rb_find_add(&be->node, root, block_entry_bytenr_cmp);
return rb_entry_safe(node, struct block_entry, node);
}
static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr)