2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2008, Jeffrey Roberson <jeff@freebsd.org>
7 * Copyright (c) 2008 Nokia Corporation
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice unmodified, this list of conditions, and the following
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 #ifndef _SYS_BITSET_H_
35 #define _SYS_BITSET_H_
37 #define __bitset_mask(_s, n) \
38 (1UL << ((__bitset_words((_s)) == 1) ? \
39 (__size_t)(n) : ((n) % _BITSET_BITS)))
41 #define __bitset_word(_s, n) \
42 ((__bitset_words((_s)) == 1) ? 0 : ((n) / _BITSET_BITS))
44 #define BIT_CLR(_s, n, p) \
45 ((p)->__bits[__bitset_word(_s, n)] &= ~__bitset_mask((_s), (n)))
47 #define BIT_COPY(_s, f, t) (void)(*(t) = *(f))
49 #define BIT_ISSET(_s, n, p) \
50 ((((p)->__bits[__bitset_word(_s, n)] & __bitset_mask((_s), (n))) != 0))
52 #define BIT_SET(_s, n, p) \
53 ((p)->__bits[__bitset_word(_s, n)] |= __bitset_mask((_s), (n)))
55 #define BIT_ZERO(_s, p) do { \
57 for (__i = 0; __i < __bitset_words((_s)); __i++) \
58 (p)->__bits[__i] = 0L; \
61 #define BIT_FILL(_s, p) do { \
63 for (__i = 0; __i < __bitset_words((_s)); __i++) \
64 (p)->__bits[__i] = -1L; \
67 #define BIT_SETOF(_s, n, p) do { \
69 (p)->__bits[__bitset_word(_s, n)] = __bitset_mask((_s), (n)); \
73 #define BIT_EMPTY(_s, p) __extension__ ({ \
75 for (__i = 0; __i < __bitset_words((_s)); __i++) \
76 if ((p)->__bits[__i]) \
78 __i == __bitset_words((_s)); \
82 #define BIT_ISFULLSET(_s, p) __extension__ ({ \
84 for (__i = 0; __i < __bitset_words((_s)); __i++) \
85 if ((p)->__bits[__i] != (long)-1) \
87 __i == __bitset_words((_s)); \
90 /* Is c a subset of p. */
91 #define BIT_SUBSET(_s, p, c) __extension__ ({ \
93 for (__i = 0; __i < __bitset_words((_s)); __i++) \
94 if (((c)->__bits[__i] & \
95 (p)->__bits[__i]) != \
98 __i == __bitset_words((_s)); \
101 /* Are there any common bits between b & c? */
102 #define BIT_OVERLAP(_s, p, c) __extension__ ({ \
104 for (__i = 0; __i < __bitset_words((_s)); __i++) \
105 if (((c)->__bits[__i] & \
106 (p)->__bits[__i]) != 0) \
108 __i != __bitset_words((_s)); \
111 /* Compare two sets, returns 0 if equal 1 otherwise. */
112 #define BIT_CMP(_s, p, c) __extension__ ({ \
114 for (__i = 0; __i < __bitset_words((_s)); __i++) \
115 if (((c)->__bits[__i] != \
118 __i != __bitset_words((_s)); \
121 #define BIT_OR(_s, d, s) do { \
123 for (__i = 0; __i < __bitset_words((_s)); __i++) \
124 (d)->__bits[__i] |= (s)->__bits[__i]; \
127 #define BIT_OR2(_s, d, s1, s2) do { \
129 for (__i = 0; __i < __bitset_words((_s)); __i++) \
130 (d)->__bits[__i] = (s1)->__bits[__i] | (s2)->__bits[__i];\
133 #define BIT_AND(_s, d, s) do { \
135 for (__i = 0; __i < __bitset_words((_s)); __i++) \
136 (d)->__bits[__i] &= (s)->__bits[__i]; \
139 #define BIT_AND2(_s, d, s1, s2) do { \
141 for (__i = 0; __i < __bitset_words((_s)); __i++) \
142 (d)->__bits[__i] = (s1)->__bits[__i] & (s2)->__bits[__i];\
145 #define BIT_NAND(_s, d, s) do { \
147 for (__i = 0; __i < __bitset_words((_s)); __i++) \
148 (d)->__bits[__i] &= ~(s)->__bits[__i]; \
151 #define BIT_NAND2(_s, d, s1, s2) do { \
153 for (__i = 0; __i < __bitset_words((_s)); __i++) \
154 (d)->__bits[__i] = (s1)->__bits[__i] & ~(s2)->__bits[__i];\
157 #define BIT_XOR(_s, d, s) do { \
159 for (__i = 0; __i < __bitset_words((_s)); __i++) \
160 (d)->__bits[__i] ^= (s)->__bits[__i]; \
163 #define BIT_XOR2(_s, d, s1, s2) do { \
165 for (__i = 0; __i < __bitset_words((_s)); __i++) \
166 (d)->__bits[__i] = (s1)->__bits[__i] ^ (s2)->__bits[__i];\
169 #define BIT_CLR_ATOMIC(_s, n, p) \
170 atomic_clear_long(&(p)->__bits[__bitset_word(_s, n)], \
171 __bitset_mask((_s), n))
173 #define BIT_SET_ATOMIC(_s, n, p) \
174 atomic_set_long(&(p)->__bits[__bitset_word(_s, n)], \
175 __bitset_mask((_s), n))
177 #define BIT_SET_ATOMIC_ACQ(_s, n, p) \
178 atomic_set_acq_long(&(p)->__bits[__bitset_word(_s, n)], \
179 __bitset_mask((_s), n))
181 /* Convenience functions catering special cases. */
182 #define BIT_AND_ATOMIC(_s, d, s) do { \
184 for (__i = 0; __i < __bitset_words((_s)); __i++) \
185 atomic_clear_long(&(d)->__bits[__i], \
186 ~(s)->__bits[__i]); \
189 #define BIT_OR_ATOMIC(_s, d, s) do { \
191 for (__i = 0; __i < __bitset_words((_s)); __i++) \
192 atomic_set_long(&(d)->__bits[__i], \
196 #define BIT_COPY_STORE_REL(_s, f, t) do { \
198 for (__i = 0; __i < __bitset_words((_s)); __i++) \
199 atomic_store_rel_long(&(t)->__bits[__i], \
203 #define BIT_FFS(_s, p) __extension__ ({ \
208 for (__i = 0; __i < __bitset_words((_s)); __i++) { \
209 if ((p)->__bits[__i] != 0) { \
210 __bit = ffsl((p)->__bits[__i]); \
211 __bit += __i * _BITSET_BITS; \
218 #define BIT_FLS(_s, p) __extension__ ({ \
223 for (__i = __bitset_words((_s)); __i > 0; __i--) { \
224 if ((p)->__bits[__i - 1] != 0) { \
225 __bit = flsl((p)->__bits[__i - 1]); \
226 __bit += (__i - 1) * _BITSET_BITS; \
233 #define BIT_COUNT(_s, p) __extension__ ({ \
238 for (__i = 0; __i < __bitset_words((_s)); __i++) \
239 __count += __bitcountl((p)->__bits[__i]); \
243 #define BITSET_T_INITIALIZER(x) \
246 #define BITSET_FSET(n) \
247 [ 0 ... ((n) - 1) ] = (-1L)
250 * Dynamically allocate a bitset.
252 #define BITSET_ALLOC(_s, mt, mf) \
253 malloc(__bitset_words(_s) * sizeof(long), mt, (mf))
255 #endif /* !_SYS_BITSET_H_ */