1 // SPDX-License-Identifier: GPL-2.0-only <<
2 /* 1 /*
3 * idr-test.c: Test the IDR API 2 * idr-test.c: Test the IDR API
4 * Copyright (c) 2016 Matthew Wilcox <willy@in 3 * Copyright (c) 2016 Matthew Wilcox <willy@infradead.org>
>> 4 *
>> 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.
>> 8 *
>> 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
>> 12 * more details.
5 */ 13 */
6 #include <linux/bitmap.h> 14 #include <linux/bitmap.h>
7 #include <linux/idr.h> 15 #include <linux/idr.h>
8 #include <linux/slab.h> 16 #include <linux/slab.h>
9 #include <linux/kernel.h> 17 #include <linux/kernel.h>
10 #include <linux/errno.h> 18 #include <linux/errno.h>
11 19
12 #include "test.h" 20 #include "test.h"
13 21
14 #define DUMMY_PTR ((void *)0x10) !! 22 #define DUMMY_PTR ((void *)0x12)
15 23
16 int item_idr_free(int id, void *p, void *data) 24 int item_idr_free(int id, void *p, void *data)
17 { 25 {
18 struct item *item = p; 26 struct item *item = p;
19 assert(item->index == id); 27 assert(item->index == id);
20 free(p); 28 free(p);
21 29
22 return 0; 30 return 0;
23 } 31 }
24 32
25 void item_idr_remove(struct idr *idr, int id) 33 void item_idr_remove(struct idr *idr, int id)
26 { 34 {
27 struct item *item = idr_find(idr, id); 35 struct item *item = idr_find(idr, id);
28 assert(item->index == id); 36 assert(item->index == id);
29 idr_remove(idr, id); 37 idr_remove(idr, id);
30 free(item); 38 free(item);
31 } 39 }
32 40
33 void idr_alloc_test(void) 41 void idr_alloc_test(void)
34 { 42 {
35 unsigned long i; 43 unsigned long i;
36 DEFINE_IDR(idr); 44 DEFINE_IDR(idr);
37 45
38 assert(idr_alloc_cyclic(&idr, DUMMY_PT 46 assert(idr_alloc_cyclic(&idr, DUMMY_PTR, 0, 0x4000, GFP_KERNEL) == 0);
39 assert(idr_alloc_cyclic(&idr, DUMMY_PT 47 assert(idr_alloc_cyclic(&idr, DUMMY_PTR, 0x3ffd, 0x4000, GFP_KERNEL) == 0x3ffd);
40 idr_remove(&idr, 0x3ffd); 48 idr_remove(&idr, 0x3ffd);
41 idr_remove(&idr, 0); 49 idr_remove(&idr, 0);
42 50
43 for (i = 0x3ffe; i < 0x4003; i++) { 51 for (i = 0x3ffe; i < 0x4003; i++) {
44 int id; 52 int id;
45 struct item *item; 53 struct item *item;
46 54
47 if (i < 0x4000) 55 if (i < 0x4000)
48 item = item_create(i, 56 item = item_create(i, 0);
49 else 57 else
50 item = item_create(i - 58 item = item_create(i - 0x3fff, 0);
51 59
52 id = idr_alloc_cyclic(&idr, it 60 id = idr_alloc_cyclic(&idr, item, 1, 0x4000, GFP_KERNEL);
53 assert(id == item->index); 61 assert(id == item->index);
54 } 62 }
55 63
56 idr_for_each(&idr, item_idr_free, &idr 64 idr_for_each(&idr, item_idr_free, &idr);
57 idr_destroy(&idr); 65 idr_destroy(&idr);
58 } 66 }
59 67
60 void idr_replace_test(void) 68 void idr_replace_test(void)
61 { 69 {
62 DEFINE_IDR(idr); 70 DEFINE_IDR(idr);
63 71
64 idr_alloc(&idr, (void *)-1, 10, 11, GF 72 idr_alloc(&idr, (void *)-1, 10, 11, GFP_KERNEL);
65 idr_replace(&idr, &idr, 10); 73 idr_replace(&idr, &idr, 10);
66 74
67 idr_destroy(&idr); 75 idr_destroy(&idr);
68 } 76 }
69 77
70 /* 78 /*
71 * Unlike the radix tree, you can put a NULL p 79 * Unlike the radix tree, you can put a NULL pointer -- with care -- into
72 * the IDR. Some interfaces, like idr_find() 80 * the IDR. Some interfaces, like idr_find() do not distinguish between
73 * "present, value is NULL" and "not present", 81 * "present, value is NULL" and "not present", but that's exactly what some
74 * users want. 82 * users want.
75 */ 83 */
76 void idr_null_test(void) 84 void idr_null_test(void)
77 { 85 {
78 int i; 86 int i;
79 DEFINE_IDR(idr); 87 DEFINE_IDR(idr);
80 88
81 assert(idr_is_empty(&idr)); 89 assert(idr_is_empty(&idr));
82 90
83 assert(idr_alloc(&idr, NULL, 0, 0, GFP 91 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 0);
84 assert(!idr_is_empty(&idr)); 92 assert(!idr_is_empty(&idr));
85 idr_remove(&idr, 0); 93 idr_remove(&idr, 0);
86 assert(idr_is_empty(&idr)); 94 assert(idr_is_empty(&idr));
87 95
88 assert(idr_alloc(&idr, NULL, 0, 0, GFP 96 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 0);
89 assert(!idr_is_empty(&idr)); 97 assert(!idr_is_empty(&idr));
90 idr_destroy(&idr); 98 idr_destroy(&idr);
91 assert(idr_is_empty(&idr)); 99 assert(idr_is_empty(&idr));
92 100
93 for (i = 0; i < 10; i++) { 101 for (i = 0; i < 10; i++) {
94 assert(idr_alloc(&idr, NULL, 0 102 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == i);
95 } 103 }
96 104
97 assert(idr_replace(&idr, DUMMY_PTR, 3) 105 assert(idr_replace(&idr, DUMMY_PTR, 3) == NULL);
98 assert(idr_replace(&idr, DUMMY_PTR, 4) 106 assert(idr_replace(&idr, DUMMY_PTR, 4) == NULL);
99 assert(idr_replace(&idr, NULL, 4) == D 107 assert(idr_replace(&idr, NULL, 4) == DUMMY_PTR);
100 assert(idr_replace(&idr, DUMMY_PTR, 11 108 assert(idr_replace(&idr, DUMMY_PTR, 11) == ERR_PTR(-ENOENT));
101 idr_remove(&idr, 5); 109 idr_remove(&idr, 5);
102 assert(idr_alloc(&idr, NULL, 0, 0, GFP 110 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 5);
103 idr_remove(&idr, 5); 111 idr_remove(&idr, 5);
104 112
105 for (i = 0; i < 9; i++) { 113 for (i = 0; i < 9; i++) {
106 idr_remove(&idr, i); 114 idr_remove(&idr, i);
107 assert(!idr_is_empty(&idr)); 115 assert(!idr_is_empty(&idr));
108 } 116 }
109 idr_remove(&idr, 8); 117 idr_remove(&idr, 8);
110 assert(!idr_is_empty(&idr)); 118 assert(!idr_is_empty(&idr));
111 idr_remove(&idr, 9); 119 idr_remove(&idr, 9);
112 assert(idr_is_empty(&idr)); 120 assert(idr_is_empty(&idr));
113 121
114 assert(idr_alloc(&idr, NULL, 0, 0, GFP 122 assert(idr_alloc(&idr, NULL, 0, 0, GFP_KERNEL) == 0);
115 assert(idr_replace(&idr, DUMMY_PTR, 3) 123 assert(idr_replace(&idr, DUMMY_PTR, 3) == ERR_PTR(-ENOENT));
116 assert(idr_replace(&idr, DUMMY_PTR, 0) 124 assert(idr_replace(&idr, DUMMY_PTR, 0) == NULL);
117 assert(idr_replace(&idr, NULL, 0) == D 125 assert(idr_replace(&idr, NULL, 0) == DUMMY_PTR);
118 126
119 idr_destroy(&idr); 127 idr_destroy(&idr);
120 assert(idr_is_empty(&idr)); 128 assert(idr_is_empty(&idr));
121 129
122 for (i = 1; i < 10; i++) { 130 for (i = 1; i < 10; i++) {
123 assert(idr_alloc(&idr, NULL, 1 131 assert(idr_alloc(&idr, NULL, 1, 0, GFP_KERNEL) == i);
124 } 132 }
125 133
126 idr_destroy(&idr); 134 idr_destroy(&idr);
127 assert(idr_is_empty(&idr)); 135 assert(idr_is_empty(&idr));
128 } 136 }
129 137
130 void idr_nowait_test(void) 138 void idr_nowait_test(void)
131 { 139 {
132 unsigned int i; 140 unsigned int i;
133 DEFINE_IDR(idr); 141 DEFINE_IDR(idr);
134 142
135 idr_preload(GFP_KERNEL); 143 idr_preload(GFP_KERNEL);
136 144
137 for (i = 0; i < 3; i++) { 145 for (i = 0; i < 3; i++) {
138 struct item *item = item_creat 146 struct item *item = item_create(i, 0);
139 assert(idr_alloc(&idr, item, i 147 assert(idr_alloc(&idr, item, i, i + 1, GFP_NOWAIT) == i);
140 } 148 }
141 149
142 idr_preload_end(); 150 idr_preload_end();
143 151
144 idr_for_each(&idr, item_idr_free, &idr 152 idr_for_each(&idr, item_idr_free, &idr);
145 idr_destroy(&idr); 153 idr_destroy(&idr);
146 } 154 }
147 155
148 void idr_get_next_test(int base) !! 156 void idr_get_next_test(void)
149 { 157 {
150 unsigned long i; 158 unsigned long i;
151 int nextid; 159 int nextid;
152 DEFINE_IDR(idr); 160 DEFINE_IDR(idr);
153 idr_init_base(&idr, base); <<
154 161
155 int indices[] = {4, 7, 9, 15, 65, 128, 162 int indices[] = {4, 7, 9, 15, 65, 128, 1000, 99999, 0};
156 163
157 for(i = 0; indices[i]; i++) { 164 for(i = 0; indices[i]; i++) {
158 struct item *item = item_creat 165 struct item *item = item_create(indices[i], 0);
159 assert(idr_alloc(&idr, item, i 166 assert(idr_alloc(&idr, item, indices[i], indices[i+1],
160 GFP_KERNEL) = 167 GFP_KERNEL) == indices[i]);
161 } 168 }
162 169
163 for(i = 0, nextid = 0; indices[i]; i++ 170 for(i = 0, nextid = 0; indices[i]; i++) {
164 idr_get_next(&idr, &nextid); 171 idr_get_next(&idr, &nextid);
165 assert(nextid == indices[i]); 172 assert(nextid == indices[i]);
166 nextid++; 173 nextid++;
167 } 174 }
168 175
169 idr_for_each(&idr, item_idr_free, &idr 176 idr_for_each(&idr, item_idr_free, &idr);
170 idr_destroy(&idr); 177 idr_destroy(&idr);
171 } 178 }
172 179
173 int idr_u32_cb(int id, void *ptr, void *data) <<
174 { <<
175 BUG_ON(id < 0); <<
176 BUG_ON(ptr != DUMMY_PTR); <<
177 return 0; <<
178 } <<
179 <<
180 void idr_u32_test1(struct idr *idr, u32 handle <<
181 { <<
182 static bool warned = false; <<
183 u32 id = handle; <<
184 int sid = 0; <<
185 void *ptr; <<
186 <<
187 BUG_ON(idr_alloc_u32(idr, DUMMY_PTR, & <<
188 BUG_ON(id != handle); <<
189 BUG_ON(idr_alloc_u32(idr, DUMMY_PTR, & <<
190 BUG_ON(id != handle); <<
191 if (!warned && id > INT_MAX) <<
192 printk("vvv Ignore these warni <<
193 ptr = idr_get_next(idr, &sid); <<
194 if (id > INT_MAX) { <<
195 BUG_ON(ptr != NULL); <<
196 BUG_ON(sid != 0); <<
197 } else { <<
198 BUG_ON(ptr != DUMMY_PTR); <<
199 BUG_ON(sid != id); <<
200 } <<
201 idr_for_each(idr, idr_u32_cb, NULL); <<
202 if (!warned && id > INT_MAX) { <<
203 printk("^^^ Warnings over\n"); <<
204 warned = true; <<
205 } <<
206 BUG_ON(idr_remove(idr, id) != DUMMY_PT <<
207 BUG_ON(!idr_is_empty(idr)); <<
208 } <<
209 <<
210 void idr_u32_test(int base) <<
211 { <<
212 DEFINE_IDR(idr); <<
213 idr_init_base(&idr, base); <<
214 idr_u32_test1(&idr, 10); <<
215 idr_u32_test1(&idr, 0x7fffffff); <<
216 idr_u32_test1(&idr, 0x80000000); <<
217 idr_u32_test1(&idr, 0x80000001); <<
218 idr_u32_test1(&idr, 0xffe00000); <<
219 idr_u32_test1(&idr, 0xffffffff); <<
220 } <<
221 <<
222 static void idr_align_test(struct idr *idr) <<
223 { <<
224 char name[] = "Motorola 68000"; <<
225 int i, id; <<
226 void *entry; <<
227 <<
228 for (i = 0; i < 9; i++) { <<
229 BUG_ON(idr_alloc(idr, &name[i] <<
230 idr_for_each_entry(idr, entry, <<
231 } <<
232 idr_destroy(idr); <<
233 <<
234 for (i = 1; i < 10; i++) { <<
235 BUG_ON(idr_alloc(idr, &name[i] <<
236 idr_for_each_entry(idr, entry, <<
237 } <<
238 idr_destroy(idr); <<
239 <<
240 for (i = 2; i < 11; i++) { <<
241 BUG_ON(idr_alloc(idr, &name[i] <<
242 idr_for_each_entry(idr, entry, <<
243 } <<
244 idr_destroy(idr); <<
245 <<
246 for (i = 3; i < 12; i++) { <<
247 BUG_ON(idr_alloc(idr, &name[i] <<
248 idr_for_each_entry(idr, entry, <<
249 } <<
250 idr_destroy(idr); <<
251 <<
252 for (i = 0; i < 8; i++) { <<
253 BUG_ON(idr_alloc(idr, &name[i] <<
254 BUG_ON(idr_alloc(idr, &name[i <<
255 idr_for_each_entry(idr, entry, <<
256 idr_remove(idr, 1); <<
257 idr_for_each_entry(idr, entry, <<
258 idr_remove(idr, 0); <<
259 BUG_ON(!idr_is_empty(idr)); <<
260 } <<
261 <<
262 for (i = 0; i < 8; i++) { <<
263 BUG_ON(idr_alloc(idr, NULL, 0, <<
264 idr_for_each_entry(idr, entry, <<
265 idr_replace(idr, &name[i], 0); <<
266 idr_for_each_entry(idr, entry, <<
267 BUG_ON(idr_find(idr, 0) != &na <<
268 idr_remove(idr, 0); <<
269 } <<
270 <<
271 for (i = 0; i < 8; i++) { <<
272 BUG_ON(idr_alloc(idr, &name[i] <<
273 BUG_ON(idr_alloc(idr, NULL, 0, <<
274 idr_remove(idr, 1); <<
275 idr_for_each_entry(idr, entry, <<
276 idr_replace(idr, &name[i + 1], <<
277 idr_for_each_entry(idr, entry, <<
278 idr_remove(idr, 0); <<
279 } <<
280 } <<
281 <<
282 DEFINE_IDR(find_idr); <<
283 <<
284 static void *idr_throbber(void *arg) <<
285 { <<
286 time_t start = time(NULL); <<
287 int id = *(int *)arg; <<
288 <<
289 rcu_register_thread(); <<
290 do { <<
291 idr_alloc(&find_idr, xa_mk_val <<
292 idr_remove(&find_idr, id); <<
293 } while (time(NULL) < start + 10); <<
294 rcu_unregister_thread(); <<
295 <<
296 return NULL; <<
297 } <<
298 <<
299 /* <<
300 * There are always either 1 or 2 objects in t <<
301 * or we find something at an ID we didn't exp <<
302 */ <<
303 void idr_find_test_1(int anchor_id, int throbb <<
304 { <<
305 pthread_t throbber; <<
306 time_t start = time(NULL); <<
307 <<
308 BUG_ON(idr_alloc(&find_idr, xa_mk_valu <<
309 anchor_id + 1, <<
310 <<
311 pthread_create(&throbber, NULL, idr_th <<
312 <<
313 rcu_read_lock(); <<
314 do { <<
315 int id = 0; <<
316 void *entry = idr_get_next(&fi <<
317 rcu_read_unlock(); <<
318 if ((id != anchor_id && id != <<
319 entry != xa_mk_value(id)) <<
320 printf("%s(%d, %d): %p <<
321 throbber_id, e <<
322 abort(); <<
323 } <<
324 rcu_read_lock(); <<
325 } while (time(NULL) < start + 11); <<
326 rcu_read_unlock(); <<
327 <<
328 pthread_join(throbber, NULL); <<
329 <<
330 idr_remove(&find_idr, anchor_id); <<
331 BUG_ON(!idr_is_empty(&find_idr)); <<
332 } <<
333 <<
334 void idr_find_test(void) <<
335 { <<
336 idr_find_test_1(100000, 0); <<
337 idr_find_test_1(0, 100000); <<
338 } <<
339 <<
340 void idr_checks(void) 180 void idr_checks(void)
341 { 181 {
342 unsigned long i; 182 unsigned long i;
343 DEFINE_IDR(idr); 183 DEFINE_IDR(idr);
344 184
345 for (i = 0; i < 10000; i++) { 185 for (i = 0; i < 10000; i++) {
346 struct item *item = item_creat 186 struct item *item = item_create(i, 0);
347 assert(idr_alloc(&idr, item, 0 187 assert(idr_alloc(&idr, item, 0, 20000, GFP_KERNEL) == i);
348 } 188 }
349 189
350 assert(idr_alloc(&idr, DUMMY_PTR, 5, 3 190 assert(idr_alloc(&idr, DUMMY_PTR, 5, 30, GFP_KERNEL) < 0);
351 191
352 for (i = 0; i < 5000; i++) 192 for (i = 0; i < 5000; i++)
353 item_idr_remove(&idr, i); 193 item_idr_remove(&idr, i);
354 194
355 idr_remove(&idr, 3); 195 idr_remove(&idr, 3);
356 196
357 idr_for_each(&idr, item_idr_free, &idr 197 idr_for_each(&idr, item_idr_free, &idr);
358 idr_destroy(&idr); 198 idr_destroy(&idr);
359 199
360 assert(idr_is_empty(&idr)); 200 assert(idr_is_empty(&idr));
361 201
362 idr_remove(&idr, 3); 202 idr_remove(&idr, 3);
363 idr_remove(&idr, 0); 203 idr_remove(&idr, 0);
364 204
365 assert(idr_alloc(&idr, DUMMY_PTR, 0, 0 <<
366 idr_remove(&idr, 1); <<
367 for (i = 1; i < RADIX_TREE_MAP_SIZE; i <<
368 assert(idr_alloc(&idr, DUMMY_P <<
369 idr_remove(&idr, 1 << 30); <<
370 idr_destroy(&idr); <<
371 <<
372 for (i = INT_MAX - 3UL; i < INT_MAX + 205 for (i = INT_MAX - 3UL; i < INT_MAX + 1UL; i++) {
373 struct item *item = item_creat 206 struct item *item = item_create(i, 0);
374 assert(idr_alloc(&idr, item, i 207 assert(idr_alloc(&idr, item, i, i + 10, GFP_KERNEL) == i);
375 } 208 }
376 assert(idr_alloc(&idr, DUMMY_PTR, i - 209 assert(idr_alloc(&idr, DUMMY_PTR, i - 2, i, GFP_KERNEL) == -ENOSPC);
377 assert(idr_alloc(&idr, DUMMY_PTR, i - <<
378 210
379 idr_for_each(&idr, item_idr_free, &idr 211 idr_for_each(&idr, item_idr_free, &idr);
380 idr_destroy(&idr); 212 idr_destroy(&idr);
381 idr_destroy(&idr); 213 idr_destroy(&idr);
382 214
383 assert(idr_is_empty(&idr)); 215 assert(idr_is_empty(&idr));
384 216
385 idr_set_cursor(&idr, INT_MAX - 3UL); <<
386 for (i = INT_MAX - 3UL; i < INT_MAX + <<
387 struct item *item; <<
388 unsigned int id; <<
389 if (i <= INT_MAX) <<
390 item = item_create(i, <<
391 else <<
392 item = item_create(i - <<
393 <<
394 id = idr_alloc_cyclic(&idr, it <<
395 assert(id == item->index); <<
396 } <<
397 <<
398 idr_for_each(&idr, item_idr_free, &idr <<
399 idr_destroy(&idr); <<
400 assert(idr_is_empty(&idr)); <<
401 <<
402 for (i = 1; i < 10000; i++) { 217 for (i = 1; i < 10000; i++) {
403 struct item *item = item_creat 218 struct item *item = item_create(i, 0);
404 assert(idr_alloc(&idr, item, 1 219 assert(idr_alloc(&idr, item, 1, 20000, GFP_KERNEL) == i);
405 } 220 }
406 221
407 idr_for_each(&idr, item_idr_free, &idr 222 idr_for_each(&idr, item_idr_free, &idr);
408 idr_destroy(&idr); 223 idr_destroy(&idr);
409 224
410 idr_replace_test(); 225 idr_replace_test();
411 idr_alloc_test(); 226 idr_alloc_test();
412 idr_null_test(); 227 idr_null_test();
413 idr_nowait_test(); 228 idr_nowait_test();
414 idr_get_next_test(0); !! 229 idr_get_next_test();
415 idr_get_next_test(1); !! 230 }
416 idr_get_next_test(4); <<
417 idr_u32_test(4); <<
418 idr_u32_test(1); <<
419 idr_u32_test(0); <<
420 idr_align_test(&idr); <<
421 idr_find_test(); <<
422 } <<
423 <<
424 #define module_init(x) <<
425 #define module_exit(x) <<
426 #define MODULE_AUTHOR(x) <<
427 #define MODULE_DESCRIPTION(X) <<
428 #define MODULE_LICENSE(x) <<
429 #define dump_stack() assert(0) <<
430 void ida_dump(struct ida *); <<
431 <<
432 #include "../../../lib/test_ida.c" <<
433 231
434 /* 232 /*
435 * Check that we get the correct error when we 233 * Check that we get the correct error when we run out of memory doing
436 * allocations. In userspace, GFP_NOWAIT will !! 234 * allocations. To ensure we run out of memory, just "forget" to preload.
437 * The first test is for not having a bitmap a 235 * The first test is for not having a bitmap available, and the second test
438 * is for not being able to allocate a level o 236 * is for not being able to allocate a level of the radix tree.
439 */ 237 */
440 void ida_check_nomem(void) 238 void ida_check_nomem(void)
441 { 239 {
442 DEFINE_IDA(ida); 240 DEFINE_IDA(ida);
>> 241 int id, err;
>> 242
>> 243 err = ida_get_new_above(&ida, 256, &id);
>> 244 assert(err == -EAGAIN);
>> 245 err = ida_get_new_above(&ida, 1UL << 30, &id);
>> 246 assert(err == -EAGAIN);
>> 247 }
>> 248
>> 249 /*
>> 250 * Check what happens when we fill a leaf and then delete it. This may
>> 251 * discover mishandling of IDR_FREE.
>> 252 */
>> 253 void ida_check_leaf(void)
>> 254 {
>> 255 DEFINE_IDA(ida);
443 int id; 256 int id;
>> 257 unsigned long i;
>> 258
>> 259 for (i = 0; i < IDA_BITMAP_BITS; i++) {
>> 260 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 261 assert(!ida_get_new(&ida, &id));
>> 262 assert(id == i);
>> 263 }
444 264
445 id = ida_alloc_min(&ida, 256, GFP_NOWA !! 265 ida_destroy(&ida);
446 IDA_BUG_ON(&ida, id != -ENOMEM); !! 266 assert(ida_is_empty(&ida));
447 id = ida_alloc_min(&ida, 1UL << 30, GF !! 267
448 IDA_BUG_ON(&ida, id != -ENOMEM); !! 268 assert(ida_pre_get(&ida, GFP_KERNEL));
449 IDA_BUG_ON(&ida, !ida_is_empty(&ida)); !! 269 assert(!ida_get_new(&ida, &id));
>> 270 assert(id == 0);
>> 271 ida_destroy(&ida);
>> 272 assert(ida_is_empty(&ida));
450 } 273 }
451 274
452 /* 275 /*
453 * Check handling of conversions between excep 276 * Check handling of conversions between exceptional entries and full bitmaps.
454 */ 277 */
455 void ida_check_conv_user(void) !! 278 void ida_check_conv(void)
456 { 279 {
457 DEFINE_IDA(ida); 280 DEFINE_IDA(ida);
>> 281 int id;
458 unsigned long i; 282 unsigned long i;
459 283
>> 284 for (i = 0; i < IDA_BITMAP_BITS * 2; i += IDA_BITMAP_BITS) {
>> 285 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 286 assert(!ida_get_new_above(&ida, i + 1, &id));
>> 287 assert(id == i + 1);
>> 288 assert(!ida_get_new_above(&ida, i + BITS_PER_LONG, &id));
>> 289 assert(id == i + BITS_PER_LONG);
>> 290 ida_remove(&ida, i + 1);
>> 291 ida_remove(&ida, i + BITS_PER_LONG);
>> 292 assert(ida_is_empty(&ida));
>> 293 }
>> 294
>> 295 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 296
>> 297 for (i = 0; i < IDA_BITMAP_BITS * 2; i++) {
>> 298 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 299 assert(!ida_get_new(&ida, &id));
>> 300 assert(id == i);
>> 301 }
>> 302
>> 303 for (i = IDA_BITMAP_BITS * 2; i > 0; i--) {
>> 304 ida_remove(&ida, i - 1);
>> 305 }
>> 306 assert(ida_is_empty(&ida));
>> 307
>> 308 for (i = 0; i < IDA_BITMAP_BITS + BITS_PER_LONG - 4; i++) {
>> 309 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 310 assert(!ida_get_new(&ida, &id));
>> 311 assert(id == i);
>> 312 }
>> 313
>> 314 for (i = IDA_BITMAP_BITS + BITS_PER_LONG - 4; i > 0; i--) {
>> 315 ida_remove(&ida, i - 1);
>> 316 }
>> 317 assert(ida_is_empty(&ida));
>> 318
>> 319 radix_tree_cpu_dead(1);
460 for (i = 0; i < 1000000; i++) { 320 for (i = 0; i < 1000000; i++) {
461 int id = ida_alloc(&ida, GFP_N !! 321 int err = ida_get_new(&ida, &id);
462 if (id == -ENOMEM) { !! 322 if (err == -EAGAIN) {
463 IDA_BUG_ON(&ida, ((i % !! 323 assert((i % IDA_BITMAP_BITS) == (BITS_PER_LONG - 2));
464 BITS !! 324 assert(ida_pre_get(&ida, GFP_KERNEL));
465 ((i % !! 325 err = ida_get_new(&ida, &id);
466 id = ida_alloc(&ida, G <<
467 } else { 326 } else {
468 IDA_BUG_ON(&ida, (i % !! 327 assert((i % IDA_BITMAP_BITS) != (BITS_PER_LONG - 2));
469 BITS_P <<
470 } 328 }
471 IDA_BUG_ON(&ida, id != i); !! 329 assert(!err);
>> 330 assert(id == i);
472 } 331 }
473 ida_destroy(&ida); 332 ida_destroy(&ida);
474 } 333 }
475 334
>> 335 /*
>> 336 * Check allocations up to and slightly above the maximum allowed (2^31-1) ID.
>> 337 * Allocating up to 2^31-1 should succeed, and then allocating the next one
>> 338 * should fail.
>> 339 */
>> 340 void ida_check_max(void)
>> 341 {
>> 342 DEFINE_IDA(ida);
>> 343 int id, err;
>> 344 unsigned long i, j;
>> 345
>> 346 for (j = 1; j < 65537; j *= 2) {
>> 347 unsigned long base = (1UL << 31) - j;
>> 348 for (i = 0; i < j; i++) {
>> 349 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 350 assert(!ida_get_new_above(&ida, base, &id));
>> 351 assert(id == base + i);
>> 352 }
>> 353 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 354 err = ida_get_new_above(&ida, base, &id);
>> 355 assert(err == -ENOSPC);
>> 356 ida_destroy(&ida);
>> 357 assert(ida_is_empty(&ida));
>> 358 rcu_barrier();
>> 359 }
>> 360 }
>> 361
476 void ida_check_random(void) 362 void ida_check_random(void)
477 { 363 {
478 DEFINE_IDA(ida); 364 DEFINE_IDA(ida);
479 DECLARE_BITMAP(bitmap, 2048); 365 DECLARE_BITMAP(bitmap, 2048);
>> 366 int id, err;
480 unsigned int i; 367 unsigned int i;
481 time_t s = time(NULL); 368 time_t s = time(NULL);
482 369
483 repeat: 370 repeat:
484 memset(bitmap, 0, sizeof(bitmap)); 371 memset(bitmap, 0, sizeof(bitmap));
485 for (i = 0; i < 100000; i++) { 372 for (i = 0; i < 100000; i++) {
486 int i = rand(); 373 int i = rand();
487 int bit = i & 2047; 374 int bit = i & 2047;
488 if (test_bit(bit, bitmap)) { 375 if (test_bit(bit, bitmap)) {
489 __clear_bit(bit, bitma 376 __clear_bit(bit, bitmap);
490 ida_free(&ida, bit); !! 377 ida_remove(&ida, bit);
491 } else { 378 } else {
492 __set_bit(bit, bitmap) 379 __set_bit(bit, bitmap);
493 IDA_BUG_ON(&ida, ida_a !! 380 do {
494 != bit !! 381 ida_pre_get(&ida, GFP_KERNEL);
>> 382 err = ida_get_new_above(&ida, bit, &id);
>> 383 } while (err == -ENOMEM);
>> 384 assert(!err);
>> 385 assert(id == bit);
495 } 386 }
496 } 387 }
497 ida_destroy(&ida); 388 ida_destroy(&ida);
498 if (time(NULL) < s + 10) 389 if (time(NULL) < s + 10)
499 goto repeat; 390 goto repeat;
500 } 391 }
501 392
502 void ida_simple_get_remove_test(void) 393 void ida_simple_get_remove_test(void)
503 { 394 {
504 DEFINE_IDA(ida); 395 DEFINE_IDA(ida);
505 unsigned long i; 396 unsigned long i;
506 397
507 for (i = 0; i < 10000; i++) { 398 for (i = 0; i < 10000; i++) {
508 assert(ida_simple_get(&ida, 0, 399 assert(ida_simple_get(&ida, 0, 20000, GFP_KERNEL) == i);
509 } 400 }
510 assert(ida_simple_get(&ida, 5, 30, GFP 401 assert(ida_simple_get(&ida, 5, 30, GFP_KERNEL) < 0);
511 402
512 for (i = 0; i < 10000; i++) { 403 for (i = 0; i < 10000; i++) {
513 ida_simple_remove(&ida, i); 404 ida_simple_remove(&ida, i);
514 } 405 }
515 assert(ida_is_empty(&ida)); 406 assert(ida_is_empty(&ida));
516 407
517 ida_destroy(&ida); 408 ida_destroy(&ida);
518 } 409 }
519 410
520 void user_ida_checks(void) !! 411 void ida_checks(void)
521 { 412 {
522 radix_tree_cpu_dead(1); !! 413 DEFINE_IDA(ida);
>> 414 int id;
>> 415 unsigned long i;
523 416
>> 417 radix_tree_cpu_dead(1);
524 ida_check_nomem(); 418 ida_check_nomem();
525 ida_check_conv_user(); !! 419
>> 420 for (i = 0; i < 10000; i++) {
>> 421 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 422 assert(!ida_get_new(&ida, &id));
>> 423 assert(id == i);
>> 424 }
>> 425
>> 426 ida_remove(&ida, 20);
>> 427 ida_remove(&ida, 21);
>> 428 for (i = 0; i < 3; i++) {
>> 429 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 430 assert(!ida_get_new(&ida, &id));
>> 431 if (i == 2)
>> 432 assert(id == 10000);
>> 433 }
>> 434
>> 435 for (i = 0; i < 5000; i++)
>> 436 ida_remove(&ida, i);
>> 437
>> 438 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 439 assert(!ida_get_new_above(&ida, 5000, &id));
>> 440 assert(id == 10001);
>> 441
>> 442 ida_destroy(&ida);
>> 443
>> 444 assert(ida_is_empty(&ida));
>> 445
>> 446 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 447 assert(!ida_get_new_above(&ida, 1, &id));
>> 448 assert(id == 1);
>> 449
>> 450 ida_remove(&ida, id);
>> 451 assert(ida_is_empty(&ida));
>> 452 ida_destroy(&ida);
>> 453 assert(ida_is_empty(&ida));
>> 454
>> 455 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 456 assert(!ida_get_new_above(&ida, 1, &id));
>> 457 ida_destroy(&ida);
>> 458 assert(ida_is_empty(&ida));
>> 459
>> 460 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 461 assert(!ida_get_new_above(&ida, 1, &id));
>> 462 assert(id == 1);
>> 463 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 464 assert(!ida_get_new_above(&ida, 1025, &id));
>> 465 assert(id == 1025);
>> 466 assert(ida_pre_get(&ida, GFP_KERNEL));
>> 467 assert(!ida_get_new_above(&ida, 10000, &id));
>> 468 assert(id == 10000);
>> 469 ida_remove(&ida, 1025);
>> 470 ida_destroy(&ida);
>> 471 assert(ida_is_empty(&ida));
>> 472
>> 473 ida_check_leaf();
>> 474 ida_check_max();
>> 475 ida_check_conv();
526 ida_check_random(); 476 ida_check_random();
527 ida_simple_get_remove_test(); 477 ida_simple_get_remove_test();
528 478
529 radix_tree_cpu_dead(1); 479 radix_tree_cpu_dead(1);
530 } 480 }
531 481
532 static void *ida_random_fn(void *arg) 482 static void *ida_random_fn(void *arg)
533 { 483 {
534 rcu_register_thread(); 484 rcu_register_thread();
535 ida_check_random(); 485 ida_check_random();
536 rcu_unregister_thread(); 486 rcu_unregister_thread();
537 return NULL; 487 return NULL;
538 } 488 }
539 489
540 static void *ida_leak_fn(void *arg) <<
541 { <<
542 struct ida *ida = arg; <<
543 time_t s = time(NULL); <<
544 int i, ret; <<
545 <<
546 rcu_register_thread(); <<
547 <<
548 do for (i = 0; i < 1000; i++) { <<
549 ret = ida_alloc_range(ida, 128 <<
550 if (ret >= 0) <<
551 ida_free(ida, 128); <<
552 } while (time(NULL) < s + 2); <<
553 <<
554 rcu_unregister_thread(); <<
555 return NULL; <<
556 } <<
557 <<
558 void ida_thread_tests(void) 490 void ida_thread_tests(void)
559 { 491 {
560 DEFINE_IDA(ida); !! 492 pthread_t threads[10];
561 pthread_t threads[20]; <<
562 int i; 493 int i;
563 494
564 for (i = 0; i < ARRAY_SIZE(threads); i 495 for (i = 0; i < ARRAY_SIZE(threads); i++)
565 if (pthread_create(&threads[i] 496 if (pthread_create(&threads[i], NULL, ida_random_fn, NULL)) {
566 perror("creating ida t 497 perror("creating ida thread");
567 exit(1); 498 exit(1);
568 } 499 }
569 500
570 while (i--) 501 while (i--)
571 pthread_join(threads[i], NULL) 502 pthread_join(threads[i], NULL);
572 <<
573 for (i = 0; i < ARRAY_SIZE(threads); i <<
574 if (pthread_create(&threads[i] <<
575 perror("creating ida t <<
576 exit(1); <<
577 } <<
578 <<
579 while (i--) <<
580 pthread_join(threads[i], NULL) <<
581 assert(ida_is_empty(&ida)); <<
582 } <<
583 <<
584 void ida_tests(void) <<
585 { <<
586 user_ida_checks(); <<
587 ida_checks(); <<
588 ida_exit(); <<
589 ida_thread_tests(); <<
590 } 503 }
591 504
592 int __weak main(void) 505 int __weak main(void)
593 { 506 {
594 rcu_register_thread(); <<
595 radix_tree_init(); 507 radix_tree_init();
596 idr_checks(); 508 idr_checks();
597 ida_tests(); !! 509 ida_checks();
>> 510 ida_thread_tests();
598 radix_tree_cpu_dead(1); 511 radix_tree_cpu_dead(1);
599 rcu_barrier(); 512 rcu_barrier();
600 if (nr_allocated) 513 if (nr_allocated)
601 printf("nr_allocated = %d\n", 514 printf("nr_allocated = %d\n", nr_allocated);
602 rcu_unregister_thread(); <<
603 return 0; 515 return 0;
604 } 516 }
605 517
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.