git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/tests.c

   1 // SPDX-License-Identifier: GPL-2.0
   2 #ifdef CONFIG_BCACHEFS_TESTS
   3
   4 #include "bcachefs.h"
   5 #include "btree_update.h"
   6 #include "journal_reclaim.h"
   7 #include "tests.h"
   8
   9 #include "linux/kthread.h"
  10 #include "linux/random.h"
  11
  12 static void delete_test_keys(struct bch_fs *c)
  13 {
  14         int ret;
  15
  16         ret = bch2_btree_delete_range(c, BTREE_ID_extents,
  17                                       POS(0, 0), POS(0, U64_MAX),
  18                                       NULL);
  19         BUG_ON(ret);
  20
  21         ret = bch2_btree_delete_range(c, BTREE_ID_xattrs,
  22                                       POS(0, 0), POS(0, U64_MAX),
  23                                       NULL);
  24         BUG_ON(ret);
  25 }
  26
  27 /* unit tests */
  28
  29 static int test_delete(struct bch_fs *c, u64 nr)
  30 {
  31         struct btree_trans trans;
  32         struct btree_iter *iter;
  33         struct bkey_i_cookie k;
  34         int ret;
  35
  36         bkey_cookie_init(&k.k_i);
  37
  38         bch2_trans_init(&trans, c, 0, 0);
  39
  40         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, k.k.p,
  41                                    BTREE_ITER_INTENT);
  42
  43         ret = bch2_btree_iter_traverse(iter);
  44         if (ret) {
  45                 bch_err(c, "lookup error in test_delete: %i", ret);
  46                 goto err;
  47         }
  48
  49         ret = __bch2_trans_do(&trans, NULL, NULL, 0,
  50                 bch2_trans_update(&trans, iter, &k.k_i, 0));
  51         if (ret) {
  52                 bch_err(c, "update error in test_delete: %i", ret);
  53                 goto err;
  54         }
  55
  56         pr_info("deleting once");
  57         ret = bch2_btree_delete_at(&trans, iter, 0);
  58         if (ret) {
  59                 bch_err(c, "delete error (first) in test_delete: %i", ret);
  60                 goto err;
  61         }
  62
  63         pr_info("deleting twice");
  64         ret = bch2_btree_delete_at(&trans, iter, 0);
  65         if (ret) {
  66                 bch_err(c, "delete error (second) in test_delete: %i", ret);
  67                 goto err;
  68         }
  69 err:
  70         bch2_trans_iter_put(&trans, iter);
  71         bch2_trans_exit(&trans);
  72         return ret;
  73 }
  74
  75 static int test_delete_written(struct bch_fs *c, u64 nr)
  76 {
  77         struct btree_trans trans;
  78         struct btree_iter *iter;
  79         struct bkey_i_cookie k;
  80         int ret;
  81
  82         bkey_cookie_init(&k.k_i);
  83
  84         bch2_trans_init(&trans, c, 0, 0);
  85
  86         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, k.k.p,
  87                                    BTREE_ITER_INTENT);
  88
  89         ret = bch2_btree_iter_traverse(iter);
  90         if (ret) {
  91                 bch_err(c, "lookup error in test_delete_written: %i", ret);
  92                 goto err;
  93         }
  94
  95         ret = __bch2_trans_do(&trans, NULL, NULL, 0,
  96                 bch2_trans_update(&trans, iter, &k.k_i, 0));
  97         if (ret) {
  98                 bch_err(c, "update error in test_delete_written: %i", ret);
  99                 goto err;
 100         }
 101
 102         bch2_journal_flush_all_pins(&c->journal);
 103
 104         ret = bch2_btree_delete_at(&trans, iter, 0);
 105         if (ret) {
 106                 bch_err(c, "delete error in test_delete_written: %i", ret);
 107                 goto err;
 108         }
 109 err:
 110         bch2_trans_iter_put(&trans, iter);
 111         bch2_trans_exit(&trans);
 112         return ret;
 113 }
 114
 115 static int test_iterate(struct bch_fs *c, u64 nr)
 116 {
 117         struct btree_trans trans;
 118         struct btree_iter *iter = NULL;
 119         struct bkey_s_c k;
 120         u64 i;
 121         int ret = 0;
 122
 123         bch2_trans_init(&trans, c, 0, 0);
 124
 125         delete_test_keys(c);
 126
 127         pr_info("inserting test keys");
 128
 129         for (i = 0; i < nr; i++) {
 130                 struct bkey_i_cookie k;
 131
 132                 bkey_cookie_init(&k.k_i);
 133                 k.k.p.offset = i;
 134
 135                 ret = bch2_btree_insert(c, BTREE_ID_xattrs, &k.k_i,
 136                                         NULL, NULL, 0);
 137                 if (ret) {
 138                         bch_err(c, "insert error in test_iterate: %i", ret);
 139                         goto err;
 140                 }
 141         }
 142
 143         pr_info("iterating forwards");
 144
 145         i = 0;
 146
 147         for_each_btree_key(&trans, iter, BTREE_ID_xattrs,
 148                            POS_MIN, 0, k, ret) {
 149                 if (k.k->p.inode)
 150                         break;
 151
 152                 BUG_ON(k.k->p.offset != i++);
 153         }
 154
 155         BUG_ON(i != nr);
 156
 157         pr_info("iterating backwards");
 158
 159         while (!IS_ERR_OR_NULL((k = bch2_btree_iter_prev(iter)).k))
 160                 BUG_ON(k.k->p.offset != --i);
 161
 162         BUG_ON(i);
 163 err:
 164         bch2_trans_iter_put(&trans, iter);
 165         bch2_trans_exit(&trans);
 166         return ret;
 167 }
 168
 169 static int test_iterate_extents(struct bch_fs *c, u64 nr)
 170 {
 171         struct btree_trans trans;
 172         struct btree_iter *iter = NULL;
 173         struct bkey_s_c k;
 174         u64 i;
 175         int ret = 0;
 176
 177         bch2_trans_init(&trans, c, 0, 0);
 178
 179         delete_test_keys(c);
 180
 181         pr_info("inserting test extents");
 182
 183         for (i = 0; i < nr; i += 8) {
 184                 struct bkey_i_cookie k;
 185
 186                 bkey_cookie_init(&k.k_i);
 187                 k.k.p.offset = i + 8;
 188                 k.k.size = 8;
 189
 190                 ret = bch2_btree_insert(c, BTREE_ID_extents, &k.k_i,
 191                                         NULL, NULL, 0);
 192                 if (ret) {
 193                         bch_err(c, "insert error in test_iterate_extents: %i", ret);
 194                         goto err;
 195                 }
 196         }
 197
 198         pr_info("iterating forwards");
 199
 200         i = 0;
 201
 202         for_each_btree_key(&trans, iter, BTREE_ID_extents,
 203                            POS_MIN, 0, k, ret) {
 204                 BUG_ON(bkey_start_offset(k.k) != i);
 205                 i = k.k->p.offset;
 206         }
 207
 208         BUG_ON(i != nr);
 209
 210         pr_info("iterating backwards");
 211
 212         while (!IS_ERR_OR_NULL((k = bch2_btree_iter_prev(iter)).k)) {
 213                 BUG_ON(k.k->p.offset != i);
 214                 i = bkey_start_offset(k.k);
 215         }
 216
 217         BUG_ON(i);
 218 err:
 219         bch2_trans_iter_put(&trans, iter);
 220         bch2_trans_exit(&trans);
 221         return ret;
 222 }
 223
 224 static int test_iterate_slots(struct bch_fs *c, u64 nr)
 225 {
 226         struct btree_trans trans;
 227         struct btree_iter *iter;
 228         struct bkey_s_c k;
 229         u64 i;
 230         int ret = 0;
 231
 232         bch2_trans_init(&trans, c, 0, 0);
 233
 234         delete_test_keys(c);
 235
 236         pr_info("inserting test keys");
 237
 238         for (i = 0; i < nr; i++) {
 239                 struct bkey_i_cookie k;
 240
 241                 bkey_cookie_init(&k.k_i);
 242                 k.k.p.offset = i * 2;
 243
 244                 ret = bch2_btree_insert(c, BTREE_ID_xattrs, &k.k_i,
 245                                         NULL, NULL, 0);
 246                 if (ret) {
 247                         bch_err(c, "insert error in test_iterate_slots: %i", ret);
 248                         goto err;
 249                 }
 250         }
 251
 252         pr_info("iterating forwards");
 253
 254         i = 0;
 255
 256         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
 257                            0, k, ret) {
 258                 if (k.k->p.inode)
 259                         break;
 260
 261                 BUG_ON(k.k->p.offset != i);
 262                 i += 2;
 263         }
 264         bch2_trans_iter_put(&trans, iter);
 265
 266         BUG_ON(i != nr * 2);
 267
 268         pr_info("iterating forwards by slots");
 269
 270         i = 0;
 271
 272         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
 273                            BTREE_ITER_SLOTS, k, ret) {
 274                 BUG_ON(k.k->p.offset != i);
 275                 BUG_ON(bkey_deleted(k.k) != (i & 1));
 276
 277                 i++;
 278                 if (i == nr * 2)
 279                         break;
 280         }
 281         bch2_trans_iter_put(&trans, iter);
 282 err:
 283         bch2_trans_exit(&trans);
 284         return ret;
 285 }
 286
 287 static int test_iterate_slots_extents(struct bch_fs *c, u64 nr)
 288 {
 289         struct btree_trans trans;
 290         struct btree_iter *iter;
 291         struct bkey_s_c k;
 292         u64 i;
 293         int ret = 0;
 294
 295         bch2_trans_init(&trans, c, 0, 0);
 296
 297         delete_test_keys(c);
 298
 299         pr_info("inserting test keys");
 300
 301         for (i = 0; i < nr; i += 16) {
 302                 struct bkey_i_cookie k;
 303
 304                 bkey_cookie_init(&k.k_i);
 305                 k.k.p.offset = i + 16;
 306                 k.k.size = 8;
 307
 308                 ret = bch2_btree_insert(c, BTREE_ID_extents, &k.k_i,
 309                                         NULL, NULL, 0);
 310                 if (ret) {
 311                         bch_err(c, "insert error in test_iterate_slots_extents: %i", ret);
 312                         goto err;
 313                 }
 314         }
 315
 316         pr_info("iterating forwards");
 317
 318         i = 0;
 319
 320         for_each_btree_key(&trans, iter, BTREE_ID_extents, POS_MIN,
 321                            0, k, ret) {
 322                 BUG_ON(bkey_start_offset(k.k) != i + 8);
 323                 BUG_ON(k.k->size != 8);
 324                 i += 16;
 325         }
 326         bch2_trans_iter_put(&trans, iter);
 327
 328         BUG_ON(i != nr);
 329
 330         pr_info("iterating forwards by slots");
 331
 332         i = 0;
 333
 334         for_each_btree_key(&trans, iter, BTREE_ID_extents, POS_MIN,
 335                            BTREE_ITER_SLOTS, k, ret) {
 336                 BUG_ON(bkey_deleted(k.k) != !(i % 16));
 337
 338                 BUG_ON(bkey_start_offset(k.k) != i);
 339                 BUG_ON(k.k->size != 8);
 340                 i = k.k->p.offset;
 341
 342                 if (i == nr)
 343                         break;
 344         }
 345         bch2_trans_iter_put(&trans, iter);
 346 err:
 347         bch2_trans_exit(&trans);
 348         return 0;
 349 }
 350
 351 /*
 352  * XXX: we really want to make sure we've got a btree with depth > 0 for these
 353  * tests
 354  */
 355 static int test_peek_end(struct bch_fs *c, u64 nr)
 356 {
 357         struct btree_trans trans;
 358         struct btree_iter *iter;
 359         struct bkey_s_c k;
 360
 361         bch2_trans_init(&trans, c, 0, 0);
 362
 363         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
 364
 365         k = bch2_btree_iter_peek(iter);
 366         BUG_ON(k.k);
 367
 368         k = bch2_btree_iter_peek(iter);
 369         BUG_ON(k.k);
 370
 371         bch2_trans_iter_put(&trans, iter);
 372
 373         bch2_trans_exit(&trans);
 374         return 0;
 375 }
 376
 377 static int test_peek_end_extents(struct bch_fs *c, u64 nr)
 378 {
 379         struct btree_trans trans;
 380         struct btree_iter *iter;
 381         struct bkey_s_c k;
 382
 383         bch2_trans_init(&trans, c, 0, 0);
 384
 385         iter = bch2_trans_get_iter(&trans, BTREE_ID_extents, POS_MIN, 0);
 386
 387         k = bch2_btree_iter_peek(iter);
 388         BUG_ON(k.k);
 389
 390         k = bch2_btree_iter_peek(iter);
 391         BUG_ON(k.k);
 392
 393         bch2_trans_iter_put(&trans, iter);
 394
 395         bch2_trans_exit(&trans);
 396         return 0;
 397 }
 398
 399 /* extent unit tests */
 400
 401 u64 test_version;
 402
 403 static int insert_test_extent(struct bch_fs *c,
 404                               u64 start, u64 end)
 405 {
 406         struct bkey_i_cookie k;
 407         int ret;
 408
 409         //pr_info("inserting %llu-%llu v %llu", start, end, test_version);
 410
 411         bkey_cookie_init(&k.k_i);
 412         k.k_i.k.p.offset = end;
 413         k.k_i.k.size = end - start;
 414         k.k_i.k.version.lo = test_version++;
 415
 416         ret = bch2_btree_insert(c, BTREE_ID_extents, &k.k_i,
 417                                 NULL, NULL, 0);
 418         if (ret)
 419                 bch_err(c, "insert error in insert_test_extent: %i", ret);
 420         return ret;
 421 }
 422
 423 static int __test_extent_overwrite(struct bch_fs *c,
 424                                     u64 e1_start, u64 e1_end,
 425                                     u64 e2_start, u64 e2_end)
 426 {
 427         int ret;
 428
 429         ret   = insert_test_extent(c, e1_start, e1_end) ?:
 430                 insert_test_extent(c, e2_start, e2_end);
 431
 432         delete_test_keys(c);
 433         return ret;
 434 }
 435
 436 static int test_extent_overwrite_front(struct bch_fs *c, u64 nr)
 437 {
 438         return  __test_extent_overwrite(c, 0, 64, 0, 32) ?:
 439                 __test_extent_overwrite(c, 8, 64, 0, 32);
 440 }
 441
 442 static int test_extent_overwrite_back(struct bch_fs *c, u64 nr)
 443 {
 444         return  __test_extent_overwrite(c, 0, 64, 32, 64) ?:
 445                 __test_extent_overwrite(c, 0, 64, 32, 72);
 446 }
 447
 448 static int test_extent_overwrite_middle(struct bch_fs *c, u64 nr)
 449 {
 450         return __test_extent_overwrite(c, 0, 64, 32, 40);
 451 }
 452
 453 static int test_extent_overwrite_all(struct bch_fs *c, u64 nr)
 454 {
 455         return  __test_extent_overwrite(c, 32, 64,  0,  64) ?:
 456                 __test_extent_overwrite(c, 32, 64,  0, 128) ?:
 457                 __test_extent_overwrite(c, 32, 64, 32,  64) ?:
 458                 __test_extent_overwrite(c, 32, 64, 32, 128);
 459 }
 460
 461 /* perf tests */
 462
 463 static u64 test_rand(void)
 464 {
 465         u64 v;
 466 #if 0
 467         v = prandom_u32();
 468 #else
 469         prandom_bytes(&v, sizeof(v));
 470 #endif
 471         return v;
 472 }
 473
 474 static int rand_insert(struct bch_fs *c, u64 nr)
 475 {
 476         struct btree_trans trans;
 477         struct bkey_i_cookie k;
 478         int ret = 0;
 479         u64 i;
 480
 481         bch2_trans_init(&trans, c, 0, 0);
 482
 483         for (i = 0; i < nr; i++) {
 484                 bkey_cookie_init(&k.k_i);
 485                 k.k.p.offset = test_rand();
 486                 k.k.p.snapshot = U32_MAX;
 487
 488                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 489                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k.k_i));
 490                 if (ret) {
 491                         bch_err(c, "error in rand_insert: %i", ret);
 492                         break;
 493                 }
 494         }
 495
 496         bch2_trans_exit(&trans);
 497         return ret;
 498 }
 499
 500 static int rand_insert_multi(struct bch_fs *c, u64 nr)
 501 {
 502         struct btree_trans trans;
 503         struct bkey_i_cookie k[8];
 504         int ret = 0;
 505         unsigned j;
 506         u64 i;
 507
 508         bch2_trans_init(&trans, c, 0, 0);
 509
 510         for (i = 0; i < nr; i += ARRAY_SIZE(k)) {
 511                 for (j = 0; j < ARRAY_SIZE(k); j++) {
 512                         bkey_cookie_init(&k[j].k_i);
 513                         k[j].k.p.offset = test_rand();
 514                         k[j].k.p.snapshot = U32_MAX;
 515                 }
 516
 517                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 518                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[0].k_i) ?:
 519                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[1].k_i) ?:
 520                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[2].k_i) ?:
 521                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[3].k_i) ?:
 522                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[4].k_i) ?:
 523                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[5].k_i) ?:
 524                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[6].k_i) ?:
 525                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[7].k_i));
 526                 if (ret) {
 527                         bch_err(c, "error in rand_insert_multi: %i", ret);
 528                         break;
 529                 }
 530         }
 531
 532         bch2_trans_exit(&trans);
 533         return ret;
 534 }
 535
 536 static int rand_lookup(struct bch_fs *c, u64 nr)
 537 {
 538         struct btree_trans trans;
 539         struct btree_iter *iter;
 540         struct bkey_s_c k;
 541         int ret = 0;
 542         u64 i;
 543
 544         bch2_trans_init(&trans, c, 0, 0);
 545         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
 546
 547         for (i = 0; i < nr; i++) {
 548                 bch2_btree_iter_set_pos(iter, POS(0, test_rand()));
 549
 550                 k = bch2_btree_iter_peek(iter);
 551                 ret = bkey_err(k);
 552                 if (ret) {
 553                         bch_err(c, "error in rand_lookup: %i", ret);
 554                         break;
 555                 }
 556         }
 557
 558         bch2_trans_iter_put(&trans, iter);
 559         bch2_trans_exit(&trans);
 560         return ret;
 561 }
 562
 563 static int rand_mixed(struct bch_fs *c, u64 nr)
 564 {
 565         struct btree_trans trans;
 566         struct btree_iter *iter;
 567         struct bkey_s_c k;
 568         int ret = 0;
 569         u64 i;
 570
 571         bch2_trans_init(&trans, c, 0, 0);
 572         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
 573
 574         for (i = 0; i < nr; i++) {
 575                 bch2_btree_iter_set_pos(iter, POS(0, test_rand()));
 576
 577                 k = bch2_btree_iter_peek(iter);
 578                 ret = bkey_err(k);
 579                 if (ret) {
 580                         bch_err(c, "lookup error in rand_mixed: %i", ret);
 581                         break;
 582                 }
 583
 584                 if (!(i & 3) && k.k) {
 585                         struct bkey_i_cookie k;
 586
 587                         bkey_cookie_init(&k.k_i);
 588                         k.k.p = iter->pos;
 589
 590                         ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 591                                 bch2_trans_update(&trans, iter, &k.k_i, 0));
 592                         if (ret) {
 593                                 bch_err(c, "update error in rand_mixed: %i", ret);
 594                                 break;
 595                         }
 596                 }
 597         }
 598
 599         bch2_trans_iter_put(&trans, iter);
 600         bch2_trans_exit(&trans);
 601         return ret;
 602 }
 603
 604 static int __do_delete(struct btree_trans *trans, struct bpos pos)
 605 {
 606         struct btree_iter *iter;
 607         struct bkey_i delete;
 608         struct bkey_s_c k;
 609         int ret = 0;
 610
 611         iter = bch2_trans_get_iter(trans, BTREE_ID_xattrs, pos,
 612                                    BTREE_ITER_INTENT);
 613         k = bch2_btree_iter_peek(iter);
 614         ret = bkey_err(k);
 615         if (ret)
 616                 goto err;
 617
 618         if (!k.k)
 619                 goto err;
 620
 621         bkey_init(&delete.k);
 622         delete.k.p = k.k->p;
 623
 624         bch2_trans_update(trans, iter, &delete, 0);
 625 err:
 626         bch2_trans_iter_put(trans, iter);
 627         return ret;
 628 }
 629
 630 static int rand_delete(struct bch_fs *c, u64 nr)
 631 {
 632         struct btree_trans trans;
 633         int ret = 0;
 634         u64 i;
 635
 636         bch2_trans_init(&trans, c, 0, 0);
 637
 638         for (i = 0; i < nr; i++) {
 639                 struct bpos pos = POS(0, test_rand());
 640
 641                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 642                         __do_delete(&trans, pos));
 643                 if (ret) {
 644                         bch_err(c, "error in rand_delete: %i", ret);
 645                         break;
 646                 }
 647         }
 648
 649         bch2_trans_exit(&trans);
 650         return ret;
 651 }
 652
 653 static int seq_insert(struct bch_fs *c, u64 nr)
 654 {
 655         struct btree_trans trans;
 656         struct btree_iter *iter;
 657         struct bkey_s_c k;
 658         struct bkey_i_cookie insert;
 659         int ret = 0;
 660         u64 i = 0;
 661
 662         bkey_cookie_init(&insert.k_i);
 663
 664         bch2_trans_init(&trans, c, 0, 0);
 665
 666         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
 667                            BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k, ret) {
 668                 insert.k.p = iter->pos;
 669
 670                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 671                         bch2_trans_update(&trans, iter, &insert.k_i, 0));
 672                 if (ret) {
 673                         bch_err(c, "error in seq_insert: %i", ret);
 674                         break;
 675                 }
 676
 677                 if (++i == nr)
 678                         break;
 679         }
 680         bch2_trans_iter_put(&trans, iter);
 681
 682         bch2_trans_exit(&trans);
 683         return ret;
 684 }
 685
 686 static int seq_lookup(struct bch_fs *c, u64 nr)
 687 {
 688         struct btree_trans trans;
 689         struct btree_iter *iter;
 690         struct bkey_s_c k;
 691         int ret = 0;
 692
 693         bch2_trans_init(&trans, c, 0, 0);
 694
 695         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN, 0, k, ret)
 696                 ;
 697         bch2_trans_iter_put(&trans, iter);
 698
 699         bch2_trans_exit(&trans);
 700         return ret;
 701 }
 702
 703 static int seq_overwrite(struct bch_fs *c, u64 nr)
 704 {
 705         struct btree_trans trans;
 706         struct btree_iter *iter;
 707         struct bkey_s_c k;
 708         int ret = 0;
 709
 710         bch2_trans_init(&trans, c, 0, 0);
 711
 712         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
 713                            BTREE_ITER_INTENT, k, ret) {
 714                 struct bkey_i_cookie u;
 715
 716                 bkey_reassemble(&u.k_i, k);
 717
 718                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 719                         bch2_trans_update(&trans, iter, &u.k_i, 0));
 720                 if (ret) {
 721                         bch_err(c, "error in seq_overwrite: %i", ret);
 722                         break;
 723                 }
 724         }
 725         bch2_trans_iter_put(&trans, iter);
 726
 727         bch2_trans_exit(&trans);
 728         return ret;
 729 }
 730
 731 static int seq_delete(struct bch_fs *c, u64 nr)
 732 {
 733         int ret;
 734
 735         ret = bch2_btree_delete_range(c, BTREE_ID_xattrs,
 736                                       POS(0, 0), POS(0, U64_MAX),
 737                                       NULL);
 738         if (ret)
 739                 bch_err(c, "error in seq_delete: %i", ret);
 740         return ret;
 741 }
 742
 743 typedef int (*perf_test_fn)(struct bch_fs *, u64);
 744
 745 struct test_job {
 746         struct bch_fs                   *c;
 747         u64                             nr;
 748         unsigned                        nr_threads;
 749         perf_test_fn                    fn;
 750
 751         atomic_t                        ready;
 752         wait_queue_head_t               ready_wait;
 753
 754         atomic_t                        done;
 755         struct completion               done_completion;
 756
 757         u64                             start;
 758         u64                             finish;
 759         int                             ret;
 760 };
 761
 762 static int btree_perf_test_thread(void *data)
 763 {
 764         struct test_job *j = data;
 765         int ret;
 766
 767         if (atomic_dec_and_test(&j->ready)) {
 768                 wake_up(&j->ready_wait);
 769                 j->start = sched_clock();
 770         } else {
 771                 wait_event(j->ready_wait, !atomic_read(&j->ready));
 772         }
 773
 774         ret = j->fn(j->c, j->nr / j->nr_threads);
 775         if (ret)
 776                 j->ret = ret;
 777
 778         if (atomic_dec_and_test(&j->done)) {
 779                 j->finish = sched_clock();
 780                 complete(&j->done_completion);
 781         }
 782
 783         return 0;
 784 }
 785
 786 int bch2_btree_perf_test(struct bch_fs *c, const char *testname,
 787                          u64 nr, unsigned nr_threads)
 788 {
 789         struct test_job j = { .c = c, .nr = nr, .nr_threads = nr_threads };
 790         char name_buf[20], nr_buf[20], per_sec_buf[20];
 791         unsigned i;
 792         u64 time;
 793
 794         atomic_set(&j.ready, nr_threads);
 795         init_waitqueue_head(&j.ready_wait);
 796
 797         atomic_set(&j.done, nr_threads);
 798         init_completion(&j.done_completion);
 799
 800 #define perf_test(_test)                                \
 801         if (!strcmp(testname, #_test)) j.fn = _test
 802
 803         perf_test(rand_insert);
 804         perf_test(rand_insert_multi);
 805         perf_test(rand_lookup);
 806         perf_test(rand_mixed);
 807         perf_test(rand_delete);
 808
 809         perf_test(seq_insert);
 810         perf_test(seq_lookup);
 811         perf_test(seq_overwrite);
 812         perf_test(seq_delete);
 813
 814         /* a unit test, not a perf test: */
 815         perf_test(test_delete);
 816         perf_test(test_delete_written);
 817         perf_test(test_iterate);
 818         perf_test(test_iterate_extents);
 819         perf_test(test_iterate_slots);
 820         perf_test(test_iterate_slots_extents);
 821         perf_test(test_peek_end);
 822         perf_test(test_peek_end_extents);
 823
 824         perf_test(test_extent_overwrite_front);
 825         perf_test(test_extent_overwrite_back);
 826         perf_test(test_extent_overwrite_middle);
 827         perf_test(test_extent_overwrite_all);
 828
 829         if (!j.fn) {
 830                 pr_err("unknown test %s", testname);
 831                 return -EINVAL;
 832         }
 833
 834         //pr_info("running test %s:", testname);
 835
 836         if (nr_threads == 1)
 837                 btree_perf_test_thread(&j);
 838         else
 839                 for (i = 0; i < nr_threads; i++)
 840                         kthread_run(btree_perf_test_thread, &j,
 841                                     "bcachefs perf test[%u]", i);
 842
 843         while (wait_for_completion_interruptible(&j.done_completion))
 844                 ;
 845
 846         time = j.finish - j.start;
 847
 848         scnprintf(name_buf, sizeof(name_buf), "%s:", testname);
 849         bch2_hprint(&PBUF(nr_buf), nr);
 850         bch2_hprint(&PBUF(per_sec_buf), nr * NSEC_PER_SEC / time);
 851         printk(KERN_INFO "%-12s %s with %u threads in %5llu sec, %5llu nsec per iter, %5s per sec\n",
 852                 name_buf, nr_buf, nr_threads,
 853                 time / NSEC_PER_SEC,
 854                 time * nr_threads / nr,
 855                 per_sec_buf);
 856         return j.ret;
 857 }
 858
 859 #endif /* CONFIG_BCACHEFS_TESTS */