| 1 | /*- |
|---|
| 2 | * Copyright (c) 2008, Jeffrey Roberson <jeff@freebsd.org> |
|---|
| 3 | * All rights reserved. |
|---|
| 4 | * |
|---|
| 5 | * Copyright (c) 2008 Nokia Corporation |
|---|
| 6 | * All rights reserved. |
|---|
| 7 | * |
|---|
| 8 | * Redistribution and use in source and binary forms, with or without |
|---|
| 9 | * modification, are permitted provided that the following conditions |
|---|
| 10 | * are met: |
|---|
| 11 | * 1. Redistributions of source code must retain the above copyright |
|---|
| 12 | * notice unmodified, this list of conditions, and the following |
|---|
| 13 | * disclaimer. |
|---|
| 14 | * 2. Redistributions in binary form must reproduce the above copyright |
|---|
| 15 | * notice, this list of conditions and the following disclaimer in the |
|---|
| 16 | * documentation and/or other materials provided with the distribution. |
|---|
| 17 | * |
|---|
| 18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|---|
| 19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
|---|
| 20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
|---|
| 21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
|---|
| 22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
|---|
| 23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|---|
| 24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|---|
| 25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|---|
| 26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
|---|
| 27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|---|
| 28 | * |
|---|
| 29 | * $FreeBSD: head/sys/sys/bitset.h 320893 2017-07-11 12:35:44Z kib $ |
|---|
| 30 | */ |
|---|
| 31 | |
|---|
| 32 | #ifndef _SYS_BITSET_H_ |
|---|
| 33 | #define _SYS_BITSET_H_ |
|---|
| 34 | |
|---|
| 35 | #include <sys/_types.h> |
|---|
| 36 | #include <machine/_bitcount.h> |
|---|
| 37 | |
|---|
| 38 | #define __bitset_mask(_s, n) \ |
|---|
| 39 | (1L << ((__bitset_words((_s)) == 1) ? \ |
|---|
| 40 | (__size_t)(n) : ((n) % _BITSET_BITS))) |
|---|
| 41 | |
|---|
| 42 | #define __bitset_word(_s, n) \ |
|---|
| 43 | ((__bitset_words((_s)) == 1) ? 0 : ((n) / _BITSET_BITS)) |
|---|
| 44 | |
|---|
| 45 | #define BIT_CLR(_s, n, p) \ |
|---|
| 46 | ((p)->__bits[__bitset_word(_s, n)] &= ~__bitset_mask((_s), (n))) |
|---|
| 47 | |
|---|
| 48 | #define BIT_COPY(_s, f, t) (void)(*(t) = *(f)) |
|---|
| 49 | |
|---|
| 50 | #define BIT_ISSET(_s, n, p) \ |
|---|
| 51 | ((((p)->__bits[__bitset_word(_s, n)] & __bitset_mask((_s), (n))) != 0)) |
|---|
| 52 | |
|---|
| 53 | #define BIT_SET(_s, n, p) \ |
|---|
| 54 | ((p)->__bits[__bitset_word(_s, n)] |= __bitset_mask((_s), (n))) |
|---|
| 55 | |
|---|
| 56 | #define BIT_ZERO(_s, p) do { \ |
|---|
| 57 | __size_t __i; \ |
|---|
| 58 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 59 | (p)->__bits[__i] = 0L; \ |
|---|
| 60 | } while (0) |
|---|
| 61 | |
|---|
| 62 | #define BIT_FILL(_s, p) do { \ |
|---|
| 63 | __size_t __i; \ |
|---|
| 64 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 65 | (p)->__bits[__i] = -1L; \ |
|---|
| 66 | } while (0) |
|---|
| 67 | |
|---|
| 68 | #define BIT_SETOF(_s, n, p) do { \ |
|---|
| 69 | BIT_ZERO(_s, p); \ |
|---|
| 70 | (p)->__bits[__bitset_word(_s, n)] = __bitset_mask((_s), (n)); \ |
|---|
| 71 | } while (0) |
|---|
| 72 | |
|---|
| 73 | /* Is p empty. */ |
|---|
| 74 | #define BIT_EMPTY(_s, p) __extension__ ({ \ |
|---|
| 75 | __size_t __i; \ |
|---|
| 76 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 77 | if ((p)->__bits[__i]) \ |
|---|
| 78 | break; \ |
|---|
| 79 | __i == __bitset_words((_s)); \ |
|---|
| 80 | }) |
|---|
| 81 | |
|---|
| 82 | /* Is p full set. */ |
|---|
| 83 | #define BIT_ISFULLSET(_s, p) __extension__ ({ \ |
|---|
| 84 | __size_t __i; \ |
|---|
| 85 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 86 | if ((p)->__bits[__i] != (long)-1) \ |
|---|
| 87 | break; \ |
|---|
| 88 | __i == __bitset_words((_s)); \ |
|---|
| 89 | }) |
|---|
| 90 | |
|---|
| 91 | /* Is c a subset of p. */ |
|---|
| 92 | #define BIT_SUBSET(_s, p, c) __extension__ ({ \ |
|---|
| 93 | __size_t __i; \ |
|---|
| 94 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 95 | if (((c)->__bits[__i] & \ |
|---|
| 96 | (p)->__bits[__i]) != \ |
|---|
| 97 | (c)->__bits[__i]) \ |
|---|
| 98 | break; \ |
|---|
| 99 | __i == __bitset_words((_s)); \ |
|---|
| 100 | }) |
|---|
| 101 | |
|---|
| 102 | /* Are there any common bits between b & c? */ |
|---|
| 103 | #define BIT_OVERLAP(_s, p, c) __extension__ ({ \ |
|---|
| 104 | __size_t __i; \ |
|---|
| 105 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 106 | if (((c)->__bits[__i] & \ |
|---|
| 107 | (p)->__bits[__i]) != 0) \ |
|---|
| 108 | break; \ |
|---|
| 109 | __i != __bitset_words((_s)); \ |
|---|
| 110 | }) |
|---|
| 111 | |
|---|
| 112 | /* Compare two sets, returns 0 if equal 1 otherwise. */ |
|---|
| 113 | #define BIT_CMP(_s, p, c) __extension__ ({ \ |
|---|
| 114 | __size_t __i; \ |
|---|
| 115 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 116 | if (((c)->__bits[__i] != \ |
|---|
| 117 | (p)->__bits[__i])) \ |
|---|
| 118 | break; \ |
|---|
| 119 | __i != __bitset_words((_s)); \ |
|---|
| 120 | }) |
|---|
| 121 | |
|---|
| 122 | #define BIT_OR(_s, d, s) do { \ |
|---|
| 123 | __size_t __i; \ |
|---|
| 124 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 125 | (d)->__bits[__i] |= (s)->__bits[__i]; \ |
|---|
| 126 | } while (0) |
|---|
| 127 | |
|---|
| 128 | #define BIT_OR2(_s, d, s1, s2) do { \ |
|---|
| 129 | __size_t __i; \ |
|---|
| 130 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 131 | (d)->__bits[__i] = (s1)->__bits[__i] | (s2)->__bits[__i];\ |
|---|
| 132 | } while (0) |
|---|
| 133 | |
|---|
| 134 | #define BIT_AND(_s, d, s) do { \ |
|---|
| 135 | __size_t __i; \ |
|---|
| 136 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 137 | (d)->__bits[__i] &= (s)->__bits[__i]; \ |
|---|
| 138 | } while (0) |
|---|
| 139 | |
|---|
| 140 | #define BIT_AND2(_s, d, s1, s2) do { \ |
|---|
| 141 | __size_t __i; \ |
|---|
| 142 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 143 | (d)->__bits[__i] = (s1)->__bits[__i] & (s2)->__bits[__i];\ |
|---|
| 144 | } while (0) |
|---|
| 145 | |
|---|
| 146 | #define BIT_NAND(_s, d, s) do { \ |
|---|
| 147 | __size_t __i; \ |
|---|
| 148 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 149 | (d)->__bits[__i] &= ~(s)->__bits[__i]; \ |
|---|
| 150 | } while (0) |
|---|
| 151 | |
|---|
| 152 | #define BIT_NAND2(_s, d, s1, s2) do { \ |
|---|
| 153 | __size_t __i; \ |
|---|
| 154 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 155 | (d)->__bits[__i] = (s1)->__bits[__i] & ~(s2)->__bits[__i];\ |
|---|
| 156 | } while (0) |
|---|
| 157 | |
|---|
| 158 | #define BIT_XOR(_s, d, s) do { \ |
|---|
| 159 | __size_t __i; \ |
|---|
| 160 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 161 | (d)->__bits[__i] ^= (s)->__bits[__i]; \ |
|---|
| 162 | } while (0) |
|---|
| 163 | |
|---|
| 164 | #define BIT_XOR2(_s, d, s1, s2) do { \ |
|---|
| 165 | __size_t __i; \ |
|---|
| 166 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 167 | (d)->__bits[__i] = (s1)->__bits[__i] ^ (s2)->__bits[__i];\ |
|---|
| 168 | } while (0) |
|---|
| 169 | |
|---|
| 170 | #define BIT_CLR_ATOMIC(_s, n, p) \ |
|---|
| 171 | atomic_clear_long(&(p)->__bits[__bitset_word(_s, n)], \ |
|---|
| 172 | __bitset_mask((_s), n)) |
|---|
| 173 | |
|---|
| 174 | #define BIT_SET_ATOMIC(_s, n, p) \ |
|---|
| 175 | atomic_set_long(&(p)->__bits[__bitset_word(_s, n)], \ |
|---|
| 176 | __bitset_mask((_s), n)) |
|---|
| 177 | |
|---|
| 178 | #define BIT_SET_ATOMIC_ACQ(_s, n, p) \ |
|---|
| 179 | atomic_set_acq_long(&(p)->__bits[__bitset_word(_s, n)], \ |
|---|
| 180 | __bitset_mask((_s), n)) |
|---|
| 181 | |
|---|
| 182 | /* Convenience functions catering special cases. */ |
|---|
| 183 | #define BIT_AND_ATOMIC(_s, d, s) do { \ |
|---|
| 184 | __size_t __i; \ |
|---|
| 185 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 186 | atomic_clear_long(&(d)->__bits[__i], \ |
|---|
| 187 | ~(s)->__bits[__i]); \ |
|---|
| 188 | } while (0) |
|---|
| 189 | |
|---|
| 190 | #define BIT_OR_ATOMIC(_s, d, s) do { \ |
|---|
| 191 | __size_t __i; \ |
|---|
| 192 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 193 | atomic_set_long(&(d)->__bits[__i], \ |
|---|
| 194 | (s)->__bits[__i]); \ |
|---|
| 195 | } while (0) |
|---|
| 196 | |
|---|
| 197 | #define BIT_COPY_STORE_REL(_s, f, t) do { \ |
|---|
| 198 | __size_t __i; \ |
|---|
| 199 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 200 | atomic_store_rel_long(&(t)->__bits[__i], \ |
|---|
| 201 | (f)->__bits[__i]); \ |
|---|
| 202 | } while (0) |
|---|
| 203 | |
|---|
| 204 | #define BIT_FFS(_s, p) __extension__ ({ \ |
|---|
| 205 | __size_t __i; \ |
|---|
| 206 | int __bit; \ |
|---|
| 207 | \ |
|---|
| 208 | __bit = 0; \ |
|---|
| 209 | for (__i = 0; __i < __bitset_words((_s)); __i++) { \ |
|---|
| 210 | if ((p)->__bits[__i] != 0) { \ |
|---|
| 211 | __bit = ffsl((p)->__bits[__i]); \ |
|---|
| 212 | __bit += __i * _BITSET_BITS; \ |
|---|
| 213 | break; \ |
|---|
| 214 | } \ |
|---|
| 215 | } \ |
|---|
| 216 | __bit; \ |
|---|
| 217 | }) |
|---|
| 218 | |
|---|
| 219 | #define BIT_FLS(_s, p) __extension__ ({ \ |
|---|
| 220 | __size_t __i; \ |
|---|
| 221 | int __bit; \ |
|---|
| 222 | \ |
|---|
| 223 | __bit = 0; \ |
|---|
| 224 | for (__i = __bitset_words((_s)); __i > 0; __i--) { \ |
|---|
| 225 | if ((p)->__bits[__i - 1] != 0) { \ |
|---|
| 226 | __bit = flsl((p)->__bits[__i - 1]); \ |
|---|
| 227 | __bit += (__i - 1) * _BITSET_BITS; \ |
|---|
| 228 | break; \ |
|---|
| 229 | } \ |
|---|
| 230 | } \ |
|---|
| 231 | __bit; \ |
|---|
| 232 | }) |
|---|
| 233 | |
|---|
| 234 | #define BIT_COUNT(_s, p) __extension__ ({ \ |
|---|
| 235 | __size_t __i; \ |
|---|
| 236 | int __count; \ |
|---|
| 237 | \ |
|---|
| 238 | __count = 0; \ |
|---|
| 239 | for (__i = 0; __i < __bitset_words((_s)); __i++) \ |
|---|
| 240 | __count += __bitcountl((p)->__bits[__i]); \ |
|---|
| 241 | __count; \ |
|---|
| 242 | }) |
|---|
| 243 | |
|---|
| 244 | #define BITSET_T_INITIALIZER(x) \ |
|---|
| 245 | { .__bits = { x } } |
|---|
| 246 | |
|---|
| 247 | #define BITSET_FSET(n) \ |
|---|
| 248 | [ 0 ... ((n) - 1) ] = (-1L) |
|---|
| 249 | |
|---|
| 250 | /* |
|---|
| 251 | * Dynamically allocate a bitset. |
|---|
| 252 | */ |
|---|
| 253 | #define BITSET_ALLOC(_s, mt, mf) \ |
|---|
| 254 | malloc(__bitset_words(_s) * sizeof(long), mt, (mf)) |
|---|
| 255 | |
|---|
| 256 | #endif /* !_SYS_BITSET_H_ */ |
|---|
