btrfs: drop unused parameter refs from visit_node_for_delete()

The parameter duplicates what can be effectively obtained from
wc->refs[level - 1] and this is what's actually used inside. Added in
commit 2b73c7e761c4 ("btrfs: unify logic to decide if we need to walk
down into a node during snapshot delete").

Reviewed-by: Anand Jain <anand.jain@oracle.com>
Signed-off-by: David Sterba <dsterba@suse.com>

diff --git a/fs/btrfs/extent-tree.c b/fs/btrfs/extent-tree.c
index 79373f0ab6cee339c1223cf6cf7e49dc648b9fe9..e29024c66edbf95bdb93cbe111c9e50260ed69b2 100644 (file)
--- a/fs/btrfs/extent-tree.c
+++ b/fs/btrfs/extent-tree.c
@@ -5270,7 +5270,7 @@ struct walk_control {
  * corrupted file systems must have been caught before calling this function.
  */
 static bool visit_node_for_delete(struct btrfs_root *root, struct walk_control *wc,
-                                 struct extent_buffer *eb, u64 refs, u64 flags, int slot)
+                                 struct extent_buffer *eb, u64 flags, int slot)
 {
        struct btrfs_key key;
        u64 generation;
@@ -5384,7 +5384,7 @@ static noinline void reada_walk_down(struct btrfs_trans_handle *trans,
                        continue;
 
                /* If we don't need to visit this node don't reada. */
-               if (!visit_node_for_delete(root, wc, eb, refs, flags, slot))
+               if (!visit_node_for_delete(root, wc, eb, flags, slot))
                        continue;
 reada:
                btrfs_readahead_node_child(eb, slot);
@@ -5737,8 +5737,7 @@ static noinline int do_walk_down(struct btrfs_trans_handle *trans,
 
        /* If we don't have to walk into this node skip it. */
        if (!visit_node_for_delete(root, wc, path->nodes[level],
-                                  wc->refs[level - 1], wc->flags[level - 1],
-                                  path->slots[level]))
+                                  wc->flags[level - 1], path->slots[level]))
                goto skip;
 
        /*