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