Lines Matching refs:_s
43 #define __bitset_mask(_s, n) \ argument
44 (1UL << (__constexpr_cond(__bitset_words((_s)) == 1) ? \
47 #define __bitset_word(_s, n) \ argument
48 (__constexpr_cond(__bitset_words((_s)) == 1) ? \
51 #define BIT_CLR(_s, n, p) \ argument
52 ((p)->__bits[__bitset_word(_s, n)] &= ~__bitset_mask((_s), (n)))
54 #define BIT_COPY(_s, f, t) (void)(*(t) = *(f)) argument
56 #define BIT_ISSET(_s, n, p) \ argument
57 ((((p)->__bits[__bitset_word(_s, n)] & __bitset_mask((_s), (n))) != 0))
59 #define BIT_SET(_s, n, p) \ argument
60 ((p)->__bits[__bitset_word(_s, n)] |= __bitset_mask((_s), (n)))
62 #define BIT_ZERO(_s, p) do { \ argument
64 for (__i = 0; __i < __bitset_words((_s)); __i++) \
68 #define BIT_FILL(_s, p) do { \ argument
70 for (__i = 0; __i < __bitset_words((_s)); __i++) \
74 #define BIT_SETOF(_s, n, p) do { \ argument
75 BIT_ZERO(_s, p); \
76 (p)->__bits[__bitset_word(_s, n)] = __bitset_mask((_s), (n)); \
80 #define BIT_EMPTY(_s, p) __extension__ ({ \ argument
82 for (__i = 0; __i < __bitset_words((_s)); __i++) \
85 __i == __bitset_words((_s)); \
89 #define BIT_ISFULLSET(_s, p) __extension__ ({ \ argument
91 for (__i = 0; __i < __bitset_words((_s)); __i++) \
94 __i == __bitset_words((_s)); \
98 #define BIT_SUBSET(_s, p, c) __extension__ ({ \ argument
100 for (__i = 0; __i < __bitset_words((_s)); __i++) \
105 __i == __bitset_words((_s)); \
109 #define BIT_OVERLAP(_s, p, c) __extension__ ({ \ argument
111 for (__i = 0; __i < __bitset_words((_s)); __i++) \
115 __i != __bitset_words((_s)); \
119 #define BIT_CMP(_s, p, c) __extension__ ({ \ argument
121 for (__i = 0; __i < __bitset_words((_s)); __i++) \
125 __i != __bitset_words((_s)); \
128 #define BIT_OR(_s, d, s) do { \ argument
130 for (__i = 0; __i < __bitset_words((_s)); __i++) \
134 #define BIT_OR2(_s, d, s1, s2) do { \ argument
136 for (__i = 0; __i < __bitset_words((_s)); __i++) \
140 #define BIT_AND(_s, d, s) do { \ argument
142 for (__i = 0; __i < __bitset_words((_s)); __i++) \
146 #define BIT_AND2(_s, d, s1, s2) do { \ argument
148 for (__i = 0; __i < __bitset_words((_s)); __i++) \
152 #define BIT_ANDNOT(_s, d, s) do { \ argument
154 for (__i = 0; __i < __bitset_words((_s)); __i++) \
158 #define BIT_ANDNOT2(_s, d, s1, s2) do { \ argument
160 for (__i = 0; __i < __bitset_words((_s)); __i++) \
164 #define BIT_XOR(_s, d, s) do { \ argument
166 for (__i = 0; __i < __bitset_words((_s)); __i++) \
170 #define BIT_XOR2(_s, d, s1, s2) do { \ argument
172 for (__i = 0; __i < __bitset_words((_s)); __i++) \
182 #define BIT_CLR_ATOMIC(_s, n, p) \ argument
183 atomic_clear_long(&(p)->__bits[__bitset_word(_s, n)], \
184 __bitset_mask((_s), n))
186 #define BIT_SET_ATOMIC(_s, n, p) \ argument
187 atomic_set_long(&(p)->__bits[__bitset_word(_s, n)], \
188 __bitset_mask((_s), n))
190 #define BIT_SET_ATOMIC_ACQ(_s, n, p) \ argument
191 atomic_set_acq_long(&(p)->__bits[__bitset_word(_s, n)], \
192 __bitset_mask((_s), n))
194 #define BIT_TEST_CLR_ATOMIC(_s, n, p) \ argument
196 &(p)->__bits[__bitset_word((_s), (n))], (n)) != 0)
198 #define BIT_TEST_SET_ATOMIC(_s, n, p) \ argument
200 &(p)->__bits[__bitset_word((_s), (n))], (n)) != 0)
203 #define BIT_AND_ATOMIC(_s, d, s) do { \ argument
205 for (__i = 0; __i < __bitset_words((_s)); __i++) \
210 #define BIT_OR_ATOMIC(_s, d, s) do { \ argument
212 for (__i = 0; __i < __bitset_words((_s)); __i++) \
217 #define BIT_COPY_STORE_REL(_s, f, t) do { \ argument
219 for (__i = 0; __i < __bitset_words((_s)); __i++) \
228 #define BIT_FFS_AT(_s, p, start) __extension__ ({ \ argument
234 for (__i = __bitset_word((_s), (start)); \
235 __i < __bitset_words((_s)); \
247 #define BIT_FFS(_s, p) BIT_FFS_AT((_s), (p), 0) argument
249 #define BIT_FLS(_s, p) __extension__ ({ \ argument
254 for (__i = __bitset_words((_s)); __i > 0; __i--) { \
264 #define BIT_COUNT(_s, p) __extension__ ({ \ argument
269 for (__i = 0; __i < __bitset_words((_s)); __i++) \
280 #define BITSET_SIZE(_s) (__bitset_words((_s)) * sizeof(long)) argument
285 #define BITSET_ALLOC(_s, mt, mf) malloc(BITSET_SIZE((_s)), mt, (mf)) argument