Blame view

include/linux/nodemask.h 16.5 KB
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
1
2
3
4
5
6
7
8
9
10
  #ifndef __LINUX_NODEMASK_H
  #define __LINUX_NODEMASK_H
  
  /*
   * Nodemasks provide a bitmap suitable for representing the
   * set of Node's in a system, one bit position per Node number.
   *
   * See detailed comments in the file linux/bitmap.h describing the
   * data type on which these nodemasks are based.
   *
01a3ee2b2   Reinette Chatre   [PATCH] bitmap: p...
11
12
   * For details of nodemask_scnprintf() and nodemask_parse_user(),
   * see bitmap_scnprintf() and bitmap_parse_user() in lib/bitmap.c.
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
13
14
   * For details of nodelist_scnprintf() and nodelist_parse(), see
   * bitmap_scnlistprintf() and bitmap_parselist(), also in bitmap.c.
fb5eeeee4   Paul Jackson   [PATCH] cpusets: ...
15
16
   * For details of node_remap(), see bitmap_bitremap in lib/bitmap.c.
   * For details of nodes_remap(), see bitmap_remap in lib/bitmap.c.
7ea931c9f   Paul Jackson   mempolicy: add bi...
17
18
   * For details of nodes_onto(), see bitmap_onto in lib/bitmap.c.
   * For details of nodes_fold(), see bitmap_fold in lib/bitmap.c.
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
   *
   * The available nodemask operations are:
   *
   * void node_set(node, mask)		turn on bit 'node' in mask
   * void node_clear(node, mask)		turn off bit 'node' in mask
   * void nodes_setall(mask)		set all bits
   * void nodes_clear(mask)		clear all bits
   * int node_isset(node, mask)		true iff bit 'node' set in mask
   * int node_test_and_set(node, mask)	test and set bit 'node' in mask
   *
   * void nodes_and(dst, src1, src2)	dst = src1 & src2  [intersection]
   * void nodes_or(dst, src1, src2)	dst = src1 | src2  [union]
   * void nodes_xor(dst, src1, src2)	dst = src1 ^ src2
   * void nodes_andnot(dst, src1, src2)	dst = src1 & ~src2
   * void nodes_complement(dst, src)	dst = ~src
   *
   * int nodes_equal(mask1, mask2)	Does mask1 == mask2?
   * int nodes_intersects(mask1, mask2)	Do mask1 and mask2 intersect?
   * int nodes_subset(mask1, mask2)	Is mask1 a subset of mask2?
   * int nodes_empty(mask)		Is mask empty (no bits sets)?
   * int nodes_full(mask)			Is mask full (all bits sets)?
   * int nodes_weight(mask)		Hamming weight - number of set bits
   *
   * void nodes_shift_right(dst, src, n)	Shift right
   * void nodes_shift_left(dst, src, n)	Shift left
   *
   * int first_node(mask)			Number lowest set bit, or MAX_NUMNODES
   * int next_node(node, mask)		Next node past 'node', or MAX_NUMNODES
   * int first_unset_node(mask)		First node not set in mask, or 
   *					MAX_NUMNODES.
   *
   * nodemask_t nodemask_of_node(node)	Return nodemask with bit 'node' set
   * NODE_MASK_ALL			Initializer - all bits set
   * NODE_MASK_NONE			Initializer - no bits set
   * unsigned long *nodes_addr(mask)	Array of unsigned long's in mask
   *
   * int nodemask_scnprintf(buf, len, mask) Format nodemask for printing
01a3ee2b2   Reinette Chatre   [PATCH] bitmap: p...
56
   * int nodemask_parse_user(ubuf, ulen, mask)	Parse ascii string as nodemask
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
57
58
   * int nodelist_scnprintf(buf, len, mask) Format nodemask as list for printing
   * int nodelist_parse(buf, map)		Parse ascii string as nodelist
fb5eeeee4   Paul Jackson   [PATCH] cpusets: ...
59
   * int node_remap(oldbit, old, new)	newbit = map(old, new)(oldbit)
7ea931c9f   Paul Jackson   mempolicy: add bi...
60
61
62
   * void nodes_remap(dst, src, old, new)	*dst = map(old, new)(src)
   * void nodes_onto(dst, orig, relmap)	*dst = orig relative to relmap
   * void nodes_fold(dst, orig, sz)	dst bits = orig bits mod sz
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
63
64
65
66
67
68
   *
   * for_each_node_mask(node, mask)	for-loop node over mask
   *
   * int num_online_nodes()		Number of online Nodes
   * int num_possible_nodes()		Number of all possible Nodes
   *
778d3b0ff   Michal Hocko   cpusets: randomiz...
69
70
   * int node_random(mask)		Random node with set bit in mask
   *
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
71
72
73
   * int node_online(node)		Is some node online?
   * int node_possible(node)		Is some node possible?
   *
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
74
75
76
77
78
79
80
81
82
83
84
   * node_set_online(node)		set bit 'node' in node_online_map
   * node_set_offline(node)		clear bit 'node' in node_online_map
   *
   * for_each_node(node)			for-loop node over node_possible_map
   * for_each_online_node(node)		for-loop node over node_online_map
   *
   * Subtlety:
   * 1) The 'type-checked' form of node_isset() causes gcc (3.3.2, anyway)
   *    to generate slightly worse code.  So use a simple one-line #define
   *    for node_isset(), instead of wrapping an inline inside a macro, the
   *    way we do the other calls.
4bfc44958   KAMEZAWA Hiroyuki   mm: make set_memp...
85
86
87
88
89
90
   *
   * NODEMASK_SCRATCH
   * When doing above logical AND, OR, XOR, Remap operations the callers tend to
   * need temporary nodemask_t's on the stack. But if NODES_SHIFT is large,
   * nodemask_t's consume too much stack space.  NODEMASK_SCRATCH is a helper
   * for such situations. See below and CPUMASK_ALLOC also.
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
91
92
93
94
95
96
   */
  
  #include <linux/kernel.h>
  #include <linux/threads.h>
  #include <linux/bitmap.h>
  #include <linux/numa.h>
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
97
98
99
  
  typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
  extern nodemask_t _unused_nodemask_arg_;
323f54ed0   Tom Rini   numa: Mark __node...
100
101
102
103
104
105
106
107
108
  /*
   * The inline keyword gives the compiler room to decide to inline, or
   * not inline a function as it sees best.  However, as these functions
   * are called in both __init and non-__init functions, if they are not
   * inlined we will end up with a section mis-match error (of the type of
   * freeable items not being freed).  So we must use __always_inline here
   * to fix the problem.  If other functions in the future also end up in
   * this situation they will also need to be annotated as __always_inline
   */
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
109
  #define node_set(node, dst) __node_set((node), &(dst))
323f54ed0   Tom Rini   numa: Mark __node...
110
  static __always_inline void __node_set(int node, volatile nodemask_t *dstp)
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
  {
  	set_bit(node, dstp->bits);
  }
  
  #define node_clear(node, dst) __node_clear((node), &(dst))
  static inline void __node_clear(int node, volatile nodemask_t *dstp)
  {
  	clear_bit(node, dstp->bits);
  }
  
  #define nodes_setall(dst) __nodes_setall(&(dst), MAX_NUMNODES)
  static inline void __nodes_setall(nodemask_t *dstp, int nbits)
  {
  	bitmap_fill(dstp->bits, nbits);
  }
  
  #define nodes_clear(dst) __nodes_clear(&(dst), MAX_NUMNODES)
  static inline void __nodes_clear(nodemask_t *dstp, int nbits)
  {
  	bitmap_zero(dstp->bits, nbits);
  }
  
  /* No static inline type checking - see Subtlety (1) above. */
  #define node_isset(node, nodemask) test_bit((node), (nodemask).bits)
  
  #define node_test_and_set(node, nodemask) \
  			__node_test_and_set((node), &(nodemask))
  static inline int __node_test_and_set(int node, nodemask_t *addr)
  {
  	return test_and_set_bit(node, addr->bits);
  }
  
  #define nodes_and(dst, src1, src2) \
  			__nodes_and(&(dst), &(src1), &(src2), MAX_NUMNODES)
  static inline void __nodes_and(nodemask_t *dstp, const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	bitmap_and(dstp->bits, src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_or(dst, src1, src2) \
  			__nodes_or(&(dst), &(src1), &(src2), MAX_NUMNODES)
  static inline void __nodes_or(nodemask_t *dstp, const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	bitmap_or(dstp->bits, src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_xor(dst, src1, src2) \
  			__nodes_xor(&(dst), &(src1), &(src2), MAX_NUMNODES)
  static inline void __nodes_xor(nodemask_t *dstp, const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	bitmap_xor(dstp->bits, src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_andnot(dst, src1, src2) \
  			__nodes_andnot(&(dst), &(src1), &(src2), MAX_NUMNODES)
  static inline void __nodes_andnot(nodemask_t *dstp, const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	bitmap_andnot(dstp->bits, src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_complement(dst, src) \
  			__nodes_complement(&(dst), &(src), MAX_NUMNODES)
  static inline void __nodes_complement(nodemask_t *dstp,
  					const nodemask_t *srcp, int nbits)
  {
  	bitmap_complement(dstp->bits, srcp->bits, nbits);
  }
  
  #define nodes_equal(src1, src2) \
  			__nodes_equal(&(src1), &(src2), MAX_NUMNODES)
  static inline int __nodes_equal(const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	return bitmap_equal(src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_intersects(src1, src2) \
  			__nodes_intersects(&(src1), &(src2), MAX_NUMNODES)
  static inline int __nodes_intersects(const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	return bitmap_intersects(src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_subset(src1, src2) \
  			__nodes_subset(&(src1), &(src2), MAX_NUMNODES)
  static inline int __nodes_subset(const nodemask_t *src1p,
  					const nodemask_t *src2p, int nbits)
  {
  	return bitmap_subset(src1p->bits, src2p->bits, nbits);
  }
  
  #define nodes_empty(src) __nodes_empty(&(src), MAX_NUMNODES)
  static inline int __nodes_empty(const nodemask_t *srcp, int nbits)
  {
  	return bitmap_empty(srcp->bits, nbits);
  }
  
  #define nodes_full(nodemask) __nodes_full(&(nodemask), MAX_NUMNODES)
  static inline int __nodes_full(const nodemask_t *srcp, int nbits)
  {
  	return bitmap_full(srcp->bits, nbits);
  }
  
  #define nodes_weight(nodemask) __nodes_weight(&(nodemask), MAX_NUMNODES)
  static inline int __nodes_weight(const nodemask_t *srcp, int nbits)
  {
  	return bitmap_weight(srcp->bits, nbits);
  }
  
  #define nodes_shift_right(dst, src, n) \
  			__nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES)
  static inline void __nodes_shift_right(nodemask_t *dstp,
  					const nodemask_t *srcp, int n, int nbits)
  {
  	bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);
  }
  
  #define nodes_shift_left(dst, src, n) \
  			__nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES)
  static inline void __nodes_shift_left(nodemask_t *dstp,
  					const nodemask_t *srcp, int n, int nbits)
  {
  	bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);
  }
  
  /* FIXME: better would be to fix all architectures to never return
            > MAX_NUMNODES, then the silly min_ts could be dropped. */
  
  #define first_node(src) __first_node(&(src))
  static inline int __first_node(const nodemask_t *srcp)
  {
  	return min_t(int, MAX_NUMNODES, find_first_bit(srcp->bits, MAX_NUMNODES));
  }
  
  #define next_node(n, src) __next_node((n), &(src))
  static inline int __next_node(int n, const nodemask_t *srcp)
  {
  	return min_t(int,MAX_NUMNODES,find_next_bit(srcp->bits, MAX_NUMNODES, n+1));
  }
c1e6c8d07   Lee Schermerhorn   hugetlb: factor i...
255
256
257
258
259
  static inline void init_nodemask_of_node(nodemask_t *mask, int node)
  {
  	nodes_clear(*mask);
  	node_set(node, *mask);
  }
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
260
261
262
263
  #define nodemask_of_node(node)						\
  ({									\
  	typeof(_unused_nodemask_arg_) m;				\
  	if (sizeof(m) == sizeof(unsigned long)) {			\
c1e6c8d07   Lee Schermerhorn   hugetlb: factor i...
264
  		m.bits[0] = 1UL << (node);				\
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
265
  	} else {							\
c1e6c8d07   Lee Schermerhorn   hugetlb: factor i...
266
  		init_nodemask_of_node(&m, (node));			\
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
  	}								\
  	m;								\
  })
  
  #define first_unset_node(mask) __first_unset_node(&(mask))
  static inline int __first_unset_node(const nodemask_t *maskp)
  {
  	return min_t(int,MAX_NUMNODES,
  			find_first_zero_bit(maskp->bits, MAX_NUMNODES));
  }
  
  #define NODE_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(MAX_NUMNODES)
  
  #if MAX_NUMNODES <= BITS_PER_LONG
  
  #define NODE_MASK_ALL							\
  ((nodemask_t) { {							\
  	[BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD		\
  } })
  
  #else
  
  #define NODE_MASK_ALL							\
  ((nodemask_t) { {							\
  	[0 ... BITS_TO_LONGS(MAX_NUMNODES)-2] = ~0UL,			\
  	[BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD		\
  } })
  
  #endif
  
  #define NODE_MASK_NONE							\
  ((nodemask_t) { {							\
  	[0 ... BITS_TO_LONGS(MAX_NUMNODES)-1] =  0UL			\
  } })
  
  #define nodes_addr(src) ((src).bits)
  
  #define nodemask_scnprintf(buf, len, src) \
  			__nodemask_scnprintf((buf), (len), &(src), MAX_NUMNODES)
  static inline int __nodemask_scnprintf(char *buf, int len,
  					const nodemask_t *srcp, int nbits)
  {
  	return bitmap_scnprintf(buf, len, srcp->bits, nbits);
  }
01a3ee2b2   Reinette Chatre   [PATCH] bitmap: p...
311
312
313
  #define nodemask_parse_user(ubuf, ulen, dst) \
  		__nodemask_parse_user((ubuf), (ulen), &(dst), MAX_NUMNODES)
  static inline int __nodemask_parse_user(const char __user *buf, int len,
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
314
315
  					nodemask_t *dstp, int nbits)
  {
01a3ee2b2   Reinette Chatre   [PATCH] bitmap: p...
316
  	return bitmap_parse_user(buf, len, dstp->bits, nbits);
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
  }
  
  #define nodelist_scnprintf(buf, len, src) \
  			__nodelist_scnprintf((buf), (len), &(src), MAX_NUMNODES)
  static inline int __nodelist_scnprintf(char *buf, int len,
  					const nodemask_t *srcp, int nbits)
  {
  	return bitmap_scnlistprintf(buf, len, srcp->bits, nbits);
  }
  
  #define nodelist_parse(buf, dst) __nodelist_parse((buf), &(dst), MAX_NUMNODES)
  static inline int __nodelist_parse(const char *buf, nodemask_t *dstp, int nbits)
  {
  	return bitmap_parselist(buf, dstp->bits, nbits);
  }
fb5eeeee4   Paul Jackson   [PATCH] cpusets: ...
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
  #define node_remap(oldbit, old, new) \
  		__node_remap((oldbit), &(old), &(new), MAX_NUMNODES)
  static inline int __node_remap(int oldbit,
  		const nodemask_t *oldp, const nodemask_t *newp, int nbits)
  {
  	return bitmap_bitremap(oldbit, oldp->bits, newp->bits, nbits);
  }
  
  #define nodes_remap(dst, src, old, new) \
  		__nodes_remap(&(dst), &(src), &(old), &(new), MAX_NUMNODES)
  static inline void __nodes_remap(nodemask_t *dstp, const nodemask_t *srcp,
  		const nodemask_t *oldp, const nodemask_t *newp, int nbits)
  {
  	bitmap_remap(dstp->bits, srcp->bits, oldp->bits, newp->bits, nbits);
  }
7ea931c9f   Paul Jackson   mempolicy: add bi...
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
  #define nodes_onto(dst, orig, relmap) \
  		__nodes_onto(&(dst), &(orig), &(relmap), MAX_NUMNODES)
  static inline void __nodes_onto(nodemask_t *dstp, const nodemask_t *origp,
  		const nodemask_t *relmapp, int nbits)
  {
  	bitmap_onto(dstp->bits, origp->bits, relmapp->bits, nbits);
  }
  
  #define nodes_fold(dst, orig, sz) \
  		__nodes_fold(&(dst), &(orig), sz, MAX_NUMNODES)
  static inline void __nodes_fold(nodemask_t *dstp, const nodemask_t *origp,
  		int sz, int nbits)
  {
  	bitmap_fold(dstp->bits, origp->bits, sz, nbits);
  }
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
362
363
364
365
366
367
368
369
370
371
372
373
  #if MAX_NUMNODES > 1
  #define for_each_node_mask(node, mask)			\
  	for ((node) = first_node(mask);			\
  		(node) < MAX_NUMNODES;			\
  		(node) = next_node((node), (mask)))
  #else /* MAX_NUMNODES == 1 */
  #define for_each_node_mask(node, mask)			\
  	if (!nodes_empty(mask))				\
  		for ((node) = 0; (node) < 1; (node)++)
  #endif /* MAX_NUMNODES */
  
  /*
138089107   Christoph Lameter   Memoryless nodes:...
374
375
376
   * Bitmasks that are kept for all the nodes.
   */
  enum node_states {
7ea1530ab   Christoph Lameter   Memoryless nodes:...
377
378
379
380
381
382
383
384
  	N_POSSIBLE,		/* The node could become online at some point */
  	N_ONLINE,		/* The node is online */
  	N_NORMAL_MEMORY,	/* The node has regular memory */
  #ifdef CONFIG_HIGHMEM
  	N_HIGH_MEMORY,		/* The node has regular or high memory */
  #else
  	N_HIGH_MEMORY = N_NORMAL_MEMORY,
  #endif
20b2f52b7   Lai Jiangshan   numa: add CONFIG_...
385
386
387
  #ifdef CONFIG_MOVABLE_NODE
  	N_MEMORY,		/* The node has memory(regular, high, movable) */
  #else
8219fc48a   Lai Jiangshan   mm: node_states: ...
388
  	N_MEMORY = N_HIGH_MEMORY,
20b2f52b7   Lai Jiangshan   numa: add CONFIG_...
389
  #endif
37c0708db   Christoph Lameter   Memoryless nodes:...
390
  	N_CPU,		/* The node has one or more cpus */
138089107   Christoph Lameter   Memoryless nodes:...
391
392
393
394
  	NR_NODE_STATES
  };
  
  /*
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
395
396
397
   * The following particular system nodemasks and operations
   * on them manage all possible and online nodes.
   */
138089107   Christoph Lameter   Memoryless nodes:...
398
  extern nodemask_t node_states[NR_NODE_STATES];
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
399
400
  
  #if MAX_NUMNODES > 1
138089107   Christoph Lameter   Memoryless nodes:...
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
  static inline int node_state(int node, enum node_states state)
  {
  	return node_isset(node, node_states[state]);
  }
  
  static inline void node_set_state(int node, enum node_states state)
  {
  	__node_set(node, &node_states[state]);
  }
  
  static inline void node_clear_state(int node, enum node_states state)
  {
  	__node_clear(node, &node_states[state]);
  }
  
  static inline int num_node_state(enum node_states state)
  {
  	return nodes_weight(node_states[state]);
  }
  
  #define for_each_node_state(__node, __state) \
  	for_each_node_mask((__node), node_states[__state])
  
  #define first_online_node	first_node(node_states[N_ONLINE])
  #define next_online_node(nid)	next_node((nid), node_states[N_ONLINE])
74c7aa8b8   Christoph Lameter   [PATCH] Replace h...
426
  extern int nr_node_ids;
62bc62a87   Christoph Lameter   page allocator: u...
427
428
429
430
431
432
433
434
435
436
437
438
439
  extern int nr_online_nodes;
  
  static inline void node_set_online(int nid)
  {
  	node_set_state(nid, N_ONLINE);
  	nr_online_nodes = num_node_state(N_ONLINE);
  }
  
  static inline void node_set_offline(int nid)
  {
  	node_clear_state(nid, N_ONLINE);
  	nr_online_nodes = num_node_state(N_ONLINE);
  }
778d3b0ff   Michal Hocko   cpusets: randomiz...
440

1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
441
  #else
138089107   Christoph Lameter   Memoryless nodes:...
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
  
  static inline int node_state(int node, enum node_states state)
  {
  	return node == 0;
  }
  
  static inline void node_set_state(int node, enum node_states state)
  {
  }
  
  static inline void node_clear_state(int node, enum node_states state)
  {
  }
  
  static inline int num_node_state(enum node_states state)
  {
  	return 1;
  }
  
  #define for_each_node_state(node, __state) \
  	for ( (node) = 0; (node) == 0; (node) = 1)
8357f8695   KAMEZAWA Hiroyuki   [PATCH] define fo...
463
464
  #define first_online_node	0
  #define next_online_node(nid)	(MAX_NUMNODES)
74c7aa8b8   Christoph Lameter   [PATCH] Replace h...
465
  #define nr_node_ids		1
62bc62a87   Christoph Lameter   page allocator: u...
466
  #define nr_online_nodes		1
138089107   Christoph Lameter   Memoryless nodes:...
467

62bc62a87   Christoph Lameter   page allocator: u...
468
469
  #define node_set_online(node)	   node_set_state((node), N_ONLINE)
  #define node_set_offline(node)	   node_clear_state((node), N_ONLINE)
778d3b0ff   Michal Hocko   cpusets: randomiz...
470
471
472
473
474
475
476
477
478
479
  
  #endif
  
  #if defined(CONFIG_NUMA) && (MAX_NUMNODES > 1)
  extern int node_random(const nodemask_t *maskp);
  #else
  static inline int node_random(const nodemask_t *mask)
  {
  	return 0;
  }
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
480
  #endif
138089107   Christoph Lameter   Memoryless nodes:...
481
482
  #define node_online_map 	node_states[N_ONLINE]
  #define node_possible_map 	node_states[N_POSSIBLE]
138089107   Christoph Lameter   Memoryless nodes:...
483
484
485
486
  #define num_online_nodes()	num_node_state(N_ONLINE)
  #define num_possible_nodes()	num_node_state(N_POSSIBLE)
  #define node_online(node)	node_state((node), N_ONLINE)
  #define node_possible(node)	node_state((node), N_POSSIBLE)
138089107   Christoph Lameter   Memoryless nodes:...
487
488
  #define for_each_node(node)	   for_each_node_state(node, N_POSSIBLE)
  #define for_each_online_node(node) for_each_node_state(node, N_ONLINE)
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
489

4bfc44958   KAMEZAWA Hiroyuki   mm: make set_memp...
490
  /*
bad44b5be   David Rientjes   mm: add gfp flags...
491
492
493
   * For nodemask scrach area.
   * NODEMASK_ALLOC(type, name) allocates an object with a specified type and
   * name.
4bfc44958   KAMEZAWA Hiroyuki   mm: make set_memp...
494
   */
bad44b5be   David Rientjes   mm: add gfp flags...
495
496
497
498
  #if NODES_SHIFT > 8 /* nodemask_t > 256 bytes */
  #define NODEMASK_ALLOC(type, name, gfp_flags)	\
  			type *name = kmalloc(sizeof(*name), gfp_flags)
  #define NODEMASK_FREE(m)			kfree(m)
4bfc44958   KAMEZAWA Hiroyuki   mm: make set_memp...
499
  #else
7baab93f9   Miao Xie   nodemask: fix the...
500
  #define NODEMASK_ALLOC(type, name, gfp_flags)	type _##name, *name = &_##name
bad44b5be   David Rientjes   mm: add gfp flags...
501
  #define NODEMASK_FREE(m)			do {} while (0)
4bfc44958   KAMEZAWA Hiroyuki   mm: make set_memp...
502
503
504
505
506
507
508
  #endif
  
  /* A example struture for using NODEMASK_ALLOC, used in mempolicy. */
  struct nodemask_scratch {
  	nodemask_t	mask1;
  	nodemask_t	mask2;
  };
bad44b5be   David Rientjes   mm: add gfp flags...
509
510
511
  #define NODEMASK_SCRATCH(x)						\
  			NODEMASK_ALLOC(struct nodemask_scratch, x,	\
  					GFP_KERNEL | __GFP_NORETRY)
4e7b8a6ce   David Rientjes   nodemask: make NO...
512
  #define NODEMASK_SCRATCH_FREE(x)	NODEMASK_FREE(x)
4bfc44958   KAMEZAWA Hiroyuki   mm: make set_memp...
513

1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
514
  #endif /* __LINUX_NODEMASK_H */