···3939 * int nodes_full(mask) Is mask full (all bits sets)?4040 * int nodes_weight(mask) Hamming weight - number of set bits4141 *4242- * void nodes_shift_right(dst, src, n) Shift right4343- * void nodes_shift_left(dst, src, n) Shift left4444- *4542 * unsigned int first_node(mask) Number lowest set bit, or MAX_NUMNODES4643 * unsigend int next_node(node, mask) Next node past 'node', or MAX_NUMNODES4744 * unsigned int next_node_in(node, mask) Next node past 'node', or wrap to first,···242245static __always_inline int __nodes_weight(const nodemask_t *srcp, unsigned int nbits)243246{244247 return bitmap_weight(srcp->bits, nbits);245245-}246246-247247-#define nodes_shift_right(dst, src, n) \248248- __nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES)249249-static __always_inline void __nodes_shift_right(nodemask_t *dstp,250250- const nodemask_t *srcp, int n, int nbits)251251-{252252- bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);253253-}254254-255255-#define nodes_shift_left(dst, src, n) \256256- __nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES)257257-static __always_inline void __nodes_shift_left(nodemask_t *dstp,258258- const nodemask_t *srcp, int n, int nbits)259259-{260260- bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);261248}262249263250/* FIXME: better would be to fix all architectures to never return