blob: f0d895d6ac39f1b1d8a45c54ec00eb66ec113224 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002#ifndef __LINUX_CPUMASK_H
3#define __LINUX_CPUMASK_H
4
5/*
6 * Cpumasks provide a bitmap suitable for representing the
Rusty Russell6ba2ef72009-09-24 09:34:53 -06007 * set of CPU's in a system, one bit position per CPU number. In general,
8 * only nr_cpu_ids (<= NR_CPUS) bits are valid.
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070010#include <linux/kernel.h>
11#include <linux/threads.h>
12#include <linux/bitmap.h>
Thomas Gleixner0c09ab92019-07-09 16:23:40 +020013#include <linux/atomic.h>
Paul Gortmaker187f1882011-11-23 20:12:59 -050014#include <linux/bug.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015
Rusty Russellcdfdef72015-03-05 10:49:19 +103016/* Don't assign or return these: may not be this big! */
Rusty Russell2d3854a2008-11-05 13:39:10 +110017typedef struct cpumask { DECLARE_BITMAP(bits, NR_CPUS); } cpumask_t;
Linus Torvalds1da177e2005-04-16 15:20:36 -070018
Rusty Russellae7a47e2008-12-30 09:05:15 +103019/**
Rusty Russell6ba2ef72009-09-24 09:34:53 -060020 * cpumask_bits - get the bits in a cpumask
21 * @maskp: the struct cpumask *
Rusty Russellae7a47e2008-12-30 09:05:15 +103022 *
Rusty Russell6ba2ef72009-09-24 09:34:53 -060023 * You should only assume nr_cpu_ids bits of this mask are valid. This is
24 * a macro so it's const-correct.
Rusty Russellae7a47e2008-12-30 09:05:15 +103025 */
Rusty Russell6ba2ef72009-09-24 09:34:53 -060026#define cpumask_bits(maskp) ((maskp)->bits)
Paul Jackson7ea931c2008-04-28 02:12:29 -070027
Tejun Heof1bbc032015-02-13 14:36:57 -080028/**
29 * cpumask_pr_args - printf args to output a cpumask
30 * @maskp: cpumask to be printed
31 *
32 * Can be used to provide arguments for '%*pb[l]' when printing a cpumask.
33 */
34#define cpumask_pr_args(maskp) nr_cpu_ids, cpumask_bits(maskp)
35
Mike Travis41df0d612008-05-12 21:21:13 +020036#if NR_CPUS == 1
Alexey Dobriyan9b130ad2017-09-08 16:14:18 -070037#define nr_cpu_ids 1U
Rusty Russell6ba2ef72009-09-24 09:34:53 -060038#else
Alexey Dobriyan9b130ad2017-09-08 16:14:18 -070039extern unsigned int nr_cpu_ids;
Mike Travis41df0d612008-05-12 21:21:13 +020040#endif
41
Rusty Russell6ba2ef72009-09-24 09:34:53 -060042#ifdef CONFIG_CPUMASK_OFFSTACK
43/* Assuming NR_CPUS is huge, a runtime limit is more efficient. Also,
44 * not all bits may be allocated. */
Alexey Dobriyan9b130ad2017-09-08 16:14:18 -070045#define nr_cpumask_bits nr_cpu_ids
Rusty Russell6ba2ef72009-09-24 09:34:53 -060046#else
Alexey Dobriyanc311c792017-05-08 15:56:15 -070047#define nr_cpumask_bits ((unsigned int)NR_CPUS)
Rusty Russell6ba2ef72009-09-24 09:34:53 -060048#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070049
50/*
51 * The following particular system cpumasks and operations manage
Rusty Russellb3199c02008-12-30 09:05:14 +103052 * possible, present, active and online cpus.
Linus Torvalds1da177e2005-04-16 15:20:36 -070053 *
Rusty Russellb3199c02008-12-30 09:05:14 +103054 * cpu_possible_mask- has bit 'cpu' set iff cpu is populatable
55 * cpu_present_mask - has bit 'cpu' set iff cpu is populated
56 * cpu_online_mask - has bit 'cpu' set iff cpu available to scheduler
57 * cpu_active_mask - has bit 'cpu' set iff cpu available to migration
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 *
Rusty Russellb3199c02008-12-30 09:05:14 +103059 * If !CONFIG_HOTPLUG_CPU, present == possible, and active == online.
Linus Torvalds1da177e2005-04-16 15:20:36 -070060 *
Rusty Russellb3199c02008-12-30 09:05:14 +103061 * The cpu_possible_mask is fixed at boot time, as the set of CPU id's
62 * that it is possible might ever be plugged in at anytime during the
63 * life of that system boot. The cpu_present_mask is dynamic(*),
64 * representing which CPUs are currently plugged in. And
65 * cpu_online_mask is the dynamic subset of cpu_present_mask,
66 * indicating those CPUs available for scheduling.
67 *
68 * If HOTPLUG is enabled, then cpu_possible_mask is forced to have
Linus Torvalds1da177e2005-04-16 15:20:36 -070069 * all NR_CPUS bits set, otherwise it is just the set of CPUs that
70 * ACPI reports present at boot.
71 *
Rusty Russellb3199c02008-12-30 09:05:14 +103072 * If HOTPLUG is enabled, then cpu_present_mask varies dynamically,
Linus Torvalds1da177e2005-04-16 15:20:36 -070073 * depending on what ACPI reports as currently plugged in, otherwise
Rusty Russellb3199c02008-12-30 09:05:14 +103074 * cpu_present_mask is just a copy of cpu_possible_mask.
Linus Torvalds1da177e2005-04-16 15:20:36 -070075 *
Rusty Russellb3199c02008-12-30 09:05:14 +103076 * (*) Well, cpu_present_mask is dynamic in the hotplug case. If not
77 * hotplug, it's a copy of cpu_possible_mask, hence fixed at boot.
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 *
79 * Subtleties:
80 * 1) UP arch's (NR_CPUS == 1, CONFIG_SMP not defined) hardcode
81 * assumption that their single CPU is online. The UP
Rusty Russellb3199c02008-12-30 09:05:14 +103082 * cpu_{online,possible,present}_masks are placebos. Changing them
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 * will have no useful affect on the following num_*_cpus()
84 * and cpu_*() macros in the UP case. This ugliness is a UP
85 * optimization - don't waste any instructions or memory references
86 * asking if you're online or how many CPUs there are if there is
87 * only one CPU.
Linus Torvalds1da177e2005-04-16 15:20:36 -070088 */
89
Rasmus Villemoes4b804c82016-01-20 15:00:19 -080090extern struct cpumask __cpu_possible_mask;
91extern struct cpumask __cpu_online_mask;
92extern struct cpumask __cpu_present_mask;
93extern struct cpumask __cpu_active_mask;
Rasmus Villemoes5aec01b2016-01-20 15:00:25 -080094#define cpu_possible_mask ((const struct cpumask *)&__cpu_possible_mask)
95#define cpu_online_mask ((const struct cpumask *)&__cpu_online_mask)
96#define cpu_present_mask ((const struct cpumask *)&__cpu_present_mask)
97#define cpu_active_mask ((const struct cpumask *)&__cpu_active_mask)
Rusty Russellb3199c02008-12-30 09:05:14 +103098
Thomas Gleixner0c09ab92019-07-09 16:23:40 +020099extern atomic_t __num_online_cpus;
100
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101#if NR_CPUS > 1
Thomas Gleixner0c09ab92019-07-09 16:23:40 +0200102/**
103 * num_online_cpus() - Read the number of online CPUs
104 *
105 * Despite the fact that __num_online_cpus is of type atomic_t, this
106 * interface gives only a momentary snapshot and is not protected against
107 * concurrent CPU hotplug operations unless invoked from a cpuhp_lock held
108 * region.
109 */
110static inline unsigned int num_online_cpus(void)
111{
112 return atomic_read(&__num_online_cpus);
113}
Rusty Russellae7a47e2008-12-30 09:05:15 +1030114#define num_possible_cpus() cpumask_weight(cpu_possible_mask)
115#define num_present_cpus() cpumask_weight(cpu_present_mask)
Peter Zijlstra6ad4c182009-11-25 13:31:39 +0100116#define num_active_cpus() cpumask_weight(cpu_active_mask)
Rusty Russellae7a47e2008-12-30 09:05:15 +1030117#define cpu_online(cpu) cpumask_test_cpu((cpu), cpu_online_mask)
118#define cpu_possible(cpu) cpumask_test_cpu((cpu), cpu_possible_mask)
119#define cpu_present(cpu) cpumask_test_cpu((cpu), cpu_present_mask)
120#define cpu_active(cpu) cpumask_test_cpu((cpu), cpu_active_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121#else
Heiko Carstens221e3eb2010-03-05 13:42:41 -0800122#define num_online_cpus() 1U
123#define num_possible_cpus() 1U
124#define num_present_cpus() 1U
125#define num_active_cpus() 1U
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126#define cpu_online(cpu) ((cpu) == 0)
127#define cpu_possible(cpu) ((cpu) == 0)
128#define cpu_present(cpu) ((cpu) == 0)
Max Krasnyanskye761b772008-07-15 04:43:49 -0700129#define cpu_active(cpu) ((cpu) == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130#endif
131
Thomas Gleixnere797bda2019-07-22 20:47:16 +0200132extern cpumask_t cpus_booted_once_mask;
133
Amritha Nambiar80d19662018-06-29 21:26:41 -0700134static inline void cpu_max_bits_warn(unsigned int cpu, unsigned int bits)
135{
136#ifdef CONFIG_DEBUG_PER_CPU_MAPS
137 WARN_ON_ONCE(cpu >= bits);
138#endif /* CONFIG_DEBUG_PER_CPU_MAPS */
139}
140
Rusty Russell2d3854a2008-11-05 13:39:10 +1100141/* verify cpu argument to cpumask_* operators */
142static inline unsigned int cpumask_check(unsigned int cpu)
143{
Amritha Nambiar80d19662018-06-29 21:26:41 -0700144 cpu_max_bits_warn(cpu, nr_cpumask_bits);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100145 return cpu;
146}
147
148#if NR_CPUS == 1
Rusty Russell984f2f32008-11-08 20:24:19 +1100149/* Uniprocessor. Assume all masks are "1". */
150static inline unsigned int cpumask_first(const struct cpumask *srcp)
151{
152 return 0;
153}
154
Rakib Mullicke22cdc32017-10-23 19:01:54 +0600155static inline unsigned int cpumask_last(const struct cpumask *srcp)
156{
157 return 0;
158}
159
Rusty Russell984f2f32008-11-08 20:24:19 +1100160/* Valid inputs for n are -1 and 0. */
161static inline unsigned int cpumask_next(int n, const struct cpumask *srcp)
162{
163 return n+1;
164}
165
166static inline unsigned int cpumask_next_zero(int n, const struct cpumask *srcp)
167{
168 return n+1;
169}
170
171static inline unsigned int cpumask_next_and(int n,
172 const struct cpumask *srcp,
173 const struct cpumask *andp)
174{
175 return n+1;
176}
177
Willem de Bruijn9af18e52018-08-12 09:14:03 -0400178static inline unsigned int cpumask_next_wrap(int n, const struct cpumask *mask,
179 int start, bool wrap)
180{
181 /* cpu0 unless stop condition, wrap and at cpu0, then nr_cpumask_bits */
182 return (wrap && n == 0);
183}
184
Rusty Russell984f2f32008-11-08 20:24:19 +1100185/* cpu must be a valid cpu, ie 0, so there's no other choice. */
186static inline unsigned int cpumask_any_but(const struct cpumask *mask,
187 unsigned int cpu)
188{
189 return 1;
190}
Rusty Russell2d3854a2008-11-05 13:39:10 +1100191
Rusty Russellf36963c2015-05-09 03:14:13 +0930192static inline unsigned int cpumask_local_spread(unsigned int i, int node)
Amir Vadaida913092014-06-09 10:24:38 +0300193{
Amir Vadaida913092014-06-09 10:24:38 +0300194 return 0;
195}
196
Paul Turner46a87b32020-03-10 18:01:13 -0700197static inline int cpumask_any_and_distribute(const struct cpumask *src1p,
198 const struct cpumask *src2p) {
199 return cpumask_next_and(-1, src1p, src2p);
200}
201
Rusty Russell2d3854a2008-11-05 13:39:10 +1100202#define for_each_cpu(cpu, mask) \
203 for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask)
Paul E. McKenney8bd93a22010-02-22 17:04:59 -0800204#define for_each_cpu_not(cpu, mask) \
205 for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask)
Michael Kelleyd207af22018-02-14 02:54:03 +0000206#define for_each_cpu_wrap(cpu, mask, start) \
207 for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask, (void)(start))
Alexey Dobriyan2a4a4082019-09-25 16:47:30 -0700208#define for_each_cpu_and(cpu, mask1, mask2) \
209 for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask1, (void)mask2)
Rusty Russell2d3854a2008-11-05 13:39:10 +1100210#else
211/**
212 * cpumask_first - get the first cpu in a cpumask
213 * @srcp: the cpumask pointer
214 *
215 * Returns >= nr_cpu_ids if no cpus set.
216 */
217static inline unsigned int cpumask_first(const struct cpumask *srcp)
218{
219 return find_first_bit(cpumask_bits(srcp), nr_cpumask_bits);
220}
221
Rakib Mullicke22cdc32017-10-23 19:01:54 +0600222/**
223 * cpumask_last - get the last CPU in a cpumask
224 * @srcp: - the cpumask pointer
225 *
226 * Returns >= nr_cpumask_bits if no CPUs set.
227 */
228static inline unsigned int cpumask_last(const struct cpumask *srcp)
229{
230 return find_last_bit(cpumask_bits(srcp), nr_cpumask_bits);
231}
232
Alexey Dobriyanf22ef332017-09-08 16:17:15 -0700233unsigned int cpumask_next(int n, const struct cpumask *srcp);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100234
235/**
236 * cpumask_next_zero - get the next unset cpu in a cpumask
237 * @n: the cpu prior to the place to search (ie. return will be > @n)
238 * @srcp: the cpumask pointer
239 *
240 * Returns >= nr_cpu_ids if no further cpus unset.
241 */
242static inline unsigned int cpumask_next_zero(int n, const struct cpumask *srcp)
243{
244 /* -1 is a legal arg here. */
245 if (n != -1)
246 cpumask_check(n);
247 return find_next_zero_bit(cpumask_bits(srcp), nr_cpumask_bits, n+1);
248}
249
250int cpumask_next_and(int n, const struct cpumask *, const struct cpumask *);
251int cpumask_any_but(const struct cpumask *mask, unsigned int cpu);
Rusty Russellf36963c2015-05-09 03:14:13 +0930252unsigned int cpumask_local_spread(unsigned int i, int node);
Paul Turner46a87b32020-03-10 18:01:13 -0700253int cpumask_any_and_distribute(const struct cpumask *src1p,
254 const struct cpumask *src2p);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100255
Rusty Russell984f2f32008-11-08 20:24:19 +1100256/**
257 * for_each_cpu - iterate over every cpu in a mask
258 * @cpu: the (optionally unsigned) integer iterator
259 * @mask: the cpumask pointer
260 *
261 * After the loop, cpu is >= nr_cpu_ids.
262 */
Rusty Russell2d3854a2008-11-05 13:39:10 +1100263#define for_each_cpu(cpu, mask) \
264 for ((cpu) = -1; \
265 (cpu) = cpumask_next((cpu), (mask)), \
266 (cpu) < nr_cpu_ids;)
Rusty Russell984f2f32008-11-08 20:24:19 +1100267
268/**
Paul E. McKenney8bd93a22010-02-22 17:04:59 -0800269 * for_each_cpu_not - iterate over every cpu in a complemented mask
270 * @cpu: the (optionally unsigned) integer iterator
271 * @mask: the cpumask pointer
272 *
273 * After the loop, cpu is >= nr_cpu_ids.
274 */
275#define for_each_cpu_not(cpu, mask) \
276 for ((cpu) = -1; \
277 (cpu) = cpumask_next_zero((cpu), (mask)), \
278 (cpu) < nr_cpu_ids;)
279
Peter Zijlstrac743f0a2017-04-14 14:20:05 +0200280extern int cpumask_next_wrap(int n, const struct cpumask *mask, int start, bool wrap);
281
282/**
283 * for_each_cpu_wrap - iterate over every cpu in a mask, starting at a specified location
284 * @cpu: the (optionally unsigned) integer iterator
285 * @mask: the cpumask poiter
286 * @start: the start location
287 *
288 * The implementation does not assume any bit in @mask is set (including @start).
289 *
290 * After the loop, cpu is >= nr_cpu_ids.
291 */
292#define for_each_cpu_wrap(cpu, mask, start) \
293 for ((cpu) = cpumask_next_wrap((start)-1, (mask), (start), false); \
294 (cpu) < nr_cpumask_bits; \
295 (cpu) = cpumask_next_wrap((cpu), (mask), (start), true))
296
Paul E. McKenney8bd93a22010-02-22 17:04:59 -0800297/**
Rusty Russell984f2f32008-11-08 20:24:19 +1100298 * for_each_cpu_and - iterate over every cpu in both masks
299 * @cpu: the (optionally unsigned) integer iterator
Alexey Dobriyan2a4a4082019-09-25 16:47:30 -0700300 * @mask1: the first cpumask pointer
301 * @mask2: the second cpumask pointer
Rusty Russell984f2f32008-11-08 20:24:19 +1100302 *
303 * This saves a temporary CPU mask in many places. It is equivalent to:
304 * struct cpumask tmp;
Alexey Dobriyan2a4a4082019-09-25 16:47:30 -0700305 * cpumask_and(&tmp, &mask1, &mask2);
Rusty Russell984f2f32008-11-08 20:24:19 +1100306 * for_each_cpu(cpu, &tmp)
307 * ...
308 *
309 * After the loop, cpu is >= nr_cpu_ids.
310 */
Alexey Dobriyan2a4a4082019-09-25 16:47:30 -0700311#define for_each_cpu_and(cpu, mask1, mask2) \
Rusty Russell2d3854a2008-11-05 13:39:10 +1100312 for ((cpu) = -1; \
Alexey Dobriyan2a4a4082019-09-25 16:47:30 -0700313 (cpu) = cpumask_next_and((cpu), (mask1), (mask2)), \
Rusty Russell2d3854a2008-11-05 13:39:10 +1100314 (cpu) < nr_cpu_ids;)
315#endif /* SMP */
316
317#define CPU_BITS_NONE \
318{ \
319 [0 ... BITS_TO_LONGS(NR_CPUS)-1] = 0UL \
320}
321
322#define CPU_BITS_CPU0 \
323{ \
324 [0] = 1UL \
325}
326
327/**
328 * cpumask_set_cpu - set a cpu in a cpumask
329 * @cpu: cpu number (< nr_cpu_ids)
330 * @dstp: the cpumask pointer
331 */
332static inline void cpumask_set_cpu(unsigned int cpu, struct cpumask *dstp)
333{
334 set_bit(cpumask_check(cpu), cpumask_bits(dstp));
335}
336
Peter Zijlstra6c8557b2017-05-19 12:58:25 +0200337static inline void __cpumask_set_cpu(unsigned int cpu, struct cpumask *dstp)
338{
339 __set_bit(cpumask_check(cpu), cpumask_bits(dstp));
340}
341
342
Rusty Russell2d3854a2008-11-05 13:39:10 +1100343/**
344 * cpumask_clear_cpu - clear a cpu in a cpumask
345 * @cpu: cpu number (< nr_cpu_ids)
346 * @dstp: the cpumask pointer
347 */
348static inline void cpumask_clear_cpu(int cpu, struct cpumask *dstp)
349{
350 clear_bit(cpumask_check(cpu), cpumask_bits(dstp));
351}
352
Peter Zijlstra6c8557b2017-05-19 12:58:25 +0200353static inline void __cpumask_clear_cpu(int cpu, struct cpumask *dstp)
354{
355 __clear_bit(cpumask_check(cpu), cpumask_bits(dstp));
356}
357
Rusty Russell2d3854a2008-11-05 13:39:10 +1100358/**
359 * cpumask_test_cpu - test for a cpu in a cpumask
360 * @cpu: cpu number (< nr_cpu_ids)
361 * @cpumask: the cpumask pointer
362 *
Alex Shic777ad62012-05-28 22:23:51 +0800363 * Returns 1 if @cpu is set in @cpumask, else returns 0
Rusty Russell2d3854a2008-11-05 13:39:10 +1100364 */
Rasmus Villemoes3bbf7f42015-03-31 13:25:05 +1030365static inline int cpumask_test_cpu(int cpu, const struct cpumask *cpumask)
366{
367 return test_bit(cpumask_check(cpu), cpumask_bits((cpumask)));
368}
Rusty Russell2d3854a2008-11-05 13:39:10 +1100369
370/**
371 * cpumask_test_and_set_cpu - atomically test and set a cpu in a cpumask
372 * @cpu: cpu number (< nr_cpu_ids)
373 * @cpumask: the cpumask pointer
374 *
Alex Shic777ad62012-05-28 22:23:51 +0800375 * Returns 1 if @cpu is set in old bitmap of @cpumask, else returns 0
376 *
Rusty Russell2d3854a2008-11-05 13:39:10 +1100377 * test_and_set_bit wrapper for cpumasks.
378 */
379static inline int cpumask_test_and_set_cpu(int cpu, struct cpumask *cpumask)
380{
381 return test_and_set_bit(cpumask_check(cpu), cpumask_bits(cpumask));
382}
383
384/**
Xiao Guangrong54fdade2009-09-22 16:43:39 -0700385 * cpumask_test_and_clear_cpu - atomically test and clear a cpu in a cpumask
386 * @cpu: cpu number (< nr_cpu_ids)
387 * @cpumask: the cpumask pointer
388 *
Alex Shic777ad62012-05-28 22:23:51 +0800389 * Returns 1 if @cpu is set in old bitmap of @cpumask, else returns 0
390 *
Xiao Guangrong54fdade2009-09-22 16:43:39 -0700391 * test_and_clear_bit wrapper for cpumasks.
392 */
393static inline int cpumask_test_and_clear_cpu(int cpu, struct cpumask *cpumask)
394{
395 return test_and_clear_bit(cpumask_check(cpu), cpumask_bits(cpumask));
396}
397
398/**
Rusty Russell2d3854a2008-11-05 13:39:10 +1100399 * cpumask_setall - set all cpus (< nr_cpu_ids) in a cpumask
400 * @dstp: the cpumask pointer
401 */
402static inline void cpumask_setall(struct cpumask *dstp)
403{
404 bitmap_fill(cpumask_bits(dstp), nr_cpumask_bits);
405}
406
407/**
408 * cpumask_clear - clear all cpus (< nr_cpu_ids) in a cpumask
409 * @dstp: the cpumask pointer
410 */
411static inline void cpumask_clear(struct cpumask *dstp)
412{
413 bitmap_zero(cpumask_bits(dstp), nr_cpumask_bits);
414}
415
416/**
417 * cpumask_and - *dstp = *src1p & *src2p
418 * @dstp: the cpumask result
419 * @src1p: the first input
420 * @src2p: the second input
Alex Shic777ad62012-05-28 22:23:51 +0800421 *
422 * If *@dstp is empty, returns 0, else returns 1
Rusty Russell2d3854a2008-11-05 13:39:10 +1100423 */
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700424static inline int cpumask_and(struct cpumask *dstp,
Rusty Russell2d3854a2008-11-05 13:39:10 +1100425 const struct cpumask *src1p,
426 const struct cpumask *src2p)
427{
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700428 return bitmap_and(cpumask_bits(dstp), cpumask_bits(src1p),
Rusty Russell2d3854a2008-11-05 13:39:10 +1100429 cpumask_bits(src2p), nr_cpumask_bits);
430}
431
432/**
433 * cpumask_or - *dstp = *src1p | *src2p
434 * @dstp: the cpumask result
435 * @src1p: the first input
436 * @src2p: the second input
437 */
438static inline void cpumask_or(struct cpumask *dstp, const struct cpumask *src1p,
439 const struct cpumask *src2p)
440{
441 bitmap_or(cpumask_bits(dstp), cpumask_bits(src1p),
442 cpumask_bits(src2p), nr_cpumask_bits);
443}
444
445/**
446 * cpumask_xor - *dstp = *src1p ^ *src2p
447 * @dstp: the cpumask result
448 * @src1p: the first input
449 * @src2p: the second input
450 */
451static inline void cpumask_xor(struct cpumask *dstp,
452 const struct cpumask *src1p,
453 const struct cpumask *src2p)
454{
455 bitmap_xor(cpumask_bits(dstp), cpumask_bits(src1p),
456 cpumask_bits(src2p), nr_cpumask_bits);
457}
458
459/**
460 * cpumask_andnot - *dstp = *src1p & ~*src2p
461 * @dstp: the cpumask result
462 * @src1p: the first input
463 * @src2p: the second input
Alex Shic777ad62012-05-28 22:23:51 +0800464 *
465 * If *@dstp is empty, returns 0, else returns 1
Rusty Russell2d3854a2008-11-05 13:39:10 +1100466 */
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700467static inline int cpumask_andnot(struct cpumask *dstp,
Rusty Russell2d3854a2008-11-05 13:39:10 +1100468 const struct cpumask *src1p,
469 const struct cpumask *src2p)
470{
Linus Torvaldsf4b03732009-08-21 09:26:15 -0700471 return bitmap_andnot(cpumask_bits(dstp), cpumask_bits(src1p),
Rusty Russell2d3854a2008-11-05 13:39:10 +1100472 cpumask_bits(src2p), nr_cpumask_bits);
473}
474
475/**
476 * cpumask_complement - *dstp = ~*srcp
477 * @dstp: the cpumask result
478 * @srcp: the input to invert
479 */
480static inline void cpumask_complement(struct cpumask *dstp,
481 const struct cpumask *srcp)
482{
483 bitmap_complement(cpumask_bits(dstp), cpumask_bits(srcp),
484 nr_cpumask_bits);
485}
486
487/**
488 * cpumask_equal - *src1p == *src2p
489 * @src1p: the first input
490 * @src2p: the second input
491 */
492static inline bool cpumask_equal(const struct cpumask *src1p,
493 const struct cpumask *src2p)
494{
495 return bitmap_equal(cpumask_bits(src1p), cpumask_bits(src2p),
496 nr_cpumask_bits);
497}
498
499/**
Thomas Gleixnerb9fa6442019-07-22 20:47:24 +0200500 * cpumask_or_equal - *src1p | *src2p == *src3p
501 * @src1p: the first input
502 * @src2p: the second input
503 * @src3p: the third input
504 */
505static inline bool cpumask_or_equal(const struct cpumask *src1p,
506 const struct cpumask *src2p,
507 const struct cpumask *src3p)
508{
509 return bitmap_or_equal(cpumask_bits(src1p), cpumask_bits(src2p),
510 cpumask_bits(src3p), nr_cpumask_bits);
511}
512
513/**
Rusty Russell2d3854a2008-11-05 13:39:10 +1100514 * cpumask_intersects - (*src1p & *src2p) != 0
515 * @src1p: the first input
516 * @src2p: the second input
517 */
518static inline bool cpumask_intersects(const struct cpumask *src1p,
519 const struct cpumask *src2p)
520{
521 return bitmap_intersects(cpumask_bits(src1p), cpumask_bits(src2p),
522 nr_cpumask_bits);
523}
524
525/**
526 * cpumask_subset - (*src1p & ~*src2p) == 0
527 * @src1p: the first input
528 * @src2p: the second input
Alex Shic777ad62012-05-28 22:23:51 +0800529 *
530 * Returns 1 if *@src1p is a subset of *@src2p, else returns 0
Rusty Russell2d3854a2008-11-05 13:39:10 +1100531 */
532static inline int cpumask_subset(const struct cpumask *src1p,
533 const struct cpumask *src2p)
534{
535 return bitmap_subset(cpumask_bits(src1p), cpumask_bits(src2p),
536 nr_cpumask_bits);
537}
538
539/**
540 * cpumask_empty - *srcp == 0
541 * @srcp: the cpumask to that all cpus < nr_cpu_ids are clear.
542 */
543static inline bool cpumask_empty(const struct cpumask *srcp)
544{
545 return bitmap_empty(cpumask_bits(srcp), nr_cpumask_bits);
546}
547
548/**
549 * cpumask_full - *srcp == 0xFFFFFFFF...
550 * @srcp: the cpumask to that all cpus < nr_cpu_ids are set.
551 */
552static inline bool cpumask_full(const struct cpumask *srcp)
553{
554 return bitmap_full(cpumask_bits(srcp), nr_cpumask_bits);
555}
556
557/**
558 * cpumask_weight - Count of bits in *srcp
559 * @srcp: the cpumask to count bits (< nr_cpu_ids) in.
560 */
561static inline unsigned int cpumask_weight(const struct cpumask *srcp)
562{
563 return bitmap_weight(cpumask_bits(srcp), nr_cpumask_bits);
564}
565
566/**
567 * cpumask_shift_right - *dstp = *srcp >> n
568 * @dstp: the cpumask result
569 * @srcp: the input to shift
570 * @n: the number of bits to shift by
571 */
572static inline void cpumask_shift_right(struct cpumask *dstp,
573 const struct cpumask *srcp, int n)
574{
575 bitmap_shift_right(cpumask_bits(dstp), cpumask_bits(srcp), n,
576 nr_cpumask_bits);
577}
578
579/**
580 * cpumask_shift_left - *dstp = *srcp << n
581 * @dstp: the cpumask result
582 * @srcp: the input to shift
583 * @n: the number of bits to shift by
584 */
585static inline void cpumask_shift_left(struct cpumask *dstp,
586 const struct cpumask *srcp, int n)
587{
588 bitmap_shift_left(cpumask_bits(dstp), cpumask_bits(srcp), n,
589 nr_cpumask_bits);
590}
591
592/**
593 * cpumask_copy - *dstp = *srcp
594 * @dstp: the result
595 * @srcp: the input cpumask
596 */
597static inline void cpumask_copy(struct cpumask *dstp,
598 const struct cpumask *srcp)
599{
600 bitmap_copy(cpumask_bits(dstp), cpumask_bits(srcp), nr_cpumask_bits);
601}
602
603/**
604 * cpumask_any - pick a "random" cpu from *srcp
605 * @srcp: the input cpumask
606 *
607 * Returns >= nr_cpu_ids if no cpus set.
608 */
609#define cpumask_any(srcp) cpumask_first(srcp)
610
611/**
612 * cpumask_first_and - return the first cpu from *srcp1 & *srcp2
613 * @src1p: the first input
614 * @src2p: the second input
615 *
616 * Returns >= nr_cpu_ids if no cpus set in both. See also cpumask_next_and().
617 */
618#define cpumask_first_and(src1p, src2p) cpumask_next_and(-1, (src1p), (src2p))
619
620/**
621 * cpumask_any_and - pick a "random" cpu from *mask1 & *mask2
622 * @mask1: the first input cpumask
623 * @mask2: the second input cpumask
624 *
625 * Returns >= nr_cpu_ids if no cpus set.
626 */
627#define cpumask_any_and(mask1, mask2) cpumask_first_and((mask1), (mask2))
628
629/**
Rusty Russellcd83e422008-11-07 11:12:29 +1100630 * cpumask_of - the cpumask containing just a given cpu
631 * @cpu: the cpu (<= nr_cpu_ids)
632 */
633#define cpumask_of(cpu) (get_cpu_mask(cpu))
634
635/**
Rusty Russell29c01772008-12-13 21:20:25 +1030636 * cpumask_parse_user - extract a cpumask from a user string
637 * @buf: the buffer to extract from
638 * @len: the length of the buffer
639 * @dstp: the cpumask to set.
640 *
641 * Returns -errno, or 0 for success.
642 */
643static inline int cpumask_parse_user(const char __user *buf, int len,
644 struct cpumask *dstp)
645{
Tejun Heo4d59b6c2017-02-08 14:30:56 -0800646 return bitmap_parse_user(buf, len, cpumask_bits(dstp), nr_cpumask_bits);
Rusty Russell29c01772008-12-13 21:20:25 +1030647}
648
649/**
Mike Travis4b0604202011-05-24 17:13:12 -0700650 * cpumask_parselist_user - extract a cpumask from a user string
651 * @buf: the buffer to extract from
652 * @len: the length of the buffer
653 * @dstp: the cpumask to set.
654 *
655 * Returns -errno, or 0 for success.
656 */
657static inline int cpumask_parselist_user(const char __user *buf, int len,
658 struct cpumask *dstp)
659{
660 return bitmap_parselist_user(buf, len, cpumask_bits(dstp),
Tejun Heo4d59b6c2017-02-08 14:30:56 -0800661 nr_cpumask_bits);
Mike Travis4b0604202011-05-24 17:13:12 -0700662}
663
664/**
Geliang Tangb06fb412016-08-02 14:05:42 -0700665 * cpumask_parse - extract a cpumask from a string
Tejun Heoba630e42013-03-12 11:30:04 -0700666 * @buf: the buffer to extract from
667 * @dstp: the cpumask to set.
668 *
669 * Returns -errno, or 0 for success.
670 */
671static inline int cpumask_parse(const char *buf, struct cpumask *dstp)
672{
Yury Norov190535f2020-02-03 17:37:41 -0800673 return bitmap_parse(buf, UINT_MAX, cpumask_bits(dstp), nr_cpumask_bits);
Tejun Heoba630e42013-03-12 11:30:04 -0700674}
675
676/**
Alex Shi231daf02012-07-27 09:29:42 +0930677 * cpulist_parse - extract a cpumask from a user string of ranges
Rusty Russell29c01772008-12-13 21:20:25 +1030678 * @buf: the buffer to extract from
Rusty Russell29c01772008-12-13 21:20:25 +1030679 * @dstp: the cpumask to set.
680 *
681 * Returns -errno, or 0 for success.
682 */
683static inline int cpulist_parse(const char *buf, struct cpumask *dstp)
684{
Tejun Heo4d59b6c2017-02-08 14:30:56 -0800685 return bitmap_parselist(buf, cpumask_bits(dstp), nr_cpumask_bits);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100686}
687
688/**
689 * cpumask_size - size to allocate for a 'struct cpumask' in bytes
Rusty Russell2d3854a2008-11-05 13:39:10 +1100690 */
Alexey Dobriyan4de373a2018-02-06 15:39:37 -0800691static inline unsigned int cpumask_size(void)
Rusty Russell2d3854a2008-11-05 13:39:10 +1100692{
Rusty Russellcdfdef72015-03-05 10:49:19 +1030693 return BITS_TO_LONGS(nr_cpumask_bits) * sizeof(long);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100694}
695
696/*
697 * cpumask_var_t: struct cpumask for stack usage.
698 *
699 * Oh, the wicked games we play! In order to make kernel coding a
700 * little more difficult, we typedef cpumask_var_t to an array or a
701 * pointer: doing &mask on an array is a noop, so it still works.
702 *
703 * ie.
704 * cpumask_var_t tmpmask;
705 * if (!alloc_cpumask_var(&tmpmask, GFP_KERNEL))
706 * return -ENOMEM;
707 *
708 * ... use 'tmpmask' like a normal struct cpumask * ...
709 *
710 * free_cpumask_var(tmpmask);
KOSAKI Motohiroa64a26e2011-07-26 16:08:45 -0700711 *
712 *
713 * However, one notable exception is there. alloc_cpumask_var() allocates
714 * only nr_cpumask_bits bits (in the other hand, real cpumask_t always has
715 * NR_CPUS bits). Therefore you don't have to dereference cpumask_var_t.
716 *
717 * cpumask_var_t tmpmask;
718 * if (!alloc_cpumask_var(&tmpmask, GFP_KERNEL))
719 * return -ENOMEM;
720 *
721 * var = *tmpmask;
722 *
723 * This code makes NR_CPUS length memcopy and brings to a memory corruption.
724 * cpumask_copy() provide safe copy functionality.
Christoph Lameter4ba29682014-08-26 19:12:21 -0500725 *
726 * Note that there is another evil here: If you define a cpumask_var_t
727 * as a percpu variable then the way to obtain the address of the cpumask
728 * structure differently influences what this_cpu_* operation needs to be
729 * used. Please use this_cpu_cpumask_var_t in those cases. The direct use
730 * of this_cpu_ptr() or this_cpu_read() will lead to failures when the
731 * other type of cpumask_var_t implementation is configured.
Waiman Long668802c2017-01-30 12:57:43 -0500732 *
733 * Please also note that __cpumask_var_read_mostly can be used to declare
734 * a cpumask_var_t variable itself (not its content) as read mostly.
Rusty Russell2d3854a2008-11-05 13:39:10 +1100735 */
736#ifdef CONFIG_CPUMASK_OFFSTACK
737typedef struct cpumask *cpumask_var_t;
738
Waiman Long668802c2017-01-30 12:57:43 -0500739#define this_cpu_cpumask_var_ptr(x) this_cpu_read(x)
740#define __cpumask_var_read_mostly __read_mostly
Christoph Lameter4ba29682014-08-26 19:12:21 -0500741
Mike Travis7b4967c2008-12-19 16:56:37 +1030742bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100743bool alloc_cpumask_var(cpumask_var_t *mask, gfp_t flags);
Yinghai Lu0281b5d2009-06-06 14:50:36 -0700744bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node);
745bool zalloc_cpumask_var(cpumask_var_t *mask, gfp_t flags);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100746void alloc_bootmem_cpumask_var(cpumask_var_t *mask);
747void free_cpumask_var(cpumask_var_t mask);
Rusty Russellcd83e422008-11-07 11:12:29 +1100748void free_bootmem_cpumask_var(cpumask_var_t mask);
Rusty Russell2d3854a2008-11-05 13:39:10 +1100749
Matthias Kaehlckef7e30f02017-04-12 11:20:29 -0700750static inline bool cpumask_available(cpumask_var_t mask)
751{
752 return mask != NULL;
753}
754
Rusty Russell2d3854a2008-11-05 13:39:10 +1100755#else
756typedef struct cpumask cpumask_var_t[1];
757
Christoph Lameter4ba29682014-08-26 19:12:21 -0500758#define this_cpu_cpumask_var_ptr(x) this_cpu_ptr(x)
Waiman Long668802c2017-01-30 12:57:43 -0500759#define __cpumask_var_read_mostly
Christoph Lameter4ba29682014-08-26 19:12:21 -0500760
Rusty Russell2d3854a2008-11-05 13:39:10 +1100761static inline bool alloc_cpumask_var(cpumask_var_t *mask, gfp_t flags)
762{
763 return true;
764}
765
Mike Travis7b4967c2008-12-19 16:56:37 +1030766static inline bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags,
767 int node)
768{
769 return true;
770}
771
Yinghai Lu0281b5d2009-06-06 14:50:36 -0700772static inline bool zalloc_cpumask_var(cpumask_var_t *mask, gfp_t flags)
773{
774 cpumask_clear(*mask);
775 return true;
776}
777
778static inline bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags,
779 int node)
780{
781 cpumask_clear(*mask);
782 return true;
783}
784
Rusty Russell2d3854a2008-11-05 13:39:10 +1100785static inline void alloc_bootmem_cpumask_var(cpumask_var_t *mask)
786{
787}
788
789static inline void free_cpumask_var(cpumask_var_t mask)
790{
791}
Rusty Russellcd83e422008-11-07 11:12:29 +1100792
793static inline void free_bootmem_cpumask_var(cpumask_var_t mask)
794{
795}
Matthias Kaehlckef7e30f02017-04-12 11:20:29 -0700796
797static inline bool cpumask_available(cpumask_var_t mask)
798{
799 return true;
800}
Rusty Russell2d3854a2008-11-05 13:39:10 +1100801#endif /* CONFIG_CPUMASK_OFFSTACK */
802
Rusty Russell2d3854a2008-11-05 13:39:10 +1100803/* It's common to want to use cpu_all_mask in struct member initializers,
804 * so it has to refer to an address rather than a pointer. */
805extern const DECLARE_BITMAP(cpu_all_bits, NR_CPUS);
806#define cpu_all_mask to_cpumask(cpu_all_bits)
807
808/* First bits of cpu_bit_bitmap are in fact unset. */
809#define cpu_none_mask to_cpumask(cpu_bit_bitmap[0])
810
Rusty Russellae7a47e2008-12-30 09:05:15 +1030811#define for_each_possible_cpu(cpu) for_each_cpu((cpu), cpu_possible_mask)
812#define for_each_online_cpu(cpu) for_each_cpu((cpu), cpu_online_mask)
813#define for_each_present_cpu(cpu) for_each_cpu((cpu), cpu_present_mask)
814
Rusty Russell2d3854a2008-11-05 13:39:10 +1100815/* Wrappers for arch boot code to manipulate normally-constant masks */
Rusty Russell3fa41522008-12-30 09:05:16 +1030816void init_cpu_present(const struct cpumask *src);
817void init_cpu_possible(const struct cpumask *src);
818void init_cpu_online(const struct cpumask *src);
Rusty Russell6ba2ef72009-09-24 09:34:53 -0600819
Thomas Gleixner427d77a2016-12-13 19:32:28 +0100820static inline void reset_cpu_possible_mask(void)
821{
822 bitmap_zero(cpumask_bits(&__cpu_possible_mask), NR_CPUS);
823}
824
Rasmus Villemoes94256762016-01-20 15:00:28 -0800825static inline void
826set_cpu_possible(unsigned int cpu, bool possible)
827{
828 if (possible)
829 cpumask_set_cpu(cpu, &__cpu_possible_mask);
830 else
831 cpumask_clear_cpu(cpu, &__cpu_possible_mask);
832}
833
834static inline void
835set_cpu_present(unsigned int cpu, bool present)
836{
837 if (present)
838 cpumask_set_cpu(cpu, &__cpu_present_mask);
839 else
840 cpumask_clear_cpu(cpu, &__cpu_present_mask);
841}
842
Thomas Gleixner0c09ab92019-07-09 16:23:40 +0200843void set_cpu_online(unsigned int cpu, bool online);
Rasmus Villemoes94256762016-01-20 15:00:28 -0800844
845static inline void
846set_cpu_active(unsigned int cpu, bool active)
847{
848 if (active)
849 cpumask_set_cpu(cpu, &__cpu_active_mask);
850 else
851 cpumask_clear_cpu(cpu, &__cpu_active_mask);
852}
853
854
Rusty Russell6ba2ef72009-09-24 09:34:53 -0600855/**
856 * to_cpumask - convert an NR_CPUS bitmap to a struct cpumask *
857 * @bitmap: the bitmap
858 *
859 * There are a few places where cpumask_var_t isn't appropriate and
860 * static cpumasks must be used (eg. very early boot), yet we don't
861 * expose the definition of 'struct cpumask'.
862 *
863 * This does the conversion, and can be used as a constant initializer.
864 */
865#define to_cpumask(bitmap) \
866 ((struct cpumask *)(1 ? (bitmap) \
867 : (void *)sizeof(__check_is_bitmap(bitmap))))
868
869static inline int __check_is_bitmap(const unsigned long *bitmap)
870{
871 return 1;
872}
873
874/*
875 * Special-case data structure for "single bit set only" constant CPU masks.
876 *
877 * We pre-generate all the 64 (or 32) possible bit positions, with enough
878 * padding to the left and the right, and return the constant pointer
879 * appropriately offset.
880 */
881extern const unsigned long
882 cpu_bit_bitmap[BITS_PER_LONG+1][BITS_TO_LONGS(NR_CPUS)];
883
884static inline const struct cpumask *get_cpu_mask(unsigned int cpu)
885{
886 const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG];
887 p -= cpu / BITS_PER_LONG;
888 return to_cpumask(p);
889}
890
891#define cpu_is_offline(cpu) unlikely(!cpu_online(cpu))
892
893#if NR_CPUS <= BITS_PER_LONG
894#define CPU_BITS_ALL \
895{ \
Rusty Russell9941a382015-03-05 10:49:19 +1030896 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
Rusty Russell6ba2ef72009-09-24 09:34:53 -0600897}
898
899#else /* NR_CPUS > BITS_PER_LONG */
900
901#define CPU_BITS_ALL \
902{ \
903 [0 ... BITS_TO_LONGS(NR_CPUS)-2] = ~0UL, \
Rusty Russell9941a382015-03-05 10:49:19 +1030904 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
Rusty Russell6ba2ef72009-09-24 09:34:53 -0600905}
906#endif /* NR_CPUS > BITS_PER_LONG */
907
Sudeep Holla5aaba362014-09-30 14:48:22 +0100908/**
909 * cpumap_print_to_pagebuf - copies the cpumask into the buffer either
910 * as comma-separated list of cpus or hex values of cpumask
911 * @list: indicates whether the cpumap must be list
912 * @mask: the cpumask to copy
913 * @buf: the buffer to copy into
914 *
915 * Returns the length of the (null-terminated) @buf string, zero if
916 * nothing is copied.
917 */
918static inline ssize_t
919cpumap_print_to_pagebuf(bool list, char *buf, const struct cpumask *mask)
920{
921 return bitmap_print_to_pagebuf(list, buf, cpumask_bits(mask),
Tejun Heo513e3d22015-02-13 14:36:50 -0800922 nr_cpu_ids);
Sudeep Holla5aaba362014-09-30 14:48:22 +0100923}
924
Rusty Russell9941a382015-03-05 10:49:19 +1030925#if NR_CPUS <= BITS_PER_LONG
926#define CPU_MASK_ALL \
927(cpumask_t) { { \
928 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
929} }
930#else
931#define CPU_MASK_ALL \
932(cpumask_t) { { \
933 [0 ... BITS_TO_LONGS(NR_CPUS)-2] = ~0UL, \
934 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
935} }
936#endif /* NR_CPUS > BITS_PER_LONG */
937
938#define CPU_MASK_NONE \
939(cpumask_t) { { \
940 [0 ... BITS_TO_LONGS(NR_CPUS)-1] = 0UL \
941} }
942
Rusty Russell15277812015-04-16 12:33:51 +0930943#define CPU_MASK_CPU0 \
944(cpumask_t) { { \
945 [0] = 1UL \
946} }
947
Linus Torvalds1da177e2005-04-16 15:20:36 -0700948#endif /* __LINUX_CPUMASK_H */