1#include <linux/slab.h>
  2#include <linux/kernel.h>
  3#include <linux/bitops.h>
  4#include <linux/cpumask.h>
  5#include <linux/export.h>
  6#include <linux/bootmem.h>
  7
  8int __first_cpu(const cpumask_t *srcp)
  9{
 10	return min_t(int, NR_CPUS, find_first_bit(srcp->bits, NR_CPUS));
 11}
 12EXPORT_SYMBOL(__first_cpu);
 13
 14int __next_cpu(int n, const cpumask_t *srcp)
 15{
 16	return min_t(int, NR_CPUS, find_next_bit(srcp->bits, NR_CPUS, n+1));
 17}
 18EXPORT_SYMBOL(__next_cpu);
 19
 20#if NR_CPUS > 64
 21int __next_cpu_nr(int n, const cpumask_t *srcp)
 22{
 23	return min_t(int, nr_cpu_ids,
 24				find_next_bit(srcp->bits, nr_cpu_ids, n+1));
 25}
 26EXPORT_SYMBOL(__next_cpu_nr);
 27#endif
 28
 29/**
 30 * cpumask_next_and - get the next cpu in *src1p & *src2p
 31 * @n: the cpu prior to the place to search (ie. return will be > @n)
 32 * @src1p: the first cpumask pointer
 33 * @src2p: the second cpumask pointer
 
 34 *
 35 * Returns >= nr_cpu_ids if no further cpus set in both.
 36 */
 37int cpumask_next_and(int n, const struct cpumask *src1p,
 38		     const struct cpumask *src2p)
 39{
 40	while ((n = cpumask_next(n, src1p)) < nr_cpu_ids)
 41		if (cpumask_test_cpu(n, src2p))
 42			break;
 43	return n;
 44}
 45EXPORT_SYMBOL(cpumask_next_and);
 46
 47/**
 48 * cpumask_any_but - return a "random" in a cpumask, but not this one.
 49 * @mask: the cpumask to search
 50 * @cpu: the cpu to ignore.
 51 *
 52 * Often used to find any cpu but smp_processor_id() in a mask.
 53 * Returns >= nr_cpu_ids if no cpus set.
 54 */
 55int cpumask_any_but(const struct cpumask *mask, unsigned int cpu)
 56{
 57	unsigned int i;
 
 
 
 
 
 
 
 
 
 
 
 
 58
 59	cpumask_check(cpu);
 60	for_each_cpu(i, mask)
 61		if (i != cpu)
 62			break;
 63	return i;
 64}
 
 65
 66/* These are not inline because of header tangles. */
 67#ifdef CONFIG_CPUMASK_OFFSTACK
 68/**
 69 * alloc_cpumask_var_node - allocate a struct cpumask on a given node
 70 * @mask: pointer to cpumask_var_t where the cpumask is returned
 71 * @flags: GFP_ flags
 
 72 *
 73 * Only defined when CONFIG_CPUMASK_OFFSTACK=y, otherwise is
 74 * a nop returning a constant 1 (in <linux/cpumask.h>)
 75 * Returns TRUE if memory allocation succeeded, FALSE otherwise.
 
 76 *
 77 * In addition, mask will be NULL if this fails.  Note that gcc is
 78 * usually smart enough to know that mask can never be NULL if
 79 * CONFIG_CPUMASK_OFFSTACK=n, so does code elimination in that case
 80 * too.
 81 */
 82bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node)
 83{
 84	*mask = kmalloc_node(cpumask_size(), flags, node);
 85
 86#ifdef CONFIG_DEBUG_PER_CPU_MAPS
 87	if (!*mask) {
 88		printk(KERN_ERR "=> alloc_cpumask_var: failed!\n");
 89		dump_stack();
 90	}
 91#endif
 92	/* FIXME: Bandaid to save us from old primitives which go to NR_CPUS. */
 93	if (*mask) {
 94		unsigned char *ptr = (unsigned char *)cpumask_bits(*mask);
 95		unsigned int tail;
 96		tail = BITS_TO_LONGS(NR_CPUS - nr_cpumask_bits) * sizeof(long);
 97		memset(ptr + cpumask_size() - tail, 0, tail);
 98	}
 99
100	return *mask != NULL;
101}
102EXPORT_SYMBOL(alloc_cpumask_var_node);
103
104bool zalloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node)
105{
106	return alloc_cpumask_var_node(mask, flags | __GFP_ZERO, node);
107}
108EXPORT_SYMBOL(zalloc_cpumask_var_node);
109
110/**
111 * alloc_cpumask_var - allocate a struct cpumask
112 * @mask: pointer to cpumask_var_t where the cpumask is returned
113 * @flags: GFP_ flags
114 *
115 * Only defined when CONFIG_CPUMASK_OFFSTACK=y, otherwise is
116 * a nop returning a constant 1 (in <linux/cpumask.h>).
117 *
118 * See alloc_cpumask_var_node.
119 */
120bool alloc_cpumask_var(cpumask_var_t *mask, gfp_t flags)
121{
122	return alloc_cpumask_var_node(mask, flags, NUMA_NO_NODE);
123}
124EXPORT_SYMBOL(alloc_cpumask_var);
125
126bool zalloc_cpumask_var(cpumask_var_t *mask, gfp_t flags)
127{
128	return alloc_cpumask_var(mask, flags | __GFP_ZERO);
129}
130EXPORT_SYMBOL(zalloc_cpumask_var);
131
132/**
133 * alloc_bootmem_cpumask_var - allocate a struct cpumask from the bootmem arena.
134 * @mask: pointer to cpumask_var_t where the cpumask is returned
135 *
136 * Only defined when CONFIG_CPUMASK_OFFSTACK=y, otherwise is
137 * a nop (in <linux/cpumask.h>).
138 * Either returns an allocated (zero-filled) cpumask, or causes the
139 * system to panic.
140 */
141void __init alloc_bootmem_cpumask_var(cpumask_var_t *mask)
142{
143	*mask = memblock_virt_alloc(cpumask_size(), 0);
 
 
 
144}
145
146/**
147 * free_cpumask_var - frees memory allocated for a struct cpumask.
148 * @mask: cpumask to free
149 *
150 * This is safe on a NULL mask.
151 */
152void free_cpumask_var(cpumask_var_t mask)
153{
154	kfree(mask);
155}
156EXPORT_SYMBOL(free_cpumask_var);
157
158/**
159 * free_bootmem_cpumask_var - frees result of alloc_bootmem_cpumask_var
160 * @mask: cpumask to free
161 */
162void __init free_bootmem_cpumask_var(cpumask_var_t mask)
163{
164	memblock_free_early(__pa(mask), cpumask_size());
165}
166#endif

  1// SPDX-License-Identifier: GPL-2.0
  2#include <linux/slab.h>
  3#include <linux/kernel.h>
  4#include <linux/bitops.h>
  5#include <linux/cpumask.h>
  6#include <linux/export.h>
  7#include <linux/memblock.h>
  8#include <linux/numa.h>
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
  9
 10/**
 11 * cpumask_next_wrap - helper to implement for_each_cpu_wrap
 12 * @n: the cpu prior to the place to search
 13 * @mask: the cpumask pointer
 14 * @start: the start point of the iteration
 15 * @wrap: assume @n crossing @start terminates the iteration
 16 *
 17 * Return: >= nr_cpu_ids on completion
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 18 *
 19 * Note: the @wrap argument is required for the start condition when
 20 * we cannot assume @start is set in @mask.
 21 */
 22unsigned int cpumask_next_wrap(int n, const struct cpumask *mask, int start, bool wrap)
 23{
 24	unsigned int next;
 25
 26again:
 27	next = cpumask_next(n, mask);
 28
 29	if (wrap && n < start && next >= start) {
 30		return nr_cpumask_bits;
 31
 32	} else if (next >= nr_cpumask_bits) {
 33		wrap = true;
 34		n = -1;
 35		goto again;
 36	}
 37
 38	return next;
 
 
 
 
 39}
 40EXPORT_SYMBOL(cpumask_next_wrap);
 41
 42/* These are not inline because of header tangles. */
 43#ifdef CONFIG_CPUMASK_OFFSTACK
 44/**
 45 * alloc_cpumask_var_node - allocate a struct cpumask on a given node
 46 * @mask: pointer to cpumask_var_t where the cpumask is returned
 47 * @flags: GFP_ flags
 48 * @node: memory node from which to allocate or %NUMA_NO_NODE
 49 *
 50 * Only defined when CONFIG_CPUMASK_OFFSTACK=y, otherwise is
 51 * a nop returning a constant 1 (in <linux/cpumask.h>).
 52 *
 53 * Return: TRUE if memory allocation succeeded, FALSE otherwise.
 54 *
 55 * In addition, mask will be NULL if this fails.  Note that gcc is
 56 * usually smart enough to know that mask can never be NULL if
 57 * CONFIG_CPUMASK_OFFSTACK=n, so does code elimination in that case
 58 * too.
 59 */
 60bool alloc_cpumask_var_node(cpumask_var_t *mask, gfp_t flags, int node)
 61{
 62	*mask = kmalloc_node(cpumask_size(), flags, node);
 63
 64#ifdef CONFIG_DEBUG_PER_CPU_MAPS
 65	if (!*mask) {
 66		printk(KERN_ERR "=> alloc_cpumask_var: failed!\n");
 67		dump_stack();
 68	}
 69#endif
 
 
 
 
 
 
 
 70
 71	return *mask != NULL;
 72}
 73EXPORT_SYMBOL(alloc_cpumask_var_node);
 74
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 75/**
 76 * alloc_bootmem_cpumask_var - allocate a struct cpumask from the bootmem arena.
 77 * @mask: pointer to cpumask_var_t where the cpumask is returned
 78 *
 79 * Only defined when CONFIG_CPUMASK_OFFSTACK=y, otherwise is
 80 * a nop (in <linux/cpumask.h>).
 81 * Either returns an allocated (zero-filled) cpumask, or causes the
 82 * system to panic.
 83 */
 84void __init alloc_bootmem_cpumask_var(cpumask_var_t *mask)
 85{
 86	*mask = memblock_alloc(cpumask_size(), SMP_CACHE_BYTES);
 87	if (!*mask)
 88		panic("%s: Failed to allocate %u bytes\n", __func__,
 89		      cpumask_size());
 90}
 91
 92/**
 93 * free_cpumask_var - frees memory allocated for a struct cpumask.
 94 * @mask: cpumask to free
 95 *
 96 * This is safe on a NULL mask.
 97 */
 98void free_cpumask_var(cpumask_var_t mask)
 99{
100	kfree(mask);
101}
102EXPORT_SYMBOL(free_cpumask_var);
103
104/**
105 * free_bootmem_cpumask_var - frees result of alloc_bootmem_cpumask_var
106 * @mask: cpumask to free
107 */
108void __init free_bootmem_cpumask_var(cpumask_var_t mask)
109{
110	memblock_free(mask, cpumask_size());
111}
112#endif
113
114/**
115 * cpumask_local_spread - select the i'th cpu based on NUMA distances
116 * @i: index number
117 * @node: local numa_node
118 *
119 * Return: online CPU according to a numa aware policy; local cpus are returned
120 * first, followed by non-local ones, then it wraps around.
121 *
122 * For those who wants to enumerate all CPUs based on their NUMA distances,
123 * i.e. call this function in a loop, like:
124 *
125 * for (i = 0; i < num_online_cpus(); i++) {
126 *	cpu = cpumask_local_spread(i, node);
127 *	do_something(cpu);
128 * }
129 *
130 * There's a better alternative based on for_each()-like iterators:
131 *
132 *	for_each_numa_hop_mask(mask, node) {
133 *		for_each_cpu_andnot(cpu, mask, prev)
134 *			do_something(cpu);
135 *		prev = mask;
136 *	}
137 *
138 * It's simpler and more verbose than above. Complexity of iterator-based
139 * enumeration is O(sched_domains_numa_levels * nr_cpu_ids), while
140 * cpumask_local_spread() when called for each cpu is
141 * O(sched_domains_numa_levels * nr_cpu_ids * log(nr_cpu_ids)).
142 */
143unsigned int cpumask_local_spread(unsigned int i, int node)
144{
145	unsigned int cpu;
146
147	/* Wrap: we always want a cpu. */
148	i %= num_online_cpus();
149
150	cpu = sched_numa_find_nth_cpu(cpu_online_mask, i, node);
151
152	WARN_ON(cpu >= nr_cpu_ids);
153	return cpu;
154}
155EXPORT_SYMBOL(cpumask_local_spread);
156
157static DEFINE_PER_CPU(int, distribute_cpu_mask_prev);
158
159/**
160 * cpumask_any_and_distribute - Return an arbitrary cpu within src1p & src2p.
161 * @src1p: first &cpumask for intersection
162 * @src2p: second &cpumask for intersection
163 *
164 * Iterated calls using the same srcp1 and srcp2 will be distributed within
165 * their intersection.
166 *
167 * Return: >= nr_cpu_ids if the intersection is empty.
168 */
169unsigned int cpumask_any_and_distribute(const struct cpumask *src1p,
170			       const struct cpumask *src2p)
171{
172	unsigned int next, prev;
173
174	/* NOTE: our first selection will skip 0. */
175	prev = __this_cpu_read(distribute_cpu_mask_prev);
176
177	next = find_next_and_bit_wrap(cpumask_bits(src1p), cpumask_bits(src2p),
178					nr_cpumask_bits, prev + 1);
179	if (next < nr_cpu_ids)
180		__this_cpu_write(distribute_cpu_mask_prev, next);
181
182	return next;
183}
184EXPORT_SYMBOL(cpumask_any_and_distribute);
185
186/**
187 * cpumask_any_distribute - Return an arbitrary cpu from srcp
188 * @srcp: &cpumask for selection
189 *
190 * Return: >= nr_cpu_ids if the intersection is empty.
191 */
192unsigned int cpumask_any_distribute(const struct cpumask *srcp)
193{
194	unsigned int next, prev;
195
196	/* NOTE: our first selection will skip 0. */
197	prev = __this_cpu_read(distribute_cpu_mask_prev);
198	next = find_next_bit_wrap(cpumask_bits(srcp), nr_cpumask_bits, prev + 1);
199	if (next < nr_cpu_ids)
200		__this_cpu_write(distribute_cpu_mask_prev, next);
201
202	return next;
203}
204EXPORT_SYMBOL(cpumask_any_distribute);