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 | 24 | { |
f65e25e3 | 25 | u32 len; |
8ea05e3a AB |
26 | int need_reset = 0; |
27 | ||
28 | len = btrfs_item_size_nr(eb, slot); | |
29 | read_extent_buffer(eb, item, btrfs_item_ptr_offset(eb, slot), | |
f65e25e3 | 30 | min_t(u32, len, sizeof(*item))); |
8ea05e3a AB |
31 | if (len < sizeof(*item)) |
32 | need_reset = 1; | |
33 | if (!need_reset && btrfs_root_generation(item) | |
34 | != btrfs_root_generation_v2(item)) { | |
35 | if (btrfs_root_generation_v2(item) != 0) { | |
f14d104d | 36 | btrfs_warn(eb->fs_info, |
5d163e0e | 37 | "mismatching generation and generation_v2 found in root item. This root was probably mounted with an older kernel. Resetting all new fields."); |
8ea05e3a AB |
38 | } |
39 | need_reset = 1; | |
40 | } | |
41 | if (need_reset) { | |
42 | memset(&item->generation_v2, 0, | |
43 | sizeof(*item) - offsetof(struct btrfs_root_item, | |
44 | generation_v2)); | |
45 | ||
807fc790 | 46 | generate_random_guid(item->uuid); |
8ea05e3a AB |
47 | } |
48 | } | |
49 | ||
d352ac68 | 50 | /* |
cb517eab MX |
51 | * btrfs_find_root - lookup the root by the key. |
52 | * root: the root of the root tree | |
53 | * search_key: the key to search | |
54 | * path: the path we search | |
55 | * root_item: the root item of the tree we look for | |
01327610 | 56 | * root_key: the root key of the tree we look for |
cb517eab | 57 | * |
01327610 | 58 | * If ->offset of 'search_key' is -1ULL, it means we are not sure the offset |
cb517eab MX |
59 | * of the search key, just lookup the root with the highest offset for a |
60 | * given objectid. | |
61 | * | |
62 | * If we find something return 0, otherwise > 0, < 0 on error. | |
d352ac68 | 63 | */ |
310712b2 | 64 | int btrfs_find_root(struct btrfs_root *root, const struct btrfs_key *search_key, |
cb517eab MX |
65 | struct btrfs_path *path, struct btrfs_root_item *root_item, |
66 | struct btrfs_key *root_key) | |
3768f368 | 67 | { |
5f39d397 CM |
68 | struct btrfs_key found_key; |
69 | struct extent_buffer *l; | |
3768f368 CM |
70 | int ret; |
71 | int slot; | |
72 | ||
cb517eab | 73 | ret = btrfs_search_slot(NULL, root, search_key, path, 0, 0); |
3768f368 | 74 | if (ret < 0) |
cb517eab | 75 | return ret; |
5f39d397 | 76 | |
cb517eab MX |
77 | if (search_key->offset != -1ULL) { /* the search key is exact */ |
78 | if (ret > 0) | |
79 | goto out; | |
80 | } else { | |
81 | BUG_ON(ret == 0); /* Logical error */ | |
82 | if (path->slots[0] == 0) | |
83 | goto out; | |
84 | path->slots[0]--; | |
85 | ret = 0; | |
76dda93c | 86 | } |
cb517eab | 87 | |
5f39d397 | 88 | l = path->nodes[0]; |
cb517eab MX |
89 | slot = path->slots[0]; |
90 | ||
5f39d397 | 91 | btrfs_item_key_to_cpu(l, &found_key, slot); |
cb517eab | 92 | if (found_key.objectid != search_key->objectid || |
76dda93c | 93 | found_key.type != BTRFS_ROOT_ITEM_KEY) { |
3768f368 CM |
94 | ret = 1; |
95 | goto out; | |
96 | } | |
8ea05e3a | 97 | |
cb517eab MX |
98 | if (root_item) |
99 | btrfs_read_root_item(l, slot, root_item); | |
100 | if (root_key) | |
101 | memcpy(root_key, &found_key, sizeof(found_key)); | |
3768f368 | 102 | out: |
cb517eab | 103 | btrfs_release_path(path); |
3768f368 CM |
104 | return ret; |
105 | } | |
106 | ||
bf5f32ec MF |
107 | void btrfs_set_root_node(struct btrfs_root_item *item, |
108 | struct extent_buffer *node) | |
5d4f98a2 YZ |
109 | { |
110 | btrfs_set_root_bytenr(item, node->start); | |
111 | btrfs_set_root_level(item, btrfs_header_level(node)); | |
112 | btrfs_set_root_generation(item, btrfs_header_generation(node)); | |
5d4f98a2 YZ |
113 | } |
114 | ||
d352ac68 CM |
115 | /* |
116 | * copy the data in 'item' into the btree | |
117 | */ | |
e089f05c CM |
118 | int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root |
119 | *root, struct btrfs_key *key, struct btrfs_root_item | |
120 | *item) | |
3768f368 | 121 | { |
0b246afa | 122 | struct btrfs_fs_info *fs_info = root->fs_info; |
5caf2a00 | 123 | struct btrfs_path *path; |
5f39d397 | 124 | struct extent_buffer *l; |
3768f368 CM |
125 | int ret; |
126 | int slot; | |
5f39d397 | 127 | unsigned long ptr; |
0412e58c | 128 | u32 old_len; |
3768f368 | 129 | |
5caf2a00 | 130 | path = btrfs_alloc_path(); |
b45a9d8b JM |
131 | if (!path) |
132 | return -ENOMEM; | |
133 | ||
5caf2a00 | 134 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); |
72bd2323 | 135 | if (ret < 0) |
005d6427 | 136 | goto out; |
d6667462 | 137 | |
7ac1e464 QW |
138 | if (ret > 0) { |
139 | btrfs_crit(fs_info, | |
140 | "unable to find root key (%llu %u %llu) in tree %llu", | |
141 | key->objectid, key->type, key->offset, | |
142 | root->root_key.objectid); | |
143 | ret = -EUCLEAN; | |
144 | btrfs_abort_transaction(trans, ret); | |
145 | goto out; | |
d6667462 CM |
146 | } |
147 | ||
5f39d397 | 148 | l = path->nodes[0]; |
5caf2a00 | 149 | slot = path->slots[0]; |
5f39d397 | 150 | ptr = btrfs_item_ptr_offset(l, slot); |
8ea05e3a AB |
151 | old_len = btrfs_item_size_nr(l, slot); |
152 | ||
153 | /* | |
154 | * If this is the first time we update the root item which originated | |
155 | * from an older kernel, we need to enlarge the item size to make room | |
156 | * for the added fields. | |
157 | */ | |
158 | if (old_len < sizeof(*item)) { | |
159 | btrfs_release_path(path); | |
160 | ret = btrfs_search_slot(trans, root, key, path, | |
161 | -1, 1); | |
005d6427 | 162 | if (ret < 0) { |
66642832 | 163 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
164 | goto out; |
165 | } | |
166 | ||
8ea05e3a | 167 | ret = btrfs_del_item(trans, root, path); |
005d6427 | 168 | if (ret < 0) { |
66642832 | 169 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
170 | goto out; |
171 | } | |
8ea05e3a AB |
172 | btrfs_release_path(path); |
173 | ret = btrfs_insert_empty_item(trans, root, path, | |
174 | key, sizeof(*item)); | |
005d6427 | 175 | if (ret < 0) { |
66642832 | 176 | btrfs_abort_transaction(trans, ret); |
005d6427 DS |
177 | goto out; |
178 | } | |
8ea05e3a AB |
179 | l = path->nodes[0]; |
180 | slot = path->slots[0]; | |
181 | ptr = btrfs_item_ptr_offset(l, slot); | |
182 | } | |
183 | ||
184 | /* | |
185 | * Update generation_v2 so at the next mount we know the new root | |
186 | * fields are valid. | |
187 | */ | |
188 | btrfs_set_root_generation_v2(item, btrfs_root_generation(item)); | |
189 | ||
5f39d397 | 190 | write_extent_buffer(l, item, ptr, sizeof(*item)); |
5caf2a00 | 191 | btrfs_mark_buffer_dirty(path->nodes[0]); |
3768f368 | 192 | out: |
5caf2a00 | 193 | btrfs_free_path(path); |
3768f368 CM |
194 | return ret; |
195 | } | |
196 | ||
d16cb050 | 197 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
310712b2 | 198 | const struct btrfs_key *key, struct btrfs_root_item *item) |
3768f368 | 199 | { |
8ea05e3a AB |
200 | /* |
201 | * Make sure generation v1 and v2 match. See update_root for details. | |
202 | */ | |
203 | btrfs_set_root_generation_v2(item, btrfs_root_generation(item)); | |
d16cb050 | 204 | return btrfs_insert_item(trans, root, key, item, sizeof(*item)); |
3768f368 CM |
205 | } |
206 | ||
6bccf3ab | 207 | int btrfs_find_orphan_roots(struct btrfs_fs_info *fs_info) |
76dda93c | 208 | { |
6bccf3ab | 209 | struct btrfs_root *tree_root = fs_info->tree_root; |
76dda93c YZ |
210 | struct extent_buffer *leaf; |
211 | struct btrfs_path *path; | |
212 | struct btrfs_key key; | |
d68fc57b | 213 | struct btrfs_root *root; |
76dda93c YZ |
214 | int err = 0; |
215 | int ret; | |
216 | ||
217 | path = btrfs_alloc_path(); | |
218 | if (!path) | |
219 | return -ENOMEM; | |
220 | ||
221 | key.objectid = BTRFS_ORPHAN_OBJECTID; | |
222 | key.type = BTRFS_ORPHAN_ITEM_KEY; | |
223 | key.offset = 0; | |
224 | ||
225 | while (1) { | |
56e9357a DS |
226 | u64 root_objectid; |
227 | ||
76dda93c YZ |
228 | ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0); |
229 | if (ret < 0) { | |
230 | err = ret; | |
231 | break; | |
232 | } | |
233 | ||
234 | leaf = path->nodes[0]; | |
235 | if (path->slots[0] >= btrfs_header_nritems(leaf)) { | |
236 | ret = btrfs_next_leaf(tree_root, path); | |
237 | if (ret < 0) | |
238 | err = ret; | |
239 | if (ret != 0) | |
240 | break; | |
241 | leaf = path->nodes[0]; | |
242 | } | |
243 | ||
244 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
b3b4aa74 | 245 | btrfs_release_path(path); |
76dda93c YZ |
246 | |
247 | if (key.objectid != BTRFS_ORPHAN_OBJECTID || | |
248 | key.type != BTRFS_ORPHAN_ITEM_KEY) | |
249 | break; | |
250 | ||
56e9357a | 251 | root_objectid = key.offset; |
d68fc57b YZ |
252 | key.offset++; |
253 | ||
56e9357a | 254 | root = btrfs_get_fs_root(fs_info, root_objectid, false); |
886322e8 | 255 | err = PTR_ERR_OR_ZERO(root); |
68a7342c | 256 | if (err && err != -ENOENT) { |
cb517eab | 257 | break; |
68a7342c JB |
258 | } else if (err == -ENOENT) { |
259 | struct btrfs_trans_handle *trans; | |
260 | ||
261 | btrfs_release_path(path); | |
262 | ||
263 | trans = btrfs_join_transaction(tree_root); | |
264 | if (IS_ERR(trans)) { | |
265 | err = PTR_ERR(trans); | |
0b246afa | 266 | btrfs_handle_fs_error(fs_info, err, |
5d163e0e | 267 | "Failed to start trans to delete orphan item"); |
68a7342c JB |
268 | break; |
269 | } | |
270 | err = btrfs_del_orphan_item(trans, tree_root, | |
56e9357a | 271 | root_objectid); |
3a45bb20 | 272 | btrfs_end_transaction(trans); |
68a7342c | 273 | if (err) { |
0b246afa | 274 | btrfs_handle_fs_error(fs_info, err, |
5d163e0e | 275 | "Failed to delete root orphan item"); |
68a7342c JB |
276 | break; |
277 | } | |
278 | continue; | |
cb517eab MX |
279 | } |
280 | ||
e59d18b4 | 281 | WARN_ON(!test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)); |
78c52d9e JB |
282 | if (btrfs_root_refs(&root->root_item) == 0) { |
283 | set_bit(BTRFS_ROOT_DEAD_TREE, &root->state); | |
14927d95 | 284 | btrfs_add_dead_root(root); |
78c52d9e | 285 | } |
00246528 | 286 | btrfs_put_root(root); |
76dda93c YZ |
287 | } |
288 | ||
289 | btrfs_free_path(path); | |
290 | return err; | |
291 | } | |
292 | ||
1cd5447e JM |
293 | /* drop the root item for 'key' from the tree root */ |
294 | int btrfs_del_root(struct btrfs_trans_handle *trans, | |
ab9ce7d4 | 295 | const struct btrfs_key *key) |
3768f368 | 296 | { |
ab9ce7d4 | 297 | struct btrfs_root *root = trans->fs_info->tree_root; |
5caf2a00 | 298 | struct btrfs_path *path; |
3768f368 CM |
299 | int ret; |
300 | ||
5caf2a00 | 301 | path = btrfs_alloc_path(); |
db5b493a TI |
302 | if (!path) |
303 | return -ENOMEM; | |
5caf2a00 | 304 | ret = btrfs_search_slot(trans, root, key, path, -1, 1); |
3768f368 CM |
305 | if (ret < 0) |
306 | goto out; | |
edbd8d4e | 307 | |
3768f368 | 308 | BUG_ON(ret != 0); |
c5739bba | 309 | |
5eda7b5e | 310 | ret = btrfs_del_item(trans, root, path); |
3768f368 | 311 | out: |
5caf2a00 | 312 | btrfs_free_path(path); |
3768f368 CM |
313 | return ret; |
314 | } | |
0660b5af | 315 | |
3ee1c553 LF |
316 | int btrfs_del_root_ref(struct btrfs_trans_handle *trans, u64 root_id, |
317 | u64 ref_id, u64 dirid, u64 *sequence, const char *name, | |
318 | int name_len) | |
4df27c4d | 319 | |
0660b5af | 320 | { |
3ee1c553 | 321 | struct btrfs_root *tree_root = trans->fs_info->tree_root; |
4df27c4d YZ |
322 | struct btrfs_path *path; |
323 | struct btrfs_root_ref *ref; | |
324 | struct extent_buffer *leaf; | |
0660b5af | 325 | struct btrfs_key key; |
4df27c4d YZ |
326 | unsigned long ptr; |
327 | int err = 0; | |
0660b5af | 328 | int ret; |
0660b5af CM |
329 | |
330 | path = btrfs_alloc_path(); | |
4df27c4d YZ |
331 | if (!path) |
332 | return -ENOMEM; | |
0660b5af CM |
333 | |
334 | key.objectid = root_id; | |
4df27c4d | 335 | key.type = BTRFS_ROOT_BACKREF_KEY; |
0660b5af | 336 | key.offset = ref_id; |
4df27c4d | 337 | again: |
0660b5af | 338 | ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1); |
4df27c4d YZ |
339 | BUG_ON(ret < 0); |
340 | if (ret == 0) { | |
341 | leaf = path->nodes[0]; | |
342 | ref = btrfs_item_ptr(leaf, path->slots[0], | |
343 | struct btrfs_root_ref); | |
4df27c4d | 344 | ptr = (unsigned long)(ref + 1); |
423a716c JB |
345 | if ((btrfs_root_ref_dirid(leaf, ref) != dirid) || |
346 | (btrfs_root_ref_name_len(leaf, ref) != name_len) || | |
347 | memcmp_extent_buffer(leaf, name, ptr, name_len)) { | |
348 | err = -ENOENT; | |
349 | goto out; | |
350 | } | |
4df27c4d YZ |
351 | *sequence = btrfs_root_ref_sequence(leaf, ref); |
352 | ||
353 | ret = btrfs_del_item(trans, tree_root, path); | |
65a246c5 TI |
354 | if (ret) { |
355 | err = ret; | |
356 | goto out; | |
357 | } | |
4df27c4d YZ |
358 | } else |
359 | err = -ENOENT; | |
360 | ||
361 | if (key.type == BTRFS_ROOT_BACKREF_KEY) { | |
b3b4aa74 | 362 | btrfs_release_path(path); |
4df27c4d YZ |
363 | key.objectid = ref_id; |
364 | key.type = BTRFS_ROOT_REF_KEY; | |
365 | key.offset = root_id; | |
366 | goto again; | |
367 | } | |
0660b5af | 368 | |
65a246c5 | 369 | out: |
0660b5af | 370 | btrfs_free_path(path); |
4df27c4d | 371 | return err; |
0660b5af CM |
372 | } |
373 | ||
374 | /* | |
375 | * add a btrfs_root_ref item. type is either BTRFS_ROOT_REF_KEY | |
376 | * or BTRFS_ROOT_BACKREF_KEY. | |
377 | * | |
378 | * The dirid, sequence, name and name_len refer to the directory entry | |
379 | * that is referencing the root. | |
380 | * | |
381 | * For a forward ref, the root_id is the id of the tree referencing | |
382 | * the root and ref_id is the id of the subvol or snapshot. | |
383 | * | |
384 | * For a back ref the root_id is the id of the subvol or snapshot and | |
385 | * ref_id is the id of the tree referencing it. | |
79787eaa JM |
386 | * |
387 | * Will return 0, -ENOMEM, or anything from the CoW path | |
0660b5af | 388 | */ |
6025c19f LF |
389 | int btrfs_add_root_ref(struct btrfs_trans_handle *trans, u64 root_id, |
390 | u64 ref_id, u64 dirid, u64 sequence, const char *name, | |
391 | int name_len) | |
0660b5af | 392 | { |
6025c19f | 393 | struct btrfs_root *tree_root = trans->fs_info->tree_root; |
0660b5af CM |
394 | struct btrfs_key key; |
395 | int ret; | |
396 | struct btrfs_path *path; | |
397 | struct btrfs_root_ref *ref; | |
398 | struct extent_buffer *leaf; | |
399 | unsigned long ptr; | |
400 | ||
0660b5af | 401 | path = btrfs_alloc_path(); |
4df27c4d YZ |
402 | if (!path) |
403 | return -ENOMEM; | |
0660b5af CM |
404 | |
405 | key.objectid = root_id; | |
4df27c4d | 406 | key.type = BTRFS_ROOT_BACKREF_KEY; |
0660b5af | 407 | key.offset = ref_id; |
4df27c4d | 408 | again: |
0660b5af CM |
409 | ret = btrfs_insert_empty_item(trans, tree_root, path, &key, |
410 | sizeof(*ref) + name_len); | |
79787eaa | 411 | if (ret) { |
66642832 | 412 | btrfs_abort_transaction(trans, ret); |
79787eaa JM |
413 | btrfs_free_path(path); |
414 | return ret; | |
415 | } | |
0660b5af CM |
416 | |
417 | leaf = path->nodes[0]; | |
418 | ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); | |
419 | btrfs_set_root_ref_dirid(leaf, ref, dirid); | |
420 | btrfs_set_root_ref_sequence(leaf, ref, sequence); | |
421 | btrfs_set_root_ref_name_len(leaf, ref, name_len); | |
422 | ptr = (unsigned long)(ref + 1); | |
423 | write_extent_buffer(leaf, name, ptr, name_len); | |
424 | btrfs_mark_buffer_dirty(leaf); | |
425 | ||
4df27c4d | 426 | if (key.type == BTRFS_ROOT_BACKREF_KEY) { |
b3b4aa74 | 427 | btrfs_release_path(path); |
4df27c4d YZ |
428 | key.objectid = ref_id; |
429 | key.type = BTRFS_ROOT_REF_KEY; | |
430 | key.offset = root_id; | |
431 | goto again; | |
432 | } | |
433 | ||
0660b5af | 434 | btrfs_free_path(path); |
4df27c4d | 435 | return 0; |
0660b5af | 436 | } |
08fe4db1 LZ |
437 | |
438 | /* | |
439 | * Old btrfs forgets to init root_item->flags and root_item->byte_limit | |
440 | * for subvolumes. To work around this problem, we steal a bit from | |
441 | * root_item->inode_item->flags, and use it to indicate if those fields | |
442 | * have been properly initialized. | |
443 | */ | |
444 | void btrfs_check_and_init_root_item(struct btrfs_root_item *root_item) | |
445 | { | |
3cae210f | 446 | u64 inode_flags = btrfs_stack_inode_flags(&root_item->inode); |
08fe4db1 LZ |
447 | |
448 | if (!(inode_flags & BTRFS_INODE_ROOT_ITEM_INIT)) { | |
449 | inode_flags |= BTRFS_INODE_ROOT_ITEM_INIT; | |
3cae210f QW |
450 | btrfs_set_stack_inode_flags(&root_item->inode, inode_flags); |
451 | btrfs_set_root_flags(root_item, 0); | |
452 | btrfs_set_root_limit(root_item, 0); | |
08fe4db1 LZ |
453 | } |
454 | } | |
8ea05e3a AB |
455 | |
456 | void btrfs_update_root_times(struct btrfs_trans_handle *trans, | |
457 | struct btrfs_root *root) | |
458 | { | |
459 | struct btrfs_root_item *item = &root->root_item; | |
95582b00 | 460 | struct timespec64 ct; |
8ea05e3a | 461 | |
95582b00 | 462 | ktime_get_real_ts64(&ct); |
5f3ab90a | 463 | spin_lock(&root->root_item_lock); |
3cae210f QW |
464 | btrfs_set_root_ctransid(item, trans->transid); |
465 | btrfs_set_stack_timespec_sec(&item->ctime, ct.tv_sec); | |
466 | btrfs_set_stack_timespec_nsec(&item->ctime, ct.tv_nsec); | |
5f3ab90a | 467 | spin_unlock(&root->root_item_lock); |
8ea05e3a | 468 | } |
28a32d2b JB |
469 | |
470 | /* | |
471 | * btrfs_subvolume_reserve_metadata() - reserve space for subvolume operation | |
472 | * root: the root of the parent directory | |
473 | * rsv: block reservation | |
474 | * items: the number of items that we need do reservation | |
475 | * use_global_rsv: allow fallback to the global block reservation | |
476 | * | |
477 | * This function is used to reserve the space for snapshot/subvolume | |
478 | * creation and deletion. Those operations are different with the | |
479 | * common file/directory operations, they change two fs/file trees | |
480 | * and root tree, the number of items that the qgroup reserves is | |
481 | * different with the free space reservation. So we can not use | |
482 | * the space reservation mechanism in start_transaction(). | |
483 | */ | |
484 | int btrfs_subvolume_reserve_metadata(struct btrfs_root *root, | |
485 | struct btrfs_block_rsv *rsv, int items, | |
486 | bool use_global_rsv) | |
487 | { | |
488 | u64 qgroup_num_bytes = 0; | |
489 | u64 num_bytes; | |
490 | int ret; | |
491 | struct btrfs_fs_info *fs_info = root->fs_info; | |
492 | struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv; | |
493 | ||
494 | if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) { | |
495 | /* One for parent inode, two for dir entries */ | |
496 | qgroup_num_bytes = 3 * fs_info->nodesize; | |
497 | ret = btrfs_qgroup_reserve_meta_prealloc(root, | |
498 | qgroup_num_bytes, true); | |
499 | if (ret) | |
500 | return ret; | |
501 | } | |
502 | ||
2bd36e7b | 503 | num_bytes = btrfs_calc_insert_metadata_size(fs_info, items); |
28a32d2b JB |
504 | rsv->space_info = btrfs_find_space_info(fs_info, |
505 | BTRFS_BLOCK_GROUP_METADATA); | |
506 | ret = btrfs_block_rsv_add(root, rsv, num_bytes, | |
507 | BTRFS_RESERVE_FLUSH_ALL); | |
508 | ||
509 | if (ret == -ENOSPC && use_global_rsv) | |
510 | ret = btrfs_block_rsv_migrate(global_rsv, rsv, num_bytes, true); | |
511 | ||
512 | if (ret && qgroup_num_bytes) | |
513 | btrfs_qgroup_free_meta_prealloc(root, qgroup_num_bytes); | |
514 | ||
515 | return ret; | |
516 | } | |
517 | ||
518 | void btrfs_subvolume_release_metadata(struct btrfs_fs_info *fs_info, | |
519 | struct btrfs_block_rsv *rsv) | |
520 | { | |
63f018be | 521 | btrfs_block_rsv_release(fs_info, rsv, (u64)-1, NULL); |
28a32d2b | 522 | } |