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