197 					const nodemask_t *srcp, unsigned int nbits)  in __nodes_complement()  argument
199 	bitmap_complement(dstp->bits, srcp->bits, nbits);  in __nodes_complement()
227 static __always_inline bool __nodes_empty(const nodemask_t *srcp, unsigned int nbits)  in __nodes_empty()  argument
229 	return bitmap_empty(srcp->bits, nbits);  in __nodes_empty()
233 static __always_inline bool __nodes_full(const nodemask_t *srcp, unsigned int nbits)  in __nodes_full()  argument
235 	return bitmap_full(srcp->bits, nbits);  in __nodes_full()
239 static __always_inline int __nodes_weight(const nodemask_t *srcp, unsigned int nbits)  in __nodes_weight()  argument
241 	return bitmap_weight(srcp->bits, nbits);  in __nodes_weight()
247 					const nodemask_t *srcp, int n, int nbits)  in __nodes_shift_right()  argument
249 	bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);  in __nodes_shift_right()
255 					const nodemask_t *srcp, int n, int nbits)  in __nodes_shift_left()  argument
257 	bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);  in __nodes_shift_left()
264 static __always_inline unsigned int __first_node(const nodemask_t *srcp)  in __first_node()  argument
266 	return min_t(unsigned int, MAX_NUMNODES, find_first_bit(srcp->bits, MAX_NUMNODES));  in __first_node()
270 static __always_inline unsigned int __next_node(int n, const nodemask_t *srcp)  in __next_node()  argument
272 	return min_t(unsigned int, MAX_NUMNODES, find_next_bit(srcp->bits, MAX_NUMNODES, n+1));  in __next_node()
280 static __always_inline unsigned int __next_node_in(int node, const nodemask_t *srcp)  in __next_node_in()  argument
282 	unsigned int ret = __next_node(node, srcp);  in __next_node_in()
285 		ret = __first_node(srcp);  in __next_node_in()
363 static __always_inline void __nodes_remap(nodemask_t *dstp, const nodemask_t *srcp,  in __nodes_remap()  argument
366 	bitmap_remap(dstp->bits, srcp->bits, oldp->bits, newp->bits, nbits);  in __nodes_remap()