Lines Matching refs:MAX_NUMNODES
81 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
96 #define nodes_setall(dst) __nodes_setall(&(dst), MAX_NUMNODES)
102 #define nodes_clear(dst) __nodes_clear(&(dst), MAX_NUMNODES)
119 __nodes_and(&(dst), &(src1), &(src2), MAX_NUMNODES)
127 __nodes_or(&(dst), &(src1), &(src2), MAX_NUMNODES)
135 __nodes_xor(&(dst), &(src1), &(src2), MAX_NUMNODES)
143 __nodes_andnot(&(dst), &(src1), &(src2), MAX_NUMNODES)
151 __nodes_complement(&(dst), &(src), MAX_NUMNODES)
159 __nodes_equal(&(src1), &(src2), MAX_NUMNODES)
167 __nodes_intersects(&(src1), &(src2), MAX_NUMNODES)
175 __nodes_subset(&(src1), &(src2), MAX_NUMNODES)
182 #define nodes_empty(src) __nodes_empty(&(src), MAX_NUMNODES)
188 #define nodes_full(nodemask) __nodes_full(&(nodemask), MAX_NUMNODES)
194 #define nodes_weight(nodemask) __nodes_weight(&(nodemask), MAX_NUMNODES)
201 __nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES)
209 __nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES)
219 #define first_node(src) __first_node(&(src), MAX_NUMNODES)
225 #define next_node(n, src) __next_node((n), &(src), MAX_NUMNODES)
231 #define last_node(src) __last_node(&(src), MAX_NUMNODES)
257 return min_t(int,MAX_NUMNODES, in __first_unset_node()
258 find_first_zero_bit(maskp->bits, MAX_NUMNODES)); in __first_unset_node()
261 #define cycle_node(n, src) __cycle_node((n), &(src), MAX_NUMNODES)
271 #define NODE_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(MAX_NUMNODES)
273 #if MAX_NUMNODES <= BITS_PER_LONG
277 [BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD \
284 [0 ... BITS_TO_LONGS(MAX_NUMNODES)-2] = ~0UL, \
285 [BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD \
292 [0 ... BITS_TO_LONGS(MAX_NUMNODES)-1] = 0UL \
298 __nodelist_scnprintf((buf), (len), (src), MAX_NUMNODES)
307 __nodemask_scnprintf((buf), (len), &(src), MAX_NUMNODES)
315 __nodemask_parse((ubuf), (ulen), &(dst), MAX_NUMNODES)
323 #if MAX_NUMNODES > 1
326 (node) < MAX_NUMNODES; \
341 #if MAX_NUMNODES > 1