1 /* 2 * Copyright (c) 2013-2016 François Tigeot 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice unmodified, this list of conditions, and the following 10 * disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25 */ 26 27 #ifndef _LINUX_IDR_H_ 28 #define _LINUX_IDR_H_ 29 30 #include <sys/idr.h> 31 32 #ifdef MALLOC_DECLARE 33 MALLOC_DECLARE(M_IDR); 34 #endif 35 36 #define IDA_CHUNK_SIZE 128 /* 128 bytes per chunk */ 37 #define IDA_BITMAP_LONGS (IDA_CHUNK_SIZE / sizeof(long) - 1) 38 #define IDA_BITMAP_BITS (IDA_BITMAP_LONGS * sizeof(long) * 8) 39 40 struct ida_bitmap { 41 long nr_busy; 42 unsigned long bitmap[IDA_BITMAP_LONGS]; 43 }; 44 45 struct ida { 46 struct idr idr; 47 struct ida_bitmap *free_bitmap; 48 }; 49 50 static inline void 51 ida_init(struct ida *ida) 52 { 53 idr_init(&ida->idr); 54 } 55 56 static inline void 57 ida_simple_remove(struct ida *ida, unsigned int id) 58 { 59 idr_remove(&ida->idr, id); 60 } 61 62 static inline void 63 ida_remove(struct ida *ida, int id) 64 { 65 idr_remove(&ida->idr, id); 66 } 67 68 void ida_destroy(struct ida *ida); 69 70 static inline int 71 ida_simple_get(struct ida *ida, unsigned int start, unsigned int end, gfp_t gfp_mask) 72 { 73 int id; 74 unsigned int lim; 75 76 if ((end == 0) || (end > 0x80000000)) 77 lim = 0x80000000; 78 else 79 lim = end - 1; 80 81 idr_preload(gfp_mask); 82 id = idr_alloc(&ida->idr, NULL, start, lim, gfp_mask); 83 idr_preload_end(); 84 85 return id; 86 } 87 88 static inline void * 89 idr_get_next(struct idr *idp, int *nextid) 90 { 91 void *res = NULL; 92 93 lwkt_gettoken(&idp->idr_token); 94 95 for (int id = *nextid; id < idp->idr_count; id++) { 96 res = idr_find(idp, id); 97 if (res == NULL) 98 continue; 99 *nextid = id; 100 break; 101 } 102 103 lwkt_reltoken(&idp->idr_token); 104 return res; 105 } 106 107 #define idr_for_each_entry(idp, entry, id) \ 108 for (id = 0; ((entry) = idr_get_next(idp, &(id))) != NULL; ++id) 109 110 #endif /* _LINUX_IDR_H_ */ 111