btrfs: backref: rename and move drop_backref_node()
With extra comment for drop_backref_node() as it has some similarity with remove_backref_node(), thus we need extra comment explaining the difference. Signed-off-by: Qu Wenruo <wqu@suse.com> Reviewed-by: David Sterba <dsterba@suse.com> Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
@@ -311,4 +311,43 @@ static inline void btrfs_backref_free_edge(struct btrfs_backref_cache *cache,
|
||||
}
|
||||
}
|
||||
|
||||
static inline void btrfs_backref_unlock_node_buffer(
|
||||
struct btrfs_backref_node *node)
|
||||
{
|
||||
if (node->locked) {
|
||||
btrfs_tree_unlock(node->eb);
|
||||
node->locked = 0;
|
||||
}
|
||||
}
|
||||
|
||||
static inline void btrfs_backref_drop_node_buffer(
|
||||
struct btrfs_backref_node *node)
|
||||
{
|
||||
if (node->eb) {
|
||||
btrfs_backref_unlock_node_buffer(node);
|
||||
free_extent_buffer(node->eb);
|
||||
node->eb = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Drop the backref node from cache without cleaning up its children
|
||||
* edges.
|
||||
*
|
||||
* This can only be called on node without parent edges.
|
||||
* The children edges are still kept as is.
|
||||
*/
|
||||
static inline void btrfs_backref_drop_node(struct btrfs_backref_cache *tree,
|
||||
struct btrfs_backref_node *node)
|
||||
{
|
||||
BUG_ON(!list_empty(&node->upper));
|
||||
|
||||
btrfs_backref_drop_node_buffer(node);
|
||||
list_del(&node->list);
|
||||
list_del(&node->lower);
|
||||
if (!RB_EMPTY_NODE(&node->rb_node))
|
||||
rb_erase(&node->rb_node, &tree->rb_root);
|
||||
btrfs_backref_free_node(tree, node);
|
||||
}
|
||||
|
||||
#endif
|
||||
|
Reference in New Issue
Block a user