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_lookup(struct bch_fs *c, u64 nr)
 501 {
 502         struct btree_trans trans;
 503         struct btree_iter *iter;
 504         struct bkey_s_c k;
 505         int ret = 0;
 506         u64 i;
 507
 508         bch2_trans_init(&trans, c, 0, 0);
 509         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
 510
 511         for (i = 0; i < nr; i++) {
 512                 bch2_btree_iter_set_pos(iter, POS(0, test_rand()));
 513
 514                 k = bch2_btree_iter_peek(iter);
 515                 ret = bkey_err(k);
 516                 if (ret) {
 517                         bch_err(c, "error in rand_lookup: %i", ret);
 518                         break;
 519                 }
 520         }
 521
 522         bch2_trans_iter_put(&trans, iter);
 523         bch2_trans_exit(&trans);
 524         return ret;
 525 }
 526
 527 static int rand_mixed(struct bch_fs *c, u64 nr)
 528 {
 529         struct btree_trans trans;
 530         struct btree_iter *iter;
 531         struct bkey_s_c k;
 532         int ret = 0;
 533         u64 i;
 534
 535         bch2_trans_init(&trans, c, 0, 0);
 536         iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
 537
 538         for (i = 0; i < nr; i++) {
 539                 bch2_btree_iter_set_pos(iter, POS(0, test_rand()));
 540
 541                 k = bch2_btree_iter_peek(iter);
 542                 ret = bkey_err(k);
 543                 if (ret) {
 544                         bch_err(c, "lookup error in rand_mixed: %i", ret);
 545                         break;
 546                 }
 547
 548                 if (!(i & 3) && k.k) {
 549                         struct bkey_i_cookie k;
 550
 551                         bkey_cookie_init(&k.k_i);
 552                         k.k.p = iter->pos;
 553
 554                         ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 555                                 bch2_trans_update(&trans, iter, &k.k_i, 0));
 556                         if (ret) {
 557                                 bch_err(c, "update error in rand_mixed: %i", ret);
 558                                 break;
 559                         }
 560                 }
 561         }
 562
 563         bch2_trans_iter_put(&trans, iter);
 564         bch2_trans_exit(&trans);
 565         return ret;
 566 }
 567
 568 static int __do_delete(struct btree_trans *trans, struct bpos pos)
 569 {
 570         struct btree_iter *iter;
 571         struct bkey_i delete;
 572         struct bkey_s_c k;
 573         int ret = 0;
 574
 575         iter = bch2_trans_get_iter(trans, BTREE_ID_xattrs, pos,
 576                                    BTREE_ITER_INTENT);
 577         k = bch2_btree_iter_peek(iter);
 578         ret = bkey_err(k);
 579         if (ret)
 580                 goto err;
 581
 582         if (!k.k)
 583                 goto err;
 584
 585         bkey_init(&delete.k);
 586         delete.k.p = k.k->p;
 587
 588         bch2_trans_update(trans, iter, &delete, 0);
 589 err:
 590         bch2_trans_iter_put(trans, iter);
 591         return ret;
 592 }
 593
 594 static int rand_delete(struct bch_fs *c, u64 nr)
 595 {
 596         struct btree_trans trans;
 597         int ret = 0;
 598         u64 i;
 599
 600         bch2_trans_init(&trans, c, 0, 0);
 601
 602         for (i = 0; i < nr; i++) {
 603                 struct bpos pos = POS(0, test_rand());
 604
 605                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 606                         __do_delete(&trans, pos));
 607                 if (ret) {
 608                         bch_err(c, "error in rand_delete: %i", ret);
 609                         break;
 610                 }
 611         }
 612
 613         bch2_trans_exit(&trans);
 614         return ret;
 615 }
 616
 617 static int seq_insert(struct bch_fs *c, u64 nr)
 618 {
 619         struct btree_trans trans;
 620         struct btree_iter *iter;
 621         struct bkey_s_c k;
 622         struct bkey_i_cookie insert;
 623         int ret = 0;
 624         u64 i = 0;
 625
 626         bkey_cookie_init(&insert.k_i);
 627
 628         bch2_trans_init(&trans, c, 0, 0);
 629
 630         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
 631                            BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k, ret) {
 632                 insert.k.p = iter->pos;
 633
 634                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 635                         bch2_trans_update(&trans, iter, &insert.k_i, 0));
 636                 if (ret) {
 637                         bch_err(c, "error in seq_insert: %i", ret);
 638                         break;
 639                 }
 640
 641                 if (++i == nr)
 642                         break;
 643         }
 644         bch2_trans_iter_put(&trans, iter);
 645
 646         bch2_trans_exit(&trans);
 647         return ret;
 648 }
 649
 650 static int seq_lookup(struct bch_fs *c, u64 nr)
 651 {
 652         struct btree_trans trans;
 653         struct btree_iter *iter;
 654         struct bkey_s_c k;
 655         int ret = 0;
 656
 657         bch2_trans_init(&trans, c, 0, 0);
 658
 659         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN, 0, k, ret)
 660                 ;
 661         bch2_trans_iter_put(&trans, iter);
 662
 663         bch2_trans_exit(&trans);
 664         return ret;
 665 }
 666
 667 static int seq_overwrite(struct bch_fs *c, u64 nr)
 668 {
 669         struct btree_trans trans;
 670         struct btree_iter *iter;
 671         struct bkey_s_c k;
 672         int ret = 0;
 673
 674         bch2_trans_init(&trans, c, 0, 0);
 675
 676         for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
 677                            BTREE_ITER_INTENT, k, ret) {
 678                 struct bkey_i_cookie u;
 679
 680                 bkey_reassemble(&u.k_i, k);
 681
 682                 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
 683                         bch2_trans_update(&trans, iter, &u.k_i, 0));
 684                 if (ret) {
 685                         bch_err(c, "error in seq_overwrite: %i", ret);
 686                         break;
 687                 }
 688         }
 689         bch2_trans_iter_put(&trans, iter);
 690
 691         bch2_trans_exit(&trans);
 692         return ret;
 693 }
 694
 695 static int seq_delete(struct bch_fs *c, u64 nr)
 696 {
 697         int ret;
 698
 699         ret = bch2_btree_delete_range(c, BTREE_ID_xattrs,
 700                                       POS(0, 0), POS(0, U64_MAX),
 701                                       NULL);
 702         if (ret)
 703                 bch_err(c, "error in seq_delete: %i", ret);
 704         return ret;
 705 }
 706
 707 typedef int (*perf_test_fn)(struct bch_fs *, u64);
 708
 709 struct test_job {
 710         struct bch_fs                   *c;
 711         u64                             nr;
 712         unsigned                        nr_threads;
 713         perf_test_fn                    fn;
 714
 715         atomic_t                        ready;
 716         wait_queue_head_t               ready_wait;
 717
 718         atomic_t                        done;
 719         struct completion               done_completion;
 720
 721         u64                             start;
 722         u64                             finish;
 723         int                             ret;
 724 };
 725
 726 static int btree_perf_test_thread(void *data)
 727 {
 728         struct test_job *j = data;
 729         int ret;
 730
 731         if (atomic_dec_and_test(&j->ready)) {
 732                 wake_up(&j->ready_wait);
 733                 j->start = sched_clock();
 734         } else {
 735                 wait_event(j->ready_wait, !atomic_read(&j->ready));
 736         }
 737
 738         ret = j->fn(j->c, j->nr / j->nr_threads);
 739         if (ret)
 740                 j->ret = ret;
 741
 742         if (atomic_dec_and_test(&j->done)) {
 743                 j->finish = sched_clock();
 744                 complete(&j->done_completion);
 745         }
 746
 747         return 0;
 748 }
 749
 750 int bch2_btree_perf_test(struct bch_fs *c, const char *testname,
 751                          u64 nr, unsigned nr_threads)
 752 {
 753         struct test_job j = { .c = c, .nr = nr, .nr_threads = nr_threads };
 754         char name_buf[20], nr_buf[20], per_sec_buf[20];
 755         unsigned i;
 756         u64 time;
 757
 758         atomic_set(&j.ready, nr_threads);
 759         init_waitqueue_head(&j.ready_wait);
 760
 761         atomic_set(&j.done, nr_threads);
 762         init_completion(&j.done_completion);
 763
 764 #define perf_test(_test)                                \
 765         if (!strcmp(testname, #_test)) j.fn = _test
 766
 767         perf_test(rand_insert);
 768         perf_test(rand_lookup);
 769         perf_test(rand_mixed);
 770         perf_test(rand_delete);
 771
 772         perf_test(seq_insert);
 773         perf_test(seq_lookup);
 774         perf_test(seq_overwrite);
 775         perf_test(seq_delete);
 776
 777         /* a unit test, not a perf test: */
 778         perf_test(test_delete);
 779         perf_test(test_delete_written);
 780         perf_test(test_iterate);
 781         perf_test(test_iterate_extents);
 782         perf_test(test_iterate_slots);
 783         perf_test(test_iterate_slots_extents);
 784         perf_test(test_peek_end);
 785         perf_test(test_peek_end_extents);
 786
 787         perf_test(test_extent_overwrite_front);
 788         perf_test(test_extent_overwrite_back);
 789         perf_test(test_extent_overwrite_middle);
 790         perf_test(test_extent_overwrite_all);
 791
 792         if (!j.fn) {
 793                 pr_err("unknown test %s", testname);
 794                 return -EINVAL;
 795         }
 796
 797         //pr_info("running test %s:", testname);
 798
 799         if (nr_threads == 1)
 800                 btree_perf_test_thread(&j);
 801         else
 802                 for (i = 0; i < nr_threads; i++)
 803                         kthread_run(btree_perf_test_thread, &j,
 804                                     "bcachefs perf test[%u]", i);
 805
 806         while (wait_for_completion_interruptible(&j.done_completion))
 807                 ;
 808
 809         time = j.finish - j.start;
 810
 811         scnprintf(name_buf, sizeof(name_buf), "%s:", testname);
 812         bch2_hprint(&PBUF(nr_buf), nr);
 813         bch2_hprint(&PBUF(per_sec_buf), nr * NSEC_PER_SEC / time);
 814         printk(KERN_INFO "%-12s %s with %u threads in %5llu sec, %5llu nsec per iter, %5s per sec\n",
 815                 name_buf, nr_buf, nr_threads,
 816                 time / NSEC_PER_SEC,
 817                 time * nr_threads / nr,
 818                 per_sec_buf);
 819         return j.ret;
 820 }
 821
 822 #endif /* CONFIG_BCACHEFS_TESTS */