1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2013 Facebook. All rights reserved.
6 #include <linux/types.h>
7 #include "btrfs-tests.h"
9 #include "../transaction.h"
10 #include "../disk-io.h"
11 #include "../qgroup.h"
12 #include "../backref.h"
14 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr,
15 u64 num_bytes, u64 parent, u64 root_objectid)
17 struct btrfs_trans_handle trans;
18 struct btrfs_extent_item *item;
19 struct btrfs_extent_inline_ref *iref;
20 struct btrfs_tree_block_info *block_info;
21 struct btrfs_path *path;
22 struct extent_buffer *leaf;
24 u32 size = sizeof(*item) + sizeof(*iref) + sizeof(*block_info);
27 btrfs_init_dummy_trans(&trans, NULL);
29 ins.objectid = bytenr;
30 ins.type = BTRFS_EXTENT_ITEM_KEY;
31 ins.offset = num_bytes;
33 path = btrfs_alloc_path();
35 test_std_err(TEST_ALLOC_ROOT);
39 path->leave_spinning = 1;
40 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size);
42 test_err("couldn't insert ref %d", ret);
43 btrfs_free_path(path);
47 leaf = path->nodes[0];
48 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
49 btrfs_set_extent_refs(leaf, item, 1);
50 btrfs_set_extent_generation(leaf, item, 1);
51 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_TREE_BLOCK);
52 block_info = (struct btrfs_tree_block_info *)(item + 1);
53 btrfs_set_tree_block_level(leaf, block_info, 0);
54 iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
56 btrfs_set_extent_inline_ref_type(leaf, iref,
57 BTRFS_SHARED_BLOCK_REF_KEY);
58 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
60 btrfs_set_extent_inline_ref_type(leaf, iref, BTRFS_TREE_BLOCK_REF_KEY);
61 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
63 btrfs_free_path(path);
67 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes,
68 u64 parent, u64 root_objectid)
70 struct btrfs_trans_handle trans;
71 struct btrfs_extent_item *item;
72 struct btrfs_path *path;
77 btrfs_init_dummy_trans(&trans, NULL);
79 key.objectid = bytenr;
80 key.type = BTRFS_EXTENT_ITEM_KEY;
81 key.offset = num_bytes;
83 path = btrfs_alloc_path();
85 test_std_err(TEST_ALLOC_ROOT);
89 path->leave_spinning = 1;
90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
92 test_err("couldn't find extent ref");
93 btrfs_free_path(path);
97 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
98 struct btrfs_extent_item);
99 refs = btrfs_extent_refs(path->nodes[0], item);
100 btrfs_set_extent_refs(path->nodes[0], item, refs + 1);
101 btrfs_release_path(path);
103 key.objectid = bytenr;
105 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
108 key.type = BTRFS_TREE_BLOCK_REF_KEY;
109 key.offset = root_objectid;
112 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0);
114 test_err("failed to insert backref");
115 btrfs_free_path(path);
119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr,
122 struct btrfs_trans_handle trans;
123 struct btrfs_key key;
124 struct btrfs_path *path;
127 btrfs_init_dummy_trans(&trans, NULL);
129 key.objectid = bytenr;
130 key.type = BTRFS_EXTENT_ITEM_KEY;
131 key.offset = num_bytes;
133 path = btrfs_alloc_path();
135 test_std_err(TEST_ALLOC_ROOT);
138 path->leave_spinning = 1;
140 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
142 test_err("didn't find our key %d", ret);
143 btrfs_free_path(path);
146 btrfs_del_item(&trans, root, path);
147 btrfs_free_path(path);
151 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr,
152 u64 num_bytes, u64 parent, u64 root_objectid)
154 struct btrfs_trans_handle trans;
155 struct btrfs_extent_item *item;
156 struct btrfs_path *path;
157 struct btrfs_key key;
161 btrfs_init_dummy_trans(&trans, NULL);
163 key.objectid = bytenr;
164 key.type = BTRFS_EXTENT_ITEM_KEY;
165 key.offset = num_bytes;
167 path = btrfs_alloc_path();
169 test_std_err(TEST_ALLOC_ROOT);
173 path->leave_spinning = 1;
174 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
176 test_err("couldn't find extent ref");
177 btrfs_free_path(path);
181 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
182 struct btrfs_extent_item);
183 refs = btrfs_extent_refs(path->nodes[0], item);
184 btrfs_set_extent_refs(path->nodes[0], item, refs - 1);
185 btrfs_release_path(path);
187 key.objectid = bytenr;
189 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
192 key.type = BTRFS_TREE_BLOCK_REF_KEY;
193 key.offset = root_objectid;
196 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
198 test_err("couldn't find backref %d", ret);
199 btrfs_free_path(path);
202 btrfs_del_item(&trans, root, path);
203 btrfs_free_path(path);
207 static int test_no_shared_qgroup(struct btrfs_root *root,
208 u32 sectorsize, u32 nodesize)
210 struct btrfs_trans_handle trans;
211 struct btrfs_fs_info *fs_info = root->fs_info;
212 struct ulist *old_roots = NULL;
213 struct ulist *new_roots = NULL;
216 btrfs_init_dummy_trans(&trans, fs_info);
218 test_msg("running qgroup add/remove tests");
219 ret = btrfs_create_qgroup(&trans, BTRFS_FS_TREE_OBJECTID);
221 test_err("couldn't create a qgroup %d", ret);
226 * Since the test trans doesn't have the complicated delayed refs,
227 * we can only call btrfs_qgroup_account_extent() directly to test
230 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
233 test_err("couldn't find old roots: %d", ret);
237 ret = insert_normal_tree_ref(root, nodesize, nodesize, 0,
238 BTRFS_FS_TREE_OBJECTID);
240 ulist_free(old_roots);
244 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
247 ulist_free(old_roots);
248 test_err("couldn't find old roots: %d", ret);
252 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
255 test_err("couldn't account space for a qgroup %d", ret);
259 /* btrfs_qgroup_account_extent() always frees the ulists passed to it. */
263 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
264 nodesize, nodesize)) {
265 test_err("qgroup counts didn't match expected values");
269 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
272 test_err("couldn't find old roots: %d", ret);
276 ret = remove_extent_item(root, nodesize, nodesize);
278 ulist_free(old_roots);
282 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
285 ulist_free(old_roots);
286 test_err("couldn't find old roots: %d", ret);
290 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
293 test_err("couldn't account space for a qgroup %d", ret);
297 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID, 0, 0)) {
298 test_err("qgroup counts didn't match expected values");
306 * Add a ref for two different roots to make sure the shared value comes out
307 * right, also remove one of the roots and make sure the exclusive count is
310 static int test_multiple_refs(struct btrfs_root *root,
311 u32 sectorsize, u32 nodesize)
313 struct btrfs_trans_handle trans;
314 struct btrfs_fs_info *fs_info = root->fs_info;
315 struct ulist *old_roots = NULL;
316 struct ulist *new_roots = NULL;
319 btrfs_init_dummy_trans(&trans, fs_info);
321 test_msg("running qgroup multiple refs test");
324 * We have BTRFS_FS_TREE_OBJECTID created already from the
327 ret = btrfs_create_qgroup(&trans, BTRFS_FIRST_FREE_OBJECTID);
329 test_err("couldn't create a qgroup %d", ret);
333 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
336 test_err("couldn't find old roots: %d", ret);
340 ret = insert_normal_tree_ref(root, nodesize, nodesize, 0,
341 BTRFS_FS_TREE_OBJECTID);
343 ulist_free(old_roots);
347 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
350 ulist_free(old_roots);
351 test_err("couldn't find old roots: %d", ret);
355 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
358 test_err("couldn't account space for a qgroup %d", ret);
362 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
363 nodesize, nodesize)) {
364 test_err("qgroup counts didn't match expected values");
368 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
371 test_err("couldn't find old roots: %d", ret);
375 ret = add_tree_ref(root, nodesize, nodesize, 0,
376 BTRFS_FIRST_FREE_OBJECTID);
378 ulist_free(old_roots);
382 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
385 ulist_free(old_roots);
386 test_err("couldn't find old roots: %d", ret);
390 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
393 test_err("couldn't account space for a qgroup %d", ret);
397 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
399 test_err("qgroup counts didn't match expected values");
403 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FIRST_FREE_OBJECTID,
405 test_err("qgroup counts didn't match expected values");
409 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
412 test_err("couldn't find old roots: %d", ret);
416 ret = remove_extent_ref(root, nodesize, nodesize, 0,
417 BTRFS_FIRST_FREE_OBJECTID);
419 ulist_free(old_roots);
423 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
426 ulist_free(old_roots);
427 test_err("couldn't find old roots: %d", ret);
431 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
434 test_err("couldn't account space for a qgroup %d", ret);
438 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FIRST_FREE_OBJECTID,
440 test_err("qgroup counts didn't match expected values");
444 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
445 nodesize, nodesize)) {
446 test_err("qgroup counts didn't match expected values");
453 int btrfs_test_qgroups(u32 sectorsize, u32 nodesize)
455 struct btrfs_fs_info *fs_info = NULL;
456 struct btrfs_root *root;
457 struct btrfs_root *tmp_root;
460 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
462 test_std_err(TEST_ALLOC_FS_INFO);
466 root = btrfs_alloc_dummy_root(fs_info);
468 test_std_err(TEST_ALLOC_ROOT);
473 /* We are using this root as our extent root */
474 root->fs_info->extent_root = root;
477 * Some of the paths we test assume we have a filled out fs_info, so we
478 * just need to add the root in there so we don't panic.
480 root->fs_info->tree_root = root;
481 root->fs_info->quota_root = root;
482 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
485 * Can't use bytenr 0, some things freak out
486 * *cough*backref walking code*cough*
488 root->node = alloc_test_extent_buffer(root->fs_info, nodesize);
489 if (IS_ERR(root->node)) {
490 test_err("couldn't allocate dummy buffer");
491 ret = PTR_ERR(root->node);
494 btrfs_set_header_level(root->node, 0);
495 btrfs_set_header_nritems(root->node, 0);
496 root->alloc_bytenr += 2 * nodesize;
498 tmp_root = btrfs_alloc_dummy_root(fs_info);
499 if (IS_ERR(tmp_root)) {
500 test_std_err(TEST_ALLOC_ROOT);
501 ret = PTR_ERR(tmp_root);
505 tmp_root->root_key.objectid = BTRFS_FS_TREE_OBJECTID;
506 root->fs_info->fs_root = tmp_root;
507 ret = btrfs_insert_fs_root(root->fs_info, tmp_root);
509 test_err("couldn't insert fs root %d", ret);
512 btrfs_put_root(tmp_root);
514 tmp_root = btrfs_alloc_dummy_root(fs_info);
515 if (IS_ERR(tmp_root)) {
516 test_std_err(TEST_ALLOC_ROOT);
517 ret = PTR_ERR(tmp_root);
521 tmp_root->root_key.objectid = BTRFS_FIRST_FREE_OBJECTID;
522 ret = btrfs_insert_fs_root(root->fs_info, tmp_root);
524 test_err("couldn't insert fs root %d", ret);
527 btrfs_put_root(tmp_root);
529 test_msg("running qgroup tests");
530 ret = test_no_shared_qgroup(root, sectorsize, nodesize);
533 ret = test_multiple_refs(root, sectorsize, nodesize);
535 btrfs_free_dummy_root(root);
536 btrfs_free_dummy_fs_info(fs_info);