Blame view
lib/idr.c
17.3 KB
457c89965 treewide: Add SPD... |
1 |
// SPDX-License-Identifier: GPL-2.0-only |
0a835c4f0 Reimplement IDR a... |
2 |
#include <linux/bitmap.h> |
460488c58 idr: Remove idr_a... |
3 |
#include <linux/bug.h> |
8bc3bcc93 lib: reduce the u... |
4 |
#include <linux/export.h> |
1da177e4c Linux-2.6.12-rc2 |
5 |
#include <linux/idr.h> |
0a835c4f0 Reimplement IDR a... |
6 |
#include <linux/slab.h> |
88eca0207 ida: simplified f... |
7 |
#include <linux/spinlock.h> |
b94078e69 lib/idr.c: remove... |
8 |
#include <linux/xarray.h> |
1da177e4c Linux-2.6.12-rc2 |
9 |
|
e096f6a76 idr: Add idr_allo... |
10 11 12 13 14 15 16 17 18 19 |
/** * idr_alloc_u32() - Allocate an ID. * @idr: IDR handle. * @ptr: Pointer to be associated with the new ID. * @nextid: Pointer to an ID. * @max: The maximum ID to allocate (inclusive). * @gfp: Memory allocation flags. * * Allocates an unused ID in the range specified by @nextid and @max. * Note that @max is inclusive whereas the @end parameter to idr_alloc() |
460488c58 idr: Remove idr_a... |
20 21 22 |
* is exclusive. The new ID is assigned to @nextid before the pointer * is inserted into the IDR, so if @nextid points into the object pointed * to by @ptr, a concurrent lookup will not find an uninitialised ID. |
e096f6a76 idr: Add idr_allo... |
23 24 25 26 27 28 29 30 31 32 33 34 35 |
* * The caller should provide their own locking to ensure that two * concurrent modifications to the IDR are not possible. Read-only * accesses to the IDR may be done under the RCU read lock or may * exclude simultaneous writers. * * Return: 0 if an ID was allocated, -ENOMEM if memory allocation failed, * or -ENOSPC if no free IDs could be found. If an error occurred, * @nextid is unchanged. */ int idr_alloc_u32(struct idr *idr, void *ptr, u32 *nextid, unsigned long max, gfp_t gfp) { |
0a835c4f0 Reimplement IDR a... |
36 |
struct radix_tree_iter iter; |
388f79fda idr: Add new APIs... |
37 |
void __rcu **slot; |
4b0ad0765 idr: Fix handling... |
38 39 |
unsigned int base = idr->idr_base; unsigned int id = *nextid; |
d5c7409f7 idr: implement id... |
40 |
|
f8d5d0cc1 xarray: Add defin... |
41 42 |
if (WARN_ON_ONCE(!(idr->idr_rt.xa_flags & ROOT_IS_IDR))) idr->idr_rt.xa_flags |= IDR_RT_MARKER; |
d5c7409f7 idr: implement id... |
43 |
|
6ce711f27 idr: Make 1-based... |
44 45 46 |
id = (id < base) ? 0 : id - base; radix_tree_iter_init(&iter, id); slot = idr_get_free(&idr->idr_rt, &iter, gfp, max - base); |
0a835c4f0 Reimplement IDR a... |
47 48 |
if (IS_ERR(slot)) return PTR_ERR(slot); |
d5c7409f7 idr: implement id... |
49 |
|
6ce711f27 idr: Make 1-based... |
50 |
*nextid = iter.index + base; |
460488c58 idr: Remove idr_a... |
51 |
/* there is a memory barrier inside radix_tree_iter_replace() */ |
0a835c4f0 Reimplement IDR a... |
52 53 |
radix_tree_iter_replace(&idr->idr_rt, &iter, slot, ptr); radix_tree_iter_tag_clear(&idr->idr_rt, &iter, IDR_FREE); |
388f79fda idr: Add new APIs... |
54 |
|
388f79fda idr: Add new APIs... |
55 |
return 0; |
d5c7409f7 idr: implement id... |
56 |
} |
460488c58 idr: Remove idr_a... |
57 |
EXPORT_SYMBOL_GPL(idr_alloc_u32); |
d5c7409f7 idr: implement id... |
58 |
|
3e6628c4b idr: introduce id... |
59 |
/** |
460488c58 idr: Remove idr_a... |
60 61 62 63 64 65 |
* idr_alloc() - Allocate an ID. * @idr: IDR handle. * @ptr: Pointer to be associated with the new ID. * @start: The minimum ID (inclusive). * @end: The maximum ID (exclusive). * @gfp: Memory allocation flags. |
9bb26bc1f idr: make idr_des... |
66 |
* |
460488c58 idr: Remove idr_a... |
67 68 69 70 71 72 73 74 75 76 77 |
* Allocates an unused ID in the range specified by @start and @end. If * @end is <= 0, it is treated as one larger than %INT_MAX. This allows * callers to use @start + N as @end as long as N is within integer range. * * The caller should provide their own locking to ensure that two * concurrent modifications to the IDR are not possible. Read-only * accesses to the IDR may be done under the RCU read lock or may * exclude simultaneous writers. * * Return: The newly allocated ID, -ENOMEM if memory allocation failed, * or -ENOSPC if no free IDs could be found. |
8d3b35914 [PATCH] inotify/i... |
78 |
*/ |
460488c58 idr: Remove idr_a... |
79 |
int idr_alloc(struct idr *idr, void *ptr, int start, int end, gfp_t gfp) |
1da177e4c Linux-2.6.12-rc2 |
80 |
{ |
460488c58 idr: Remove idr_a... |
81 82 83 84 85 86 87 88 89 |
u32 id = start; int ret; if (WARN_ON_ONCE(start < 0)) return -EINVAL; ret = idr_alloc_u32(idr, ptr, &id, end > 0 ? end - 1 : INT_MAX, gfp); if (ret) return ret; |
1da177e4c Linux-2.6.12-rc2 |
90 |
|
460488c58 idr: Remove idr_a... |
91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 |
return id; } EXPORT_SYMBOL_GPL(idr_alloc); /** * idr_alloc_cyclic() - Allocate an ID cyclically. * @idr: IDR handle. * @ptr: Pointer to be associated with the new ID. * @start: The minimum ID (inclusive). * @end: The maximum ID (exclusive). * @gfp: Memory allocation flags. * * Allocates an unused ID in the range specified by @nextid and @end. If * @end is <= 0, it is treated as one larger than %INT_MAX. This allows * callers to use @start + N as @end as long as N is within integer range. * The search for an unused ID will start at the last ID allocated and will * wrap around to @start if no free IDs are found before reaching @end. * * The caller should provide their own locking to ensure that two * concurrent modifications to the IDR are not possible. Read-only * accesses to the IDR may be done under the RCU read lock or may * exclude simultaneous writers. * * Return: The newly allocated ID, -ENOMEM if memory allocation failed, * or -ENOSPC if no free IDs could be found. */ int idr_alloc_cyclic(struct idr *idr, void *ptr, int start, int end, gfp_t gfp) { u32 id = idr->idr_next; int err, max = end > 0 ? end - 1 : INT_MAX; |
e8c8d1bc0 idr: remove MAX_I... |
121 |
|
460488c58 idr: Remove idr_a... |
122 123 |
if ((int)id < start) id = start; |
1da177e4c Linux-2.6.12-rc2 |
124 |
|
460488c58 idr: Remove idr_a... |
125 126 127 128 129 130 131 |
err = idr_alloc_u32(idr, ptr, &id, max, gfp); if ((err == -ENOSPC) && (id > start)) { id = start; err = idr_alloc_u32(idr, ptr, &id, max, gfp); } if (err) return err; |
1da177e4c Linux-2.6.12-rc2 |
132 |
|
460488c58 idr: Remove idr_a... |
133 |
idr->idr_next = id + 1; |
0a835c4f0 Reimplement IDR a... |
134 |
return id; |
1da177e4c Linux-2.6.12-rc2 |
135 |
} |
0a835c4f0 Reimplement IDR a... |
136 |
EXPORT_SYMBOL(idr_alloc_cyclic); |
1da177e4c Linux-2.6.12-rc2 |
137 |
|
5806f07cd [PATCH] lib: add ... |
138 |
/** |
6ce711f27 idr: Make 1-based... |
139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 |
* idr_remove() - Remove an ID from the IDR. * @idr: IDR handle. * @id: Pointer ID. * * Removes this ID from the IDR. If the ID was not previously in the IDR, * this function returns %NULL. * * Since this function modifies the IDR, the caller should provide their * own locking to ensure that concurrent modification of the same IDR is * not possible. * * Return: The pointer formerly associated with this ID. */ void *idr_remove(struct idr *idr, unsigned long id) { return radix_tree_delete_item(&idr->idr_rt, id - idr->idr_base, NULL); } EXPORT_SYMBOL_GPL(idr_remove); /** * idr_find() - Return pointer for given ID. * @idr: IDR handle. * @id: Pointer ID. * * Looks up the pointer associated with this ID. A %NULL pointer may * indicate that @id is not allocated or that the %NULL pointer was * associated with this ID. * * This function can be called under rcu_read_lock(), given that the leaf * pointers lifetimes are correctly managed. * * Return: The pointer associated with this ID. */ void *idr_find(const struct idr *idr, unsigned long id) { return radix_tree_lookup(&idr->idr_rt, id - idr->idr_base); } EXPORT_SYMBOL_GPL(idr_find); /** |
7a4575778 idr: Rename idr_f... |
179 180 181 182 |
* idr_for_each() - Iterate through all stored pointers. * @idr: IDR handle. * @fn: Function to be called for each pointer. * @data: Data passed to callback function. |
96d7fa421 lib: add idr_for_... |
183 |
* |
0a835c4f0 Reimplement IDR a... |
184 |
* The callback function will be called for each entry in @idr, passing |
7a4575778 idr: Rename idr_f... |
185 |
* the ID, the entry and @data. |
96d7fa421 lib: add idr_for_... |
186 |
* |
0a835c4f0 Reimplement IDR a... |
187 188 |
* If @fn returns anything other than %0, the iteration stops and that * value is returned from this function. |
96d7fa421 lib: add idr_for_... |
189 |
* |
0a835c4f0 Reimplement IDR a... |
190 191 192 193 |
* idr_for_each() can be called concurrently with idr_alloc() and * idr_remove() if protected by RCU. Newly added entries may not be * seen and deleted entries may be seen, but adding and removing entries * will not cause other entries to be skipped, nor spurious ones to be seen. |
96d7fa421 lib: add idr_for_... |
194 |
*/ |
0a835c4f0 Reimplement IDR a... |
195 196 |
int idr_for_each(const struct idr *idr, int (*fn)(int id, void *p, void *data), void *data) |
96d7fa421 lib: add idr_for_... |
197 |
{ |
0a835c4f0 Reimplement IDR a... |
198 |
struct radix_tree_iter iter; |
7e73eb0b2 idr: Add missing ... |
199 |
void __rcu **slot; |
6ce711f27 idr: Make 1-based... |
200 |
int base = idr->idr_base; |
96d7fa421 lib: add idr_for_... |
201 |
|
0a835c4f0 Reimplement IDR a... |
202 |
radix_tree_for_each_slot(slot, &idr->idr_rt, &iter, 0) { |
72fd6c7be idr: Warn if old ... |
203 |
int ret; |
4b0ad0765 idr: Fix handling... |
204 |
unsigned long id = iter.index + base; |
72fd6c7be idr: Warn if old ... |
205 |
|
4b0ad0765 idr: Fix handling... |
206 |
if (WARN_ON_ONCE(id > INT_MAX)) |
72fd6c7be idr: Warn if old ... |
207 |
break; |
4b0ad0765 idr: Fix handling... |
208 |
ret = fn(id, rcu_dereference_raw(*slot), data); |
0a835c4f0 Reimplement IDR a... |
209 210 |
if (ret) return ret; |
96d7fa421 lib: add idr_for_... |
211 |
} |
0a835c4f0 Reimplement IDR a... |
212 |
return 0; |
96d7fa421 lib: add idr_for_... |
213 214 215 216 |
} EXPORT_SYMBOL(idr_for_each); /** |
5a74ac4c4 idr: Fix idr_get_... |
217 |
* idr_get_next_ul() - Find next populated entry. |
7a4575778 idr: Rename idr_f... |
218 219 |
* @idr: IDR handle. * @nextid: Pointer to an ID. |
0a835c4f0 Reimplement IDR a... |
220 221 222 223 224 |
* * Returns the next populated entry in the tree with an ID greater than * or equal to the value pointed to by @nextid. On exit, @nextid is updated * to the ID of the found value. To use in a loop, the value pointed to by * nextid must be incremented by the user. |
38460b48d cgroup: CSS ID su... |
225 |
*/ |
5a74ac4c4 idr: Fix idr_get_... |
226 |
void *idr_get_next_ul(struct idr *idr, unsigned long *nextid) |
38460b48d cgroup: CSS ID su... |
227 |
{ |
0a835c4f0 Reimplement IDR a... |
228 |
struct radix_tree_iter iter; |
7e73eb0b2 idr: Add missing ... |
229 |
void __rcu **slot; |
5c089fd0c idr: Fix idr_get_... |
230 |
void *entry = NULL; |
4b0ad0765 idr: Fix handling... |
231 232 |
unsigned long base = idr->idr_base; unsigned long id = *nextid; |
38460b48d cgroup: CSS ID su... |
233 |
|
6ce711f27 idr: Make 1-based... |
234 |
id = (id < base) ? 0 : id - base; |
5c089fd0c idr: Fix idr_get_... |
235 236 237 238 239 240 241 242 243 244 |
radix_tree_for_each_slot(slot, &idr->idr_rt, &iter, id) { entry = rcu_dereference_raw(*slot); if (!entry) continue; if (!xa_is_internal(entry)) break; if (slot != &idr->idr_rt.xa_head && !xa_is_retry(entry)) break; slot = radix_tree_iter_retry(&iter); } |
0a835c4f0 Reimplement IDR a... |
245 |
if (!slot) |
38460b48d cgroup: CSS ID su... |
246 |
return NULL; |
72fd6c7be idr: Warn if old ... |
247 |
|
5a74ac4c4 idr: Fix idr_get_... |
248 |
*nextid = iter.index + base; |
5c089fd0c idr: Fix idr_get_... |
249 |
return entry; |
38460b48d cgroup: CSS ID su... |
250 |
} |
5a74ac4c4 idr: Fix idr_get_... |
251 |
EXPORT_SYMBOL(idr_get_next_ul); |
38460b48d cgroup: CSS ID su... |
252 |
|
7a4575778 idr: Rename idr_f... |
253 |
/** |
5a74ac4c4 idr: Fix idr_get_... |
254 |
* idr_get_next() - Find next populated entry. |
7a4575778 idr: Rename idr_f... |
255 256 257 258 259 260 261 262 |
* @idr: IDR handle. * @nextid: Pointer to an ID. * * Returns the next populated entry in the tree with an ID greater than * or equal to the value pointed to by @nextid. On exit, @nextid is updated * to the ID of the found value. To use in a loop, the value pointed to by * nextid must be incremented by the user. */ |
5a74ac4c4 idr: Fix idr_get_... |
263 |
void *idr_get_next(struct idr *idr, int *nextid) |
388f79fda idr: Add new APIs... |
264 |
{ |
6ce711f27 idr: Make 1-based... |
265 |
unsigned long id = *nextid; |
5a74ac4c4 idr: Fix idr_get_... |
266 |
void *entry = idr_get_next_ul(idr, &id); |
388f79fda idr: Add new APIs... |
267 |
|
5a74ac4c4 idr: Fix idr_get_... |
268 |
if (WARN_ON_ONCE(id > INT_MAX)) |
388f79fda idr: Add new APIs... |
269 |
return NULL; |
5a74ac4c4 idr: Fix idr_get_... |
270 271 |
*nextid = id; return entry; |
388f79fda idr: Add new APIs... |
272 |
} |
5a74ac4c4 idr: Fix idr_get_... |
273 |
EXPORT_SYMBOL(idr_get_next); |
388f79fda idr: Add new APIs... |
274 |
|
38460b48d cgroup: CSS ID su... |
275 |
/** |
460488c58 idr: Remove idr_a... |
276 277 278 279 |
* idr_replace() - replace pointer for given ID. * @idr: IDR handle. * @ptr: New pointer to associate with the ID. * @id: ID to change. |
5806f07cd [PATCH] lib: add ... |
280 |
* |
0a835c4f0 Reimplement IDR a... |
281 282 283 284 |
* Replace the pointer registered with an ID and return the old value. * This function can be called under the RCU read lock concurrently with * idr_alloc() and idr_remove() (as long as the ID being removed is not * the one being replaced!). |
5806f07cd [PATCH] lib: add ... |
285 |
* |
a70e43a59 lib/idr.c: fix co... |
286 |
* Returns: the old value on success. %-ENOENT indicates that @id was not |
234a4624e idr: Delete idr_r... |
287 |
* found. %-EINVAL indicates that @ptr was not valid. |
5806f07cd [PATCH] lib: add ... |
288 |
*/ |
234a4624e idr: Delete idr_r... |
289 |
void *idr_replace(struct idr *idr, void *ptr, unsigned long id) |
388f79fda idr: Add new APIs... |
290 |
{ |
0a835c4f0 Reimplement IDR a... |
291 |
struct radix_tree_node *node; |
7e73eb0b2 idr: Add missing ... |
292 |
void __rcu **slot = NULL; |
0a835c4f0 Reimplement IDR a... |
293 |
void *entry; |
5806f07cd [PATCH] lib: add ... |
294 |
|
6ce711f27 idr: Make 1-based... |
295 |
id -= idr->idr_base; |
e8c8d1bc0 idr: remove MAX_I... |
296 |
|
0a835c4f0 Reimplement IDR a... |
297 298 |
entry = __radix_tree_lookup(&idr->idr_rt, id, &node, &slot); if (!slot || radix_tree_tag_get(&idr->idr_rt, id, IDR_FREE)) |
5806f07cd [PATCH] lib: add ... |
299 |
return ERR_PTR(-ENOENT); |
1cf56f9d6 radix tree: Remov... |
300 |
__radix_tree_replace(&idr->idr_rt, node, slot, ptr); |
5806f07cd [PATCH] lib: add ... |
301 |
|
0a835c4f0 Reimplement IDR a... |
302 |
return entry; |
5806f07cd [PATCH] lib: add ... |
303 |
} |
234a4624e idr: Delete idr_r... |
304 |
EXPORT_SYMBOL(idr_replace); |
5806f07cd [PATCH] lib: add ... |
305 |
|
56083ab17 docbook: add idr/... |
306 307 |
/** * DOC: IDA description |
72dba584b ida: implement id... |
308 |
* |
0a835c4f0 Reimplement IDR a... |
309 310 311 312 313 |
* The IDA is an ID allocator which does not provide the ability to * associate an ID with a pointer. As such, it only needs to store one * bit per ID, and so is more space efficient than an IDR. To use an IDA, * define it using DEFINE_IDA() (or embed a &struct ida in a data structure, * then initialise it using ida_init()). To allocate a new ID, call |
5ade60dda ida: Add new API |
314 315 |
* ida_alloc(), ida_alloc_min(), ida_alloc_max() or ida_alloc_range(). * To free an ID, call ida_free(). |
0a835c4f0 Reimplement IDR a... |
316 |
* |
b03f8e43c ida: Remove old API |
317 318 319 |
* ida_destroy() can be used to dispose of an IDA without needing to * free the individual IDs in it. You can use ida_is_empty() to find * out whether the IDA has any IDs currently allocated. |
0a835c4f0 Reimplement IDR a... |
320 |
* |
f32f004cd ida: Convert to X... |
321 322 323 |
* The IDA handles its own locking. It is safe to call any of the IDA * functions without synchronisation in your code. * |
0a835c4f0 Reimplement IDR a... |
324 325 |
* IDs are currently limited to the range [0-INT_MAX]. If this is an awkward * limitation, it should be quite straightforward to raise the maximum. |
72dba584b ida: implement id... |
326 |
*/ |
d37cacc5a ida: Use exceptio... |
327 328 329 |
/* * Developer's notes: * |
f32f004cd ida: Convert to X... |
330 331 332 |
* The IDA uses the functionality provided by the XArray to store bitmaps in * each entry. The XA_FREE_MARK is only cleared when all bits in the bitmap * have been set. |
d37cacc5a ida: Use exceptio... |
333 |
* |
f32f004cd ida: Convert to X... |
334 335 336 337 338 |
* I considered telling the XArray that each slot is an order-10 node * and indexing by bit number, but the XArray can't allow a single multi-index * entry in the head, which would significantly increase memory consumption * for the IDA. So instead we divide the index by the number of bits in the * leaf bitmap before doing a radix tree lookup. |
d37cacc5a ida: Use exceptio... |
339 340 |
* * As an optimisation, if there are only a few low bits set in any given |
3159f943a xarray: Replace e... |
341 |
* leaf, instead of allocating a 128-byte bitmap, we store the bits |
f32f004cd ida: Convert to X... |
342 343 344 345 346 347 348 349 350 351 352 353 354 355 |
* as a value entry. Value entries never have the XA_FREE_MARK cleared * because we can always convert them into a bitmap entry. * * It would be possible to optimise further; once we've run out of a * single 128-byte bitmap, we currently switch to a 576-byte node, put * the 128-byte bitmap in the first entry and then start allocating extra * 128-byte entries. We could instead use the 512 bytes of the node's * data as a bitmap before moving to that scheme. I do not believe this * is a worthwhile optimisation; Rasmus Villemoes surveyed the current * users of the IDA and almost none of them use more than 1024 entries. * Those that do use more than the 8192 IDs that the 512 bytes would * provide. * * The IDA always uses a lock to alloc/free. If we add a 'test_bit' |
d37cacc5a ida: Use exceptio... |
356 357 358 359 360 |
* equivalent, it will still need locking. Going to RCU lookup would require * using RCU to free bitmaps, and that's not trivial without embedding an * RCU head in the bitmap, which adds a 2-pointer overhead to each 128-byte * bitmap, which is excessive. */ |
f32f004cd ida: Convert to X... |
361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 |
/** * ida_alloc_range() - Allocate an unused ID. * @ida: IDA handle. * @min: Lowest ID to allocate. * @max: Highest ID to allocate. * @gfp: Memory allocation flags. * * Allocate an ID between @min and @max, inclusive. The allocated ID will * not exceed %INT_MAX, even if @max is larger. * * Context: Any context. * Return: The allocated ID, or %-ENOMEM if memory could not be allocated, * or %-ENOSPC if there are no free IDs. */ int ida_alloc_range(struct ida *ida, unsigned int min, unsigned int max, gfp_t gfp) |
72dba584b ida: implement id... |
377 |
{ |
f32f004cd ida: Convert to X... |
378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 |
XA_STATE(xas, &ida->xa, min / IDA_BITMAP_BITS); unsigned bit = min % IDA_BITMAP_BITS; unsigned long flags; struct ida_bitmap *bitmap, *alloc = NULL; if ((int)min < 0) return -ENOSPC; if ((int)max < 0) max = INT_MAX; retry: xas_lock_irqsave(&xas, flags); next: bitmap = xas_find_marked(&xas, max / IDA_BITMAP_BITS, XA_FREE_MARK); if (xas.xa_index > min / IDA_BITMAP_BITS) bit = 0; if (xas.xa_index * IDA_BITMAP_BITS + bit > max) goto nospc; if (xa_is_value(bitmap)) { unsigned long tmp = xa_to_value(bitmap); if (bit < BITS_PER_XA_VALUE) { bit = find_next_zero_bit(&tmp, BITS_PER_XA_VALUE, bit); if (xas.xa_index * IDA_BITMAP_BITS + bit > max) goto nospc; if (bit < BITS_PER_XA_VALUE) { tmp |= 1UL << bit; xas_store(&xas, xa_mk_value(tmp)); goto out; |
0a835c4f0 Reimplement IDR a... |
409 410 |
} } |
f32f004cd ida: Convert to X... |
411 412 413 414 415 416 417 418 419 420 |
bitmap = alloc; if (!bitmap) bitmap = kzalloc(sizeof(*bitmap), GFP_NOWAIT); if (!bitmap) goto alloc; bitmap->bitmap[0] = tmp; xas_store(&xas, bitmap); if (xas_error(&xas)) { bitmap->bitmap[0] = 0; goto out; |
d37cacc5a ida: Use exceptio... |
421 |
} |
f32f004cd ida: Convert to X... |
422 |
} |
d37cacc5a ida: Use exceptio... |
423 |
|
f32f004cd ida: Convert to X... |
424 425 426 427 428 429 |
if (bitmap) { bit = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, bit); if (xas.xa_index * IDA_BITMAP_BITS + bit > max) goto nospc; if (bit == IDA_BITMAP_BITS) goto next; |
72dba584b ida: implement id... |
430 |
|
f32f004cd ida: Convert to X... |
431 432 433 434 435 436 |
__set_bit(bit, bitmap->bitmap); if (bitmap_full(bitmap->bitmap, IDA_BITMAP_BITS)) xas_clear_mark(&xas, XA_FREE_MARK); } else { if (bit < BITS_PER_XA_VALUE) { bitmap = xa_mk_value(1UL << bit); |
0a835c4f0 Reimplement IDR a... |
437 |
} else { |
f32f004cd ida: Convert to X... |
438 439 440 441 442 443 |
bitmap = alloc; if (!bitmap) bitmap = kzalloc(sizeof(*bitmap), GFP_NOWAIT); if (!bitmap) goto alloc; __set_bit(bit, bitmap->bitmap); |
0a835c4f0 Reimplement IDR a... |
444 |
} |
f32f004cd ida: Convert to X... |
445 446 447 448 449 450 451 452 |
xas_store(&xas, bitmap); } out: xas_unlock_irqrestore(&xas, flags); if (xas_nomem(&xas, gfp)) { xas.xa_index = min / IDA_BITMAP_BITS; bit = min % IDA_BITMAP_BITS; goto retry; |
72dba584b ida: implement id... |
453 |
} |
f32f004cd ida: Convert to X... |
454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 |
if (bitmap != alloc) kfree(alloc); if (xas_error(&xas)) return xas_error(&xas); return xas.xa_index * IDA_BITMAP_BITS + bit; alloc: xas_unlock_irqrestore(&xas, flags); alloc = kzalloc(sizeof(*bitmap), gfp); if (!alloc) return -ENOMEM; xas_set(&xas, min / IDA_BITMAP_BITS); bit = min % IDA_BITMAP_BITS; goto retry; nospc: xas_unlock_irqrestore(&xas, flags); return -ENOSPC; |
72dba584b ida: implement id... |
470 |
} |
f32f004cd ida: Convert to X... |
471 |
EXPORT_SYMBOL(ida_alloc_range); |
72dba584b ida: implement id... |
472 |
|
f32f004cd ida: Convert to X... |
473 474 475 476 477 478 479 480 |
/** * ida_free() - Release an allocated ID. * @ida: IDA handle. * @id: Previously allocated ID. * * Context: Any context. */ void ida_free(struct ida *ida, unsigned int id) |
72dba584b ida: implement id... |
481 |
{ |
f32f004cd ida: Convert to X... |
482 483 |
XA_STATE(xas, &ida->xa, id / IDA_BITMAP_BITS); unsigned bit = id % IDA_BITMAP_BITS; |
72dba584b ida: implement id... |
484 |
struct ida_bitmap *bitmap; |
f32f004cd ida: Convert to X... |
485 |
unsigned long flags; |
72dba584b ida: implement id... |
486 |
|
f32f004cd ida: Convert to X... |
487 488 489 490 |
BUG_ON((int)id < 0); xas_lock_irqsave(&xas, flags); bitmap = xas_load(&xas); |
8f9f665a7 idr: fix unexpect... |
491 |
|
3159f943a xarray: Replace e... |
492 |
if (xa_is_value(bitmap)) { |
f32f004cd ida: Convert to X... |
493 494 495 496 |
unsigned long v = xa_to_value(bitmap); if (bit >= BITS_PER_XA_VALUE) goto err; if (!(v & (1UL << bit))) |
d37cacc5a ida: Use exceptio... |
497 |
goto err; |
f32f004cd ida: Convert to X... |
498 499 500 501 |
v &= ~(1UL << bit); if (!v) goto delete; xas_store(&xas, xa_mk_value(v)); |
d37cacc5a ida: Use exceptio... |
502 |
} else { |
f32f004cd ida: Convert to X... |
503 504 505 506 507 508 509 510 511 |
if (!test_bit(bit, bitmap->bitmap)) goto err; __clear_bit(bit, bitmap->bitmap); xas_set_mark(&xas, XA_FREE_MARK); if (bitmap_empty(bitmap->bitmap, IDA_BITMAP_BITS)) { kfree(bitmap); delete: xas_store(&xas, NULL); } |
72dba584b ida: implement id... |
512 |
} |
f32f004cd ida: Convert to X... |
513 |
xas_unlock_irqrestore(&xas, flags); |
72dba584b ida: implement id... |
514 |
return; |
72dba584b ida: implement id... |
515 |
err: |
f32f004cd ida: Convert to X... |
516 |
xas_unlock_irqrestore(&xas, flags); |
b03f8e43c ida: Remove old API |
517 518 |
WARN(1, "ida_free called for id=%d which is not allocated. ", id); |
72dba584b ida: implement id... |
519 |
} |
f32f004cd ida: Convert to X... |
520 |
EXPORT_SYMBOL(ida_free); |
72dba584b ida: implement id... |
521 522 |
/** |
50d97d507 ida: Lock the IDA... |
523 524 525 526 527 528 529 |
* ida_destroy() - Free all IDs. * @ida: IDA handle. * * Calling this function frees all IDs and releases all resources used * by an IDA. When this call returns, the IDA is empty and can be reused * or freed. If the IDA is already empty, there is no need to call this * function. |
0a835c4f0 Reimplement IDR a... |
530 |
* |
50d97d507 ida: Lock the IDA... |
531 |
* Context: Any context. |
72dba584b ida: implement id... |
532 533 534 |
*/ void ida_destroy(struct ida *ida) { |
f32f004cd ida: Convert to X... |
535 536 |
XA_STATE(xas, &ida->xa, 0); struct ida_bitmap *bitmap; |
50d97d507 ida: Lock the IDA... |
537 |
unsigned long flags; |
0a835c4f0 Reimplement IDR a... |
538 |
|
f32f004cd ida: Convert to X... |
539 540 |
xas_lock_irqsave(&xas, flags); xas_for_each(&xas, bitmap, ULONG_MAX) { |
3159f943a xarray: Replace e... |
541 |
if (!xa_is_value(bitmap)) |
d37cacc5a ida: Use exceptio... |
542 |
kfree(bitmap); |
f32f004cd ida: Convert to X... |
543 |
xas_store(&xas, NULL); |
0a835c4f0 Reimplement IDR a... |
544 |
} |
f32f004cd ida: Convert to X... |
545 |
xas_unlock_irqrestore(&xas, flags); |
72dba584b ida: implement id... |
546 547 |
} EXPORT_SYMBOL(ida_destroy); |
f32f004cd ida: Convert to X... |
548 549 550 |
#ifndef __KERNEL__ extern void xa_dump_index(unsigned long index, unsigned int shift); #define IDA_CHUNK_SHIFT ilog2(IDA_BITMAP_BITS) |
88eca0207 ida: simplified f... |
551 |
|
f32f004cd ida: Convert to X... |
552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 |
static void ida_dump_entry(void *entry, unsigned long index) { unsigned long i; if (!entry) return; if (xa_is_node(entry)) { struct xa_node *node = xa_to_node(entry); unsigned int shift = node->shift + IDA_CHUNK_SHIFT + XA_CHUNK_SHIFT; xa_dump_index(index * IDA_BITMAP_BITS, shift); xa_dump_node(node); for (i = 0; i < XA_CHUNK_SIZE; i++) ida_dump_entry(node->slots[i], index | (i << node->shift)); } else if (xa_is_value(entry)) { xa_dump_index(index * IDA_BITMAP_BITS, ilog2(BITS_PER_LONG)); pr_cont("value: data %lx [%px] ", xa_to_value(entry), entry); } else { struct ida_bitmap *bitmap = entry; |
88eca0207 ida: simplified f... |
575 |
|
f32f004cd ida: Convert to X... |
576 577 578 579 580 581 |
xa_dump_index(index * IDA_BITMAP_BITS, IDA_CHUNK_SHIFT); pr_cont("bitmap: %p data", bitmap); for (i = 0; i < IDA_BITMAP_LONGS; i++) pr_cont(" %lx", bitmap->bitmap[i]); pr_cont(" "); |
5ade60dda ida: Add new API |
582 |
} |
88eca0207 ida: simplified f... |
583 |
} |
88eca0207 ida: simplified f... |
584 |
|
f32f004cd ida: Convert to X... |
585 |
static void ida_dump(struct ida *ida) |
88eca0207 ida: simplified f... |
586 |
{ |
f32f004cd ida: Convert to X... |
587 588 589 590 591 |
struct xarray *xa = &ida->xa; pr_debug("ida: %p node %p free %d ", ida, xa->xa_head, xa->xa_flags >> ROOT_TAG_SHIFT); ida_dump_entry(xa->xa_head, 0); |
88eca0207 ida: simplified f... |
592 |
} |
f32f004cd ida: Convert to X... |
593 |
#endif |