* Returns 1 if it had to move up and next. 0 is returned if it moved only next
  * or down.
  */
-static int tree_advance(struct btrfs_fs_info *fs_info,
-                       struct btrfs_path *path,
+static int tree_advance(struct btrfs_path *path,
                        int *level, int root_level,
                        int allow_down,
                        struct btrfs_key *key)
 
        while (1) {
                if (advance_left && !left_end_reached) {
-                       ret = tree_advance(fs_info, left_path, &left_level,
+                       ret = tree_advance(left_path, &left_level,
                                        left_root_level,
                                        advance_left != ADVANCE_ONLY_NEXT,
                                        &left_key);
                        advance_left = 0;
                }
                if (advance_right && !right_end_reached) {
-                       ret = tree_advance(fs_info, right_path, &right_level,
+                       ret = tree_advance(right_path, &right_level,
                                        right_root_level,
                                        advance_right != ADVANCE_ONLY_NEXT,
                                        &right_key);