948 lines · 26.7 KB · C
RawDownload
#ifndef __LINUX_CPUMASK_H#define __LINUX_CPUMASK_H /* * Cpumasks provide a bitmap suitable for representing the * set of CPU's in a system, one bit position per CPU number.  In general, * only nr_cpu_ids (<= NR_CPUS) bits are valid. */#include <linux/kernel.h>#include <linux/threads.h>#include <linux/bitmap.h>#include <linux/bug.h> typedef struct cpumask { DECLARE_BITMAP(bits, NR_CPUS); } cpumask_t; /** * cpumask_bits - get the bits in a cpumask * @maskp: the struct cpumask * * * You should only assume nr_cpu_ids bits of this mask are valid.  This is * a macro so it's const-correct. */#define cpumask_bits(maskp) ((maskp)->bits) #if NR_CPUS == 1#define nr_cpu_ids		1#elseextern int nr_cpu_ids;#endif #ifdef CONFIG_CPUMASK_OFFSTACK/* Assuming NR_CPUS is huge, a runtime limit is more efficient.  Also, * not all bits may be allocated. */#define nr_cpumask_bits	nr_cpu_ids#else#define nr_cpumask_bits	NR_CPUS#endif /* * The following particular system cpumasks and operations manage * possible, present, active and online cpus. * *     cpu_possible_mask- has bit 'cpu' set iff cpu is populatable *     cpu_present_mask - has bit 'cpu' set iff cpu is populated *     cpu_online_mask  - has bit 'cpu' set iff cpu available to scheduler *     cpu_active_mask  - has bit 'cpu' set iff cpu available to migration * *  If !CONFIG_HOTPLUG_CPU, present == possible, and active == online. * *  The cpu_possible_mask is fixed at boot time, as the set of CPU id's *  that it is possible might ever be plugged in at anytime during the *  life of that system boot.  The cpu_present_mask is dynamic(*), *  representing which CPUs are currently plugged in.  And *  cpu_online_mask is the dynamic subset of cpu_present_mask, *  indicating those CPUs available for scheduling. * *  If HOTPLUG is enabled, then cpu_possible_mask is forced to have *  all NR_CPUS bits set, otherwise it is just the set of CPUs that *  ACPI reports present at boot. * *  If HOTPLUG is enabled, then cpu_present_mask varies dynamically, *  depending on what ACPI reports as currently plugged in, otherwise *  cpu_present_mask is just a copy of cpu_possible_mask. * *  (*) Well, cpu_present_mask is dynamic in the hotplug case.  If not *      hotplug, it's a copy of cpu_possible_mask, hence fixed at boot. * * Subtleties: * 1) UP arch's (NR_CPUS == 1, CONFIG_SMP not defined) hardcode *    assumption that their single CPU is online.  The UP *    cpu_{online,possible,present}_masks are placebos.  Changing them *    will have no useful affect on the following num_*_cpus() *    and cpu_*() macros in the UP case.  This ugliness is a UP *    optimization - don't waste any instructions or memory references *    asking if you're online or how many CPUs there are if there is *    only one CPU. */ extern const struct cpumask *const cpu_possible_mask;extern const struct cpumask *const cpu_online_mask;extern const struct cpumask *const cpu_present_mask;extern const struct cpumask *const cpu_active_mask; #if NR_CPUS > 1#define num_online_cpus()	cpumask_weight(cpu_online_mask)#define num_possible_cpus()	cpumask_weight(cpu_possible_mask)#define num_present_cpus()	cpumask_weight(cpu_present_mask)#define num_active_cpus()	cpumask_weight(cpu_active_mask)#define cpu_online(cpu)		cpumask_test_cpu((cpu), cpu_online_mask)#define cpu_possible(cpu)	cpumask_test_cpu((cpu), cpu_possible_mask)#define cpu_present(cpu)	cpumask_test_cpu((cpu), cpu_present_mask)#define cpu_active(cpu)		cpumask_test_cpu((cpu), cpu_active_mask)#else#define num_online_cpus()	1U#define num_possible_cpus()	1U#define num_present_cpus()	1U#define num_active_cpus()	1U#define cpu_online(cpu)		((cpu) == 0)#define cpu_possible(cpu)	((cpu) == 0)#define cpu_present(cpu)	((cpu) == 0)#define cpu_active(cpu)		((cpu) == 0)#endif /* verify cpu argument to cpumask_* operators */static inline unsigned int cpumask_check(unsigned int cpu){#ifdef CONFIG_DEBUG_PER_CPU_MAPS	WARN_ON_ONCE(cpu >= nr_cpumask_bits);#endif /* CONFIG_DEBUG_PER_CPU_MAPS */	return cpu;} #if NR_CPUS == 1/* Uniprocessor.  Assume all masks are "1". */static inline unsigned int cpumask_first(const struct cpumask *srcp){	return 0;} /* Valid inputs for n are -1 and 0. */static inline unsigned int cpumask_next(int n, const struct cpumask *srcp){	return n+1;} static inline unsigned int cpumask_next_zero(int n, const struct cpumask *srcp){	return n+1;} static inline unsigned int cpumask_next_and(int n,					    const struct cpumask *srcp,					    const struct cpumask *andp){	return n+1;} /* cpu must be a valid cpu, ie 0, so there's no other choice. */static inline unsigned int cpumask_any_but(const struct cpumask *mask,					   unsigned int cpu){	return 1;} #define for_each_cpu(cpu, mask)			\	for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask)#define for_each_cpu_not(cpu, mask)		\	for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask)#define for_each_cpu_and(cpu, mask, and)	\	for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask, (void)and)#else/** * cpumask_first - get the first cpu in a cpumask * @srcp: the cpumask pointer * * Returns >= nr_cpu_ids if no cpus set. */static inline unsigned int cpumask_first(const struct cpumask *srcp){	return find_first_bit(cpumask_bits(srcp), nr_cpumask_bits);} /** * cpumask_next - get the next cpu in a cpumask * @n: the cpu prior to the place to search (ie. return will be > @n) * @srcp: the cpumask pointer * * Returns >= nr_cpu_ids if no further cpus set. */static inline unsigned int cpumask_next(int n, const struct cpumask *srcp){	/* -1 is a legal arg here. */	if (n != -1)		cpumask_check(n);	return find_next_bit(cpumask_bits(srcp), nr_cpumask_bits, n+1);} /** * cpumask_next_zero - get the next unset cpu in a cpumask * @n: the cpu prior to the place to search (ie. return will be > @n) * @srcp: the cpumask pointer * * Returns >= nr_cpu_ids if no further cpus unset. */static inline unsigned int cpumask_next_zero(int n, const struct cpumask *srcp){	/* -1 is a legal arg here. */	if (n != -1)		cpumask_check(n);	return find_next_zero_bit(cpumask_bits(srcp), nr_cpumask_bits, n+1);} int cpumask_next_and(int n, const struct cpumask *, const struct cpumask *);int cpumask_any_but(const struct cpumask *mask, unsigned int cpu); /** * for_each_cpu - iterate over every cpu in a mask * @cpu: the (optionally unsigned) integer iterator * @mask: the cpumask pointer * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu(cpu, mask)				\	for ((cpu) = -1;				\		(cpu) = cpumask_next((cpu), (mask)),	\		(cpu) < nr_cpu_ids;) /** * for_each_cpu_not - iterate over every cpu in a complemented mask * @cpu: the (optionally unsigned) integer iterator * @mask: the cpumask pointer * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_not(cpu, mask)				\	for ((cpu) = -1;					\		(cpu) = cpumask_next_zero((cpu), (mask)),	\		(cpu) < nr_cpu_ids;) /** * for_each_cpu_and - iterate over every cpu in both masks * @cpu: the (optionally unsigned) integer iterator * @mask: the first cpumask pointer * @and: the second cpumask pointer * * This saves a temporary CPU mask in many places.  It is equivalent to: *	struct cpumask tmp; *	cpumask_and(&tmp, &mask, &and); *	for_each_cpu(cpu, &tmp) *		... * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_and(cpu, mask, and)				\	for ((cpu) = -1;						\		(cpu) = cpumask_next_and((cpu), (mask), (and)),		\		(cpu) < nr_cpu_ids;)#endif /* SMP */ #define CPU_BITS_NONE						\{								\	[0 ... BITS_TO_LONGS(NR_CPUS)-1] = 0UL			\} #define CPU_BITS_CPU0						\{								\	[0] =  1UL						\} /** * cpumask_set_cpu - set a cpu in a cpumask * @cpu: cpu number (< nr_cpu_ids) * @dstp: the cpumask pointer */static inline void cpumask_set_cpu(unsigned int cpu, struct cpumask *dstp){	set_bit(cpumask_check(cpu), cpumask_bits(dstp));} /** * cpumask_clear_cpu - clear a cpu in a cpumask * @cpu: cpu number (< nr_cpu_ids) * @dstp: the cpumask pointer */static inline void cpumask_clear_cpu(int cpu, struct cpumask *dstp){	clear_bit(cpumask_check(cpu), cpumask_bits(dstp));} /** * cpumask_test_cpu - test for a cpu in a cpumask * @cpu: cpu number (< nr_cpu_ids) * @cpumask: the cpumask pointer * * Returns 1 if @cpu is set in @cpumask, else returns 0 * * No static inline type checking - see Subtlety (1) above. */#define cpumask_test_cpu(cpu, cpumask) \	test_bit(cpumask_check(cpu), cpumask_bits((cpumask))) /** * cpumask_test_and_set_cpu - atomically test and set a cpu in a cpumask * @cpu: cpu number (< nr_cpu_ids) * @cpumask: the cpumask pointer * * Returns 1 if @cpu is set in old bitmap of @cpumask, else returns 0 * * test_and_set_bit wrapper for cpumasks. */static inline int cpumask_test_and_set_cpu(int cpu, struct cpumask *cpumask){	return test_and_set_bit(cpumask_check(cpu), cpumask_bits(cpumask));} /** * cpumask_test_and_clear_cpu - atomically test and clear a cpu in a cpumask * @cpu: cpu number (< nr_cpu_ids) * @cpumask: the cpumask pointer * * Returns 1 if @cpu is set in old bitmap of @cpumask, else returns 0 * * test_and_clear_bit wrapper for cpumasks. */static inline int cpumask_test_and_clear_cpu(int cpu, struct cpumask *cpumask){	return test_and_clear_bit(cpumask_check(cpu), cpumask_bits(cpumask));} /** * cpumask_setall - set all cpus (< nr_cpu_ids) in a cpumask * @dstp: the cpumask pointer */static inline void cpumask_setall(struct cpumask *dstp){	bitmap_fill(cpumask_bits(dstp), nr_cpumask_bits);} /** * cpumask_clear - clear all cpus (< nr_cpu_ids) in a cpumask * @dstp: the cpumask pointer */static inline void cpumask_clear(struct cpumask *dstp){	bitmap_zero(cpumask_bits(dstp), nr_cpumask_bits);} /** * cpumask_and - *dstp = *src1p & *src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input * * If *@dstp is empty, returns 0, else returns 1 */static inline int cpumask_and(struct cpumask *dstp,			       const struct cpumask *src1p,			       const struct cpumask *src2p){	return bitmap_and(cpumask_bits(dstp), cpumask_bits(src1p),				       cpumask_bits(src2p), nr_cpumask_bits);} /** * cpumask_or - *dstp = *src1p | *src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input */static inline void cpumask_or(struct cpumask *dstp, const struct cpumask *src1p,			      const struct cpumask *src2p){	bitmap_or(cpumask_bits(dstp), cpumask_bits(src1p),				      cpumask_bits(src2p), nr_cpumask_bits);} /** * cpumask_xor - *dstp = *src1p ^ *src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input */static inline void cpumask_xor(struct cpumask *dstp,			       const struct cpumask *src1p,			       const struct cpumask *src2p){	bitmap_xor(cpumask_bits(dstp), cpumask_bits(src1p),				       cpumask_bits(src2p), nr_cpumask_bits);} /** * cpumask_andnot - *dstp = *src1p & ~*src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input * * If *@dstp is empty, returns 0, else returns 1 */static inline int cpumask_andnot(struct cpumask *dstp,				  const struct cpumask *src1p,				  const struct cpumask *src2p){	return bitmap_andnot(cpumask_bits(dstp), cpumask_bits(src1p),					  cpumask_bits(src2p), nr_cpumask_bits);} /** * cpumask_complement - *dstp = ~*srcp * @dstp: the cpumask result * @srcp: the input to invert */static inline void cpumask_complement(struct cpumask *dstp,				      const struct cpumask *srcp){	bitmap_complement(cpumask_bits(dstp), cpumask_bits(srcp),					      nr_cpumask_bits);} /** * cpumask_equal - *src1p == *src2p * @src1p: the first input * @src2p: the second input */static inline bool cpumask_equal(const struct cpumask *src1p,				const struct cpumask *src2p){	return bitmap_equal(cpumask_bits(src1p), cpumask_bits(src2p),						 nr_cpumask_bits);} /** * cpumask_intersects - (*src1p & *src2p) != 0 * @src1p: the first input * @src2p: the second input */static inline bool cpumask_intersects(const struct cpumask *src1p,				     const struct cpumask *src2p){	return bitmap_intersects(cpumask_bits(src1p), cpumask_bits(src2p),						      nr_cpumask_bits);} /** * cpumask_subset - (*src1p & ~*src2p) == 0 * @src1p: the first input * @src2p: the second input * * Returns 1 if *@src1p is a subset of *@src2p, else returns 0 */static inline int cpumask_subset(const struct cpumask *src1p,				 const struct cpumask *src2p){	return bitmap_subset(cpumask_bits(src1p), cpumask_bits(src2p),						  nr_cpumask_bits);} /** * cpumask_empty - *srcp == 0 * @srcp: the cpumask to that all cpus < nr_cpu_ids are clear. */static inline bool cpumask_empty(const struct cpumask *srcp){	return bitmap_empty(cpumask_bits(srcp), nr_cpumask_bits);} /** * cpumask_full - *srcp == 0xFFFFFFFF... * @srcp: the cpumask to that all cpus < nr_cpu_ids are set. */static inline bool cpumask_full(const struct cpumask *srcp){	return bitmap_full(cpumask_bits(srcp), nr_cpumask_bits);} /** * cpumask_weight - Count of bits in *srcp * @srcp: the cpumask to count bits (< nr_cpu_ids) in. */static inline unsigned int cpumask_weight(const struct cpumask *srcp){	return bitmap_weight(cpumask_bits(srcp), nr_cpumask_bits);} /** * cpumask_shift_right - *dstp = *srcp >> n * @dstp: the cpumask result * @srcp: the input to shift * @n: the number of bits to shift by */static inline void cpumask_shift_right(struct cpumask *dstp,				       const struct cpumask *srcp, int n){	bitmap_shift_right(cpumask_bits(dstp), cpumask_bits(srcp), n,					       nr_cpumask_bits);} /** * cpumask_shift_left - *dstp = *srcp << n * @dstp: the cpumask result * @srcp: the input to shift * @n: the number of bits to shift by */static inline void cpumask_shift_left(struct cpumask *dstp,				      const struct cpumask *srcp, int n){	bitmap_shift_left(cpumask_bits(dstp), cpumask_bits(srcp), n,					      nr_cpumask_bits);} /** * cpumask_copy - *dstp = *srcp * @dstp: the result * @srcp: the input cpumask */static inline void cpumask_copy(struct cpumask *dstp,				const struct cpumask *srcp){	bitmap_copy(cpumask_bits(dstp), cpumask_bits(srcp), nr_cpumask_bits);} 

Lines 1–500 of 948.

Keyboard shortcuts

General

Show keyboard shortcuts
?
Focus the current search
/

Issues and pull requests

Open filters
f

Issues, pull requests and Inbox

Select next item
j↓
Select previous item
k↑
Open selected item
Enter
Dismiss filters or clear selection
Esc

Repository code

Go to file
t