mirror of
https://github.com/torvalds/linux.git
synced 2025-11-04 02:30:34 +02:00
96a9b4d31e
text data bss dec hex filename before: 3605597 1363528 363328 5332453 515de5 vmlinux after: 3605295 1363612 363200 5332107 515c8b vmlinux 218 bytes saved. Also, optimise any_online_cpu() out of existence on CONFIG_SMP=n. This function seems inefficient. Can't we simply AND the two masks, then use find_first_bit()? Cc: Paul Jackson <pj@sgi.com> Signed-off-by: Andrew Morton <akpm@osdl.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
45 lines
972 B
C
45 lines
972 B
C
#include <linux/kernel.h>
|
|
#include <linux/bitops.h>
|
|
#include <linux/cpumask.h>
|
|
#include <linux/module.h>
|
|
|
|
int __first_cpu(const cpumask_t *srcp)
|
|
{
|
|
return min_t(int, NR_CPUS, find_first_bit(srcp->bits, NR_CPUS));
|
|
}
|
|
EXPORT_SYMBOL(__first_cpu);
|
|
|
|
int __next_cpu(int n, const cpumask_t *srcp)
|
|
{
|
|
return min_t(int, NR_CPUS, find_next_bit(srcp->bits, NR_CPUS, n+1));
|
|
}
|
|
EXPORT_SYMBOL(__next_cpu);
|
|
|
|
/*
|
|
* Find the highest possible smp_processor_id()
|
|
*
|
|
* Note: if we're prepared to assume that cpu_possible_map never changes
|
|
* (reasonable) then this function should cache its return value.
|
|
*/
|
|
int highest_possible_processor_id(void)
|
|
{
|
|
unsigned int cpu;
|
|
unsigned highest = 0;
|
|
|
|
for_each_cpu_mask(cpu, cpu_possible_map)
|
|
highest = cpu;
|
|
return highest;
|
|
}
|
|
EXPORT_SYMBOL(highest_possible_processor_id);
|
|
|
|
int __any_online_cpu(const cpumask_t *mask)
|
|
{
|
|
int cpu;
|
|
|
|
for_each_cpu_mask(cpu, *mask) {
|
|
if (cpu_online(cpu))
|
|
break;
|
|
}
|
|
return cpu;
|
|
}
|
|
EXPORT_SYMBOL(__any_online_cpu);
|