2 * 2002-10-18 written by Jim Houston jim.houston@ccur.com
3 * Copyright (C) 2002 by Concurrent Computer Corporation
4 * Distributed under the GNU GPL license version 2.
6 * Modified by George Anzinger to reuse immediately and to use
7 * find bit instructions. Also removed _irq on spinlocks.
9 * Modified by Nadia Derbey to make it RCU safe.
11 * Small id to pointer translation service.
13 * It uses a radix tree like structure as a sparse array indexed
14 * by the id to obtain the pointer. The bitmap makes allocating
17 * You call it to allocate an id (an int) an associate with that id a
18 * pointer or what ever, we treat it as a (void *). You can pass this
19 * id to a user for him to pass back at a later time. You then pass
20 * that id to this code and it returns your pointer.
22 * You can release ids at any time. When all ids are released, most of
23 * the memory is returned (we keep MAX_IDR_FREE) in a local pool so we
24 * don't need to go to the memory "store" during an id allocate, just
25 * so you don't need to be too concerned about locking and conflicts
26 * with the slab allocator.
29 #ifndef TEST // to test in user space...
30 #include <linux/slab.h>
31 #include <linux/init.h>
32 #include <linux/export.h>
34 #include <linux/err.h>
35 #include <linux/string.h>
36 #include <linux/idr.h>
37 #include <linux/spinlock.h>
39 static struct kmem_cache *idr_layer_cache;
40 static DEFINE_SPINLOCK(simple_ida_lock);
42 static struct idr_layer *get_from_free_list(struct idr *idp)
47 spin_lock_irqsave(&idp->lock, flags);
48 if ((p = idp->id_free)) {
49 idp->id_free = p->ary[0];
53 spin_unlock_irqrestore(&idp->lock, flags);
57 static void idr_layer_rcu_free(struct rcu_head *head)
59 struct idr_layer *layer;
61 layer = container_of(head, struct idr_layer, rcu_head);
62 kmem_cache_free(idr_layer_cache, layer);
65 static inline void free_layer(struct idr_layer *p)
67 call_rcu(&p->rcu_head, idr_layer_rcu_free);
70 /* only called when idp->lock is held */
71 static void __move_to_free_list(struct idr *idp, struct idr_layer *p)
73 p->ary[0] = idp->id_free;
78 static void move_to_free_list(struct idr *idp, struct idr_layer *p)
83 * Depends on the return element being zeroed.
85 spin_lock_irqsave(&idp->lock, flags);
86 __move_to_free_list(idp, p);
87 spin_unlock_irqrestore(&idp->lock, flags);
90 static void idr_mark_full(struct idr_layer **pa, int id)
92 struct idr_layer *p = pa[0];
95 __set_bit(id & IDR_MASK, &p->bitmap);
97 * If this layer is full mark the bit in the layer above to
98 * show that this part of the radix tree is full. This may
99 * complete the layer above and require walking up the radix
102 while (p->bitmap == IDR_FULL) {
106 __set_bit((id & IDR_MASK), &p->bitmap);
111 * idr_pre_get - reserve resources for idr allocation
113 * @gfp_mask: memory allocation flags
115 * This function should be called prior to calling the idr_get_new* functions.
116 * It preallocates enough memory to satisfy the worst possible allocation. The
117 * caller should pass in GFP_KERNEL if possible. This of course requires that
118 * no spinning locks be held.
120 * If the system is REALLY out of memory this function returns %0,
123 int idr_pre_get(struct idr *idp, gfp_t gfp_mask)
125 while (idp->id_free_cnt < MAX_IDR_FREE) {
126 struct idr_layer *new;
127 new = kmem_cache_zalloc(idr_layer_cache, gfp_mask);
130 move_to_free_list(idp, new);
134 EXPORT_SYMBOL(idr_pre_get);
136 static int sub_alloc(struct idr *idp, int *starting_id, struct idr_layer **pa)
139 struct idr_layer *p, *new;
150 * We run around this while until we reach the leaf node...
152 n = (id >> (IDR_BITS*l)) & IDR_MASK;
154 m = find_next_bit(&bm, IDR_SIZE, n);
156 /* no space available go back to previous layer. */
159 id = (id | ((1 << (IDR_BITS * l)) - 1)) + 1;
161 /* if already at the top layer, we need to grow */
162 if (id >= 1 << (idp->layers * IDR_BITS)) {
164 return IDR_NEED_TO_GROW;
169 /* If we need to go up one layer, continue the
170 * loop; otherwise, restart from the top.
172 sh = IDR_BITS * (l + 1);
173 if (oid >> sh == id >> sh)
180 id = ((id >> sh) ^ n ^ m) << sh;
182 if ((id >= MAX_IDR_BIT) || (id < 0))
183 return IDR_NOMORE_SPACE;
187 * Create the layer below if it is missing.
190 new = get_from_free_list(idp);
194 rcu_assign_pointer(p->ary[m], new);
205 static int idr_get_empty_slot(struct idr *idp, int starting_id,
206 struct idr_layer **pa)
208 struct idr_layer *p, *new;
215 layers = idp->layers;
217 if (!(p = get_from_free_list(idp)))
223 * Add a new layer to the top of the tree if the requested
224 * id is larger than the currently allocated space.
226 while ((layers < (MAX_IDR_LEVEL - 1)) && (id >= (1 << (layers*IDR_BITS)))) {
229 /* special case: if the tree is currently empty,
230 * then we grow the tree by moving the top node
236 if (!(new = get_from_free_list(idp))) {
238 * The allocation failed. If we built part of
239 * the structure tear it down.
241 spin_lock_irqsave(&idp->lock, flags);
242 for (new = p; p && p != idp->top; new = p) {
245 new->bitmap = new->count = 0;
246 __move_to_free_list(idp, new);
248 spin_unlock_irqrestore(&idp->lock, flags);
253 new->layer = layers-1;
254 if (p->bitmap == IDR_FULL)
255 __set_bit(0, &new->bitmap);
258 rcu_assign_pointer(idp->top, p);
259 idp->layers = layers;
260 v = sub_alloc(idp, &id, pa);
261 if (v == IDR_NEED_TO_GROW)
266 static int idr_get_new_above_int(struct idr *idp, void *ptr, int starting_id)
268 struct idr_layer *pa[MAX_IDR_LEVEL];
271 id = idr_get_empty_slot(idp, starting_id, pa);
274 * Successfully found an empty slot. Install the user
275 * pointer and mark the slot full.
277 rcu_assign_pointer(pa[0]->ary[id & IDR_MASK],
278 (struct idr_layer *)ptr);
280 idr_mark_full(pa, id);
287 * idr_get_new_above - allocate new idr entry above or equal to a start id
289 * @ptr: pointer you want associated with the id
290 * @starting_id: id to start search at
291 * @id: pointer to the allocated handle
293 * This is the allocate id function. It should be called with any
296 * If allocation from IDR's private freelist fails, idr_get_new_above() will
297 * return %-EAGAIN. The caller should retry the idr_pre_get() call to refill
298 * IDR's preallocation and then retry the idr_get_new_above() call.
300 * If the idr is full idr_get_new_above() will return %-ENOSPC.
302 * @id returns a value in the range @starting_id ... %0x7fffffff
304 int idr_get_new_above(struct idr *idp, void *ptr, int starting_id, int *id)
308 rv = idr_get_new_above_int(idp, ptr, starting_id);
310 * This is a cheap hack until the IDR code can be fixed to
311 * return proper error values.
314 return _idr_rc_to_errno(rv);
318 EXPORT_SYMBOL(idr_get_new_above);
321 * idr_get_new - allocate new idr entry
323 * @ptr: pointer you want associated with the id
324 * @id: pointer to the allocated handle
326 * If allocation from IDR's private freelist fails, idr_get_new_above() will
327 * return %-EAGAIN. The caller should retry the idr_pre_get() call to refill
328 * IDR's preallocation and then retry the idr_get_new_above() call.
330 * If the idr is full idr_get_new_above() will return %-ENOSPC.
332 * @id returns a value in the range %0 ... %0x7fffffff
334 int idr_get_new(struct idr *idp, void *ptr, int *id)
338 rv = idr_get_new_above_int(idp, ptr, 0);
340 * This is a cheap hack until the IDR code can be fixed to
341 * return proper error values.
344 return _idr_rc_to_errno(rv);
348 EXPORT_SYMBOL(idr_get_new);
350 static void idr_remove_warning(int id)
353 "idr_remove called for id=%d which is not allocated.\n", id);
357 static void sub_remove(struct idr *idp, int shift, int id)
359 struct idr_layer *p = idp->top;
360 struct idr_layer **pa[MAX_IDR_LEVEL];
361 struct idr_layer ***paa = &pa[0];
362 struct idr_layer *to_free;
368 while ((shift > 0) && p) {
369 n = (id >> shift) & IDR_MASK;
370 __clear_bit(n, &p->bitmap);
376 if (likely(p != NULL && test_bit(n, &p->bitmap))){
377 __clear_bit(n, &p->bitmap);
378 rcu_assign_pointer(p->ary[n], NULL);
380 while(*paa && ! --((**paa)->count)){
391 idr_remove_warning(id);
395 * idr_remove - remove the given id and free its slot
399 void idr_remove(struct idr *idp, int id)
402 struct idr_layer *to_free;
404 /* Mask off upper bits we don't use for the search. */
407 sub_remove(idp, (idp->layers - 1) * IDR_BITS, id);
408 if (idp->top && idp->top->count == 1 && (idp->layers > 1) &&
411 * Single child at leftmost slot: we can shrink the tree.
412 * This level is not needed anymore since when layers are
413 * inserted, they are inserted at the top of the existing
417 p = idp->top->ary[0];
418 rcu_assign_pointer(idp->top, p);
420 to_free->bitmap = to_free->count = 0;
423 while (idp->id_free_cnt >= MAX_IDR_FREE) {
424 p = get_from_free_list(idp);
426 * Note: we don't call the rcu callback here, since the only
427 * layers that fall into the freelist are those that have been
430 kmem_cache_free(idr_layer_cache, p);
434 EXPORT_SYMBOL(idr_remove);
437 * idr_remove_all - remove all ids from the given idr tree
440 void idr_remove_all(struct idr *idp)
445 struct idr_layer *pa[MAX_IDR_LEVEL];
446 struct idr_layer **paa = &pa[0];
448 n = idp->layers * IDR_BITS;
450 rcu_assign_pointer(idp->top, NULL);
455 while (n > IDR_BITS && p) {
458 p = p->ary[(id >> n) & IDR_MASK];
463 /* Get the highest bit that the above add changed from 0->1. */
464 while (n < fls(id ^ bt_mask)) {
473 EXPORT_SYMBOL(idr_remove_all);
476 * idr_destroy - release all cached layers within an idr tree
479 * Free all id mappings and all idp_layers. After this function, @idp is
480 * completely unused and can be freed / recycled. The caller is
481 * responsible for ensuring that no one else accesses @idp during or after
484 * A typical clean-up sequence for objects stored in an idr tree will use
485 * idr_for_each() to free all objects, if necessay, then idr_destroy() to
486 * free up the id mappings and cached idr_layers.
488 void idr_destroy(struct idr *idp)
492 while (idp->id_free_cnt) {
493 struct idr_layer *p = get_from_free_list(idp);
494 kmem_cache_free(idr_layer_cache, p);
497 EXPORT_SYMBOL(idr_destroy);
500 * idr_find - return pointer for given id
504 * Return the pointer given the id it has been registered with. A %NULL
505 * return indicates that @id is not valid or you passed %NULL in
508 * This function can be called under rcu_read_lock(), given that the leaf
509 * pointers lifetimes are correctly managed.
511 void *idr_find(struct idr *idp, int id)
516 p = rcu_dereference_raw(idp->top);
519 n = (p->layer+1) * IDR_BITS;
521 /* Mask off upper bits we don't use for the search. */
530 BUG_ON(n != p->layer*IDR_BITS);
531 p = rcu_dereference_raw(p->ary[(id >> n) & IDR_MASK]);
535 EXPORT_SYMBOL(idr_find);
538 * idr_for_each - iterate through all stored pointers
540 * @fn: function to be called for each pointer
541 * @data: data passed back to callback function
543 * Iterate over the pointers registered with the given idr. The
544 * callback function will be called for each pointer currently
545 * registered, passing the id, the pointer and the data pointer passed
546 * to this function. It is not safe to modify the idr tree while in
547 * the callback, so functions such as idr_get_new and idr_remove are
550 * We check the return of @fn each time. If it returns anything other
551 * than %0, we break out and return that value.
553 * The caller must serialize idr_for_each() vs idr_get_new() and idr_remove().
555 int idr_for_each(struct idr *idp,
556 int (*fn)(int id, void *p, void *data), void *data)
558 int n, id, max, error = 0;
560 struct idr_layer *pa[MAX_IDR_LEVEL];
561 struct idr_layer **paa = &pa[0];
563 n = idp->layers * IDR_BITS;
564 p = rcu_dereference_raw(idp->top);
572 p = rcu_dereference_raw(p->ary[(id >> n) & IDR_MASK]);
576 error = fn(id, (void *)p, data);
582 while (n < fls(id)) {
590 EXPORT_SYMBOL(idr_for_each);
593 * idr_get_next - lookup next object of id to given id.
595 * @nextidp: pointer to lookup key
597 * Returns pointer to registered object with id, which is next number to
598 * given id. After being looked up, *@nextidp will be updated for the next
601 * This function can be called under rcu_read_lock(), given that the leaf
602 * pointers lifetimes are correctly managed.
604 void *idr_get_next(struct idr *idp, int *nextidp)
606 struct idr_layer *p, *pa[MAX_IDR_LEVEL];
607 struct idr_layer **paa = &pa[0];
612 p = rcu_dereference_raw(idp->top);
615 n = (p->layer + 1) * IDR_BITS;
622 p = rcu_dereference_raw(p->ary[(id >> n) & IDR_MASK]);
631 * Proceed to the next layer at the current level. Unlike
632 * idr_for_each(), @id isn't guaranteed to be aligned to
633 * layer boundary at this point and adding 1 << n may
634 * incorrectly skip IDs. Make sure we jump to the
635 * beginning of the next layer using round_up().
637 id = round_up(id + 1, 1 << n);
638 while (n < fls(id)) {
645 EXPORT_SYMBOL(idr_get_next);
649 * idr_replace - replace pointer for given id
651 * @ptr: pointer you want associated with the id
654 * Replace the pointer registered with an id and return the old value.
655 * A %-ENOENT return indicates that @id was not found.
656 * A %-EINVAL return indicates that @id was not within valid constraints.
658 * The caller must serialize with writers.
660 void *idr_replace(struct idr *idp, void *ptr, int id)
663 struct idr_layer *p, *old_p;
667 return ERR_PTR(-EINVAL);
669 n = (p->layer+1) * IDR_BITS;
674 return ERR_PTR(-EINVAL);
677 while ((n > 0) && p) {
678 p = p->ary[(id >> n) & IDR_MASK];
683 if (unlikely(p == NULL || !test_bit(n, &p->bitmap)))
684 return ERR_PTR(-ENOENT);
687 rcu_assign_pointer(p->ary[n], ptr);
691 EXPORT_SYMBOL(idr_replace);
693 void __init idr_init_cache(void)
695 idr_layer_cache = kmem_cache_create("idr_layer_cache",
696 sizeof(struct idr_layer), 0, SLAB_PANIC, NULL);
700 * idr_init - initialize idr handle
703 * This function is use to set up the handle (@idp) that you will pass
704 * to the rest of the functions.
706 void idr_init(struct idr *idp)
708 memset(idp, 0, sizeof(struct idr));
709 spin_lock_init(&idp->lock);
711 EXPORT_SYMBOL(idr_init);
715 * DOC: IDA description
716 * IDA - IDR based ID allocator
718 * This is id allocator without id -> pointer translation. Memory
719 * usage is much lower than full blown idr because each id only
720 * occupies a bit. ida uses a custom leaf node which contains
721 * IDA_BITMAP_BITS slots.
723 * 2007-04-25 written by Tejun Heo <htejun@gmail.com>
726 static void free_bitmap(struct ida *ida, struct ida_bitmap *bitmap)
730 if (!ida->free_bitmap) {
731 spin_lock_irqsave(&ida->idr.lock, flags);
732 if (!ida->free_bitmap) {
733 ida->free_bitmap = bitmap;
736 spin_unlock_irqrestore(&ida->idr.lock, flags);
743 * ida_pre_get - reserve resources for ida allocation
745 * @gfp_mask: memory allocation flag
747 * This function should be called prior to locking and calling the
748 * following function. It preallocates enough memory to satisfy the
749 * worst possible allocation.
751 * If the system is REALLY out of memory this function returns %0,
754 int ida_pre_get(struct ida *ida, gfp_t gfp_mask)
756 /* allocate idr_layers */
757 if (!idr_pre_get(&ida->idr, gfp_mask))
760 /* allocate free_bitmap */
761 if (!ida->free_bitmap) {
762 struct ida_bitmap *bitmap;
764 bitmap = kmalloc(sizeof(struct ida_bitmap), gfp_mask);
768 free_bitmap(ida, bitmap);
773 EXPORT_SYMBOL(ida_pre_get);
776 * ida_get_new_above - allocate new ID above or equal to a start id
778 * @starting_id: id to start search at
779 * @p_id: pointer to the allocated handle
781 * Allocate new ID above or equal to @starting_id. It should be called
782 * with any required locks.
784 * If memory is required, it will return %-EAGAIN, you should unlock
785 * and go back to the ida_pre_get() call. If the ida is full, it will
788 * @p_id returns a value in the range @starting_id ... %0x7fffffff.
790 int ida_get_new_above(struct ida *ida, int starting_id, int *p_id)
792 struct idr_layer *pa[MAX_IDR_LEVEL];
793 struct ida_bitmap *bitmap;
795 int idr_id = starting_id / IDA_BITMAP_BITS;
796 int offset = starting_id % IDA_BITMAP_BITS;
800 /* get vacant slot */
801 t = idr_get_empty_slot(&ida->idr, idr_id, pa);
803 return _idr_rc_to_errno(t);
805 if (t * IDA_BITMAP_BITS >= MAX_IDR_BIT)
812 /* if bitmap isn't there, create a new one */
813 bitmap = (void *)pa[0]->ary[idr_id & IDR_MASK];
815 spin_lock_irqsave(&ida->idr.lock, flags);
816 bitmap = ida->free_bitmap;
817 ida->free_bitmap = NULL;
818 spin_unlock_irqrestore(&ida->idr.lock, flags);
823 memset(bitmap, 0, sizeof(struct ida_bitmap));
824 rcu_assign_pointer(pa[0]->ary[idr_id & IDR_MASK],
829 /* lookup for empty slot */
830 t = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, offset);
831 if (t == IDA_BITMAP_BITS) {
832 /* no empty slot after offset, continue to the next chunk */
838 id = idr_id * IDA_BITMAP_BITS + t;
839 if (id >= MAX_IDR_BIT)
842 __set_bit(t, bitmap->bitmap);
843 if (++bitmap->nr_busy == IDA_BITMAP_BITS)
844 idr_mark_full(pa, idr_id);
848 /* Each leaf node can handle nearly a thousand slots and the
849 * whole idea of ida is to have small memory foot print.
850 * Throw away extra resources one by one after each successful
853 if (ida->idr.id_free_cnt || ida->free_bitmap) {
854 struct idr_layer *p = get_from_free_list(&ida->idr);
856 kmem_cache_free(idr_layer_cache, p);
861 EXPORT_SYMBOL(ida_get_new_above);
864 * ida_get_new - allocate new ID
866 * @p_id: pointer to the allocated handle
868 * Allocate new ID. It should be called with any required locks.
870 * If memory is required, it will return %-EAGAIN, you should unlock
871 * and go back to the idr_pre_get() call. If the idr is full, it will
874 * @p_id returns a value in the range %0 ... %0x7fffffff.
876 int ida_get_new(struct ida *ida, int *p_id)
878 return ida_get_new_above(ida, 0, p_id);
880 EXPORT_SYMBOL(ida_get_new);
883 * ida_remove - remove the given ID
887 void ida_remove(struct ida *ida, int id)
889 struct idr_layer *p = ida->idr.top;
890 int shift = (ida->idr.layers - 1) * IDR_BITS;
891 int idr_id = id / IDA_BITMAP_BITS;
892 int offset = id % IDA_BITMAP_BITS;
894 struct ida_bitmap *bitmap;
896 /* clear full bits while looking up the leaf idr_layer */
897 while ((shift > 0) && p) {
898 n = (idr_id >> shift) & IDR_MASK;
899 __clear_bit(n, &p->bitmap);
907 n = idr_id & IDR_MASK;
908 __clear_bit(n, &p->bitmap);
910 bitmap = (void *)p->ary[n];
911 if (!test_bit(offset, bitmap->bitmap))
914 /* update bitmap and remove it if empty */
915 __clear_bit(offset, bitmap->bitmap);
916 if (--bitmap->nr_busy == 0) {
917 __set_bit(n, &p->bitmap); /* to please idr_remove() */
918 idr_remove(&ida->idr, idr_id);
919 free_bitmap(ida, bitmap);
926 "ida_remove called for id=%d which is not allocated.\n", id);
928 EXPORT_SYMBOL(ida_remove);
931 * ida_destroy - release all cached layers within an ida tree
934 void ida_destroy(struct ida *ida)
936 idr_destroy(&ida->idr);
937 kfree(ida->free_bitmap);
939 EXPORT_SYMBOL(ida_destroy);
942 * ida_simple_get - get a new id.
943 * @ida: the (initialized) ida.
944 * @start: the minimum id (inclusive, < 0x8000000)
945 * @end: the maximum id (exclusive, < 0x8000000 or 0)
946 * @gfp_mask: memory allocation flags
948 * Allocates an id in the range start <= id < end, or returns -ENOSPC.
949 * On memory allocation failure, returns -ENOMEM.
951 * Use ida_simple_remove() to get rid of an id.
953 int ida_simple_get(struct ida *ida, unsigned int start, unsigned int end,
960 BUG_ON((int)start < 0);
961 BUG_ON((int)end < 0);
971 if (!ida_pre_get(ida, gfp_mask))
974 spin_lock_irqsave(&simple_ida_lock, flags);
975 ret = ida_get_new_above(ida, start, &id);
984 spin_unlock_irqrestore(&simple_ida_lock, flags);
986 if (unlikely(ret == -EAGAIN))
991 EXPORT_SYMBOL(ida_simple_get);
994 * ida_simple_remove - remove an allocated id.
995 * @ida: the (initialized) ida.
996 * @id: the id returned by ida_simple_get.
998 void ida_simple_remove(struct ida *ida, unsigned int id)
1000 unsigned long flags;
1002 BUG_ON((int)id < 0);
1003 spin_lock_irqsave(&simple_ida_lock, flags);
1004 ida_remove(ida, id);
1005 spin_unlock_irqrestore(&simple_ida_lock, flags);
1007 EXPORT_SYMBOL(ida_simple_remove);
1010 * ida_init - initialize ida handle
1013 * This function is use to set up the handle (@ida) that you will pass
1014 * to the rest of the functions.
1016 void ida_init(struct ida *ida)
1018 memset(ida, 0, sizeof(struct ida));
1019 idr_init(&ida->idr);
1022 EXPORT_SYMBOL(ida_init);