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