2 * SPDX-License-Identifier: Beerware
4 * ----------------------------------------------------------------------------
5 * "THE BEER-WARE LICENSE" (Revision 42):
6 * <phk@FreeBSD.org> wrote this file. As long as you retain this notice you
7 * can do whatever you want with this stuff. If we meet some day, and you think
8 * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
9 * ----------------------------------------------------------------------------
21 #include <sys/cpuset.h>
22 #include <sys/queue.h>
25 * Types of nodes in the topological tree.
28 /* No node has this type; can be used in topo API calls. */
30 /* Processing unit aka computing unit aka logical CPU. */
32 /* Physical subdivision of a package. */
34 /* CPU L1/L2/L3 cache. */
36 /* Package aka chip, equivalent to socket. */
40 /* Other logical or physical grouping of PUs. */
41 /* E.g. PUs on the same dye, or PUs sharing an FPU. */
43 /* The whole system. */
47 /* Hardware indenitifier of a topology component. */
48 typedef unsigned int hwid_t;
49 /* Logical CPU idenitifier. */
52 /* A node in the topology. */
54 struct topo_node *parent;
55 TAILQ_HEAD(topo_children, topo_node) children;
56 TAILQ_ENTRY(topo_node) siblings;
67 * Scheduling topology of a NUMA or SMP system.
69 * The top level topology is an array of pointers to groups. Each group
70 * contains a bitmask of cpus in its group or subgroups. It may also
71 * contain a pointer to an array of child groups.
73 * The bitmasks at non leaf groups may be used by consumers who support
74 * a smaller depth than the hardware provides.
76 * The topology may be omitted by systems where all CPUs are equal.
80 struct cpu_group *cg_parent; /* Our parent group. */
81 struct cpu_group *cg_child; /* Optional children groups. */
82 cpuset_t cg_mask; /* Mask of cpus in this group. */
83 int32_t cg_count; /* Count of cpus in this group. */
84 int32_t cg_first; /* First cpu in this group. */
85 int32_t cg_last; /* Last cpu in this group. */
86 int16_t cg_children; /* Number of children groups. */
87 int8_t cg_level; /* Shared cache level. */
88 int8_t cg_flags; /* Traversal modifiers. */
91 typedef struct cpu_group *cpu_group_t;
94 * Defines common resources for CPUs in the group. The highest level
95 * resource should be used when multiple are shared.
97 #define CG_SHARE_NONE 0
100 #define CG_SHARE_L3 3
102 #define MAX_CACHE_LEVELS CG_SHARE_L3
105 * Behavior modifiers for load balancing and affinity.
107 #define CG_FLAG_HTT 0x01 /* Schedule the alternate core last. */
108 #define CG_FLAG_SMT 0x02 /* New age htt, less crippled. */
109 #define CG_FLAG_THREAD (CG_FLAG_HTT | CG_FLAG_SMT) /* Any threading. */
112 * Convenience routines for building and traversing topologies.
115 void topo_init_node(struct topo_node *node);
116 void topo_init_root(struct topo_node *root);
117 struct topo_node * topo_add_node_by_hwid(struct topo_node *parent, int hwid,
118 topo_node_type type, uintptr_t subtype);
119 struct topo_node * topo_find_node_by_hwid(struct topo_node *parent, int hwid,
120 topo_node_type type, uintptr_t subtype);
121 void topo_promote_child(struct topo_node *child);
122 struct topo_node * topo_next_node(struct topo_node *top,
123 struct topo_node *node);
124 struct topo_node * topo_next_nonchild_node(struct topo_node *top,
125 struct topo_node *node);
126 void topo_set_pu_id(struct topo_node *node, cpuid_t id);
131 * Some systems have useful sub-package core organizations. On these,
132 * a package has one or more subgroups. Each subgroup contains one or
133 * more cache groups (cores that share a last level cache).
136 TOPO_LEVEL_CACHEGROUP,
139 TOPO_LEVEL_COUNT /* Must be last */
141 struct topo_analysis {
142 int entities[TOPO_LEVEL_COUNT];
144 int topo_analyze(struct topo_node *topo_root, int all,
145 struct topo_analysis *results);
147 #define TOPO_FOREACH(i, root) \
148 for (i = root; i != NULL; i = topo_next_node(root, i))
150 struct cpu_group *smp_topo(void);
151 struct cpu_group *smp_topo_alloc(u_int count);
152 struct cpu_group *smp_topo_none(void);
153 struct cpu_group *smp_topo_1level(int l1share, int l1count, int l1flags);
154 struct cpu_group *smp_topo_2level(int l2share, int l2count, int l1share,
155 int l1count, int l1flags);
156 struct cpu_group *smp_topo_find(struct cpu_group *top, int cpu);
158 extern void (*cpustop_restartfunc)(void);
159 /* The suspend/resume cpusets are x86 only, but minimize ifdefs. */
160 extern volatile cpuset_t resuming_cpus; /* woken up cpus in suspend pen */
161 extern volatile cpuset_t started_cpus; /* cpus to let out of stop pen */
162 extern volatile cpuset_t stopped_cpus; /* cpus in stop pen */
163 extern volatile cpuset_t suspended_cpus; /* cpus [near] sleeping in susp pen */
164 extern volatile cpuset_t toresume_cpus; /* cpus to let out of suspend pen */
165 extern cpuset_t hlt_cpus_mask; /* XXX 'mask' is detail in old impl */
166 extern cpuset_t logical_cpus_mask;
169 extern u_int mp_maxid;
170 extern int mp_maxcpus;
171 extern int mp_ncores;
174 extern volatile int smp_started;
175 extern int smp_threads_per_core;
177 extern cpuset_t all_cpus;
178 extern cpuset_t cpuset_domain[MAXMEMDOM]; /* CPUs in each NUMA domain. */
181 * Macro allowing us to determine whether a CPU is absent at any given
182 * time, thus permitting us to configure sparse maps of cpuid-dependent
183 * (per-CPU) structures.
185 #define CPU_ABSENT(x_cpu) (!CPU_ISSET(x_cpu, &all_cpus))
188 * Macros to iterate over non-absent CPUs. CPU_FOREACH() takes an
189 * integer iterator and iterates over the available set of CPUs.
190 * CPU_FIRST() returns the id of the first non-absent CPU. CPU_NEXT()
191 * returns the id of the next non-absent CPU. It will wrap back to
192 * CPU_FIRST() once the end of the list is reached. The iterators are
193 * currently implemented via inline functions.
195 #define CPU_FOREACH(i) \
196 for ((i) = 0; (i) <= mp_maxid; (i)++) \
197 if (!CPU_ABSENT((i)))
222 #define CPU_FIRST() cpu_first()
223 #define CPU_NEXT(i) cpu_next((i))
227 * Machine dependent functions used to initialize MP support.
229 * The cpu_mp_probe() should check to see if MP support is present and return
230 * zero if it is not or non-zero if it is. If MP support is present, then
231 * cpu_mp_start() will be called so that MP can be enabled. This function
232 * should do things such as startup secondary processors. It should also
233 * setup mp_ncpus, all_cpus, and smp_cpus. It should also ensure that
234 * smp_started is initialized at the appropriate time.
235 * Once cpu_mp_start() returns, machine independent MP startup code will be
236 * executed and a simple message will be output to the console. Finally,
237 * cpu_mp_announce() will be called so that machine dependent messages about
238 * the MP support may be output to the console if desired.
240 * The cpu_setmaxid() function is called very early during the boot process
241 * so that the MD code may set mp_maxid to provide an upper bound on CPU IDs
242 * that other subsystems may use. If a platform is not able to determine
243 * the exact maximum ID that early, then it may set mp_maxid to MAXCPU - 1.
247 struct cpu_group *cpu_topo(void);
248 void cpu_mp_announce(void);
249 int cpu_mp_probe(void);
250 void cpu_mp_setmaxid(void);
251 void cpu_mp_start(void);
253 void forward_signal(struct thread *);
254 int restart_cpus(cpuset_t);
255 int stop_cpus(cpuset_t);
256 int stop_cpus_hard(cpuset_t);
257 #if defined(__amd64__) || defined(__i386__)
258 int suspend_cpus(cpuset_t);
259 int resume_cpus(cpuset_t);
262 void smp_rendezvous_action(void);
263 extern struct mtx smp_ipi_mtx;
267 int quiesce_all_cpus(const char *, int);
268 int quiesce_cpus(cpuset_t, const char *, int);
269 void quiesce_all_critical(void);
270 void cpus_fence_seq_cst(void);
271 void smp_no_rendezvous_barrier(void *);
272 void smp_rendezvous(void (*)(void *),
276 void smp_rendezvous_cpus(cpuset_t,
282 struct smp_rendezvous_cpus_retry_arg {
285 void smp_rendezvous_cpus_retry(cpuset_t,
289 void (*)(void *, int),
290 struct smp_rendezvous_cpus_retry_arg *);
292 void smp_rendezvous_cpus_done(struct smp_rendezvous_cpus_retry_arg *);
296 #endif /* _SYS_SMP_H_ */