Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
6cbd5570 CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
6cbd5570 CM |
4 | */ |
5 | ||
886322e8 | 6 | #include <linux/err.h> |
8ea05e3a | 7 | #include <linux/uuid.h> |
3768f368 | 8 | #include "ctree.h" |
5eda7b5e | 9 | #include "transaction.h" |
3768f368 CM |
10 | #include "disk-io.h" |
11 | #include "print-tree.h" | |
28a32d2b JB |
12 | #include "qgroup.h" |
13 | #include "space-info.h" | |
3768f368 | 14 | |
8ea05e3a AB |
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 | */ | |
171170c1 ST |
22 | static void btrfs_read_root_item(struct extent_buffer *eb, int slot, |
23 | struct btrfs_root_item *item) | |
8ea05e3a AB |
24 | { |
25 | uuid_le uuid; | |
f65e25e3 | 26 | u32 len; |
8ea05e3a AB |
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), | |
f65e25e3 | 31 | min_t(u32, len, sizeof(*item))); |
8ea05e3a AB |
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) { | |
f14d104d | 37 | btrfs_warn(eb->fs_info, |
5d163e0e | 38 | "mismatching generation and generation_v2 found in root item. This root was probably mounted with an older kernel. Resetting all new fields."); |
8ea05e3a AB |
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 | ||
d352ac68 | 52 | /* |
cb517eab MX |
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 | |
01327610 | 58 | * root_key: the root key of the tree we look for |
cb517eab | 59 | * |
01327610 | 60 | * If ->offset of 'search_key' is -1ULL, it means we are not sure the offset |
cb517eab MX |
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. | |
d352ac68 | 65 | */ |
310712b2 | 66 | int btrfs_find_root(struct btrfs_root *root, const struct btrfs_key *search_key, |
cb517eab MX |
67 | struct btrfs_path *path, struct btrfs_root_item *root_item, |
68 | struct btrfs_key *root_key) | |
3768f368 | 69 | { |
5f39d397 CM |
70 | struct btrfs_key found_key; |
71 | struct extent_buffer *l; | |
3768f368 CM |
72 | int ret; |
73 | int slot; | |
74 | ||
cb517eab | 75 | ret = btrfs_search_slot(NULL, root, search_key, path, 0, 0); |
3768f368 | 76 | if (ret < 0) |
cb517eab | 77 | return ret; |
5f39d397 | 78 | |
cb517eab MX |
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; | |
76dda93c | 88 | } |
cb517eab | 89 | |
5f39d397 | 90 | l = path->nodes[0]; |
cb517eab MX |
91 | slot = path->slots[0]; |
92 | ||
5f39d397 | 93 | btrfs_item_key_to_cpu(l, &found_key, slot); |
cb517eab | 94 | if (found_key.objectid != search_key->objectid || |
76dda93c | 95 | found_key.type != BTRFS_ROOT_ITEM_KEY) { |
3768f368 CM |
96 | ret = 1; |
97 | goto out; | |
98 | } | |
8ea05e3a | 99 | |
cb517eab MX |
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)); | |
3768f368 | 104 | out: |
cb517eab | 105 | btrfs_release_path(path); |
3768f368 CM |
106 | return ret; |
107 | } | |
108 | ||
bf5f32ec MF |
109 | void btrfs_set_root_node(struct btrfs_root_item *item, |
110 | struct extent_buffer *node) | |
5d4f98a2 YZ |
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)); | |
5d4f98a2 YZ |
115 | } |
116 | ||
d352ac68 CM |
117 | /* |
118 | * copy the data in 'item' into the btree | |
119 | */ | |
e089f05c CM |
120 | int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root |
121 | *root, struct btrfs_key *key, struct btrfs_root_item | |
122 | *item) | |
3768f368 | 123 | { |
0b246afa | 124 | struct btrfs_fs_info *fs_info = root->fs_info; |
5caf2a00 | 125 | struct btrfs_path *path; |
5f39d397 | 126 | struct extent_buffer *l; |
3768f368 CM |
127 | int ret; |
128 | int slot; | |
5f39d397 | 129 | unsigned long ptr; |
0412e58c | 130 | u32 old_len; |
3768f368 | 131 | |
5caf2a00 | 132 | path = btrfs_alloc_path(); |
b45a9d8b JM |
133 | if (!path) |
134 | return -ENOMEM; | |
135 | ||
5caf2a00 | 136 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); |
72bd2323 | 137 | if (ret < 0) |
005d6427 | 138 | goto out; |
d6667462 | 139 | |
7ac1e464 QW |
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; | |
d6667462 CM |
148 | } |
149 | ||
5f39d397 | 150 | l = path->nodes[0]; |
5caf2a00 | 151 | slot = path->slots[0]; |
5f39d397 | 152 | ptr = btrfs_item_ptr_offset(l, slot); |
8ea05e3a AB |
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); | |
005d6427 | 164 | if (ret < 0) { |
66642832 | 165 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
166 | goto out; |
167 | } | |
168 | ||
8ea05e3a | 169 | ret = btrfs_del_item(trans, root, path); |
005d6427 | 170 | if (ret < 0) { |
66642832 | 171 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
172 | goto out; |
173 | } | |
8ea05e3a AB |
174 | btrfs_release_path(path); |
175 | ret = btrfs_insert_empty_item(trans, root, path, | |
176 | key, sizeof(*item)); | |
005d6427 | 177 | if (ret < 0) { |
66642832 | 178 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
179 | goto out; |
180 | } | |
8ea05e3a AB |
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 | ||
5f39d397 | 192 | write_extent_buffer(l, item, ptr, sizeof(*item)); |
5caf2a00 | 193 | btrfs_mark_buffer_dirty(path->nodes[0]); |
3768f368 | 194 | out: |
5caf2a00 | 195 | btrfs_free_path(path); |
3768f368 CM |
196 | return ret; |
197 | } | |
198 | ||
d16cb050 | 199 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
310712b2 | 200 | const struct btrfs_key *key, struct btrfs_root_item *item) |
3768f368 | 201 | { |
8ea05e3a AB |
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)); | |
d16cb050 | 206 | return btrfs_insert_item(trans, root, key, item, sizeof(*item)); |
3768f368 CM |
207 | } |
208 | ||
6bccf3ab | 209 | int btrfs_find_orphan_roots(struct btrfs_fs_info *fs_info) |
76dda93c | 210 | { |
6bccf3ab | 211 | struct btrfs_root *tree_root = fs_info->tree_root; |
76dda93c YZ |
212 | struct extent_buffer *leaf; |
213 | struct btrfs_path *path; | |
214 | struct btrfs_key key; | |
d68fc57b YZ |
215 | struct btrfs_key root_key; |
216 | struct btrfs_root *root; | |
76dda93c YZ |
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 | ||
d68fc57b YZ |
228 | root_key.type = BTRFS_ROOT_ITEM_KEY; |
229 | root_key.offset = (u64)-1; | |
230 | ||
76dda93c YZ |
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]); | |
b3b4aa74 | 249 | btrfs_release_path(path); |
76dda93c YZ |
250 | |
251 | if (key.objectid != BTRFS_ORPHAN_OBJECTID || | |
252 | key.type != BTRFS_ORPHAN_ITEM_KEY) | |
253 | break; | |
254 | ||
d68fc57b YZ |
255 | root_key.objectid = key.offset; |
256 | key.offset++; | |
257 | ||
35bbb97f JM |
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 | */ | |
0b246afa | 265 | root = btrfs_lookup_fs_root(fs_info, root_key.objectid); |
35bbb97f JM |
266 | if (root) { |
267 | WARN_ON(!test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, | |
268 | &root->state)); | |
78c52d9e JB |
269 | if (btrfs_root_refs(&root->root_item) == 0) { |
270 | set_bit(BTRFS_ROOT_DEAD_TREE, &root->state); | |
35bbb97f | 271 | btrfs_add_dead_root(root); |
78c52d9e | 272 | } |
35bbb97f JM |
273 | continue; |
274 | } | |
275 | ||
cb517eab | 276 | root = btrfs_read_fs_root(tree_root, &root_key); |
886322e8 | 277 | err = PTR_ERR_OR_ZERO(root); |
68a7342c | 278 | if (err && err != -ENOENT) { |
cb517eab | 279 | break; |
68a7342c JB |
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); | |
0b246afa | 288 | btrfs_handle_fs_error(fs_info, err, |
5d163e0e | 289 | "Failed to start trans to delete orphan item"); |
68a7342c JB |
290 | break; |
291 | } | |
292 | err = btrfs_del_orphan_item(trans, tree_root, | |
293 | root_key.objectid); | |
3a45bb20 | 294 | btrfs_end_transaction(trans); |
68a7342c | 295 | if (err) { |
0b246afa | 296 | btrfs_handle_fs_error(fs_info, err, |
5d163e0e | 297 | "Failed to delete root orphan item"); |
68a7342c JB |
298 | break; |
299 | } | |
300 | continue; | |
cb517eab MX |
301 | } |
302 | ||
cb517eab MX |
303 | err = btrfs_init_fs_root(root); |
304 | if (err) { | |
305 | btrfs_free_fs_root(root); | |
76dda93c YZ |
306 | break; |
307 | } | |
308 | ||
27cdeb70 | 309 | set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state); |
cb517eab | 310 | |
0b246afa | 311 | err = btrfs_insert_fs_root(fs_info, root); |
cb517eab | 312 | if (err) { |
35bbb97f | 313 | BUG_ON(err == -EEXIST); |
cb517eab | 314 | btrfs_free_fs_root(root); |
d68fc57b YZ |
315 | break; |
316 | } | |
14927d95 | 317 | |
78c52d9e JB |
318 | if (btrfs_root_refs(&root->root_item) == 0) { |
319 | set_bit(BTRFS_ROOT_DEAD_TREE, &root->state); | |
14927d95 | 320 | btrfs_add_dead_root(root); |
78c52d9e | 321 | } |
76dda93c YZ |
322 | } |
323 | ||
324 | btrfs_free_path(path); | |
325 | return err; | |
326 | } | |
327 | ||
1cd5447e JM |
328 | /* drop the root item for 'key' from the tree root */ |
329 | int btrfs_del_root(struct btrfs_trans_handle *trans, | |
ab9ce7d4 | 330 | const struct btrfs_key *key) |
3768f368 | 331 | { |
ab9ce7d4 | 332 | struct btrfs_root *root = trans->fs_info->tree_root; |
5caf2a00 | 333 | struct btrfs_path *path; |
3768f368 CM |
334 | int ret; |
335 | ||
5caf2a00 | 336 | path = btrfs_alloc_path(); |
db5b493a TI |
337 | if (!path) |
338 | return -ENOMEM; | |
5caf2a00 | 339 | ret = btrfs_search_slot(trans, root, key, path, -1, 1); |
3768f368 CM |
340 | if (ret < 0) |
341 | goto out; | |
edbd8d4e | 342 | |
3768f368 | 343 | BUG_ON(ret != 0); |
c5739bba | 344 | |
5eda7b5e | 345 | ret = btrfs_del_item(trans, root, path); |
3768f368 | 346 | out: |
5caf2a00 | 347 | btrfs_free_path(path); |
3768f368 CM |
348 | return ret; |
349 | } | |
0660b5af | 350 | |
3ee1c553 LF |
351 | int 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) | |
4df27c4d | 354 | |
0660b5af | 355 | { |
3ee1c553 | 356 | struct btrfs_root *tree_root = trans->fs_info->tree_root; |
4df27c4d YZ |
357 | struct btrfs_path *path; |
358 | struct btrfs_root_ref *ref; | |
359 | struct extent_buffer *leaf; | |
0660b5af | 360 | struct btrfs_key key; |
4df27c4d YZ |
361 | unsigned long ptr; |
362 | int err = 0; | |
0660b5af | 363 | int ret; |
0660b5af CM |
364 | |
365 | path = btrfs_alloc_path(); | |
4df27c4d YZ |
366 | if (!path) |
367 | return -ENOMEM; | |
0660b5af CM |
368 | |
369 | key.objectid = root_id; | |
4df27c4d | 370 | key.type = BTRFS_ROOT_BACKREF_KEY; |
0660b5af | 371 | key.offset = ref_id; |
4df27c4d | 372 | again: |
0660b5af | 373 | ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1); |
4df27c4d YZ |
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); | |
65a246c5 TI |
387 | if (ret) { |
388 | err = ret; | |
389 | goto out; | |
390 | } | |
4df27c4d YZ |
391 | } else |
392 | err = -ENOENT; | |
393 | ||
394 | if (key.type == BTRFS_ROOT_BACKREF_KEY) { | |
b3b4aa74 | 395 | btrfs_release_path(path); |
4df27c4d YZ |
396 | key.objectid = ref_id; |
397 | key.type = BTRFS_ROOT_REF_KEY; | |
398 | key.offset = root_id; | |
399 | goto again; | |
400 | } | |
0660b5af | 401 | |
65a246c5 | 402 | out: |
0660b5af | 403 | btrfs_free_path(path); |
4df27c4d | 404 | return err; |
0660b5af CM |
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. | |
79787eaa JM |
419 | * |
420 | * Will return 0, -ENOMEM, or anything from the CoW path | |
0660b5af | 421 | */ |
6025c19f LF |
422 | int 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) | |
0660b5af | 425 | { |
6025c19f | 426 | struct btrfs_root *tree_root = trans->fs_info->tree_root; |
0660b5af CM |
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 | ||
0660b5af | 434 | path = btrfs_alloc_path(); |
4df27c4d YZ |
435 | if (!path) |
436 | return -ENOMEM; | |
0660b5af CM |
437 | |
438 | key.objectid = root_id; | |
4df27c4d | 439 | key.type = BTRFS_ROOT_BACKREF_KEY; |
0660b5af | 440 | key.offset = ref_id; |
4df27c4d | 441 | again: |
0660b5af CM |
442 | ret = btrfs_insert_empty_item(trans, tree_root, path, &key, |
443 | sizeof(*ref) + name_len); | |
79787eaa | 444 | if (ret) { |
66642832 | 445 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
446 | btrfs_free_path(path); |
447 | return ret; | |
448 | } | |
0660b5af CM |
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 | ||
4df27c4d | 459 | if (key.type == BTRFS_ROOT_BACKREF_KEY) { |
b3b4aa74 | 460 | btrfs_release_path(path); |
4df27c4d YZ |
461 | key.objectid = ref_id; |
462 | key.type = BTRFS_ROOT_REF_KEY; | |
463 | key.offset = root_id; | |
464 | goto again; | |
465 | } | |
466 | ||
0660b5af | 467 | btrfs_free_path(path); |
4df27c4d | 468 | return 0; |
0660b5af | 469 | } |
08fe4db1 LZ |
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 | */ | |
477 | void btrfs_check_and_init_root_item(struct btrfs_root_item *root_item) | |
478 | { | |
3cae210f | 479 | u64 inode_flags = btrfs_stack_inode_flags(&root_item->inode); |
08fe4db1 LZ |
480 | |
481 | if (!(inode_flags & BTRFS_INODE_ROOT_ITEM_INIT)) { | |
482 | inode_flags |= BTRFS_INODE_ROOT_ITEM_INIT; | |
3cae210f QW |
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); | |
08fe4db1 LZ |
486 | } |
487 | } | |
8ea05e3a AB |
488 | |
489 | void btrfs_update_root_times(struct btrfs_trans_handle *trans, | |
490 | struct btrfs_root *root) | |
491 | { | |
492 | struct btrfs_root_item *item = &root->root_item; | |
95582b00 | 493 | struct timespec64 ct; |
8ea05e3a | 494 | |
95582b00 | 495 | ktime_get_real_ts64(&ct); |
5f3ab90a | 496 | spin_lock(&root->root_item_lock); |
3cae210f QW |
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); | |
5f3ab90a | 500 | spin_unlock(&root->root_item_lock); |
8ea05e3a | 501 | } |
28a32d2b JB |
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 | */ | |
517 | int 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_trans_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 | ||
551 | void 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 | } |