diff options
author | Jeff Mahoney <jeffm@suse.com> | 2016-06-22 18:54:23 -0400 |
---|---|---|
committer | David Sterba <dsterba@suse.com> | 2016-12-06 10:06:59 -0500 |
commit | ccdf9b305a49875d49dbaec6f8d2440abb0b1994 (patch) | |
tree | 0b1ac124531f45ba7e7997bc89572165cb774a43 /fs/btrfs/delayed-inode.c | |
parent | 0b246afa62b0cf5b09d078121f543135f28492ad (diff) |
btrfs: root->fs_info cleanup, access fs_info->delayed_root directly
This results in btrfs_assert_delayed_root_empty and
btrfs_destroy_delayed_inode taking an fs_info instead of a root.
Signed-off-by: Jeff Mahoney <jeffm@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
Diffstat (limited to 'fs/btrfs/delayed-inode.c')
-rw-r--r-- | fs/btrfs/delayed-inode.c | 23 |
1 files changed, 6 insertions, 17 deletions
diff --git a/fs/btrfs/delayed-inode.c b/fs/btrfs/delayed-inode.c index d7d5eb989f7d..c8ffceb2aff9 100644 --- a/fs/btrfs/delayed-inode.c +++ b/fs/btrfs/delayed-inode.c | |||
@@ -72,12 +72,6 @@ static inline int btrfs_is_continuous_delayed_item( | |||
72 | return 0; | 72 | return 0; |
73 | } | 73 | } |
74 | 74 | ||
75 | static inline struct btrfs_delayed_root *btrfs_get_delayed_root( | ||
76 | struct btrfs_root *root) | ||
77 | { | ||
78 | return root->fs_info->delayed_root; | ||
79 | } | ||
80 | |||
81 | static struct btrfs_delayed_node *btrfs_get_delayed_node(struct inode *inode) | 75 | static struct btrfs_delayed_node *btrfs_get_delayed_node(struct inode *inode) |
82 | { | 76 | { |
83 | struct btrfs_inode *btrfs_inode = BTRFS_I(inode); | 77 | struct btrfs_inode *btrfs_inode = BTRFS_I(inode); |
@@ -1163,7 +1157,7 @@ static int __btrfs_run_delayed_items(struct btrfs_trans_handle *trans, | |||
1163 | block_rsv = trans->block_rsv; | 1157 | block_rsv = trans->block_rsv; |
1164 | trans->block_rsv = &fs_info->delayed_block_rsv; | 1158 | trans->block_rsv = &fs_info->delayed_block_rsv; |
1165 | 1159 | ||
1166 | delayed_root = btrfs_get_delayed_root(root); | 1160 | delayed_root = fs_info->delayed_root; |
1167 | 1161 | ||
1168 | curr_node = btrfs_first_delayed_node(delayed_root); | 1162 | curr_node = btrfs_first_delayed_node(delayed_root); |
1169 | while (curr_node && (!count || (count && nr--))) { | 1163 | while (curr_node && (!count || (count && nr--))) { |
@@ -1390,11 +1384,9 @@ static int btrfs_wq_run_delayed_node(struct btrfs_delayed_root *delayed_root, | |||
1390 | return 0; | 1384 | return 0; |
1391 | } | 1385 | } |
1392 | 1386 | ||
1393 | void btrfs_assert_delayed_root_empty(struct btrfs_root *root) | 1387 | void btrfs_assert_delayed_root_empty(struct btrfs_fs_info *fs_info) |
1394 | { | 1388 | { |
1395 | struct btrfs_delayed_root *delayed_root; | 1389 | WARN_ON(btrfs_first_delayed_node(fs_info->delayed_root)); |
1396 | delayed_root = btrfs_get_delayed_root(root); | ||
1397 | WARN_ON(btrfs_first_delayed_node(delayed_root)); | ||
1398 | } | 1390 | } |
1399 | 1391 | ||
1400 | static int could_end_wait(struct btrfs_delayed_root *delayed_root, int seq) | 1392 | static int could_end_wait(struct btrfs_delayed_root *delayed_root, int seq) |
@@ -1415,7 +1407,7 @@ void btrfs_balance_delayed_items(struct btrfs_root *root) | |||
1415 | struct btrfs_delayed_root *delayed_root; | 1407 | struct btrfs_delayed_root *delayed_root; |
1416 | struct btrfs_fs_info *fs_info = root->fs_info; | 1408 | struct btrfs_fs_info *fs_info = root->fs_info; |
1417 | 1409 | ||
1418 | delayed_root = btrfs_get_delayed_root(root); | 1410 | delayed_root = fs_info->delayed_root; |
1419 | 1411 | ||
1420 | if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) | 1412 | if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) |
1421 | return; | 1413 | return; |
@@ -1980,14 +1972,11 @@ void btrfs_kill_all_delayed_nodes(struct btrfs_root *root) | |||
1980 | } | 1972 | } |
1981 | } | 1973 | } |
1982 | 1974 | ||
1983 | void btrfs_destroy_delayed_inodes(struct btrfs_root *root) | 1975 | void btrfs_destroy_delayed_inodes(struct btrfs_fs_info *fs_info) |
1984 | { | 1976 | { |
1985 | struct btrfs_delayed_root *delayed_root; | ||
1986 | struct btrfs_delayed_node *curr_node, *prev_node; | 1977 | struct btrfs_delayed_node *curr_node, *prev_node; |
1987 | 1978 | ||
1988 | delayed_root = btrfs_get_delayed_root(root); | 1979 | curr_node = btrfs_first_delayed_node(fs_info->delayed_root); |
1989 | |||
1990 | curr_node = btrfs_first_delayed_node(delayed_root); | ||
1991 | while (curr_node) { | 1980 | while (curr_node) { |
1992 | __btrfs_kill_delayed_node(curr_node); | 1981 | __btrfs_kill_delayed_node(curr_node); |
1993 | 1982 | ||