1 // SPDX-License-Identifier: GPL-2.0
2 #ifdef CONFIG_BCACHEFS_TESTS
5 #include "btree_update.h"
6 #include "journal_reclaim.h"
9 #include "linux/kthread.h"
10 #include "linux/random.h"
12 static void delete_test_keys(struct bch_fs *c)
16 ret = bch2_btree_delete_range(c, BTREE_ID_extents,
17 POS(0, 0), POS(0, U64_MAX),
21 ret = bch2_btree_delete_range(c, BTREE_ID_xattrs,
22 POS(0, 0), POS(0, U64_MAX),
29 static int test_delete(struct bch_fs *c, u64 nr)
31 struct btree_trans trans;
32 struct btree_iter *iter;
33 struct bkey_i_cookie k;
36 bkey_cookie_init(&k.k_i);
38 bch2_trans_init(&trans, c, 0, 0);
40 iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, k.k.p,
43 ret = bch2_btree_iter_traverse(iter);
45 bch_err(c, "lookup error in test_delete: %i", ret);
49 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
50 bch2_trans_update(&trans, iter, &k.k_i, 0));
52 bch_err(c, "update error in test_delete: %i", ret);
56 pr_info("deleting once");
57 ret = bch2_btree_delete_at(&trans, iter, 0);
59 bch_err(c, "delete error (first) in test_delete: %i", ret);
63 pr_info("deleting twice");
64 ret = bch2_btree_delete_at(&trans, iter, 0);
66 bch_err(c, "delete error (second) in test_delete: %i", ret);
70 bch2_trans_iter_put(&trans, iter);
71 bch2_trans_exit(&trans);
75 static int test_delete_written(struct bch_fs *c, u64 nr)
77 struct btree_trans trans;
78 struct btree_iter *iter;
79 struct bkey_i_cookie k;
82 bkey_cookie_init(&k.k_i);
84 bch2_trans_init(&trans, c, 0, 0);
86 iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, k.k.p,
89 ret = bch2_btree_iter_traverse(iter);
91 bch_err(c, "lookup error in test_delete_written: %i", ret);
95 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
96 bch2_trans_update(&trans, iter, &k.k_i, 0));
98 bch_err(c, "update error in test_delete_written: %i", ret);
102 bch2_journal_flush_all_pins(&c->journal);
104 ret = bch2_btree_delete_at(&trans, iter, 0);
106 bch_err(c, "delete error in test_delete_written: %i", ret);
110 bch2_trans_iter_put(&trans, iter);
111 bch2_trans_exit(&trans);
115 static int test_iterate(struct bch_fs *c, u64 nr)
117 struct btree_trans trans;
118 struct btree_iter *iter = NULL;
123 bch2_trans_init(&trans, c, 0, 0);
127 pr_info("inserting test keys");
129 for (i = 0; i < nr; i++) {
130 struct bkey_i_cookie k;
132 bkey_cookie_init(&k.k_i);
135 ret = bch2_btree_insert(c, BTREE_ID_xattrs, &k.k_i,
138 bch_err(c, "insert error in test_iterate: %i", ret);
143 pr_info("iterating forwards");
147 for_each_btree_key(&trans, iter, BTREE_ID_xattrs,
148 POS_MIN, 0, k, ret) {
152 BUG_ON(k.k->p.offset != i++);
157 pr_info("iterating backwards");
159 while (!IS_ERR_OR_NULL((k = bch2_btree_iter_prev(iter)).k))
160 BUG_ON(k.k->p.offset != --i);
164 bch2_trans_iter_put(&trans, iter);
165 bch2_trans_exit(&trans);
169 static int test_iterate_extents(struct bch_fs *c, u64 nr)
171 struct btree_trans trans;
172 struct btree_iter *iter = NULL;
177 bch2_trans_init(&trans, c, 0, 0);
181 pr_info("inserting test extents");
183 for (i = 0; i < nr; i += 8) {
184 struct bkey_i_cookie k;
186 bkey_cookie_init(&k.k_i);
187 k.k.p.offset = i + 8;
190 ret = bch2_btree_insert(c, BTREE_ID_extents, &k.k_i,
193 bch_err(c, "insert error in test_iterate_extents: %i", ret);
198 pr_info("iterating forwards");
202 for_each_btree_key(&trans, iter, BTREE_ID_extents,
203 POS_MIN, 0, k, ret) {
204 BUG_ON(bkey_start_offset(k.k) != i);
210 pr_info("iterating backwards");
212 while (!IS_ERR_OR_NULL((k = bch2_btree_iter_prev(iter)).k)) {
213 BUG_ON(k.k->p.offset != i);
214 i = bkey_start_offset(k.k);
219 bch2_trans_iter_put(&trans, iter);
220 bch2_trans_exit(&trans);
224 static int test_iterate_slots(struct bch_fs *c, u64 nr)
226 struct btree_trans trans;
227 struct btree_iter *iter;
232 bch2_trans_init(&trans, c, 0, 0);
236 pr_info("inserting test keys");
238 for (i = 0; i < nr; i++) {
239 struct bkey_i_cookie k;
241 bkey_cookie_init(&k.k_i);
242 k.k.p.offset = i * 2;
244 ret = bch2_btree_insert(c, BTREE_ID_xattrs, &k.k_i,
247 bch_err(c, "insert error in test_iterate_slots: %i", ret);
252 pr_info("iterating forwards");
256 for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
261 BUG_ON(k.k->p.offset != i);
264 bch2_trans_iter_put(&trans, iter);
268 pr_info("iterating forwards by slots");
272 for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
273 BTREE_ITER_SLOTS, k, ret) {
274 BUG_ON(k.k->p.offset != i);
275 BUG_ON(bkey_deleted(k.k) != (i & 1));
281 bch2_trans_iter_put(&trans, iter);
283 bch2_trans_exit(&trans);
287 static int test_iterate_slots_extents(struct bch_fs *c, u64 nr)
289 struct btree_trans trans;
290 struct btree_iter *iter;
295 bch2_trans_init(&trans, c, 0, 0);
299 pr_info("inserting test keys");
301 for (i = 0; i < nr; i += 16) {
302 struct bkey_i_cookie k;
304 bkey_cookie_init(&k.k_i);
305 k.k.p.offset = i + 16;
308 ret = bch2_btree_insert(c, BTREE_ID_extents, &k.k_i,
311 bch_err(c, "insert error in test_iterate_slots_extents: %i", ret);
316 pr_info("iterating forwards");
320 for_each_btree_key(&trans, iter, BTREE_ID_extents, POS_MIN,
322 BUG_ON(bkey_start_offset(k.k) != i + 8);
323 BUG_ON(k.k->size != 8);
326 bch2_trans_iter_put(&trans, iter);
330 pr_info("iterating forwards by slots");
334 for_each_btree_key(&trans, iter, BTREE_ID_extents, POS_MIN,
335 BTREE_ITER_SLOTS, k, ret) {
336 BUG_ON(bkey_deleted(k.k) != !(i % 16));
338 BUG_ON(bkey_start_offset(k.k) != i);
339 BUG_ON(k.k->size != 8);
345 bch2_trans_iter_put(&trans, iter);
347 bch2_trans_exit(&trans);
352 * XXX: we really want to make sure we've got a btree with depth > 0 for these
355 static int test_peek_end(struct bch_fs *c, u64 nr)
357 struct btree_trans trans;
358 struct btree_iter *iter;
361 bch2_trans_init(&trans, c, 0, 0);
363 iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
365 k = bch2_btree_iter_peek(iter);
368 k = bch2_btree_iter_peek(iter);
371 bch2_trans_iter_put(&trans, iter);
373 bch2_trans_exit(&trans);
377 static int test_peek_end_extents(struct bch_fs *c, u64 nr)
379 struct btree_trans trans;
380 struct btree_iter *iter;
383 bch2_trans_init(&trans, c, 0, 0);
385 iter = bch2_trans_get_iter(&trans, BTREE_ID_extents, POS_MIN, 0);
387 k = bch2_btree_iter_peek(iter);
390 k = bch2_btree_iter_peek(iter);
393 bch2_trans_iter_put(&trans, iter);
395 bch2_trans_exit(&trans);
399 /* extent unit tests */
403 static int insert_test_extent(struct bch_fs *c,
406 struct bkey_i_cookie k;
409 //pr_info("inserting %llu-%llu v %llu", start, end, test_version);
411 bkey_cookie_init(&k.k_i);
412 k.k_i.k.p.offset = end;
413 k.k_i.k.size = end - start;
414 k.k_i.k.version.lo = test_version++;
416 ret = bch2_btree_insert(c, BTREE_ID_extents, &k.k_i,
419 bch_err(c, "insert error in insert_test_extent: %i", ret);
423 static int __test_extent_overwrite(struct bch_fs *c,
424 u64 e1_start, u64 e1_end,
425 u64 e2_start, u64 e2_end)
429 ret = insert_test_extent(c, e1_start, e1_end) ?:
430 insert_test_extent(c, e2_start, e2_end);
436 static int test_extent_overwrite_front(struct bch_fs *c, u64 nr)
438 return __test_extent_overwrite(c, 0, 64, 0, 32) ?:
439 __test_extent_overwrite(c, 8, 64, 0, 32);
442 static int test_extent_overwrite_back(struct bch_fs *c, u64 nr)
444 return __test_extent_overwrite(c, 0, 64, 32, 64) ?:
445 __test_extent_overwrite(c, 0, 64, 32, 72);
448 static int test_extent_overwrite_middle(struct bch_fs *c, u64 nr)
450 return __test_extent_overwrite(c, 0, 64, 32, 40);
453 static int test_extent_overwrite_all(struct bch_fs *c, u64 nr)
455 return __test_extent_overwrite(c, 32, 64, 0, 64) ?:
456 __test_extent_overwrite(c, 32, 64, 0, 128) ?:
457 __test_extent_overwrite(c, 32, 64, 32, 64) ?:
458 __test_extent_overwrite(c, 32, 64, 32, 128);
463 static u64 test_rand(void)
467 v = prandom_u32_max(U32_MAX);
469 get_random_bytes(&v, sizeof(v));
474 static int rand_insert(struct bch_fs *c, u64 nr)
476 struct btree_trans trans;
477 struct bkey_i_cookie k;
481 bch2_trans_init(&trans, c, 0, 0);
483 for (i = 0; i < nr; i++) {
484 bkey_cookie_init(&k.k_i);
485 k.k.p.offset = test_rand();
486 k.k.p.snapshot = U32_MAX;
488 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
489 __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k.k_i));
491 bch_err(c, "error in rand_insert: %i", ret);
496 bch2_trans_exit(&trans);
500 static int rand_lookup(struct bch_fs *c, u64 nr)
502 struct btree_trans trans;
503 struct btree_iter *iter;
508 bch2_trans_init(&trans, c, 0, 0);
509 iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
511 for (i = 0; i < nr; i++) {
512 bch2_btree_iter_set_pos(iter, POS(0, test_rand()));
514 k = bch2_btree_iter_peek(iter);
517 bch_err(c, "error in rand_lookup: %i", ret);
522 bch2_trans_iter_put(&trans, iter);
523 bch2_trans_exit(&trans);
527 static int rand_mixed(struct bch_fs *c, u64 nr)
529 struct btree_trans trans;
530 struct btree_iter *iter;
535 bch2_trans_init(&trans, c, 0, 0);
536 iter = bch2_trans_get_iter(&trans, BTREE_ID_xattrs, POS_MIN, 0);
538 for (i = 0; i < nr; i++) {
539 bch2_btree_iter_set_pos(iter, POS(0, test_rand()));
541 k = bch2_btree_iter_peek(iter);
544 bch_err(c, "lookup error in rand_mixed: %i", ret);
548 if (!(i & 3) && k.k) {
549 struct bkey_i_cookie k;
551 bkey_cookie_init(&k.k_i);
554 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
555 bch2_trans_update(&trans, iter, &k.k_i, 0));
557 bch_err(c, "update error in rand_mixed: %i", ret);
563 bch2_trans_iter_put(&trans, iter);
564 bch2_trans_exit(&trans);
568 static int __do_delete(struct btree_trans *trans, struct bpos pos)
570 struct btree_iter *iter;
571 struct bkey_i delete;
575 iter = bch2_trans_get_iter(trans, BTREE_ID_xattrs, pos,
577 k = bch2_btree_iter_peek(iter);
585 bkey_init(&delete.k);
588 bch2_trans_update(trans, iter, &delete, 0);
590 bch2_trans_iter_put(trans, iter);
594 static int rand_delete(struct bch_fs *c, u64 nr)
596 struct btree_trans trans;
600 bch2_trans_init(&trans, c, 0, 0);
602 for (i = 0; i < nr; i++) {
603 struct bpos pos = POS(0, test_rand());
605 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
606 __do_delete(&trans, pos));
608 bch_err(c, "error in rand_delete: %i", ret);
613 bch2_trans_exit(&trans);
617 static int seq_insert(struct bch_fs *c, u64 nr)
619 struct btree_trans trans;
620 struct btree_iter *iter;
622 struct bkey_i_cookie insert;
626 bkey_cookie_init(&insert.k_i);
628 bch2_trans_init(&trans, c, 0, 0);
630 for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
631 BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k, ret) {
632 insert.k.p = iter->pos;
634 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
635 bch2_trans_update(&trans, iter, &insert.k_i, 0));
637 bch_err(c, "error in seq_insert: %i", ret);
644 bch2_trans_iter_put(&trans, iter);
646 bch2_trans_exit(&trans);
650 static int seq_lookup(struct bch_fs *c, u64 nr)
652 struct btree_trans trans;
653 struct btree_iter *iter;
657 bch2_trans_init(&trans, c, 0, 0);
659 for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN, 0, k, ret)
661 bch2_trans_iter_put(&trans, iter);
663 bch2_trans_exit(&trans);
667 static int seq_overwrite(struct bch_fs *c, u64 nr)
669 struct btree_trans trans;
670 struct btree_iter *iter;
674 bch2_trans_init(&trans, c, 0, 0);
676 for_each_btree_key(&trans, iter, BTREE_ID_xattrs, POS_MIN,
677 BTREE_ITER_INTENT, k, ret) {
678 struct bkey_i_cookie u;
680 bkey_reassemble(&u.k_i, k);
682 ret = __bch2_trans_do(&trans, NULL, NULL, 0,
683 bch2_trans_update(&trans, iter, &u.k_i, 0));
685 bch_err(c, "error in seq_overwrite: %i", ret);
689 bch2_trans_iter_put(&trans, iter);
691 bch2_trans_exit(&trans);
695 static int seq_delete(struct bch_fs *c, u64 nr)
699 ret = bch2_btree_delete_range(c, BTREE_ID_xattrs,
700 POS(0, 0), POS(0, U64_MAX),
703 bch_err(c, "error in seq_delete: %i", ret);
707 typedef int (*perf_test_fn)(struct bch_fs *, u64);
716 wait_queue_head_t ready_wait;
719 struct completion done_completion;
726 static int btree_perf_test_thread(void *data)
728 struct test_job *j = data;
731 if (atomic_dec_and_test(&j->ready)) {
732 wake_up(&j->ready_wait);
733 j->start = sched_clock();
735 wait_event(j->ready_wait, !atomic_read(&j->ready));
738 ret = j->fn(j->c, j->nr / j->nr_threads);
742 if (atomic_dec_and_test(&j->done)) {
743 j->finish = sched_clock();
744 complete(&j->done_completion);
750 int bch2_btree_perf_test(struct bch_fs *c, const char *testname,
751 u64 nr, unsigned nr_threads)
753 struct test_job j = { .c = c, .nr = nr, .nr_threads = nr_threads };
754 char name_buf[20], nr_buf[20], per_sec_buf[20];
758 atomic_set(&j.ready, nr_threads);
759 init_waitqueue_head(&j.ready_wait);
761 atomic_set(&j.done, nr_threads);
762 init_completion(&j.done_completion);
764 #define perf_test(_test) \
765 if (!strcmp(testname, #_test)) j.fn = _test
767 perf_test(rand_insert);
768 perf_test(rand_lookup);
769 perf_test(rand_mixed);
770 perf_test(rand_delete);
772 perf_test(seq_insert);
773 perf_test(seq_lookup);
774 perf_test(seq_overwrite);
775 perf_test(seq_delete);
777 /* a unit test, not a perf test: */
778 perf_test(test_delete);
779 perf_test(test_delete_written);
780 perf_test(test_iterate);
781 perf_test(test_iterate_extents);
782 perf_test(test_iterate_slots);
783 perf_test(test_iterate_slots_extents);
784 perf_test(test_peek_end);
785 perf_test(test_peek_end_extents);
787 perf_test(test_extent_overwrite_front);
788 perf_test(test_extent_overwrite_back);
789 perf_test(test_extent_overwrite_middle);
790 perf_test(test_extent_overwrite_all);
793 pr_err("unknown test %s", testname);
797 //pr_info("running test %s:", testname);
800 btree_perf_test_thread(&j);
802 for (i = 0; i < nr_threads; i++)
803 kthread_run(btree_perf_test_thread, &j,
804 "bcachefs perf test[%u]", i);
806 while (wait_for_completion_interruptible(&j.done_completion))
809 time = j.finish - j.start;
811 scnprintf(name_buf, sizeof(name_buf), "%s:", testname);
812 bch2_hprint(&PBUF(nr_buf), nr);
813 bch2_hprint(&PBUF(per_sec_buf), nr * NSEC_PER_SEC / time);
814 printk(KERN_INFO "%-12s %s with %u threads in %5llu sec, %5llu nsec per iter, %5s per sec\n",
815 name_buf, nr_buf, nr_threads,
817 time * nr_threads / nr,
822 #endif /* CONFIG_BCACHEFS_TESTS */