1c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#ifndef __LINUX_NODEMASK_H 2c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define __LINUX_NODEMASK_H 3c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 4c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru/* 5c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * Nodemasks provide a bitmap suitable for representing the 6c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * set of Node's in a system, one bit position per Node number. 7c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 8c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * See detailed comments in the file linux/bitmap.h describing the 9c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * data type on which these nodemasks are based. 10c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 11c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * For details of nodemask_scnprintf() and nodemask_parse(), 12c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * see bitmap_scnprintf() and bitmap_parse() in lib/bitmap.c. 13c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * For details of nodelist_scnprintf() and nodelist_parse(), see 14c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * bitmap_scnlistprintf() and bitmap_parselist(), also in bitmap.c. 15c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * For details of node_remap(), see bitmap_bitremap in lib/bitmap.c. 16c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * For details of nodes_remap(), see bitmap_remap in lib/bitmap.c. 17c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 18c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * The available nodemask operations are: 19c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 20c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void node_set(node, mask) turn on bit 'node' in mask 21c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void node_clear(node, mask) turn off bit 'node' in mask 22c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_setall(mask) set all bits 23c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_clear(mask) clear all bits 24c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int node_isset(node, mask) true iff bit 'node' set in mask 25c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int node_test_and_set(node, mask) test and set bit 'node' in mask 26c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 27c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_and(dst, src1, src2) dst = src1 & src2 [intersection] 28c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_or(dst, src1, src2) dst = src1 | src2 [union] 29c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_xor(dst, src1, src2) dst = src1 ^ src2 30c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_andnot(dst, src1, src2) dst = src1 & ~src2 31c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_complement(dst, src) dst = ~src 32c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 33c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_equal(mask1, mask2) Does mask1 == mask2? 34c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_intersects(mask1, mask2) Do mask1 and mask2 intersect? 35c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_subset(mask1, mask2) Is mask1 a subset of mask2? 36c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_empty(mask) Is mask empty (no bits sets)? 37c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_full(mask) Is mask full (all bits sets)? 38c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_weight(mask) Hamming weight - number of set bits 39c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 40c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_shift_right(dst, src, n) Shift right 41c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * void nodes_shift_left(dst, src, n) Shift left 42c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 43c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int first_node(mask) Number lowest set bit, or MAX_NUMNODES 44c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int next_node(node, mask) Next node past 'node', or MAX_NUMNODES 45c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int first_unset_node(mask) First node not set in mask, or 46c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * MAX_NUMNODES. 47c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 48c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * nodemask_t nodemask_of_node(node) Return nodemask with bit 'node' set 49c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * NODE_MASK_ALL Initializer - all bits set 50c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * NODE_MASK_NONE Initializer - no bits set 51c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * unsigned long *nodes_addr(mask) Array of unsigned long's in mask 52c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 53c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodemask_scnprintf(buf, len, mask) Format nodemask for printing 54c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodemask_parse(ubuf, ulen, mask) Parse ascii string as nodemask 55c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodelist_scnprintf(buf, len, mask) Format nodemask as list for printing 56c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodelist_parse(buf, map) Parse ascii string as nodelist 57c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int node_remap(oldbit, old, new) newbit = map(old, new)(oldbit) 58c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int nodes_remap(dst, src, old, new) *dst = map(old, new)(dst) 59c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 60c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * for_each_node_mask(node, mask) for-loop node over mask 61c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 62c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int num_online_nodes() Number of online Nodes 63c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int num_possible_nodes() Number of all possible Nodes 64c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 65c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int node_online(node) Is some node online? 66c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int node_possible(node) Is some node possible? 67c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 68c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * int any_online_node(mask) First online node in mask 69c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 70c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * node_set_online(node) set bit 'node' in node_online_map 71c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * node_set_offline(node) clear bit 'node' in node_online_map 72c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 73c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * for_each_node(node) for-loop node over node_possible_map 74c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * for_each_online_node(node) for-loop node over node_online_map 75c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 76c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * Subtlety: 77c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * 1) The 'type-checked' form of node_isset() causes gcc (3.3.2, anyway) 78c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * to generate slightly worse code. So use a simple one-line #define 79c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * for node_isset(), instead of wrapping an inline inside a macro, the 80c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * way we do the other calls. 81c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru */ 82c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 83c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#include <linux/kernel.h> 84c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#include <linux/threads.h> 85c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#include <linux/bitmap.h> 86c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#include <linux/numa.h> 87c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 88c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querutypedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t; 89c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queruextern nodemask_t _unused_nodemask_arg_; 90c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 91c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_set(node, dst) __node_set((node), &(dst)) 92c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __node_set(int node, volatile nodemask_t *dstp) 93c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 94c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru set_bit(node, dstp->bits); 95c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 96c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 97c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_clear(node, dst) __node_clear((node), &(dst)) 98c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __node_clear(int node, volatile nodemask_t *dstp) 99c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 100c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru clear_bit(node, dstp->bits); 101c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 102c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 103c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_setall(dst) __nodes_setall(&(dst), MAX_NUMNODES) 104c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_setall(nodemask_t *dstp, int nbits) 105c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 106c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_fill(dstp->bits, nbits); 107c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 108c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 109c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_clear(dst) __nodes_clear(&(dst), MAX_NUMNODES) 110c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_clear(nodemask_t *dstp, int nbits) 111c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 112c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_zero(dstp->bits, nbits); 113c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 114c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 115c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru/* No static inline type checking - see Subtlety (1) above. */ 116c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_isset(node, nodemask) test_bit((node), (nodemask).bits) 117c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 118c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_test_and_set(node, nodemask) \ 119c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __node_test_and_set((node), &(nodemask)) 120c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __node_test_and_set(int node, nodemask_t *addr) 121c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 122c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return test_and_set_bit(node, addr->bits); 123c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 124c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 125c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_and(dst, src1, src2) \ 126c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_and(&(dst), &(src1), &(src2), MAX_NUMNODES) 127c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_and(nodemask_t *dstp, const nodemask_t *src1p, 128c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 129c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 130c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_and(dstp->bits, src1p->bits, src2p->bits, nbits); 131c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 132c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 133c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_or(dst, src1, src2) \ 134c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_or(&(dst), &(src1), &(src2), MAX_NUMNODES) 135c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_or(nodemask_t *dstp, const nodemask_t *src1p, 136c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 137c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 138c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_or(dstp->bits, src1p->bits, src2p->bits, nbits); 139c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 140c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 141c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_xor(dst, src1, src2) \ 142c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_xor(&(dst), &(src1), &(src2), MAX_NUMNODES) 143c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_xor(nodemask_t *dstp, const nodemask_t *src1p, 144c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 145c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 146c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_xor(dstp->bits, src1p->bits, src2p->bits, nbits); 147c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 148c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 149c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_andnot(dst, src1, src2) \ 150c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_andnot(&(dst), &(src1), &(src2), MAX_NUMNODES) 151c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_andnot(nodemask_t *dstp, const nodemask_t *src1p, 152c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 153c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 154c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_andnot(dstp->bits, src1p->bits, src2p->bits, nbits); 155c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 156c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 157c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_complement(dst, src) \ 158c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_complement(&(dst), &(src), MAX_NUMNODES) 159c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_complement(nodemask_t *dstp, 160c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *srcp, int nbits) 161c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 162c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_complement(dstp->bits, srcp->bits, nbits); 163c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 164c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 165c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_equal(src1, src2) \ 166c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_equal(&(src1), &(src2), MAX_NUMNODES) 167c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodes_equal(const nodemask_t *src1p, 168c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 169c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 170c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_equal(src1p->bits, src2p->bits, nbits); 171c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 172c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 173c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_intersects(src1, src2) \ 174c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_intersects(&(src1), &(src2), MAX_NUMNODES) 175c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodes_intersects(const nodemask_t *src1p, 176c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 177c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 178c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_intersects(src1p->bits, src2p->bits, nbits); 179c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 180c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 181c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_subset(src1, src2) \ 182c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_subset(&(src1), &(src2), MAX_NUMNODES) 183c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodes_subset(const nodemask_t *src1p, 184c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *src2p, int nbits) 185c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 186c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_subset(src1p->bits, src2p->bits, nbits); 187c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 188c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 189c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_empty(src) __nodes_empty(&(src), MAX_NUMNODES) 190c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodes_empty(const nodemask_t *srcp, int nbits) 191c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 192c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_empty(srcp->bits, nbits); 193c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 194c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 195c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_full(nodemask) __nodes_full(&(nodemask), MAX_NUMNODES) 196c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodes_full(const nodemask_t *srcp, int nbits) 197c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 198c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_full(srcp->bits, nbits); 199c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 200c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 201c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_weight(nodemask) __nodes_weight(&(nodemask), MAX_NUMNODES) 202c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodes_weight(const nodemask_t *srcp, int nbits) 203c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 204c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_weight(srcp->bits, nbits); 205c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 206c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 207c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_shift_right(dst, src, n) \ 208c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES) 209c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_shift_right(nodemask_t *dstp, 210c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *srcp, int n, int nbits) 211c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 212c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_shift_right(dstp->bits, srcp->bits, n, nbits); 213c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 214c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 215c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_shift_left(dst, src, n) \ 216c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES) 217c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_shift_left(nodemask_t *dstp, 218c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *srcp, int n, int nbits) 219c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 220c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_shift_left(dstp->bits, srcp->bits, n, nbits); 221c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 222c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 223c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru/* FIXME: better would be to fix all architectures to never return 224c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru > MAX_NUMNODES, then the silly min_ts could be dropped. */ 225c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 226c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define first_node(src) __first_node(&(src)) 227c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __first_node(const nodemask_t *srcp) 228c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 229c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return min_t(int, MAX_NUMNODES, find_first_bit(srcp->bits, MAX_NUMNODES)); 230c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 231c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 232c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define next_node(n, src) __next_node((n), &(src)) 233c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __next_node(int n, const nodemask_t *srcp) 234c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 235c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return min_t(int,MAX_NUMNODES,find_next_bit(srcp->bits, MAX_NUMNODES, n+1)); 236c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 237c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 238c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodemask_of_node(node) \ 239c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru({ \ 240c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru typeof(_unused_nodemask_arg_) m; \ 241c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru if (sizeof(m) == sizeof(unsigned long)) { \ 242c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru m.bits[0] = 1UL<<(node); \ 243c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru } else { \ 244c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru nodes_clear(m); \ 245c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru node_set((node), m); \ 246c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru } \ 247c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru m; \ 248c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru}) 249c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 250c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define first_unset_node(mask) __first_unset_node(&(mask)) 251c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __first_unset_node(const nodemask_t *maskp) 252c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 253c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return min_t(int,MAX_NUMNODES, 254c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru find_first_zero_bit(maskp->bits, MAX_NUMNODES)); 255c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 256c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 257c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define NODE_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(MAX_NUMNODES) 258c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 259c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#if MAX_NUMNODES <= BITS_PER_LONG 260c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 261c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define NODE_MASK_ALL \ 262c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru((nodemask_t) { { \ 263c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru [BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD \ 264c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} }) 265c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 266c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#else 267c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 268c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define NODE_MASK_ALL \ 269c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru((nodemask_t) { { \ 270c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru [0 ... BITS_TO_LONGS(MAX_NUMNODES)-2] = ~0UL, \ 271c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru [BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD \ 272c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} }) 273c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 274c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#endif 275c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 276c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define NODE_MASK_NONE \ 277c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru((nodemask_t) { { \ 278c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru [0 ... BITS_TO_LONGS(MAX_NUMNODES)-1] = 0UL \ 279c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} }) 280c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 281c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_addr(src) ((src).bits) 282c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 283c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodemask_scnprintf(buf, len, src) \ 284c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodemask_scnprintf((buf), (len), &(src), MAX_NUMNODES) 285c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodemask_scnprintf(char *buf, int len, 286c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *srcp, int nbits) 287c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 288c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_scnprintf(buf, len, srcp->bits, nbits); 289c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 290c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 291c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodemask_parse(ubuf, ulen, dst) \ 292c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodemask_parse((ubuf), (ulen), &(dst), MAX_NUMNODES) 293c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodemask_parse(const char __user *buf, int len, 294c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru nodemask_t *dstp, int nbits) 295c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 296c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_parse(buf, len, dstp->bits, nbits); 297c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 298c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 299c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodelist_scnprintf(buf, len, src) \ 300c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodelist_scnprintf((buf), (len), &(src), MAX_NUMNODES) 301c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodelist_scnprintf(char *buf, int len, 302c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *srcp, int nbits) 303c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 304c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_scnlistprintf(buf, len, srcp->bits, nbits); 305c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 306c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 307c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodelist_parse(buf, dst) __nodelist_parse((buf), &(dst), MAX_NUMNODES) 308c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __nodelist_parse(const char *buf, nodemask_t *dstp, int nbits) 309c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 310c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_parselist(buf, dstp->bits, nbits); 311c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 312c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 313c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_remap(oldbit, old, new) \ 314c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __node_remap((oldbit), &(old), &(new), MAX_NUMNODES) 315c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline int __node_remap(int oldbit, 316c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *oldp, const nodemask_t *newp, int nbits) 317c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 318c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru return bitmap_bitremap(oldbit, oldp->bits, newp->bits, nbits); 319c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 320c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 321c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define nodes_remap(dst, src, old, new) \ 322c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru __nodes_remap(&(dst), &(src), &(old), &(new), MAX_NUMNODES) 323c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Querustatic inline void __nodes_remap(nodemask_t *dstp, const nodemask_t *srcp, 324c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru const nodemask_t *oldp, const nodemask_t *newp, int nbits) 325c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru{ 326c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru bitmap_remap(dstp->bits, srcp->bits, oldp->bits, newp->bits, nbits); 327c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru} 328c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 329c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#if MAX_NUMNODES > 1 330c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define for_each_node_mask(node, mask) \ 331c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru for ((node) = first_node(mask); \ 332c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru (node) < MAX_NUMNODES; \ 333c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru (node) = next_node((node), (mask))) 334c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#else /* MAX_NUMNODES == 1 */ 335c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define for_each_node_mask(node, mask) \ 336c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru if (!nodes_empty(mask)) \ 337c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru for ((node) = 0; (node) < 1; (node)++) 338c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#endif /* MAX_NUMNODES */ 339c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 340c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru/* 341c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * The following particular system nodemasks and operations 342c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru * on them manage all possible and online nodes. 343c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru */ 344c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 345c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queruextern nodemask_t node_online_map; 346c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queruextern nodemask_t node_possible_map; 347c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 348c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#if MAX_NUMNODES > 1 349c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define num_online_nodes() nodes_weight(node_online_map) 350c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define num_possible_nodes() nodes_weight(node_possible_map) 351c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_online(node) node_isset((node), node_online_map) 352c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_possible(node) node_isset((node), node_possible_map) 353c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define first_online_node first_node(node_online_map) 354c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define next_online_node(nid) next_node((nid), node_online_map) 355c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#else 356c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define num_online_nodes() 1 357c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define num_possible_nodes() 1 358c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_online(node) ((node) == 0) 359c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_possible(node) ((node) == 0) 360c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define first_online_node 0 361c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define next_online_node(nid) (MAX_NUMNODES) 362c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#endif 363c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 364c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define any_online_node(mask) \ 365c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru({ \ 366c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru int node; \ 367c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru for_each_node_mask(node, (mask)) \ 368c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru if (node_online(node)) \ 369c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru break; \ 370c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru node; \ 371c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru}) 372c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 373c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_set_online(node) set_bit((node), node_online_map.bits) 374c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define node_set_offline(node) clear_bit((node), node_online_map.bits) 375c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 376c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define for_each_node(node) for_each_node_mask((node), node_possible_map) 377c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#define for_each_online_node(node) for_each_node_mask((node), node_online_map) 378c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru 379c559cd81139f97cecad1ad91a0b2e25a5936d53Jean-Baptiste Queru#endif /* __LINUX_NODEMASK_H */ 380