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 | ||
24 | int btrfs_find_last_root(struct btrfs_root *root, u64 objectid, | |
25 | struct btrfs_root_item *item, struct btrfs_key *key) | |
26 | { | |
5caf2a00 | 27 | struct btrfs_path *path; |
3768f368 | 28 | struct btrfs_key search_key; |
5f39d397 CM |
29 | struct btrfs_key found_key; |
30 | struct extent_buffer *l; | |
3768f368 CM |
31 | int ret; |
32 | int slot; | |
33 | ||
34 | search_key.objectid = objectid; | |
5f39d397 | 35 | search_key.type = (u8)-1; |
5eda7b5e | 36 | search_key.offset = (u64)-1; |
3768f368 | 37 | |
5caf2a00 CM |
38 | path = btrfs_alloc_path(); |
39 | BUG_ON(!path); | |
5caf2a00 | 40 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); |
3768f368 CM |
41 | if (ret < 0) |
42 | goto out; | |
5f39d397 | 43 | |
3768f368 | 44 | BUG_ON(ret == 0); |
5f39d397 | 45 | l = path->nodes[0]; |
5caf2a00 CM |
46 | BUG_ON(path->slots[0] == 0); |
47 | slot = path->slots[0] - 1; | |
5f39d397 CM |
48 | btrfs_item_key_to_cpu(l, &found_key, slot); |
49 | if (found_key.objectid != objectid) { | |
3768f368 CM |
50 | ret = 1; |
51 | goto out; | |
52 | } | |
5f39d397 CM |
53 | read_extent_buffer(l, item, btrfs_item_ptr_offset(l, slot), |
54 | sizeof(*item)); | |
55 | memcpy(key, &found_key, sizeof(found_key)); | |
3768f368 CM |
56 | ret = 0; |
57 | out: | |
5caf2a00 CM |
58 | btrfs_release_path(root, path); |
59 | btrfs_free_path(path); | |
3768f368 CM |
60 | return ret; |
61 | } | |
62 | ||
e089f05c CM |
63 | int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root |
64 | *root, struct btrfs_key *key, struct btrfs_root_item | |
65 | *item) | |
3768f368 | 66 | { |
5caf2a00 | 67 | struct btrfs_path *path; |
5f39d397 | 68 | struct extent_buffer *l; |
3768f368 CM |
69 | int ret; |
70 | int slot; | |
5f39d397 | 71 | unsigned long ptr; |
3768f368 | 72 | |
5caf2a00 CM |
73 | path = btrfs_alloc_path(); |
74 | BUG_ON(!path); | |
5caf2a00 | 75 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); |
3768f368 CM |
76 | if (ret < 0) |
77 | goto out; | |
d6667462 CM |
78 | |
79 | if (ret != 0) { | |
80 | btrfs_print_leaf(root, path->nodes[0]); | |
81 | printk("unable to update root key %Lu %u %Lu\n", | |
82 | key->objectid, key->type, key->offset); | |
83 | BUG_ON(1); | |
84 | } | |
85 | ||
5f39d397 | 86 | l = path->nodes[0]; |
5caf2a00 | 87 | slot = path->slots[0]; |
5f39d397 CM |
88 | ptr = btrfs_item_ptr_offset(l, slot); |
89 | write_extent_buffer(l, item, ptr, sizeof(*item)); | |
5caf2a00 | 90 | btrfs_mark_buffer_dirty(path->nodes[0]); |
3768f368 | 91 | out: |
5caf2a00 CM |
92 | btrfs_release_path(root, path); |
93 | btrfs_free_path(path); | |
3768f368 CM |
94 | return ret; |
95 | } | |
96 | ||
e089f05c CM |
97 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root |
98 | *root, struct btrfs_key *key, struct btrfs_root_item | |
99 | *item) | |
3768f368 CM |
100 | { |
101 | int ret; | |
e089f05c | 102 | ret = btrfs_insert_item(trans, root, key, item, sizeof(*item)); |
3768f368 CM |
103 | return ret; |
104 | } | |
105 | ||
5ce14bbc CM |
106 | int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid, |
107 | struct btrfs_root *latest) | |
5eda7b5e CM |
108 | { |
109 | struct btrfs_root *dead_root; | |
110 | struct btrfs_item *item; | |
111 | struct btrfs_root_item *ri; | |
112 | struct btrfs_key key; | |
113 | struct btrfs_path *path; | |
114 | int ret; | |
115 | u32 nritems; | |
5f39d397 | 116 | struct extent_buffer *leaf; |
5eda7b5e CM |
117 | int slot; |
118 | ||
5ce14bbc | 119 | key.objectid = objectid; |
5eda7b5e CM |
120 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); |
121 | key.offset = 0; | |
122 | path = btrfs_alloc_path(); | |
123 | if (!path) | |
124 | return -ENOMEM; | |
125 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
126 | if (ret < 0) | |
127 | goto err; | |
128 | while(1) { | |
5f39d397 CM |
129 | leaf = path->nodes[0]; |
130 | nritems = btrfs_header_nritems(leaf); | |
5eda7b5e CM |
131 | slot = path->slots[0]; |
132 | if (slot >= nritems) { | |
133 | ret = btrfs_next_leaf(root, path); | |
134 | if (ret) | |
135 | break; | |
5f39d397 CM |
136 | leaf = path->nodes[0]; |
137 | nritems = btrfs_header_nritems(leaf); | |
5eda7b5e CM |
138 | slot = path->slots[0]; |
139 | } | |
5f39d397 CM |
140 | item = btrfs_item_nr(leaf, slot); |
141 | btrfs_item_key_to_cpu(leaf, &key, slot); | |
5eda7b5e CM |
142 | if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY) |
143 | goto next; | |
5ce14bbc CM |
144 | |
145 | if (key.objectid < objectid) | |
146 | goto next; | |
147 | ||
148 | if (key.objectid > objectid) | |
149 | break; | |
150 | ||
5eda7b5e | 151 | ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item); |
5f39d397 | 152 | if (btrfs_disk_root_refs(leaf, ri) != 0) |
5eda7b5e | 153 | goto next; |
5ce14bbc | 154 | |
5eda7b5e | 155 | dead_root = btrfs_read_fs_root_no_radix(root->fs_info, &key); |
a1f39630 A |
156 | if (IS_ERR(dead_root)) { |
157 | ret = PTR_ERR(dead_root); | |
5eda7b5e CM |
158 | goto err; |
159 | } | |
5ce14bbc CM |
160 | |
161 | ret = btrfs_add_dead_root(dead_root, latest, | |
5eda7b5e CM |
162 | &root->fs_info->dead_roots); |
163 | if (ret) | |
164 | goto err; | |
165 | next: | |
166 | slot++; | |
167 | path->slots[0]++; | |
168 | } | |
169 | ret = 0; | |
170 | err: | |
171 | btrfs_free_path(path); | |
172 | return ret; | |
173 | } | |
174 | ||
e089f05c CM |
175 | int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
176 | struct btrfs_key *key) | |
3768f368 | 177 | { |
5caf2a00 | 178 | struct btrfs_path *path; |
3768f368 | 179 | int ret; |
c5739bba CM |
180 | u32 refs; |
181 | struct btrfs_root_item *ri; | |
5f39d397 | 182 | struct extent_buffer *leaf; |
3768f368 | 183 | |
5caf2a00 CM |
184 | path = btrfs_alloc_path(); |
185 | BUG_ON(!path); | |
5caf2a00 | 186 | ret = btrfs_search_slot(trans, root, key, path, -1, 1); |
3768f368 CM |
187 | if (ret < 0) |
188 | goto out; | |
edbd8d4e CM |
189 | if (ret) { |
190 | btrfs_print_leaf(root, path->nodes[0]); | |
191 | printk("failed to del %Lu %u %Lu\n", key->objectid, key->type, key->offset); | |
192 | ||
193 | } | |
3768f368 | 194 | BUG_ON(ret != 0); |
5f39d397 CM |
195 | leaf = path->nodes[0]; |
196 | ri = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_item); | |
c5739bba | 197 | |
5f39d397 | 198 | refs = btrfs_disk_root_refs(leaf, ri); |
5eda7b5e CM |
199 | BUG_ON(refs != 0); |
200 | ret = btrfs_del_item(trans, root, path); | |
3768f368 | 201 | out: |
5caf2a00 CM |
202 | btrfs_release_path(root, path); |
203 | btrfs_free_path(path); | |
3768f368 CM |
204 | return ret; |
205 | } |