cpumask.h 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522
  1. #ifndef __LINUX_CPUMASK_H
  2. #define __LINUX_CPUMASK_H
  3. /*
  4. * Cpumasks provide a bitmap suitable for representing the
  5. * set of CPU's in a system, one bit position per CPU number.
  6. *
  7. * See detailed comments in the file linux/bitmap.h describing the
  8. * data type on which these cpumasks are based.
  9. *
  10. * For details of cpumask_scnprintf() and cpumask_parse_user(),
  11. * see bitmap_scnprintf() and bitmap_parse_user() in lib/bitmap.c.
  12. * For details of cpulist_scnprintf() and cpulist_parse(), see
  13. * bitmap_scnlistprintf() and bitmap_parselist(), also in bitmap.c.
  14. * For details of cpu_remap(), see bitmap_bitremap in lib/bitmap.c
  15. * For details of cpus_remap(), see bitmap_remap in lib/bitmap.c.
  16. * For details of cpus_onto(), see bitmap_onto in lib/bitmap.c.
  17. * For details of cpus_fold(), see bitmap_fold in lib/bitmap.c.
  18. *
  19. * . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  20. * Note: The alternate operations with the suffix "_nr" are used
  21. * to limit the range of the loop to nr_cpu_ids instead of
  22. * NR_CPUS when NR_CPUS > 64 for performance reasons.
  23. * If NR_CPUS is <= 64 then most assembler bitmask
  24. * operators execute faster with a constant range, so
  25. * the operator will continue to use NR_CPUS.
  26. *
  27. * Another consideration is that nr_cpu_ids is initialized
  28. * to NR_CPUS and isn't lowered until the possible cpus are
  29. * discovered (including any disabled cpus). So early uses
  30. * will span the entire range of NR_CPUS.
  31. * . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
  32. *
  33. * The available cpumask operations are:
  34. *
  35. * void cpu_set(cpu, mask) turn on bit 'cpu' in mask
  36. * void cpu_clear(cpu, mask) turn off bit 'cpu' in mask
  37. * void cpus_setall(mask) set all bits
  38. * void cpus_clear(mask) clear all bits
  39. * int cpu_isset(cpu, mask) true iff bit 'cpu' set in mask
  40. * int cpu_test_and_set(cpu, mask) test and set bit 'cpu' in mask
  41. *
  42. * void cpus_and(dst, src1, src2) dst = src1 & src2 [intersection]
  43. * void cpus_or(dst, src1, src2) dst = src1 | src2 [union]
  44. * void cpus_xor(dst, src1, src2) dst = src1 ^ src2
  45. * void cpus_andnot(dst, src1, src2) dst = src1 & ~src2
  46. * void cpus_complement(dst, src) dst = ~src
  47. *
  48. * int cpus_equal(mask1, mask2) Does mask1 == mask2?
  49. * int cpus_intersects(mask1, mask2) Do mask1 and mask2 intersect?
  50. * int cpus_subset(mask1, mask2) Is mask1 a subset of mask2?
  51. * int cpus_empty(mask) Is mask empty (no bits sets)?
  52. * int cpus_full(mask) Is mask full (all bits sets)?
  53. * int cpus_weight(mask) Hamming weigh - number of set bits
  54. * int cpus_weight_nr(mask) Same using nr_cpu_ids instead of NR_CPUS
  55. *
  56. * void cpus_shift_right(dst, src, n) Shift right
  57. * void cpus_shift_left(dst, src, n) Shift left
  58. *
  59. * int first_cpu(mask) Number lowest set bit, or NR_CPUS
  60. * int next_cpu(cpu, mask) Next cpu past 'cpu', or NR_CPUS
  61. * int next_cpu_nr(cpu, mask) Next cpu past 'cpu', or nr_cpu_ids
  62. *
  63. * cpumask_t cpumask_of_cpu(cpu) Return cpumask with bit 'cpu' set
  64. *ifdef CONFIG_HAS_CPUMASK_OF_CPU
  65. * cpumask_of_cpu_ptr_declare(v) Declares cpumask_t *v
  66. * cpumask_of_cpu_ptr_next(v, cpu) Sets v = &cpumask_of_cpu_map[cpu]
  67. * cpumask_of_cpu_ptr(v, cpu) Combines above two operations
  68. *else
  69. * cpumask_of_cpu_ptr_declare(v) Declares cpumask_t _v and *v = &_v
  70. * cpumask_of_cpu_ptr_next(v, cpu) Sets _v = cpumask_of_cpu(cpu)
  71. * cpumask_of_cpu_ptr(v, cpu) Combines above two operations
  72. *endif
  73. * CPU_MASK_ALL Initializer - all bits set
  74. * CPU_MASK_NONE Initializer - no bits set
  75. * unsigned long *cpus_addr(mask) Array of unsigned long's in mask
  76. *
  77. *if NR_CPUS > BITS_PER_LONG
  78. * CPUMASK_ALLOC(m) Declares and allocates struct m *m =
  79. * (struct m *)kmalloc(sizeof(*m), ...)
  80. * CPUMASK_FREE(m) Macro for kfree(v)
  81. *else
  82. * CPUMASK_ALLOC(m) Declares struct m _m, *m = &_m
  83. * CPUMASK_FREE(m) Nop
  84. *endif
  85. * CPUMASK_VAR(v, m) Declares cpumask_t *v =
  86. * m + offset(struct m, v)
  87. *
  88. * int cpumask_scnprintf(buf, len, mask) Format cpumask for printing
  89. * int cpumask_parse_user(ubuf, ulen, mask) Parse ascii string as cpumask
  90. * int cpulist_scnprintf(buf, len, mask) Format cpumask as list for printing
  91. * int cpulist_parse(buf, map) Parse ascii string as cpulist
  92. * int cpu_remap(oldbit, old, new) newbit = map(old, new)(oldbit)
  93. * void cpus_remap(dst, src, old, new) *dst = map(old, new)(src)
  94. * void cpus_onto(dst, orig, relmap) *dst = orig relative to relmap
  95. * void cpus_fold(dst, orig, sz) dst bits = orig bits mod sz
  96. *
  97. * for_each_cpu_mask(cpu, mask) for-loop cpu over mask using NR_CPUS
  98. * for_each_cpu_mask_nr(cpu, mask) for-loop cpu over mask using nr_cpu_ids
  99. *
  100. * int num_online_cpus() Number of online CPUs
  101. * int num_possible_cpus() Number of all possible CPUs
  102. * int num_present_cpus() Number of present CPUs
  103. *
  104. * int cpu_online(cpu) Is some cpu online?
  105. * int cpu_possible(cpu) Is some cpu possible?
  106. * int cpu_present(cpu) Is some cpu present (can schedule)?
  107. *
  108. * int any_online_cpu(mask) First online cpu in mask
  109. *
  110. * for_each_possible_cpu(cpu) for-loop cpu over cpu_possible_map
  111. * for_each_online_cpu(cpu) for-loop cpu over cpu_online_map
  112. * for_each_present_cpu(cpu) for-loop cpu over cpu_present_map
  113. *
  114. * Subtlety:
  115. * 1) The 'type-checked' form of cpu_isset() causes gcc (3.3.2, anyway)
  116. * to generate slightly worse code. Note for example the additional
  117. * 40 lines of assembly code compiling the "for each possible cpu"
  118. * loops buried in the disk_stat_read() macros calls when compiling
  119. * drivers/block/genhd.c (arch i386, CONFIG_SMP=y). So use a simple
  120. * one-line #define for cpu_isset(), instead of wrapping an inline
  121. * inside a macro, the way we do the other calls.
  122. */
  123. #include <linux/kernel.h>
  124. #include <linux/threads.h>
  125. #include <linux/bitmap.h>
  126. typedef struct { DECLARE_BITMAP(bits, NR_CPUS); } cpumask_t;
  127. extern cpumask_t _unused_cpumask_arg_;
  128. #define cpu_set(cpu, dst) __cpu_set((cpu), &(dst))
  129. static inline void __cpu_set(int cpu, volatile cpumask_t *dstp)
  130. {
  131. set_bit(cpu, dstp->bits);
  132. }
  133. #define cpu_clear(cpu, dst) __cpu_clear((cpu), &(dst))
  134. static inline void __cpu_clear(int cpu, volatile cpumask_t *dstp)
  135. {
  136. clear_bit(cpu, dstp->bits);
  137. }
  138. #define cpus_setall(dst) __cpus_setall(&(dst), NR_CPUS)
  139. static inline void __cpus_setall(cpumask_t *dstp, int nbits)
  140. {
  141. bitmap_fill(dstp->bits, nbits);
  142. }
  143. #define cpus_clear(dst) __cpus_clear(&(dst), NR_CPUS)
  144. static inline void __cpus_clear(cpumask_t *dstp, int nbits)
  145. {
  146. bitmap_zero(dstp->bits, nbits);
  147. }
  148. /* No static inline type checking - see Subtlety (1) above. */
  149. #define cpu_isset(cpu, cpumask) test_bit((cpu), (cpumask).bits)
  150. #define cpu_test_and_set(cpu, cpumask) __cpu_test_and_set((cpu), &(cpumask))
  151. static inline int __cpu_test_and_set(int cpu, cpumask_t *addr)
  152. {
  153. return test_and_set_bit(cpu, addr->bits);
  154. }
  155. #define cpus_and(dst, src1, src2) __cpus_and(&(dst), &(src1), &(src2), NR_CPUS)
  156. static inline void __cpus_and(cpumask_t *dstp, const cpumask_t *src1p,
  157. const cpumask_t *src2p, int nbits)
  158. {
  159. bitmap_and(dstp->bits, src1p->bits, src2p->bits, nbits);
  160. }
  161. #define cpus_or(dst, src1, src2) __cpus_or(&(dst), &(src1), &(src2), NR_CPUS)
  162. static inline void __cpus_or(cpumask_t *dstp, const cpumask_t *src1p,
  163. const cpumask_t *src2p, int nbits)
  164. {
  165. bitmap_or(dstp->bits, src1p->bits, src2p->bits, nbits);
  166. }
  167. #define cpus_xor(dst, src1, src2) __cpus_xor(&(dst), &(src1), &(src2), NR_CPUS)
  168. static inline void __cpus_xor(cpumask_t *dstp, const cpumask_t *src1p,
  169. const cpumask_t *src2p, int nbits)
  170. {
  171. bitmap_xor(dstp->bits, src1p->bits, src2p->bits, nbits);
  172. }
  173. #define cpus_andnot(dst, src1, src2) \
  174. __cpus_andnot(&(dst), &(src1), &(src2), NR_CPUS)
  175. static inline void __cpus_andnot(cpumask_t *dstp, const cpumask_t *src1p,
  176. const cpumask_t *src2p, int nbits)
  177. {
  178. bitmap_andnot(dstp->bits, src1p->bits, src2p->bits, nbits);
  179. }
  180. #define cpus_complement(dst, src) __cpus_complement(&(dst), &(src), NR_CPUS)
  181. static inline void __cpus_complement(cpumask_t *dstp,
  182. const cpumask_t *srcp, int nbits)
  183. {
  184. bitmap_complement(dstp->bits, srcp->bits, nbits);
  185. }
  186. #define cpus_equal(src1, src2) __cpus_equal(&(src1), &(src2), NR_CPUS)
  187. static inline int __cpus_equal(const cpumask_t *src1p,
  188. const cpumask_t *src2p, int nbits)
  189. {
  190. return bitmap_equal(src1p->bits, src2p->bits, nbits);
  191. }
  192. #define cpus_intersects(src1, src2) __cpus_intersects(&(src1), &(src2), NR_CPUS)
  193. static inline int __cpus_intersects(const cpumask_t *src1p,
  194. const cpumask_t *src2p, int nbits)
  195. {
  196. return bitmap_intersects(src1p->bits, src2p->bits, nbits);
  197. }
  198. #define cpus_subset(src1, src2) __cpus_subset(&(src1), &(src2), NR_CPUS)
  199. static inline int __cpus_subset(const cpumask_t *src1p,
  200. const cpumask_t *src2p, int nbits)
  201. {
  202. return bitmap_subset(src1p->bits, src2p->bits, nbits);
  203. }
  204. #define cpus_empty(src) __cpus_empty(&(src), NR_CPUS)
  205. static inline int __cpus_empty(const cpumask_t *srcp, int nbits)
  206. {
  207. return bitmap_empty(srcp->bits, nbits);
  208. }
  209. #define cpus_full(cpumask) __cpus_full(&(cpumask), NR_CPUS)
  210. static inline int __cpus_full(const cpumask_t *srcp, int nbits)
  211. {
  212. return bitmap_full(srcp->bits, nbits);
  213. }
  214. #define cpus_weight(cpumask) __cpus_weight(&(cpumask), NR_CPUS)
  215. static inline int __cpus_weight(const cpumask_t *srcp, int nbits)
  216. {
  217. return bitmap_weight(srcp->bits, nbits);
  218. }
  219. #define cpus_shift_right(dst, src, n) \
  220. __cpus_shift_right(&(dst), &(src), (n), NR_CPUS)
  221. static inline void __cpus_shift_right(cpumask_t *dstp,
  222. const cpumask_t *srcp, int n, int nbits)
  223. {
  224. bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);
  225. }
  226. #define cpus_shift_left(dst, src, n) \
  227. __cpus_shift_left(&(dst), &(src), (n), NR_CPUS)
  228. static inline void __cpus_shift_left(cpumask_t *dstp,
  229. const cpumask_t *srcp, int n, int nbits)
  230. {
  231. bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);
  232. }
  233. #ifdef CONFIG_HAVE_CPUMASK_OF_CPU_MAP
  234. extern cpumask_t *cpumask_of_cpu_map;
  235. #define cpumask_of_cpu(cpu) (cpumask_of_cpu_map[cpu])
  236. #define cpumask_of_cpu_ptr(v, cpu) \
  237. const cpumask_t *v = &cpumask_of_cpu(cpu)
  238. #define cpumask_of_cpu_ptr_declare(v) \
  239. const cpumask_t *v
  240. #define cpumask_of_cpu_ptr_next(v, cpu) \
  241. v = &cpumask_of_cpu(cpu)
  242. #else
  243. #define cpumask_of_cpu(cpu) \
  244. ({ \
  245. typeof(_unused_cpumask_arg_) m; \
  246. if (sizeof(m) == sizeof(unsigned long)) { \
  247. m.bits[0] = 1UL<<(cpu); \
  248. } else { \
  249. cpus_clear(m); \
  250. cpu_set((cpu), m); \
  251. } \
  252. m; \
  253. })
  254. #define cpumask_of_cpu_ptr(v, cpu) \
  255. cpumask_t _##v = cpumask_of_cpu(cpu); \
  256. const cpumask_t *v = &_##v
  257. #define cpumask_of_cpu_ptr_declare(v) \
  258. cpumask_t _##v; \
  259. const cpumask_t *v = &_##v
  260. #define cpumask_of_cpu_ptr_next(v, cpu) \
  261. _##v = cpumask_of_cpu(cpu)
  262. #endif
  263. #define CPU_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(NR_CPUS)
  264. #if NR_CPUS <= BITS_PER_LONG
  265. #define CPU_MASK_ALL \
  266. (cpumask_t) { { \
  267. [BITS_TO_LONGS(NR_CPUS)-1] = CPU_MASK_LAST_WORD \
  268. } }
  269. #define CPU_MASK_ALL_PTR (&CPU_MASK_ALL)
  270. #else
  271. #define CPU_MASK_ALL \
  272. (cpumask_t) { { \
  273. [0 ... BITS_TO_LONGS(NR_CPUS)-2] = ~0UL, \
  274. [BITS_TO_LONGS(NR_CPUS)-1] = CPU_MASK_LAST_WORD \
  275. } }
  276. /* cpu_mask_all is in init/main.c */
  277. extern cpumask_t cpu_mask_all;
  278. #define CPU_MASK_ALL_PTR (&cpu_mask_all)
  279. #endif
  280. #define CPU_MASK_NONE \
  281. (cpumask_t) { { \
  282. [0 ... BITS_TO_LONGS(NR_CPUS)-1] = 0UL \
  283. } }
  284. #define CPU_MASK_CPU0 \
  285. (cpumask_t) { { \
  286. [0] = 1UL \
  287. } }
  288. #define cpus_addr(src) ((src).bits)
  289. #if NR_CPUS > BITS_PER_LONG
  290. #define CPUMASK_ALLOC(m) struct m *m = kmalloc(sizeof(*m), GFP_KERNEL)
  291. #define CPUMASK_FREE(m) kfree(m)
  292. #else
  293. #define CPUMASK_ALLOC(m) struct allmasks _m, *m = &_m
  294. #define CPUMASK_FREE(m)
  295. #endif
  296. #define CPUMASK_VAR(v, m) cpumask_t *v = (cpumask_t *) \
  297. ((unsigned long)(m) + offsetof(struct m, v))
  298. #define cpumask_scnprintf(buf, len, src) \
  299. __cpumask_scnprintf((buf), (len), &(src), NR_CPUS)
  300. static inline int __cpumask_scnprintf(char *buf, int len,
  301. const cpumask_t *srcp, int nbits)
  302. {
  303. return bitmap_scnprintf(buf, len, srcp->bits, nbits);
  304. }
  305. #define cpumask_parse_user(ubuf, ulen, dst) \
  306. __cpumask_parse_user((ubuf), (ulen), &(dst), NR_CPUS)
  307. static inline int __cpumask_parse_user(const char __user *buf, int len,
  308. cpumask_t *dstp, int nbits)
  309. {
  310. return bitmap_parse_user(buf, len, dstp->bits, nbits);
  311. }
  312. #define cpulist_scnprintf(buf, len, src) \
  313. __cpulist_scnprintf((buf), (len), &(src), NR_CPUS)
  314. static inline int __cpulist_scnprintf(char *buf, int len,
  315. const cpumask_t *srcp, int nbits)
  316. {
  317. return bitmap_scnlistprintf(buf, len, srcp->bits, nbits);
  318. }
  319. #define cpulist_parse(buf, dst) __cpulist_parse((buf), &(dst), NR_CPUS)
  320. static inline int __cpulist_parse(const char *buf, cpumask_t *dstp, int nbits)
  321. {
  322. return bitmap_parselist(buf, dstp->bits, nbits);
  323. }
  324. #define cpu_remap(oldbit, old, new) \
  325. __cpu_remap((oldbit), &(old), &(new), NR_CPUS)
  326. static inline int __cpu_remap(int oldbit,
  327. const cpumask_t *oldp, const cpumask_t *newp, int nbits)
  328. {
  329. return bitmap_bitremap(oldbit, oldp->bits, newp->bits, nbits);
  330. }
  331. #define cpus_remap(dst, src, old, new) \
  332. __cpus_remap(&(dst), &(src), &(old), &(new), NR_CPUS)
  333. static inline void __cpus_remap(cpumask_t *dstp, const cpumask_t *srcp,
  334. const cpumask_t *oldp, const cpumask_t *newp, int nbits)
  335. {
  336. bitmap_remap(dstp->bits, srcp->bits, oldp->bits, newp->bits, nbits);
  337. }
  338. #define cpus_onto(dst, orig, relmap) \
  339. __cpus_onto(&(dst), &(orig), &(relmap), NR_CPUS)
  340. static inline void __cpus_onto(cpumask_t *dstp, const cpumask_t *origp,
  341. const cpumask_t *relmapp, int nbits)
  342. {
  343. bitmap_onto(dstp->bits, origp->bits, relmapp->bits, nbits);
  344. }
  345. #define cpus_fold(dst, orig, sz) \
  346. __cpus_fold(&(dst), &(orig), sz, NR_CPUS)
  347. static inline void __cpus_fold(cpumask_t *dstp, const cpumask_t *origp,
  348. int sz, int nbits)
  349. {
  350. bitmap_fold(dstp->bits, origp->bits, sz, nbits);
  351. }
  352. #if NR_CPUS == 1
  353. #define nr_cpu_ids 1
  354. #define first_cpu(src) ({ (void)(src); 0; })
  355. #define next_cpu(n, src) ({ (void)(src); 1; })
  356. #define any_online_cpu(mask) 0
  357. #define for_each_cpu_mask(cpu, mask) \
  358. for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask)
  359. #else /* NR_CPUS > 1 */
  360. extern int nr_cpu_ids;
  361. int __first_cpu(const cpumask_t *srcp);
  362. int __next_cpu(int n, const cpumask_t *srcp);
  363. int __any_online_cpu(const cpumask_t *mask);
  364. #define first_cpu(src) __first_cpu(&(src))
  365. #define next_cpu(n, src) __next_cpu((n), &(src))
  366. #define any_online_cpu(mask) __any_online_cpu(&(mask))
  367. #define for_each_cpu_mask(cpu, mask) \
  368. for ((cpu) = -1; \
  369. (cpu) = next_cpu((cpu), (mask)), \
  370. (cpu) < NR_CPUS; )
  371. #endif
  372. #if NR_CPUS <= 64
  373. #define next_cpu_nr(n, src) next_cpu(n, src)
  374. #define cpus_weight_nr(cpumask) cpus_weight(cpumask)
  375. #define for_each_cpu_mask_nr(cpu, mask) for_each_cpu_mask(cpu, mask)
  376. #else /* NR_CPUS > 64 */
  377. int __next_cpu_nr(int n, const cpumask_t *srcp);
  378. #define next_cpu_nr(n, src) __next_cpu_nr((n), &(src))
  379. #define cpus_weight_nr(cpumask) __cpus_weight(&(cpumask), nr_cpu_ids)
  380. #define for_each_cpu_mask_nr(cpu, mask) \
  381. for ((cpu) = -1; \
  382. (cpu) = next_cpu_nr((cpu), (mask)), \
  383. (cpu) < nr_cpu_ids; )
  384. #endif /* NR_CPUS > 64 */
  385. /*
  386. * The following particular system cpumasks and operations manage
  387. * possible, present and online cpus. Each of them is a fixed size
  388. * bitmap of size NR_CPUS.
  389. *
  390. * #ifdef CONFIG_HOTPLUG_CPU
  391. * cpu_possible_map - has bit 'cpu' set iff cpu is populatable
  392. * cpu_present_map - has bit 'cpu' set iff cpu is populated
  393. * cpu_online_map - has bit 'cpu' set iff cpu available to scheduler
  394. * #else
  395. * cpu_possible_map - has bit 'cpu' set iff cpu is populated
  396. * cpu_present_map - copy of cpu_possible_map
  397. * cpu_online_map - has bit 'cpu' set iff cpu available to scheduler
  398. * #endif
  399. *
  400. * In either case, NR_CPUS is fixed at compile time, as the static
  401. * size of these bitmaps. The cpu_possible_map is fixed at boot
  402. * time, as the set of CPU id's that it is possible might ever
  403. * be plugged in at anytime during the life of that system boot.
  404. * The cpu_present_map is dynamic(*), representing which CPUs
  405. * are currently plugged in. And cpu_online_map is the dynamic
  406. * subset of cpu_present_map, indicating those CPUs available
  407. * for scheduling.
  408. *
  409. * If HOTPLUG is enabled, then cpu_possible_map is forced to have
  410. * all NR_CPUS bits set, otherwise it is just the set of CPUs that
  411. * ACPI reports present at boot.
  412. *
  413. * If HOTPLUG is enabled, then cpu_present_map varies dynamically,
  414. * depending on what ACPI reports as currently plugged in, otherwise
  415. * cpu_present_map is just a copy of cpu_possible_map.
  416. *
  417. * (*) Well, cpu_present_map is dynamic in the hotplug case. If not
  418. * hotplug, it's a copy of cpu_possible_map, hence fixed at boot.
  419. *
  420. * Subtleties:
  421. * 1) UP arch's (NR_CPUS == 1, CONFIG_SMP not defined) hardcode
  422. * assumption that their single CPU is online. The UP
  423. * cpu_{online,possible,present}_maps are placebos. Changing them
  424. * will have no useful affect on the following num_*_cpus()
  425. * and cpu_*() macros in the UP case. This ugliness is a UP
  426. * optimization - don't waste any instructions or memory references
  427. * asking if you're online or how many CPUs there are if there is
  428. * only one CPU.
  429. * 2) Most SMP arch's #define some of these maps to be some
  430. * other map specific to that arch. Therefore, the following
  431. * must be #define macros, not inlines. To see why, examine
  432. * the assembly code produced by the following. Note that
  433. * set1() writes phys_x_map, but set2() writes x_map:
  434. * int x_map, phys_x_map;
  435. * #define set1(a) x_map = a
  436. * inline void set2(int a) { x_map = a; }
  437. * #define x_map phys_x_map
  438. * main(){ set1(3); set2(5); }
  439. */
  440. extern cpumask_t cpu_possible_map;
  441. extern cpumask_t cpu_online_map;
  442. extern cpumask_t cpu_present_map;
  443. #if NR_CPUS > 1
  444. #define num_online_cpus() cpus_weight_nr(cpu_online_map)
  445. #define num_possible_cpus() cpus_weight_nr(cpu_possible_map)
  446. #define num_present_cpus() cpus_weight_nr(cpu_present_map)
  447. #define cpu_online(cpu) cpu_isset((cpu), cpu_online_map)
  448. #define cpu_possible(cpu) cpu_isset((cpu), cpu_possible_map)
  449. #define cpu_present(cpu) cpu_isset((cpu), cpu_present_map)
  450. #else
  451. #define num_online_cpus() 1
  452. #define num_possible_cpus() 1
  453. #define num_present_cpus() 1
  454. #define cpu_online(cpu) ((cpu) == 0)
  455. #define cpu_possible(cpu) ((cpu) == 0)
  456. #define cpu_present(cpu) ((cpu) == 0)
  457. #endif
  458. #define cpu_is_offline(cpu) unlikely(!cpu_online(cpu))
  459. #define for_each_possible_cpu(cpu) for_each_cpu_mask_nr((cpu), cpu_possible_map)
  460. #define for_each_online_cpu(cpu) for_each_cpu_mask_nr((cpu), cpu_online_map)
  461. #define for_each_present_cpu(cpu) for_each_cpu_mask_nr((cpu), cpu_present_map)
  462. #endif /* __LINUX_CPUMASK_H */