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