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 14 static 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 66 static 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 117 static 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 148 static 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 203 static 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 * Since the test trans doesn't have the complicated delayed refs, 223 * we can only call btrfs_qgroup_account_extent() directly to test 224 * quota. 225 */ 226 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &old_roots, false); 227 if (ret) { 228 ulist_free(old_roots); 229 test_err("couldn't find old roots: %d", ret); 230 return ret; 231 } 232 233 ret = insert_normal_tree_ref(root, nodesize, nodesize, 0, 234 BTRFS_FS_TREE_OBJECTID); 235 if (ret) { 236 ulist_free(old_roots); 237 return ret; 238 } 239 240 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots, 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, false); 264 if (ret) { 265 ulist_free(old_roots); 266 test_err("couldn't find old roots: %d", ret); 267 return ret; 268 } 269 270 ret = remove_extent_item(root, nodesize, nodesize); 271 if (ret) { 272 ulist_free(old_roots); 273 return -EINVAL; 274 } 275 276 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots, 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 * Add a ref for two different roots to make sure the shared value comes out 301 * right, also remove one of the roots and make sure the exclusive count is 302 * adjusted properly. 303 */ 304 static 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 * We have BTRFS_FS_TREE_OBJECTID created already from the 319 * previous test. 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, false); 328 if (ret) { 329 ulist_free(old_roots); 330 test_err("couldn't find old roots: %d", ret); 331 return ret; 332 } 333 334 ret = insert_normal_tree_ref(root, nodesize, nodesize, 0, 335 BTRFS_FS_TREE_OBJECTID); 336 if (ret) { 337 ulist_free(old_roots); 338 return ret; 339 } 340 341 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots, 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, false); 363 if (ret) { 364 ulist_free(old_roots); 365 test_err("couldn't find old roots: %d", ret); 366 return ret; 367 } 368 369 ret = add_tree_ref(root, nodesize, nodesize, 0, 370 BTRFS_FIRST_FREE_OBJECTID); 371 if (ret) { 372 ulist_free(old_roots); 373 return ret; 374 } 375 376 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots, 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, false); 404 if (ret) { 405 ulist_free(old_roots); 406 test_err("couldn't find old roots: %d", ret); 407 return ret; 408 } 409 410 ret = remove_extent_ref(root, nodesize, nodesize, 0, 411 BTRFS_FIRST_FREE_OBJECTID); 412 if (ret) { 413 ulist_free(old_roots); 414 return ret; 415 } 416 417 ret = btrfs_find_all_roots(&trans, fs_info, nodesize, 0, &new_roots, 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 447 int 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 /* We are using this root as our extent root */ 468 root->root_key.objectid = BTRFS_EXTENT_TREE_OBJECTID; 469 root->root_key.type = BTRFS_ROOT_ITEM_KEY; 470 root->root_key.offset = 0; 471 btrfs_global_root_insert(root); 472 473 /* 474 * Some of the paths we test assume we have a filled out fs_info, so we 475 * just need to add the root in there so we don't panic. 476 */ 477 root->fs_info->tree_root = root; 478 root->fs_info->quota_root = root; 479 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags); 480 481 /* 482 * Can't use bytenr 0, some things freak out 483 * *cough*backref walking code*cough* 484 */ 485 root->node = alloc_test_extent_buffer(root->fs_info, nodesize); 486 if (IS_ERR(root->node)) { 487 test_err("couldn't allocate dummy buffer"); 488 ret = PTR_ERR(root->node); 489 goto out; 490 } 491 btrfs_set_header_level(root->node, 0); 492 btrfs_set_header_nritems(root->node, 0); 493 root->alloc_bytenr += 2 * nodesize; 494 495 tmp_root = btrfs_alloc_dummy_root(fs_info); 496 if (IS_ERR(tmp_root)) { 497 test_std_err(TEST_ALLOC_ROOT); 498 ret = PTR_ERR(tmp_root); 499 goto out; 500 } 501 502 tmp_root->root_key.objectid = BTRFS_FS_TREE_OBJECTID; 503 root->fs_info->fs_root = tmp_root; 504 ret = btrfs_insert_fs_root(root->fs_info, tmp_root); 505 if (ret) { 506 test_err("couldn't insert fs root %d", ret); 507 goto out; 508 } 509 btrfs_put_root(tmp_root); 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 btrfs_put_root(tmp_root); 525 526 test_msg("running qgroup tests"); 527 ret = test_no_shared_qgroup(root, sectorsize, nodesize); 528 if (ret) 529 goto out; 530 ret = test_multiple_refs(root, sectorsize, nodesize); 531 out: 532 btrfs_free_dummy_root(root); 533 btrfs_free_dummy_fs_info(fs_info); 534 return ret; 535 } 536