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