Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2013 Facebook. All rights reserved.
4 */
5
6#include <linux/types.h>
7#include "btrfs-tests.h"
8#include "../ctree.h"
9#include "../transaction.h"
10#include "../disk-io.h"
11#include "../qgroup.h"
12#include "../backref.h"
13
14static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr,
15 u64 num_bytes, u64 parent, u64 root_objectid)
16{
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;
23 struct btrfs_key ins;
24 u32 size = sizeof(*item) + sizeof(*iref) + sizeof(*block_info);
25 int ret;
26
27 btrfs_init_dummy_trans(&trans, NULL);
28
29 ins.objectid = bytenr;
30 ins.type = BTRFS_EXTENT_ITEM_KEY;
31 ins.offset = num_bytes;
32
33 path = btrfs_alloc_path();
34 if (!path) {
35 test_std_err(TEST_ALLOC_ROOT);
36 return -ENOMEM;
37 }
38
39 path->leave_spinning = 1;
40 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size);
41 if (ret) {
42 test_err("couldn't insert ref %d", ret);
43 btrfs_free_path(path);
44 return ret;
45 }
46
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);
55 if (parent > 0) {
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);
59 } else {
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);
62 }
63 btrfs_free_path(path);
64 return 0;
65}
66
67static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes,
68 u64 parent, u64 root_objectid)
69{
70 struct btrfs_trans_handle trans;
71 struct btrfs_extent_item *item;
72 struct btrfs_path *path;
73 struct btrfs_key key;
74 u64 refs;
75 int ret;
76
77 btrfs_init_dummy_trans(&trans, NULL);
78
79 key.objectid = bytenr;
80 key.type = BTRFS_EXTENT_ITEM_KEY;
81 key.offset = num_bytes;
82
83 path = btrfs_alloc_path();
84 if (!path) {
85 test_std_err(TEST_ALLOC_ROOT);
86 return -ENOMEM;
87 }
88
89 path->leave_spinning = 1;
90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
91 if (ret) {
92 test_err("couldn't find extent ref");
93 btrfs_free_path(path);
94 return ret;
95 }
96
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);
102
103 key.objectid = bytenr;
104 if (parent) {
105 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
106 key.offset = parent;
107 } else {
108 key.type = BTRFS_TREE_BLOCK_REF_KEY;
109 key.offset = root_objectid;
110 }
111
112 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0);
113 if (ret)
114 test_err("failed to insert backref");
115 btrfs_free_path(path);
116 return ret;
117}
118
119static int remove_extent_item(struct btrfs_root *root, u64 bytenr,
120 u64 num_bytes)
121{
122 struct btrfs_trans_handle trans;
123 struct btrfs_key key;
124 struct btrfs_path *path;
125 int ret;
126
127 btrfs_init_dummy_trans(&trans, NULL);
128
129 key.objectid = bytenr;
130 key.type = BTRFS_EXTENT_ITEM_KEY;
131 key.offset = num_bytes;
132
133 path = btrfs_alloc_path();
134 if (!path) {
135 test_std_err(TEST_ALLOC_ROOT);
136 return -ENOMEM;
137 }
138 path->leave_spinning = 1;
139
140 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
141 if (ret) {
142 test_err("didn't find our key %d", ret);
143 btrfs_free_path(path);
144 return ret;
145 }
146 btrfs_del_item(&trans, root, path);
147 btrfs_free_path(path);
148 return 0;
149}
150
151static int remove_extent_ref(struct btrfs_root *root, u64 bytenr,
152 u64 num_bytes, u64 parent, u64 root_objectid)
153{
154 struct btrfs_trans_handle trans;
155 struct btrfs_extent_item *item;
156 struct btrfs_path *path;
157 struct btrfs_key key;
158 u64 refs;
159 int ret;
160
161 btrfs_init_dummy_trans(&trans, NULL);
162
163 key.objectid = bytenr;
164 key.type = BTRFS_EXTENT_ITEM_KEY;
165 key.offset = num_bytes;
166
167 path = btrfs_alloc_path();
168 if (!path) {
169 test_std_err(TEST_ALLOC_ROOT);
170 return -ENOMEM;
171 }
172
173 path->leave_spinning = 1;
174 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
175 if (ret) {
176 test_err("couldn't find extent ref");
177 btrfs_free_path(path);
178 return ret;
179 }
180
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);
186
187 key.objectid = bytenr;
188 if (parent) {
189 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
190 key.offset = parent;
191 } else {
192 key.type = BTRFS_TREE_BLOCK_REF_KEY;
193 key.offset = root_objectid;
194 }
195
196 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
197 if (ret) {
198 test_err("couldn't find backref %d", ret);
199 btrfs_free_path(path);
200 return ret;
201 }
202 btrfs_del_item(&trans, root, path);
203 btrfs_free_path(path);
204 return ret;
205}
206
207static int test_no_shared_qgroup(struct btrfs_root *root,
208 u32 sectorsize, u32 nodesize)
209{
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;
214 int ret;
215
216 btrfs_init_dummy_trans(&trans, fs_info);
217
218 test_msg("running qgroup add/remove tests");
219 ret = btrfs_create_qgroup(&trans, BTRFS_FS_TREE_OBJECTID);
220 if (ret) {
221 test_err("couldn't create a qgroup %d", ret);
222 return ret;
223 }
224
225 /*
226 * Since the test trans doesn't have the complicated delayed refs,
227 * we can only call btrfs_qgroup_account_extent() directly to test
228 * quota.
229 */
230 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
231 false);
232 if (ret) {
233 ulist_free(old_roots);
234 test_err("couldn't find old roots: %d", ret);
235 return ret;
236 }
237
238 ret = insert_normal_tree_ref(root, nodesize, nodesize, 0,
239 BTRFS_FS_TREE_OBJECTID);
240 if (ret)
241 return ret;
242
243 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
244 false);
245 if (ret) {
246 ulist_free(old_roots);
247 ulist_free(new_roots);
248 test_err("couldn't find old roots: %d", ret);
249 return ret;
250 }
251
252 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
253 new_roots);
254 if (ret) {
255 test_err("couldn't account space for a qgroup %d", ret);
256 return ret;
257 }
258
259 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
260 nodesize, nodesize)) {
261 test_err("qgroup counts didn't match expected values");
262 return -EINVAL;
263 }
264 old_roots = NULL;
265 new_roots = NULL;
266
267 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
268 false);
269 if (ret) {
270 ulist_free(old_roots);
271 test_err("couldn't find old roots: %d", ret);
272 return ret;
273 }
274
275 ret = remove_extent_item(root, nodesize, nodesize);
276 if (ret)
277 return -EINVAL;
278
279 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
280 false);
281 if (ret) {
282 ulist_free(old_roots);
283 ulist_free(new_roots);
284 test_err("couldn't find old roots: %d", ret);
285 return ret;
286 }
287
288 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
289 new_roots);
290 if (ret) {
291 test_err("couldn't account space for a qgroup %d", ret);
292 return -EINVAL;
293 }
294
295 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID, 0, 0)) {
296 test_err("qgroup counts didn't match expected values");
297 return -EINVAL;
298 }
299
300 return 0;
301}
302
303/*
304 * Add a ref for two different roots to make sure the shared value comes out
305 * right, also remove one of the roots and make sure the exclusive count is
306 * adjusted properly.
307 */
308static int test_multiple_refs(struct btrfs_root *root,
309 u32 sectorsize, u32 nodesize)
310{
311 struct btrfs_trans_handle trans;
312 struct btrfs_fs_info *fs_info = root->fs_info;
313 struct ulist *old_roots = NULL;
314 struct ulist *new_roots = NULL;
315 int ret;
316
317 btrfs_init_dummy_trans(&trans, fs_info);
318
319 test_msg("running qgroup multiple refs test");
320
321 /*
322 * We have BTRFS_FS_TREE_OBJECTID created already from the
323 * previous test.
324 */
325 ret = btrfs_create_qgroup(&trans, BTRFS_FIRST_FREE_OBJECTID);
326 if (ret) {
327 test_err("couldn't create a qgroup %d", ret);
328 return ret;
329 }
330
331 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
332 false);
333 if (ret) {
334 ulist_free(old_roots);
335 test_err("couldn't find old roots: %d", ret);
336 return ret;
337 }
338
339 ret = insert_normal_tree_ref(root, nodesize, nodesize, 0,
340 BTRFS_FS_TREE_OBJECTID);
341 if (ret)
342 return ret;
343
344 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
345 false);
346 if (ret) {
347 ulist_free(old_roots);
348 ulist_free(new_roots);
349 test_err("couldn't find old roots: %d", ret);
350 return ret;
351 }
352
353 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
354 new_roots);
355 if (ret) {
356 test_err("couldn't account space for a qgroup %d", ret);
357 return ret;
358 }
359
360 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
361 nodesize, nodesize)) {
362 test_err("qgroup counts didn't match expected values");
363 return -EINVAL;
364 }
365
366 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
367 false);
368 if (ret) {
369 ulist_free(old_roots);
370 test_err("couldn't find old roots: %d", ret);
371 return ret;
372 }
373
374 ret = add_tree_ref(root, nodesize, nodesize, 0,
375 BTRFS_FIRST_FREE_OBJECTID);
376 if (ret)
377 return ret;
378
379 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
380 false);
381 if (ret) {
382 ulist_free(old_roots);
383 ulist_free(new_roots);
384 test_err("couldn't find old roots: %d", ret);
385 return ret;
386 }
387
388 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
389 new_roots);
390 if (ret) {
391 test_err("couldn't account space for a qgroup %d", ret);
392 return ret;
393 }
394
395 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
396 nodesize, 0)) {
397 test_err("qgroup counts didn't match expected values");
398 return -EINVAL;
399 }
400
401 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FIRST_FREE_OBJECTID,
402 nodesize, 0)) {
403 test_err("qgroup counts didn't match expected values");
404 return -EINVAL;
405 }
406
407 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots,
408 false);
409 if (ret) {
410 ulist_free(old_roots);
411 test_err("couldn't find old roots: %d", ret);
412 return ret;
413 }
414
415 ret = remove_extent_ref(root, nodesize, nodesize, 0,
416 BTRFS_FIRST_FREE_OBJECTID);
417 if (ret)
418 return ret;
419
420 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots,
421 false);
422 if (ret) {
423 ulist_free(old_roots);
424 ulist_free(new_roots);
425 test_err("couldn't find old roots: %d", ret);
426 return ret;
427 }
428
429 ret = btrfs_qgroup_account_extent(&trans, nodesize, nodesize, old_roots,
430 new_roots);
431 if (ret) {
432 test_err("couldn't account space for a qgroup %d", ret);
433 return ret;
434 }
435
436 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FIRST_FREE_OBJECTID,
437 0, 0)) {
438 test_err("qgroup counts didn't match expected values");
439 return -EINVAL;
440 }
441
442 if (btrfs_verify_qgroup_counts(fs_info, BTRFS_FS_TREE_OBJECTID,
443 nodesize, nodesize)) {
444 test_err("qgroup counts didn't match expected values");
445 return -EINVAL;
446 }
447
448 return 0;
449}
450
451int btrfs_test_qgroups(u32 sectorsize, u32 nodesize)
452{
453 struct btrfs_fs_info *fs_info = NULL;
454 struct btrfs_root *root;
455 struct btrfs_root *tmp_root;
456 int ret = 0;
457
458 fs_info = btrfs_alloc_dummy_fs_info(nodesize, sectorsize);
459 if (!fs_info) {
460 test_std_err(TEST_ALLOC_FS_INFO);
461 return -ENOMEM;
462 }
463
464 root = btrfs_alloc_dummy_root(fs_info);
465 if (IS_ERR(root)) {
466 test_std_err(TEST_ALLOC_ROOT);
467 ret = PTR_ERR(root);
468 goto out;
469 }
470
471 /* We are using this root as our extent root */
472 root->fs_info->extent_root = root;
473
474 /*
475 * Some of the paths we test assume we have a filled out fs_info, so we
476 * just need to add the root in there so we don't panic.
477 */
478 root->fs_info->tree_root = root;
479 root->fs_info->quota_root = root;
480 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
481
482 /*
483 * Can't use bytenr 0, some things freak out
484 * *cough*backref walking code*cough*
485 */
486 root->node = alloc_test_extent_buffer(root->fs_info, nodesize);
487 if (!root->node) {
488 test_err("couldn't allocate dummy buffer");
489 ret = -ENOMEM;
490 goto out;
491 }
492 btrfs_set_header_level(root->node, 0);
493 btrfs_set_header_nritems(root->node, 0);
494 root->alloc_bytenr += 2 * nodesize;
495
496 tmp_root = btrfs_alloc_dummy_root(fs_info);
497 if (IS_ERR(tmp_root)) {
498 test_std_err(TEST_ALLOC_ROOT);
499 ret = PTR_ERR(tmp_root);
500 goto out;
501 }
502
503 tmp_root->root_key.objectid = BTRFS_FS_TREE_OBJECTID;
504 root->fs_info->fs_root = tmp_root;
505 ret = btrfs_insert_fs_root(root->fs_info, tmp_root);
506 if (ret) {
507 test_err("couldn't insert fs root %d", ret);
508 goto out;
509 }
510
511 tmp_root = btrfs_alloc_dummy_root(fs_info);
512 if (IS_ERR(tmp_root)) {
513 test_std_err(TEST_ALLOC_ROOT);
514 ret = PTR_ERR(tmp_root);
515 goto out;
516 }
517
518 tmp_root->root_key.objectid = BTRFS_FIRST_FREE_OBJECTID;
519 ret = btrfs_insert_fs_root(root->fs_info, tmp_root);
520 if (ret) {
521 test_err("couldn't insert fs root %d", ret);
522 goto out;
523 }
524
525 test_msg("running qgroup tests");
526 ret = test_no_shared_qgroup(root, sectorsize, nodesize);
527 if (ret)
528 goto out;
529 ret = test_multiple_refs(root, sectorsize, nodesize);
530out:
531 btrfs_free_dummy_root(root);
532 btrfs_free_dummy_fs_info(fs_info);
533 return ret;
534}
1/*
2 * Copyright (C) 2013 Facebook. 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 "btrfs-tests.h"
20#include "../ctree.h"
21#include "../transaction.h"
22#include "../disk-io.h"
23#include "../qgroup.h"
24#include "../backref.h"
25
26static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr,
27 u64 num_bytes, u64 parent, u64 root_objectid)
28{
29 struct btrfs_trans_handle trans;
30 struct btrfs_extent_item *item;
31 struct btrfs_extent_inline_ref *iref;
32 struct btrfs_tree_block_info *block_info;
33 struct btrfs_path *path;
34 struct extent_buffer *leaf;
35 struct btrfs_key ins;
36 u32 size = sizeof(*item) + sizeof(*iref) + sizeof(*block_info);
37 int ret;
38
39 btrfs_init_dummy_trans(&trans);
40
41 ins.objectid = bytenr;
42 ins.type = BTRFS_EXTENT_ITEM_KEY;
43 ins.offset = num_bytes;
44
45 path = btrfs_alloc_path();
46 if (!path) {
47 test_msg("Couldn't allocate path\n");
48 return -ENOMEM;
49 }
50
51 path->leave_spinning = 1;
52 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size);
53 if (ret) {
54 test_msg("Couldn't insert ref %d\n", ret);
55 btrfs_free_path(path);
56 return ret;
57 }
58
59 leaf = path->nodes[0];
60 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
61 btrfs_set_extent_refs(leaf, item, 1);
62 btrfs_set_extent_generation(leaf, item, 1);
63 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_TREE_BLOCK);
64 block_info = (struct btrfs_tree_block_info *)(item + 1);
65 btrfs_set_tree_block_level(leaf, block_info, 1);
66 iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
67 if (parent > 0) {
68 btrfs_set_extent_inline_ref_type(leaf, iref,
69 BTRFS_SHARED_BLOCK_REF_KEY);
70 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
71 } else {
72 btrfs_set_extent_inline_ref_type(leaf, iref, BTRFS_TREE_BLOCK_REF_KEY);
73 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
74 }
75 btrfs_free_path(path);
76 return 0;
77}
78
79static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes,
80 u64 parent, u64 root_objectid)
81{
82 struct btrfs_trans_handle trans;
83 struct btrfs_extent_item *item;
84 struct btrfs_path *path;
85 struct btrfs_key key;
86 u64 refs;
87 int ret;
88
89 btrfs_init_dummy_trans(&trans);
90
91 key.objectid = bytenr;
92 key.type = BTRFS_EXTENT_ITEM_KEY;
93 key.offset = num_bytes;
94
95 path = btrfs_alloc_path();
96 if (!path) {
97 test_msg("Couldn't allocate path\n");
98 return -ENOMEM;
99 }
100
101 path->leave_spinning = 1;
102 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
103 if (ret) {
104 test_msg("Couldn't find extent ref\n");
105 btrfs_free_path(path);
106 return ret;
107 }
108
109 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
110 struct btrfs_extent_item);
111 refs = btrfs_extent_refs(path->nodes[0], item);
112 btrfs_set_extent_refs(path->nodes[0], item, refs + 1);
113 btrfs_release_path(path);
114
115 key.objectid = bytenr;
116 if (parent) {
117 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
118 key.offset = parent;
119 } else {
120 key.type = BTRFS_TREE_BLOCK_REF_KEY;
121 key.offset = root_objectid;
122 }
123
124 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0);
125 if (ret)
126 test_msg("Failed to insert backref\n");
127 btrfs_free_path(path);
128 return ret;
129}
130
131static int remove_extent_item(struct btrfs_root *root, u64 bytenr,
132 u64 num_bytes)
133{
134 struct btrfs_trans_handle trans;
135 struct btrfs_key key;
136 struct btrfs_path *path;
137 int ret;
138
139 btrfs_init_dummy_trans(&trans);
140
141 key.objectid = bytenr;
142 key.type = BTRFS_EXTENT_ITEM_KEY;
143 key.offset = num_bytes;
144
145 path = btrfs_alloc_path();
146 if (!path) {
147 test_msg("Couldn't allocate path\n");
148 return -ENOMEM;
149 }
150 path->leave_spinning = 1;
151
152 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
153 if (ret) {
154 test_msg("Didn't find our key %d\n", ret);
155 btrfs_free_path(path);
156 return ret;
157 }
158 btrfs_del_item(&trans, root, path);
159 btrfs_free_path(path);
160 return 0;
161}
162
163static int remove_extent_ref(struct btrfs_root *root, u64 bytenr,
164 u64 num_bytes, u64 parent, u64 root_objectid)
165{
166 struct btrfs_trans_handle trans;
167 struct btrfs_extent_item *item;
168 struct btrfs_path *path;
169 struct btrfs_key key;
170 u64 refs;
171 int ret;
172
173 btrfs_init_dummy_trans(&trans);
174
175 key.objectid = bytenr;
176 key.type = BTRFS_EXTENT_ITEM_KEY;
177 key.offset = num_bytes;
178
179 path = btrfs_alloc_path();
180 if (!path) {
181 test_msg("Couldn't allocate path\n");
182 return -ENOMEM;
183 }
184
185 path->leave_spinning = 1;
186 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1);
187 if (ret) {
188 test_msg("Couldn't find extent ref\n");
189 btrfs_free_path(path);
190 return ret;
191 }
192
193 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
194 struct btrfs_extent_item);
195 refs = btrfs_extent_refs(path->nodes[0], item);
196 btrfs_set_extent_refs(path->nodes[0], item, refs - 1);
197 btrfs_release_path(path);
198
199 key.objectid = bytenr;
200 if (parent) {
201 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
202 key.offset = parent;
203 } else {
204 key.type = BTRFS_TREE_BLOCK_REF_KEY;
205 key.offset = root_objectid;
206 }
207
208 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1);
209 if (ret) {
210 test_msg("Couldn't find backref %d\n", ret);
211 btrfs_free_path(path);
212 return ret;
213 }
214 btrfs_del_item(&trans, root, path);
215 btrfs_free_path(path);
216 return ret;
217}
218
219static int test_no_shared_qgroup(struct btrfs_root *root)
220{
221 struct btrfs_trans_handle trans;
222 struct btrfs_fs_info *fs_info = root->fs_info;
223 struct ulist *old_roots = NULL;
224 struct ulist *new_roots = NULL;
225 int ret;
226
227 btrfs_init_dummy_trans(&trans);
228
229 test_msg("Qgroup basic add\n");
230 ret = btrfs_create_qgroup(NULL, fs_info, 5);
231 if (ret) {
232 test_msg("Couldn't create a qgroup %d\n", ret);
233 return ret;
234 }
235
236 /*
237 * Since the test trans doesn't havee the complicated delayed refs,
238 * we can only call btrfs_qgroup_account_extent() directly to test
239 * quota.
240 */
241 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &old_roots);
242 if (ret) {
243 ulist_free(old_roots);
244 test_msg("Couldn't find old roots: %d\n", ret);
245 return ret;
246 }
247
248 ret = insert_normal_tree_ref(root, 4096, 4096, 0, 5);
249 if (ret)
250 return ret;
251
252 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &new_roots);
253 if (ret) {
254 ulist_free(old_roots);
255 ulist_free(new_roots);
256 test_msg("Couldn't find old roots: %d\n", ret);
257 return ret;
258 }
259
260 ret = btrfs_qgroup_account_extent(&trans, fs_info, 4096, 4096,
261 old_roots, new_roots);
262 if (ret) {
263 test_msg("Couldn't account space for a qgroup %d\n", ret);
264 return ret;
265 }
266
267 if (btrfs_verify_qgroup_counts(fs_info, 5, 4096, 4096)) {
268 test_msg("Qgroup counts didn't match expected values\n");
269 return -EINVAL;
270 }
271 old_roots = NULL;
272 new_roots = NULL;
273
274 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &old_roots);
275 if (ret) {
276 ulist_free(old_roots);
277 test_msg("Couldn't find old roots: %d\n", ret);
278 return ret;
279 }
280
281 ret = remove_extent_item(root, 4096, 4096);
282 if (ret)
283 return -EINVAL;
284
285 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &new_roots);
286 if (ret) {
287 ulist_free(old_roots);
288 ulist_free(new_roots);
289 test_msg("Couldn't find old roots: %d\n", ret);
290 return ret;
291 }
292
293 ret = btrfs_qgroup_account_extent(&trans, fs_info, 4096, 4096,
294 old_roots, new_roots);
295 if (ret) {
296 test_msg("Couldn't account space for a qgroup %d\n", ret);
297 return -EINVAL;
298 }
299
300 if (btrfs_verify_qgroup_counts(fs_info, 5, 0, 0)) {
301 test_msg("Qgroup counts didn't match expected values\n");
302 return -EINVAL;
303 }
304
305 return 0;
306}
307
308/*
309 * Add a ref for two different roots to make sure the shared value comes out
310 * right, also remove one of the roots and make sure the exclusive count is
311 * adjusted properly.
312 */
313static int test_multiple_refs(struct btrfs_root *root)
314{
315 struct btrfs_trans_handle trans;
316 struct btrfs_fs_info *fs_info = root->fs_info;
317 struct ulist *old_roots = NULL;
318 struct ulist *new_roots = NULL;
319 int ret;
320
321 btrfs_init_dummy_trans(&trans);
322
323 test_msg("Qgroup multiple refs test\n");
324
325 /* We have 5 created already from the previous test */
326 ret = btrfs_create_qgroup(NULL, fs_info, 256);
327 if (ret) {
328 test_msg("Couldn't create a qgroup %d\n", ret);
329 return ret;
330 }
331
332 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &old_roots);
333 if (ret) {
334 ulist_free(old_roots);
335 test_msg("Couldn't find old roots: %d\n", ret);
336 return ret;
337 }
338
339 ret = insert_normal_tree_ref(root, 4096, 4096, 0, 5);
340 if (ret)
341 return ret;
342
343 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &new_roots);
344 if (ret) {
345 ulist_free(old_roots);
346 ulist_free(new_roots);
347 test_msg("Couldn't find old roots: %d\n", ret);
348 return ret;
349 }
350
351 ret = btrfs_qgroup_account_extent(&trans, fs_info, 4096, 4096,
352 old_roots, new_roots);
353 if (ret) {
354 test_msg("Couldn't account space for a qgroup %d\n", ret);
355 return ret;
356 }
357
358 if (btrfs_verify_qgroup_counts(fs_info, 5, 4096, 4096)) {
359 test_msg("Qgroup counts didn't match expected values\n");
360 return -EINVAL;
361 }
362
363 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &old_roots);
364 if (ret) {
365 ulist_free(old_roots);
366 test_msg("Couldn't find old roots: %d\n", ret);
367 return ret;
368 }
369
370 ret = add_tree_ref(root, 4096, 4096, 0, 256);
371 if (ret)
372 return ret;
373
374 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &new_roots);
375 if (ret) {
376 ulist_free(old_roots);
377 ulist_free(new_roots);
378 test_msg("Couldn't find old roots: %d\n", ret);
379 return ret;
380 }
381
382 ret = btrfs_qgroup_account_extent(&trans, fs_info, 4096, 4096,
383 old_roots, new_roots);
384 if (ret) {
385 test_msg("Couldn't account space for a qgroup %d\n", ret);
386 return ret;
387 }
388
389 if (btrfs_verify_qgroup_counts(fs_info, 5, 4096, 0)) {
390 test_msg("Qgroup counts didn't match expected values\n");
391 return -EINVAL;
392 }
393
394 if (btrfs_verify_qgroup_counts(fs_info, 256, 4096, 0)) {
395 test_msg("Qgroup counts didn't match expected values\n");
396 return -EINVAL;
397 }
398
399 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &old_roots);
400 if (ret) {
401 ulist_free(old_roots);
402 test_msg("Couldn't find old roots: %d\n", ret);
403 return ret;
404 }
405
406 ret = remove_extent_ref(root, 4096, 4096, 0, 256);
407 if (ret)
408 return ret;
409
410 ret = btrfs_find_all_roots(&trans, fs_info, 4096, 0, &new_roots);
411 if (ret) {
412 ulist_free(old_roots);
413 ulist_free(new_roots);
414 test_msg("Couldn't find old roots: %d\n", ret);
415 return ret;
416 }
417
418 ret = btrfs_qgroup_account_extent(&trans, fs_info, 4096, 4096,
419 old_roots, new_roots);
420 if (ret) {
421 test_msg("Couldn't account space for a qgroup %d\n", ret);
422 return ret;
423 }
424
425 if (btrfs_verify_qgroup_counts(fs_info, 256, 0, 0)) {
426 test_msg("Qgroup counts didn't match expected values\n");
427 return -EINVAL;
428 }
429
430 if (btrfs_verify_qgroup_counts(fs_info, 5, 4096, 4096)) {
431 test_msg("Qgroup counts didn't match expected values\n");
432 return -EINVAL;
433 }
434
435 return 0;
436}
437
438int btrfs_test_qgroups(void)
439{
440 struct btrfs_root *root;
441 struct btrfs_root *tmp_root;
442 int ret = 0;
443
444 root = btrfs_alloc_dummy_root();
445 if (IS_ERR(root)) {
446 test_msg("Couldn't allocate root\n");
447 return PTR_ERR(root);
448 }
449
450 root->fs_info = btrfs_alloc_dummy_fs_info();
451 if (!root->fs_info) {
452 test_msg("Couldn't allocate dummy fs info\n");
453 ret = -ENOMEM;
454 goto out;
455 }
456 /* We are using this root as our extent root */
457 root->fs_info->extent_root = root;
458
459 /*
460 * Some of the paths we test assume we have a filled out fs_info, so we
461 * just need to add the root in there so we don't panic.
462 */
463 root->fs_info->tree_root = root;
464 root->fs_info->quota_root = root;
465 root->fs_info->quota_enabled = 1;
466
467 /*
468 * Can't use bytenr 0, some things freak out
469 * *cough*backref walking code*cough*
470 */
471 root->node = alloc_test_extent_buffer(root->fs_info, 4096);
472 if (!root->node) {
473 test_msg("Couldn't allocate dummy buffer\n");
474 ret = -ENOMEM;
475 goto out;
476 }
477 btrfs_set_header_level(root->node, 0);
478 btrfs_set_header_nritems(root->node, 0);
479 root->alloc_bytenr += 8192;
480
481 tmp_root = btrfs_alloc_dummy_root();
482 if (IS_ERR(tmp_root)) {
483 test_msg("Couldn't allocate a fs root\n");
484 ret = PTR_ERR(tmp_root);
485 goto out;
486 }
487
488 tmp_root->root_key.objectid = 5;
489 root->fs_info->fs_root = tmp_root;
490 ret = btrfs_insert_fs_root(root->fs_info, tmp_root);
491 if (ret) {
492 test_msg("Couldn't insert fs root %d\n", ret);
493 goto out;
494 }
495
496 tmp_root = btrfs_alloc_dummy_root();
497 if (IS_ERR(tmp_root)) {
498 test_msg("Couldn't allocate a fs root\n");
499 ret = PTR_ERR(tmp_root);
500 goto out;
501 }
502
503 tmp_root->root_key.objectid = 256;
504 ret = btrfs_insert_fs_root(root->fs_info, tmp_root);
505 if (ret) {
506 test_msg("Couldn't insert fs root %d\n", ret);
507 goto out;
508 }
509
510 test_msg("Running qgroup tests\n");
511 ret = test_no_shared_qgroup(root);
512 if (ret)
513 goto out;
514 ret = test_multiple_refs(root);
515out:
516 btrfs_free_dummy_root(root);
517 return ret;
518}