Something went wrong. Try again.
(I'm so sorry!) Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
Something went wrong. Try again.
C
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406/* SPDX-License-Identifier: GPL-2.0 */#ifndef __LINUX_CPUMASK_H#define __LINUX_CPUMASK_H
/* * Cpumasks provide a bitmap suitable for representing the * set of CPUs in a system, one bit position per CPU number. In general, * only nr_cpu_ids (<= NR_CPUS) bits are valid. */#include <linux/atomic.h>#include <linux/bitmap.h>#include <linux/cleanup.h>#include <linux/cpumask_types.h>#include <linux/gfp_types.h>#include <linux/numa.h>#include <linux/threads.h>#include <linux/types.h>#include <vdso/page.h>
#include <asm/bug.h>
/** * cpumask_pr_args - printf args to output a cpumask * @maskp: cpumask to be printed * * Can be used to provide arguments for '%*pb[l]' when printing a cpumask. */#define cpumask_pr_args(maskp) nr_cpu_ids, cpumask_bits(maskp)
#if (NR_CPUS == 1) || defined(CONFIG_FORCE_NR_CPUS)#define nr_cpu_ids ((unsigned int)NR_CPUS)#elseextern unsigned int nr_cpu_ids;#endif
static __always_inline void set_nr_cpu_ids(unsigned int nr){#if (NR_CPUS == 1) || defined(CONFIG_FORCE_NR_CPUS) WARN_ON(nr != nr_cpu_ids);#else nr_cpu_ids = nr;#endif}
/* * We have several different "preferred sizes" for the cpumask * operations, depending on operation. * * For example, the bitmap scanning and operating operations have * optimized routines that work for the single-word case, but only when * the size is constant. So if NR_CPUS fits in one single word, we are * better off using that small constant, in order to trigger the * optimized bit finding. That is 'small_cpumask_size'. * * The clearing and copying operations will similarly perform better * with a constant size, but we limit that size arbitrarily to four * words. We call this 'large_cpumask_size'. * * Finally, some operations just want the exact limit, either because * they set bits or just don't have any faster fixed-sized versions. We * call this just 'nr_cpumask_bits'. * * Note that these optional constants are always guaranteed to be at * least as big as 'nr_cpu_ids' itself is, and all our cpumask * allocations are at least that size (see cpumask_size()). The * optimization comes from being able to potentially use a compile-time * constant instead of a run-time generated exact number of CPUs. */#if NR_CPUS <= BITS_PER_LONG #define small_cpumask_bits ((unsigned int)NR_CPUS) #define large_cpumask_bits ((unsigned int)NR_CPUS)#elif NR_CPUS <= 4*BITS_PER_LONG #define small_cpumask_bits nr_cpu_ids #define large_cpumask_bits ((unsigned int)NR_CPUS)#else #define small_cpumask_bits nr_cpu_ids #define large_cpumask_bits nr_cpu_ids#endif#define nr_cpumask_bits nr_cpu_ids
/* * 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_enabled_mask - has bit 'cpu' set iff cpu can be brought online * 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 IDs * 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_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 ARCHes (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 struct cpumask __cpu_possible_mask;extern struct cpumask __cpu_online_mask;extern struct cpumask __cpu_enabled_mask;extern struct cpumask __cpu_present_mask;extern struct cpumask __cpu_active_mask;extern struct cpumask __cpu_dying_mask;#define cpu_possible_mask ((const struct cpumask *)&__cpu_possible_mask)#define cpu_online_mask ((const struct cpumask *)&__cpu_online_mask)#define cpu_enabled_mask ((const struct cpumask *)&__cpu_enabled_mask)#define cpu_present_mask ((const struct cpumask *)&__cpu_present_mask)#define cpu_active_mask ((const struct cpumask *)&__cpu_active_mask)#define cpu_dying_mask ((const struct cpumask *)&__cpu_dying_mask)
extern atomic_t __num_online_cpus;extern unsigned int __num_possible_cpus;
extern cpumask_t cpus_booted_once_mask;
static __always_inline void cpu_max_bits_warn(unsigned int cpu, unsigned int bits){#ifdef CONFIG_DEBUG_PER_CPU_MAPS WARN_ON_ONCE(cpu >= bits);#endif /* CONFIG_DEBUG_PER_CPU_MAPS */}
/* verify cpu argument to cpumask_* operators */static __always_inline unsigned int cpumask_check(unsigned int cpu){ cpu_max_bits_warn(cpu, small_cpumask_bits); return cpu;}
/** * cpumask_first - get the first cpu in a cpumask * @srcp: the cpumask pointer * * Return: >= nr_cpu_ids if no cpus set. */static __always_inline unsigned int cpumask_first(const struct cpumask *srcp){ return find_first_bit(cpumask_bits(srcp), small_cpumask_bits);}
/** * cpumask_first_zero - get the first unset cpu in a cpumask * @srcp: the cpumask pointer * * Return: >= nr_cpu_ids if all cpus are set. */static __always_inline unsigned int cpumask_first_zero(const struct cpumask *srcp){ return find_first_zero_bit(cpumask_bits(srcp), small_cpumask_bits);}
/** * cpumask_first_and - return the first cpu from *srcp1 & *srcp2 * @srcp1: the first input * @srcp2: the second input * * Return: >= nr_cpu_ids if no cpus set in both. See also cpumask_next_and(). */static __always_inlineunsigned int cpumask_first_and(const struct cpumask *srcp1, const struct cpumask *srcp2){ return find_first_and_bit(cpumask_bits(srcp1), cpumask_bits(srcp2), small_cpumask_bits);}
/** * cpumask_first_andnot - return the first cpu from *srcp1 & ~*srcp2 * @srcp1: the first input * @srcp2: the second input * * Return: >= nr_cpu_ids if no such cpu found. */static __always_inlineunsigned int cpumask_first_andnot(const struct cpumask *srcp1, const struct cpumask *srcp2){ return find_first_andnot_bit(cpumask_bits(srcp1), cpumask_bits(srcp2), small_cpumask_bits);}
/** * cpumask_first_and_and - return the first cpu from *srcp1 & *srcp2 & *srcp3 * @srcp1: the first input * @srcp2: the second input * @srcp3: the third input * * Return: >= nr_cpu_ids if no cpus set in all. */static __always_inlineunsigned int cpumask_first_and_and(const struct cpumask *srcp1, const struct cpumask *srcp2, const struct cpumask *srcp3){ return find_first_and_and_bit(cpumask_bits(srcp1), cpumask_bits(srcp2), cpumask_bits(srcp3), small_cpumask_bits);}
/** * cpumask_last - get the last CPU in a cpumask * @srcp: - the cpumask pointer * * Return: >= nr_cpumask_bits if no CPUs set. */static __always_inline unsigned int cpumask_last(const struct cpumask *srcp){ return find_last_bit(cpumask_bits(srcp), small_cpumask_bits);}
/** * cpumask_next - get the next cpu in a cpumask * @n: the cpu prior to the place to search (i.e. return will be > @n) * @srcp: the cpumask pointer * * Return: >= nr_cpu_ids if no further cpus set. */static __always_inlineunsigned 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), small_cpumask_bits, n + 1);}
/** * cpumask_next_zero - get the next unset cpu in a cpumask * @n: the cpu prior to the place to search (i.e. return will be > @n) * @srcp: the cpumask pointer * * Return: >= nr_cpu_ids if no further cpus unset. */static __always_inlineunsigned 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), small_cpumask_bits, n+1);}
#if NR_CPUS == 1/* Uniprocessor: there is only one valid CPU */static __always_inlineunsigned int cpumask_local_spread(unsigned int i, int node){ return 0;}
static __always_inlineunsigned int cpumask_any_and_distribute(const struct cpumask *src1p, const struct cpumask *src2p){ return cpumask_first_and(src1p, src2p);}
static __always_inlineunsigned int cpumask_any_distribute(const struct cpumask *srcp){ return cpumask_first(srcp);}#elseunsigned int cpumask_local_spread(unsigned int i, int node);unsigned int cpumask_any_and_distribute(const struct cpumask *src1p, const struct cpumask *src2p);unsigned int cpumask_any_distribute(const struct cpumask *srcp);#endif /* NR_CPUS */
/** * cpumask_next_and - get the next cpu in *src1p & *src2p * @n: the cpu prior to the place to search (i.e. return will be > @n) * @src1p: the first cpumask pointer * @src2p: the second cpumask pointer * * Return: >= nr_cpu_ids if no further cpus set in both. */static __always_inlineunsigned int cpumask_next_and(int n, const struct cpumask *src1p, const struct cpumask *src2p){ /* -1 is a legal arg here. */ if (n != -1) cpumask_check(n); return find_next_and_bit(cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits, n + 1);}
/** * cpumask_next_andnot - get the next cpu in *src1p & ~*src2p * @n: the cpu prior to the place to search (i.e. return will be > @n) * @src1p: the first cpumask pointer * @src2p: the second cpumask pointer * * Return: >= nr_cpu_ids if no further cpus set in both. */static __always_inlineunsigned int cpumask_next_andnot(int n, const struct cpumask *src1p, const struct cpumask *src2p){ /* -1 is a legal arg here. */ if (n != -1) cpumask_check(n); return find_next_andnot_bit(cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits, n + 1);}
/** * cpumask_next_and_wrap - get the next cpu in *src1p & *src2p, starting from * @n+1. If nothing found, wrap around and start from * the beginning * @n: the cpu prior to the place to search (i.e. search starts from @n+1) * @src1p: the first cpumask pointer * @src2p: the second cpumask pointer * * Return: next set bit, wrapped if needed, or >= nr_cpu_ids if @src1p & @src2p is empty. */static __always_inlineunsigned int cpumask_next_and_wrap(int n, const struct cpumask *src1p, const struct cpumask *src2p){ /* -1 is a legal arg here. */ if (n != -1) cpumask_check(n); return find_next_and_bit_wrap(cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits, n + 1);}
/** * cpumask_next_wrap - get the next cpu in *src, starting from @n+1. If nothing * found, wrap around and start from the beginning * @n: the cpu prior to the place to search (i.e. search starts from @n+1) * @src: cpumask pointer * * Return: next set bit, wrapped if needed, or >= nr_cpu_ids if @src is empty. */static __always_inlineunsigned int cpumask_next_wrap(int n, const struct cpumask *src){ /* -1 is a legal arg here. */ if (n != -1) cpumask_check(n); return find_next_bit_wrap(cpumask_bits(src), small_cpumask_bits, n + 1);}
/** * cpumask_random - get random cpu in *src. * @src: cpumask pointer * * Return: random set bit, or >= nr_cpu_ids if @src is empty. */static __always_inlineunsigned int cpumask_random(const struct cpumask *src){ return find_random_bit(cpumask_bits(src), nr_cpu_ids);}
/** * 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_each_set_bit(cpu, cpumask_bits(mask), small_cpumask_bits)
/** * for_each_cpu_wrap - iterate over every cpu in a mask, starting at a specified location * @cpu: the (optionally unsigned) integer iterator * @mask: the cpumask pointer * @start: the start location * * The implementation does not assume any bit in @mask is set (including @start). * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_wrap(cpu, mask, start) \ for_each_set_bit_wrap(cpu, cpumask_bits(mask), small_cpumask_bits, start)
/** * for_each_cpu_and - iterate over every cpu in both masks * @cpu: the (optionally unsigned) integer iterator * @mask1: the first cpumask pointer * @mask2: the second cpumask pointer * * This saves a temporary CPU mask in many places. It is equivalent to: * struct cpumask tmp; * cpumask_and(&tmp, &mask1, &mask2); * for_each_cpu(cpu, &tmp) * ... * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_and(cpu, mask1, mask2) \ for_each_and_bit(cpu, cpumask_bits(mask1), cpumask_bits(mask2), small_cpumask_bits)
/** * for_each_cpu_andnot - iterate over every cpu present in one mask, excluding * those present in another. * @cpu: the (optionally unsigned) integer iterator * @mask1: the first cpumask pointer * @mask2: the second cpumask pointer * * This saves a temporary CPU mask in many places. It is equivalent to: * struct cpumask tmp; * cpumask_andnot(&tmp, &mask1, &mask2); * for_each_cpu(cpu, &tmp) * ... * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_andnot(cpu, mask1, mask2) \ for_each_andnot_bit(cpu, cpumask_bits(mask1), cpumask_bits(mask2), small_cpumask_bits)
/** * for_each_cpu_or - iterate over every cpu present in either mask * @cpu: the (optionally unsigned) integer iterator * @mask1: the first cpumask pointer * @mask2: the second cpumask pointer * * This saves a temporary CPU mask in many places. It is equivalent to: * struct cpumask tmp; * cpumask_or(&tmp, &mask1, &mask2); * for_each_cpu(cpu, &tmp) * ... * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_or(cpu, mask1, mask2) \ for_each_or_bit(cpu, cpumask_bits(mask1), cpumask_bits(mask2), small_cpumask_bits)
/** * for_each_cpu_from - iterate over CPUs present in @mask, from @cpu to the end of @mask. * @cpu: the (optionally unsigned) integer iterator * @mask: the cpumask pointer * * After the loop, cpu is >= nr_cpu_ids. */#define for_each_cpu_from(cpu, mask) \ for_each_set_bit_from(cpu, cpumask_bits(mask), small_cpumask_bits)
/** * cpumask_any_but - return an arbitrary cpu in a cpumask, but not this one. * @mask: the cpumask to search * @cpu: the cpu to ignore. * * Often used to find any cpu but smp_processor_id() in a mask. * If @cpu == -1, the function is equivalent to cpumask_any(). * Return: >= nr_cpu_ids if no cpus set. */static __always_inlineunsigned int cpumask_any_but(const struct cpumask *mask, int cpu){ unsigned int i;
/* -1 is a legal arg here. */ if (cpu != -1) cpumask_check(cpu);
for_each_cpu(i, mask) if (i != cpu) break; return i;}
/** * cpumask_any_and_but - pick an arbitrary cpu from *mask1 & *mask2, but not this one. * @mask1: the first input cpumask * @mask2: the second input cpumask * @cpu: the cpu to ignore * * If @cpu == -1, the function is equivalent to cpumask_any_and(). * Returns >= nr_cpu_ids if no cpus set. */static __always_inlineunsigned int cpumask_any_and_but(const struct cpumask *mask1, const struct cpumask *mask2, int cpu){ unsigned int i;
/* -1 is a legal arg here. */ if (cpu != -1) cpumask_check(cpu);
i = cpumask_first_and(mask1, mask2); if (i != cpu) return i;
return cpumask_next_and(cpu, mask1, mask2);}
/** * cpumask_any_andnot_but - pick an arbitrary cpu from *mask1 & ~*mask2, but not this one. * @mask1: the first input cpumask * @mask2: the second input cpumask * @cpu: the cpu to ignore * * If @cpu == -1, the function returns the first matching cpu. * Returns >= nr_cpu_ids if no cpus set. */static __always_inlineunsigned int cpumask_any_andnot_but(const struct cpumask *mask1, const struct cpumask *mask2, int cpu){ unsigned int i;
/* -1 is a legal arg here. */ if (cpu != -1) cpumask_check(cpu);
i = cpumask_first_andnot(mask1, mask2); if (i != cpu) return i;
return cpumask_next_andnot(cpu, mask1, mask2);}
/** * cpumask_nth - get the Nth cpu in a cpumask * @srcp: the cpumask pointer * @cpu: the Nth cpu to find, starting from 0 * * Return: >= nr_cpu_ids if such cpu doesn't exist. */static __always_inlineunsigned int cpumask_nth(unsigned int cpu, const struct cpumask *srcp){ return find_nth_bit(cpumask_bits(srcp), small_cpumask_bits, cpumask_check(cpu));}
/** * cpumask_nth_and - get the Nth cpu in 2 cpumasks * @srcp1: the cpumask pointer * @srcp2: the cpumask pointer * @cpu: the Nth cpu to find, starting from 0 * * Return: >= nr_cpu_ids if such cpu doesn't exist. */static __always_inlineunsigned int cpumask_nth_and(unsigned int cpu, const struct cpumask *srcp1, const struct cpumask *srcp2){ return find_nth_and_bit(cpumask_bits(srcp1), cpumask_bits(srcp2), small_cpumask_bits, cpumask_check(cpu));}
/** * cpumask_nth_and_andnot - get the Nth cpu set in 1st and 2nd cpumask, and clear in 3rd. * @srcp1: the cpumask pointer * @srcp2: the cpumask pointer * @srcp3: the cpumask pointer * @cpu: the Nth cpu to find, starting from 0 * * Return: >= nr_cpu_ids if such cpu doesn't exist. */static __always_inlineunsigned int cpumask_nth_and_andnot(unsigned int cpu, const struct cpumask *srcp1, const struct cpumask *srcp2, const struct cpumask *srcp3){ return find_nth_and_andnot_bit(cpumask_bits(srcp1), cpumask_bits(srcp2), cpumask_bits(srcp3), small_cpumask_bits, cpumask_check(cpu));}
#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 __always_inlinevoid cpumask_set_cpu(unsigned int cpu, struct cpumask *dstp){ set_bit(cpumask_check(cpu), cpumask_bits(dstp));}
static __always_inlinevoid __cpumask_set_cpu(unsigned int cpu, struct cpumask *dstp){ __set_bit(cpumask_check(cpu), cpumask_bits(dstp));}
/** * cpumask_clear_cpus - clear cpus in a cpumask * @dstp: the cpumask pointer * @cpu: cpu number (< nr_cpu_ids) * @ncpus: number of cpus to clear (< nr_cpu_ids) */static __always_inline void cpumask_clear_cpus(struct cpumask *dstp, unsigned int cpu, unsigned int ncpus){ cpumask_check(cpu + ncpus - 1); bitmap_clear(cpumask_bits(dstp), cpumask_check(cpu), ncpus);}
/** * cpumask_clear_cpu - clear a cpu in a cpumask * @cpu: cpu number (< nr_cpu_ids) * @dstp: the cpumask pointer */static __always_inline void cpumask_clear_cpu(int cpu, struct cpumask *dstp){ clear_bit(cpumask_check(cpu), cpumask_bits(dstp));}
static __always_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 * * Return: true if @cpu is set in @cpumask, else returns false */static __always_inlinebool cpumask_test_cpu(int cpu, const struct cpumask *cpumask){ return 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 * * test_and_set_bit wrapper for cpumasks. * * Return: true if @cpu is set in old bitmap of @cpumask, else returns false */static __always_inlinebool 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 * * test_and_clear_bit wrapper for cpumasks. * * Return: true if @cpu is set in old bitmap of @cpumask, else returns false */static __always_inlinebool 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 __always_inline void cpumask_setall(struct cpumask *dstp){ if (small_const_nbits(small_cpumask_bits)) { cpumask_bits(dstp)[0] = BITMAP_LAST_WORD_MASK(nr_cpumask_bits); return; } bitmap_fill(cpumask_bits(dstp), nr_cpumask_bits);}
/** * cpumask_clear - clear all cpus (< nr_cpu_ids) in a cpumask * @dstp: the cpumask pointer */static __always_inline void cpumask_clear(struct cpumask *dstp){ bitmap_zero(cpumask_bits(dstp), large_cpumask_bits);}
/** * cpumask_and - *dstp = *src1p & *src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input * * Return: false if *@dstp is empty, else returns true */static __always_inlinebool 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), small_cpumask_bits);}
/** * cpumask_or - *dstp = *src1p | *src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input */static __always_inlinevoid cpumask_or(struct cpumask *dstp, const struct cpumask *src1p, const struct cpumask *src2p){ bitmap_or(cpumask_bits(dstp), cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits);}
/** * cpumask_weighted_or - *dstp = *src1p | *src2p and return the weight of the result * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input * * Return: The number of bits set in the resulting cpumask @dstp */static __always_inlineunsigned int cpumask_weighted_or(struct cpumask *dstp, const struct cpumask *src1p, const struct cpumask *src2p){ return bitmap_weighted_or(cpumask_bits(dstp), cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits);}
/** * cpumask_xor - *dstp = *src1p ^ *src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input */static __always_inlinevoid cpumask_xor(struct cpumask *dstp, const struct cpumask *src1p, const struct cpumask *src2p){ bitmap_xor(cpumask_bits(dstp), cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits);}
/** * cpumask_andnot - *dstp = *src1p & ~*src2p * @dstp: the cpumask result * @src1p: the first input * @src2p: the second input * * Return: false if *@dstp is empty, else returns true */static __always_inlinebool 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), small_cpumask_bits);}
/** * cpumask_equal - *src1p == *src2p * @src1p: the first input * @src2p: the second input * * Return: true if the cpumasks are equal, false if not */static __always_inlinebool cpumask_equal(const struct cpumask *src1p, const struct cpumask *src2p){ return bitmap_equal(cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits);}
/** * cpumask_or_equal - *src1p | *src2p == *src3p * @src1p: the first input * @src2p: the second input * @src3p: the third input * * Return: true if first cpumask ORed with second cpumask == third cpumask, * otherwise false */static __always_inlinebool cpumask_or_equal(const struct cpumask *src1p, const struct cpumask *src2p, const struct cpumask *src3p){ return bitmap_or_equal(cpumask_bits(src1p), cpumask_bits(src2p), cpumask_bits(src3p), small_cpumask_bits);}
/** * cpumask_intersects - (*src1p & *src2p) != 0 * @src1p: the first input * @src2p: the second input * * Return: true if first cpumask ANDed with second cpumask is non-empty, * otherwise false */static __always_inlinebool cpumask_intersects(const struct cpumask *src1p, const struct cpumask *src2p){ return bitmap_intersects(cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits);}
/** * cpumask_subset - (*src1p & ~*src2p) == 0 * @src1p: the first input * @src2p: the second input * * Return: true if *@src1p is a subset of *@src2p, else returns false */static __always_inlinebool cpumask_subset(const struct cpumask *src1p, const struct cpumask *src2p){ return bitmap_subset(cpumask_bits(src1p), cpumask_bits(src2p), small_cpumask_bits);}
/** * cpumask_empty - *srcp == 0 * @srcp: the cpumask to that all cpus < nr_cpu_ids are clear. * * Return: true if srcp is empty (has no bits set), else false */static __always_inline bool cpumask_empty(const struct cpumask *srcp){ return bitmap_empty(cpumask_bits(srcp), small_cpumask_bits);}
/** * cpumask_full - *srcp == 0xFFFFFFFF... * @srcp: the cpumask to that all cpus < nr_cpu_ids are set. * * Return: true if srcp is full (has all bits set), else false */static __always_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. * * Return: count of bits set in *srcp */static __always_inline unsigned int cpumask_weight(const struct cpumask *srcp){ return bitmap_weight(cpumask_bits(srcp), small_cpumask_bits);}
/** * cpumask_weight_and - Count of bits in (*srcp1 & *srcp2) * @srcp1: the cpumask to count bits (< nr_cpu_ids) in. * @srcp2: the cpumask to count bits (< nr_cpu_ids) in. * * Return: count of bits set in both *srcp1 and *srcp2 */static __always_inlineunsigned int cpumask_weight_and(const struct cpumask *srcp1, const struct cpumask *srcp2){ return bitmap_weight_and(cpumask_bits(srcp1), cpumask_bits(srcp2), small_cpumask_bits);}
/** * cpumask_weight_andnot - Count of bits in (*srcp1 & ~*srcp2) * @srcp1: the cpumask to count bits (< nr_cpu_ids) in. * @srcp2: the cpumask to count bits (< nr_cpu_ids) in. * * Return: count of bits set in both *srcp1 and *srcp2 */static __always_inlineunsigned int cpumask_weight_andnot(const struct cpumask *srcp1, const struct cpumask *srcp2){ return bitmap_weight_andnot(cpumask_bits(srcp1), cpumask_bits(srcp2), small_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 __always_inlinevoid cpumask_shift_right(struct cpumask *dstp, const struct cpumask *srcp, int n){ bitmap_shift_right(cpumask_bits(dstp), cpumask_bits(srcp), n, small_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 __always_inlinevoid 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 __always_inlinevoid cpumask_copy(struct cpumask *dstp, const struct cpumask *srcp){ bitmap_copy(cpumask_bits(dstp), cpumask_bits(srcp), large_cpumask_bits);}
/** * cpumask_any - pick an arbitrary cpu from *srcp * @srcp: the input cpumask * * Return: >= nr_cpu_ids if no cpus set. */#define cpumask_any(srcp) cpumask_first(srcp)
/** * cpumask_any_and - pick an arbitrary cpu from *mask1 & *mask2 * @mask1: the first input cpumask * @mask2: the second input cpumask * * Return: >= nr_cpu_ids if no cpus set. */#define cpumask_any_and(mask1, mask2) cpumask_first_and((mask1), (mask2))
/** * cpumask_of - the cpumask containing just a given cpu * @cpu: the cpu (<= nr_cpu_ids) */#define cpumask_of(cpu) (get_cpu_mask(cpu))
/** * cpumask_parse_user - extract a cpumask from a user string * @buf: the buffer to extract from * @len: the length of the buffer * @dstp: the cpumask to set. * * Return: -errno, or 0 for success. */static __always_inlineint cpumask_parse_user(const char __user *buf, int len, struct cpumask *dstp){ return bitmap_parse_user(buf, len, cpumask_bits(dstp), nr_cpumask_bits);}
/** * cpumask_parselist_user - extract a cpumask from a user string * @buf: the buffer to extract from * @len: the length of the buffer * @dstp: the cpumask to set. * * Return: -errno, or 0 for success. */static __always_inlineint cpumask_parselist_user(const char __user *buf, int len, struct cpumask *dstp){ return bitmap_parselist_user(buf, len, cpumask_bits(dstp), nr_cpumask_bits);}
/** * cpumask_parse - extract a cpumask from a string * @buf: the buffer to extract from * @dstp: the cpumask to set. * * Return: -errno, or 0 for success. */static __always_inline int cpumask_parse(const char *buf, struct cpumask *dstp){ return bitmap_parse(buf, UINT_MAX, cpumask_bits(dstp), nr_cpumask_bits);}
/** * cpulist_parse - extract a cpumask from a user string of ranges * @buf: the buffer to extract from * @dstp: the cpumask to set. * * Return: -errno, or 0 for success. */static __always_inline int cpulist_parse(const char *buf, struct cpumask *dstp){ return bitmap_parselist(buf, cpumask_bits(dstp), nr_cpumask_bits);}
/** * cpumask_size - calculate size to allocate for a 'struct cpumask' in bytes * * Return: size to allocate for a &struct cpumask in bytes */static __always_inline unsigned int cpumask_size(void){ return bitmap_size(large_cpumask_bits);}
#ifdef CONFIG_CPUMASK_OFFSTACK
#define this_cpu_cpumask_var_ptr(x) this_cpu_read(x)#define __cpumask_var_read_mostly __read_mostly#define CPUMASK_VAR_NULL NULL
bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node);
static __always_inlinebool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node){ return alloc_cpumask_var_node(mask, flags | __GFP_ZERO, node);}
/** * alloc_cpumask_var - allocate a struct cpumask * @mask: pointer to cpumask_var_t where the cpumask is returned * @flags: GFP_ flags * * Only defined when CONFIG_CPUMASK_OFFSTACK=y, otherwise is * a nop returning a constant 1 (in <linux/cpumask.h>). * * See alloc_cpumask_var_node. * * Return: %true if allocation succeeded, %false if not */static __always_inlinebool alloc_cpumask_var(cpumask_var_t *mask, gfp_t flags){ return alloc_cpumask_var_node(mask, flags, NUMA_NO_NODE);}
static __always_inlinebool zalloc_cpumask_var(cpumask_var_t *mask, gfp_t flags){ return alloc_cpumask_var(mask, flags | __GFP_ZERO);}
void alloc_bootmem_cpumask_var(cpumask_var_t *mask);void free_cpumask_var(cpumask_var_t mask);void free_bootmem_cpumask_var(cpumask_var_t mask);
static __always_inline bool cpumask_available(cpumask_var_t mask){ return mask != NULL;}
#else
#define this_cpu_cpumask_var_ptr(x) this_cpu_ptr(x)#define __cpumask_var_read_mostly#define CPUMASK_VAR_NULL {}
static __always_inline bool alloc_cpumask_var(cpumask_var_t *mask, gfp_t flags){ return true;}
static __always_inline bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node){ return true;}
static __always_inline bool zalloc_cpumask_var(cpumask_var_t *mask, gfp_t flags){ cpumask_clear(*mask); return true;}
static __always_inline bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node){ cpumask_clear(*mask); return true;}
static __always_inline void alloc_bootmem_cpumask_var(cpumask_var_t *mask){}
static __always_inline void free_cpumask_var(cpumask_var_t mask){}
static __always_inline void free_bootmem_cpumask_var(cpumask_var_t mask){}
static __always_inline bool cpumask_available(cpumask_var_t mask){ return true;}#endif /* CONFIG_CPUMASK_OFFSTACK */
DEFINE_FREE(free_cpumask_var, struct cpumask *, if (_T) free_cpumask_var(_T));
/* It's common to want to use cpu_all_mask in struct member initializers, * so it has to refer to an address rather than a pointer. */extern const DECLARE_BITMAP(cpu_all_bits, NR_CPUS);#define cpu_all_mask to_cpumask(cpu_all_bits)
/* First bits of cpu_bit_bitmap are in fact unset. */#define cpu_none_mask to_cpumask(cpu_bit_bitmap[0])
#if NR_CPUS == 1/* Uniprocessor: the possible/online/present masks are always "1" */#define for_each_possible_cpu(cpu) for ((cpu) = 0; (cpu) < 1; (cpu)++)#define for_each_online_cpu(cpu) for ((cpu) = 0; (cpu) < 1; (cpu)++)#define for_each_present_cpu(cpu) for ((cpu) = 0; (cpu) < 1; (cpu)++)
#define for_each_possible_cpu_wrap(cpu, start) \ for ((void)(start), (cpu) = 0; (cpu) < 1; (cpu)++)#define for_each_online_cpu_wrap(cpu, start) \ for ((void)(start), (cpu) = 0; (cpu) < 1; (cpu)++)#else#define for_each_possible_cpu(cpu) for_each_cpu((cpu), cpu_possible_mask)#define for_each_online_cpu(cpu) for_each_cpu((cpu), cpu_online_mask)#define for_each_enabled_cpu(cpu) for_each_cpu((cpu), cpu_enabled_mask)#define for_each_present_cpu(cpu) for_each_cpu((cpu), cpu_present_mask)
#define for_each_possible_cpu_wrap(cpu, start) \ for_each_cpu_wrap((cpu), cpu_possible_mask, (start))#define for_each_online_cpu_wrap(cpu, start) \ for_each_cpu_wrap((cpu), cpu_online_mask, (start))#endif
/* Wrappers for arch boot code to manipulate normally-constant masks */void init_cpu_present(const struct cpumask *src);void init_cpu_possible(const struct cpumask *src);
#define assign_cpu(cpu, mask, val) \ assign_bit(cpumask_check(cpu), cpumask_bits(mask), (val))
#define __assign_cpu(cpu, mask, val) \ __assign_bit(cpumask_check(cpu), cpumask_bits(mask), (val))
#define set_cpu_enabled(cpu, enabled) assign_cpu((cpu), &__cpu_enabled_mask, (enabled))#define set_cpu_present(cpu, present) assign_cpu((cpu), &__cpu_present_mask, (present))#define set_cpu_active(cpu, active) assign_cpu((cpu), &__cpu_active_mask, (active))#define set_cpu_dying(cpu, dying) assign_cpu((cpu), &__cpu_dying_mask, (dying))
void set_cpu_online(unsigned int cpu, bool online);void set_cpu_possible(unsigned int cpu, bool possible);
/** * to_cpumask - convert a NR_CPUS bitmap to a struct cpumask * * @bitmap: the bitmap * * There are a few places where cpumask_var_t isn't appropriate and * static cpumasks must be used (eg. very early boot), yet we don't * expose the definition of 'struct cpumask'. * * This does the conversion, and can be used as a constant initializer. */#define to_cpumask(bitmap) \ ((struct cpumask *)(1 ? (bitmap) \ : (void *)sizeof(__check_is_bitmap(bitmap))))
static __always_inline int __check_is_bitmap(const unsigned long *bitmap){ return 1;}
/* * Special-case data structure for "single bit set only" constant CPU masks. * * We pre-generate all the 64 (or 32) possible bit positions, with enough * padding to the left and the right, and return the constant pointer * appropriately offset. */extern const unsigned long cpu_bit_bitmap[BITS_PER_LONG+1][BITS_TO_LONGS(NR_CPUS)];
static __always_inline const struct cpumask *get_cpu_mask(unsigned int cpu){ const unsigned long *p = cpu_bit_bitmap[1 + cpu % BITS_PER_LONG]; p -= cpu / BITS_PER_LONG; return to_cpumask(p);}
#if NR_CPUS > 1/** * num_online_cpus() - Read the number of online CPUs * * Despite the fact that __num_online_cpus is of type atomic_t, this * interface gives only a momentary snapshot and is not protected against * concurrent CPU hotplug operations unless invoked from a cpuhp_lock held * region. * * Return: momentary snapshot of the number of online CPUs */static __always_inline unsigned int num_online_cpus(void){ return raw_atomic_read(&__num_online_cpus);}
static __always_inline unsigned int num_possible_cpus(void){ return __num_possible_cpus;}
#define num_enabled_cpus() cpumask_weight(cpu_enabled_mask)#define num_present_cpus() cpumask_weight(cpu_present_mask)#define num_active_cpus() cpumask_weight(cpu_active_mask)
static __always_inline bool cpu_online(unsigned int cpu){ return cpumask_test_cpu(cpu, cpu_online_mask);}
static __always_inline bool cpu_enabled(unsigned int cpu){ return cpumask_test_cpu(cpu, cpu_enabled_mask);}
static __always_inline bool cpu_possible(unsigned int cpu){ return cpumask_test_cpu(cpu, cpu_possible_mask);}
static __always_inline bool cpu_present(unsigned int cpu){ return cpumask_test_cpu(cpu, cpu_present_mask);}
static __always_inline bool cpu_active(unsigned int cpu){ return cpumask_test_cpu(cpu, cpu_active_mask);}
static __always_inline bool cpu_dying(unsigned int cpu){ return cpumask_test_cpu(cpu, cpu_dying_mask);}
#else
#define num_online_cpus() 1U#define num_possible_cpus() 1U#define num_enabled_cpus() 1U#define num_present_cpus() 1U#define num_active_cpus() 1U
static __always_inline bool cpu_online(unsigned int cpu){ return cpu == 0;}
static __always_inline bool cpu_possible(unsigned int cpu){ return cpu == 0;}
static __always_inline bool cpu_enabled(unsigned int cpu){ return cpu == 0;}
static __always_inline bool cpu_present(unsigned int cpu){ return cpu == 0;}
static __always_inline bool cpu_active(unsigned int cpu){ return cpu == 0;}
static __always_inline bool cpu_dying(unsigned int cpu){ return false;}
#endif /* NR_CPUS > 1 */
#define cpu_is_offline(cpu) unlikely(!cpu_online(cpu))
#if NR_CPUS <= BITS_PER_LONG#define CPU_BITS_ALL \{ \ [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \}
#else /* NR_CPUS > BITS_PER_LONG */
#define CPU_BITS_ALL \{ \ [0 ... BITS_TO_LONGS(NR_CPUS)-2] = ~0UL, \ [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \}#endif /* NR_CPUS > BITS_PER_LONG */
/** * cpumap_print_bitmask_to_buf - copies the cpumask into the buffer as * hex values of cpumask * * @buf: the buffer to copy into * @mask: the cpumask to copy * @off: in the string from which we are copying, we copy to @buf * @count: the maximum number of bytes to print * * The function prints the cpumask into the buffer as hex values of * cpumask; Typically used by bin_attribute to export cpumask bitmask * ABI. * * Return: the length of how many bytes have been copied, excluding * terminating '\0'. */static __always_inlinessize_t cpumap_print_bitmask_to_buf(char *buf, const struct cpumask *mask, loff_t off, size_t count){ return bitmap_print_bitmask_to_buf(buf, cpumask_bits(mask), nr_cpu_ids, off, count) - 1;}
/** * cpumap_print_list_to_buf - copies the cpumask into the buffer as * comma-separated list of cpus * @buf: the buffer to copy into * @mask: the cpumask to copy * @off: in the string from which we are copying, we copy to @buf * @count: the maximum number of bytes to print * * Everything is same with the above cpumap_print_bitmask_to_buf() * except the print format. * * Return: the length of how many bytes have been copied, excluding * terminating '\0'. */static __always_inlinessize_t cpumap_print_list_to_buf(char *buf, const struct cpumask *mask, loff_t off, size_t count){ return bitmap_print_list_to_buf(buf, cpumask_bits(mask), nr_cpu_ids, off, count) - 1;}
#if NR_CPUS <= BITS_PER_LONG#define CPU_MASK_ALL \(cpumask_t) { { \ [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \} }#else#define CPU_MASK_ALL \(cpumask_t) { { \ [0 ... BITS_TO_LONGS(NR_CPUS)-2] = ~0UL, \ [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \} }#endif /* NR_CPUS > BITS_PER_LONG */
#define CPU_MASK_NONE \(cpumask_t) { { \ [0 ... BITS_TO_LONGS(NR_CPUS)-1] = 0UL \} }
#define CPU_MASK_CPU0 \(cpumask_t) { { \ [0] = 1UL \} }
/* * Provide a valid theoretical max size for cpumap and cpulist sysfs files * to avoid breaking userspace which may allocate a buffer based on the size * reported by e.g. fstat. * * for cpumap NR_CPUS * 9/32 - 1 should be an exact length. * * For cpulist 7 is (ceil(log10(NR_CPUS)) + 1) allowing for NR_CPUS to be up * to 2 orders of magnitude larger than 8192. And then we divide by 2 to * cover a worst-case of every other cpu being on one of two nodes for a * very large NR_CPUS. * * Use PAGE_SIZE as a minimum for smaller configurations while avoiding * unsigned comparison to -1. */#define CPUMAP_FILE_MAX_BYTES (((NR_CPUS * 9)/32 > PAGE_SIZE) \ ? (NR_CPUS * 9)/32 - 1 : PAGE_SIZE)#define CPULIST_FILE_MAX_BYTES (((NR_CPUS * 7)/2 > PAGE_SIZE) ? (NR_CPUS * 7)/2 : PAGE_SIZE)
#endif /* __LINUX_CPUMASK_H */