]>
Commit | Line | Data |
---|---|---|
6cbd5570 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 | ||
3768f368 | 19 | #include "ctree.h" |
5eda7b5e | 20 | #include "transaction.h" |
3768f368 CM |
21 | #include "disk-io.h" |
22 | #include "print-tree.h" | |
23 | ||
bf4ef679 CM |
24 | /* |
25 | * returns 0 on finding something, 1 if no more roots are there | |
26 | * and < 0 on error | |
27 | */ | |
28 | int btrfs_search_root(struct btrfs_root *root, u64 search_start, | |
29 | u64 *found_objectid) | |
30 | { | |
31 | struct btrfs_path *path; | |
32 | struct btrfs_key search_key; | |
33 | int ret; | |
34 | ||
35 | root = root->fs_info->tree_root; | |
36 | search_key.objectid = search_start; | |
37 | search_key.type = (u8)-1; | |
38 | search_key.offset = (u64)-1; | |
39 | ||
40 | path = btrfs_alloc_path(); | |
41 | BUG_ON(!path); | |
42 | again: | |
43 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); | |
44 | if (ret < 0) | |
45 | goto out; | |
46 | if (ret == 0) { | |
47 | ret = 1; | |
48 | goto out; | |
49 | } | |
50 | if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { | |
51 | ret = btrfs_next_leaf(root, path); | |
52 | if (ret) | |
53 | goto out; | |
54 | } | |
55 | btrfs_item_key_to_cpu(path->nodes[0], &search_key, path->slots[0]); | |
56 | if (search_key.type != BTRFS_ROOT_ITEM_KEY) { | |
57 | search_key.offset++; | |
58 | btrfs_release_path(root, path); | |
59 | goto again; | |
60 | } | |
61 | ret = 0; | |
62 | *found_objectid = search_key.objectid; | |
63 | ||
64 | out: | |
65 | btrfs_free_path(path); | |
66 | return ret; | |
67 | } | |
68 | ||
3768f368 CM |
69 | int btrfs_find_last_root(struct btrfs_root *root, u64 objectid, |
70 | struct btrfs_root_item *item, struct btrfs_key *key) | |
71 | { | |
5caf2a00 | 72 | struct btrfs_path *path; |
3768f368 | 73 | struct btrfs_key search_key; |
5f39d397 CM |
74 | struct btrfs_key found_key; |
75 | struct extent_buffer *l; | |
3768f368 CM |
76 | int ret; |
77 | int slot; | |
78 | ||
79 | search_key.objectid = objectid; | |
5f39d397 | 80 | search_key.type = (u8)-1; |
5eda7b5e | 81 | search_key.offset = (u64)-1; |
3768f368 | 82 | |
5caf2a00 CM |
83 | path = btrfs_alloc_path(); |
84 | BUG_ON(!path); | |
5caf2a00 | 85 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); |
3768f368 CM |
86 | if (ret < 0) |
87 | goto out; | |
5f39d397 | 88 | |
3768f368 | 89 | BUG_ON(ret == 0); |
5f39d397 | 90 | l = path->nodes[0]; |
5caf2a00 CM |
91 | BUG_ON(path->slots[0] == 0); |
92 | slot = path->slots[0] - 1; | |
5f39d397 CM |
93 | btrfs_item_key_to_cpu(l, &found_key, slot); |
94 | if (found_key.objectid != objectid) { | |
3768f368 CM |
95 | ret = 1; |
96 | goto out; | |
97 | } | |
5f39d397 CM |
98 | read_extent_buffer(l, item, btrfs_item_ptr_offset(l, slot), |
99 | sizeof(*item)); | |
100 | memcpy(key, &found_key, sizeof(found_key)); | |
3768f368 CM |
101 | ret = 0; |
102 | out: | |
5caf2a00 | 103 | btrfs_free_path(path); |
3768f368 CM |
104 | return ret; |
105 | } | |
106 | ||
e089f05c CM |
107 | int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root |
108 | *root, struct btrfs_key *key, struct btrfs_root_item | |
109 | *item) | |
3768f368 | 110 | { |
5caf2a00 | 111 | struct btrfs_path *path; |
5f39d397 | 112 | struct extent_buffer *l; |
3768f368 CM |
113 | int ret; |
114 | int slot; | |
5f39d397 | 115 | unsigned long ptr; |
3768f368 | 116 | |
5caf2a00 CM |
117 | path = btrfs_alloc_path(); |
118 | BUG_ON(!path); | |
5caf2a00 | 119 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); |
3768f368 CM |
120 | if (ret < 0) |
121 | goto out; | |
d6667462 CM |
122 | |
123 | if (ret != 0) { | |
124 | btrfs_print_leaf(root, path->nodes[0]); | |
125 | printk("unable to update root key %Lu %u %Lu\n", | |
126 | key->objectid, key->type, key->offset); | |
127 | BUG_ON(1); | |
128 | } | |
129 | ||
5f39d397 | 130 | l = path->nodes[0]; |
5caf2a00 | 131 | slot = path->slots[0]; |
5f39d397 CM |
132 | ptr = btrfs_item_ptr_offset(l, slot); |
133 | write_extent_buffer(l, item, ptr, sizeof(*item)); | |
5caf2a00 | 134 | btrfs_mark_buffer_dirty(path->nodes[0]); |
3768f368 | 135 | out: |
5caf2a00 CM |
136 | btrfs_release_path(root, path); |
137 | btrfs_free_path(path); | |
3768f368 CM |
138 | return ret; |
139 | } | |
140 | ||
e089f05c CM |
141 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root |
142 | *root, struct btrfs_key *key, struct btrfs_root_item | |
143 | *item) | |
3768f368 CM |
144 | { |
145 | int ret; | |
e089f05c | 146 | ret = btrfs_insert_item(trans, root, key, item, sizeof(*item)); |
3768f368 CM |
147 | return ret; |
148 | } | |
149 | ||
5ce14bbc CM |
150 | int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid, |
151 | struct btrfs_root *latest) | |
5eda7b5e CM |
152 | { |
153 | struct btrfs_root *dead_root; | |
154 | struct btrfs_item *item; | |
155 | struct btrfs_root_item *ri; | |
156 | struct btrfs_key key; | |
157 | struct btrfs_path *path; | |
158 | int ret; | |
159 | u32 nritems; | |
5f39d397 | 160 | struct extent_buffer *leaf; |
5eda7b5e CM |
161 | int slot; |
162 | ||
5ce14bbc | 163 | key.objectid = objectid; |
5eda7b5e CM |
164 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); |
165 | key.offset = 0; | |
166 | path = btrfs_alloc_path(); | |
167 | if (!path) | |
168 | return -ENOMEM; | |
169 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
170 | if (ret < 0) | |
171 | goto err; | |
172 | while(1) { | |
5f39d397 CM |
173 | leaf = path->nodes[0]; |
174 | nritems = btrfs_header_nritems(leaf); | |
5eda7b5e CM |
175 | slot = path->slots[0]; |
176 | if (slot >= nritems) { | |
177 | ret = btrfs_next_leaf(root, path); | |
178 | if (ret) | |
179 | break; | |
5f39d397 CM |
180 | leaf = path->nodes[0]; |
181 | nritems = btrfs_header_nritems(leaf); | |
5eda7b5e CM |
182 | slot = path->slots[0]; |
183 | } | |
5f39d397 CM |
184 | item = btrfs_item_nr(leaf, slot); |
185 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
5eda7b5e CM |
186 | if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY) |
187 | goto next; | |
5ce14bbc CM |
188 | |
189 | if (key.objectid < objectid) | |
190 | goto next; | |
191 | ||
192 | if (key.objectid > objectid) | |
193 | break; | |
194 | ||
5eda7b5e | 195 | ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item); |
5f39d397 | 196 | if (btrfs_disk_root_refs(leaf, ri) != 0) |
5eda7b5e | 197 | goto next; |
5ce14bbc | 198 | |
5eda7b5e | 199 | dead_root = btrfs_read_fs_root_no_radix(root->fs_info, &key); |
a1f39630 A |
200 | if (IS_ERR(dead_root)) { |
201 | ret = PTR_ERR(dead_root); | |
5eda7b5e CM |
202 | goto err; |
203 | } | |
5ce14bbc CM |
204 | |
205 | ret = btrfs_add_dead_root(dead_root, latest, | |
5eda7b5e CM |
206 | &root->fs_info->dead_roots); |
207 | if (ret) | |
208 | goto err; | |
209 | next: | |
210 | slot++; | |
211 | path->slots[0]++; | |
212 | } | |
213 | ret = 0; | |
214 | err: | |
215 | btrfs_free_path(path); | |
216 | return ret; | |
217 | } | |
218 | ||
e089f05c CM |
219 | int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
220 | struct btrfs_key *key) | |
3768f368 | 221 | { |
5caf2a00 | 222 | struct btrfs_path *path; |
3768f368 | 223 | int ret; |
c5739bba CM |
224 | u32 refs; |
225 | struct btrfs_root_item *ri; | |
5f39d397 | 226 | struct extent_buffer *leaf; |
3768f368 | 227 | |
5caf2a00 CM |
228 | path = btrfs_alloc_path(); |
229 | BUG_ON(!path); | |
5caf2a00 | 230 | ret = btrfs_search_slot(trans, root, key, path, -1, 1); |
3768f368 CM |
231 | if (ret < 0) |
232 | goto out; | |
edbd8d4e CM |
233 | if (ret) { |
234 | btrfs_print_leaf(root, path->nodes[0]); | |
235 | printk("failed to del %Lu %u %Lu\n", key->objectid, key->type, key->offset); | |
236 | ||
237 | } | |
3768f368 | 238 | BUG_ON(ret != 0); |
5f39d397 CM |
239 | leaf = path->nodes[0]; |
240 | ri = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_item); | |
c5739bba | 241 | |
5f39d397 | 242 | refs = btrfs_disk_root_refs(leaf, ri); |
5eda7b5e CM |
243 | BUG_ON(refs != 0); |
244 | ret = btrfs_del_item(trans, root, path); | |
3768f368 | 245 | out: |
5caf2a00 CM |
246 | btrfs_release_path(root, path); |
247 | btrfs_free_path(path); | |
3768f368 CM |
248 | return ret; |
249 | } |