Commit | Line | Data |
---|---|---|
6702ed49 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. All rights reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public | |
6 | * License v2 as published by the Free Software Foundation. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
11 | * General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public | |
14 | * License along with this program; if not, write to the | |
15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
16 | * Boston, MA 021110-1307, USA. | |
17 | */ | |
18 | ||
19 | #include <linux/sched.h> | |
20 | #include "ctree.h" | |
21 | #include "disk-io.h" | |
22 | #include "print-tree.h" | |
23 | #include "transaction.h" | |
e7a84565 | 24 | #include "locking.h" |
6702ed49 | 25 | |
de78b51a ES |
26 | /* |
27 | * Defrag all the leaves in a given btree. | |
28 | * Read all the leaves and try to get key order to | |
d352ac68 CM |
29 | * better reflect disk order |
30 | */ | |
d397712b | 31 | |
6702ed49 | 32 | int btrfs_defrag_leaves(struct btrfs_trans_handle *trans, |
de78b51a | 33 | struct btrfs_root *root) |
6702ed49 CM |
34 | { |
35 | struct btrfs_path *path = NULL; | |
e7a84565 | 36 | struct btrfs_key key; |
6702ed49 CM |
37 | int ret = 0; |
38 | int wret; | |
39 | int level; | |
e7a84565 | 40 | int next_key_ret = 0; |
e9d0b13b | 41 | u64 last_ret = 0; |
3f157a2f CM |
42 | u64 min_trans = 0; |
43 | ||
e7a84565 | 44 | if (root->fs_info->extent_root == root) { |
1b1e2135 CM |
45 | /* |
46 | * there's recursion here right now in the tree locking, | |
47 | * we can't defrag the extent root without deadlock | |
48 | */ | |
49 | goto out; | |
e7a84565 | 50 | } |
925baedd | 51 | |
27cdeb70 | 52 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
6702ed49 | 53 | goto out; |
5f39d397 | 54 | |
9afbb0b7 CM |
55 | if (btrfs_test_opt(root, SSD)) |
56 | goto out; | |
57 | ||
6702ed49 CM |
58 | path = btrfs_alloc_path(); |
59 | if (!path) | |
60 | return -ENOMEM; | |
61 | ||
5f39d397 | 62 | level = btrfs_header_level(root->node); |
0f1ebbd1 | 63 | |
d397712b | 64 | if (level == 0) |
6702ed49 | 65 | goto out; |
d397712b | 66 | |
6702ed49 | 67 | if (root->defrag_progress.objectid == 0) { |
e7a84565 | 68 | struct extent_buffer *root_node; |
0ef3e66b CM |
69 | u32 nritems; |
70 | ||
e7a84565 | 71 | root_node = btrfs_lock_root_node(root); |
b4ce94de | 72 | btrfs_set_lock_blocking(root_node); |
e7a84565 | 73 | nritems = btrfs_header_nritems(root_node); |
0ef3e66b CM |
74 | root->defrag_max.objectid = 0; |
75 | /* from above we know this is not a leaf */ | |
e7a84565 | 76 | btrfs_node_key_to_cpu(root_node, &root->defrag_max, |
0ef3e66b | 77 | nritems - 1); |
e7a84565 CM |
78 | btrfs_tree_unlock(root_node); |
79 | free_extent_buffer(root_node); | |
80 | memset(&key, 0, sizeof(key)); | |
6702ed49 | 81 | } else { |
e7a84565 | 82 | memcpy(&key, &root->defrag_progress, sizeof(key)); |
6702ed49 CM |
83 | } |
84 | ||
e7a84565 | 85 | path->keep_locks = 1; |
3f157a2f | 86 | |
6174d3cb | 87 | ret = btrfs_search_forward(root, &key, path, min_trans); |
3f157a2f CM |
88 | if (ret < 0) |
89 | goto out; | |
90 | if (ret > 0) { | |
91 | ret = 0; | |
92 | goto out; | |
93 | } | |
b3b4aa74 | 94 | btrfs_release_path(path); |
e7a84565 | 95 | wret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
6702ed49 | 96 | |
e7a84565 CM |
97 | if (wret < 0) { |
98 | ret = wret; | |
99 | goto out; | |
100 | } | |
101 | if (!path->nodes[1]) { | |
102 | ret = 0; | |
103 | goto out; | |
104 | } | |
105 | path->slots[1] = btrfs_header_nritems(path->nodes[1]); | |
de78b51a | 106 | next_key_ret = btrfs_find_next_key(root, path, &key, 1, |
3f157a2f | 107 | min_trans); |
e7a84565 CM |
108 | ret = btrfs_realloc_node(trans, root, |
109 | path->nodes[1], 0, | |
de78b51a | 110 | &last_ret, |
e7a84565 | 111 | &root->defrag_progress); |
8929ecfa YZ |
112 | if (ret) { |
113 | WARN_ON(ret == -EAGAIN); | |
114 | goto out; | |
115 | } | |
e7a84565 CM |
116 | if (next_key_ret == 0) { |
117 | memcpy(&root->defrag_progress, &key, sizeof(key)); | |
118 | ret = -EAGAIN; | |
6702ed49 | 119 | } |
6702ed49 CM |
120 | out: |
121 | if (path) | |
122 | btrfs_free_path(path); | |
0ef3e66b CM |
123 | if (ret == -EAGAIN) { |
124 | if (root->defrag_max.objectid > root->defrag_progress.objectid) | |
125 | goto done; | |
126 | if (root->defrag_max.type > root->defrag_progress.type) | |
127 | goto done; | |
128 | if (root->defrag_max.offset > root->defrag_progress.offset) | |
129 | goto done; | |
130 | ret = 0; | |
131 | } | |
132 | done: | |
6702ed49 CM |
133 | if (ret != -EAGAIN) { |
134 | memset(&root->defrag_progress, 0, | |
135 | sizeof(root->defrag_progress)); | |
3f157a2f | 136 | root->defrag_trans_start = trans->transid; |
6702ed49 CM |
137 | } |
138 | return ret; | |
139 | } |