btrfs: use BTRFS_PATH_AUTO_FREE in btrfs_get_name()

This is the trivial pattern for path auto free, initialize at the
beginning and free at the end with some return simplifications.

Reviewed-by: Johannes Thumshirn <johannes.thumshirn@wdc.com>
Signed-off-by: David Sterba <dsterba@suse.com>

diff --git a/fs/btrfs/export.c b/fs/btrfs/export.c
index 0c0b8db82df6ce3d0c090a8622a77e5120403b38..a91eaf0ca34e10923d88e119efe3d923f9a0158f 100644 (file)
--- a/fs/btrfs/export.c
+++ b/fs/btrfs/export.c
@@ -223,7 +223,7 @@ static int btrfs_get_name(struct dentry *parent, char *name,
        struct btrfs_inode *dir = BTRFS_I(d_inode(parent));
        struct btrfs_root *root = dir->root;
        struct btrfs_fs_info *fs_info = root->fs_info;
-       struct btrfs_path *path;
+       BTRFS_PATH_AUTO_FREE(path);
        struct btrfs_inode_ref *iref;
        struct btrfs_root_ref *rref;
        struct extent_buffer *leaf;
@@ -255,15 +255,12 @@ static int btrfs_get_name(struct dentry *parent, char *name,
 
        ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
        if (ret < 0) {
-               btrfs_free_path(path);
                return ret;
        } else if (ret > 0) {
-               if (ino == BTRFS_FIRST_FREE_OBJECTID) {
+               if (ino == BTRFS_FIRST_FREE_OBJECTID)
                        path->slots[0]--;
-               } else {
-                       btrfs_free_path(path);
+               else
                        return -ENOENT;
-               }
        }
        leaf = path->nodes[0];
 
@@ -280,7 +277,6 @@ static int btrfs_get_name(struct dentry *parent, char *name,
        }
 
        read_extent_buffer(leaf, name, name_ptr, name_len);
-       btrfs_free_path(path);
 
        /*
         * have to add the null termination to make sure that reconnect_path