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