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 | |
d397712b CM |
26 | /* defrag all the leaves in a given btree. If cache_only == 1, don't read |
27 | * things from disk, otherwise read all the leaves and try to get key order to | |
d352ac68 CM |
28 | * better reflect disk order |
29 | */ | |
d397712b | 30 | |
6702ed49 CM |
31 | int btrfs_defrag_leaves(struct btrfs_trans_handle *trans, |
32 | struct btrfs_root *root, int cache_only) | |
33 | { | |
34 | struct btrfs_path *path = NULL; | |
e7a84565 | 35 | struct btrfs_key key; |
6702ed49 CM |
36 | int ret = 0; |
37 | int wret; | |
38 | int level; | |
39 | int orig_level; | |
e9d0b13b | 40 | int is_extent = 0; |
e7a84565 | 41 | int next_key_ret = 0; |
e9d0b13b | 42 | u64 last_ret = 0; |
3f157a2f CM |
43 | u64 min_trans = 0; |
44 | ||
45 | if (cache_only) | |
46 | goto out; | |
e9d0b13b | 47 | |
e7a84565 | 48 | if (root->fs_info->extent_root == root) { |
1b1e2135 CM |
49 | /* |
50 | * there's recursion here right now in the tree locking, | |
51 | * we can't defrag the extent root without deadlock | |
52 | */ | |
53 | goto out; | |
e7a84565 | 54 | } |
925baedd | 55 | |
e9d0b13b | 56 | if (root->ref_cows == 0 && !is_extent) |
6702ed49 | 57 | goto out; |
5f39d397 | 58 | |
9afbb0b7 CM |
59 | if (btrfs_test_opt(root, SSD)) |
60 | goto out; | |
61 | ||
6702ed49 CM |
62 | path = btrfs_alloc_path(); |
63 | if (!path) | |
64 | return -ENOMEM; | |
65 | ||
5f39d397 | 66 | level = btrfs_header_level(root->node); |
6702ed49 | 67 | orig_level = level; |
0f1ebbd1 | 68 | |
d397712b | 69 | if (level == 0) |
6702ed49 | 70 | goto out; |
d397712b | 71 | |
6702ed49 | 72 | if (root->defrag_progress.objectid == 0) { |
e7a84565 | 73 | struct extent_buffer *root_node; |
0ef3e66b CM |
74 | u32 nritems; |
75 | ||
e7a84565 | 76 | root_node = btrfs_lock_root_node(root); |
b4ce94de | 77 | btrfs_set_lock_blocking(root_node); |
e7a84565 | 78 | nritems = btrfs_header_nritems(root_node); |
0ef3e66b CM |
79 | root->defrag_max.objectid = 0; |
80 | /* from above we know this is not a leaf */ | |
e7a84565 | 81 | btrfs_node_key_to_cpu(root_node, &root->defrag_max, |
0ef3e66b | 82 | nritems - 1); |
e7a84565 CM |
83 | btrfs_tree_unlock(root_node); |
84 | free_extent_buffer(root_node); | |
85 | memset(&key, 0, sizeof(key)); | |
6702ed49 | 86 | } else { |
e7a84565 | 87 | memcpy(&key, &root->defrag_progress, sizeof(key)); |
6702ed49 CM |
88 | } |
89 | ||
e7a84565 | 90 | path->keep_locks = 1; |
3f157a2f CM |
91 | if (cache_only) |
92 | min_trans = root->defrag_trans_start; | |
93 | ||
e02119d5 CM |
94 | ret = btrfs_search_forward(root, &key, NULL, path, |
95 | cache_only, min_trans); | |
3f157a2f CM |
96 | if (ret < 0) |
97 | goto out; | |
98 | if (ret > 0) { | |
99 | ret = 0; | |
100 | goto out; | |
101 | } | |
102 | btrfs_release_path(root, path); | |
e7a84565 | 103 | wret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
6702ed49 | 104 | |
e7a84565 CM |
105 | if (wret < 0) { |
106 | ret = wret; | |
107 | goto out; | |
108 | } | |
109 | if (!path->nodes[1]) { | |
110 | ret = 0; | |
111 | goto out; | |
112 | } | |
113 | path->slots[1] = btrfs_header_nritems(path->nodes[1]); | |
3f157a2f CM |
114 | next_key_ret = btrfs_find_next_key(root, path, &key, 1, cache_only, |
115 | min_trans); | |
e7a84565 CM |
116 | ret = btrfs_realloc_node(trans, root, |
117 | path->nodes[1], 0, | |
118 | cache_only, &last_ret, | |
119 | &root->defrag_progress); | |
120 | WARN_ON(ret && ret != -EAGAIN); | |
121 | if (next_key_ret == 0) { | |
122 | memcpy(&root->defrag_progress, &key, sizeof(key)); | |
123 | ret = -EAGAIN; | |
6702ed49 | 124 | } |
e7a84565 | 125 | |
3f157a2f | 126 | btrfs_release_path(root, path); |
e7a84565 CM |
127 | if (is_extent) |
128 | btrfs_extent_post_op(trans, root); | |
6702ed49 CM |
129 | out: |
130 | if (path) | |
131 | btrfs_free_path(path); | |
0ef3e66b CM |
132 | if (ret == -EAGAIN) { |
133 | if (root->defrag_max.objectid > root->defrag_progress.objectid) | |
134 | goto done; | |
135 | if (root->defrag_max.type > root->defrag_progress.type) | |
136 | goto done; | |
137 | if (root->defrag_max.offset > root->defrag_progress.offset) | |
138 | goto done; | |
139 | ret = 0; | |
140 | } | |
141 | done: | |
6702ed49 CM |
142 | if (ret != -EAGAIN) { |
143 | memset(&root->defrag_progress, 0, | |
144 | sizeof(root->defrag_progress)); | |
3f157a2f | 145 | root->defrag_trans_start = trans->transid; |
6702ed49 CM |
146 | } |
147 | return ret; | |
148 | } |