Commit e17385ca authored by David Sterba's avatar David Sterba

btrfs: remove unused member btrfs_root::name

Added in 58176a96 ("Btrfs: Add per-root block accounting and sysfs
entries") in 2007, the roots had names exported in sysfs. The code
was commented out in 4df27c4d ("Btrfs: change how subvolumes
are organized") and cleaned by 182608c8 ("btrfs: remove old
unused commented out code").
Signed-off-by: default avatarDavid Sterba <dsterba@suse.com>
parent 616d374e
...@@ -1219,7 +1219,6 @@ struct btrfs_root { ...@@ -1219,7 +1219,6 @@ struct btrfs_root {
u64 defrag_trans_start; u64 defrag_trans_start;
struct btrfs_key defrag_progress; struct btrfs_key defrag_progress;
struct btrfs_key defrag_max; struct btrfs_key defrag_max;
char *name;
/* the dirty list is only used by non-reference counted roots */ /* the dirty list is only used by non-reference counted roots */
struct list_head dirty_list; struct list_head dirty_list;
......
...@@ -1154,7 +1154,6 @@ static void __setup_root(struct btrfs_root *root, struct btrfs_fs_info *fs_info, ...@@ -1154,7 +1154,6 @@ static void __setup_root(struct btrfs_root *root, struct btrfs_fs_info *fs_info,
root->highest_objectid = 0; root->highest_objectid = 0;
root->nr_delalloc_inodes = 0; root->nr_delalloc_inodes = 0;
root->nr_ordered_extents = 0; root->nr_ordered_extents = 0;
root->name = NULL;
root->inode_tree = RB_ROOT; root->inode_tree = RB_ROOT;
INIT_RADIX_TREE(&root->delayed_nodes_tree, GFP_ATOMIC); INIT_RADIX_TREE(&root->delayed_nodes_tree, GFP_ATOMIC);
root->block_rsv = NULL; root->block_rsv = NULL;
...@@ -3849,7 +3848,6 @@ static void free_fs_root(struct btrfs_root *root) ...@@ -3849,7 +3848,6 @@ static void free_fs_root(struct btrfs_root *root)
free_extent_buffer(root->commit_root); free_extent_buffer(root->commit_root);
kfree(root->free_ino_ctl); kfree(root->free_ino_ctl);
kfree(root->free_ino_pinned); kfree(root->free_ino_pinned);
kfree(root->name);
btrfs_put_fs_root(root); btrfs_put_fs_root(root);
} }
......
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