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 #ifndef GFP_KERNEL 33 #include <sys/malloc.h> 34 #define GFP_KERNEL M_WAITOK 35 #endif 36 37 #ifdef MALLOC_DECLARE 38 MALLOC_DECLARE(M_IDR); 39 #endif 40 41 #define IDA_CHUNK_SIZE 128 /* 128 bytes per chunk */ 42 #define IDA_BITMAP_LONGS (IDA_CHUNK_SIZE / sizeof(long) - 1) 43 #define IDA_BITMAP_BITS (IDA_BITMAP_LONGS * sizeof(long) * 8) 44 45 struct ida_bitmap { 46 long nr_busy; 47 unsigned long bitmap[IDA_BITMAP_LONGS]; 48 }; 49 50 struct ida { 51 struct idr idr; 52 struct ida_bitmap *free_bitmap; 53 }; 54 55 static inline void 56 ida_init(struct ida *ida) 57 { 58 idr_init(&ida->idr); 59 } 60 61 static inline void 62 ida_simple_remove(struct ida *ida, unsigned int id) 63 { 64 idr_remove(&ida->idr, id); 65 } 66 67 static inline void 68 ida_remove(struct ida *ida, int id) 69 { 70 idr_remove(&ida->idr, id); 71 } 72 73 static inline void 74 ida_destroy(struct ida *ida) 75 { 76 idr_destroy(&ida->idr); 77 if (ida->free_bitmap != NULL) { 78 /* kfree() is a linux macro! Work around the cpp pass */ 79 (kfree)(ida->free_bitmap, M_IDR); 80 } 81 } 82 83 static inline int 84 ida_simple_get(struct ida *ida, unsigned int start, unsigned int end, gfp_t gfp_mask) 85 { 86 int id; 87 unsigned int lim; 88 89 if ((end == 0) || (end > 0x80000000)) 90 lim = 0x80000000; 91 else 92 lim = end - 1; 93 94 idr_preload(gfp_mask); 95 id = idr_alloc(&ida->idr, NULL, start, lim, gfp_mask); 96 idr_preload_end(); 97 98 return id; 99 } 100 101 static inline void * 102 idr_get_next(struct idr *idp, int *nextid) 103 { 104 void *res = NULL; 105 106 lwkt_gettoken(&idp->idr_token); 107 108 for (int id = *nextid; id < idp->idr_count; id++) { 109 res = idr_find(idp, id); 110 if (res == NULL) 111 continue; 112 *nextid = id; 113 break; 114 } 115 116 lwkt_reltoken(&idp->idr_token); 117 return res; 118 } 119 120 #define idr_for_each_entry(idp, entry, id) \ 121 for (id = 0; ((entry) = idr_get_next(idp, &(id))) != NULL; ++id) 122 123 #endif /* _LINUX_IDR_H_ */ 124