Commit d68194b2 authored by David Sterba's avatar David Sterba

btrfs: sink gfp_t parameter to btrfs_backref_iter_alloc

There's only one caller that passes GFP_NOFS, we can drop the parameter
an use the flags directly.
Reviewed-by: default avatarAnand Jain <anand.jain@oracle.com>
Reviewed-by: default avatarJohannes Thumshirn <johannes.thumshirn@wdc.com>
Signed-off-by: default avatarDavid Sterba <dsterba@suse.com>
parent e9c83077
...@@ -2650,12 +2650,11 @@ void free_ipath(struct inode_fs_paths *ipath) ...@@ -2650,12 +2650,11 @@ void free_ipath(struct inode_fs_paths *ipath)
kfree(ipath); kfree(ipath);
} }
struct btrfs_backref_iter *btrfs_backref_iter_alloc( struct btrfs_backref_iter *btrfs_backref_iter_alloc(struct btrfs_fs_info *fs_info)
struct btrfs_fs_info *fs_info, gfp_t gfp_flag)
{ {
struct btrfs_backref_iter *ret; struct btrfs_backref_iter *ret;
ret = kzalloc(sizeof(*ret), gfp_flag); ret = kzalloc(sizeof(*ret), GFP_NOFS);
if (!ret) if (!ret)
return NULL; return NULL;
......
...@@ -156,8 +156,7 @@ struct btrfs_backref_iter { ...@@ -156,8 +156,7 @@ struct btrfs_backref_iter {
u32 end_ptr; u32 end_ptr;
}; };
struct btrfs_backref_iter *btrfs_backref_iter_alloc( struct btrfs_backref_iter *btrfs_backref_iter_alloc(struct btrfs_fs_info *fs_info);
struct btrfs_fs_info *fs_info, gfp_t gfp_flag);
static inline void btrfs_backref_iter_free(struct btrfs_backref_iter *iter) static inline void btrfs_backref_iter_free(struct btrfs_backref_iter *iter)
{ {
......
...@@ -473,7 +473,7 @@ static noinline_for_stack struct btrfs_backref_node *build_backref_tree( ...@@ -473,7 +473,7 @@ static noinline_for_stack struct btrfs_backref_node *build_backref_tree(
int ret; int ret;
int err = 0; int err = 0;
iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info, GFP_NOFS); iter = btrfs_backref_iter_alloc(rc->extent_root->fs_info);
if (!iter) if (!iter)
return ERR_PTR(-ENOMEM); return ERR_PTR(-ENOMEM);
path = btrfs_alloc_path(); path = btrfs_alloc_path();
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment