2 * idr-test.c: Test the IDR API
3 * Copyright (c) 2016 Matthew Wilcox <willy@infradead.org>
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms and conditions of the GNU General Public License,
7 * version 2, as published by the Free Software Foundation.
9 * This program is distributed in the hope it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
14 #include <linux/bitmap.h>
15 #include <linux/idr.h>
16 #include <linux/slab.h>
17 #include <linux/kernel.h>
18 #include <linux/errno.h>
22 #define DUMMY_PTR ((void *)0x12)
24 int item_idr_free(int id, void *p, void *data)
26 struct item *item = p;
27 assert(item->index == id);
33 void item_idr_remove(struct idr *idr, int id)
35 struct item *item = idr_find(idr, id);
36 assert(item->index == id);
41 void idr_alloc_test(void)
46 assert(idr_alloc_cyclic(&idr, DUMMY_PTR, 0, 0x4000, GFP_KERNEL) == 0);
47 assert(idr_alloc_cyclic(&idr, DUMMY_PTR, 0x3ffd, 0x4000, GFP_KERNEL) == 0x3ffd);
48 idr_remove(&idr, 0x3ffd);
51 for (i = 0x3ffe; i < 0x4003; i++) {
56 item = item_create(i, 0);
58 item = item_create(i - 0x3fff, 0);
60 id = idr_alloc_cyclic(&idr, item, 1, 0x4000, GFP_KERNEL);
61 assert(id == item->index);
64 idr_for_each(&idr, item_idr_free, &idr);
68 void idr_replace_test(void)
72 idr_alloc(&idr, (void *)-1, 10, 11, GFP_KERNEL);
73 idr_replace(&idr, &idr, 10);
79 * Unlike the radix tree, you can put a NULL pointer -- with care -- into
80 * the IDR. Some interfaces, like idr_find() do not distinguish between
81 * "present, value is NULL" and "not present", but that's exactly what some
84 void idr_null_test(void)
89 assert(idr_is_empty(&idr));
91 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 0);
92 assert(!idr_is_empty(&idr));
94 assert(idr_is_empty(&idr));
96 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 0);
97 assert(!idr_is_empty(&idr));
99 assert(idr_is_empty(&idr));
101 for (i = 0; i < 10; i++) {
102 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == i);
105 assert(idr_replace(&idr, DUMMY_PTR, 3) == NULL);
106 assert(idr_replace(&idr, DUMMY_PTR, 4) == NULL);
107 assert(idr_replace(&idr, NULL, 4) == DUMMY_PTR);
108 assert(idr_replace(&idr, DUMMY_PTR, 11) == ERR_PTR(-ENOENT));
110 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 5);
113 for (i = 0; i < 9; i++) {
115 assert(!idr_is_empty(&idr));
118 assert(!idr_is_empty(&idr));
120 assert(idr_is_empty(&idr));
122 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 0);
123 assert(idr_replace(&idr, DUMMY_PTR, 3) == ERR_PTR(-ENOENT));
124 assert(idr_replace(&idr, DUMMY_PTR, 0) == NULL);
125 assert(idr_replace(&idr, NULL, 0) == DUMMY_PTR);
128 assert(idr_is_empty(&idr));
130 for (i = 1; i < 10; i++) {
131 assert(idr_alloc(&idr, NULL, 1, 0, GFP_KERNEL) == i);
135 assert(idr_is_empty(&idr));
138 void idr_nowait_test(void)
143 idr_preload(GFP_KERNEL);
145 for (i = 0; i < 3; i++) {
146 struct item *item = item_create(i, 0);
147 assert(idr_alloc(&idr, item, i, i + 1, GFP_NOWAIT) == i);
152 idr_for_each(&idr, item_idr_free, &idr);
156 void idr_checks(void)
161 for (i = 0; i < 10000; i++) {
162 struct item *item = item_create(i, 0);
163 assert(idr_alloc(&idr, item, 0, 20000, GFP_KERNEL) == i);
166 assert(idr_alloc(&idr, DUMMY_PTR, 5, 30, GFP_KERNEL) < 0);
168 for (i = 0; i < 5000; i++)
169 item_idr_remove(&idr, i);
173 idr_for_each(&idr, item_idr_free, &idr);
176 assert(idr_is_empty(&idr));
181 for (i = INT_MAX - 3UL; i < INT_MAX + 1UL; i++) {
182 struct item *item = item_create(i, 0);
183 assert(idr_alloc(&idr, item, i, i + 10, GFP_KERNEL) == i);
185 assert(idr_alloc(&idr, DUMMY_PTR, i - 2, i, GFP_KERNEL) == -ENOSPC);
187 idr_for_each(&idr, item_idr_free, &idr);
191 assert(idr_is_empty(&idr));
193 for (i = 1; i < 10000; i++) {
194 struct item *item = item_create(i, 0);
195 assert(idr_alloc(&idr, item, 1, 20000, GFP_KERNEL) == i);
198 idr_for_each(&idr, item_idr_free, &idr);
208 * Check that we get the correct error when we run out of memory doing
209 * allocations. To ensure we run out of memory, just "forget" to preload.
210 * The first test is for not having a bitmap available, and the second test
211 * is for not being able to allocate a level of the radix tree.
213 void ida_check_nomem(void)
218 err = ida_get_new_above(&ida, 256, &id);
219 assert(err == -EAGAIN);
220 err = ida_get_new_above(&ida, 1UL << 30, &id);
221 assert(err == -EAGAIN);
225 * Check what happens when we fill a leaf and then delete it. This may
226 * discover mishandling of IDR_FREE.
228 void ida_check_leaf(void)
234 for (i = 0; i < IDA_BITMAP_BITS; i++) {
235 assert(ida_pre_get(&ida, GFP_KERNEL));
236 assert(!ida_get_new(&ida, &id));
241 assert(ida_is_empty(&ida));
243 assert(ida_pre_get(&ida, GFP_KERNEL));
244 assert(!ida_get_new(&ida, &id));
247 assert(ida_is_empty(&ida));
251 * Check handling of conversions between exceptional entries and full bitmaps.
253 void ida_check_conv(void)
259 for (i = 0; i < IDA_BITMAP_BITS * 2; i += IDA_BITMAP_BITS) {
260 assert(ida_pre_get(&ida, GFP_KERNEL));
261 assert(!ida_get_new_above(&ida, i + 1, &id));
263 assert(!ida_get_new_above(&ida, i + BITS_PER_LONG, &id));
264 assert(id == i + BITS_PER_LONG);
265 ida_remove(&ida, i + 1);
266 ida_remove(&ida, i + BITS_PER_LONG);
267 assert(ida_is_empty(&ida));
270 assert(ida_pre_get(&ida, GFP_KERNEL));
272 for (i = 0; i < IDA_BITMAP_BITS * 2; i++) {
273 assert(ida_pre_get(&ida, GFP_KERNEL));
274 assert(!ida_get_new(&ida, &id));
278 for (i = IDA_BITMAP_BITS * 2; i > 0; i--) {
279 ida_remove(&ida, i - 1);
281 assert(ida_is_empty(&ida));
283 for (i = 0; i < IDA_BITMAP_BITS + BITS_PER_LONG - 4; i++) {
284 assert(ida_pre_get(&ida, GFP_KERNEL));
285 assert(!ida_get_new(&ida, &id));
289 for (i = IDA_BITMAP_BITS + BITS_PER_LONG - 4; i > 0; i--) {
290 ida_remove(&ida, i - 1);
292 assert(ida_is_empty(&ida));
294 radix_tree_cpu_dead(1);
295 for (i = 0; i < 1000000; i++) {
296 int err = ida_get_new(&ida, &id);
297 if (err == -EAGAIN) {
298 assert((i % IDA_BITMAP_BITS) == (BITS_PER_LONG - 2));
299 assert(ida_pre_get(&ida, GFP_KERNEL));
300 err = ida_get_new(&ida, &id);
302 assert((i % IDA_BITMAP_BITS) != (BITS_PER_LONG - 2));
311 * Check allocations up to and slightly above the maximum allowed (2^31-1) ID.
312 * Allocating up to 2^31-1 should succeed, and then allocating the next one
315 void ida_check_max(void)
321 for (j = 1; j < 65537; j *= 2) {
322 unsigned long base = (1UL << 31) - j;
323 for (i = 0; i < j; i++) {
324 assert(ida_pre_get(&ida, GFP_KERNEL));
325 assert(!ida_get_new_above(&ida, base, &id));
326 assert(id == base + i);
328 assert(ida_pre_get(&ida, GFP_KERNEL));
329 err = ida_get_new_above(&ida, base, &id);
330 assert(err == -ENOSPC);
332 assert(ida_is_empty(&ida));
337 void ida_check_random(void)
340 DECLARE_BITMAP(bitmap, 2048);
343 time_t s = time(NULL);
346 memset(bitmap, 0, sizeof(bitmap));
347 for (i = 0; i < 100000; i++) {
350 if (test_bit(bit, bitmap)) {
351 __clear_bit(bit, bitmap);
352 ida_remove(&ida, bit);
354 __set_bit(bit, bitmap);
355 ida_pre_get(&ida, GFP_KERNEL);
356 assert(!ida_get_new_above(&ida, bit, &id));
361 if (time(NULL) < s + 10)
365 void ida_checks(void)
371 radix_tree_cpu_dead(1);
374 for (i = 0; i < 10000; i++) {
375 assert(ida_pre_get(&ida, GFP_KERNEL));
376 assert(!ida_get_new(&ida, &id));
380 ida_remove(&ida, 20);
381 ida_remove(&ida, 21);
382 for (i = 0; i < 3; i++) {
383 assert(ida_pre_get(&ida, GFP_KERNEL));
384 assert(!ida_get_new(&ida, &id));
389 for (i = 0; i < 5000; i++)
392 assert(ida_pre_get(&ida, GFP_KERNEL));
393 assert(!ida_get_new_above(&ida, 5000, &id));
398 assert(ida_is_empty(&ida));
400 assert(ida_pre_get(&ida, GFP_KERNEL));
401 assert(!ida_get_new_above(&ida, 1, &id));
404 ida_remove(&ida, id);
405 assert(ida_is_empty(&ida));
407 assert(ida_is_empty(&ida));
409 assert(ida_pre_get(&ida, GFP_KERNEL));
410 assert(!ida_get_new_above(&ida, 1, &id));
412 assert(ida_is_empty(&ida));
414 assert(ida_pre_get(&ida, GFP_KERNEL));
415 assert(!ida_get_new_above(&ida, 1, &id));
417 assert(ida_pre_get(&ida, GFP_KERNEL));
418 assert(!ida_get_new_above(&ida, 1025, &id));
420 assert(ida_pre_get(&ida, GFP_KERNEL));
421 assert(!ida_get_new_above(&ida, 10000, &id));
423 ida_remove(&ida, 1025);
425 assert(ida_is_empty(&ida));
432 radix_tree_cpu_dead(1);
435 int __weak main(void)
442 printf("nr_allocated = %d\n", nr_allocated);