cpumask_next

Name:pumask_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.

Proto:unsigned int cpumask_next(int n, const struct cpumask *srcp)

Type:unsigned int

Parameter:

Type	Parameter	Name
int	n
const struct cpumask *	srcp

**Caller**
Name	Describe
cpumask_next_wrap	pumask_next_wrap - helper to implement for_each_cpu_wrap@n: the cpu prior to the place to search@mask: the cpumask pointer@start: the start point of the iteration@wrap: assume @n crossing @start terminates the iteration* Returns >= nr_cpu_ids on
sched_debug_start	This itererator needs some explanation.* It returns 1 for the header position.* This means 2 is CPU 0.* In a hotplugged system some CPUs, including CPU 0, may be missing so we have* to use cpumask_* to iterate over the CPUs.
irq_reserve_ipi	q_reserve_ipi() - Setup an IPI to destination cpumask@domain: IPI domain@dest: cpumask of cpus which can receive the IPI* Allocate a virq that can be used to send IPI to any CPU in dest mask
irq_spread_init_one
move_iter
move_to_next_cpu
__pcpu_freelist_pop
get_next_cpu
padata_index_to_cpu
padata_do_parallel	padata_do_parallel - padata parallelization function@ps: padatashell@padata: object to be parallelized@cb_cpu: pointer to the CPU that the serialization callback function should run on. If it's not in the serial cpumask of @pinst* (i
torture_shuffle_tasks	Shuffle tasks such that we allow shuffle_idle_cpu to become idle.* A special case is when shuffle_idle_cpu = -1, in which case we allow* the tasks to run on all CPUs.
seq_hlist_next_percpu	seq_hlist_next_percpu - move to the next position of the percpu hlist array@v: pointer to current hlist_node@head: pointer to percpu array of struct hlist_heads@cpu: pointer to cpu "cursor"@pos: start position of sequence

Function report