123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302 |
- #ifndef __LINUX_CPUMASK_H
- #define __LINUX_CPUMASK_H
- #define NR_CPUS 4096
- /*
- * Cpumasks provide a bitmap suitable for representing the
- * set of CPU's in a system, one bit position per CPU number.
- *
- * See detailed comments in the file linux/bitmap.h describing the
- * data type on which these cpumasks are based.
- *
- * For details of cpumask_scnprintf() and cpumask_parse_user(),
- * see bitmap_scnprintf() and bitmap_parse_user() in lib/bitmap.c.
- * For details of cpulist_scnprintf() and cpulist_parse(), see
- * bitmap_scnlistprintf() and bitmap_parselist(), also in bitmap.c.
- * For details of cpu_remap(), see bitmap_bitremap in lib/bitmap.c
- * For details of cpus_remap(), see bitmap_remap in lib/bitmap.c.
- *
- * The available cpumask operations are:
- *
- * void cpu_set(cpu, mask) turn on bit 'cpu' in mask
- * void cpu_clear(cpu, mask) turn off bit 'cpu' in mask
- * void cpus_setall(mask) set all bits
- * void cpus_clear(mask) clear all bits
- * int cpu_isset(cpu, mask) true iff bit 'cpu' set in mask
- * int cpu_test_and_set(cpu, mask) test and set bit 'cpu' in mask
- *
- * void cpus_and(dst, src1, src2) dst = src1 & src2 [intersection]
- * void cpus_or(dst, src1, src2) dst = src1 | src2 [union]
- * void cpus_xor(dst, src1, src2) dst = src1 ^ src2
- * void cpus_andnot(dst, src1, src2) dst = src1 & ~src2
- * void cpus_complement(dst, src) dst = ~src
- *
- * int cpus_equal(mask1, mask2) Does mask1 == mask2?
- * int cpus_intersects(mask1, mask2) Do mask1 and mask2 intersect?
- * int cpus_subset(mask1, mask2) Is mask1 a subset of mask2?
- * int cpus_empty(mask) Is mask empty (no bits sets)?
- * int cpus_full(mask) Is mask full (all bits sets)?
- * int cpus_weight(mask) Hamming weigh - number of set bits
- *
- * void cpus_shift_right(dst, src, n) Shift right
- * void cpus_shift_left(dst, src, n) Shift left
- *
- * int first_cpu(mask) Number lowest set bit, or NR_CPUS
- * int next_cpu(cpu, mask) Next cpu past 'cpu', or NR_CPUS
- *
- * cpumask_t cpumask_of_cpu(cpu) Return cpumask with bit 'cpu' set
- * CPU_MASK_ALL Initializer - all bits set
- * CPU_MASK_NONE Initializer - no bits set
- * unsigned long *cpus_addr(mask) Array of unsigned long's in mask
- *
- * int cpumask_scnprintf(buf, len, mask) Format cpumask for printing
- * int cpumask_parse_user(ubuf, ulen, mask) Parse ascii string as cpumask
- * int cpulist_scnprintf(buf, len, mask) Format cpumask as list for printing
- * int cpulist_parse(buf, map) Parse ascii string as cpulist
- * int cpu_remap(oldbit, old, new) newbit = map(old, new)(oldbit)
- * int cpus_remap(dst, src, old, new) *dst = map(old, new)(src)
- *
- * for_each_cpu_mask(cpu, mask) for-loop cpu over mask
- *
- * int num_online_cpus() Number of online CPUs
- * int num_possible_cpus() Number of all possible CPUs
- * int num_present_cpus() Number of present CPUs
- *
- * int cpu_online(cpu) Is some cpu online?
- * int cpu_possible(cpu) Is some cpu possible?
- * int cpu_present(cpu) Is some cpu present (can schedule)?
- *
- * int any_online_cpu(mask) First online cpu in mask
- *
- * for_each_possible_cpu(cpu) for-loop cpu over cpu_possible_map
- * for_each_online_cpu(cpu) for-loop cpu over cpu_online_map
- * for_each_present_cpu(cpu) for-loop cpu over cpu_present_map
- *
- * Subtlety:
- * 1) The 'type-checked' form of cpu_isset() causes gcc (3.3.2, anyway)
- * to generate slightly worse code. Note for example the additional
- * 40 lines of assembly code compiling the "for each possible cpu"
- * loops buried in the disk_stat_read() macros calls when compiling
- * drivers/block/genhd.c (arch i386, CONFIG_SMP=y). So use a simple
- * one-line #define for cpu_isset(), instead of wrapping an inline
- * inside a macro, the way we do the other calls.
- */
- #include <stdlib.h>
- #include "bit_array.h"
- #include "hexio.h"
- typedef struct {
- BIT_ARRAY* bits;
- } cpumask_t;
- extern cpumask_t _unused_cpumask_arg_;
- #define cpus_init(dst) ((dst).bits = bit_array_create(NR_CPUS))
- #define cpus_free(dst) (bit_array_free((dst).bits))
- #define cpus_copy(dst, src) bit_array_copy_all((dst).bits, (src).bits)
- #define cpu_set(cpu, dst) bit_array_set_bit((dst).bits, cpu)
- #define cpu_clear(cpu, dst) bit_array_clear_bit((dst).bits, cpu)
- #define cpus_setall(dst) bit_array_set_all((dst).bits)
- #define cpus_clear(dst) bit_array_clear_all((dst).bits)
- #define cpu_isset(cpu, cpumask) bit_array_get_bit((cpumask).bits, cpu)
- #define cpus_and(dst, src1, src2) bit_array_and((dst).bits, (src1).bits, (src2).bits)
- #define cpus_or(dst, src1, src2) bit_array_or((dst).bits, (src1).bits, (src2).bits)
- #define cpus_xor(dst, src1, src2) bit_array_xor((dst).bits, (src1).bits, (src2).bits)
- #define cpus_complement(dst, src) bit_array_not((dst).bits, (src).bits)
- #define cpus_equal(src1, src2) (bit_array_cmp((src1).bits, (src2).bits) == 0)
- #define cpus_empty(src) (bit_array_num_bits_set((src).bits) == 0)
- #define cpus_full(src) (bit_array_num_bits_cleared((src).bits) == 0)
- #define cpus_weight(cpumask) bit_array_num_bits_set((cpumask).bits)\
- #define cpus_shift_right(dst, n) bit_array_shift_right((dst).bits, n, 0)
- #define cpus_shift_left(dst, n) bit_array_shift_left((dst).bits, n, 0)
- static inline int __first_cpu(const cpumask_t srcp)
- {
- bit_index_t res = bit_array_length(srcp.bits);
- bit_array_find_first_set_bit(srcp.bits, &res);
- return res;
- }
- #define first_cpu(src) __first_cpu((src))
- int __next_cpu(int n, const cpumask_t *srcp);
- #define next_cpu(n, src) __next_cpu((n), (src))
- /*#define cpumask_of_cpu(cpu) \
- ({ \
- typeof(_unused_cpumask_arg_) m; \
- if (sizeof(m) == sizeof(unsigned long)) { \
- m.bits[0] = 1UL<<(cpu); \
- } else { \
- cpus_clear(m); \
- cpu_set((cpu), m); \
- } \
- m; \
- })
- #define CPU_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(NR_CPUS)
- #if 0
- #define CPU_MASK_ALL \
- (cpumask_t) { { \
- [BITS_TO_LONGS(NR_CPUS)-1] = CPU_MASK_LAST_WORD \
- } }
- #else
- #define CPU_MASK_ALL \
- (cpumask_t) { { \
- [0 ... BITS_TO_LONGS(NR_CPUS)-2] = ~0UL, \
- [BITS_TO_LONGS(NR_CPUS)-1] = CPU_MASK_LAST_WORD \
- } }
- #endif
- #define CPU_MASK_NONE \
- (cpumask_t) { { \
- [0 ... BITS_TO_LONGS(NR_CPUS)-1] = 0UL \
- } }
- #define CPU_MASK_CPU0 \
- (cpumask_t) { { \
- [0] = 1UL \
- } }
- #define cpus_addr(src) ((src).bits)
- */
- #define cpumask_scnprintf(buf, len, src) bitmask_displayhex((buf), (len), (src).bits)
- #define cpumask_parse_user(ubuf, ulen, dst) bitmask_parsehex((ubuf), (dst).bits)
- /*
- #define cpulist_scnprintf(buf, len, src) \
- __cpulist_scnprintf((buf), (len), &(src), NR_CPUS)
- static inline int __cpulist_scnprintf(char *buf, int len,
- const cpumask_t *srcp, int nbits)
- {
- return bitmap_scnlistprintf(buf, len, srcp->bits, nbits);
- }
- #define cpulist_parse(buf, dst) __cpulist_parse((buf), &(dst), NR_CPUS)
- static inline int __cpulist_parse(const char *buf, cpumask_t *dstp, int nbits)
- {
- return bitmap_parselist(buf, dstp->bits, nbits);
- }
- #define cpu_remap(oldbit, old, new) \
- __cpu_remap((oldbit), &(old), &(new), NR_CPUS)
- static inline int __cpu_remap(int oldbit,
- const cpumask_t *oldp, const cpumask_t *newp, int nbits)
- {
- return bitmap_bitremap(oldbit, oldp->bits, newp->bits, nbits);
- }
- #define cpus_remap(dst, src, old, new) \
- __cpus_remap(&(dst), &(src), &(old), &(new), NR_CPUS)
- static inline void __cpus_remap(cpumask_t *dstp, const cpumask_t *srcp,
- const cpumask_t *oldp, const cpumask_t *newp, int nbits)
- {
- bitmap_remap(dstp->bits, srcp->bits, oldp->bits, newp->bits, nbits);
- }
- */
- /*#if NR_CPUS > 1
- #define for_each_cpu_mask(cpu, mask) \
- for ((cpu) = first_cpu(mask); \
- (cpu) < NR_CPUS; \
- (cpu) = next_cpu((cpu), (mask)))
- #else *//* NR_CPUS == 1 */
- /*#define for_each_cpu_mask(cpu, mask) \
- for ((cpu) = 0; (cpu) < 1; (cpu)++, (void)mask)
- #endif *//* NR_CPUS */
- /*
- * The following particular system cpumasks and operations manage
- * possible, present and online cpus. Each of them is a fixed size
- * bitmap of size NR_CPUS.
- *
- * #ifdef CONFIG_HOTPLUG_CPU
- * cpu_possible_map - has bit 'cpu' set iff cpu is populatable
- * cpu_present_map - has bit 'cpu' set iff cpu is populated
- * cpu_online_map - has bit 'cpu' set iff cpu available to scheduler
- * #else
- * cpu_possible_map - has bit 'cpu' set iff cpu is populated
- * cpu_present_map - copy of cpu_possible_map
- * cpu_online_map - has bit 'cpu' set iff cpu available to scheduler
- * #endif
- *
- * In either case, NR_CPUS is fixed at compile time, as the static
- * size of these bitmaps. The cpu_possible_map 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_map is dynamic(*), representing which CPUs
- * are currently plugged in. And cpu_online_map is the dynamic
- * subset of cpu_present_map, indicating those CPUs available
- * for scheduling.
- *
- * If HOTPLUG is enabled, then cpu_possible_map 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_map varies dynamically,
- * depending on what ACPI reports as currently plugged in, otherwise
- * cpu_present_map is just a copy of cpu_possible_map.
- *
- * (*) Well, cpu_present_map is dynamic in the hotplug case. If not
- * hotplug, it's a copy of cpu_possible_map, 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}_maps 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.
- * 2) Most SMP arch's #define some of these maps to be some
- * other map specific to that arch. Therefore, the following
- * must be #define macros, not inlines. To see why, examine
- * the assembly code produced by the following. Note that
- * set1() writes phys_x_map, but set2() writes x_map:
- * int x_map, phys_x_map;
- * #define set1(a) x_map = a
- * inline void set2(int a) { x_map = a; }
- * #define x_map phys_x_map
- * main(){ set1(3); set2(5); }
- */
- /*
- extern cpumask_t cpu_possible_map;
- extern cpumask_t cpu_online_map;
- extern cpumask_t cpu_present_map;
- #if NR_CPUS > 1
- #define num_online_cpus() cpus_weight(cpu_online_map)
- #define num_possible_cpus() cpus_weight(cpu_possible_map)
- #define num_present_cpus() cpus_weight(cpu_present_map)
- #define cpu_online(cpu) cpu_isset((cpu), cpu_online_map)
- #define cpu_possible(cpu) cpu_isset((cpu), cpu_possible_map)
- #define cpu_present(cpu) cpu_isset((cpu), cpu_present_map)
- #else
- #define num_online_cpus() 1
- #define num_possible_cpus() 1
- #define num_present_cpus() 1
- #define cpu_online(cpu) ((cpu) == 0)
- #define cpu_possible(cpu) ((cpu) == 0)
- #define cpu_present(cpu) ((cpu) == 0)
- #endif
- int highest_possible_processor_id(void);
- #define any_online_cpu(mask) __any_online_cpu(&(mask))
- int __any_online_cpu(const cpumask_t *mask);
- #define for_each_possible_cpu(cpu) for_each_cpu_mask((cpu), cpu_possible_map)
- #define for_each_online_cpu(cpu) for_each_cpu_mask((cpu), cpu_online_map)
- #define for_each_present_cpu(cpu) for_each_cpu_mask((cpu), cpu_present_map)
- */
- #endif /* __LINUX_CPUMASK_H */
|