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 <linux/err.h>
20#include <linux/uuid.h>
21#include "ctree.h"
22#include "transaction.h"
23#include "disk-io.h"
24#include "print-tree.h"
25
26/*
27 * Read a root item from the tree. In case we detect a root item smaller then
28 * sizeof(root_item), we know it's an old version of the root structure and
29 * initialize all new fields to zero. The same happens if we detect mismatching
30 * generation numbers as then we know the root was once mounted with an older
31 * kernel that was not aware of the root item structure change.
32 */
33static void btrfs_read_root_item(struct extent_buffer *eb, int slot,
34 struct btrfs_root_item *item)
35{
36 uuid_le uuid;
37 int len;
38 int need_reset = 0;
39
40 len = btrfs_item_size_nr(eb, slot);
41 read_extent_buffer(eb, item, btrfs_item_ptr_offset(eb, slot),
42 min_t(int, len, (int)sizeof(*item)));
43 if (len < sizeof(*item))
44 need_reset = 1;
45 if (!need_reset && btrfs_root_generation(item)
46 != btrfs_root_generation_v2(item)) {
47 if (btrfs_root_generation_v2(item) != 0) {
48 printk(KERN_WARNING "BTRFS: mismatching "
49 "generation and generation_v2 "
50 "found in root item. This root "
51 "was probably mounted with an "
52 "older kernel. Resetting all "
53 "new fields.\n");
54 }
55 need_reset = 1;
56 }
57 if (need_reset) {
58 memset(&item->generation_v2, 0,
59 sizeof(*item) - offsetof(struct btrfs_root_item,
60 generation_v2));
61
62 uuid_le_gen(&uuid);
63 memcpy(item->uuid, uuid.b, BTRFS_UUID_SIZE);
64 }
65}
66
67/*
68 * btrfs_find_root - lookup the root by the key.
69 * root: the root of the root tree
70 * search_key: the key to search
71 * path: the path we search
72 * root_item: the root item of the tree we look for
73 * root_key: the reak key of the tree we look for
74 *
75 * If ->offset of 'seach_key' is -1ULL, it means we are not sure the offset
76 * of the search key, just lookup the root with the highest offset for a
77 * given objectid.
78 *
79 * If we find something return 0, otherwise > 0, < 0 on error.
80 */
81int btrfs_find_root(struct btrfs_root *root, struct btrfs_key *search_key,
82 struct btrfs_path *path, struct btrfs_root_item *root_item,
83 struct btrfs_key *root_key)
84{
85 struct btrfs_key found_key;
86 struct extent_buffer *l;
87 int ret;
88 int slot;
89
90 ret = btrfs_search_slot(NULL, root, search_key, path, 0, 0);
91 if (ret < 0)
92 return ret;
93
94 if (search_key->offset != -1ULL) { /* the search key is exact */
95 if (ret > 0)
96 goto out;
97 } else {
98 BUG_ON(ret == 0); /* Logical error */
99 if (path->slots[0] == 0)
100 goto out;
101 path->slots[0]--;
102 ret = 0;
103 }
104
105 l = path->nodes[0];
106 slot = path->slots[0];
107
108 btrfs_item_key_to_cpu(l, &found_key, slot);
109 if (found_key.objectid != search_key->objectid ||
110 found_key.type != BTRFS_ROOT_ITEM_KEY) {
111 ret = 1;
112 goto out;
113 }
114
115 if (root_item)
116 btrfs_read_root_item(l, slot, root_item);
117 if (root_key)
118 memcpy(root_key, &found_key, sizeof(found_key));
119out:
120 btrfs_release_path(path);
121 return ret;
122}
123
124void btrfs_set_root_node(struct btrfs_root_item *item,
125 struct extent_buffer *node)
126{
127 btrfs_set_root_bytenr(item, node->start);
128 btrfs_set_root_level(item, btrfs_header_level(node));
129 btrfs_set_root_generation(item, btrfs_header_generation(node));
130}
131
132/*
133 * copy the data in 'item' into the btree
134 */
135int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
136 *root, struct btrfs_key *key, struct btrfs_root_item
137 *item)
138{
139 struct btrfs_path *path;
140 struct extent_buffer *l;
141 int ret;
142 int slot;
143 unsigned long ptr;
144 int old_len;
145
146 path = btrfs_alloc_path();
147 if (!path)
148 return -ENOMEM;
149
150 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
151 if (ret < 0) {
152 btrfs_abort_transaction(trans, root, ret);
153 goto out;
154 }
155
156 if (ret != 0) {
157 btrfs_print_leaf(root, path->nodes[0]);
158 btrfs_crit(root->fs_info, "unable to update root key %llu %u %llu",
159 key->objectid, key->type, key->offset);
160 BUG_ON(1);
161 }
162
163 l = path->nodes[0];
164 slot = path->slots[0];
165 ptr = btrfs_item_ptr_offset(l, slot);
166 old_len = btrfs_item_size_nr(l, slot);
167
168 /*
169 * If this is the first time we update the root item which originated
170 * from an older kernel, we need to enlarge the item size to make room
171 * for the added fields.
172 */
173 if (old_len < sizeof(*item)) {
174 btrfs_release_path(path);
175 ret = btrfs_search_slot(trans, root, key, path,
176 -1, 1);
177 if (ret < 0) {
178 btrfs_abort_transaction(trans, root, ret);
179 goto out;
180 }
181
182 ret = btrfs_del_item(trans, root, path);
183 if (ret < 0) {
184 btrfs_abort_transaction(trans, root, ret);
185 goto out;
186 }
187 btrfs_release_path(path);
188 ret = btrfs_insert_empty_item(trans, root, path,
189 key, sizeof(*item));
190 if (ret < 0) {
191 btrfs_abort_transaction(trans, root, ret);
192 goto out;
193 }
194 l = path->nodes[0];
195 slot = path->slots[0];
196 ptr = btrfs_item_ptr_offset(l, slot);
197 }
198
199 /*
200 * Update generation_v2 so at the next mount we know the new root
201 * fields are valid.
202 */
203 btrfs_set_root_generation_v2(item, btrfs_root_generation(item));
204
205 write_extent_buffer(l, item, ptr, sizeof(*item));
206 btrfs_mark_buffer_dirty(path->nodes[0]);
207out:
208 btrfs_free_path(path);
209 return ret;
210}
211
212int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
213 struct btrfs_key *key, struct btrfs_root_item *item)
214{
215 /*
216 * Make sure generation v1 and v2 match. See update_root for details.
217 */
218 btrfs_set_root_generation_v2(item, btrfs_root_generation(item));
219 return btrfs_insert_item(trans, root, key, item, sizeof(*item));
220}
221
222int btrfs_find_orphan_roots(struct btrfs_root *tree_root)
223{
224 struct extent_buffer *leaf;
225 struct btrfs_path *path;
226 struct btrfs_key key;
227 struct btrfs_key root_key;
228 struct btrfs_root *root;
229 int err = 0;
230 int ret;
231 bool can_recover = true;
232
233 if (tree_root->fs_info->sb->s_flags & MS_RDONLY)
234 can_recover = false;
235
236 path = btrfs_alloc_path();
237 if (!path)
238 return -ENOMEM;
239
240 key.objectid = BTRFS_ORPHAN_OBJECTID;
241 key.type = BTRFS_ORPHAN_ITEM_KEY;
242 key.offset = 0;
243
244 root_key.type = BTRFS_ROOT_ITEM_KEY;
245 root_key.offset = (u64)-1;
246
247 while (1) {
248 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
249 if (ret < 0) {
250 err = ret;
251 break;
252 }
253
254 leaf = path->nodes[0];
255 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
256 ret = btrfs_next_leaf(tree_root, path);
257 if (ret < 0)
258 err = ret;
259 if (ret != 0)
260 break;
261 leaf = path->nodes[0];
262 }
263
264 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
265 btrfs_release_path(path);
266
267 if (key.objectid != BTRFS_ORPHAN_OBJECTID ||
268 key.type != BTRFS_ORPHAN_ITEM_KEY)
269 break;
270
271 root_key.objectid = key.offset;
272 key.offset++;
273
274 root = btrfs_read_fs_root(tree_root, &root_key);
275 err = PTR_ERR_OR_ZERO(root);
276 if (err && err != -ENOENT) {
277 break;
278 } else if (err == -ENOENT) {
279 struct btrfs_trans_handle *trans;
280
281 btrfs_release_path(path);
282
283 trans = btrfs_join_transaction(tree_root);
284 if (IS_ERR(trans)) {
285 err = PTR_ERR(trans);
286 btrfs_error(tree_root->fs_info, err,
287 "Failed to start trans to delete "
288 "orphan item");
289 break;
290 }
291 err = btrfs_del_orphan_item(trans, tree_root,
292 root_key.objectid);
293 btrfs_end_transaction(trans, tree_root);
294 if (err) {
295 btrfs_error(tree_root->fs_info, err,
296 "Failed to delete root orphan "
297 "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 root->orphan_item_inserted = 1;
310
311 err = btrfs_insert_fs_root(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 btrfs_add_dead_root(root);
320 }
321
322 btrfs_free_path(path);
323 return err;
324}
325
326/* drop the root item for 'key' from 'root' */
327int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
328 struct btrfs_key *key)
329{
330 struct btrfs_path *path;
331 int ret;
332
333 path = btrfs_alloc_path();
334 if (!path)
335 return -ENOMEM;
336 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
337 if (ret < 0)
338 goto out;
339
340 BUG_ON(ret != 0);
341
342 ret = btrfs_del_item(trans, root, path);
343out:
344 btrfs_free_path(path);
345 return ret;
346}
347
348int btrfs_del_root_ref(struct btrfs_trans_handle *trans,
349 struct btrfs_root *tree_root,
350 u64 root_id, u64 ref_id, u64 dirid, u64 *sequence,
351 const char *name, int name_len)
352
353{
354 struct btrfs_path *path;
355 struct btrfs_root_ref *ref;
356 struct extent_buffer *leaf;
357 struct btrfs_key key;
358 unsigned long ptr;
359 int err = 0;
360 int ret;
361
362 path = btrfs_alloc_path();
363 if (!path)
364 return -ENOMEM;
365
366 key.objectid = root_id;
367 key.type = BTRFS_ROOT_BACKREF_KEY;
368 key.offset = ref_id;
369again:
370 ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
371 BUG_ON(ret < 0);
372 if (ret == 0) {
373 leaf = path->nodes[0];
374 ref = btrfs_item_ptr(leaf, path->slots[0],
375 struct btrfs_root_ref);
376
377 WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid);
378 WARN_ON(btrfs_root_ref_name_len(leaf, ref) != name_len);
379 ptr = (unsigned long)(ref + 1);
380 WARN_ON(memcmp_extent_buffer(leaf, name, ptr, name_len));
381 *sequence = btrfs_root_ref_sequence(leaf, ref);
382
383 ret = btrfs_del_item(trans, tree_root, path);
384 if (ret) {
385 err = ret;
386 goto out;
387 }
388 } else
389 err = -ENOENT;
390
391 if (key.type == BTRFS_ROOT_BACKREF_KEY) {
392 btrfs_release_path(path);
393 key.objectid = ref_id;
394 key.type = BTRFS_ROOT_REF_KEY;
395 key.offset = root_id;
396 goto again;
397 }
398
399out:
400 btrfs_free_path(path);
401 return err;
402}
403
404/*
405 * add a btrfs_root_ref item. type is either BTRFS_ROOT_REF_KEY
406 * or BTRFS_ROOT_BACKREF_KEY.
407 *
408 * The dirid, sequence, name and name_len refer to the directory entry
409 * that is referencing the root.
410 *
411 * For a forward ref, the root_id is the id of the tree referencing
412 * the root and ref_id is the id of the subvol or snapshot.
413 *
414 * For a back ref the root_id is the id of the subvol or snapshot and
415 * ref_id is the id of the tree referencing it.
416 *
417 * Will return 0, -ENOMEM, or anything from the CoW path
418 */
419int btrfs_add_root_ref(struct btrfs_trans_handle *trans,
420 struct btrfs_root *tree_root,
421 u64 root_id, u64 ref_id, u64 dirid, u64 sequence,
422 const char *name, int name_len)
423{
424 struct btrfs_key key;
425 int ret;
426 struct btrfs_path *path;
427 struct btrfs_root_ref *ref;
428 struct extent_buffer *leaf;
429 unsigned long ptr;
430
431 path = btrfs_alloc_path();
432 if (!path)
433 return -ENOMEM;
434
435 key.objectid = root_id;
436 key.type = BTRFS_ROOT_BACKREF_KEY;
437 key.offset = ref_id;
438again:
439 ret = btrfs_insert_empty_item(trans, tree_root, path, &key,
440 sizeof(*ref) + name_len);
441 if (ret) {
442 btrfs_abort_transaction(trans, tree_root, ret);
443 btrfs_free_path(path);
444 return ret;
445 }
446
447 leaf = path->nodes[0];
448 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
449 btrfs_set_root_ref_dirid(leaf, ref, dirid);
450 btrfs_set_root_ref_sequence(leaf, ref, sequence);
451 btrfs_set_root_ref_name_len(leaf, ref, name_len);
452 ptr = (unsigned long)(ref + 1);
453 write_extent_buffer(leaf, name, ptr, name_len);
454 btrfs_mark_buffer_dirty(leaf);
455
456 if (key.type == BTRFS_ROOT_BACKREF_KEY) {
457 btrfs_release_path(path);
458 key.objectid = ref_id;
459 key.type = BTRFS_ROOT_REF_KEY;
460 key.offset = root_id;
461 goto again;
462 }
463
464 btrfs_free_path(path);
465 return 0;
466}
467
468/*
469 * Old btrfs forgets to init root_item->flags and root_item->byte_limit
470 * for subvolumes. To work around this problem, we steal a bit from
471 * root_item->inode_item->flags, and use it to indicate if those fields
472 * have been properly initialized.
473 */
474void btrfs_check_and_init_root_item(struct btrfs_root_item *root_item)
475{
476 u64 inode_flags = btrfs_stack_inode_flags(&root_item->inode);
477
478 if (!(inode_flags & BTRFS_INODE_ROOT_ITEM_INIT)) {
479 inode_flags |= BTRFS_INODE_ROOT_ITEM_INIT;
480 btrfs_set_stack_inode_flags(&root_item->inode, inode_flags);
481 btrfs_set_root_flags(root_item, 0);
482 btrfs_set_root_limit(root_item, 0);
483 }
484}
485
486void btrfs_update_root_times(struct btrfs_trans_handle *trans,
487 struct btrfs_root *root)
488{
489 struct btrfs_root_item *item = &root->root_item;
490 struct timespec ct = CURRENT_TIME;
491
492 spin_lock(&root->root_item_lock);
493 btrfs_set_root_ctransid(item, trans->transid);
494 btrfs_set_stack_timespec_sec(&item->ctime, ct.tv_sec);
495 btrfs_set_stack_timespec_nsec(&item->ctime, ct.tv_nsec);
496 spin_unlock(&root->root_item_lock);
497}