24  * void nodes_setall(mask)		set all bits
25  * void nodes_clear(mask)		clear all bits
38  * int nodes_empty(mask)		Is mask empty (no bits sets)?
39  * int nodes_full(mask)			Is mask full (all bits sets)?
40  * int nodes_weight(mask)		Hamming weight - number of set bits
53  * NODE_MASK_ALL			Initializer - all bits set
54  * NODE_MASK_NONE			Initializer - no bits set
62  * void nodes_fold(dst, orig, sz)	dst bits = orig bits mod sz
98 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
115 	return m ? m->bits : NULL;  in __nodemask_pr_bits()
130 	set_bit(node, dstp->bits);  in __node_set()
136 	clear_bit(node, dstp->bits);  in __node_clear()
142 	bitmap_fill(dstp->bits, nbits);  in __nodes_setall()
148 	bitmap_zero(dstp->bits, nbits);  in __nodes_clear()
152 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits)
158 	return test_and_set_bit(node, addr->bits);  in __node_test_and_set()
166 	bitmap_and(dstp->bits, src1p->bits, src2p->bits, nbits);  in __nodes_and()
174 	bitmap_or(dstp->bits, src1p->bits, src2p->bits, nbits);  in __nodes_or()
182 	bitmap_xor(dstp->bits, src1p->bits, src2p->bits, nbits);  in __nodes_xor()
190 	bitmap_andnot(dstp->bits, src1p->bits, src2p->bits, nbits);  in __nodes_andnot()
198 	bitmap_complement(dstp->bits, srcp->bits, nbits);  in __nodes_complement()
206 	return bitmap_equal(src1p->bits, src2p->bits, nbits);  in __nodes_equal()
214 	return bitmap_intersects(src1p->bits, src2p->bits, nbits);  in __nodes_intersects()
222 	return bitmap_subset(src1p->bits, src2p->bits, nbits);  in __nodes_subset()
228 	return bitmap_empty(srcp->bits, nbits);  in __nodes_empty()
234 	return bitmap_full(srcp->bits, nbits);  in __nodes_full()
240 	return bitmap_weight(srcp->bits, nbits);  in __nodes_weight()
248 	bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);  in __nodes_shift_right()
256 	bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);  in __nodes_shift_left()
265 	return min_t(int, MAX_NUMNODES, find_first_bit(srcp->bits, MAX_NUMNODES));  in __first_node()
271 	return min_t(int,MAX_NUMNODES,find_next_bit(srcp->bits, MAX_NUMNODES, n+1));  in __next_node()
291 		m.bits[0] = 1UL << (node);				\
302 			find_first_zero_bit(maskp->bits, MAX_NUMNODES));  in __first_unset_node()
329 #define nodes_addr(src) ((src).bits)
336 	return bitmap_parse_user(buf, len, dstp->bits, nbits);  in __nodemask_parse_user()
342 	return bitmap_parselist(buf, dstp->bits, nbits);  in __nodelist_parse()
350 	return bitmap_bitremap(oldbit, oldp->bits, newp->bits, nbits);  in __node_remap()
358 	bitmap_remap(dstp->bits, srcp->bits, oldp->bits, newp->bits, nbits);  in __nodes_remap()
366 	bitmap_onto(dstp->bits, origp->bits, relmapp->bits, nbits);  in __nodes_onto()
374 	bitmap_fold(dstp->bits, origp->bits, sz, nbits);  in __nodes_fold()