mtree_destroy(mt);
}
+static noinline void check_find_2(struct maple_tree *mt)
+{
+ unsigned long i, j;
+ void *entry;
+ MA_STATE(mas, mt, 0, 0);
+
+ mas_for_each(&mas, entry, ULONG_MAX)
+ MT_BUG_ON(mt, true);
+
+ for (i = 0; i < 256; i++) {
+ mtree_insert_index(mt, i, GFP_KERNEL);
+ j = 0;
+ mas_set(&mas, 0);
+ mas_for_each(&mas, entry, ULONG_MAX) {
+ MT_BUG_ON(mt, entry != xa_mk_value(j));
+ j++;
+ }
+ MT_BUG_ON(mt, j != i + 1);
+ }
+
+ mtree_destroy(mt);
+}
#define erase_ptr(i) entry[i%2]
#define erase_check_load(mt, i) check_load(mt, set[i], entry[i%2])
check_mid_split(&tree);
check_find(&tree);
+ check_find_2(&tree);
rcu_barrier();