1 // SPDX-License-Identifier: GPL-2.0+
3 * test_maple_tree.c: Test the maple tree API
4 * Copyright (c) 2018-2022 Oracle Corporation
5 * Author: Liam R. Howlett <Liam.Howlett@Oracle.com>
7 * Any tests that only require the interface of the tree.
10 #include <linux/maple_tree.h>
11 #include <linux/module.h>
13 #define MTREE_ALLOC_MAX 0x2000000000000Ul
14 #define CONFIG_MAPLE_SEARCH
15 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
17 #ifndef CONFIG_DEBUG_MAPLE_TREE
18 #define mt_dump(mt, fmt) do {} while (0)
19 #define mt_validate(mt) do {} while (0)
20 #define mt_cache_shrink() do {} while (0)
21 #define mas_dump(mas) do {} while (0)
22 #define mas_wr_dump(mas) do {} while (0)
23 atomic_t maple_tree_tests_run;
24 atomic_t maple_tree_tests_passed;
27 #define MT_BUG_ON(__tree, __x) do { \
28 atomic_inc(&maple_tree_tests_run); \
30 pr_info("BUG at %s:%d (%u)\n", \
31 __func__, __LINE__, __x); \
32 pr_info("Pass: %u Run:%u\n", \
33 atomic_read(&maple_tree_tests_passed), \
34 atomic_read(&maple_tree_tests_run)); \
36 atomic_inc(&maple_tree_tests_passed); \
41 /* #define BENCH_SLOT_STORE */
42 /* #define BENCH_NODE_STORE */
43 /* #define BENCH_AWALK */
44 /* #define BENCH_WALK */
45 /* #define BENCH_MT_FOR_EACH */
46 /* #define BENCH_FORK */
49 #define mt_set_non_kernel(x) do {} while (0)
50 #define mt_zero_nr_tallocated(x) do {} while (0)
52 #define cond_resched() do {} while (0)
54 static int __init mtree_insert_index(struct maple_tree *mt,
55 unsigned long index, gfp_t gfp)
57 return mtree_insert(mt, index, xa_mk_value(index & LONG_MAX), gfp);
60 static void __init mtree_erase_index(struct maple_tree *mt, unsigned long index)
62 MT_BUG_ON(mt, mtree_erase(mt, index) != xa_mk_value(index & LONG_MAX));
63 MT_BUG_ON(mt, mtree_load(mt, index) != NULL);
66 static int __init mtree_test_insert(struct maple_tree *mt, unsigned long index,
69 return mtree_insert(mt, index, ptr, GFP_KERNEL);
72 static int __init mtree_test_store_range(struct maple_tree *mt,
73 unsigned long start, unsigned long end, void *ptr)
75 return mtree_store_range(mt, start, end, ptr, GFP_KERNEL);
78 static int __init mtree_test_store(struct maple_tree *mt, unsigned long start,
81 return mtree_test_store_range(mt, start, start, ptr);
84 static int __init mtree_test_insert_range(struct maple_tree *mt,
85 unsigned long start, unsigned long end, void *ptr)
87 return mtree_insert_range(mt, start, end, ptr, GFP_KERNEL);
90 static void __init *mtree_test_load(struct maple_tree *mt, unsigned long index)
92 return mtree_load(mt, index);
95 static void __init *mtree_test_erase(struct maple_tree *mt, unsigned long index)
97 return mtree_erase(mt, index);
100 #if defined(CONFIG_64BIT)
101 static noinline void __init check_mtree_alloc_range(struct maple_tree *mt,
102 unsigned long start, unsigned long end, unsigned long size,
103 unsigned long expected, int eret, void *ptr)
106 unsigned long result = expected + 1;
109 ret = mtree_alloc_range(mt, &result, ptr, size, start, end,
111 MT_BUG_ON(mt, ret != eret);
115 MT_BUG_ON(mt, result != expected);
118 static noinline void __init check_mtree_alloc_rrange(struct maple_tree *mt,
119 unsigned long start, unsigned long end, unsigned long size,
120 unsigned long expected, int eret, void *ptr)
123 unsigned long result = expected + 1;
126 ret = mtree_alloc_rrange(mt, &result, ptr, size, start, end,
128 MT_BUG_ON(mt, ret != eret);
132 MT_BUG_ON(mt, result != expected);
136 static noinline void __init check_load(struct maple_tree *mt,
137 unsigned long index, void *ptr)
139 void *ret = mtree_test_load(mt, index);
142 pr_err("Load %lu returned %p expect %p\n", index, ret, ptr);
143 MT_BUG_ON(mt, ret != ptr);
146 static noinline void __init check_store_range(struct maple_tree *mt,
147 unsigned long start, unsigned long end, void *ptr, int expected)
152 ret = mtree_test_store_range(mt, start, end, ptr);
153 MT_BUG_ON(mt, ret != expected);
158 for (i = start; i <= end; i++)
159 check_load(mt, i, ptr);
162 static noinline void __init check_insert_range(struct maple_tree *mt,
163 unsigned long start, unsigned long end, void *ptr, int expected)
168 ret = mtree_test_insert_range(mt, start, end, ptr);
169 MT_BUG_ON(mt, ret != expected);
174 for (i = start; i <= end; i++)
175 check_load(mt, i, ptr);
178 static noinline void __init check_insert(struct maple_tree *mt,
179 unsigned long index, void *ptr)
183 ret = mtree_test_insert(mt, index, ptr);
184 MT_BUG_ON(mt, ret != 0);
187 static noinline void __init check_dup_insert(struct maple_tree *mt,
188 unsigned long index, void *ptr)
192 ret = mtree_test_insert(mt, index, ptr);
193 MT_BUG_ON(mt, ret != -EEXIST);
197 static noinline void __init check_index_load(struct maple_tree *mt,
200 return check_load(mt, index, xa_mk_value(index & LONG_MAX));
203 static inline __init int not_empty(struct maple_node *node)
210 for (i = 0; i < ARRAY_SIZE(node->slot); i++)
218 static noinline void __init check_rev_seq(struct maple_tree *mt,
219 unsigned long max, bool verbose)
221 unsigned long i = max, j;
223 MT_BUG_ON(mt, !mtree_empty(mt));
225 mt_zero_nr_tallocated();
227 MT_BUG_ON(mt, mtree_insert_index(mt, i, GFP_KERNEL));
228 for (j = i; j <= max; j++)
229 check_index_load(mt, j);
231 check_load(mt, i - 1, NULL);
233 MT_BUG_ON(mt, !mt_height(mt));
235 MT_BUG_ON(mt, !mt_height(mt));
238 check_load(mt, max + 1, NULL);
243 mt_dump(mt, mt_dump_dec);
244 pr_info(" %s test of 0-%lu %luK in %d active (%d total)\n",
245 __func__, max, mt_get_alloc_size()/1024, mt_nr_allocated(),
251 static noinline void __init check_seq(struct maple_tree *mt, unsigned long max,
256 MT_BUG_ON(mt, !mtree_empty(mt));
258 mt_zero_nr_tallocated();
259 for (i = 0; i <= max; i++) {
260 MT_BUG_ON(mt, mtree_insert_index(mt, i, GFP_KERNEL));
261 for (j = 0; j <= i; j++)
262 check_index_load(mt, j);
265 MT_BUG_ON(mt, !mt_height(mt));
266 check_load(mt, i + 1, NULL);
272 mt_dump(mt, mt_dump_dec);
273 pr_info(" seq test of 0-%lu %luK in %d active (%d total)\n",
274 max, mt_get_alloc_size()/1024, mt_nr_allocated(),
280 static noinline void __init check_lb_not_empty(struct maple_tree *mt)
283 unsigned long huge = 4000UL * 1000 * 1000;
288 check_insert(mt, i, (void *) i);
289 for (j = huge; j >= i; j /= 2) {
290 check_load(mt, j-1, NULL);
291 check_load(mt, j, (void *) j);
292 check_load(mt, j+1, NULL);
299 static noinline void __init check_lower_bound_split(struct maple_tree *mt)
301 MT_BUG_ON(mt, !mtree_empty(mt));
302 check_lb_not_empty(mt);
305 static noinline void __init check_upper_bound_split(struct maple_tree *mt)
310 MT_BUG_ON(mt, !mtree_empty(mt));
315 huge = 4000UL * 1000 * 1000;
319 check_insert(mt, i, (void *) i);
320 for (j = i; j >= huge; j *= 2) {
321 check_load(mt, j-1, NULL);
322 check_load(mt, j, (void *) j);
323 check_load(mt, j+1, NULL);
330 static noinline void __init check_mid_split(struct maple_tree *mt)
332 unsigned long huge = 8000UL * 1000 * 1000;
334 check_insert(mt, huge, (void *) huge);
335 check_insert(mt, 0, xa_mk_value(0));
336 check_lb_not_empty(mt);
339 static noinline void __init check_rev_find(struct maple_tree *mt)
341 int i, nr_entries = 200;
343 MA_STATE(mas, mt, 0, 0);
345 for (i = 0; i <= nr_entries; i++)
346 mtree_store_range(mt, i*10, i*10 + 5,
347 xa_mk_value(i), GFP_KERNEL);
351 val = mas_find_rev(&mas, 1000);
352 MT_BUG_ON(mt, val != xa_mk_value(100));
353 val = mas_find_rev(&mas, 1000);
354 MT_BUG_ON(mt, val != NULL);
357 val = mas_find_rev(&mas, 997);
358 MT_BUG_ON(mt, val != NULL);
361 val = mas_find_rev(&mas, 900);
362 MT_BUG_ON(mt, val != xa_mk_value(100));
363 val = mas_find_rev(&mas, 900);
364 MT_BUG_ON(mt, val != xa_mk_value(99));
367 val = mas_find_rev(&mas, 0);
368 MT_BUG_ON(mt, val != xa_mk_value(2));
369 val = mas_find_rev(&mas, 0);
370 MT_BUG_ON(mt, val != xa_mk_value(1));
371 val = mas_find_rev(&mas, 0);
372 MT_BUG_ON(mt, val != xa_mk_value(0));
373 val = mas_find_rev(&mas, 0);
374 MT_BUG_ON(mt, val != NULL);
378 static noinline void __init check_find(struct maple_tree *mt)
380 unsigned long val = 0;
384 unsigned long last = 0, index = 0;
385 void *entry, *entry2;
387 MA_STATE(mas, mt, 0, 0);
390 MT_BUG_ON(mt, mtree_insert_index(mt, val++, GFP_KERNEL));
392 #if defined(CONFIG_64BIT)
393 top = 4398046511104UL;
404 for (int i = 0; i <= count; i++) {
406 MT_BUG_ON(mt, mtree_insert_index(mt, val, GFP_KERNEL));
408 MT_BUG_ON(mt, mtree_insert(mt, val,
409 XA_ZERO_ENTRY, GFP_KERNEL));
417 while ((entry = mas_find(&mas, 268435456)) != NULL) {
419 MT_BUG_ON(mt, xa_mk_value(val) != entry);
421 MT_BUG_ON(mt, entry != XA_ZERO_ENTRY);
424 /* For zero check. */
433 mas_for_each(&mas, entry, ULONG_MAX) {
435 MT_BUG_ON(mt, xa_mk_value(val) != entry);
437 MT_BUG_ON(mt, entry != XA_ZERO_ENTRY);
439 /* For zero check. */
449 mas_for_each(&mas, entry, ULONG_MAX) {
451 MT_BUG_ON(mt, xa_mk_value(val) != entry);
453 MT_BUG_ON(mt, entry != XA_ZERO_ENTRY);
455 /* For zero check. */
466 max = 300; /* A value big enough to include XA_ZERO_ENTRY at 64. */
467 mt_for_each(mt, entry, index, max) {
468 MT_BUG_ON(mt, xa_mk_value(val) != entry);
470 if (val == 64) /* Skip zero entry. */
472 /* For zero check. */
480 MT_BUG_ON(mt, mtree_insert_index(mt, ULONG_MAX, GFP_KERNEL));
481 mt_for_each(mt, entry, index, ULONG_MAX) {
483 MT_BUG_ON(mt, entry != xa_mk_value(LONG_MAX));
485 MT_BUG_ON(mt, xa_mk_value(val) != entry);
487 /* Workaround for 32bit */
488 if ((val << 2) < val)
493 if (val == 64) /* Skip zero entry. */
495 /* For zero check. */
499 MT_BUG_ON(mt, max > 25);
501 mtree_erase_index(mt, ULONG_MAX);
505 entry = mt_find(mt, &index, 512);
506 MT_BUG_ON(mt, xa_mk_value(256) != entry);
510 entry = mt_find(mt, &index, 20);
511 MT_BUG_ON(mt, entry != NULL);
515 /* Insert ULONG_MAX */
516 MT_BUG_ON(mt, mtree_insert_index(mt, ULONG_MAX, GFP_KERNEL));
521 mas_for_each(&mas, entry, ULONG_MAX) {
523 MT_BUG_ON(mt, entry != XA_ZERO_ENTRY);
525 MT_BUG_ON(mt, entry != xa_mk_value(LONG_MAX));
527 MT_BUG_ON(mt, xa_mk_value(val) != entry);
529 /* Workaround for 32bit */
530 if ((val << 2) < val)
535 /* For zero check. */
544 mas_set(&mas, 1048576);
546 entry = mas_find(&mas, 1048576);
548 MT_BUG_ON(mas.tree, entry == NULL);
552 * 1. get the expected value, leveraging the existence of an end entry
553 * 2. delete end entry
554 * 3. find the last value but searching for ULONG_MAX and then using
557 /* First, get the expected result. */
560 mas.index = ULONG_MAX; /* start at max.. */
561 entry = mas_find(&mas, ULONG_MAX);
562 entry = mas_prev(&mas, 0);
566 /* Erase the last entry. */
568 mas.index = ULONG_MAX;
569 mas.last = ULONG_MAX;
572 /* Get the previous value from MAS_START */
574 entry2 = mas_prev(&mas, 0);
577 MT_BUG_ON(mt, entry != entry2);
578 MT_BUG_ON(mt, index != mas.index);
579 MT_BUG_ON(mt, last != mas.last);
583 mas.index = ULONG_MAX;
584 mas.last = ULONG_MAX;
585 entry2 = mas_prev(&mas, 0);
586 MT_BUG_ON(mt, entry != entry2);
589 MT_BUG_ON(mt, mas_prev(&mas, 0) != NULL);
595 static noinline void __init check_find_2(struct maple_tree *mt)
600 MA_STATE(mas, mt, 0, 0);
602 mas_for_each(&mas, entry, ULONG_MAX)
606 for (i = 0; i < 256; i++) {
607 mtree_insert_index(mt, i, GFP_KERNEL);
611 mas_for_each(&mas, entry, ULONG_MAX) {
612 MT_BUG_ON(mt, entry != xa_mk_value(j));
616 MT_BUG_ON(mt, j != i + 1);
619 for (i = 0; i < 256; i++) {
620 mtree_erase_index(mt, i);
624 mas_for_each(&mas, entry, ULONG_MAX) {
625 if (xa_is_zero(entry))
628 MT_BUG_ON(mt, entry != xa_mk_value(j));
632 MT_BUG_ON(mt, j != 256);
635 /*MT_BUG_ON(mt, !mtree_empty(mt)); */
639 #if defined(CONFIG_64BIT)
640 static noinline void __init check_alloc_rev_range(struct maple_tree *mt)
644 * cat /proc/self/maps | awk '{print $1}'|
645 * awk -F "-" '{printf "0x%s, 0x%s, ", $1, $2}'
648 static const unsigned long range[] = {
649 /* Inclusive , Exclusive. */
650 0x565234af2000, 0x565234af4000,
651 0x565234af4000, 0x565234af9000,
652 0x565234af9000, 0x565234afb000,
653 0x565234afc000, 0x565234afd000,
654 0x565234afd000, 0x565234afe000,
655 0x565235def000, 0x565235e10000,
656 0x7f36d4bfd000, 0x7f36d4ee2000,
657 0x7f36d4ee2000, 0x7f36d4f04000,
658 0x7f36d4f04000, 0x7f36d504c000,
659 0x7f36d504c000, 0x7f36d5098000,
660 0x7f36d5098000, 0x7f36d5099000,
661 0x7f36d5099000, 0x7f36d509d000,
662 0x7f36d509d000, 0x7f36d509f000,
663 0x7f36d509f000, 0x7f36d50a5000,
664 0x7f36d50b9000, 0x7f36d50db000,
665 0x7f36d50db000, 0x7f36d50dc000,
666 0x7f36d50dc000, 0x7f36d50fa000,
667 0x7f36d50fa000, 0x7f36d5102000,
668 0x7f36d5102000, 0x7f36d5103000,
669 0x7f36d5103000, 0x7f36d5104000,
670 0x7f36d5104000, 0x7f36d5105000,
671 0x7fff5876b000, 0x7fff5878d000,
672 0x7fff5878e000, 0x7fff58791000,
673 0x7fff58791000, 0x7fff58793000,
676 static const unsigned long holes[] = {
678 * Note: start of hole is INCLUSIVE
679 * end of hole is EXCLUSIVE
680 * (opposite of the above table.)
681 * Start of hole, end of hole, size of hole (+1)
683 0x565234afb000, 0x565234afc000, 0x1000,
684 0x565234afe000, 0x565235def000, 0x12F1000,
685 0x565235e10000, 0x7f36d4bfd000, 0x28E49EDED000,
689 * req_range consists of 4 values.
693 * 4. number that should be returned.
696 static const unsigned long req_range[] = {
697 0x565234af9000, /* Min */
698 0x7fff58791000, /* Max */
700 0x7fff5878d << 12, /* First rev hole of size 0x1000 */
701 0, /* Return value success. */
704 0x565234AF0 << 12, /* Max */
706 0x565234AEE << 12, /* max - 3. */
707 0, /* Return value success. */
712 562949953421311 << 12,/* First rev hole of size 0x1000 */
713 0, /* Return value success. */
716 0x7F36D5109 << 12, /* Max */
718 0x7F36D5106 << 12, /* First rev hole of size 0x4000 */
719 0, /* Return value success. */
730 18446744073709551615UL,
731 562915594369134UL << 12,
735 /* Single space test. */
743 int i, range_count = ARRAY_SIZE(range);
744 int req_range_count = ARRAY_SIZE(req_range);
745 unsigned long min = 0;
747 MA_STATE(mas, mt, 0, 0);
749 mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY,
751 #define DEBUG_REV_RANGE 0
752 for (i = 0; i < range_count; i += 2) {
753 /* Inclusive, Inclusive (with the -1) */
756 pr_debug("\t%s: Insert %lu-%lu\n", __func__, range[i] >> 12,
757 (range[i + 1] >> 12) - 1);
759 check_insert_range(mt, range[i] >> 12, (range[i + 1] >> 12) - 1,
760 xa_mk_value(range[i] >> 12), 0);
766 for (i = 0; i < ARRAY_SIZE(holes); i += 3) {
768 pr_debug("Search from %lu-%lu for gap %lu should be at %lu\n",
769 min, holes[i+1]>>12, holes[i+2]>>12,
772 MT_BUG_ON(mt, mas_empty_area_rev(&mas, min,
776 pr_debug("Found %lu %lu\n", mas.index, mas.last);
777 pr_debug("gap %lu %lu\n", (holes[i] >> 12),
780 MT_BUG_ON(mt, mas.last + 1 != (holes[i+1] >> 12));
781 MT_BUG_ON(mt, mas.index != (holes[i+1] >> 12) - (holes[i+2] >> 12));
782 min = holes[i+1] >> 12;
787 for (i = 0; i < req_range_count; i += 5) {
789 pr_debug("\tReverse request %d between %lu-%lu size %lu, should get %lu\n",
790 i, req_range[i] >> 12,
791 (req_range[i + 1] >> 12),
792 req_range[i+2] >> 12,
793 req_range[i+3] >> 12);
795 check_mtree_alloc_rrange(mt,
796 req_range[i] >> 12, /* start */
797 req_range[i+1] >> 12, /* end */
798 req_range[i+2] >> 12, /* size */
799 req_range[i+3] >> 12, /* expected address */
800 req_range[i+4], /* expected return */
801 xa_mk_value(req_range[i] >> 12)); /* pointer */
805 mt_set_non_kernel(1);
806 mtree_erase(mt, 34148798727); /* create a deleted range. */
807 mtree_erase(mt, 34148798725);
808 check_mtree_alloc_rrange(mt, 0, 34359052173, 210253414,
814 static noinline void __init check_alloc_range(struct maple_tree *mt)
818 * cat /proc/self/maps|awk '{print $1}'|
819 * awk -F "-" '{printf "0x%s, 0x%s, ", $1, $2}'
822 static const unsigned long range[] = {
823 /* Inclusive , Exclusive. */
824 0x565234af2000, 0x565234af4000,
825 0x565234af4000, 0x565234af9000,
826 0x565234af9000, 0x565234afb000,
827 0x565234afc000, 0x565234afd000,
828 0x565234afd000, 0x565234afe000,
829 0x565235def000, 0x565235e10000,
830 0x7f36d4bfd000, 0x7f36d4ee2000,
831 0x7f36d4ee2000, 0x7f36d4f04000,
832 0x7f36d4f04000, 0x7f36d504c000,
833 0x7f36d504c000, 0x7f36d5098000,
834 0x7f36d5098000, 0x7f36d5099000,
835 0x7f36d5099000, 0x7f36d509d000,
836 0x7f36d509d000, 0x7f36d509f000,
837 0x7f36d509f000, 0x7f36d50a5000,
838 0x7f36d50b9000, 0x7f36d50db000,
839 0x7f36d50db000, 0x7f36d50dc000,
840 0x7f36d50dc000, 0x7f36d50fa000,
841 0x7f36d50fa000, 0x7f36d5102000,
842 0x7f36d5102000, 0x7f36d5103000,
843 0x7f36d5103000, 0x7f36d5104000,
844 0x7f36d5104000, 0x7f36d5105000,
845 0x7fff5876b000, 0x7fff5878d000,
846 0x7fff5878e000, 0x7fff58791000,
847 0x7fff58791000, 0x7fff58793000,
849 static const unsigned long holes[] = {
850 /* Start of hole, end of hole, size of hole (+1) */
851 0x565234afb000, 0x565234afc000, 0x1000,
852 0x565234afe000, 0x565235def000, 0x12F1000,
853 0x565235e10000, 0x7f36d4bfd000, 0x28E49EDED000,
857 * req_range consists of 4 values.
861 * 4. number that should be returned.
864 static const unsigned long req_range[] = {
865 0x565234af9000, /* Min */
866 0x7fff58791000, /* Max */
868 0x565234afb000, /* First hole in our data of size 1000. */
869 0, /* Return value success. */
872 0x7fff58791000, /* Max */
874 0x0, /* First hole in our data of size 2000. */
875 0, /* Return value success. */
878 34148797436 << 12, /* Min */
879 0x7fff587AF000, /* Max */
881 34148798629 << 12, /* Expected location */
882 0, /* Return value success. */
885 34148798623 << 12, /* Min */
886 34148798683 << 12, /* Max */
888 0, /* Expected location */
889 -EBUSY, /* Return value failed. */
891 /* Test filling entire gap. */
892 34148798623 << 12, /* Min */
893 0x7fff587AF000, /* Max */
895 34148798632 << 12, /* Expected location */
896 0, /* Return value success. */
898 /* Test walking off the end of root. */
902 0, /* Expected location */
903 -EBUSY, /* Return value failure. */
905 /* Test looking for too large a hole across entire range. */
908 4503599618982063UL << 12, /* Size */
909 34359052178 << 12, /* Expected location */
910 -EBUSY, /* Return failure. */
912 /* Test a single entry */
913 34148798648 << 12, /* Min */
914 34148798648 << 12, /* Max */
915 4096, /* Size of 1 */
916 34148798648 << 12, /* Location is the same as min/max */
919 int i, range_count = ARRAY_SIZE(range);
920 int req_range_count = ARRAY_SIZE(req_range);
921 unsigned long min = 0x565234af2000;
922 MA_STATE(mas, mt, 0, 0);
924 mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY,
926 for (i = 0; i < range_count; i += 2) {
927 #define DEBUG_ALLOC_RANGE 0
928 #if DEBUG_ALLOC_RANGE
929 pr_debug("\tInsert %lu-%lu\n", range[i] >> 12,
930 (range[i + 1] >> 12) - 1);
931 mt_dump(mt, mt_dump_hex);
933 check_insert_range(mt, range[i] >> 12, (range[i + 1] >> 12) - 1,
934 xa_mk_value(range[i] >> 12), 0);
941 for (i = 0; i < ARRAY_SIZE(holes); i += 3) {
943 #if DEBUG_ALLOC_RANGE
944 pr_debug("\tGet empty %lu-%lu size %lu (%lx-%lx)\n", min >> 12,
945 holes[i+1] >> 12, holes[i+2] >> 12,
948 MT_BUG_ON(mt, mas_empty_area(&mas, min >> 12,
951 MT_BUG_ON(mt, mas.index != holes[i] >> 12);
956 for (i = 0; i < req_range_count; i += 5) {
957 #if DEBUG_ALLOC_RANGE
958 pr_debug("\tTest %d: %lu-%lu size %lu expected %lu (%lu-%lu)\n",
959 i/5, req_range[i] >> 12, req_range[i + 1] >> 12,
960 req_range[i + 2] >> 12, req_range[i + 3] >> 12,
961 req_range[i], req_range[i+1]);
963 check_mtree_alloc_range(mt,
964 req_range[i] >> 12, /* start */
965 req_range[i+1] >> 12, /* end */
966 req_range[i+2] >> 12, /* size */
967 req_range[i+3] >> 12, /* expected address */
968 req_range[i+4], /* expected return */
969 xa_mk_value(req_range[i] >> 12)); /* pointer */
971 #if DEBUG_ALLOC_RANGE
972 mt_dump(mt, mt_dump_hex);
980 static noinline void __init check_ranges(struct maple_tree *mt)
983 static const unsigned long r[] = {
986 17, 22, /* Overlaps previous range. */
993 MT_BUG_ON(mt, !mtree_empty(mt));
994 check_insert_range(mt, r[0], r[1], xa_mk_value(r[0]), 0);
995 check_insert_range(mt, r[2], r[3], xa_mk_value(r[2]), 0);
996 check_insert_range(mt, r[4], r[5], xa_mk_value(r[4]), -EEXIST);
997 MT_BUG_ON(mt, !mt_height(mt));
999 check_store_range(mt, r[4], r[5], xa_mk_value(r[4]), 0);
1000 check_store_range(mt, r[6], r[7], xa_mk_value(r[6]), 0);
1001 check_store_range(mt, r[8], r[9], xa_mk_value(r[8]), 0);
1002 MT_BUG_ON(mt, !mt_height(mt));
1004 MT_BUG_ON(mt, mt_height(mt));
1006 check_seq(mt, 50, false);
1007 mt_set_non_kernel(4);
1008 check_store_range(mt, 5, 47, xa_mk_value(47), 0);
1009 MT_BUG_ON(mt, !mt_height(mt));
1012 /* Create tree of 1-100 */
1013 check_seq(mt, 100, false);
1015 mt_set_non_kernel(10);
1016 check_store_range(mt, r[10], r[11], xa_mk_value(r[10]), 0);
1017 MT_BUG_ON(mt, !mt_height(mt));
1020 /* Create tree of 1-200 */
1021 check_seq(mt, 200, false);
1023 check_store_range(mt, r[10], r[11], xa_mk_value(r[10]), 0);
1024 MT_BUG_ON(mt, !mt_height(mt));
1027 check_seq(mt, 30, false);
1028 check_store_range(mt, 6, 18, xa_mk_value(6), 0);
1029 MT_BUG_ON(mt, !mt_height(mt));
1032 /* Overwrite across multiple levels. */
1033 /* Create tree of 1-400 */
1034 check_seq(mt, 400, false);
1035 mt_set_non_kernel(50);
1037 check_store_range(mt, r[12], r[13], xa_mk_value(r[12]), 0);
1038 mt_set_non_kernel(50);
1039 mtree_test_erase(mt, 140);
1040 mtree_test_erase(mt, 141);
1041 mtree_test_erase(mt, 142);
1042 mtree_test_erase(mt, 143);
1043 mtree_test_erase(mt, 130);
1044 mtree_test_erase(mt, 131);
1045 mtree_test_erase(mt, 132);
1046 mtree_test_erase(mt, 133);
1047 mtree_test_erase(mt, 134);
1048 mtree_test_erase(mt, 135);
1049 check_load(mt, r[12], xa_mk_value(r[12]));
1050 check_load(mt, r[13], xa_mk_value(r[12]));
1051 check_load(mt, r[13] - 1, xa_mk_value(r[12]));
1052 check_load(mt, r[13] + 1, xa_mk_value(r[13] + 1));
1053 check_load(mt, 135, NULL);
1054 check_load(mt, 140, NULL);
1055 mt_set_non_kernel(0);
1056 MT_BUG_ON(mt, !mt_height(mt));
1061 /* Overwrite multiple levels at the end of the tree (slot 7) */
1062 mt_set_non_kernel(50);
1063 check_seq(mt, 400, false);
1064 check_store_range(mt, 353, 361, xa_mk_value(353), 0);
1065 check_store_range(mt, 347, 352, xa_mk_value(347), 0);
1067 check_load(mt, 346, xa_mk_value(346));
1068 for (i = 347; i <= 352; i++)
1069 check_load(mt, i, xa_mk_value(347));
1070 for (i = 353; i <= 361; i++)
1071 check_load(mt, i, xa_mk_value(353));
1072 check_load(mt, 362, xa_mk_value(362));
1073 mt_set_non_kernel(0);
1074 MT_BUG_ON(mt, !mt_height(mt));
1077 mt_set_non_kernel(50);
1078 check_seq(mt, 400, false);
1079 check_store_range(mt, 352, 364, NULL, 0);
1080 check_store_range(mt, 351, 363, xa_mk_value(352), 0);
1081 check_load(mt, 350, xa_mk_value(350));
1082 check_load(mt, 351, xa_mk_value(352));
1083 for (i = 352; i <= 363; i++)
1084 check_load(mt, i, xa_mk_value(352));
1085 check_load(mt, 364, NULL);
1086 check_load(mt, 365, xa_mk_value(365));
1087 mt_set_non_kernel(0);
1088 MT_BUG_ON(mt, !mt_height(mt));
1091 mt_set_non_kernel(5);
1092 check_seq(mt, 400, false);
1093 check_store_range(mt, 352, 364, NULL, 0);
1094 check_store_range(mt, 351, 364, xa_mk_value(352), 0);
1095 check_load(mt, 350, xa_mk_value(350));
1096 check_load(mt, 351, xa_mk_value(352));
1097 for (i = 352; i <= 364; i++)
1098 check_load(mt, i, xa_mk_value(352));
1099 check_load(mt, 365, xa_mk_value(365));
1100 mt_set_non_kernel(0);
1101 MT_BUG_ON(mt, !mt_height(mt));
1105 mt_set_non_kernel(50);
1106 check_seq(mt, 400, false);
1107 check_store_range(mt, 362, 367, xa_mk_value(362), 0);
1108 check_store_range(mt, 353, 361, xa_mk_value(353), 0);
1109 mt_set_non_kernel(0);
1111 MT_BUG_ON(mt, !mt_height(mt));
1114 * Interesting cases:
1115 * 1. Overwrite the end of a node and end in the first entry of the next
1117 * 2. Split a single range
1118 * 3. Overwrite the start of a range
1119 * 4. Overwrite the end of a range
1120 * 5. Overwrite the entire range
1121 * 6. Overwrite a range that causes multiple parent nodes to be
1123 * 7. Overwrite a range that causes multiple parent nodes and part of
1124 * root to be combined
1125 * 8. Overwrite the whole tree
1126 * 9. Try to overwrite the zero entry of an alloc tree.
1127 * 10. Write a range larger than a nodes current pivot
1130 mt_set_non_kernel(50);
1131 for (i = 0; i <= 500; i++) {
1134 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1136 check_store_range(mt, 2400, 2400, xa_mk_value(2400), 0);
1137 check_store_range(mt, 2411, 2411, xa_mk_value(2411), 0);
1138 check_store_range(mt, 2412, 2412, xa_mk_value(2412), 0);
1139 check_store_range(mt, 2396, 2400, xa_mk_value(4052020), 0);
1140 check_store_range(mt, 2402, 2402, xa_mk_value(2402), 0);
1142 mt_set_non_kernel(0);
1144 mt_set_non_kernel(50);
1145 for (i = 0; i <= 500; i++) {
1148 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1150 check_store_range(mt, 2422, 2422, xa_mk_value(2422), 0);
1151 check_store_range(mt, 2424, 2424, xa_mk_value(2424), 0);
1152 check_store_range(mt, 2425, 2425, xa_mk_value(2), 0);
1153 check_store_range(mt, 2460, 2470, NULL, 0);
1154 check_store_range(mt, 2435, 2460, xa_mk_value(2435), 0);
1155 check_store_range(mt, 2461, 2470, xa_mk_value(2461), 0);
1156 mt_set_non_kernel(0);
1157 MT_BUG_ON(mt, !mt_height(mt));
1160 /* Test rebalance gaps */
1161 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1162 mt_set_non_kernel(50);
1163 for (i = 0; i <= 50; i++) {
1166 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1168 check_store_range(mt, 161, 161, xa_mk_value(161), 0);
1169 check_store_range(mt, 162, 162, xa_mk_value(162), 0);
1170 check_store_range(mt, 163, 163, xa_mk_value(163), 0);
1171 check_store_range(mt, 240, 249, NULL, 0);
1172 mtree_erase(mt, 200);
1173 mtree_erase(mt, 210);
1174 mtree_erase(mt, 220);
1175 mtree_erase(mt, 230);
1176 mt_set_non_kernel(0);
1177 MT_BUG_ON(mt, !mt_height(mt));
1180 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1181 for (i = 0; i <= 500; i++) {
1184 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1186 check_store_range(mt, 4600, 4959, xa_mk_value(1), 0);
1188 MT_BUG_ON(mt, !mt_height(mt));
1191 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1192 for (i = 0; i <= 500; i++) {
1195 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1197 check_store_range(mt, 4811, 4811, xa_mk_value(4811), 0);
1198 check_store_range(mt, 4812, 4812, xa_mk_value(4812), 0);
1199 check_store_range(mt, 4861, 4861, xa_mk_value(4861), 0);
1200 check_store_range(mt, 4862, 4862, xa_mk_value(4862), 0);
1201 check_store_range(mt, 4842, 4849, NULL, 0);
1203 MT_BUG_ON(mt, !mt_height(mt));
1206 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1207 for (i = 0; i <= 1300; i++) {
1210 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1211 MT_BUG_ON(mt, mt_height(mt) >= 4);
1213 /* Cause a 3 child split all the way up the tree. */
1214 for (i = 5; i < 215; i += 10)
1215 check_store_range(mt, 11450 + i, 11450 + i + 1, NULL, 0);
1216 for (i = 5; i < 65; i += 10)
1217 check_store_range(mt, 11770 + i, 11770 + i + 1, NULL, 0);
1219 MT_BUG_ON(mt, mt_height(mt) >= 4);
1220 for (i = 5; i < 45; i += 10)
1221 check_store_range(mt, 11700 + i, 11700 + i + 1, NULL, 0);
1223 MT_BUG_ON(mt, mt_height(mt) < 4);
1227 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1228 for (i = 0; i <= 1200; i++) {
1231 check_store_range(mt, val, val2, xa_mk_value(val), 0);
1232 MT_BUG_ON(mt, mt_height(mt) >= 4);
1234 /* Fill parents and leaves before split. */
1235 for (i = 5; i < 455; i += 10)
1236 check_store_range(mt, 7800 + i, 7800 + i + 1, NULL, 0);
1238 for (i = 1; i < 16; i++)
1239 check_store_range(mt, 8185 + i, 8185 + i + 1,
1240 xa_mk_value(8185+i), 0);
1241 MT_BUG_ON(mt, mt_height(mt) >= 4);
1242 /* triple split across multiple levels. */
1243 check_store_range(mt, 8184, 8184, xa_mk_value(8184), 0);
1245 MT_BUG_ON(mt, mt_height(mt) != 4);
1248 static noinline void __init check_next_entry(struct maple_tree *mt)
1251 unsigned long limit = 30, i = 0;
1252 MA_STATE(mas, mt, i, i);
1254 MT_BUG_ON(mt, !mtree_empty(mt));
1256 check_seq(mt, limit, false);
1259 /* Check the first one and get ma_state in the correct state. */
1260 MT_BUG_ON(mt, mas_walk(&mas) != xa_mk_value(i++));
1261 for ( ; i <= limit + 1; i++) {
1262 entry = mas_next(&mas, limit);
1264 MT_BUG_ON(mt, entry != NULL);
1266 MT_BUG_ON(mt, xa_mk_value(i) != entry);
1272 static noinline void __init check_prev_entry(struct maple_tree *mt)
1274 unsigned long index = 16;
1278 MA_STATE(mas, mt, index, index);
1280 MT_BUG_ON(mt, !mtree_empty(mt));
1281 check_seq(mt, 30, false);
1284 value = mas_find(&mas, ULONG_MAX);
1285 MT_BUG_ON(mt, value != xa_mk_value(index));
1286 value = mas_prev(&mas, 0);
1287 MT_BUG_ON(mt, value != xa_mk_value(index - 1));
1291 /* Check limits on prev */
1292 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1294 for (i = 0; i <= index; i++) {
1295 mas_set_range(&mas, i*10, i*10+5);
1296 mas_store_gfp(&mas, xa_mk_value(i), GFP_KERNEL);
1300 value = mas_walk(&mas);
1301 MT_BUG_ON(mt, value != xa_mk_value(2));
1303 value = mas_prev(&mas, 19);
1304 MT_BUG_ON(mt, value != NULL);
1307 value = mas_walk(&mas);
1308 MT_BUG_ON(mt, value != xa_mk_value(8));
1310 value = mas_prev(&mas, 76);
1311 MT_BUG_ON(mt, value != NULL);
1316 static noinline void __init check_root_expand(struct maple_tree *mt)
1318 MA_STATE(mas, mt, 0, 0);
1324 ptr = mas_walk(&mas);
1325 MT_BUG_ON(mt, mas.index != 0);
1326 MT_BUG_ON(mt, ptr != NULL);
1327 MT_BUG_ON(mt, mas.index != 0);
1328 MT_BUG_ON(mt, mas.last != ULONG_MAX);
1330 ptr = &check_prev_entry;
1332 mas_store_gfp(&mas, ptr, GFP_KERNEL);
1335 ptr = mas_walk(&mas);
1336 MT_BUG_ON(mt, ptr != NULL);
1339 ptr = mas_walk(&mas);
1340 MT_BUG_ON(mt, ptr != &check_prev_entry);
1343 ptr = mas_walk(&mas);
1344 MT_BUG_ON(mt, ptr != NULL);
1349 mt_init_flags(mt, 0);
1353 ptr = &check_prev_entry;
1354 mas_store_gfp(&mas, ptr, GFP_KERNEL);
1357 ptr = mas_walk(&mas);
1358 MT_BUG_ON(mt, ptr != NULL);
1359 MT_BUG_ON(mt, mas.index != 1);
1360 MT_BUG_ON(mt, mas.last != ULONG_MAX);
1362 mas_set_range(&mas, 0, 100);
1363 ptr = mas_walk(&mas);
1364 MT_BUG_ON(mt, ptr != &check_prev_entry);
1365 MT_BUG_ON(mt, mas.last != 0);
1369 mt_init_flags(mt, 0);
1373 ptr = (void *)((unsigned long) check_prev_entry | 1UL);
1374 mas_store_gfp(&mas, ptr, GFP_KERNEL);
1375 ptr = mas_next(&mas, ULONG_MAX);
1376 MT_BUG_ON(mt, ptr != NULL);
1377 MT_BUG_ON(mt, (mas.index != 1) && (mas.last != ULONG_MAX));
1380 ptr = mas_prev(&mas, 0);
1381 MT_BUG_ON(mt, (mas.index != 0) && (mas.last != 0));
1382 MT_BUG_ON(mt, ptr != (void *)((unsigned long) check_prev_entry | 1UL));
1388 mt_init_flags(mt, 0);
1391 ptr = (void *)((unsigned long) check_prev_entry | 2UL);
1392 mas_store_gfp(&mas, ptr, GFP_KERNEL);
1393 ptr = mas_next(&mas, ULONG_MAX);
1394 MT_BUG_ON(mt, ptr != NULL);
1395 MT_BUG_ON(mt, (mas.index != ULONG_MAX) && (mas.last != ULONG_MAX));
1398 ptr = mas_prev(&mas, 0);
1399 MT_BUG_ON(mt, (mas.index != 0) && (mas.last != 0));
1400 MT_BUG_ON(mt, ptr != (void *)((unsigned long) check_prev_entry | 2UL));
1406 static noinline void __init check_gap_combining(struct maple_tree *mt)
1408 struct maple_enode *mn1, *mn2;
1410 unsigned long singletons = 100;
1411 static const unsigned long *seq100;
1412 static const unsigned long seq100_64[] = {
1426 static const unsigned long seq100_32[] = {
1440 static const unsigned long seq2000[] = {
1444 static const unsigned long seq400[] = {
1446 256, 260, 266, 270, 275, 280, 290, 398,
1450 unsigned long index;
1452 MA_STATE(mas, mt, 0, 0);
1460 mas_set(&mas, index);
1461 MT_BUG_ON(mt, !mtree_empty(mt));
1462 check_seq(mt, singletons, false); /* create 100 singletons. */
1464 mt_set_non_kernel(1);
1465 mtree_test_erase(mt, seq100[2]);
1466 check_load(mt, seq100[2], NULL);
1467 mtree_test_erase(mt, seq100[1]);
1468 check_load(mt, seq100[1], NULL);
1471 entry = mas_find(&mas, ULONG_MAX);
1472 MT_BUG_ON(mt, entry != xa_mk_value(index));
1474 mas_next(&mas, ULONG_MAX);
1475 entry = mas_next(&mas, ULONG_MAX);
1476 MT_BUG_ON(mt, entry != xa_mk_value(index + 4));
1478 MT_BUG_ON(mt, mn1 == mn2); /* test the test. */
1481 * At this point, there is a gap of 2 at index + 1 between seq100[3] and
1482 * seq100[4]. Search for the gap.
1484 mt_set_non_kernel(1);
1486 MT_BUG_ON(mt, mas_empty_area_rev(&mas, seq100[3], seq100[4],
1488 MT_BUG_ON(mt, mas.index != index + 1);
1491 mtree_test_erase(mt, seq100[6]);
1492 check_load(mt, seq100[6], NULL);
1493 mtree_test_erase(mt, seq100[7]);
1494 check_load(mt, seq100[7], NULL);
1495 mtree_test_erase(mt, seq100[8]);
1502 entry = mas_find(&mas, ULONG_MAX);
1503 MT_BUG_ON(mt, entry != xa_mk_value(index));
1505 entry = mas_next(&mas, ULONG_MAX);
1506 MT_BUG_ON(mt, entry != xa_mk_value(index + 4));
1507 mas_next(&mas, ULONG_MAX); /* go to the next entry. */
1509 MT_BUG_ON(mt, mn1 == mn2); /* test the next entry is in the next node. */
1512 * At this point, there is a gap of 3 at seq100[6]. Find it by
1513 * searching 20 - 50 for size 3.
1516 MT_BUG_ON(mt, mas_empty_area_rev(&mas, seq100[10], seq100[11],
1518 MT_BUG_ON(mt, mas.index != seq100[6]);
1521 mt_set_non_kernel(1);
1522 mtree_store(mt, seq100[13], NULL, GFP_KERNEL);
1523 check_load(mt, seq100[13], NULL);
1524 check_load(mt, seq100[14], xa_mk_value(seq100[14]));
1525 mtree_store(mt, seq100[14], NULL, GFP_KERNEL);
1526 check_load(mt, seq100[13], NULL);
1527 check_load(mt, seq100[14], NULL);
1531 MT_BUG_ON(mt, mas_empty_area_rev(&mas, seq100[16], seq100[15],
1533 MT_BUG_ON(mt, mas.index != seq100[13]);
1538 * *DEPRECATED: no retries anymore* Test retry entry in the start of a
1541 mt_set_non_kernel(2);
1542 mtree_test_store_range(mt, seq100[18], seq100[14], NULL);
1543 mtree_test_erase(mt, seq100[15]);
1546 MT_BUG_ON(mt, mas_empty_area_rev(&mas, seq100[16], seq100[19],
1549 MT_BUG_ON(mt, mas.index != seq100[18]);
1553 /* seq 2000 tests are for multi-level tree gaps */
1554 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1555 check_seq(mt, 2000, false);
1556 mt_set_non_kernel(1);
1557 mtree_test_erase(mt, seq2000[0]);
1558 mtree_test_erase(mt, seq2000[1]);
1560 mt_set_non_kernel(2);
1563 MT_BUG_ON(mt, mas_empty_area_rev(&mas, seq2000[2], seq2000[3],
1565 MT_BUG_ON(mt, mas.index != seq2000[1]);
1570 /* seq 400 tests rebalancing over two levels. */
1571 mt_set_non_kernel(99);
1572 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1573 check_seq(mt, 400, false);
1574 mtree_test_store_range(mt, seq400[0], seq400[1], NULL);
1575 mt_set_non_kernel(0);
1578 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
1579 check_seq(mt, 400, false);
1580 mt_set_non_kernel(50);
1581 mtree_test_store_range(mt, seq400[2], seq400[9],
1582 xa_mk_value(seq400[2]));
1583 mtree_test_store_range(mt, seq400[3], seq400[9],
1584 xa_mk_value(seq400[3]));
1585 mtree_test_store_range(mt, seq400[4], seq400[9],
1586 xa_mk_value(seq400[4]));
1587 mtree_test_store_range(mt, seq400[5], seq400[9],
1588 xa_mk_value(seq400[5]));
1589 mtree_test_store_range(mt, seq400[0], seq400[9],
1590 xa_mk_value(seq400[0]));
1591 mtree_test_store_range(mt, seq400[6], seq400[9],
1592 xa_mk_value(seq400[6]));
1593 mtree_test_store_range(mt, seq400[7], seq400[9],
1594 xa_mk_value(seq400[7]));
1595 mtree_test_store_range(mt, seq400[8], seq400[9],
1596 xa_mk_value(seq400[8]));
1597 mtree_test_store_range(mt, seq400[10], seq400[11],
1598 xa_mk_value(seq400[10]));
1600 mt_set_non_kernel(0);
1603 static noinline void __init check_node_overwrite(struct maple_tree *mt)
1607 for (i = 0; i < max; i++)
1608 mtree_test_store_range(mt, i*100, i*100 + 50, xa_mk_value(i*100));
1610 mtree_test_store_range(mt, 319951, 367950, NULL);
1611 /*mt_dump(mt, mt_dump_dec); */
1615 #if defined(BENCH_SLOT_STORE)
1616 static noinline void __init bench_slot_store(struct maple_tree *mt)
1618 int i, brk = 105, max = 1040, brk_start = 100, count = 20000000;
1620 for (i = 0; i < max; i += 10)
1621 mtree_store_range(mt, i, i + 5, xa_mk_value(i), GFP_KERNEL);
1623 for (i = 0; i < count; i++) {
1624 mtree_store_range(mt, brk, brk, NULL, GFP_KERNEL);
1625 mtree_store_range(mt, brk_start, brk, xa_mk_value(brk),
1631 #if defined(BENCH_NODE_STORE)
1632 static noinline void __init bench_node_store(struct maple_tree *mt)
1634 int i, overwrite = 76, max = 240, count = 20000000;
1636 for (i = 0; i < max; i += 10)
1637 mtree_store_range(mt, i, i + 5, xa_mk_value(i), GFP_KERNEL);
1639 for (i = 0; i < count; i++) {
1640 mtree_store_range(mt, overwrite, overwrite + 15,
1641 xa_mk_value(overwrite), GFP_KERNEL);
1644 if (overwrite >= 135)
1650 #if defined(BENCH_AWALK)
1651 static noinline void __init bench_awalk(struct maple_tree *mt)
1653 int i, max = 2500, count = 50000000;
1654 MA_STATE(mas, mt, 1470, 1470);
1656 for (i = 0; i < max; i += 10)
1657 mtree_store_range(mt, i, i + 5, xa_mk_value(i), GFP_KERNEL);
1659 mtree_store_range(mt, 1470, 1475, NULL, GFP_KERNEL);
1661 for (i = 0; i < count; i++) {
1662 mas_empty_area_rev(&mas, 0, 2000, 10);
1667 #if defined(BENCH_WALK)
1668 static noinline void __init bench_walk(struct maple_tree *mt)
1670 int i, max = 2500, count = 550000000;
1671 MA_STATE(mas, mt, 1470, 1470);
1673 for (i = 0; i < max; i += 10)
1674 mtree_store_range(mt, i, i + 5, xa_mk_value(i), GFP_KERNEL);
1676 for (i = 0; i < count; i++) {
1684 #if defined(BENCH_MT_FOR_EACH)
1685 static noinline void __init bench_mt_for_each(struct maple_tree *mt)
1687 int i, count = 1000000;
1688 unsigned long max = 2500, index = 0;
1691 for (i = 0; i < max; i += 5)
1692 mtree_store_range(mt, i, i + 4, xa_mk_value(i), GFP_KERNEL);
1694 for (i = 0; i < count; i++) {
1695 unsigned long j = 0;
1697 mt_for_each(mt, entry, index, max) {
1698 MT_BUG_ON(mt, entry != xa_mk_value(j));
1708 /* check_forking - simulate the kernel forking sequence with the tree. */
1709 static noinline void __init check_forking(struct maple_tree *mt)
1712 struct maple_tree newmt;
1713 int i, nr_entries = 134;
1715 MA_STATE(mas, mt, 0, 0);
1716 MA_STATE(newmas, mt, 0, 0);
1718 for (i = 0; i <= nr_entries; i++)
1719 mtree_store_range(mt, i*10, i*10 + 5,
1720 xa_mk_value(i), GFP_KERNEL);
1722 mt_set_non_kernel(99999);
1723 mt_init_flags(&newmt, MT_FLAGS_ALLOC_RANGE);
1724 newmas.tree = &newmt;
1730 if (mas_expected_entries(&newmas, nr_entries)) {
1735 mas_for_each(&mas, val, ULONG_MAX) {
1736 newmas.index = mas.index;
1737 newmas.last = mas.last;
1738 mas_store(&newmas, val);
1741 mas_destroy(&newmas);
1742 mas_unlock(&newmas);
1743 mt_validate(&newmt);
1744 mt_set_non_kernel(0);
1745 mtree_destroy(&newmt);
1748 static noinline void __init check_iteration(struct maple_tree *mt)
1750 int i, nr_entries = 125;
1752 MA_STATE(mas, mt, 0, 0);
1754 for (i = 0; i <= nr_entries; i++)
1755 mtree_store_range(mt, i * 10, i * 10 + 9,
1756 xa_mk_value(i), GFP_KERNEL);
1758 mt_set_non_kernel(99999);
1762 mas_for_each(&mas, val, 925) {
1763 MT_BUG_ON(mt, mas.index != i * 10);
1764 MT_BUG_ON(mt, mas.last != i * 10 + 9);
1765 /* Overwrite end of entry 92 */
1769 mas_store(&mas, val);
1773 /* Ensure mas_find() gets the next value */
1774 val = mas_find(&mas, ULONG_MAX);
1775 MT_BUG_ON(mt, val != xa_mk_value(i));
1779 mas_for_each(&mas, val, 785) {
1780 MT_BUG_ON(mt, mas.index != i * 10);
1781 MT_BUG_ON(mt, mas.last != i * 10 + 9);
1782 /* Overwrite start of entry 78 */
1786 mas_store(&mas, val);
1791 val = mas_find(&mas, ULONG_MAX);
1792 MT_BUG_ON(mt, val != xa_mk_value(i));
1796 mas_for_each(&mas, val, 765) {
1797 MT_BUG_ON(mt, mas.index != i * 10);
1798 MT_BUG_ON(mt, mas.last != i * 10 + 9);
1799 /* Overwrite end of entry 76 and advance to the end */
1803 mas_store(&mas, val);
1807 /* Make sure the next find returns the one after 765, 766-769 */
1808 val = mas_find(&mas, ULONG_MAX);
1809 MT_BUG_ON(mt, val != xa_mk_value(76));
1812 mt_set_non_kernel(0);
1815 static noinline void __init check_mas_store_gfp(struct maple_tree *mt)
1818 struct maple_tree newmt;
1819 int i, nr_entries = 135;
1821 MA_STATE(mas, mt, 0, 0);
1822 MA_STATE(newmas, mt, 0, 0);
1824 for (i = 0; i <= nr_entries; i++)
1825 mtree_store_range(mt, i*10, i*10 + 5,
1826 xa_mk_value(i), GFP_KERNEL);
1828 mt_set_non_kernel(99999);
1829 mt_init_flags(&newmt, MT_FLAGS_ALLOC_RANGE);
1830 newmas.tree = &newmt;
1835 mas_for_each(&mas, val, ULONG_MAX) {
1836 newmas.index = mas.index;
1837 newmas.last = mas.last;
1838 mas_store_gfp(&newmas, val, GFP_KERNEL);
1840 mas_unlock(&newmas);
1842 mt_validate(&newmt);
1843 mt_set_non_kernel(0);
1844 mtree_destroy(&newmt);
1847 #if defined(BENCH_FORK)
1848 static noinline void __init bench_forking(struct maple_tree *mt)
1851 struct maple_tree newmt;
1852 int i, nr_entries = 134, nr_fork = 80000;
1854 MA_STATE(mas, mt, 0, 0);
1855 MA_STATE(newmas, mt, 0, 0);
1857 for (i = 0; i <= nr_entries; i++)
1858 mtree_store_range(mt, i*10, i*10 + 5,
1859 xa_mk_value(i), GFP_KERNEL);
1861 for (i = 0; i < nr_fork; i++) {
1862 mt_set_non_kernel(99999);
1863 mt_init_flags(&newmt, MT_FLAGS_ALLOC_RANGE);
1864 newmas.tree = &newmt;
1871 if (mas_expected_entries(&newmas, nr_entries)) {
1875 mas_for_each(&mas, val, ULONG_MAX) {
1876 newmas.index = mas.index;
1877 newmas.last = mas.last;
1878 mas_store(&newmas, val);
1880 mas_destroy(&newmas);
1881 mas_unlock(&newmas);
1883 mt_validate(&newmt);
1884 mt_set_non_kernel(0);
1885 mtree_destroy(&newmt);
1890 static noinline void __init next_prev_test(struct maple_tree *mt)
1894 MA_STATE(mas, mt, 0, 0);
1895 struct maple_enode *mn;
1896 static const unsigned long *level2;
1897 static const unsigned long level2_64[] = { 707, 1000, 710, 715, 720,
1899 static const unsigned long level2_32[] = { 1747, 2000, 1750, 1755,
1901 unsigned long last_index;
1906 last_index = 0x138e;
1913 for (i = 0; i <= nr_entries; i++)
1914 mtree_store_range(mt, i*10, i*10 + 5,
1915 xa_mk_value(i), GFP_KERNEL);
1918 for (i = 0; i <= nr_entries / 2; i++) {
1919 mas_next(&mas, 1000);
1920 if (mas_is_none(&mas))
1927 mas_for_each(&mas, val, 1000) {
1934 mas_for_each(&mas, val, 1000) {
1940 * 680 - 685 = 0x61a00001930c
1942 * 690 - 695 = 0x61a00001930c
1943 * Check simple next/prev
1946 val = mas_walk(&mas);
1947 MT_BUG_ON(mt, val != NULL);
1949 val = mas_next(&mas, 1000);
1950 MT_BUG_ON(mt, val != xa_mk_value(690 / 10));
1951 MT_BUG_ON(mt, mas.index != 690);
1952 MT_BUG_ON(mt, mas.last != 695);
1954 val = mas_prev(&mas, 0);
1955 MT_BUG_ON(mt, val != xa_mk_value(680 / 10));
1956 MT_BUG_ON(mt, mas.index != 680);
1957 MT_BUG_ON(mt, mas.last != 685);
1959 val = mas_next(&mas, 1000);
1960 MT_BUG_ON(mt, val != xa_mk_value(690 / 10));
1961 MT_BUG_ON(mt, mas.index != 690);
1962 MT_BUG_ON(mt, mas.last != 695);
1964 val = mas_next(&mas, 1000);
1965 MT_BUG_ON(mt, val != xa_mk_value(700 / 10));
1966 MT_BUG_ON(mt, mas.index != 700);
1967 MT_BUG_ON(mt, mas.last != 705);
1969 /* Check across node boundaries of the tree */
1971 val = mas_walk(&mas);
1972 MT_BUG_ON(mt, val != xa_mk_value(70 / 10));
1973 MT_BUG_ON(mt, mas.index != 70);
1974 MT_BUG_ON(mt, mas.last != 75);
1976 val = mas_next(&mas, 1000);
1977 MT_BUG_ON(mt, val != xa_mk_value(80 / 10));
1978 MT_BUG_ON(mt, mas.index != 80);
1979 MT_BUG_ON(mt, mas.last != 85);
1981 val = mas_prev(&mas, 70);
1982 MT_BUG_ON(mt, val != xa_mk_value(70 / 10));
1983 MT_BUG_ON(mt, mas.index != 70);
1984 MT_BUG_ON(mt, mas.last != 75);
1986 /* Check across two levels of the tree */
1988 mas_set(&mas, level2[0]);
1989 val = mas_walk(&mas);
1990 MT_BUG_ON(mt, val != NULL);
1991 val = mas_next(&mas, level2[1]);
1992 MT_BUG_ON(mt, val != xa_mk_value(level2[2] / 10));
1993 MT_BUG_ON(mt, mas.index != level2[2]);
1994 MT_BUG_ON(mt, mas.last != level2[3]);
1997 val = mas_next(&mas, level2[1]);
1998 MT_BUG_ON(mt, val != xa_mk_value(level2[4] / 10));
1999 MT_BUG_ON(mt, mas.index != level2[4]);
2000 MT_BUG_ON(mt, mas.last != level2[5]);
2001 MT_BUG_ON(mt, mn == mas.node);
2003 val = mas_prev(&mas, 0);
2004 MT_BUG_ON(mt, val != xa_mk_value(level2[2] / 10));
2005 MT_BUG_ON(mt, mas.index != level2[2]);
2006 MT_BUG_ON(mt, mas.last != level2[3]);
2008 /* Check running off the end and back on */
2009 mas_set(&mas, nr_entries * 10);
2010 val = mas_walk(&mas);
2011 MT_BUG_ON(mt, val != xa_mk_value(nr_entries));
2012 MT_BUG_ON(mt, mas.index != (nr_entries * 10));
2013 MT_BUG_ON(mt, mas.last != (nr_entries * 10 + 5));
2015 val = mas_next(&mas, ULONG_MAX);
2016 MT_BUG_ON(mt, val != NULL);
2017 MT_BUG_ON(mt, mas.index != last_index);
2018 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2020 val = mas_prev(&mas, 0);
2021 MT_BUG_ON(mt, val != xa_mk_value(nr_entries));
2022 MT_BUG_ON(mt, mas.index != (nr_entries * 10));
2023 MT_BUG_ON(mt, mas.last != (nr_entries * 10 + 5));
2025 /* Check running off the start and back on */
2028 val = mas_walk(&mas);
2029 MT_BUG_ON(mt, val != xa_mk_value(1));
2030 MT_BUG_ON(mt, mas.index != 10);
2031 MT_BUG_ON(mt, mas.last != 15);
2033 val = mas_prev(&mas, 0);
2034 MT_BUG_ON(mt, val != xa_mk_value(0));
2035 MT_BUG_ON(mt, mas.index != 0);
2036 MT_BUG_ON(mt, mas.last != 5);
2038 val = mas_prev(&mas, 0);
2039 MT_BUG_ON(mt, val != NULL);
2040 MT_BUG_ON(mt, mas.index != 0);
2041 MT_BUG_ON(mt, mas.last != 5);
2042 MT_BUG_ON(mt, mas.node != MAS_NONE);
2046 mas_store(&mas, NULL);
2051 val = mas_prev(&mas, 0);
2052 MT_BUG_ON(mt, val != NULL);
2053 MT_BUG_ON(mt, mas.index != 0);
2054 MT_BUG_ON(mt, mas.last != 9);
2060 mtree_store_range(mt, 0, 0, xa_mk_value(0), GFP_KERNEL);
2061 mtree_store_range(mt, 5, 5, xa_mk_value(5), GFP_KERNEL);
2064 val = mas_prev(&mas, 4);
2065 MT_BUG_ON(mt, val != NULL);
2071 /* Test spanning writes that require balancing right sibling or right cousin */
2072 static noinline void __init check_spanning_relatives(struct maple_tree *mt)
2075 unsigned long i, nr_entries = 1000;
2077 for (i = 0; i <= nr_entries; i++)
2078 mtree_store_range(mt, i*10, i*10 + 5,
2079 xa_mk_value(i), GFP_KERNEL);
2082 mtree_store_range(mt, 9365, 9955, NULL, GFP_KERNEL);
2085 static noinline void __init check_fuzzer(struct maple_tree *mt)
2088 * 1. Causes a spanning rebalance of a single root node.
2089 * Fixed by setting the correct limit in mast_cp_to_nodes() when the
2090 * entire right side is consumed.
2092 mtree_test_insert(mt, 88, (void *)0xb1);
2093 mtree_test_insert(mt, 84, (void *)0xa9);
2094 mtree_test_insert(mt, 2, (void *)0x5);
2095 mtree_test_insert(mt, 4, (void *)0x9);
2096 mtree_test_insert(mt, 14, (void *)0x1d);
2097 mtree_test_insert(mt, 7, (void *)0xf);
2098 mtree_test_insert(mt, 12, (void *)0x19);
2099 mtree_test_insert(mt, 18, (void *)0x25);
2100 mtree_test_store_range(mt, 8, 18, (void *)0x11);
2105 * 2. Cause a spanning rebalance of two nodes in root.
2106 * Fixed by setting mast->r->max correctly.
2108 mt_init_flags(mt, 0);
2109 mtree_test_store(mt, 87, (void *)0xaf);
2110 mtree_test_store(mt, 0, (void *)0x1);
2111 mtree_test_load(mt, 4);
2112 mtree_test_insert(mt, 4, (void *)0x9);
2113 mtree_test_store(mt, 8, (void *)0x11);
2114 mtree_test_store(mt, 44, (void *)0x59);
2115 mtree_test_store(mt, 68, (void *)0x89);
2116 mtree_test_store(mt, 2, (void *)0x5);
2117 mtree_test_insert(mt, 43, (void *)0x57);
2118 mtree_test_insert(mt, 24, (void *)0x31);
2119 mtree_test_insert(mt, 844, (void *)0x699);
2120 mtree_test_store(mt, 84, (void *)0xa9);
2121 mtree_test_store(mt, 4, (void *)0x9);
2122 mtree_test_erase(mt, 4);
2123 mtree_test_load(mt, 5);
2124 mtree_test_erase(mt, 0);
2128 * 3. Cause a node overflow on copy
2129 * Fixed by using the correct check for node size in mas_wr_modify()
2130 * Also discovered issue with metadata setting.
2132 mt_init_flags(mt, 0);
2133 mtree_test_store_range(mt, 0, ULONG_MAX, (void *)0x1);
2134 mtree_test_store(mt, 4, (void *)0x9);
2135 mtree_test_erase(mt, 5);
2136 mtree_test_erase(mt, 0);
2137 mtree_test_erase(mt, 4);
2138 mtree_test_store(mt, 5, (void *)0xb);
2139 mtree_test_erase(mt, 5);
2140 mtree_test_store(mt, 5, (void *)0xb);
2141 mtree_test_erase(mt, 5);
2142 mtree_test_erase(mt, 4);
2143 mtree_test_store(mt, 4, (void *)0x9);
2144 mtree_test_store(mt, 444, (void *)0x379);
2145 mtree_test_store(mt, 0, (void *)0x1);
2146 mtree_test_load(mt, 0);
2147 mtree_test_store(mt, 5, (void *)0xb);
2148 mtree_test_erase(mt, 0);
2152 * 4. spanning store failure due to writing incorrect pivot value at
2154 * Fixed by setting mast->r->max correctly in mast_cp_to_nodes()
2157 mt_init_flags(mt, 0);
2158 mtree_test_insert(mt, 261, (void *)0x20b);
2159 mtree_test_store(mt, 516, (void *)0x409);
2160 mtree_test_store(mt, 6, (void *)0xd);
2161 mtree_test_insert(mt, 5, (void *)0xb);
2162 mtree_test_insert(mt, 1256, (void *)0x9d1);
2163 mtree_test_store(mt, 4, (void *)0x9);
2164 mtree_test_erase(mt, 1);
2165 mtree_test_store(mt, 56, (void *)0x71);
2166 mtree_test_insert(mt, 1, (void *)0x3);
2167 mtree_test_store(mt, 24, (void *)0x31);
2168 mtree_test_erase(mt, 1);
2169 mtree_test_insert(mt, 2263, (void *)0x11af);
2170 mtree_test_insert(mt, 446, (void *)0x37d);
2171 mtree_test_store_range(mt, 6, 45, (void *)0xd);
2172 mtree_test_store_range(mt, 3, 446, (void *)0x7);
2176 * 5. mas_wr_extend_null() may overflow slots.
2177 * Fix by checking against wr_mas->node_end.
2179 mt_init_flags(mt, 0);
2180 mtree_test_store(mt, 48, (void *)0x61);
2181 mtree_test_store(mt, 3, (void *)0x7);
2182 mtree_test_load(mt, 0);
2183 mtree_test_store(mt, 88, (void *)0xb1);
2184 mtree_test_store(mt, 81, (void *)0xa3);
2185 mtree_test_insert(mt, 0, (void *)0x1);
2186 mtree_test_insert(mt, 8, (void *)0x11);
2187 mtree_test_insert(mt, 4, (void *)0x9);
2188 mtree_test_insert(mt, 2480, (void *)0x1361);
2189 mtree_test_insert(mt, ULONG_MAX,
2190 (void *)0xffffffffffffffff);
2191 mtree_test_erase(mt, ULONG_MAX);
2195 * 6. When reusing a node with an implied pivot and the node is
2196 * shrinking, old data would be left in the implied slot
2197 * Fixed by checking the last pivot for the mas->max and clear
2198 * accordingly. This only affected the left-most node as that node is
2199 * the only one allowed to end in NULL.
2201 mt_init_flags(mt, 0);
2202 mtree_test_erase(mt, 3);
2203 mtree_test_insert(mt, 22, (void *)0x2d);
2204 mtree_test_insert(mt, 15, (void *)0x1f);
2205 mtree_test_load(mt, 2);
2206 mtree_test_insert(mt, 1, (void *)0x3);
2207 mtree_test_insert(mt, 1, (void *)0x3);
2208 mtree_test_insert(mt, 5, (void *)0xb);
2209 mtree_test_erase(mt, 1);
2210 mtree_test_insert(mt, 1, (void *)0x3);
2211 mtree_test_insert(mt, 4, (void *)0x9);
2212 mtree_test_insert(mt, 1, (void *)0x3);
2213 mtree_test_erase(mt, 1);
2214 mtree_test_insert(mt, 2, (void *)0x5);
2215 mtree_test_insert(mt, 1, (void *)0x3);
2216 mtree_test_erase(mt, 3);
2217 mtree_test_insert(mt, 22, (void *)0x2d);
2218 mtree_test_insert(mt, 15, (void *)0x1f);
2219 mtree_test_insert(mt, 2, (void *)0x5);
2220 mtree_test_insert(mt, 1, (void *)0x3);
2221 mtree_test_insert(mt, 8, (void *)0x11);
2222 mtree_test_load(mt, 2);
2223 mtree_test_insert(mt, 1, (void *)0x3);
2224 mtree_test_insert(mt, 1, (void *)0x3);
2225 mtree_test_store(mt, 1, (void *)0x3);
2226 mtree_test_insert(mt, 5, (void *)0xb);
2227 mtree_test_erase(mt, 1);
2228 mtree_test_insert(mt, 1, (void *)0x3);
2229 mtree_test_insert(mt, 4, (void *)0x9);
2230 mtree_test_insert(mt, 1, (void *)0x3);
2231 mtree_test_erase(mt, 1);
2232 mtree_test_insert(mt, 2, (void *)0x5);
2233 mtree_test_insert(mt, 1, (void *)0x3);
2234 mtree_test_erase(mt, 3);
2235 mtree_test_insert(mt, 22, (void *)0x2d);
2236 mtree_test_insert(mt, 15, (void *)0x1f);
2237 mtree_test_insert(mt, 2, (void *)0x5);
2238 mtree_test_insert(mt, 1, (void *)0x3);
2239 mtree_test_insert(mt, 8, (void *)0x11);
2240 mtree_test_insert(mt, 12, (void *)0x19);
2241 mtree_test_erase(mt, 1);
2242 mtree_test_store_range(mt, 4, 62, (void *)0x9);
2243 mtree_test_erase(mt, 62);
2244 mtree_test_store_range(mt, 1, 0, (void *)0x3);
2245 mtree_test_insert(mt, 11, (void *)0x17);
2246 mtree_test_insert(mt, 3, (void *)0x7);
2247 mtree_test_insert(mt, 3, (void *)0x7);
2248 mtree_test_store(mt, 62, (void *)0x7d);
2249 mtree_test_erase(mt, 62);
2250 mtree_test_store_range(mt, 1, 15, (void *)0x3);
2251 mtree_test_erase(mt, 1);
2252 mtree_test_insert(mt, 22, (void *)0x2d);
2253 mtree_test_insert(mt, 12, (void *)0x19);
2254 mtree_test_erase(mt, 1);
2255 mtree_test_insert(mt, 3, (void *)0x7);
2256 mtree_test_store(mt, 62, (void *)0x7d);
2257 mtree_test_erase(mt, 62);
2258 mtree_test_insert(mt, 122, (void *)0xf5);
2259 mtree_test_store(mt, 3, (void *)0x7);
2260 mtree_test_insert(mt, 0, (void *)0x1);
2261 mtree_test_store_range(mt, 0, 1, (void *)0x1);
2262 mtree_test_insert(mt, 85, (void *)0xab);
2263 mtree_test_insert(mt, 72, (void *)0x91);
2264 mtree_test_insert(mt, 81, (void *)0xa3);
2265 mtree_test_insert(mt, 726, (void *)0x5ad);
2266 mtree_test_insert(mt, 0, (void *)0x1);
2267 mtree_test_insert(mt, 1, (void *)0x3);
2268 mtree_test_store(mt, 51, (void *)0x67);
2269 mtree_test_insert(mt, 611, (void *)0x4c7);
2270 mtree_test_insert(mt, 485, (void *)0x3cb);
2271 mtree_test_insert(mt, 1, (void *)0x3);
2272 mtree_test_erase(mt, 1);
2273 mtree_test_insert(mt, 0, (void *)0x1);
2274 mtree_test_insert(mt, 1, (void *)0x3);
2275 mtree_test_insert_range(mt, 26, 1, (void *)0x35);
2276 mtree_test_load(mt, 1);
2277 mtree_test_store_range(mt, 1, 22, (void *)0x3);
2278 mtree_test_insert(mt, 1, (void *)0x3);
2279 mtree_test_erase(mt, 1);
2280 mtree_test_load(mt, 53);
2281 mtree_test_load(mt, 1);
2282 mtree_test_store_range(mt, 1, 1, (void *)0x3);
2283 mtree_test_insert(mt, 222, (void *)0x1bd);
2284 mtree_test_insert(mt, 485, (void *)0x3cb);
2285 mtree_test_insert(mt, 1, (void *)0x3);
2286 mtree_test_erase(mt, 1);
2287 mtree_test_load(mt, 0);
2288 mtree_test_insert(mt, 21, (void *)0x2b);
2289 mtree_test_insert(mt, 3, (void *)0x7);
2290 mtree_test_store(mt, 621, (void *)0x4db);
2291 mtree_test_insert(mt, 0, (void *)0x1);
2292 mtree_test_erase(mt, 5);
2293 mtree_test_insert(mt, 1, (void *)0x3);
2294 mtree_test_store(mt, 62, (void *)0x7d);
2295 mtree_test_erase(mt, 62);
2296 mtree_test_store_range(mt, 1, 0, (void *)0x3);
2297 mtree_test_insert(mt, 22, (void *)0x2d);
2298 mtree_test_insert(mt, 12, (void *)0x19);
2299 mtree_test_erase(mt, 1);
2300 mtree_test_insert(mt, 1, (void *)0x3);
2301 mtree_test_store_range(mt, 4, 62, (void *)0x9);
2302 mtree_test_erase(mt, 62);
2303 mtree_test_erase(mt, 1);
2304 mtree_test_load(mt, 1);
2305 mtree_test_store_range(mt, 1, 22, (void *)0x3);
2306 mtree_test_insert(mt, 1, (void *)0x3);
2307 mtree_test_erase(mt, 1);
2308 mtree_test_load(mt, 53);
2309 mtree_test_load(mt, 1);
2310 mtree_test_store_range(mt, 1, 1, (void *)0x3);
2311 mtree_test_insert(mt, 222, (void *)0x1bd);
2312 mtree_test_insert(mt, 485, (void *)0x3cb);
2313 mtree_test_insert(mt, 1, (void *)0x3);
2314 mtree_test_erase(mt, 1);
2315 mtree_test_insert(mt, 1, (void *)0x3);
2316 mtree_test_load(mt, 0);
2317 mtree_test_load(mt, 0);
2321 * 7. Previous fix was incomplete, fix mas_resuse_node() clearing of old
2322 * data by overwriting it first - that way metadata is of no concern.
2324 mt_init_flags(mt, 0);
2325 mtree_test_load(mt, 1);
2326 mtree_test_insert(mt, 102, (void *)0xcd);
2327 mtree_test_erase(mt, 2);
2328 mtree_test_erase(mt, 0);
2329 mtree_test_load(mt, 0);
2330 mtree_test_insert(mt, 4, (void *)0x9);
2331 mtree_test_insert(mt, 2, (void *)0x5);
2332 mtree_test_insert(mt, 110, (void *)0xdd);
2333 mtree_test_insert(mt, 1, (void *)0x3);
2334 mtree_test_insert_range(mt, 5, 0, (void *)0xb);
2335 mtree_test_erase(mt, 2);
2336 mtree_test_store(mt, 0, (void *)0x1);
2337 mtree_test_store(mt, 112, (void *)0xe1);
2338 mtree_test_insert(mt, 21, (void *)0x2b);
2339 mtree_test_store(mt, 1, (void *)0x3);
2340 mtree_test_insert_range(mt, 110, 2, (void *)0xdd);
2341 mtree_test_store(mt, 2, (void *)0x5);
2342 mtree_test_load(mt, 22);
2343 mtree_test_erase(mt, 2);
2344 mtree_test_store(mt, 210, (void *)0x1a5);
2345 mtree_test_store_range(mt, 0, 2, (void *)0x1);
2346 mtree_test_store(mt, 2, (void *)0x5);
2347 mtree_test_erase(mt, 2);
2348 mtree_test_erase(mt, 22);
2349 mtree_test_erase(mt, 1);
2350 mtree_test_erase(mt, 2);
2351 mtree_test_store(mt, 0, (void *)0x1);
2352 mtree_test_load(mt, 112);
2353 mtree_test_insert(mt, 2, (void *)0x5);
2354 mtree_test_erase(mt, 2);
2355 mtree_test_store(mt, 1, (void *)0x3);
2356 mtree_test_insert_range(mt, 1, 2, (void *)0x3);
2357 mtree_test_erase(mt, 0);
2358 mtree_test_erase(mt, 2);
2359 mtree_test_store(mt, 2, (void *)0x5);
2360 mtree_test_erase(mt, 0);
2361 mtree_test_erase(mt, 2);
2362 mtree_test_store(mt, 0, (void *)0x1);
2363 mtree_test_store(mt, 0, (void *)0x1);
2364 mtree_test_erase(mt, 2);
2365 mtree_test_store(mt, 2, (void *)0x5);
2366 mtree_test_erase(mt, 2);
2367 mtree_test_insert(mt, 2, (void *)0x5);
2368 mtree_test_insert_range(mt, 1, 2, (void *)0x3);
2369 mtree_test_erase(mt, 0);
2370 mtree_test_erase(mt, 2);
2371 mtree_test_store(mt, 0, (void *)0x1);
2372 mtree_test_load(mt, 112);
2373 mtree_test_store_range(mt, 110, 12, (void *)0xdd);
2374 mtree_test_store(mt, 2, (void *)0x5);
2375 mtree_test_load(mt, 110);
2376 mtree_test_insert_range(mt, 4, 71, (void *)0x9);
2377 mtree_test_load(mt, 2);
2378 mtree_test_store(mt, 2, (void *)0x5);
2379 mtree_test_insert_range(mt, 11, 22, (void *)0x17);
2380 mtree_test_erase(mt, 12);
2381 mtree_test_store(mt, 2, (void *)0x5);
2382 mtree_test_load(mt, 22);
2387 * 8. When rebalancing or spanning_rebalance(), the max of the new node
2388 * may be set incorrectly to the final pivot and not the right max.
2389 * Fix by setting the left max to orig right max if the entire node is
2392 mt_init_flags(mt, 0);
2393 mtree_test_store(mt, 6, (void *)0xd);
2394 mtree_test_store(mt, 67, (void *)0x87);
2395 mtree_test_insert(mt, 15, (void *)0x1f);
2396 mtree_test_insert(mt, 6716, (void *)0x3479);
2397 mtree_test_store(mt, 61, (void *)0x7b);
2398 mtree_test_insert(mt, 13, (void *)0x1b);
2399 mtree_test_store(mt, 8, (void *)0x11);
2400 mtree_test_insert(mt, 1, (void *)0x3);
2401 mtree_test_load(mt, 0);
2402 mtree_test_erase(mt, 67167);
2403 mtree_test_insert_range(mt, 6, 7167, (void *)0xd);
2404 mtree_test_insert(mt, 6, (void *)0xd);
2405 mtree_test_erase(mt, 67);
2406 mtree_test_insert(mt, 1, (void *)0x3);
2407 mtree_test_erase(mt, 667167);
2408 mtree_test_insert(mt, 6, (void *)0xd);
2409 mtree_test_store(mt, 67, (void *)0x87);
2410 mtree_test_insert(mt, 5, (void *)0xb);
2411 mtree_test_erase(mt, 1);
2412 mtree_test_insert(mt, 6, (void *)0xd);
2413 mtree_test_erase(mt, 67);
2414 mtree_test_insert(mt, 15, (void *)0x1f);
2415 mtree_test_insert(mt, 67167, (void *)0x20cbf);
2416 mtree_test_insert(mt, 1, (void *)0x3);
2417 mtree_test_load(mt, 7);
2418 mtree_test_insert(mt, 16, (void *)0x21);
2419 mtree_test_insert(mt, 36, (void *)0x49);
2420 mtree_test_store(mt, 67, (void *)0x87);
2421 mtree_test_store(mt, 6, (void *)0xd);
2422 mtree_test_insert(mt, 367, (void *)0x2df);
2423 mtree_test_insert(mt, 115, (void *)0xe7);
2424 mtree_test_store(mt, 0, (void *)0x1);
2425 mtree_test_store_range(mt, 1, 3, (void *)0x3);
2426 mtree_test_store(mt, 1, (void *)0x3);
2427 mtree_test_erase(mt, 67167);
2428 mtree_test_insert_range(mt, 6, 47, (void *)0xd);
2429 mtree_test_store(mt, 1, (void *)0x3);
2430 mtree_test_insert_range(mt, 1, 67, (void *)0x3);
2431 mtree_test_load(mt, 67);
2432 mtree_test_insert(mt, 1, (void *)0x3);
2433 mtree_test_erase(mt, 67167);
2437 * 9. spanning store to the end of data caused an invalid metadata
2438 * length which resulted in a crash eventually.
2439 * Fix by checking if there is a value in pivot before incrementing the
2440 * metadata end in mab_mas_cp(). To ensure this doesn't happen again,
2441 * abstract the two locations this happens into a function called
2442 * mas_leaf_set_meta().
2444 mt_init_flags(mt, 0);
2445 mtree_test_insert(mt, 21, (void *)0x2b);
2446 mtree_test_insert(mt, 12, (void *)0x19);
2447 mtree_test_insert(mt, 6, (void *)0xd);
2448 mtree_test_insert(mt, 8, (void *)0x11);
2449 mtree_test_insert(mt, 2, (void *)0x5);
2450 mtree_test_insert(mt, 91, (void *)0xb7);
2451 mtree_test_insert(mt, 18, (void *)0x25);
2452 mtree_test_insert(mt, 81, (void *)0xa3);
2453 mtree_test_store_range(mt, 0, 128, (void *)0x1);
2454 mtree_test_store(mt, 1, (void *)0x3);
2455 mtree_test_erase(mt, 8);
2456 mtree_test_insert(mt, 11, (void *)0x17);
2457 mtree_test_insert(mt, 8, (void *)0x11);
2458 mtree_test_insert(mt, 21, (void *)0x2b);
2459 mtree_test_insert(mt, 2, (void *)0x5);
2460 mtree_test_insert(mt, ULONG_MAX - 10, (void *)0xffffffffffffffeb);
2461 mtree_test_erase(mt, ULONG_MAX - 10);
2462 mtree_test_store_range(mt, 0, 281, (void *)0x1);
2463 mtree_test_erase(mt, 2);
2464 mtree_test_insert(mt, 1211, (void *)0x977);
2465 mtree_test_insert(mt, 111, (void *)0xdf);
2466 mtree_test_insert(mt, 13, (void *)0x1b);
2467 mtree_test_insert(mt, 211, (void *)0x1a7);
2468 mtree_test_insert(mt, 11, (void *)0x17);
2469 mtree_test_insert(mt, 5, (void *)0xb);
2470 mtree_test_insert(mt, 1218, (void *)0x985);
2471 mtree_test_insert(mt, 61, (void *)0x7b);
2472 mtree_test_store(mt, 1, (void *)0x3);
2473 mtree_test_insert(mt, 121, (void *)0xf3);
2474 mtree_test_insert(mt, 8, (void *)0x11);
2475 mtree_test_insert(mt, 21, (void *)0x2b);
2476 mtree_test_insert(mt, 2, (void *)0x5);
2477 mtree_test_insert(mt, ULONG_MAX - 10, (void *)0xffffffffffffffeb);
2478 mtree_test_erase(mt, ULONG_MAX - 10);
2481 /* duplicate the tree with a specific gap */
2482 static noinline void __init check_dup_gaps(struct maple_tree *mt,
2483 unsigned long nr_entries, bool zero_start,
2486 unsigned long i = 0;
2487 struct maple_tree newmt;
2490 MA_STATE(mas, mt, 0, 0);
2491 MA_STATE(newmas, &newmt, 0, 0);
2496 mt_zero_nr_tallocated();
2497 for (; i <= nr_entries; i++)
2498 mtree_store_range(mt, i*10, (i+1)*10 - gap,
2499 xa_mk_value(i), GFP_KERNEL);
2501 mt_init_flags(&newmt, MT_FLAGS_ALLOC_RANGE);
2502 mt_set_non_kernel(99999);
2504 ret = mas_expected_entries(&newmas, nr_entries);
2505 mt_set_non_kernel(0);
2506 MT_BUG_ON(mt, ret != 0);
2509 mas_for_each(&mas, tmp, ULONG_MAX) {
2510 newmas.index = mas.index;
2511 newmas.last = mas.last;
2512 mas_store(&newmas, tmp);
2515 mas_destroy(&newmas);
2516 mas_unlock(&newmas);
2518 mtree_destroy(&newmt);
2521 /* Duplicate many sizes of trees. Mainly to test expected entry values */
2522 static noinline void __init check_dup(struct maple_tree *mt)
2525 int big_start = 100010;
2527 /* Check with a value at zero */
2528 for (i = 10; i < 1000; i++) {
2529 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
2530 check_dup_gaps(mt, i, true, 5);
2537 /* Check with a value at zero, no gap */
2538 for (i = 1000; i < 2000; i++) {
2539 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
2540 check_dup_gaps(mt, i, true, 0);
2547 /* Check with a value at zero and unreasonably large */
2548 for (i = big_start; i < big_start + 10; i++) {
2549 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
2550 check_dup_gaps(mt, i, true, 5);
2557 /* Small to medium size not starting at zero*/
2558 for (i = 200; i < 1000; i++) {
2559 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
2560 check_dup_gaps(mt, i, false, 5);
2567 /* Unreasonably large not starting at zero*/
2568 for (i = big_start; i < big_start + 10; i++) {
2569 mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
2570 check_dup_gaps(mt, i, false, 5);
2577 /* Check non-allocation tree not starting at zero */
2578 for (i = 1500; i < 3000; i++) {
2579 mt_init_flags(mt, 0);
2580 check_dup_gaps(mt, i, false, 5);
2589 /* Check non-allocation tree starting at zero */
2590 for (i = 200; i < 1000; i++) {
2591 mt_init_flags(mt, 0);
2592 check_dup_gaps(mt, i, true, 5);
2599 /* Unreasonably large */
2600 for (i = big_start + 5; i < big_start + 10; i++) {
2601 mt_init_flags(mt, 0);
2602 check_dup_gaps(mt, i, true, 5);
2610 static noinline void __init check_bnode_min_spanning(struct maple_tree *mt)
2613 MA_STATE(mas, mt, 0, 0);
2615 mt_set_non_kernel(9999);
2618 mas_set_range(&mas, i*10, i*10+9);
2619 mas_store(&mas, check_bnode_min_spanning);
2622 mas_set_range(&mas, 240, 509);
2623 mas_store(&mas, NULL);
2626 mt_set_non_kernel(0);
2629 static noinline void __init check_empty_area_window(struct maple_tree *mt)
2631 unsigned long i, nr_entries = 20;
2632 MA_STATE(mas, mt, 0, 0);
2634 for (i = 1; i <= nr_entries; i++)
2635 mtree_store_range(mt, i*10, i*10 + 9,
2636 xa_mk_value(i), GFP_KERNEL);
2638 /* Create another hole besides the one at 0 */
2639 mtree_store_range(mt, 160, 169, NULL, GFP_KERNEL);
2641 /* Check lower bounds that don't fit */
2643 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 5, 90, 10) != -EBUSY);
2646 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 6, 90, 5) != -EBUSY);
2648 /* Check lower bound that does fit */
2650 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 5, 90, 5) != 0);
2651 MT_BUG_ON(mt, mas.index != 5);
2652 MT_BUG_ON(mt, mas.last != 9);
2655 /* Check one gap that doesn't fit and one that does */
2658 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 5, 217, 9) != 0);
2659 MT_BUG_ON(mt, mas.index != 161);
2660 MT_BUG_ON(mt, mas.last != 169);
2662 /* Check one gap that does fit above the min */
2664 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 100, 218, 3) != 0);
2665 MT_BUG_ON(mt, mas.index != 216);
2666 MT_BUG_ON(mt, mas.last != 218);
2668 /* Check size that doesn't fit any gap */
2670 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 100, 218, 16) != -EBUSY);
2673 * Check size that doesn't fit the lower end of the window but
2677 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 167, 200, 4) != -EBUSY);
2680 * Check size that doesn't fit the upper end of the window but
2684 MT_BUG_ON(mt, mas_empty_area_rev(&mas, 100, 162, 4) != -EBUSY);
2686 /* Check mas_empty_area forward */
2688 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 100, 9) != 0);
2689 MT_BUG_ON(mt, mas.index != 0);
2690 MT_BUG_ON(mt, mas.last != 8);
2693 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 100, 4) != 0);
2694 MT_BUG_ON(mt, mas.index != 0);
2695 MT_BUG_ON(mt, mas.last != 3);
2698 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 100, 11) != -EBUSY);
2701 MT_BUG_ON(mt, mas_empty_area(&mas, 5, 100, 6) != -EBUSY);
2704 MT_BUG_ON(mt, mas_empty_area(&mas, 0, 8, 10) != -EINVAL);
2707 mas_empty_area(&mas, 100, 165, 3);
2710 MT_BUG_ON(mt, mas_empty_area(&mas, 100, 163, 6) != -EBUSY);
2714 static noinline void __init check_empty_area_fill(struct maple_tree *mt)
2716 const unsigned long max = 0x25D78000;
2719 MA_STATE(mas, mt, 0, 0);
2721 mt_set_non_kernel(99999);
2722 for (shift = 12; shift <= 16; shift++) {
2728 MT_BUG_ON(mt, mas_empty_area(&mas, 0, max, size) != 0);
2729 MT_BUG_ON(mt, mas.last != mas.index + size - 1);
2730 mas_store_gfp(&mas, (void *)size, GFP_KERNEL);
2736 /* No space left. */
2739 MT_BUG_ON(mt, mas_empty_area(&mas, 0, max, size) != -EBUSY);
2742 /* Fill a depth 3 node to the maximum */
2743 for (unsigned long i = 629440511; i <= 629440800; i += 6)
2744 mtree_store_range(mt, i, i + 5, (void *)i, GFP_KERNEL);
2745 /* Make space in the second-last depth 4 node */
2746 mtree_erase(mt, 631668735);
2747 /* Make space in the last depth 4 node */
2748 mtree_erase(mt, 629506047);
2750 /* Search from just after the gap in the second-last depth 4 */
2752 MT_BUG_ON(mt, mas_empty_area(&mas, 629506048, 690000000, 0x5000) != 0);
2754 mt_set_non_kernel(0);
2758 * Check MAS_START, MAS_PAUSE, active (implied), and MAS_NONE transitions.
2760 * The table below shows the single entry tree (0-0 pointer) and normal tree
2763 * Function ENTRY Start Result index & last
2764 * ┬ ┬ ┬ ┬ ┬
2765 * │ │ │ │ └─ the final range
2766 * │ │ │ └─ The node value after execution
2767 * │ │ └─ The node value before execution
2768 * │ └─ If the entry exists or does not exists (DNE)
2769 * └─ The function name
2771 * Function ENTRY Start Result index & last
2774 * Single entry tree at 0-0
2775 * ------------------------
2776 * DNE MAS_START MAS_NONE 1 - oo
2777 * DNE MAS_PAUSE MAS_NONE 1 - oo
2778 * DNE MAS_ROOT MAS_NONE 1 - oo
2780 * DNE MAS_NONE MAS_ROOT 0
2782 * DNE MAS_NONE MAS_NONE 1 - oo
2786 * exists MAS_START active range
2787 * DNE MAS_START active set to last range
2788 * exists MAS_PAUSE active range
2789 * DNE MAS_PAUSE active set to last range
2790 * exists MAS_NONE active range
2791 * exists active active range
2792 * DNE active active set to last range
2794 * Function ENTRY Start Result index & last
2797 * Single entry tree at 0-0
2798 * ------------------------
2800 * exists MAS_START MAS_ROOT 0
2801 * exists MAS_PAUSE MAS_ROOT 0
2802 * exists MAS_NONE MAS_ROOT 0
2805 * DNE MAS_START MAS_NONE 0
2806 * DNE MAS_PAUSE MAS_NONE 0
2807 * DNE MAS_NONE MAS_NONE 0
2808 * DNE MAS_ROOT MAS_NONE 0
2812 * exists MAS_START active range
2813 * DNE MAS_START active set to min
2814 * exists MAS_PAUSE active range
2815 * DNE MAS_PAUSE active set to min
2816 * exists MAS_NONE active range
2817 * DNE MAS_NONE MAS_NONE set to min
2818 * any MAS_ROOT MAS_NONE 0
2819 * exists active active range
2820 * DNE active active last range
2822 * Function ENTRY Start Result index & last
2824 * - at index or next
2825 * Single entry tree at 0-0
2826 * ------------------------
2828 * DNE MAS_START MAS_NONE 0
2829 * DNE MAS_PAUSE MAS_NONE 0
2830 * DNE MAS_ROOT MAS_NONE 0
2831 * DNE MAS_NONE MAS_NONE 0
2833 * exists MAS_START MAS_ROOT 0
2834 * exists MAS_PAUSE MAS_ROOT 0
2835 * exists MAS_NONE MAS_ROOT 0
2839 * exists MAS_START active range
2840 * DNE MAS_START active set to max
2841 * exists MAS_PAUSE active range
2842 * DNE MAS_PAUSE active set to max
2843 * exists MAS_NONE active range
2844 * exists active active range
2845 * DNE active active last range (max < last)
2847 * Function ENTRY Start Result index & last
2849 * - at index or before
2850 * Single entry tree at 0-0
2851 * ------------------------
2853 * exists MAS_START MAS_ROOT 0
2854 * exists MAS_PAUSE MAS_ROOT 0
2855 * exists MAS_NONE MAS_ROOT 0
2857 * DNE MAS_START MAS_NONE 0
2858 * DNE MAS_PAUSE MAS_NONE 0
2859 * DNE MAS_NONE MAS_NONE 0
2860 * DNE MAS_ROOT MAS_NONE 0
2864 * exists MAS_START active range
2865 * DNE MAS_START active set to min
2866 * exists MAS_PAUSE active range
2867 * DNE MAS_PAUSE active set to min
2868 * exists MAS_NONE active range
2869 * exists active active range
2870 * DNE active active last range (min > index)
2872 * Function ENTRY Start Result index & last
2875 * Single entry tree at 0-0
2876 * ------------------------
2878 * DNE MAS_START MAS_ROOT 1 - oo
2879 * DNE MAS_PAUSE MAS_ROOT 1 - oo
2880 * DNE MAS_NONE MAS_ROOT 1 - oo
2881 * DNE MAS_ROOT MAS_ROOT 1 - oo
2883 * exists MAS_START MAS_ROOT 0
2884 * exists MAS_PAUSE MAS_ROOT 0
2885 * exists MAS_NONE MAS_ROOT 0
2886 * exists MAS_ROOT MAS_ROOT 0
2890 * exists MAS_START active range
2891 * DNE MAS_START active range of NULL
2892 * exists MAS_PAUSE active range
2893 * DNE MAS_PAUSE active range of NULL
2894 * exists MAS_NONE active range
2895 * DNE MAS_NONE active range of NULL
2896 * exists active active range
2897 * DNE active active range of NULL
2900 #define mas_active(x) (((x).node != MAS_ROOT) && \
2901 ((x).node != MAS_START) && \
2902 ((x).node != MAS_PAUSE) && \
2903 ((x).node != MAS_NONE))
2904 static noinline void __init check_state_handling(struct maple_tree *mt)
2906 MA_STATE(mas, mt, 0, 0);
2907 void *entry, *ptr = (void *) 0x1234500;
2911 /* Check MAS_ROOT First */
2912 mtree_store_range(mt, 0, 0, ptr, GFP_KERNEL);
2915 /* prev: Start -> none */
2916 entry = mas_prev(&mas, 0);
2917 MT_BUG_ON(mt, entry != NULL);
2918 MT_BUG_ON(mt, mas.node != MAS_NONE);
2920 /* prev: Start -> root */
2922 entry = mas_prev(&mas, 0);
2923 MT_BUG_ON(mt, entry != ptr);
2924 MT_BUG_ON(mt, mas.index != 0);
2925 MT_BUG_ON(mt, mas.last != 0);
2926 MT_BUG_ON(mt, mas.node != MAS_ROOT);
2928 /* prev: pause -> root */
2931 entry = mas_prev(&mas, 0);
2932 MT_BUG_ON(mt, entry != ptr);
2933 MT_BUG_ON(mt, mas.index != 0);
2934 MT_BUG_ON(mt, mas.last != 0);
2935 MT_BUG_ON(mt, mas.node != MAS_ROOT);
2937 /* next: start -> none */
2939 entry = mas_next(&mas, ULONG_MAX);
2940 MT_BUG_ON(mt, mas.index != 1);
2941 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2942 MT_BUG_ON(mt, entry != NULL);
2943 MT_BUG_ON(mt, mas.node != MAS_NONE);
2945 /* next: start -> none */
2947 entry = mas_next(&mas, ULONG_MAX);
2948 MT_BUG_ON(mt, mas.index != 1);
2949 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2950 MT_BUG_ON(mt, entry != NULL);
2951 MT_BUG_ON(mt, mas.node != MAS_NONE);
2953 /* find: start -> root */
2955 entry = mas_find(&mas, ULONG_MAX);
2956 MT_BUG_ON(mt, entry != ptr);
2957 MT_BUG_ON(mt, mas.index != 0);
2958 MT_BUG_ON(mt, mas.last != 0);
2959 MT_BUG_ON(mt, mas.node != MAS_ROOT);
2961 /* find: root -> none */
2962 entry = mas_find(&mas, ULONG_MAX);
2963 MT_BUG_ON(mt, entry != NULL);
2964 MT_BUG_ON(mt, mas.index != 1);
2965 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2966 MT_BUG_ON(mt, mas.node != MAS_NONE);
2968 /* find: none -> none */
2969 entry = mas_find(&mas, ULONG_MAX);
2970 MT_BUG_ON(mt, entry != NULL);
2971 MT_BUG_ON(mt, mas.index != 1);
2972 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2973 MT_BUG_ON(mt, mas.node != MAS_NONE);
2975 /* find: start -> none */
2977 entry = mas_find(&mas, ULONG_MAX);
2978 MT_BUG_ON(mt, entry != NULL);
2979 MT_BUG_ON(mt, mas.index != 1);
2980 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2981 MT_BUG_ON(mt, mas.node != MAS_NONE);
2983 /* find_rev: none -> root */
2984 entry = mas_find_rev(&mas, 0);
2985 MT_BUG_ON(mt, entry != ptr);
2986 MT_BUG_ON(mt, mas.index != 0);
2987 MT_BUG_ON(mt, mas.last != 0);
2988 MT_BUG_ON(mt, mas.node != MAS_ROOT);
2990 /* find_rev: start -> root */
2992 entry = mas_find_rev(&mas, 0);
2993 MT_BUG_ON(mt, entry != ptr);
2994 MT_BUG_ON(mt, mas.index != 0);
2995 MT_BUG_ON(mt, mas.last != 0);
2996 MT_BUG_ON(mt, mas.node != MAS_ROOT);
2998 /* find_rev: root -> none */
2999 entry = mas_find_rev(&mas, 0);
3000 MT_BUG_ON(mt, entry != NULL);
3001 MT_BUG_ON(mt, mas.index != 0);
3002 MT_BUG_ON(mt, mas.last != 0);
3003 MT_BUG_ON(mt, mas.node != MAS_NONE);
3005 /* find_rev: none -> none */
3006 entry = mas_find_rev(&mas, 0);
3007 MT_BUG_ON(mt, entry != NULL);
3008 MT_BUG_ON(mt, mas.index != 0);
3009 MT_BUG_ON(mt, mas.last != 0);
3010 MT_BUG_ON(mt, mas.node != MAS_NONE);
3012 /* find_rev: start -> root */
3014 entry = mas_find_rev(&mas, 0);
3015 MT_BUG_ON(mt, entry != ptr);
3016 MT_BUG_ON(mt, mas.index != 0);
3017 MT_BUG_ON(mt, mas.last != 0);
3018 MT_BUG_ON(mt, mas.node != MAS_ROOT);
3020 /* walk: start -> none */
3022 entry = mas_walk(&mas);
3023 MT_BUG_ON(mt, entry != NULL);
3024 MT_BUG_ON(mt, mas.index != 1);
3025 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3026 MT_BUG_ON(mt, mas.node != MAS_NONE);
3028 /* walk: pause -> none*/
3031 entry = mas_walk(&mas);
3032 MT_BUG_ON(mt, entry != NULL);
3033 MT_BUG_ON(mt, mas.index != 1);
3034 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3035 MT_BUG_ON(mt, mas.node != MAS_NONE);
3037 /* walk: none -> none */
3038 mas.index = mas.last = 10;
3039 entry = mas_walk(&mas);
3040 MT_BUG_ON(mt, entry != NULL);
3041 MT_BUG_ON(mt, mas.index != 1);
3042 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3043 MT_BUG_ON(mt, mas.node != MAS_NONE);
3045 /* walk: none -> none */
3046 entry = mas_walk(&mas);
3047 MT_BUG_ON(mt, entry != NULL);
3048 MT_BUG_ON(mt, mas.index != 1);
3049 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3050 MT_BUG_ON(mt, mas.node != MAS_NONE);
3052 /* walk: start -> root */
3054 entry = mas_walk(&mas);
3055 MT_BUG_ON(mt, entry != ptr);
3056 MT_BUG_ON(mt, mas.index != 0);
3057 MT_BUG_ON(mt, mas.last != 0);
3058 MT_BUG_ON(mt, mas.node != MAS_ROOT);
3060 /* walk: pause -> root */
3063 entry = mas_walk(&mas);
3064 MT_BUG_ON(mt, entry != ptr);
3065 MT_BUG_ON(mt, mas.index != 0);
3066 MT_BUG_ON(mt, mas.last != 0);
3067 MT_BUG_ON(mt, mas.node != MAS_ROOT);
3069 /* walk: none -> root */
3070 mas.node = MAS_NONE;
3071 entry = mas_walk(&mas);
3072 MT_BUG_ON(mt, entry != ptr);
3073 MT_BUG_ON(mt, mas.index != 0);
3074 MT_BUG_ON(mt, mas.last != 0);
3075 MT_BUG_ON(mt, mas.node != MAS_ROOT);
3077 /* walk: root -> root */
3078 entry = mas_walk(&mas);
3079 MT_BUG_ON(mt, entry != ptr);
3080 MT_BUG_ON(mt, mas.index != 0);
3081 MT_BUG_ON(mt, mas.last != 0);
3082 MT_BUG_ON(mt, mas.node != MAS_ROOT);
3084 /* walk: root -> none */
3086 entry = mas_walk(&mas);
3087 MT_BUG_ON(mt, entry != NULL);
3088 MT_BUG_ON(mt, mas.index != 1);
3089 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3090 MT_BUG_ON(mt, mas.node != MAS_NONE);
3092 /* walk: none -> root */
3093 mas.index = mas.last = 0;
3094 entry = mas_walk(&mas);
3095 MT_BUG_ON(mt, entry != ptr);
3096 MT_BUG_ON(mt, mas.index != 0);
3097 MT_BUG_ON(mt, mas.last != 0);
3098 MT_BUG_ON(mt, mas.node != MAS_ROOT);
3102 /* Check when there is an actual node */
3103 mtree_store_range(mt, 0, 0, NULL, GFP_KERNEL);
3104 mtree_store_range(mt, 0x1000, 0x1500, ptr, GFP_KERNEL);
3105 mtree_store_range(mt, 0x2000, 0x2500, ptr2, GFP_KERNEL);
3106 mtree_store_range(mt, 0x3000, 0x3500, ptr3, GFP_KERNEL);
3110 /* next: start ->active */
3112 entry = mas_next(&mas, ULONG_MAX);
3113 MT_BUG_ON(mt, entry != ptr);
3114 MT_BUG_ON(mt, mas.index != 0x1000);
3115 MT_BUG_ON(mt, mas.last != 0x1500);
3116 MT_BUG_ON(mt, !mas_active(mas));
3118 /* next: pause ->active */
3121 entry = mas_next(&mas, ULONG_MAX);
3122 MT_BUG_ON(mt, entry != ptr);
3123 MT_BUG_ON(mt, mas.index != 0x1000);
3124 MT_BUG_ON(mt, mas.last != 0x1500);
3125 MT_BUG_ON(mt, !mas_active(mas));
3127 /* next: none ->active */
3128 mas.index = mas.last = 0;
3130 mas.node = MAS_NONE;
3131 entry = mas_next(&mas, ULONG_MAX);
3132 MT_BUG_ON(mt, entry != ptr);
3133 MT_BUG_ON(mt, mas.index != 0x1000);
3134 MT_BUG_ON(mt, mas.last != 0x1500);
3135 MT_BUG_ON(mt, !mas_active(mas));
3137 /* next:active ->active */
3138 entry = mas_next(&mas, ULONG_MAX);
3139 MT_BUG_ON(mt, entry != ptr2);
3140 MT_BUG_ON(mt, mas.index != 0x2000);
3141 MT_BUG_ON(mt, mas.last != 0x2500);
3142 MT_BUG_ON(mt, !mas_active(mas));
3144 /* next:active -> active out of range*/
3145 entry = mas_next(&mas, 0x2999);
3146 MT_BUG_ON(mt, entry != NULL);
3147 MT_BUG_ON(mt, mas.index != 0x2501);
3148 MT_BUG_ON(mt, mas.last != 0x2fff);
3149 MT_BUG_ON(mt, !mas_active(mas));
3151 /* Continue after out of range*/
3152 entry = mas_next(&mas, ULONG_MAX);
3153 MT_BUG_ON(mt, entry != ptr3);
3154 MT_BUG_ON(mt, mas.index != 0x3000);
3155 MT_BUG_ON(mt, mas.last != 0x3500);
3156 MT_BUG_ON(mt, !mas_active(mas));
3158 /* next:active -> active out of range*/
3159 entry = mas_next(&mas, ULONG_MAX);
3160 MT_BUG_ON(mt, entry != NULL);
3161 MT_BUG_ON(mt, mas.index != 0x3501);
3162 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3163 MT_BUG_ON(mt, !mas_active(mas));
3165 /* next: none -> active, skip value at location */
3167 entry = mas_next(&mas, ULONG_MAX);
3168 mas.node = MAS_NONE;
3170 entry = mas_next(&mas, ULONG_MAX);
3171 MT_BUG_ON(mt, entry != ptr2);
3172 MT_BUG_ON(mt, mas.index != 0x2000);
3173 MT_BUG_ON(mt, mas.last != 0x2500);
3174 MT_BUG_ON(mt, !mas_active(mas));
3176 /* prev:active ->active */
3177 entry = mas_prev(&mas, 0);
3178 MT_BUG_ON(mt, entry != ptr);
3179 MT_BUG_ON(mt, mas.index != 0x1000);
3180 MT_BUG_ON(mt, mas.last != 0x1500);
3181 MT_BUG_ON(mt, !mas_active(mas));
3183 /* prev:active -> active out of range*/
3184 entry = mas_prev(&mas, 0);
3185 MT_BUG_ON(mt, entry != NULL);
3186 MT_BUG_ON(mt, mas.index != 0);
3187 MT_BUG_ON(mt, mas.last != 0x0FFF);
3188 MT_BUG_ON(mt, !mas_active(mas));
3190 /* prev: pause ->active */
3191 mas_set(&mas, 0x3600);
3192 entry = mas_prev(&mas, 0);
3193 MT_BUG_ON(mt, entry != ptr3);
3195 entry = mas_prev(&mas, 0);
3196 MT_BUG_ON(mt, entry != ptr2);
3197 MT_BUG_ON(mt, mas.index != 0x2000);
3198 MT_BUG_ON(mt, mas.last != 0x2500);
3199 MT_BUG_ON(mt, !mas_active(mas));
3201 /* prev:active -> active out of range*/
3202 entry = mas_prev(&mas, 0x1600);
3203 MT_BUG_ON(mt, entry != NULL);
3204 MT_BUG_ON(mt, mas.index != 0x1501);
3205 MT_BUG_ON(mt, mas.last != 0x1FFF);
3206 MT_BUG_ON(mt, !mas_active(mas));
3208 /* prev: active ->active, continue*/
3209 entry = mas_prev(&mas, 0);
3210 MT_BUG_ON(mt, entry != ptr);
3211 MT_BUG_ON(mt, mas.index != 0x1000);
3212 MT_BUG_ON(mt, mas.last != 0x1500);
3213 MT_BUG_ON(mt, !mas_active(mas));
3215 /* find: start ->active */
3217 entry = mas_find(&mas, ULONG_MAX);
3218 MT_BUG_ON(mt, entry != ptr);
3219 MT_BUG_ON(mt, mas.index != 0x1000);
3220 MT_BUG_ON(mt, mas.last != 0x1500);
3221 MT_BUG_ON(mt, !mas_active(mas));
3223 /* find: pause ->active */
3226 entry = mas_find(&mas, ULONG_MAX);
3227 MT_BUG_ON(mt, entry != ptr);
3228 MT_BUG_ON(mt, mas.index != 0x1000);
3229 MT_BUG_ON(mt, mas.last != 0x1500);
3230 MT_BUG_ON(mt, !mas_active(mas));
3232 /* find: start ->active on value */;
3233 mas_set(&mas, 1200);
3234 entry = mas_find(&mas, ULONG_MAX);
3235 MT_BUG_ON(mt, entry != ptr);
3236 MT_BUG_ON(mt, mas.index != 0x1000);
3237 MT_BUG_ON(mt, mas.last != 0x1500);
3238 MT_BUG_ON(mt, !mas_active(mas));
3240 /* find:active ->active */
3241 entry = mas_find(&mas, ULONG_MAX);
3242 MT_BUG_ON(mt, entry != ptr2);
3243 MT_BUG_ON(mt, mas.index != 0x2000);
3244 MT_BUG_ON(mt, mas.last != 0x2500);
3245 MT_BUG_ON(mt, !mas_active(mas));
3248 /* find:active -> active (NULL)*/
3249 entry = mas_find(&mas, 0x2700);
3250 MT_BUG_ON(mt, entry != NULL);
3251 MT_BUG_ON(mt, mas.index != 0x2501);
3252 MT_BUG_ON(mt, mas.last != 0x2FFF);
3253 MT_BUG_ON(mt, !mas_active(mas));
3255 /* find: none ->active */
3256 entry = mas_find(&mas, 0x5000);
3257 MT_BUG_ON(mt, entry != ptr3);
3258 MT_BUG_ON(mt, mas.index != 0x3000);
3259 MT_BUG_ON(mt, mas.last != 0x3500);
3260 MT_BUG_ON(mt, !mas_active(mas));
3262 /* find:active -> active (NULL) end*/
3263 entry = mas_find(&mas, ULONG_MAX);
3264 MT_BUG_ON(mt, entry != NULL);
3265 MT_BUG_ON(mt, mas.index != 0x3501);
3266 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3267 MT_BUG_ON(mt, !mas_active(mas));
3269 /* find_rev: active (END) ->active */
3270 entry = mas_find_rev(&mas, 0);
3271 MT_BUG_ON(mt, entry != ptr3);
3272 MT_BUG_ON(mt, mas.index != 0x3000);
3273 MT_BUG_ON(mt, mas.last != 0x3500);
3274 MT_BUG_ON(mt, !mas_active(mas));
3276 /* find_rev:active ->active */
3277 entry = mas_find_rev(&mas, 0);
3278 MT_BUG_ON(mt, entry != ptr2);
3279 MT_BUG_ON(mt, mas.index != 0x2000);
3280 MT_BUG_ON(mt, mas.last != 0x2500);
3281 MT_BUG_ON(mt, !mas_active(mas));
3283 /* find_rev: pause ->active */
3285 entry = mas_find_rev(&mas, 0);
3286 MT_BUG_ON(mt, entry != ptr);
3287 MT_BUG_ON(mt, mas.index != 0x1000);
3288 MT_BUG_ON(mt, mas.last != 0x1500);
3289 MT_BUG_ON(mt, !mas_active(mas));
3291 /* find_rev:active -> active */
3292 entry = mas_find_rev(&mas, 0);
3293 MT_BUG_ON(mt, entry != NULL);
3294 MT_BUG_ON(mt, mas.index != 0);
3295 MT_BUG_ON(mt, mas.last != 0x0FFF);
3296 MT_BUG_ON(mt, !mas_active(mas));
3298 /* find_rev: start ->active */
3299 mas_set(&mas, 0x1200);
3300 entry = mas_find_rev(&mas, 0);
3301 MT_BUG_ON(mt, entry != ptr);
3302 MT_BUG_ON(mt, mas.index != 0x1000);
3303 MT_BUG_ON(mt, mas.last != 0x1500);
3304 MT_BUG_ON(mt, !mas_active(mas));
3306 /* mas_walk start ->active */
3307 mas_set(&mas, 0x1200);
3308 entry = mas_walk(&mas);
3309 MT_BUG_ON(mt, entry != ptr);
3310 MT_BUG_ON(mt, mas.index != 0x1000);
3311 MT_BUG_ON(mt, mas.last != 0x1500);
3312 MT_BUG_ON(mt, !mas_active(mas));
3314 /* mas_walk start ->active */
3315 mas_set(&mas, 0x1600);
3316 entry = mas_walk(&mas);
3317 MT_BUG_ON(mt, entry != NULL);
3318 MT_BUG_ON(mt, mas.index != 0x1501);
3319 MT_BUG_ON(mt, mas.last != 0x1fff);
3320 MT_BUG_ON(mt, !mas_active(mas));
3322 /* mas_walk pause ->active */
3323 mas_set(&mas, 0x1200);
3325 entry = mas_walk(&mas);
3326 MT_BUG_ON(mt, entry != ptr);
3327 MT_BUG_ON(mt, mas.index != 0x1000);
3328 MT_BUG_ON(mt, mas.last != 0x1500);
3329 MT_BUG_ON(mt, !mas_active(mas));
3331 /* mas_walk pause -> active */
3332 mas_set(&mas, 0x1600);
3334 entry = mas_walk(&mas);
3335 MT_BUG_ON(mt, entry != NULL);
3336 MT_BUG_ON(mt, mas.index != 0x1501);
3337 MT_BUG_ON(mt, mas.last != 0x1fff);
3338 MT_BUG_ON(mt, !mas_active(mas));
3340 /* mas_walk none -> active */
3341 mas_set(&mas, 0x1200);
3342 mas.node = MAS_NONE;
3343 entry = mas_walk(&mas);
3344 MT_BUG_ON(mt, entry != ptr);
3345 MT_BUG_ON(mt, mas.index != 0x1000);
3346 MT_BUG_ON(mt, mas.last != 0x1500);
3347 MT_BUG_ON(mt, !mas_active(mas));
3349 /* mas_walk none -> active */
3350 mas_set(&mas, 0x1600);
3351 mas.node = MAS_NONE;
3352 entry = mas_walk(&mas);
3353 MT_BUG_ON(mt, entry != NULL);
3354 MT_BUG_ON(mt, mas.index != 0x1501);
3355 MT_BUG_ON(mt, mas.last != 0x1fff);
3356 MT_BUG_ON(mt, !mas_active(mas));
3358 /* mas_walk active -> active */
3362 entry = mas_walk(&mas);
3363 MT_BUG_ON(mt, entry != ptr);
3364 MT_BUG_ON(mt, mas.index != 0x1000);
3365 MT_BUG_ON(mt, mas.last != 0x1500);
3366 MT_BUG_ON(mt, !mas_active(mas));
3368 /* mas_walk active -> active */
3371 entry = mas_walk(&mas);
3372 MT_BUG_ON(mt, entry != NULL);
3373 MT_BUG_ON(mt, mas.index != 0x1501);
3374 MT_BUG_ON(mt, mas.last != 0x1fff);
3375 MT_BUG_ON(mt, !mas_active(mas));
3380 static DEFINE_MTREE(tree);
3381 static int __init maple_tree_seed(void)
3383 unsigned long set[] = { 5015, 5014, 5017, 25, 1000,
3384 1001, 1002, 1003, 1005, 0,
3388 pr_info("\nTEST STARTING\n\n");
3390 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3391 check_root_expand(&tree);
3392 mtree_destroy(&tree);
3394 #if defined(BENCH_SLOT_STORE)
3396 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3397 bench_slot_store(&tree);
3398 mtree_destroy(&tree);
3401 #if defined(BENCH_NODE_STORE)
3403 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3404 bench_node_store(&tree);
3405 mtree_destroy(&tree);
3408 #if defined(BENCH_AWALK)
3410 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3412 mtree_destroy(&tree);
3415 #if defined(BENCH_WALK)
3417 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3419 mtree_destroy(&tree);
3422 #if defined(BENCH_FORK)
3424 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3425 bench_forking(&tree);
3426 mtree_destroy(&tree);
3429 #if defined(BENCH_MT_FOR_EACH)
3431 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3432 bench_mt_for_each(&tree);
3433 mtree_destroy(&tree);
3437 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3438 check_iteration(&tree);
3439 mtree_destroy(&tree);
3441 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3442 check_forking(&tree);
3443 mtree_destroy(&tree);
3445 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3446 check_mas_store_gfp(&tree);
3447 mtree_destroy(&tree);
3449 /* Test ranges (store and insert) */
3450 mt_init_flags(&tree, 0);
3451 check_ranges(&tree);
3452 mtree_destroy(&tree);
3454 #if defined(CONFIG_64BIT)
3455 /* These tests have ranges outside of 4GB */
3456 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3457 check_alloc_range(&tree);
3458 mtree_destroy(&tree);
3460 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3461 check_alloc_rev_range(&tree);
3462 mtree_destroy(&tree);
3465 mt_init_flags(&tree, 0);
3467 check_load(&tree, set[0], NULL); /* See if 5015 -> NULL */
3469 check_insert(&tree, set[9], &tree); /* Insert 0 */
3470 check_load(&tree, set[9], &tree); /* See if 0 -> &tree */
3471 check_load(&tree, set[0], NULL); /* See if 5015 -> NULL */
3473 check_insert(&tree, set[10], ptr); /* Insert 5003 */
3474 check_load(&tree, set[9], &tree); /* See if 0 -> &tree */
3475 check_load(&tree, set[11], NULL); /* See if 5002 -> NULL */
3476 check_load(&tree, set[10], ptr); /* See if 5003 -> ptr */
3478 /* Clear out the tree */
3479 mtree_destroy(&tree);
3481 /* Try to insert, insert a dup, and load back what was inserted. */
3482 mt_init_flags(&tree, 0);
3483 check_insert(&tree, set[0], &tree); /* Insert 5015 */
3484 check_dup_insert(&tree, set[0], &tree); /* Insert 5015 again */
3485 check_load(&tree, set[0], &tree); /* See if 5015 -> &tree */
3488 * Second set of tests try to load a value that doesn't exist, inserts
3489 * a second value, then loads the value again
3491 check_load(&tree, set[1], NULL); /* See if 5014 -> NULL */
3492 check_insert(&tree, set[1], ptr); /* insert 5014 -> ptr */
3493 check_load(&tree, set[1], ptr); /* See if 5014 -> ptr */
3494 check_load(&tree, set[0], &tree); /* See if 5015 -> &tree */
3496 * Tree currently contains:
3497 * p[0]: 14 -> (nil) p[1]: 15 -> ptr p[2]: 16 -> &tree p[3]: 0 -> (nil)
3499 check_insert(&tree, set[6], ptr); /* insert 1002 -> ptr */
3500 check_insert(&tree, set[7], &tree); /* insert 1003 -> &tree */
3502 check_load(&tree, set[0], &tree); /* See if 5015 -> &tree */
3503 check_load(&tree, set[1], ptr); /* See if 5014 -> ptr */
3504 check_load(&tree, set[6], ptr); /* See if 1002 -> ptr */
3505 check_load(&tree, set[7], &tree); /* 1003 = &tree ? */
3507 /* Clear out tree */
3508 mtree_destroy(&tree);
3510 mt_init_flags(&tree, 0);
3511 /* Test inserting into a NULL hole. */
3512 check_insert(&tree, set[5], ptr); /* insert 1001 -> ptr */
3513 check_insert(&tree, set[7], &tree); /* insert 1003 -> &tree */
3514 check_insert(&tree, set[6], ptr); /* insert 1002 -> ptr */
3515 check_load(&tree, set[5], ptr); /* See if 1001 -> ptr */
3516 check_load(&tree, set[6], ptr); /* See if 1002 -> ptr */
3517 check_load(&tree, set[7], &tree); /* See if 1003 -> &tree */
3519 /* Clear out the tree */
3520 mtree_destroy(&tree);
3522 mt_init_flags(&tree, 0);
3524 * set[] = {5015, 5014, 5017, 25, 1000,
3525 * 1001, 1002, 1003, 1005, 0,
3529 check_insert(&tree, set[0], ptr); /* 5015 */
3530 check_insert(&tree, set[1], &tree); /* 5014 */
3531 check_insert(&tree, set[2], ptr); /* 5017 */
3532 check_insert(&tree, set[3], &tree); /* 25 */
3533 check_load(&tree, set[0], ptr);
3534 check_load(&tree, set[1], &tree);
3535 check_load(&tree, set[2], ptr);
3536 check_load(&tree, set[3], &tree);
3537 check_insert(&tree, set[4], ptr); /* 1000 < Should split. */
3538 check_load(&tree, set[0], ptr);
3539 check_load(&tree, set[1], &tree);
3540 check_load(&tree, set[2], ptr);
3541 check_load(&tree, set[3], &tree); /*25 */
3542 check_load(&tree, set[4], ptr);
3543 check_insert(&tree, set[5], &tree); /* 1001 */
3544 check_load(&tree, set[0], ptr);
3545 check_load(&tree, set[1], &tree);
3546 check_load(&tree, set[2], ptr);
3547 check_load(&tree, set[3], &tree);
3548 check_load(&tree, set[4], ptr);
3549 check_load(&tree, set[5], &tree);
3550 check_insert(&tree, set[6], ptr);
3551 check_load(&tree, set[0], ptr);
3552 check_load(&tree, set[1], &tree);
3553 check_load(&tree, set[2], ptr);
3554 check_load(&tree, set[3], &tree);
3555 check_load(&tree, set[4], ptr);
3556 check_load(&tree, set[5], &tree);
3557 check_load(&tree, set[6], ptr);
3558 check_insert(&tree, set[7], &tree);
3559 check_load(&tree, set[0], ptr);
3560 check_insert(&tree, set[8], ptr);
3562 check_insert(&tree, set[9], &tree);
3564 check_load(&tree, set[0], ptr);
3565 check_load(&tree, set[1], &tree);
3566 check_load(&tree, set[2], ptr);
3567 check_load(&tree, set[3], &tree);
3568 check_load(&tree, set[4], ptr);
3569 check_load(&tree, set[5], &tree);
3570 check_load(&tree, set[6], ptr);
3571 check_load(&tree, set[9], &tree);
3572 mtree_destroy(&tree);
3574 mt_init_flags(&tree, 0);
3575 check_seq(&tree, 16, false);
3576 mtree_destroy(&tree);
3578 mt_init_flags(&tree, 0);
3579 check_seq(&tree, 1000, true);
3580 mtree_destroy(&tree);
3582 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3583 check_rev_seq(&tree, 1000, true);
3584 mtree_destroy(&tree);
3586 check_lower_bound_split(&tree);
3587 check_upper_bound_split(&tree);
3588 check_mid_split(&tree);
3590 mt_init_flags(&tree, 0);
3591 check_next_entry(&tree);
3593 check_find_2(&tree);
3594 mtree_destroy(&tree);
3596 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3597 check_prev_entry(&tree);
3598 mtree_destroy(&tree);
3600 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3601 check_gap_combining(&tree);
3602 mtree_destroy(&tree);
3604 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3605 check_node_overwrite(&tree);
3606 mtree_destroy(&tree);
3608 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3609 next_prev_test(&tree);
3610 mtree_destroy(&tree);
3612 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3613 check_spanning_relatives(&tree);
3614 mtree_destroy(&tree);
3616 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3617 check_rev_find(&tree);
3618 mtree_destroy(&tree);
3620 mt_init_flags(&tree, 0);
3621 check_fuzzer(&tree);
3622 mtree_destroy(&tree);
3624 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3626 mtree_destroy(&tree);
3628 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3629 check_bnode_min_spanning(&tree);
3630 mtree_destroy(&tree);
3632 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3633 check_empty_area_window(&tree);
3634 mtree_destroy(&tree);
3636 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3637 check_empty_area_fill(&tree);
3638 mtree_destroy(&tree);
3641 mt_init_flags(&tree, MT_FLAGS_ALLOC_RANGE);
3642 check_state_handling(&tree);
3643 mtree_destroy(&tree);
3649 pr_info("maple_tree: %u of %u tests passed\n",
3650 atomic_read(&maple_tree_tests_passed),
3651 atomic_read(&maple_tree_tests_run));
3652 if (atomic_read(&maple_tree_tests_run) ==
3653 atomic_read(&maple_tree_tests_passed))
3659 static void __exit maple_tree_harvest(void)
3664 module_init(maple_tree_seed);
3665 module_exit(maple_tree_harvest);
3666 MODULE_AUTHOR("Liam R. Howlett <Liam.Howlett@Oracle.com>");
3667 MODULE_LICENSE("GPL");