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; | |
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 | ||
e7a84565 | 45 | if (root->fs_info->extent_root == root) { |
1b1e2135 CM |
46 | /* |
47 | * there's recursion here right now in the tree locking, | |
48 | * we can't defrag the extent root without deadlock | |
49 | */ | |
50 | goto out; | |
e7a84565 | 51 | } |
925baedd | 52 | |
e9d0b13b | 53 | if (root->ref_cows == 0 && !is_extent) |
6702ed49 | 54 | goto out; |
5f39d397 | 55 | |
9afbb0b7 CM |
56 | if (btrfs_test_opt(root, SSD)) |
57 | goto out; | |
58 | ||
6702ed49 CM |
59 | path = btrfs_alloc_path(); |
60 | if (!path) | |
61 | return -ENOMEM; | |
62 | ||
5f39d397 | 63 | level = btrfs_header_level(root->node); |
0f1ebbd1 | 64 | |
d397712b | 65 | if (level == 0) |
6702ed49 | 66 | goto out; |
d397712b | 67 | |
6702ed49 | 68 | if (root->defrag_progress.objectid == 0) { |
e7a84565 | 69 | struct extent_buffer *root_node; |
0ef3e66b CM |
70 | u32 nritems; |
71 | ||
e7a84565 | 72 | root_node = btrfs_lock_root_node(root); |
b4ce94de | 73 | btrfs_set_lock_blocking(root_node); |
e7a84565 | 74 | nritems = btrfs_header_nritems(root_node); |
0ef3e66b CM |
75 | root->defrag_max.objectid = 0; |
76 | /* from above we know this is not a leaf */ | |
e7a84565 | 77 | btrfs_node_key_to_cpu(root_node, &root->defrag_max, |
0ef3e66b | 78 | nritems - 1); |
e7a84565 CM |
79 | btrfs_tree_unlock(root_node); |
80 | free_extent_buffer(root_node); | |
81 | memset(&key, 0, sizeof(key)); | |
6702ed49 | 82 | } else { |
e7a84565 | 83 | memcpy(&key, &root->defrag_progress, sizeof(key)); |
6702ed49 CM |
84 | } |
85 | ||
e7a84565 | 86 | path->keep_locks = 1; |
3f157a2f | 87 | |
de78b51a | 88 | ret = btrfs_search_forward(root, &key, NULL, path, min_trans); |
3f157a2f CM |
89 | if (ret < 0) |
90 | goto out; | |
91 | if (ret > 0) { | |
92 | ret = 0; | |
93 | goto out; | |
94 | } | |
b3b4aa74 | 95 | btrfs_release_path(path); |
e7a84565 | 96 | wret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
6702ed49 | 97 | |
e7a84565 CM |
98 | if (wret < 0) { |
99 | ret = wret; | |
100 | goto out; | |
101 | } | |
102 | if (!path->nodes[1]) { | |
103 | ret = 0; | |
104 | goto out; | |
105 | } | |
106 | path->slots[1] = btrfs_header_nritems(path->nodes[1]); | |
de78b51a | 107 | next_key_ret = btrfs_find_next_key(root, path, &key, 1, |
3f157a2f | 108 | min_trans); |
e7a84565 CM |
109 | ret = btrfs_realloc_node(trans, root, |
110 | path->nodes[1], 0, | |
de78b51a | 111 | &last_ret, |
e7a84565 | 112 | &root->defrag_progress); |
8929ecfa YZ |
113 | if (ret) { |
114 | WARN_ON(ret == -EAGAIN); | |
115 | goto out; | |
116 | } | |
e7a84565 CM |
117 | if (next_key_ret == 0) { |
118 | memcpy(&root->defrag_progress, &key, sizeof(key)); | |
119 | ret = -EAGAIN; | |
6702ed49 | 120 | } |
6702ed49 CM |
121 | out: |
122 | if (path) | |
123 | btrfs_free_path(path); | |
0ef3e66b CM |
124 | if (ret == -EAGAIN) { |
125 | if (root->defrag_max.objectid > root->defrag_progress.objectid) | |
126 | goto done; | |
127 | if (root->defrag_max.type > root->defrag_progress.type) | |
128 | goto done; | |
129 | if (root->defrag_max.offset > root->defrag_progress.offset) | |
130 | goto done; | |
131 | ret = 0; | |
132 | } | |
133 | done: | |
6702ed49 CM |
134 | if (ret != -EAGAIN) { |
135 | memset(&root->defrag_progress, 0, | |
136 | sizeof(root->defrag_progress)); | |
3f157a2f | 137 | root->defrag_trans_start = trans->transid; |
6702ed49 CM |
138 | } |
139 | return ret; | |
140 | } |