projects / linux-2.6-block.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
xarray: Move multiorder_shrink to kernel tests
[linux-2.6-block.git] / lib / test_xarray.c
CommitLineData
ad3d6c72
MW		 1// SPDX-License-Identifier: GPL-2.0+
2/*
3 * test_xarray.c: Test the XArray API
4 * Copyright (c) 2017-2018 Microsoft Corporation
5 * Author: Matthew Wilcox <willy@infradead.org>
6 */
7
8#include <linux/xarray.h>
9#include <linux/module.h>
10
11static unsigned int tests_run;
12static unsigned int tests_passed;
13
14#ifndef XA_DEBUG
15# ifdef __KERNEL__
16void xa_dump(const struct xarray *xa) { }
17# endif
18#undef XA_BUG_ON
19#define XA_BUG_ON(xa, x) do { \
20 tests_run++; \
21 if (x) { \
22 printk("BUG at %s:%d\n", __func__, __LINE__); \
23 xa_dump(xa); \
24 dump_stack(); \
25 } else { \
26 tests_passed++; \
27 } \
28} while (0)
29#endif
30
31static void *xa_store_index(struct xarray *xa, unsigned long index, gfp_t gfp)
32{
58d6ea30 33 return xa_store(xa, index, xa_mk_value(index & LONG_MAX), gfp);
ad3d6c72
MW		 34}
35
371c752d
MW		 36static void xa_alloc_index(struct xarray *xa, unsigned long index, gfp_t gfp)
37{
38 u32 id = 0;
39
40 XA_BUG_ON(xa, xa_alloc(xa, &id, UINT_MAX, xa_mk_value(index & LONG_MAX),
41 gfp) != 0);
42 XA_BUG_ON(xa, id != index);
43}
44
ad3d6c72
MW		 45static void xa_erase_index(struct xarray *xa, unsigned long index)
46{
58d6ea30
MW		 47 XA_BUG_ON(xa, xa_erase(xa, index) != xa_mk_value(index & LONG_MAX));
48 XA_BUG_ON(xa, xa_load(xa, index) != NULL);
49}
50
51/*
52 * If anyone needs this, please move it to xarray.c. We have no current
53 * users outside the test suite because all current multislot users want
54 * to use the advanced API.
55 */
56static void *xa_store_order(struct xarray *xa, unsigned long index,
57 unsigned order, void *entry, gfp_t gfp)
58{
59 XA_STATE_ORDER(xas, xa, index, order);
60 void *curr;
61
62 do {
63 xas_lock(&xas);
64 curr = xas_store(&xas, entry);
65 xas_unlock(&xas);
66 } while (xas_nomem(&xas, gfp));
67
68 return curr;
69}
70
71static noinline void check_xa_err(struct xarray *xa)
72{
73 XA_BUG_ON(xa, xa_err(xa_store_index(xa, 0, GFP_NOWAIT)) != 0);
74 XA_BUG_ON(xa, xa_err(xa_erase(xa, 0)) != 0);
75#ifndef __KERNEL__
76 /* The kernel does not fail GFP_NOWAIT allocations */
77 XA_BUG_ON(xa, xa_err(xa_store_index(xa, 1, GFP_NOWAIT)) != -ENOMEM);
78 XA_BUG_ON(xa, xa_err(xa_store_index(xa, 1, GFP_NOWAIT)) != -ENOMEM);
79#endif
80 XA_BUG_ON(xa, xa_err(xa_store_index(xa, 1, GFP_KERNEL)) != 0);
81 XA_BUG_ON(xa, xa_err(xa_store(xa, 1, xa_mk_value(0), GFP_KERNEL)) != 0);
82 XA_BUG_ON(xa, xa_err(xa_erase(xa, 1)) != 0);
83// kills the test-suite :-(
84// XA_BUG_ON(xa, xa_err(xa_store(xa, 0, xa_mk_internal(0), 0)) != -EINVAL);
ad3d6c72
MW		 85}
86
b803b428
MW		 87static noinline void check_xas_retry(struct xarray *xa)
88{
89 XA_STATE(xas, xa, 0);
90 void *entry;
91
92 xa_store_index(xa, 0, GFP_KERNEL);
93 xa_store_index(xa, 1, GFP_KERNEL);
94
95 rcu_read_lock();
96 XA_BUG_ON(xa, xas_find(&xas, ULONG_MAX) != xa_mk_value(0));
97 xa_erase_index(xa, 1);
98 XA_BUG_ON(xa, !xa_is_retry(xas_reload(&xas)));
99 XA_BUG_ON(xa, xas_retry(&xas, NULL));
100 XA_BUG_ON(xa, xas_retry(&xas, xa_mk_value(0)));
101 xas_reset(&xas);
102 XA_BUG_ON(xa, xas.xa_node != XAS_RESTART);
103 XA_BUG_ON(xa, xas_next_entry(&xas, ULONG_MAX) != xa_mk_value(0));
104 XA_BUG_ON(xa, xas.xa_node != NULL);
105
106 XA_BUG_ON(xa, xa_store_index(xa, 1, GFP_KERNEL) != NULL);
107 XA_BUG_ON(xa, !xa_is_internal(xas_reload(&xas)));
108 xas.xa_node = XAS_RESTART;
109 XA_BUG_ON(xa, xas_next_entry(&xas, ULONG_MAX) != xa_mk_value(0));
110 rcu_read_unlock();
111
112 /* Make sure we can iterate through retry entries */
113 xas_lock(&xas);
114 xas_set(&xas, 0);
115 xas_store(&xas, XA_RETRY_ENTRY);
116 xas_set(&xas, 1);
117 xas_store(&xas, XA_RETRY_ENTRY);
118
119 xas_set(&xas, 0);
120 xas_for_each(&xas, entry, ULONG_MAX) {
121 xas_store(&xas, xa_mk_value(xas.xa_index));
122 }
123 xas_unlock(&xas);
124
125 xa_erase_index(xa, 0);
126 xa_erase_index(xa, 1);
127}
128
ad3d6c72
MW		 129static noinline void check_xa_load(struct xarray *xa)
130{
131 unsigned long i, j;
132
133 for (i = 0; i < 1024; i++) {
134 for (j = 0; j < 1024; j++) {
135 void *entry = xa_load(xa, j);
136 if (j < i)
137 XA_BUG_ON(xa, xa_to_value(entry) != j);
138 else
139 XA_BUG_ON(xa, entry);
140 }
141 XA_BUG_ON(xa, xa_store_index(xa, i, GFP_KERNEL) != NULL);
142 }
143
144 for (i = 0; i < 1024; i++) {
145 for (j = 0; j < 1024; j++) {
146 void *entry = xa_load(xa, j);
147 if (j >= i)
148 XA_BUG_ON(xa, xa_to_value(entry) != j);
149 else
150 XA_BUG_ON(xa, entry);
151 }
152 xa_erase_index(xa, i);
153 }
154 XA_BUG_ON(xa, !xa_empty(xa));
155}
156
9b89a035
MW		 157static noinline void check_xa_mark_1(struct xarray *xa, unsigned long index)
158{
58d6ea30
MW		 159 unsigned int order;
160 unsigned int max_order = IS_ENABLED(CONFIG_XARRAY_MULTI) ? 8 : 1;
161
9b89a035
MW		 162 /* NULL elements have no marks set */
163 XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
164 xa_set_mark(xa, index, XA_MARK_0);
165 XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
166
167 /* Storing a pointer will not make a mark appear */
168 XA_BUG_ON(xa, xa_store_index(xa, index, GFP_KERNEL) != NULL);
169 XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
170 xa_set_mark(xa, index, XA_MARK_0);
171 XA_BUG_ON(xa, !xa_get_mark(xa, index, XA_MARK_0));
172
173 /* Setting one mark will not set another mark */
174 XA_BUG_ON(xa, xa_get_mark(xa, index + 1, XA_MARK_0));
175 XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_1));
176
177 /* Storing NULL clears marks, and they can't be set again */
178 xa_erase_index(xa, index);
179 XA_BUG_ON(xa, !xa_empty(xa));
180 XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
181 xa_set_mark(xa, index, XA_MARK_0);
182 XA_BUG_ON(xa, xa_get_mark(xa, index, XA_MARK_0));
58d6ea30
MW		 183
184 /*
185 * Storing a multi-index entry over entries with marks gives the
186 * entire entry the union of the marks
187 */
188 BUG_ON((index % 4) != 0);
189 for (order = 2; order < max_order; order++) {
190 unsigned long base = round_down(index, 1UL << order);
191 unsigned long next = base + (1UL << order);
192 unsigned long i;
193
194 XA_BUG_ON(xa, xa_store_index(xa, index + 1, GFP_KERNEL));
195 xa_set_mark(xa, index + 1, XA_MARK_0);
196 XA_BUG_ON(xa, xa_store_index(xa, index + 2, GFP_KERNEL));
197 xa_set_mark(xa, index + 2, XA_MARK_1);
198 XA_BUG_ON(xa, xa_store_index(xa, next, GFP_KERNEL));
199 xa_store_order(xa, index, order, xa_mk_value(index),
200 GFP_KERNEL);
201 for (i = base; i < next; i++) {
93eb07f7
MW		 202 XA_STATE(xas, xa, i);
203 unsigned int seen = 0;
204 void *entry;
205
58d6ea30
MW		 206 XA_BUG_ON(xa, !xa_get_mark(xa, i, XA_MARK_0));
207 XA_BUG_ON(xa, !xa_get_mark(xa, i, XA_MARK_1));
208 XA_BUG_ON(xa, xa_get_mark(xa, i, XA_MARK_2));
93eb07f7
MW		 209
210 /* We should see two elements in the array */
211 xas_for_each(&xas, entry, ULONG_MAX)
212 seen++;
213 XA_BUG_ON(xa, seen != 2);
214
215 /* One of which is marked */
216 xas_set(&xas, 0);
217 seen = 0;
218 xas_for_each_marked(&xas, entry, ULONG_MAX, XA_MARK_0)
219 seen++;
220 XA_BUG_ON(xa, seen != 1);
58d6ea30
MW		 221 }
222 XA_BUG_ON(xa, xa_get_mark(xa, next, XA_MARK_0));
223 XA_BUG_ON(xa, xa_get_mark(xa, next, XA_MARK_1));
224 XA_BUG_ON(xa, xa_get_mark(xa, next, XA_MARK_2));
225 xa_erase_index(xa, index);
226 xa_erase_index(xa, next);
227 XA_BUG_ON(xa, !xa_empty(xa));
228 }
229 XA_BUG_ON(xa, !xa_empty(xa));
9b89a035
MW		 230}
231
adb9d9c4
MW		 232static noinline void check_xa_mark_2(struct xarray *xa)
233{
234 XA_STATE(xas, xa, 0);
235 unsigned long index;
236 unsigned int count = 0;
237 void *entry;
238
239 xa_store_index(xa, 0, GFP_KERNEL);
240 xa_set_mark(xa, 0, XA_MARK_0);
241 xas_lock(&xas);
242 xas_load(&xas);
243 xas_init_marks(&xas);
244 xas_unlock(&xas);
245 XA_BUG_ON(xa, !xa_get_mark(xa, 0, XA_MARK_0) == 0);
246
247 for (index = 3500; index < 4500; index++) {
248 xa_store_index(xa, index, GFP_KERNEL);
249 xa_set_mark(xa, index, XA_MARK_0);
250 }
251
252 xas_reset(&xas);
253 rcu_read_lock();
254 xas_for_each_marked(&xas, entry, ULONG_MAX, XA_MARK_0)
255 count++;
256 rcu_read_unlock();
257 XA_BUG_ON(xa, count != 1000);
258
259 xas_lock(&xas);
260 xas_for_each(&xas, entry, ULONG_MAX) {
261 xas_init_marks(&xas);
262 XA_BUG_ON(xa, !xa_get_mark(xa, xas.xa_index, XA_MARK_0));
263 XA_BUG_ON(xa, !xas_get_mark(&xas, XA_MARK_0));
264 }
265 xas_unlock(&xas);
266
267 xa_destroy(xa);
268}
269
9b89a035
MW		 270static noinline void check_xa_mark(struct xarray *xa)
271{
272 unsigned long index;
273
274 for (index = 0; index < 16384; index += 4)
275 check_xa_mark_1(xa, index);
adb9d9c4
MW		 276
277 check_xa_mark_2(xa);
9b89a035
MW		 278}
279
58d6ea30
MW		 280static noinline void check_xa_shrink(struct xarray *xa)
281{
282 XA_STATE(xas, xa, 1);
283 struct xa_node *node;
93eb07f7
MW		 284 unsigned int order;
285 unsigned int max_order = IS_ENABLED(CONFIG_XARRAY_MULTI) ? 15 : 1;
58d6ea30
MW		 286
287 XA_BUG_ON(xa, !xa_empty(xa));
288 XA_BUG_ON(xa, xa_store_index(xa, 0, GFP_KERNEL) != NULL);
289 XA_BUG_ON(xa, xa_store_index(xa, 1, GFP_KERNEL) != NULL);
290
291 /*
292 * Check that erasing the entry at 1 shrinks the tree and properly
293 * marks the node as being deleted.
294 */
295 xas_lock(&xas);
296 XA_BUG_ON(xa, xas_load(&xas) != xa_mk_value(1));
297 node = xas.xa_node;
298 XA_BUG_ON(xa, xa_entry_locked(xa, node, 0) != xa_mk_value(0));
299 XA_BUG_ON(xa, xas_store(&xas, NULL) != xa_mk_value(1));
300 XA_BUG_ON(xa, xa_load(xa, 1) != NULL);
301 XA_BUG_ON(xa, xas.xa_node != XAS_BOUNDS);
302 XA_BUG_ON(xa, xa_entry_locked(xa, node, 0) != XA_RETRY_ENTRY);
303 XA_BUG_ON(xa, xas_load(&xas) != NULL);
304 xas_unlock(&xas);
305 XA_BUG_ON(xa, xa_load(xa, 0) != xa_mk_value(0));
306 xa_erase_index(xa, 0);
307 XA_BUG_ON(xa, !xa_empty(xa));
93eb07f7
MW		 308
309 for (order = 0; order < max_order; order++) {
310 unsigned long max = (1UL << order) - 1;
311 xa_store_order(xa, 0, order, xa_mk_value(0), GFP_KERNEL);
312 XA_BUG_ON(xa, xa_load(xa, max) != xa_mk_value(0));
313 XA_BUG_ON(xa, xa_load(xa, max + 1) != NULL);
314 rcu_read_lock();
315 node = xa_head(xa);
316 rcu_read_unlock();
317 XA_BUG_ON(xa, xa_store_index(xa, ULONG_MAX, GFP_KERNEL) !=
318 NULL);
319 rcu_read_lock();
320 XA_BUG_ON(xa, xa_head(xa) == node);
321 rcu_read_unlock();
322 XA_BUG_ON(xa, xa_load(xa, max + 1) != NULL);
323 xa_erase_index(xa, ULONG_MAX);
324 XA_BUG_ON(xa, xa->xa_head != node);
325 xa_erase_index(xa, 0);
326 }
58d6ea30
MW		 327}
328
41aec91f
MW		 329static noinline void check_cmpxchg(struct xarray *xa)
330{
331 void *FIVE = xa_mk_value(5);
332 void *SIX = xa_mk_value(6);
333 void *LOTS = xa_mk_value(12345678);
334
335 XA_BUG_ON(xa, !xa_empty(xa));
336 XA_BUG_ON(xa, xa_store_index(xa, 12345678, GFP_KERNEL) != NULL);
337 XA_BUG_ON(xa, xa_insert(xa, 12345678, xa, GFP_KERNEL) != -EEXIST);
338 XA_BUG_ON(xa, xa_cmpxchg(xa, 12345678, SIX, FIVE, GFP_KERNEL) != LOTS);
339 XA_BUG_ON(xa, xa_cmpxchg(xa, 12345678, LOTS, FIVE, GFP_KERNEL) != LOTS);
340 XA_BUG_ON(xa, xa_cmpxchg(xa, 12345678, FIVE, LOTS, GFP_KERNEL) != FIVE);
341 XA_BUG_ON(xa, xa_cmpxchg(xa, 5, FIVE, NULL, GFP_KERNEL) != NULL);
342 XA_BUG_ON(xa, xa_cmpxchg(xa, 5, NULL, FIVE, GFP_KERNEL) != NULL);
343 xa_erase_index(xa, 12345678);
344 xa_erase_index(xa, 5);
345 XA_BUG_ON(xa, !xa_empty(xa));
346}
347
9f14d4f1
MW		 348static noinline void check_reserve(struct xarray *xa)
349{
350 void *entry;
351 unsigned long index = 0;
352
353 /* An array with a reserved entry is not empty */
354 XA_BUG_ON(xa, !xa_empty(xa));
355 xa_reserve(xa, 12345678, GFP_KERNEL);
356 XA_BUG_ON(xa, xa_empty(xa));
357 XA_BUG_ON(xa, xa_load(xa, 12345678));
358 xa_release(xa, 12345678);
359 XA_BUG_ON(xa, !xa_empty(xa));
360
361 /* Releasing a used entry does nothing */
362 xa_reserve(xa, 12345678, GFP_KERNEL);
363 XA_BUG_ON(xa, xa_store_index(xa, 12345678, GFP_NOWAIT) != NULL);
364 xa_release(xa, 12345678);
365 xa_erase_index(xa, 12345678);
366 XA_BUG_ON(xa, !xa_empty(xa));
367
368 /* cmpxchg sees a reserved entry as NULL */
369 xa_reserve(xa, 12345678, GFP_KERNEL);
370 XA_BUG_ON(xa, xa_cmpxchg(xa, 12345678, NULL, xa_mk_value(12345678),
371 GFP_NOWAIT) != NULL);
372 xa_release(xa, 12345678);
373 xa_erase_index(xa, 12345678);
374 XA_BUG_ON(xa, !xa_empty(xa));
375
376 /* Can iterate through a reserved entry */
377 xa_store_index(xa, 5, GFP_KERNEL);
378 xa_reserve(xa, 6, GFP_KERNEL);
379 xa_store_index(xa, 7, GFP_KERNEL);
380
381 xa_for_each(xa, entry, index, ULONG_MAX, XA_PRESENT) {
382 XA_BUG_ON(xa, index != 5 && index != 7);
383 }
384 xa_destroy(xa);
385}
386
b803b428
MW		 387static noinline void check_xas_erase(struct xarray *xa)
388{
389 XA_STATE(xas, xa, 0);
390 void *entry;
391 unsigned long i, j;
392
393 for (i = 0; i < 200; i++) {
394 for (j = i; j < 2 * i + 17; j++) {
395 xas_set(&xas, j);
396 do {
397 xas_lock(&xas);
398 xas_store(&xas, xa_mk_value(j));
399 xas_unlock(&xas);
400 } while (xas_nomem(&xas, GFP_KERNEL));
401 }
402
403 xas_set(&xas, ULONG_MAX);
404 do {
405 xas_lock(&xas);
406 xas_store(&xas, xa_mk_value(0));
407 xas_unlock(&xas);
408 } while (xas_nomem(&xas, GFP_KERNEL));
409
410 xas_lock(&xas);
411 xas_store(&xas, NULL);
412
413 xas_set(&xas, 0);
414 j = i;
415 xas_for_each(&xas, entry, ULONG_MAX) {
416 XA_BUG_ON(xa, entry != xa_mk_value(j));
417 xas_store(&xas, NULL);
418 j++;
419 }
420 xas_unlock(&xas);
421 XA_BUG_ON(xa, !xa_empty(xa));
422 }
423}
424
58d6ea30
MW		 425static noinline void check_multi_store(struct xarray *xa)
426{
427#ifdef CONFIG_XARRAY_MULTI
428 unsigned long i, j, k;
429 unsigned int max_order = (sizeof(long) == 4) ? 30 : 60;
430
431 /* Loading from any position returns the same value */
432 xa_store_order(xa, 0, 1, xa_mk_value(0), GFP_KERNEL);
433 XA_BUG_ON(xa, xa_load(xa, 0) != xa_mk_value(0));
434 XA_BUG_ON(xa, xa_load(xa, 1) != xa_mk_value(0));
435 XA_BUG_ON(xa, xa_load(xa, 2) != NULL);
436 rcu_read_lock();
437 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 2);
438 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2);
439 rcu_read_unlock();
440
441 /* Storing adjacent to the value does not alter the value */
442 xa_store(xa, 3, xa, GFP_KERNEL);
443 XA_BUG_ON(xa, xa_load(xa, 0) != xa_mk_value(0));
444 XA_BUG_ON(xa, xa_load(xa, 1) != xa_mk_value(0));
445 XA_BUG_ON(xa, xa_load(xa, 2) != NULL);
446 rcu_read_lock();
447 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 3);
448 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 2);
449 rcu_read_unlock();
450
451 /* Overwriting multiple indexes works */
452 xa_store_order(xa, 0, 2, xa_mk_value(1), GFP_KERNEL);
453 XA_BUG_ON(xa, xa_load(xa, 0) != xa_mk_value(1));
454 XA_BUG_ON(xa, xa_load(xa, 1) != xa_mk_value(1));
455 XA_BUG_ON(xa, xa_load(xa, 2) != xa_mk_value(1));
456 XA_BUG_ON(xa, xa_load(xa, 3) != xa_mk_value(1));
457 XA_BUG_ON(xa, xa_load(xa, 4) != NULL);
458 rcu_read_lock();
459 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->count != 4);
460 XA_BUG_ON(xa, xa_to_node(xa_head(xa))->nr_values != 4);
461 rcu_read_unlock();
462
463 /* We can erase multiple values with a single store */
464 xa_store_order(xa, 0, 63, NULL, GFP_KERNEL);
465 XA_BUG_ON(xa, !xa_empty(xa));
466
467 /* Even when the first slot is empty but the others aren't */
468 xa_store_index(xa, 1, GFP_KERNEL);
469 xa_store_index(xa, 2, GFP_KERNEL);
470 xa_store_order(xa, 0, 2, NULL, GFP_KERNEL);
471 XA_BUG_ON(xa, !xa_empty(xa));
472
473 for (i = 0; i < max_order; i++) {
474 for (j = 0; j < max_order; j++) {
475 xa_store_order(xa, 0, i, xa_mk_value(i), GFP_KERNEL);
476 xa_store_order(xa, 0, j, xa_mk_value(j), GFP_KERNEL);
477
478 for (k = 0; k < max_order; k++) {
479 void *entry = xa_load(xa, (1UL << k) - 1);
480 if ((i < k) && (j < k))
481 XA_BUG_ON(xa, entry != NULL);
482 else
483 XA_BUG_ON(xa, entry != xa_mk_value(j));
484 }
485
486 xa_erase(xa, 0);
487 XA_BUG_ON(xa, !xa_empty(xa));
488 }
489 }
490#endif
491}
492
371c752d
MW		 493static DEFINE_XARRAY_ALLOC(xa0);
494
495static noinline void check_xa_alloc(void)
496{
497 int i;
498 u32 id;
499
500 /* An empty array should assign 0 to the first alloc */
501 xa_alloc_index(&xa0, 0, GFP_KERNEL);
502
503 /* Erasing it should make the array empty again */
504 xa_erase_index(&xa0, 0);
505 XA_BUG_ON(&xa0, !xa_empty(&xa0));
506
507 /* And it should assign 0 again */
508 xa_alloc_index(&xa0, 0, GFP_KERNEL);
509
510 /* The next assigned ID should be 1 */
511 xa_alloc_index(&xa0, 1, GFP_KERNEL);
512 xa_erase_index(&xa0, 1);
513
514 /* Storing a value should mark it used */
515 xa_store_index(&xa0, 1, GFP_KERNEL);
516 xa_alloc_index(&xa0, 2, GFP_KERNEL);
517
518 /* If we then erase 0, it should be free */
519 xa_erase_index(&xa0, 0);
520 xa_alloc_index(&xa0, 0, GFP_KERNEL);
521
522 xa_erase_index(&xa0, 1);
523 xa_erase_index(&xa0, 2);
524
525 for (i = 1; i < 5000; i++) {
526 xa_alloc_index(&xa0, i, GFP_KERNEL);
527 }
528
529 xa_destroy(&xa0);
530
531 id = 0xfffffffeU;
532 XA_BUG_ON(&xa0, xa_alloc(&xa0, &id, UINT_MAX, xa_mk_value(0),
533 GFP_KERNEL) != 0);
534 XA_BUG_ON(&xa0, id != 0xfffffffeU);
535 XA_BUG_ON(&xa0, xa_alloc(&xa0, &id, UINT_MAX, xa_mk_value(0),
536 GFP_KERNEL) != 0);
537 XA_BUG_ON(&xa0, id != 0xffffffffU);
538 XA_BUG_ON(&xa0, xa_alloc(&xa0, &id, UINT_MAX, xa_mk_value(0),
539 GFP_KERNEL) != -ENOSPC);
540 XA_BUG_ON(&xa0, id != 0xffffffffU);
541 xa_destroy(&xa0);
542}
543
4e99d4e9
MW		 544static noinline void __check_store_iter(struct xarray *xa, unsigned long start,
545 unsigned int order, unsigned int present)
546{
547 XA_STATE_ORDER(xas, xa, start, order);
548 void *entry;
549 unsigned int count = 0;
550
551retry:
552 xas_lock(&xas);
553 xas_for_each_conflict(&xas, entry) {
554 XA_BUG_ON(xa, !xa_is_value(entry));
555 XA_BUG_ON(xa, entry < xa_mk_value(start));
556 XA_BUG_ON(xa, entry > xa_mk_value(start + (1UL << order) - 1));
557 count++;
558 }
559 xas_store(&xas, xa_mk_value(start));
560 xas_unlock(&xas);
561 if (xas_nomem(&xas, GFP_KERNEL)) {
562 count = 0;
563 goto retry;
564 }
565 XA_BUG_ON(xa, xas_error(&xas));
566 XA_BUG_ON(xa, count != present);
567 XA_BUG_ON(xa, xa_load(xa, start) != xa_mk_value(start));
568 XA_BUG_ON(xa, xa_load(xa, start + (1UL << order) - 1) !=
569 xa_mk_value(start));
570 xa_erase_index(xa, start);
571}
572
573static noinline void check_store_iter(struct xarray *xa)
574{
575 unsigned int i, j;
576 unsigned int max_order = IS_ENABLED(CONFIG_XARRAY_MULTI) ? 20 : 1;
577
578 for (i = 0; i < max_order; i++) {
579 unsigned int min = 1 << i;
580 unsigned int max = (2 << i) - 1;
581 __check_store_iter(xa, 0, i, 0);
582 XA_BUG_ON(xa, !xa_empty(xa));
583 __check_store_iter(xa, min, i, 0);
584 XA_BUG_ON(xa, !xa_empty(xa));
585
586 xa_store_index(xa, min, GFP_KERNEL);
587 __check_store_iter(xa, min, i, 1);
588 XA_BUG_ON(xa, !xa_empty(xa));
589 xa_store_index(xa, max, GFP_KERNEL);
590 __check_store_iter(xa, min, i, 1);
591 XA_BUG_ON(xa, !xa_empty(xa));
592
593 for (j = 0; j < min; j++)
594 xa_store_index(xa, j, GFP_KERNEL);
595 __check_store_iter(xa, 0, i, min);
596 XA_BUG_ON(xa, !xa_empty(xa));
597 for (j = 0; j < min; j++)
598 xa_store_index(xa, min + j, GFP_KERNEL);
599 __check_store_iter(xa, min, i, min);
600 XA_BUG_ON(xa, !xa_empty(xa));
601 }
602#ifdef CONFIG_XARRAY_MULTI
603 xa_store_index(xa, 63, GFP_KERNEL);
604 xa_store_index(xa, 65, GFP_KERNEL);
605 __check_store_iter(xa, 64, 2, 1);
606 xa_erase_index(xa, 63);
607#endif
608 XA_BUG_ON(xa, !xa_empty(xa));
609}
610
b803b428
MW		 611static noinline void check_multi_find(struct xarray *xa)
612{
613#ifdef CONFIG_XARRAY_MULTI
614 unsigned long index;
615
616 xa_store_order(xa, 12, 2, xa_mk_value(12), GFP_KERNEL);
617 XA_BUG_ON(xa, xa_store_index(xa, 16, GFP_KERNEL) != NULL);
618
619 index = 0;
620 XA_BUG_ON(xa, xa_find(xa, &index, ULONG_MAX, XA_PRESENT) !=
621 xa_mk_value(12));
622 XA_BUG_ON(xa, index != 12);
623 index = 13;
624 XA_BUG_ON(xa, xa_find(xa, &index, ULONG_MAX, XA_PRESENT) !=
625 xa_mk_value(12));
626 XA_BUG_ON(xa, (index < 12) || (index >= 16));
627 XA_BUG_ON(xa, xa_find_after(xa, &index, ULONG_MAX, XA_PRESENT) !=
628 xa_mk_value(16));
629 XA_BUG_ON(xa, index != 16);
630
631 xa_erase_index(xa, 12);
632 xa_erase_index(xa, 16);
633 XA_BUG_ON(xa, !xa_empty(xa));
634#endif
635}
636
637static noinline void check_multi_find_2(struct xarray *xa)
638{
639 unsigned int max_order = IS_ENABLED(CONFIG_XARRAY_MULTI) ? 10 : 1;
640 unsigned int i, j;
641 void *entry;
642
643 for (i = 0; i < max_order; i++) {
644 unsigned long index = 1UL << i;
645 for (j = 0; j < index; j++) {
646 XA_STATE(xas, xa, j + index);
647 xa_store_index(xa, index - 1, GFP_KERNEL);
648 xa_store_order(xa, index, i, xa_mk_value(index),
649 GFP_KERNEL);
650 rcu_read_lock();
651 xas_for_each(&xas, entry, ULONG_MAX) {
652 xa_erase_index(xa, index);
653 }
654 rcu_read_unlock();
655 xa_erase_index(xa, index - 1);
656 XA_BUG_ON(xa, !xa_empty(xa));
657 }
658 }
659}
660
661static noinline void check_find(struct xarray *xa)
662{
663 unsigned long i, j, k;
664
665 XA_BUG_ON(xa, !xa_empty(xa));
666
667 /*
668 * Check xa_find with all pairs between 0 and 99 inclusive,
669 * starting at every index between 0 and 99
670 */
671 for (i = 0; i < 100; i++) {
672 XA_BUG_ON(xa, xa_store_index(xa, i, GFP_KERNEL) != NULL);
673 xa_set_mark(xa, i, XA_MARK_0);
674 for (j = 0; j < i; j++) {
675 XA_BUG_ON(xa, xa_store_index(xa, j, GFP_KERNEL) !=
676 NULL);
677 xa_set_mark(xa, j, XA_MARK_0);
678 for (k = 0; k < 100; k++) {
679 unsigned long index = k;
680 void *entry = xa_find(xa, &index, ULONG_MAX,
681 XA_PRESENT);
682 if (k <= j)
683 XA_BUG_ON(xa, index != j);
684 else if (k <= i)
685 XA_BUG_ON(xa, index != i);
686 else
687 XA_BUG_ON(xa, entry != NULL);
688
689 index = k;
690 entry = xa_find(xa, &index, ULONG_MAX,
691 XA_MARK_0);
692 if (k <= j)
693 XA_BUG_ON(xa, index != j);
694 else if (k <= i)
695 XA_BUG_ON(xa, index != i);
696 else
697 XA_BUG_ON(xa, entry != NULL);
698 }
699 xa_erase_index(xa, j);
700 XA_BUG_ON(xa, xa_get_mark(xa, j, XA_MARK_0));
701 XA_BUG_ON(xa, !xa_get_mark(xa, i, XA_MARK_0));
702 }
703 xa_erase_index(xa, i);
704 XA_BUG_ON(xa, xa_get_mark(xa, i, XA_MARK_0));
705 }
706 XA_BUG_ON(xa, !xa_empty(xa));
707 check_multi_find(xa);
708 check_multi_find_2(xa);
709}
710
e21a2955
MW		 711/* See find_swap_entry() in mm/shmem.c */
712static noinline unsigned long xa_find_entry(struct xarray *xa, void *item)
713{
714 XA_STATE(xas, xa, 0);
715 unsigned int checked = 0;
716 void *entry;
717
718 rcu_read_lock();
719 xas_for_each(&xas, entry, ULONG_MAX) {
720 if (xas_retry(&xas, entry))
721 continue;
722 if (entry == item)
723 break;
724 checked++;
725 if ((checked % 4) != 0)
726 continue;
727 xas_pause(&xas);
728 }
729 rcu_read_unlock();
730
731 return entry ? xas.xa_index : -1;
732}
733
734static noinline void check_find_entry(struct xarray *xa)
735{
736#ifdef CONFIG_XARRAY_MULTI
737 unsigned int order;
738 unsigned long offset, index;
739
740 for (order = 0; order < 20; order++) {
741 for (offset = 0; offset < (1UL << (order + 3));
742 offset += (1UL << order)) {
743 for (index = 0; index < (1UL << (order + 5));
744 index += (1UL << order)) {
745 xa_store_order(xa, index, order,
746 xa_mk_value(index), GFP_KERNEL);
747 XA_BUG_ON(xa, xa_load(xa, index) !=
748 xa_mk_value(index));
749 XA_BUG_ON(xa, xa_find_entry(xa,
750 xa_mk_value(index)) != index);
751 }
752 XA_BUG_ON(xa, xa_find_entry(xa, xa) != -1);
753 xa_destroy(xa);
754 }
755 }
756#endif
757
758 XA_BUG_ON(xa, xa_find_entry(xa, xa) != -1);
759 xa_store_index(xa, ULONG_MAX, GFP_KERNEL);
760 XA_BUG_ON(xa, xa_find_entry(xa, xa) != -1);
761 XA_BUG_ON(xa, xa_find_entry(xa, xa_mk_value(LONG_MAX)) != -1);
762 xa_erase_index(xa, ULONG_MAX);
763 XA_BUG_ON(xa, !xa_empty(xa));
764}
765
64d3e9a9
MW		 766static noinline void check_move_small(struct xarray *xa, unsigned long idx)
767{
768 XA_STATE(xas, xa, 0);
769 unsigned long i;
770
771 xa_store_index(xa, 0, GFP_KERNEL);
772 xa_store_index(xa, idx, GFP_KERNEL);
773
774 rcu_read_lock();
775 for (i = 0; i < idx * 4; i++) {
776 void *entry = xas_next(&xas);
777 if (i <= idx)
778 XA_BUG_ON(xa, xas.xa_node == XAS_RESTART);
779 XA_BUG_ON(xa, xas.xa_index != i);
780 if (i == 0 || i == idx)
781 XA_BUG_ON(xa, entry != xa_mk_value(i));
782 else
783 XA_BUG_ON(xa, entry != NULL);
784 }
785 xas_next(&xas);
786 XA_BUG_ON(xa, xas.xa_index != i);
787
788 do {
789 void *entry = xas_prev(&xas);
790 i--;
791 if (i <= idx)
792 XA_BUG_ON(xa, xas.xa_node == XAS_RESTART);
793 XA_BUG_ON(xa, xas.xa_index != i);
794 if (i == 0 || i == idx)
795 XA_BUG_ON(xa, entry != xa_mk_value(i));
796 else
797 XA_BUG_ON(xa, entry != NULL);
798 } while (i > 0);
799
800 xas_set(&xas, ULONG_MAX);
801 XA_BUG_ON(xa, xas_next(&xas) != NULL);
802 XA_BUG_ON(xa, xas.xa_index != ULONG_MAX);
803 XA_BUG_ON(xa, xas_next(&xas) != xa_mk_value(0));
804 XA_BUG_ON(xa, xas.xa_index != 0);
805 XA_BUG_ON(xa, xas_prev(&xas) != NULL);
806 XA_BUG_ON(xa, xas.xa_index != ULONG_MAX);
807 rcu_read_unlock();
808
809 xa_erase_index(xa, 0);
810 xa_erase_index(xa, idx);
811 XA_BUG_ON(xa, !xa_empty(xa));
812}
813
814static noinline void check_move(struct xarray *xa)
815{
816 XA_STATE(xas, xa, (1 << 16) - 1);
817 unsigned long i;
818
819 for (i = 0; i < (1 << 16); i++)
820 XA_BUG_ON(xa, xa_store_index(xa, i, GFP_KERNEL) != NULL);
821
822 rcu_read_lock();
823 do {
824 void *entry = xas_prev(&xas);
825 i--;
826 XA_BUG_ON(xa, entry != xa_mk_value(i));
827 XA_BUG_ON(xa, i != xas.xa_index);
828 } while (i != 0);
829
830 XA_BUG_ON(xa, xas_prev(&xas) != NULL);
831 XA_BUG_ON(xa, xas.xa_index != ULONG_MAX);
832
833 do {
834 void *entry = xas_next(&xas);
835 XA_BUG_ON(xa, entry != xa_mk_value(i));
836 XA_BUG_ON(xa, i != xas.xa_index);
837 i++;
838 } while (i < (1 << 16));
839 rcu_read_unlock();
840
841 for (i = (1 << 8); i < (1 << 15); i++)
842 xa_erase_index(xa, i);
843
844 i = xas.xa_index;
845
846 rcu_read_lock();
847 do {
848 void *entry = xas_prev(&xas);
849 i--;
850 if ((i < (1 << 8)) || (i >= (1 << 15)))
851 XA_BUG_ON(xa, entry != xa_mk_value(i));
852 else
853 XA_BUG_ON(xa, entry != NULL);
854 XA_BUG_ON(xa, i != xas.xa_index);
855 } while (i != 0);
856
857 XA_BUG_ON(xa, xas_prev(&xas) != NULL);
858 XA_BUG_ON(xa, xas.xa_index != ULONG_MAX);
859
860 do {
861 void *entry = xas_next(&xas);
862 if ((i < (1 << 8)) || (i >= (1 << 15)))
863 XA_BUG_ON(xa, entry != xa_mk_value(i));
864 else
865 XA_BUG_ON(xa, entry != NULL);
866 XA_BUG_ON(xa, i != xas.xa_index);
867 i++;
868 } while (i < (1 << 16));
869 rcu_read_unlock();
870
871 xa_destroy(xa);
872
873 for (i = 0; i < 16; i++)
874 check_move_small(xa, 1UL << i);
875
876 for (i = 2; i < 16; i++)
877 check_move_small(xa, (1UL << i) - 1);
878}
879
2264f513
MW		 880static noinline void xa_store_many_order(struct xarray *xa,
881 unsigned long index, unsigned order)
882{
883 XA_STATE_ORDER(xas, xa, index, order);
884 unsigned int i = 0;
885
886 do {
887 xas_lock(&xas);
888 XA_BUG_ON(xa, xas_find_conflict(&xas));
889 xas_create_range(&xas);
890 if (xas_error(&xas))
891 goto unlock;
892 for (i = 0; i < (1U << order); i++) {
893 XA_BUG_ON(xa, xas_store(&xas, xa_mk_value(index + i)));
894 xas_next(&xas);
895 }
896unlock:
897 xas_unlock(&xas);
898 } while (xas_nomem(&xas, GFP_KERNEL));
899
900 XA_BUG_ON(xa, xas_error(&xas));
901}
902
903static noinline void check_create_range_1(struct xarray *xa,
904 unsigned long index, unsigned order)
905{
906 unsigned long i;
907
908 xa_store_many_order(xa, index, order);
909 for (i = index; i < index + (1UL << order); i++)
910 xa_erase_index(xa, i);
911 XA_BUG_ON(xa, !xa_empty(xa));
912}
913
914static noinline void check_create_range_2(struct xarray *xa, unsigned order)
915{
916 unsigned long i;
917 unsigned long nr = 1UL << order;
918
919 for (i = 0; i < nr * nr; i += nr)
920 xa_store_many_order(xa, i, order);
921 for (i = 0; i < nr * nr; i++)
922 xa_erase_index(xa, i);
923 XA_BUG_ON(xa, !xa_empty(xa));
924}
925
926static noinline void check_create_range_3(void)
927{
928 XA_STATE(xas, NULL, 0);
929 xas_set_err(&xas, -EEXIST);
930 xas_create_range(&xas);
931 XA_BUG_ON(NULL, xas_error(&xas) != -EEXIST);
932}
933
934static noinline void check_create_range_4(struct xarray *xa,
935 unsigned long index, unsigned order)
936{
937 XA_STATE_ORDER(xas, xa, index, order);
938 unsigned long base = xas.xa_index;
939 unsigned long i = 0;
940
941 xa_store_index(xa, index, GFP_KERNEL);
942 do {
943 xas_lock(&xas);
944 xas_create_range(&xas);
945 if (xas_error(&xas))
946 goto unlock;
947 for (i = 0; i < (1UL << order); i++) {
948 void *old = xas_store(&xas, xa_mk_value(base + i));
949 if (xas.xa_index == index)
950 XA_BUG_ON(xa, old != xa_mk_value(base + i));
951 else
952 XA_BUG_ON(xa, old != NULL);
953 xas_next(&xas);
954 }
955unlock:
956 xas_unlock(&xas);
957 } while (xas_nomem(&xas, GFP_KERNEL));
958
959 XA_BUG_ON(xa, xas_error(&xas));
960
961 for (i = base; i < base + (1UL << order); i++)
962 xa_erase_index(xa, i);
963 XA_BUG_ON(xa, !xa_empty(xa));
964}
965
966static noinline void check_create_range(struct xarray *xa)
967{
968 unsigned int order;
969 unsigned int max_order = IS_ENABLED(CONFIG_XARRAY_MULTI) ? 12 : 1;
970
971 for (order = 0; order < max_order; order++) {
972 check_create_range_1(xa, 0, order);
973 check_create_range_1(xa, 1U << order, order);
974 check_create_range_1(xa, 2U << order, order);
975 check_create_range_1(xa, 3U << order, order);
976 check_create_range_1(xa, 1U << 24, order);
977 if (order < 10)
978 check_create_range_2(xa, order);
979
980 check_create_range_4(xa, 0, order);
981 check_create_range_4(xa, 1U << order, order);
982 check_create_range_4(xa, 2U << order, order);
983 check_create_range_4(xa, 3U << order, order);
984 check_create_range_4(xa, 1U << 24, order);
985
986 check_create_range_4(xa, 1, order);
987 check_create_range_4(xa, (1U << order) + 1, order);
988 check_create_range_4(xa, (2U << order) + 1, order);
989 check_create_range_4(xa, (2U << order) - 1, order);
990 check_create_range_4(xa, (3U << order) + 1, order);
991 check_create_range_4(xa, (3U << order) - 1, order);
992 check_create_range_4(xa, (1U << 24) + 1, order);
993 }
994
995 check_create_range_3();
996}
997
a97e7904
MW		 998static LIST_HEAD(shadow_nodes);
999
1000static void test_update_node(struct xa_node *node)
1001{
1002 if (node->count && node->count == node->nr_values) {
1003 if (list_empty(&node->private_list))
1004 list_add(&shadow_nodes, &node->private_list);
1005 } else {
1006 if (!list_empty(&node->private_list))
1007 list_del_init(&node->private_list);
1008 }
1009}
1010
1011static noinline void shadow_remove(struct xarray *xa)
1012{
1013 struct xa_node *node;
1014
1015 xa_lock(xa);
1016 while ((node = list_first_entry_or_null(&shadow_nodes,
1017 struct xa_node, private_list))) {
1018 XA_STATE(xas, node->array, 0);
1019 XA_BUG_ON(xa, node->array != xa);
1020 list_del_init(&node->private_list);
1021 xas.xa_node = xa_parent_locked(node->array, node);
1022 xas.xa_offset = node->offset;
1023 xas.xa_shift = node->shift + XA_CHUNK_SHIFT;
1024 xas_set_update(&xas, test_update_node);
1025 xas_store(&xas, NULL);
1026 }
1027 xa_unlock(xa);
1028}
1029
1030static noinline void check_workingset(struct xarray *xa, unsigned long index)
1031{
1032 XA_STATE(xas, xa, index);
1033 xas_set_update(&xas, test_update_node);
1034
1035 do {
1036 xas_lock(&xas);
1037 xas_store(&xas, xa_mk_value(0));
1038 xas_next(&xas);
1039 xas_store(&xas, xa_mk_value(1));
1040 xas_unlock(&xas);
1041 } while (xas_nomem(&xas, GFP_KERNEL));
1042
1043 XA_BUG_ON(xa, list_empty(&shadow_nodes));
1044
1045 xas_lock(&xas);
1046 xas_next(&xas);
1047 xas_store(&xas, &xas);
1048 XA_BUG_ON(xa, !list_empty(&shadow_nodes));
1049
1050 xas_store(&xas, xa_mk_value(2));
1051 xas_unlock(&xas);
1052 XA_BUG_ON(xa, list_empty(&shadow_nodes));
1053
1054 shadow_remove(xa);
1055 XA_BUG_ON(xa, !list_empty(&shadow_nodes));
1056 XA_BUG_ON(xa, !xa_empty(xa));
1057}
1058
d6427f81
MW		 1059/*
1060 * Check that the pointer / value / sibling entries are accounted the
1061 * way we expect them to be.
1062 */
1063static noinline void check_account(struct xarray *xa)
1064{
1065#ifdef CONFIG_XARRAY_MULTI
1066 unsigned int order;
1067
1068 for (order = 1; order < 12; order++) {
1069 XA_STATE(xas, xa, 1 << order);
1070
1071 xa_store_order(xa, 0, order, xa, GFP_KERNEL);
1072 xas_load(&xas);
1073 XA_BUG_ON(xa, xas.xa_node->count == 0);
1074 XA_BUG_ON(xa, xas.xa_node->count > (1 << order));
1075 XA_BUG_ON(xa, xas.xa_node->nr_values != 0);
1076
1077 xa_store_order(xa, 1 << order, order, xa_mk_value(1 << order),
1078 GFP_KERNEL);
1079 XA_BUG_ON(xa, xas.xa_node->count != xas.xa_node->nr_values * 2);
1080
1081 xa_erase(xa, 1 << order);
1082 XA_BUG_ON(xa, xas.xa_node->nr_values != 0);
1083
1084 xa_erase(xa, 0);
1085 XA_BUG_ON(xa, !xa_empty(xa));
1086 }
1087#endif
1088}
1089
687149fc
MW		 1090static noinline void check_destroy(struct xarray *xa)
1091{
1092 unsigned long index;
1093
1094 XA_BUG_ON(xa, !xa_empty(xa));
1095
1096 /* Destroying an empty array is a no-op */
1097 xa_destroy(xa);
1098 XA_BUG_ON(xa, !xa_empty(xa));
1099
1100 /* Destroying an array with a single entry */
1101 for (index = 0; index < 1000; index++) {
1102 xa_store_index(xa, index, GFP_KERNEL);
1103 XA_BUG_ON(xa, xa_empty(xa));
1104 xa_destroy(xa);
1105 XA_BUG_ON(xa, !xa_empty(xa));
1106 }
1107
1108 /* Destroying an array with a single entry at ULONG_MAX */
1109 xa_store(xa, ULONG_MAX, xa, GFP_KERNEL);
1110 XA_BUG_ON(xa, xa_empty(xa));
1111 xa_destroy(xa);
1112 XA_BUG_ON(xa, !xa_empty(xa));
1113
1114#ifdef CONFIG_XARRAY_MULTI
1115 /* Destroying an array with a multi-index entry */
1116 xa_store_order(xa, 1 << 11, 11, xa, GFP_KERNEL);
1117 XA_BUG_ON(xa, xa_empty(xa));
1118 xa_destroy(xa);
1119 XA_BUG_ON(xa, !xa_empty(xa));
1120#endif
1121}
1122
58d6ea30 1123static DEFINE_XARRAY(array);
ad3d6c72
MW		 1124
1125static int xarray_checks(void)
1126{
58d6ea30 1127 check_xa_err(&array);
b803b428 1128 check_xas_retry(&array);
ad3d6c72 1129 check_xa_load(&array);
9b89a035 1130 check_xa_mark(&array);
58d6ea30 1131 check_xa_shrink(&array);
b803b428 1132 check_xas_erase(&array);
41aec91f 1133 check_cmpxchg(&array);
9f14d4f1 1134 check_reserve(&array);
58d6ea30 1135 check_multi_store(&array);
371c752d 1136 check_xa_alloc();
b803b428 1137 check_find(&array);
e21a2955 1138 check_find_entry(&array);
d6427f81 1139 check_account(&array);
687149fc 1140 check_destroy(&array);
64d3e9a9 1141 check_move(&array);
2264f513 1142 check_create_range(&array);
4e99d4e9 1143 check_store_iter(&array);
ad3d6c72 1144
a97e7904
MW		 1145 check_workingset(&array, 0);
1146 check_workingset(&array, 64);
1147 check_workingset(&array, 4096);
1148
ad3d6c72
MW		 1149 printk("XArray: %u of %u tests passed\n", tests_passed, tests_run);
1150 return (tests_run == tests_passed) ? 0 : -EINVAL;
1151}
1152
1153static void xarray_exit(void)
1154{
1155}
1156
1157module_init(xarray_checks);
1158module_exit(xarray_exit);
1159MODULE_AUTHOR("Matthew Wilcox <willy@infradead.org>");
1160MODULE_LICENSE("GPL");
Linux 6.x block layer and io_uring tree(s)