Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
5
6#include <linux/err.h>
7#include <linux/uuid.h>
8#include "ctree.h"
9#include "transaction.h"
10#include "disk-io.h"
11#include "print-tree.h"
12#include "qgroup.h"
13#include "space-info.h"
14
15/*
16 * Read a root item from the tree. In case we detect a root item smaller then
17 * sizeof(root_item), we know it's an old version of the root structure and
18 * initialize all new fields to zero. The same happens if we detect mismatching
19 * generation numbers as then we know the root was once mounted with an older
20 * kernel that was not aware of the root item structure change.
21 */
22static void btrfs_read_root_item(struct extent_buffer *eb, int slot,
23 struct btrfs_root_item *item)
24{
25 uuid_le uuid;
26 u32 len;
27 int need_reset = 0;
28
29 len = btrfs_item_size_nr(eb, slot);
30 read_extent_buffer(eb, item, btrfs_item_ptr_offset(eb, slot),
31 min_t(u32, len, sizeof(*item)));
32 if (len < sizeof(*item))
33 need_reset = 1;
34 if (!need_reset && btrfs_root_generation(item)
35 != btrfs_root_generation_v2(item)) {
36 if (btrfs_root_generation_v2(item) != 0) {
37 btrfs_warn(eb->fs_info,
38 "mismatching generation and generation_v2 found in root item. This root was probably mounted with an older kernel. Resetting all new fields.");
39 }
40 need_reset = 1;
41 }
42 if (need_reset) {
43 memset(&item->generation_v2, 0,
44 sizeof(*item) - offsetof(struct btrfs_root_item,
45 generation_v2));
46
47 uuid_le_gen(&uuid);
48 memcpy(item->uuid, uuid.b, BTRFS_UUID_SIZE);
49 }
50}
51
52/*
53 * btrfs_find_root - lookup the root by the key.
54 * root: the root of the root tree
55 * search_key: the key to search
56 * path: the path we search
57 * root_item: the root item of the tree we look for
58 * root_key: the root key of the tree we look for
59 *
60 * If ->offset of 'search_key' is -1ULL, it means we are not sure the offset
61 * of the search key, just lookup the root with the highest offset for a
62 * given objectid.
63 *
64 * If we find something return 0, otherwise > 0, < 0 on error.
65 */
66int btrfs_find_root(struct btrfs_root *root, const struct btrfs_key *search_key,
67 struct btrfs_path *path, struct btrfs_root_item *root_item,
68 struct btrfs_key *root_key)
69{
70 struct btrfs_key found_key;
71 struct extent_buffer *l;
72 int ret;
73 int slot;
74
75 ret = btrfs_search_slot(NULL, root, search_key, path, 0, 0);
76 if (ret < 0)
77 return ret;
78
79 if (search_key->offset != -1ULL) { /* the search key is exact */
80 if (ret > 0)
81 goto out;
82 } else {
83 BUG_ON(ret == 0); /* Logical error */
84 if (path->slots[0] == 0)
85 goto out;
86 path->slots[0]--;
87 ret = 0;
88 }
89
90 l = path->nodes[0];
91 slot = path->slots[0];
92
93 btrfs_item_key_to_cpu(l, &found_key, slot);
94 if (found_key.objectid != search_key->objectid ||
95 found_key.type != BTRFS_ROOT_ITEM_KEY) {
96 ret = 1;
97 goto out;
98 }
99
100 if (root_item)
101 btrfs_read_root_item(l, slot, root_item);
102 if (root_key)
103 memcpy(root_key, &found_key, sizeof(found_key));
104out:
105 btrfs_release_path(path);
106 return ret;
107}
108
109void btrfs_set_root_node(struct btrfs_root_item *item,
110 struct extent_buffer *node)
111{
112 btrfs_set_root_bytenr(item, node->start);
113 btrfs_set_root_level(item, btrfs_header_level(node));
114 btrfs_set_root_generation(item, btrfs_header_generation(node));
115}
116
117/*
118 * copy the data in 'item' into the btree
119 */
120int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
121 *root, struct btrfs_key *key, struct btrfs_root_item
122 *item)
123{
124 struct btrfs_fs_info *fs_info = root->fs_info;
125 struct btrfs_path *path;
126 struct extent_buffer *l;
127 int ret;
128 int slot;
129 unsigned long ptr;
130 u32 old_len;
131
132 path = btrfs_alloc_path();
133 if (!path)
134 return -ENOMEM;
135
136 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
137 if (ret < 0)
138 goto out;
139
140 if (ret > 0) {
141 btrfs_crit(fs_info,
142 "unable to find root key (%llu %u %llu) in tree %llu",
143 key->objectid, key->type, key->offset,
144 root->root_key.objectid);
145 ret = -EUCLEAN;
146 btrfs_abort_transaction(trans, ret);
147 goto out;
148 }
149
150 l = path->nodes[0];
151 slot = path->slots[0];
152 ptr = btrfs_item_ptr_offset(l, slot);
153 old_len = btrfs_item_size_nr(l, slot);
154
155 /*
156 * If this is the first time we update the root item which originated
157 * from an older kernel, we need to enlarge the item size to make room
158 * for the added fields.
159 */
160 if (old_len < sizeof(*item)) {
161 btrfs_release_path(path);
162 ret = btrfs_search_slot(trans, root, key, path,
163 -1, 1);
164 if (ret < 0) {
165 btrfs_abort_transaction(trans, ret);
166 goto out;
167 }
168
169 ret = btrfs_del_item(trans, root, path);
170 if (ret < 0) {
171 btrfs_abort_transaction(trans, ret);
172 goto out;
173 }
174 btrfs_release_path(path);
175 ret = btrfs_insert_empty_item(trans, root, path,
176 key, sizeof(*item));
177 if (ret < 0) {
178 btrfs_abort_transaction(trans, ret);
179 goto out;
180 }
181 l = path->nodes[0];
182 slot = path->slots[0];
183 ptr = btrfs_item_ptr_offset(l, slot);
184 }
185
186 /*
187 * Update generation_v2 so at the next mount we know the new root
188 * fields are valid.
189 */
190 btrfs_set_root_generation_v2(item, btrfs_root_generation(item));
191
192 write_extent_buffer(l, item, ptr, sizeof(*item));
193 btrfs_mark_buffer_dirty(path->nodes[0]);
194out:
195 btrfs_free_path(path);
196 return ret;
197}
198
199int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
200 const struct btrfs_key *key, struct btrfs_root_item *item)
201{
202 /*
203 * Make sure generation v1 and v2 match. See update_root for details.
204 */
205 btrfs_set_root_generation_v2(item, btrfs_root_generation(item));
206 return btrfs_insert_item(trans, root, key, item, sizeof(*item));
207}
208
209int btrfs_find_orphan_roots(struct btrfs_fs_info *fs_info)
210{
211 struct btrfs_root *tree_root = fs_info->tree_root;
212 struct extent_buffer *leaf;
213 struct btrfs_path *path;
214 struct btrfs_key key;
215 struct btrfs_key root_key;
216 struct btrfs_root *root;
217 int err = 0;
218 int ret;
219
220 path = btrfs_alloc_path();
221 if (!path)
222 return -ENOMEM;
223
224 key.objectid = BTRFS_ORPHAN_OBJECTID;
225 key.type = BTRFS_ORPHAN_ITEM_KEY;
226 key.offset = 0;
227
228 root_key.type = BTRFS_ROOT_ITEM_KEY;
229 root_key.offset = (u64)-1;
230
231 while (1) {
232 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
233 if (ret < 0) {
234 err = ret;
235 break;
236 }
237
238 leaf = path->nodes[0];
239 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
240 ret = btrfs_next_leaf(tree_root, path);
241 if (ret < 0)
242 err = ret;
243 if (ret != 0)
244 break;
245 leaf = path->nodes[0];
246 }
247
248 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
249 btrfs_release_path(path);
250
251 if (key.objectid != BTRFS_ORPHAN_OBJECTID ||
252 key.type != BTRFS_ORPHAN_ITEM_KEY)
253 break;
254
255 root_key.objectid = key.offset;
256 key.offset++;
257
258 /*
259 * The root might have been inserted already, as before we look
260 * for orphan roots, log replay might have happened, which
261 * triggers a transaction commit and qgroup accounting, which
262 * in turn reads and inserts fs roots while doing backref
263 * walking.
264 */
265 root = btrfs_lookup_fs_root(fs_info, root_key.objectid);
266 if (root) {
267 WARN_ON(!test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED,
268 &root->state));
269 if (btrfs_root_refs(&root->root_item) == 0) {
270 set_bit(BTRFS_ROOT_DEAD_TREE, &root->state);
271 btrfs_add_dead_root(root);
272 }
273 continue;
274 }
275
276 root = btrfs_read_fs_root(tree_root, &root_key);
277 err = PTR_ERR_OR_ZERO(root);
278 if (err && err != -ENOENT) {
279 break;
280 } else if (err == -ENOENT) {
281 struct btrfs_trans_handle *trans;
282
283 btrfs_release_path(path);
284
285 trans = btrfs_join_transaction(tree_root);
286 if (IS_ERR(trans)) {
287 err = PTR_ERR(trans);
288 btrfs_handle_fs_error(fs_info, err,
289 "Failed to start trans to delete orphan item");
290 break;
291 }
292 err = btrfs_del_orphan_item(trans, tree_root,
293 root_key.objectid);
294 btrfs_end_transaction(trans);
295 if (err) {
296 btrfs_handle_fs_error(fs_info, err,
297 "Failed to delete root orphan item");
298 break;
299 }
300 continue;
301 }
302
303 err = btrfs_init_fs_root(root);
304 if (err) {
305 btrfs_free_fs_root(root);
306 break;
307 }
308
309 set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state);
310
311 err = btrfs_insert_fs_root(fs_info, root);
312 if (err) {
313 BUG_ON(err == -EEXIST);
314 btrfs_free_fs_root(root);
315 break;
316 }
317
318 if (btrfs_root_refs(&root->root_item) == 0) {
319 set_bit(BTRFS_ROOT_DEAD_TREE, &root->state);
320 btrfs_add_dead_root(root);
321 }
322 }
323
324 btrfs_free_path(path);
325 return err;
326}
327
328/* drop the root item for 'key' from the tree root */
329int btrfs_del_root(struct btrfs_trans_handle *trans,
330 const struct btrfs_key *key)
331{
332 struct btrfs_root *root = trans->fs_info->tree_root;
333 struct btrfs_path *path;
334 int ret;
335
336 path = btrfs_alloc_path();
337 if (!path)
338 return -ENOMEM;
339 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
340 if (ret < 0)
341 goto out;
342
343 BUG_ON(ret != 0);
344
345 ret = btrfs_del_item(trans, root, path);
346out:
347 btrfs_free_path(path);
348 return ret;
349}
350
351int btrfs_del_root_ref(struct btrfs_trans_handle *trans, u64 root_id,
352 u64 ref_id, u64 dirid, u64 *sequence, const char *name,
353 int name_len)
354
355{
356 struct btrfs_root *tree_root = trans->fs_info->tree_root;
357 struct btrfs_path *path;
358 struct btrfs_root_ref *ref;
359 struct extent_buffer *leaf;
360 struct btrfs_key key;
361 unsigned long ptr;
362 int err = 0;
363 int ret;
364
365 path = btrfs_alloc_path();
366 if (!path)
367 return -ENOMEM;
368
369 key.objectid = root_id;
370 key.type = BTRFS_ROOT_BACKREF_KEY;
371 key.offset = ref_id;
372again:
373 ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
374 BUG_ON(ret < 0);
375 if (ret == 0) {
376 leaf = path->nodes[0];
377 ref = btrfs_item_ptr(leaf, path->slots[0],
378 struct btrfs_root_ref);
379
380 WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid);
381 WARN_ON(btrfs_root_ref_name_len(leaf, ref) != name_len);
382 ptr = (unsigned long)(ref + 1);
383 WARN_ON(memcmp_extent_buffer(leaf, name, ptr, name_len));
384 *sequence = btrfs_root_ref_sequence(leaf, ref);
385
386 ret = btrfs_del_item(trans, tree_root, path);
387 if (ret) {
388 err = ret;
389 goto out;
390 }
391 } else
392 err = -ENOENT;
393
394 if (key.type == BTRFS_ROOT_BACKREF_KEY) {
395 btrfs_release_path(path);
396 key.objectid = ref_id;
397 key.type = BTRFS_ROOT_REF_KEY;
398 key.offset = root_id;
399 goto again;
400 }
401
402out:
403 btrfs_free_path(path);
404 return err;
405}
406
407/*
408 * add a btrfs_root_ref item. type is either BTRFS_ROOT_REF_KEY
409 * or BTRFS_ROOT_BACKREF_KEY.
410 *
411 * The dirid, sequence, name and name_len refer to the directory entry
412 * that is referencing the root.
413 *
414 * For a forward ref, the root_id is the id of the tree referencing
415 * the root and ref_id is the id of the subvol or snapshot.
416 *
417 * For a back ref the root_id is the id of the subvol or snapshot and
418 * ref_id is the id of the tree referencing it.
419 *
420 * Will return 0, -ENOMEM, or anything from the CoW path
421 */
422int btrfs_add_root_ref(struct btrfs_trans_handle *trans, u64 root_id,
423 u64 ref_id, u64 dirid, u64 sequence, const char *name,
424 int name_len)
425{
426 struct btrfs_root *tree_root = trans->fs_info->tree_root;
427 struct btrfs_key key;
428 int ret;
429 struct btrfs_path *path;
430 struct btrfs_root_ref *ref;
431 struct extent_buffer *leaf;
432 unsigned long ptr;
433
434 path = btrfs_alloc_path();
435 if (!path)
436 return -ENOMEM;
437
438 key.objectid = root_id;
439 key.type = BTRFS_ROOT_BACKREF_KEY;
440 key.offset = ref_id;
441again:
442 ret = btrfs_insert_empty_item(trans, tree_root, path, &key,
443 sizeof(*ref) + name_len);
444 if (ret) {
445 btrfs_abort_transaction(trans, ret);
446 btrfs_free_path(path);
447 return ret;
448 }
449
450 leaf = path->nodes[0];
451 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
452 btrfs_set_root_ref_dirid(leaf, ref, dirid);
453 btrfs_set_root_ref_sequence(leaf, ref, sequence);
454 btrfs_set_root_ref_name_len(leaf, ref, name_len);
455 ptr = (unsigned long)(ref + 1);
456 write_extent_buffer(leaf, name, ptr, name_len);
457 btrfs_mark_buffer_dirty(leaf);
458
459 if (key.type == BTRFS_ROOT_BACKREF_KEY) {
460 btrfs_release_path(path);
461 key.objectid = ref_id;
462 key.type = BTRFS_ROOT_REF_KEY;
463 key.offset = root_id;
464 goto again;
465 }
466
467 btrfs_free_path(path);
468 return 0;
469}
470
471/*
472 * Old btrfs forgets to init root_item->flags and root_item->byte_limit
473 * for subvolumes. To work around this problem, we steal a bit from
474 * root_item->inode_item->flags, and use it to indicate if those fields
475 * have been properly initialized.
476 */
477void btrfs_check_and_init_root_item(struct btrfs_root_item *root_item)
478{
479 u64 inode_flags = btrfs_stack_inode_flags(&root_item->inode);
480
481 if (!(inode_flags & BTRFS_INODE_ROOT_ITEM_INIT)) {
482 inode_flags |= BTRFS_INODE_ROOT_ITEM_INIT;
483 btrfs_set_stack_inode_flags(&root_item->inode, inode_flags);
484 btrfs_set_root_flags(root_item, 0);
485 btrfs_set_root_limit(root_item, 0);
486 }
487}
488
489void btrfs_update_root_times(struct btrfs_trans_handle *trans,
490 struct btrfs_root *root)
491{
492 struct btrfs_root_item *item = &root->root_item;
493 struct timespec64 ct;
494
495 ktime_get_real_ts64(&ct);
496 spin_lock(&root->root_item_lock);
497 btrfs_set_root_ctransid(item, trans->transid);
498 btrfs_set_stack_timespec_sec(&item->ctime, ct.tv_sec);
499 btrfs_set_stack_timespec_nsec(&item->ctime, ct.tv_nsec);
500 spin_unlock(&root->root_item_lock);
501}
502
503/*
504 * btrfs_subvolume_reserve_metadata() - reserve space for subvolume operation
505 * root: the root of the parent directory
506 * rsv: block reservation
507 * items: the number of items that we need do reservation
508 * use_global_rsv: allow fallback to the global block reservation
509 *
510 * This function is used to reserve the space for snapshot/subvolume
511 * creation and deletion. Those operations are different with the
512 * common file/directory operations, they change two fs/file trees
513 * and root tree, the number of items that the qgroup reserves is
514 * different with the free space reservation. So we can not use
515 * the space reservation mechanism in start_transaction().
516 */
517int btrfs_subvolume_reserve_metadata(struct btrfs_root *root,
518 struct btrfs_block_rsv *rsv, int items,
519 bool use_global_rsv)
520{
521 u64 qgroup_num_bytes = 0;
522 u64 num_bytes;
523 int ret;
524 struct btrfs_fs_info *fs_info = root->fs_info;
525 struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv;
526
527 if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) {
528 /* One for parent inode, two for dir entries */
529 qgroup_num_bytes = 3 * fs_info->nodesize;
530 ret = btrfs_qgroup_reserve_meta_prealloc(root,
531 qgroup_num_bytes, true);
532 if (ret)
533 return ret;
534 }
535
536 num_bytes = btrfs_calc_insert_metadata_size(fs_info, items);
537 rsv->space_info = btrfs_find_space_info(fs_info,
538 BTRFS_BLOCK_GROUP_METADATA);
539 ret = btrfs_block_rsv_add(root, rsv, num_bytes,
540 BTRFS_RESERVE_FLUSH_ALL);
541
542 if (ret == -ENOSPC && use_global_rsv)
543 ret = btrfs_block_rsv_migrate(global_rsv, rsv, num_bytes, true);
544
545 if (ret && qgroup_num_bytes)
546 btrfs_qgroup_free_meta_prealloc(root, qgroup_num_bytes);
547
548 return ret;
549}
550
551void btrfs_subvolume_release_metadata(struct btrfs_fs_info *fs_info,
552 struct btrfs_block_rsv *rsv)
553{
554 btrfs_block_rsv_release(fs_info, rsv, (u64)-1);
555}
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 "ctree.h"
20#include "transaction.h"
21#include "disk-io.h"
22#include "print-tree.h"
23
24/*
25 * lookup the root with the highest offset for a given objectid. The key we do
26 * find is copied into 'key'. If we find something return 0, otherwise 1, < 0
27 * on error.
28 */
29int btrfs_find_last_root(struct btrfs_root *root, u64 objectid,
30 struct btrfs_root_item *item, struct btrfs_key *key)
31{
32 struct btrfs_path *path;
33 struct btrfs_key search_key;
34 struct btrfs_key found_key;
35 struct extent_buffer *l;
36 int ret;
37 int slot;
38
39 search_key.objectid = objectid;
40 search_key.type = BTRFS_ROOT_ITEM_KEY;
41 search_key.offset = (u64)-1;
42
43 path = btrfs_alloc_path();
44 if (!path)
45 return -ENOMEM;
46 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
47 if (ret < 0)
48 goto out;
49
50 BUG_ON(ret == 0);
51 if (path->slots[0] == 0) {
52 ret = 1;
53 goto out;
54 }
55 l = path->nodes[0];
56 slot = path->slots[0] - 1;
57 btrfs_item_key_to_cpu(l, &found_key, slot);
58 if (found_key.objectid != objectid ||
59 found_key.type != BTRFS_ROOT_ITEM_KEY) {
60 ret = 1;
61 goto out;
62 }
63 if (item)
64 read_extent_buffer(l, item, btrfs_item_ptr_offset(l, slot),
65 sizeof(*item));
66 if (key)
67 memcpy(key, &found_key, sizeof(found_key));
68 ret = 0;
69out:
70 btrfs_free_path(path);
71 return ret;
72}
73
74void btrfs_set_root_node(struct btrfs_root_item *item,
75 struct extent_buffer *node)
76{
77 btrfs_set_root_bytenr(item, node->start);
78 btrfs_set_root_level(item, btrfs_header_level(node));
79 btrfs_set_root_generation(item, btrfs_header_generation(node));
80}
81
82/*
83 * copy the data in 'item' into the btree
84 */
85int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
86 *root, struct btrfs_key *key, struct btrfs_root_item
87 *item)
88{
89 struct btrfs_path *path;
90 struct extent_buffer *l;
91 int ret;
92 int slot;
93 unsigned long ptr;
94
95 path = btrfs_alloc_path();
96 if (!path)
97 return -ENOMEM;
98
99 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
100 if (ret < 0) {
101 btrfs_abort_transaction(trans, root, ret);
102 goto out;
103 }
104
105 if (ret != 0) {
106 btrfs_print_leaf(root, path->nodes[0]);
107 printk(KERN_CRIT "unable to update root key %llu %u %llu\n",
108 (unsigned long long)key->objectid, key->type,
109 (unsigned long long)key->offset);
110 BUG_ON(1);
111 }
112
113 l = path->nodes[0];
114 slot = path->slots[0];
115 ptr = btrfs_item_ptr_offset(l, slot);
116 write_extent_buffer(l, item, ptr, sizeof(*item));
117 btrfs_mark_buffer_dirty(path->nodes[0]);
118out:
119 btrfs_free_path(path);
120 return ret;
121}
122
123int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
124 struct btrfs_key *key, struct btrfs_root_item *item)
125{
126 return btrfs_insert_item(trans, root, key, item, sizeof(*item));
127}
128
129/*
130 * at mount time we want to find all the old transaction snapshots that were in
131 * the process of being deleted if we crashed. This is any root item with an
132 * offset lower than the latest root. They need to be queued for deletion to
133 * finish what was happening when we crashed.
134 */
135int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid)
136{
137 struct btrfs_root *dead_root;
138 struct btrfs_root_item *ri;
139 struct btrfs_key key;
140 struct btrfs_key found_key;
141 struct btrfs_path *path;
142 int ret;
143 u32 nritems;
144 struct extent_buffer *leaf;
145 int slot;
146
147 key.objectid = objectid;
148 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
149 key.offset = 0;
150 path = btrfs_alloc_path();
151 if (!path)
152 return -ENOMEM;
153
154again:
155 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
156 if (ret < 0)
157 goto err;
158 while (1) {
159 leaf = path->nodes[0];
160 nritems = btrfs_header_nritems(leaf);
161 slot = path->slots[0];
162 if (slot >= nritems) {
163 ret = btrfs_next_leaf(root, path);
164 if (ret)
165 break;
166 leaf = path->nodes[0];
167 nritems = btrfs_header_nritems(leaf);
168 slot = path->slots[0];
169 }
170 btrfs_item_key_to_cpu(leaf, &key, slot);
171 if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY)
172 goto next;
173
174 if (key.objectid < objectid)
175 goto next;
176
177 if (key.objectid > objectid)
178 break;
179
180 ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
181 if (btrfs_disk_root_refs(leaf, ri) != 0)
182 goto next;
183
184 memcpy(&found_key, &key, sizeof(key));
185 key.offset++;
186 btrfs_release_path(path);
187 dead_root =
188 btrfs_read_fs_root_no_radix(root->fs_info->tree_root,
189 &found_key);
190 if (IS_ERR(dead_root)) {
191 ret = PTR_ERR(dead_root);
192 goto err;
193 }
194
195 ret = btrfs_add_dead_root(dead_root);
196 if (ret)
197 goto err;
198 goto again;
199next:
200 slot++;
201 path->slots[0]++;
202 }
203 ret = 0;
204err:
205 btrfs_free_path(path);
206 return ret;
207}
208
209int btrfs_find_orphan_roots(struct btrfs_root *tree_root)
210{
211 struct extent_buffer *leaf;
212 struct btrfs_path *path;
213 struct btrfs_key key;
214 struct btrfs_key root_key;
215 struct btrfs_root *root;
216 int err = 0;
217 int ret;
218
219 path = btrfs_alloc_path();
220 if (!path)
221 return -ENOMEM;
222
223 key.objectid = BTRFS_ORPHAN_OBJECTID;
224 key.type = BTRFS_ORPHAN_ITEM_KEY;
225 key.offset = 0;
226
227 root_key.type = BTRFS_ROOT_ITEM_KEY;
228 root_key.offset = (u64)-1;
229
230 while (1) {
231 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
232 if (ret < 0) {
233 err = ret;
234 break;
235 }
236
237 leaf = path->nodes[0];
238 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
239 ret = btrfs_next_leaf(tree_root, path);
240 if (ret < 0)
241 err = ret;
242 if (ret != 0)
243 break;
244 leaf = path->nodes[0];
245 }
246
247 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
248 btrfs_release_path(path);
249
250 if (key.objectid != BTRFS_ORPHAN_OBJECTID ||
251 key.type != BTRFS_ORPHAN_ITEM_KEY)
252 break;
253
254 root_key.objectid = key.offset;
255 key.offset++;
256
257 root = btrfs_read_fs_root_no_name(tree_root->fs_info,
258 &root_key);
259 if (!IS_ERR(root))
260 continue;
261
262 ret = PTR_ERR(root);
263 if (ret != -ENOENT) {
264 err = ret;
265 break;
266 }
267
268 ret = btrfs_find_dead_roots(tree_root, root_key.objectid);
269 if (ret) {
270 err = ret;
271 break;
272 }
273 }
274
275 btrfs_free_path(path);
276 return err;
277}
278
279/* drop the root item for 'key' from 'root' */
280int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
281 struct btrfs_key *key)
282{
283 struct btrfs_path *path;
284 int ret;
285 struct btrfs_root_item *ri;
286 struct extent_buffer *leaf;
287
288 path = btrfs_alloc_path();
289 if (!path)
290 return -ENOMEM;
291 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
292 if (ret < 0)
293 goto out;
294
295 BUG_ON(ret != 0);
296 leaf = path->nodes[0];
297 ri = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_item);
298
299 ret = btrfs_del_item(trans, root, path);
300out:
301 btrfs_free_path(path);
302 return ret;
303}
304
305int btrfs_del_root_ref(struct btrfs_trans_handle *trans,
306 struct btrfs_root *tree_root,
307 u64 root_id, u64 ref_id, u64 dirid, u64 *sequence,
308 const char *name, int name_len)
309
310{
311 struct btrfs_path *path;
312 struct btrfs_root_ref *ref;
313 struct extent_buffer *leaf;
314 struct btrfs_key key;
315 unsigned long ptr;
316 int err = 0;
317 int ret;
318
319 path = btrfs_alloc_path();
320 if (!path)
321 return -ENOMEM;
322
323 key.objectid = root_id;
324 key.type = BTRFS_ROOT_BACKREF_KEY;
325 key.offset = ref_id;
326again:
327 ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
328 BUG_ON(ret < 0);
329 if (ret == 0) {
330 leaf = path->nodes[0];
331 ref = btrfs_item_ptr(leaf, path->slots[0],
332 struct btrfs_root_ref);
333
334 WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid);
335 WARN_ON(btrfs_root_ref_name_len(leaf, ref) != name_len);
336 ptr = (unsigned long)(ref + 1);
337 WARN_ON(memcmp_extent_buffer(leaf, name, ptr, name_len));
338 *sequence = btrfs_root_ref_sequence(leaf, ref);
339
340 ret = btrfs_del_item(trans, tree_root, path);
341 if (ret) {
342 err = ret;
343 goto out;
344 }
345 } else
346 err = -ENOENT;
347
348 if (key.type == BTRFS_ROOT_BACKREF_KEY) {
349 btrfs_release_path(path);
350 key.objectid = ref_id;
351 key.type = BTRFS_ROOT_REF_KEY;
352 key.offset = root_id;
353 goto again;
354 }
355
356out:
357 btrfs_free_path(path);
358 return err;
359}
360
361int btrfs_find_root_ref(struct btrfs_root *tree_root,
362 struct btrfs_path *path,
363 u64 root_id, u64 ref_id)
364{
365 struct btrfs_key key;
366 int ret;
367
368 key.objectid = root_id;
369 key.type = BTRFS_ROOT_REF_KEY;
370 key.offset = ref_id;
371
372 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
373 return ret;
374}
375
376/*
377 * add a btrfs_root_ref item. type is either BTRFS_ROOT_REF_KEY
378 * or BTRFS_ROOT_BACKREF_KEY.
379 *
380 * The dirid, sequence, name and name_len refer to the directory entry
381 * that is referencing the root.
382 *
383 * For a forward ref, the root_id is the id of the tree referencing
384 * the root and ref_id is the id of the subvol or snapshot.
385 *
386 * For a back ref the root_id is the id of the subvol or snapshot and
387 * ref_id is the id of the tree referencing it.
388 *
389 * Will return 0, -ENOMEM, or anything from the CoW path
390 */
391int btrfs_add_root_ref(struct btrfs_trans_handle *trans,
392 struct btrfs_root *tree_root,
393 u64 root_id, u64 ref_id, u64 dirid, u64 sequence,
394 const char *name, int name_len)
395{
396 struct btrfs_key key;
397 int ret;
398 struct btrfs_path *path;
399 struct btrfs_root_ref *ref;
400 struct extent_buffer *leaf;
401 unsigned long ptr;
402
403 path = btrfs_alloc_path();
404 if (!path)
405 return -ENOMEM;
406
407 key.objectid = root_id;
408 key.type = BTRFS_ROOT_BACKREF_KEY;
409 key.offset = ref_id;
410again:
411 ret = btrfs_insert_empty_item(trans, tree_root, path, &key,
412 sizeof(*ref) + name_len);
413 if (ret) {
414 btrfs_abort_transaction(trans, tree_root, ret);
415 btrfs_free_path(path);
416 return ret;
417 }
418
419 leaf = path->nodes[0];
420 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
421 btrfs_set_root_ref_dirid(leaf, ref, dirid);
422 btrfs_set_root_ref_sequence(leaf, ref, sequence);
423 btrfs_set_root_ref_name_len(leaf, ref, name_len);
424 ptr = (unsigned long)(ref + 1);
425 write_extent_buffer(leaf, name, ptr, name_len);
426 btrfs_mark_buffer_dirty(leaf);
427
428 if (key.type == BTRFS_ROOT_BACKREF_KEY) {
429 btrfs_release_path(path);
430 key.objectid = ref_id;
431 key.type = BTRFS_ROOT_REF_KEY;
432 key.offset = root_id;
433 goto again;
434 }
435
436 btrfs_free_path(path);
437 return 0;
438}
439
440/*
441 * Old btrfs forgets to init root_item->flags and root_item->byte_limit
442 * for subvolumes. To work around this problem, we steal a bit from
443 * root_item->inode_item->flags, and use it to indicate if those fields
444 * have been properly initialized.
445 */
446void btrfs_check_and_init_root_item(struct btrfs_root_item *root_item)
447{
448 u64 inode_flags = le64_to_cpu(root_item->inode.flags);
449
450 if (!(inode_flags & BTRFS_INODE_ROOT_ITEM_INIT)) {
451 inode_flags |= BTRFS_INODE_ROOT_ITEM_INIT;
452 root_item->inode.flags = cpu_to_le64(inode_flags);
453 root_item->flags = 0;
454 root_item->byte_limit = 0;
455 }
456}