]> git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/tests.c
Update bcachefs sources to 8fd009dd76 bcachefs: Rip out code for storing backpointers...
[bcachefs-tools-debian] / 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),
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(c, "%s(): update error in: %s", __func__, bch2_err_str(ret));
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(c, "%s(): delete error (first): %s", __func__, bch2_err_str(ret));
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(c, "%s(): delete error (second): %s", __func__, bch2_err_str(ret));
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(c, "%s(): update error: %s", __func__, bch2_err_str(ret));
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(c, "%s(): delete error: %s", __func__, bch2_err_str(ret));
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(c, "%s(): insert error: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating forwards: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating backwards: %s", __func__, bch2_err_str(ret));
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(c, "%s(): insert error: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating forwards: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating backwards: %s", __func__, bch2_err_str(ret));
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(c, "%s(): insert error: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating forwards: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating forwards by slots: %s", __func__, bch2_err_str(ret));
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(c, "%s(): insert error: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating forwards: %s", __func__, bch2_err_str(ret));
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(c, "%s(): error iterating forwards by slots: %s", __func__, bch2_err_str(ret));
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 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(c, "%s(): insert error: %s", __func__, bch2_err_str(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 /* snapshot unit tests */
507
508 /* Test skipping over keys in unrelated snapshots: */
509 static int test_snapshot_filter(struct bch_fs *c, u32 snapid_lo, u32 snapid_hi)
510 {
511         struct btree_trans trans;
512         struct btree_iter iter;
513         struct bkey_s_c k;
514         struct bkey_i_cookie cookie;
515         int ret;
516
517         bkey_cookie_init(&cookie.k_i);
518         cookie.k.p.snapshot = snapid_hi;
519         ret = bch2_btree_insert(c, BTREE_ID_xattrs, &cookie.k_i,
520                                 NULL, NULL, 0);
521         if (ret)
522                 return ret;
523
524         bch2_trans_init(&trans, c, 0, 0);
525         bch2_trans_iter_init(&trans, &iter, BTREE_ID_xattrs,
526                              SPOS(0, 0, snapid_lo), 0);
527         lockrestart_do(&trans, bkey_err(k = bch2_btree_iter_peek_upto(&iter, POS(0, U64_MAX))));
528
529         BUG_ON(k.k->p.snapshot != U32_MAX);
530
531         bch2_trans_iter_exit(&trans, &iter);
532         bch2_trans_exit(&trans);
533         return ret;
534 }
535
536 static int test_snapshots(struct bch_fs *c, u64 nr)
537 {
538         struct bkey_i_cookie cookie;
539         u32 snapids[2];
540         u32 snapid_subvols[2] = { 1, 1 };
541         int ret;
542
543         bkey_cookie_init(&cookie.k_i);
544         cookie.k.p.snapshot = U32_MAX;
545         ret = bch2_btree_insert(c, BTREE_ID_xattrs, &cookie.k_i,
546                                 NULL, NULL, 0);
547         if (ret)
548                 return ret;
549
550         ret = bch2_trans_do(c, NULL, NULL, 0,
551                       bch2_snapshot_node_create(&trans, U32_MAX,
552                                                 snapids,
553                                                 snapid_subvols,
554                                                 2));
555         if (ret)
556                 return ret;
557
558         if (snapids[0] > snapids[1])
559                 swap(snapids[0], snapids[1]);
560
561         ret = test_snapshot_filter(c, snapids[0], snapids[1]);
562         if (ret) {
563                 bch_err(c, "%s(): err from test_snapshot_filter: %s", __func__, bch2_err_str(ret));
564                 return ret;
565         }
566
567         return 0;
568 }
569
570 /* perf tests */
571
572 static u64 test_rand(void)
573 {
574         u64 v;
575
576         get_random_bytes(&v, sizeof(v));
577         return v;
578 }
579
580 static int rand_insert(struct bch_fs *c, u64 nr)
581 {
582         struct btree_trans trans;
583         struct bkey_i_cookie k;
584         int ret = 0;
585         u64 i;
586
587         bch2_trans_init(&trans, c, 0, 0);
588
589         for (i = 0; i < nr; i++) {
590                 bkey_cookie_init(&k.k_i);
591                 k.k.p.offset = test_rand();
592                 k.k.p.snapshot = U32_MAX;
593
594                 ret = commit_do(&trans, NULL, NULL, 0,
595                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k.k_i, 0));
596                 if (ret) {
597                         bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
598                         break;
599                 }
600         }
601
602         bch2_trans_exit(&trans);
603         return ret;
604 }
605
606 static int rand_insert_multi(struct bch_fs *c, u64 nr)
607 {
608         struct btree_trans trans;
609         struct bkey_i_cookie k[8];
610         int ret = 0;
611         unsigned j;
612         u64 i;
613
614         bch2_trans_init(&trans, c, 0, 0);
615
616         for (i = 0; i < nr; i += ARRAY_SIZE(k)) {
617                 for (j = 0; j < ARRAY_SIZE(k); j++) {
618                         bkey_cookie_init(&k[j].k_i);
619                         k[j].k.p.offset = test_rand();
620                         k[j].k.p.snapshot = U32_MAX;
621                 }
622
623                 ret = commit_do(&trans, NULL, NULL, 0,
624                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[0].k_i, 0) ?:
625                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[1].k_i, 0) ?:
626                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[2].k_i, 0) ?:
627                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[3].k_i, 0) ?:
628                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[4].k_i, 0) ?:
629                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[5].k_i, 0) ?:
630                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[6].k_i, 0) ?:
631                         __bch2_btree_insert(&trans, BTREE_ID_xattrs, &k[7].k_i, 0));
632                 if (ret) {
633                         bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
634                         break;
635                 }
636         }
637
638         bch2_trans_exit(&trans);
639         return ret;
640 }
641
642 static int rand_lookup(struct bch_fs *c, u64 nr)
643 {
644         struct btree_trans trans;
645         struct btree_iter iter;
646         struct bkey_s_c k;
647         int ret = 0;
648         u64 i;
649
650         bch2_trans_init(&trans, c, 0, 0);
651         bch2_trans_iter_init(&trans, &iter, BTREE_ID_xattrs,
652                              SPOS(0, 0, U32_MAX), 0);
653
654         for (i = 0; i < nr; i++) {
655                 bch2_btree_iter_set_pos(&iter, SPOS(0, test_rand(), U32_MAX));
656
657                 lockrestart_do(&trans, bkey_err(k = bch2_btree_iter_peek(&iter)));
658                 ret = bkey_err(k);
659                 if (ret) {
660                         bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
661                         break;
662                 }
663         }
664
665         bch2_trans_iter_exit(&trans, &iter);
666         bch2_trans_exit(&trans);
667         return ret;
668 }
669
670 static int rand_mixed_trans(struct btree_trans *trans,
671                             struct btree_iter *iter,
672                             struct bkey_i_cookie *cookie,
673                             u64 i, u64 pos)
674 {
675         struct bkey_s_c k;
676         int ret;
677
678         bch2_btree_iter_set_pos(iter, SPOS(0, pos, U32_MAX));
679
680         k = bch2_btree_iter_peek(iter);
681         ret = bkey_err(k);
682         if (ret && !bch2_err_matches(ret, BCH_ERR_transaction_restart))
683                 bch_err(trans->c, "%s(): lookup error: %s", __func__, bch2_err_str(ret));
684         if (ret)
685                 return ret;
686
687         if (!(i & 3) && k.k) {
688                 bkey_cookie_init(&cookie->k_i);
689                 cookie->k.p = iter->pos;
690                 ret = bch2_trans_update(trans, iter, &cookie->k_i, 0);
691         }
692
693         return ret;
694 }
695
696 static int rand_mixed(struct bch_fs *c, u64 nr)
697 {
698         struct btree_trans trans;
699         struct btree_iter iter;
700         struct bkey_i_cookie cookie;
701         int ret = 0;
702         u64 i, rand;
703
704         bch2_trans_init(&trans, c, 0, 0);
705         bch2_trans_iter_init(&trans, &iter, BTREE_ID_xattrs,
706                              SPOS(0, 0, U32_MAX), 0);
707
708         for (i = 0; i < nr; i++) {
709                 rand = test_rand();
710                 ret = commit_do(&trans, NULL, NULL, 0,
711                         rand_mixed_trans(&trans, &iter, &cookie, i, rand));
712                 if (ret) {
713                         bch_err(c, "%s(): update error: %s", __func__, bch2_err_str(ret));
714                         break;
715                 }
716         }
717
718         bch2_trans_iter_exit(&trans, &iter);
719         bch2_trans_exit(&trans);
720         return ret;
721 }
722
723 static int __do_delete(struct btree_trans *trans, struct bpos pos)
724 {
725         struct btree_iter iter;
726         struct bkey_s_c k;
727         int ret = 0;
728
729         bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, pos,
730                              BTREE_ITER_INTENT);
731         lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek(&iter)));
732         ret = bkey_err(k);
733         if (ret)
734                 goto err;
735
736         if (!k.k)
737                 goto err;
738
739         ret = bch2_btree_delete_at(trans, &iter, 0);
740 err:
741         bch2_trans_iter_exit(trans, &iter);
742         return ret;
743 }
744
745 static int rand_delete(struct bch_fs *c, u64 nr)
746 {
747         struct btree_trans trans;
748         int ret = 0;
749         u64 i;
750
751         bch2_trans_init(&trans, c, 0, 0);
752
753         for (i = 0; i < nr; i++) {
754                 struct bpos pos = SPOS(0, test_rand(), U32_MAX);
755
756                 ret = commit_do(&trans, NULL, NULL, 0,
757                         __do_delete(&trans, pos));
758                 if (ret) {
759                         bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
760                         break;
761                 }
762         }
763
764         bch2_trans_exit(&trans);
765         return ret;
766 }
767
768 static int seq_insert(struct bch_fs *c, u64 nr)
769 {
770         struct btree_trans trans;
771         struct btree_iter iter;
772         struct bkey_s_c k;
773         struct bkey_i_cookie insert;
774         int ret = 0;
775
776         bkey_cookie_init(&insert.k_i);
777
778         bch2_trans_init(&trans, c, 0, 0);
779
780         ret = for_each_btree_key_commit(&trans, iter, BTREE_ID_xattrs,
781                                         SPOS(0, 0, U32_MAX),
782                                         BTREE_ITER_SLOTS|BTREE_ITER_INTENT, k,
783                                         NULL, NULL, 0,
784                 ({
785                         if (iter.pos.offset >= nr)
786                                 break;
787                         insert.k.p = iter.pos;
788                         bch2_trans_update(&trans, &iter, &insert.k_i, 0);
789                 }));
790         if (ret)
791                 bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
792
793         bch2_trans_exit(&trans);
794         return ret;
795 }
796
797 static int seq_lookup(struct bch_fs *c, u64 nr)
798 {
799         struct btree_trans trans;
800         struct btree_iter iter;
801         struct bkey_s_c k;
802         int ret = 0;
803
804         bch2_trans_init(&trans, c, 0, 0);
805
806         ret = for_each_btree_key2_upto(&trans, iter, BTREE_ID_xattrs,
807                                   SPOS(0, 0, U32_MAX), POS(0, U64_MAX),
808                                   0, k,
809                 0);
810         if (ret)
811                 bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
812
813         bch2_trans_exit(&trans);
814         return ret;
815 }
816
817 static int seq_overwrite(struct bch_fs *c, u64 nr)
818 {
819         struct btree_trans trans;
820         struct btree_iter iter;
821         struct bkey_s_c k;
822         int ret = 0;
823
824         bch2_trans_init(&trans, c, 0, 0);
825
826         ret = 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                 ({
831                         struct bkey_i_cookie u;
832
833                         bkey_reassemble(&u.k_i, k);
834                         bch2_trans_update(&trans, &iter, &u.k_i, 0);
835                 }));
836         if (ret)
837                 bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
838
839         bch2_trans_exit(&trans);
840         return ret;
841 }
842
843 static int seq_delete(struct bch_fs *c, u64 nr)
844 {
845         int ret;
846
847         ret = bch2_btree_delete_range(c, BTREE_ID_xattrs,
848                                       SPOS(0, 0, U32_MAX),
849                                       POS(0, U64_MAX),
850                                       0, NULL);
851         if (ret)
852                 bch_err(c, "%s(): error %s", __func__, bch2_err_str(ret));
853         return ret;
854 }
855
856 typedef int (*perf_test_fn)(struct bch_fs *, u64);
857
858 struct test_job {
859         struct bch_fs                   *c;
860         u64                             nr;
861         unsigned                        nr_threads;
862         perf_test_fn                    fn;
863
864         atomic_t                        ready;
865         wait_queue_head_t               ready_wait;
866
867         atomic_t                        done;
868         struct completion               done_completion;
869
870         u64                             start;
871         u64                             finish;
872         int                             ret;
873 };
874
875 static int btree_perf_test_thread(void *data)
876 {
877         struct test_job *j = data;
878         int ret;
879
880         if (atomic_dec_and_test(&j->ready)) {
881                 wake_up(&j->ready_wait);
882                 j->start = sched_clock();
883         } else {
884                 wait_event(j->ready_wait, !atomic_read(&j->ready));
885         }
886
887         ret = j->fn(j->c, div64_u64(j->nr, j->nr_threads));
888         if (ret) {
889                 bch_err(j->c, "%ps: error %s", j->fn, bch2_err_str(ret));
890                 j->ret = ret;
891         }
892
893         if (atomic_dec_and_test(&j->done)) {
894                 j->finish = sched_clock();
895                 complete(&j->done_completion);
896         }
897
898         return 0;
899 }
900
901 int bch2_btree_perf_test(struct bch_fs *c, const char *testname,
902                          u64 nr, unsigned nr_threads)
903 {
904         struct test_job j = { .c = c, .nr = nr, .nr_threads = nr_threads };
905         char name_buf[20];
906         struct printbuf nr_buf = PRINTBUF;
907         struct printbuf per_sec_buf = PRINTBUF;
908         unsigned i;
909         u64 time;
910
911         atomic_set(&j.ready, nr_threads);
912         init_waitqueue_head(&j.ready_wait);
913
914         atomic_set(&j.done, nr_threads);
915         init_completion(&j.done_completion);
916
917 #define perf_test(_test)                                \
918         if (!strcmp(testname, #_test)) j.fn = _test
919
920         perf_test(rand_insert);
921         perf_test(rand_insert_multi);
922         perf_test(rand_lookup);
923         perf_test(rand_mixed);
924         perf_test(rand_delete);
925
926         perf_test(seq_insert);
927         perf_test(seq_lookup);
928         perf_test(seq_overwrite);
929         perf_test(seq_delete);
930
931         /* a unit test, not a perf test: */
932         perf_test(test_delete);
933         perf_test(test_delete_written);
934         perf_test(test_iterate);
935         perf_test(test_iterate_extents);
936         perf_test(test_iterate_slots);
937         perf_test(test_iterate_slots_extents);
938         perf_test(test_peek_end);
939         perf_test(test_peek_end_extents);
940
941         perf_test(test_extent_overwrite_front);
942         perf_test(test_extent_overwrite_back);
943         perf_test(test_extent_overwrite_middle);
944         perf_test(test_extent_overwrite_all);
945
946         perf_test(test_snapshots);
947
948         if (!j.fn) {
949                 pr_err("unknown test %s", testname);
950                 return -EINVAL;
951         }
952
953         //pr_info("running test %s:", testname);
954
955         if (nr_threads == 1)
956                 btree_perf_test_thread(&j);
957         else
958                 for (i = 0; i < nr_threads; i++)
959                         kthread_run(btree_perf_test_thread, &j,
960                                     "bcachefs perf test[%u]", i);
961
962         while (wait_for_completion_interruptible(&j.done_completion))
963                 ;
964
965         time = j.finish - j.start;
966
967         scnprintf(name_buf, sizeof(name_buf), "%s:", testname);
968         prt_human_readable_u64(&nr_buf, nr);
969         prt_human_readable_u64(&per_sec_buf, div64_u64(nr * NSEC_PER_SEC, time));
970         printk(KERN_INFO "%-12s %s with %u threads in %5llu sec, %5llu nsec per iter, %5s per sec\n",
971                 name_buf, nr_buf.buf, nr_threads,
972                 div_u64(time, NSEC_PER_SEC),
973                 div_u64(time * nr_threads, nr),
974                 per_sec_buf.buf);
975         printbuf_exit(&per_sec_buf);
976         printbuf_exit(&nr_buf);
977         return j.ret;
978 }
979
980 #endif /* CONFIG_BCACHEFS_TESTS */