Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
6702ed49 CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
6702ed49 CM |
4 | */ |
5 | ||
6 | #include <linux/sched.h> | |
7 | #include "ctree.h" | |
8 | #include "disk-io.h" | |
9 | #include "print-tree.h" | |
10 | #include "transaction.h" | |
e7a84565 | 11 | #include "locking.h" |
6702ed49 | 12 | |
de78b51a ES |
13 | /* |
14 | * Defrag all the leaves in a given btree. | |
15 | * Read all the leaves and try to get key order to | |
d352ac68 CM |
16 | * better reflect disk order |
17 | */ | |
d397712b | 18 | |
6702ed49 | 19 | int btrfs_defrag_leaves(struct btrfs_trans_handle *trans, |
de78b51a | 20 | struct btrfs_root *root) |
6702ed49 CM |
21 | { |
22 | struct btrfs_path *path = NULL; | |
e7a84565 | 23 | struct btrfs_key key; |
6702ed49 CM |
24 | int ret = 0; |
25 | int wret; | |
26 | int level; | |
e7a84565 | 27 | int next_key_ret = 0; |
e9d0b13b | 28 | u64 last_ret = 0; |
3f157a2f | 29 | |
e7a84565 | 30 | if (root->fs_info->extent_root == root) { |
1b1e2135 CM |
31 | /* |
32 | * there's recursion here right now in the tree locking, | |
33 | * we can't defrag the extent root without deadlock | |
34 | */ | |
35 | goto out; | |
e7a84565 | 36 | } |
925baedd | 37 | |
92a7cc42 | 38 | if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) |
6702ed49 | 39 | goto out; |
5f39d397 | 40 | |
6702ed49 CM |
41 | path = btrfs_alloc_path(); |
42 | if (!path) | |
43 | return -ENOMEM; | |
44 | ||
5f39d397 | 45 | level = btrfs_header_level(root->node); |
0f1ebbd1 | 46 | |
d397712b | 47 | if (level == 0) |
6702ed49 | 48 | goto out; |
d397712b | 49 | |
6702ed49 | 50 | if (root->defrag_progress.objectid == 0) { |
e7a84565 | 51 | struct extent_buffer *root_node; |
0ef3e66b CM |
52 | u32 nritems; |
53 | ||
e7a84565 CM |
54 | root_node = btrfs_lock_root_node(root); |
55 | nritems = btrfs_header_nritems(root_node); | |
0ef3e66b CM |
56 | root->defrag_max.objectid = 0; |
57 | /* from above we know this is not a leaf */ | |
e7a84565 | 58 | btrfs_node_key_to_cpu(root_node, &root->defrag_max, |
0ef3e66b | 59 | nritems - 1); |
e7a84565 CM |
60 | btrfs_tree_unlock(root_node); |
61 | free_extent_buffer(root_node); | |
62 | memset(&key, 0, sizeof(key)); | |
6702ed49 | 63 | } else { |
e7a84565 | 64 | memcpy(&key, &root->defrag_progress, sizeof(key)); |
6702ed49 CM |
65 | } |
66 | ||
e7a84565 | 67 | path->keep_locks = 1; |
3f157a2f | 68 | |
7c829b72 | 69 | ret = btrfs_search_forward(root, &key, path, BTRFS_OLDEST_GENERATION); |
3f157a2f CM |
70 | if (ret < 0) |
71 | goto out; | |
72 | if (ret > 0) { | |
73 | ret = 0; | |
74 | goto out; | |
75 | } | |
b3b4aa74 | 76 | btrfs_release_path(path); |
0376374a FM |
77 | /* |
78 | * We don't need a lock on a leaf. btrfs_realloc_node() will lock all | |
79 | * leafs from path->nodes[1], so set lowest_level to 1 to avoid later | |
80 | * a deadlock (attempting to write lock an already write locked leaf). | |
81 | */ | |
82 | path->lowest_level = 1; | |
e7a84565 | 83 | wret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
6702ed49 | 84 | |
e7a84565 CM |
85 | if (wret < 0) { |
86 | ret = wret; | |
87 | goto out; | |
88 | } | |
89 | if (!path->nodes[1]) { | |
90 | ret = 0; | |
91 | goto out; | |
92 | } | |
0376374a FM |
93 | /* |
94 | * The node at level 1 must always be locked when our path has | |
95 | * keep_locks set and lowest_level is 1, regardless of the value of | |
96 | * path->slots[1]. | |
97 | */ | |
98 | BUG_ON(path->locks[1] == 0); | |
e7a84565 CM |
99 | ret = btrfs_realloc_node(trans, root, |
100 | path->nodes[1], 0, | |
de78b51a | 101 | &last_ret, |
e7a84565 | 102 | &root->defrag_progress); |
8929ecfa YZ |
103 | if (ret) { |
104 | WARN_ON(ret == -EAGAIN); | |
105 | goto out; | |
106 | } | |
0376374a FM |
107 | /* |
108 | * Now that we reallocated the node we can find the next key. Note that | |
109 | * btrfs_find_next_key() can release our path and do another search | |
110 | * without COWing, this is because even with path->keep_locks = 1, | |
111 | * btrfs_search_slot() / ctree.c:unlock_up() does not keeps a lock on a | |
112 | * node when path->slots[node_level - 1] does not point to the last | |
113 | * item or a slot beyond the last item (ctree.c:unlock_up()). Therefore | |
114 | * we search for the next key after reallocating our node. | |
115 | */ | |
116 | path->slots[1] = btrfs_header_nritems(path->nodes[1]); | |
117 | next_key_ret = btrfs_find_next_key(root, path, &key, 1, | |
7c829b72 | 118 | BTRFS_OLDEST_GENERATION); |
e7a84565 CM |
119 | if (next_key_ret == 0) { |
120 | memcpy(&root->defrag_progress, &key, sizeof(key)); | |
121 | ret = -EAGAIN; | |
6702ed49 | 122 | } |
6702ed49 | 123 | out: |
527afb44 | 124 | btrfs_free_path(path); |
0ef3e66b CM |
125 | if (ret == -EAGAIN) { |
126 | if (root->defrag_max.objectid > root->defrag_progress.objectid) | |
127 | goto done; | |
128 | if (root->defrag_max.type > root->defrag_progress.type) | |
129 | goto done; | |
130 | if (root->defrag_max.offset > root->defrag_progress.offset) | |
131 | goto done; | |
132 | ret = 0; | |
133 | } | |
134 | done: | |
a2570ef3 | 135 | if (ret != -EAGAIN) |
6702ed49 CM |
136 | memset(&root->defrag_progress, 0, |
137 | sizeof(root->defrag_progress)); | |
a2570ef3 | 138 | |
6702ed49 CM |
139 | return ret; |
140 | } |