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