35 #define	__bitset_mask(_s, n)						\  argument
36 	(1L << ((__bitset_words((_s)) == 1) ?				\
39 #define	__bitset_word(_s, n)						\  argument
40 	((__bitset_words((_s)) == 1) ? 0 : ((n) / _BITSET_BITS))
42 #define	BIT_CLR(_s, n, p)						\  argument
43 	((p)->__bits[__bitset_word(_s, n)] &= ~__bitset_mask((_s), (n)))
45 #define	BIT_COPY(_s, f, t)	(void)(*(t) = *(f))  argument
47 #define	BIT_ISSET(_s, n, p)						\  argument
48 	((((p)->__bits[__bitset_word(_s, n)] & __bitset_mask((_s), (n))) != 0))
50 #define	BIT_SET(_s, n, p)						\  argument
51 	((p)->__bits[__bitset_word(_s, n)] |= __bitset_mask((_s), (n)))
53 #define	BIT_ZERO(_s, p) do {						\  argument
55 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
59 #define	BIT_FILL(_s, p) do {						\  argument
61 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
65 #define	BIT_SETOF(_s, n, p) do {					\  argument
66 	BIT_ZERO(_s, p);						\
67 	(p)->__bits[__bitset_word(_s, n)] = __bitset_mask((_s), (n));	\
71 #define	BIT_EMPTY(_s, p) __extension__ ({				\  argument
73 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
76 	__i == __bitset_words((_s));					\
80 #define	BIT_ISFULLSET(_s, p) __extension__ ({				\  argument
82 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
85 	__i == __bitset_words((_s));					\
89 #define	BIT_SUBSET(_s, p, c) __extension__ ({				\  argument
91 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
96 	__i == __bitset_words((_s));					\
100 #define	BIT_OVERLAP(_s, p, c) __extension__ ({				\  argument
102 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
106 	__i != __bitset_words((_s));					\
110 #define	BIT_CMP(_s, p, c) __extension__ ({				\  argument
112 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
116 	__i != __bitset_words((_s));					\
119 #define	BIT_OR(_s, d, s) do {						\  argument
121 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
125 #define	BIT_AND(_s, d, s) do {						\  argument
127 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
131 #define	BIT_NAND(_s, d, s) do {						\  argument
133 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
137 #define	BIT_CLR_ATOMIC(_s, n, p)					\  argument
138 	atomic_clear_long(&(p)->__bits[__bitset_word(_s, n)],		\
139 	    __bitset_mask((_s), n))
141 #define	BIT_SET_ATOMIC(_s, n, p)					\  argument
142 	atomic_set_long(&(p)->__bits[__bitset_word(_s, n)],		\
143 	    __bitset_mask((_s), n))
145 #define	BIT_SET_ATOMIC_ACQ(_s, n, p)					\  argument
146 	atomic_set_acq_long(&(p)->__bits[__bitset_word(_s, n)],		\
147 	    __bitset_mask((_s), n))
150 #define	BIT_AND_ATOMIC(_s, d, s) do {					\  argument
152 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
157 #define	BIT_OR_ATOMIC(_s, d, s) do {					\  argument
159 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
164 #define	BIT_COPY_STORE_REL(_s, f, t) do {				\  argument
166 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
171 #define	BIT_FFS(_s, p) __extension__ ({					\  argument
176 	for (__i = 0; __i < __bitset_words((_s)); __i++) {		\
186 #define	BIT_COUNT(_s, p) __extension__ ({				\  argument
191 	for (__i = 0; __i < __bitset_words((_s)); __i++)		\
205 #define BITSET_ALLOC(_s, mt, mf)					\  argument
206 	malloc(__bitset_words(_s) * sizeof(long), mt, (mf))