2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2001, John Baldwin <jhb@FreeBSD.org>.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * This module holds the global variables and machine independent functions
31 * used for the kernel SMP support.
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
37 #include <sys/param.h>
38 #include <sys/systm.h>
39 #include <sys/kernel.h>
44 #include <sys/malloc.h>
45 #include <sys/mutex.h>
47 #include <sys/sched.h>
49 #include <sys/sysctl.h>
51 #include <machine/cpu.h>
52 #include <machine/smp.h>
54 #include "opt_sched.h"
57 MALLOC_DEFINE(M_TOPO, "toponodes", "SMP topology data");
59 volatile cpuset_t stopped_cpus;
60 volatile cpuset_t started_cpus;
61 volatile cpuset_t suspended_cpus;
62 cpuset_t hlt_cpus_mask;
63 cpuset_t logical_cpus_mask;
65 void (*cpustop_restartfunc)(void);
68 static int sysctl_kern_smp_active(SYSCTL_HANDLER_ARGS);
70 /* This is used in modules that need to work in both SMP and UP. */
74 /* export this for libkvm consumers. */
75 int mp_maxcpus = MAXCPU;
77 volatile int smp_started;
80 static SYSCTL_NODE(_kern, OID_AUTO, smp, CTLFLAG_RD|CTLFLAG_CAPRD, NULL,
83 SYSCTL_INT(_kern_smp, OID_AUTO, maxid, CTLFLAG_RD|CTLFLAG_CAPRD, &mp_maxid, 0,
86 SYSCTL_INT(_kern_smp, OID_AUTO, maxcpus, CTLFLAG_RD|CTLFLAG_CAPRD, &mp_maxcpus,
87 0, "Max number of CPUs that the system was compiled for.");
89 SYSCTL_PROC(_kern_smp, OID_AUTO, active, CTLFLAG_RD|CTLTYPE_INT|CTLFLAG_MPSAFE,
90 NULL, 0, sysctl_kern_smp_active, "I",
91 "Indicates system is running in SMP mode");
93 int smp_disabled = 0; /* has smp been disabled? */
94 SYSCTL_INT(_kern_smp, OID_AUTO, disabled, CTLFLAG_RDTUN|CTLFLAG_CAPRD,
95 &smp_disabled, 0, "SMP has been disabled from the loader");
97 int smp_cpus = 1; /* how many cpu's running */
98 SYSCTL_INT(_kern_smp, OID_AUTO, cpus, CTLFLAG_RD|CTLFLAG_CAPRD, &smp_cpus, 0,
99 "Number of CPUs online");
101 int smp_topology = 0; /* Which topology we're using. */
102 SYSCTL_INT(_kern_smp, OID_AUTO, topology, CTLFLAG_RDTUN, &smp_topology, 0,
103 "Topology override setting; 0 is default provided by hardware.");
106 /* Enable forwarding of a signal to a process running on a different CPU */
107 static int forward_signal_enabled = 1;
108 SYSCTL_INT(_kern_smp, OID_AUTO, forward_signal_enabled, CTLFLAG_RW,
109 &forward_signal_enabled, 0,
110 "Forwarding of a signal to a process on a different CPU");
112 /* Variables needed for SMP rendezvous. */
113 static volatile int smp_rv_ncpus;
114 static void (*volatile smp_rv_setup_func)(void *arg);
115 static void (*volatile smp_rv_action_func)(void *arg);
116 static void (*volatile smp_rv_teardown_func)(void *arg);
117 static void *volatile smp_rv_func_arg;
118 static volatile int smp_rv_waiters[4];
121 * Shared mutex to restrict busywaits between smp_rendezvous() and
122 * smp(_targeted)_tlb_shootdown(). A deadlock occurs if both of these
123 * functions trigger at once and cause multiple CPUs to busywait with
124 * interrupts disabled.
126 struct mtx smp_ipi_mtx;
129 * Let the MD SMP code initialize mp_maxid very early if it can.
132 mp_setmaxid(void *dummy)
137 KASSERT(mp_ncpus >= 1, ("%s: CPU count < 1", __func__));
138 KASSERT(mp_ncpus > 1 || mp_maxid == 0,
139 ("%s: one CPU but mp_maxid is not zero", __func__));
140 KASSERT(mp_maxid >= mp_ncpus - 1,
141 ("%s: counters out of sync: max %d, count %d", __func__,
142 mp_maxid, mp_ncpus));
144 SYSINIT(cpu_mp_setmaxid, SI_SUB_TUNABLES, SI_ORDER_FIRST, mp_setmaxid, NULL);
147 * Call the MD SMP initialization code.
150 mp_start(void *dummy)
153 mtx_init(&smp_ipi_mtx, "smp rendezvous", NULL, MTX_SPIN);
155 /* Probe for MP hardware. */
156 if (smp_disabled != 0 || cpu_mp_probe() == 0) {
158 CPU_SETOF(PCPU_GET(cpuid), &all_cpus);
163 printf("FreeBSD/SMP: Multiprocessor System Detected: %d CPUs\n",
167 SYSINIT(cpu_mp, SI_SUB_CPU, SI_ORDER_THIRD, mp_start, NULL);
170 forward_signal(struct thread *td)
175 * signotify() has already set TDF_ASTPENDING and TDF_NEEDSIGCHECK on
176 * this thread, so all we need to do is poke it if it is currently
177 * executing so that it executes ast().
179 THREAD_LOCK_ASSERT(td, MA_OWNED);
180 KASSERT(TD_IS_RUNNING(td),
181 ("forward_signal: thread is not TDS_RUNNING"));
183 CTR1(KTR_SMP, "forward_signal(%p)", td->td_proc);
185 if (!smp_started || cold || panicstr)
187 if (!forward_signal_enabled)
190 /* No need to IPI ourself. */
197 ipi_cpu(id, IPI_AST);
201 * When called the executing CPU will send an IPI to all other CPUs
202 * requesting that they halt execution.
204 * Usually (but not necessarily) called with 'other_cpus' as its arg.
206 * - Signals all CPUs in map to stop.
207 * - Waits for each to stop.
215 #if defined(__amd64__) || defined(__i386__)
221 generic_stop_cpus(cpuset_t map, u_int type)
224 char cpusetbuf[CPUSETBUFSIZ];
226 static volatile u_int stopping_cpu = NOCPU;
228 volatile cpuset_t *cpus;
231 type == IPI_STOP || type == IPI_STOP_HARD
233 || type == IPI_SUSPEND
235 , ("%s: invalid stop type", __func__));
240 CTR2(KTR_SMP, "stop_cpus(%s) with %u type",
241 cpusetobj_strprint(cpusetbuf, &map), type);
245 * When suspending, ensure there are are no IPIs in progress.
246 * IPIs that have been issued, but not yet delivered (e.g.
247 * not pending on a vCPU when running under virtualization)
248 * will be lost, violating FreeBSD's assumption of reliable
251 if (type == IPI_SUSPEND)
252 mtx_lock_spin(&smp_ipi_mtx);
256 if (!nmi_is_broadcast || nmi_kdb_lock == 0) {
258 if (stopping_cpu != PCPU_GET(cpuid))
259 while (atomic_cmpset_int(&stopping_cpu, NOCPU,
260 PCPU_GET(cpuid)) == 0)
261 while (stopping_cpu != NOCPU)
262 cpu_spinwait(); /* spin */
264 /* send the stop IPI to all CPUs in map */
265 ipi_selected(map, type);
271 if (type == IPI_SUSPEND)
272 cpus = &suspended_cpus;
275 cpus = &stopped_cpus;
278 while (!CPU_SUBSET(cpus, &map)) {
282 if (i == 100000000) {
283 printf("timeout stopping cpus\n");
289 if (type == IPI_SUSPEND)
290 mtx_unlock_spin(&smp_ipi_mtx);
293 stopping_cpu = NOCPU;
298 stop_cpus(cpuset_t map)
301 return (generic_stop_cpus(map, IPI_STOP));
305 stop_cpus_hard(cpuset_t map)
308 return (generic_stop_cpus(map, IPI_STOP_HARD));
313 suspend_cpus(cpuset_t map)
316 return (generic_stop_cpus(map, IPI_SUSPEND));
321 * Called by a CPU to restart stopped CPUs.
323 * Usually (but not necessarily) called with 'stopped_cpus' as its arg.
325 * - Signals all CPUs in map to restart.
326 * - Waits for each to restart.
334 generic_restart_cpus(cpuset_t map, u_int type)
337 char cpusetbuf[CPUSETBUFSIZ];
339 volatile cpuset_t *cpus;
341 KASSERT(type == IPI_STOP || type == IPI_STOP_HARD
343 || type == IPI_SUSPEND
345 , ("%s: invalid stop type", __func__));
350 CTR1(KTR_SMP, "restart_cpus(%s)", cpusetobj_strprint(cpusetbuf, &map));
353 if (type == IPI_SUSPEND)
354 cpus = &resuming_cpus;
357 cpus = &stopped_cpus;
359 /* signal other cpus to restart */
361 if (type == IPI_SUSPEND)
362 CPU_COPY_STORE_REL(&map, &toresume_cpus);
365 CPU_COPY_STORE_REL(&map, &started_cpus);
368 if (!nmi_is_broadcast || nmi_kdb_lock == 0) {
370 /* wait for each to clear its bit */
371 while (CPU_OVERLAP(cpus, &map))
381 restart_cpus(cpuset_t map)
384 return (generic_restart_cpus(map, IPI_STOP));
389 resume_cpus(cpuset_t map)
392 return (generic_restart_cpus(map, IPI_SUSPEND));
398 * All-CPU rendezvous. CPUs are signalled, all execute the setup function
399 * (if specified), rendezvous, execute the action function (if specified),
400 * rendezvous again, execute the teardown function (if specified), and then
403 * Note that the supplied external functions _must_ be reentrant and aware
404 * that they are running in parallel and in an unknown lock context.
407 smp_rendezvous_action(void)
410 void *local_func_arg;
411 void (*local_setup_func)(void*);
412 void (*local_action_func)(void*);
413 void (*local_teardown_func)(void*);
418 /* Ensure we have up-to-date values. */
419 atomic_add_acq_int(&smp_rv_waiters[0], 1);
420 while (smp_rv_waiters[0] < smp_rv_ncpus)
423 /* Fetch rendezvous parameters after acquire barrier. */
424 local_func_arg = smp_rv_func_arg;
425 local_setup_func = smp_rv_setup_func;
426 local_action_func = smp_rv_action_func;
427 local_teardown_func = smp_rv_teardown_func;
430 * Use a nested critical section to prevent any preemptions
431 * from occurring during a rendezvous action routine.
432 * Specifically, if a rendezvous handler is invoked via an IPI
433 * and the interrupted thread was in the critical_exit()
434 * function after setting td_critnest to 0 but before
435 * performing a deferred preemption, this routine can be
436 * invoked with td_critnest set to 0 and td_owepreempt true.
437 * In that case, a critical_exit() during the rendezvous
438 * action would trigger a preemption which is not permitted in
439 * a rendezvous action. To fix this, wrap all of the
440 * rendezvous action handlers in a critical section. We
441 * cannot use a regular critical section however as having
442 * critical_exit() preempt from this routine would also be
443 * problematic (the preemption must not occur before the IPI
444 * has been acknowledged via an EOI). Instead, we
445 * intentionally ignore td_owepreempt when leaving the
446 * critical section. This should be harmless because we do
447 * not permit rendezvous action routines to schedule threads,
448 * and thus td_owepreempt should never transition from 0 to 1
449 * during this routine.
454 owepreempt = td->td_owepreempt;
458 * If requested, run a setup function before the main action
459 * function. Ensure all CPUs have completed the setup
460 * function before moving on to the action function.
462 if (local_setup_func != smp_no_rendezvous_barrier) {
463 if (smp_rv_setup_func != NULL)
464 smp_rv_setup_func(smp_rv_func_arg);
465 atomic_add_int(&smp_rv_waiters[1], 1);
466 while (smp_rv_waiters[1] < smp_rv_ncpus)
470 if (local_action_func != NULL)
471 local_action_func(local_func_arg);
473 if (local_teardown_func != smp_no_rendezvous_barrier) {
475 * Signal that the main action has been completed. If a
476 * full exit rendezvous is requested, then all CPUs will
477 * wait here until all CPUs have finished the main action.
479 atomic_add_int(&smp_rv_waiters[2], 1);
480 while (smp_rv_waiters[2] < smp_rv_ncpus)
483 if (local_teardown_func != NULL)
484 local_teardown_func(local_func_arg);
488 * Signal that the rendezvous is fully completed by this CPU.
489 * This means that no member of smp_rv_* pseudo-structure will be
490 * accessed by this target CPU after this point; in particular,
491 * memory pointed by smp_rv_func_arg.
493 * The release semantic ensures that all accesses performed by
494 * the current CPU are visible when smp_rendezvous_cpus()
495 * returns, by synchronizing with the
496 * atomic_load_acq_int(&smp_rv_waiters[3]).
498 atomic_add_rel_int(&smp_rv_waiters[3], 1);
501 KASSERT(owepreempt == td->td_owepreempt,
502 ("rendezvous action changed td_owepreempt"));
506 smp_rendezvous_cpus(cpuset_t map,
507 void (* setup_func)(void *),
508 void (* action_func)(void *),
509 void (* teardown_func)(void *),
512 int curcpumap, i, ncpus = 0;
514 /* Look comments in the !SMP case. */
517 if (setup_func != NULL)
519 if (action_func != NULL)
521 if (teardown_func != NULL)
528 if (CPU_ISSET(i, &map))
532 panic("ncpus is 0 with non-zero map");
534 mtx_lock_spin(&smp_ipi_mtx);
536 /* Pass rendezvous parameters via global variables. */
537 smp_rv_ncpus = ncpus;
538 smp_rv_setup_func = setup_func;
539 smp_rv_action_func = action_func;
540 smp_rv_teardown_func = teardown_func;
541 smp_rv_func_arg = arg;
542 smp_rv_waiters[1] = 0;
543 smp_rv_waiters[2] = 0;
544 smp_rv_waiters[3] = 0;
545 atomic_store_rel_int(&smp_rv_waiters[0], 0);
548 * Signal other processors, which will enter the IPI with
551 curcpumap = CPU_ISSET(curcpu, &map);
552 CPU_CLR(curcpu, &map);
553 ipi_selected(map, IPI_RENDEZVOUS);
555 /* Check if the current CPU is in the map */
557 smp_rendezvous_action();
560 * Ensure that the master CPU waits for all the other
561 * CPUs to finish the rendezvous, so that smp_rv_*
562 * pseudo-structure and the arg are guaranteed to not
565 * Load acquire synchronizes with the release add in
566 * smp_rendezvous_action(), which ensures that our caller sees
567 * all memory actions done by the called functions on other
570 while (atomic_load_acq_int(&smp_rv_waiters[3]) < ncpus)
573 mtx_unlock_spin(&smp_ipi_mtx);
577 smp_rendezvous(void (* setup_func)(void *),
578 void (* action_func)(void *),
579 void (* teardown_func)(void *),
582 smp_rendezvous_cpus(all_cpus, setup_func, action_func, teardown_func, arg);
585 static struct cpu_group group[MAXCPU * MAX_CACHE_LEVELS + 1];
590 char cpusetbuf[CPUSETBUFSIZ], cpusetbuf2[CPUSETBUFSIZ];
591 struct cpu_group *top;
594 * Check for a fake topology request for debugging purposes.
596 switch (smp_topology) {
598 /* Dual core with no sharing. */
599 top = smp_topo_1level(CG_SHARE_NONE, 2, 0);
602 /* No topology, all cpus are equal. */
603 top = smp_topo_none();
606 /* Dual core with shared L2. */
607 top = smp_topo_1level(CG_SHARE_L2, 2, 0);
610 /* quad core, shared l3 among each package, private l2. */
611 top = smp_topo_1level(CG_SHARE_L3, 4, 0);
614 /* quad core, 2 dualcore parts on each package share l2. */
615 top = smp_topo_2level(CG_SHARE_NONE, 2, CG_SHARE_L2, 2, 0);
618 /* Single-core 2xHTT */
619 top = smp_topo_1level(CG_SHARE_L1, 2, CG_FLAG_HTT);
622 /* quad core with a shared l3, 8 threads sharing L2. */
623 top = smp_topo_2level(CG_SHARE_L3, 4, CG_SHARE_L2, 8,
627 /* Default, ask the system what it wants. */
632 * Verify the returned topology.
634 if (top->cg_count != mp_ncpus)
635 panic("Built bad topology at %p. CPU count %d != %d",
636 top, top->cg_count, mp_ncpus);
637 if (CPU_CMP(&top->cg_mask, &all_cpus))
638 panic("Built bad topology at %p. CPU mask (%s) != (%s)",
639 top, cpusetobj_strprint(cpusetbuf, &top->cg_mask),
640 cpusetobj_strprint(cpusetbuf2, &all_cpus));
643 * Collapse nonsense levels that may be created out of convenience by
644 * the MD layers. They cause extra work in the search functions.
646 while (top->cg_children == 1) {
647 top = &top->cg_child[0];
648 top->cg_parent = NULL;
654 smp_topo_alloc(u_int count)
661 return (&group[curr]);
667 struct cpu_group *top;
670 top->cg_parent = NULL;
671 top->cg_child = NULL;
672 top->cg_mask = all_cpus;
673 top->cg_count = mp_ncpus;
674 top->cg_children = 0;
675 top->cg_level = CG_SHARE_NONE;
682 smp_topo_addleaf(struct cpu_group *parent, struct cpu_group *child, int share,
683 int count, int flags, int start)
685 char cpusetbuf[CPUSETBUFSIZ], cpusetbuf2[CPUSETBUFSIZ];
690 for (i = 0; i < count; i++, start++)
691 CPU_SET(start, &mask);
692 child->cg_parent = parent;
693 child->cg_child = NULL;
694 child->cg_children = 0;
695 child->cg_level = share;
696 child->cg_count = count;
697 child->cg_flags = flags;
698 child->cg_mask = mask;
699 parent->cg_children++;
700 for (; parent != NULL; parent = parent->cg_parent) {
701 if (CPU_OVERLAP(&parent->cg_mask, &child->cg_mask))
702 panic("Duplicate children in %p. mask (%s) child (%s)",
704 cpusetobj_strprint(cpusetbuf, &parent->cg_mask),
705 cpusetobj_strprint(cpusetbuf2, &child->cg_mask));
706 CPU_OR(&parent->cg_mask, &child->cg_mask);
707 parent->cg_count += child->cg_count;
714 smp_topo_1level(int share, int count, int flags)
716 struct cpu_group *child;
717 struct cpu_group *top;
724 packages = mp_ncpus / count;
725 top->cg_child = child = &group[1];
726 top->cg_level = CG_SHARE_NONE;
727 for (i = 0; i < packages; i++, child++)
728 cpu = smp_topo_addleaf(top, child, share, count, flags, cpu);
733 smp_topo_2level(int l2share, int l2count, int l1share, int l1count,
736 struct cpu_group *top;
737 struct cpu_group *l1g;
738 struct cpu_group *l2g;
747 top->cg_level = CG_SHARE_NONE;
748 top->cg_children = mp_ncpus / (l2count * l1count);
749 l1g = l2g + top->cg_children;
750 for (i = 0; i < top->cg_children; i++, l2g++) {
751 l2g->cg_parent = top;
753 l2g->cg_level = l2share;
754 for (j = 0; j < l2count; j++, l1g++)
755 cpu = smp_topo_addleaf(l2g, l1g, l1share, l1count,
763 smp_topo_find(struct cpu_group *top, int cpu)
765 struct cpu_group *cg;
770 CPU_SETOF(cpu, &mask);
773 if (!CPU_OVERLAP(&cg->cg_mask, &mask))
775 if (cg->cg_children == 0)
777 children = cg->cg_children;
778 for (i = 0, cg = cg->cg_child; i < children; cg++, i++)
779 if (CPU_OVERLAP(&cg->cg_mask, &mask))
787 smp_rendezvous_cpus(cpuset_t map,
788 void (*setup_func)(void *),
789 void (*action_func)(void *),
790 void (*teardown_func)(void *),
794 * In the !SMP case we just need to ensure the same initial conditions
798 if (setup_func != NULL)
800 if (action_func != NULL)
802 if (teardown_func != NULL)
808 smp_rendezvous(void (*setup_func)(void *),
809 void (*action_func)(void *),
810 void (*teardown_func)(void *),
814 smp_rendezvous_cpus(all_cpus, setup_func, action_func, teardown_func,
819 * Provide dummy SMP support for UP kernels. Modules that need to use SMP
820 * APIs will still work using this dummy support.
823 mp_setvariables_for_up(void *dummy)
826 mp_maxid = PCPU_GET(cpuid);
827 CPU_SETOF(mp_maxid, &all_cpus);
828 KASSERT(PCPU_GET(cpuid) == 0, ("UP must have a CPU ID of zero"));
830 SYSINIT(cpu_mp_setvariables, SI_SUB_TUNABLES, SI_ORDER_FIRST,
831 mp_setvariables_for_up, NULL);
835 smp_no_rendezvous_barrier(void *dummy)
838 KASSERT((!smp_started),("smp_no_rendezvous called and smp is started"));
843 * Wait for specified idle threads to switch once. This ensures that even
844 * preempted threads have cycled through the switch function once,
845 * exiting their codepaths. This allows us to change global pointers
846 * with no other synchronization.
849 quiesce_cpus(cpuset_t map, const char *wmesg, int prio)
857 for (cpu = 0; cpu <= mp_maxid; cpu++) {
858 if (!CPU_ISSET(cpu, &map) || CPU_ABSENT(cpu))
860 pcpu = pcpu_find(cpu);
861 gen[cpu] = pcpu->pc_idlethread->td_generation;
863 for (cpu = 0; cpu <= mp_maxid; cpu++) {
864 if (!CPU_ISSET(cpu, &map) || CPU_ABSENT(cpu))
866 pcpu = pcpu_find(cpu);
867 thread_lock(curthread);
868 sched_bind(curthread, cpu);
869 thread_unlock(curthread);
870 while (gen[cpu] == pcpu->pc_idlethread->td_generation) {
871 error = tsleep(quiesce_cpus, prio, wmesg, 1);
872 if (error != EWOULDBLOCK)
878 thread_lock(curthread);
879 sched_unbind(curthread);
880 thread_unlock(curthread);
886 quiesce_all_cpus(const char *wmesg, int prio)
889 return quiesce_cpus(all_cpus, wmesg, prio);
892 /* Extra care is taken with this sysctl because the data type is volatile */
894 sysctl_kern_smp_active(SYSCTL_HANDLER_ARGS)
898 active = smp_started;
899 error = SYSCTL_OUT(req, &active, sizeof(active));
906 topo_init_node(struct topo_node *node)
909 bzero(node, sizeof(*node));
910 TAILQ_INIT(&node->children);
914 topo_init_root(struct topo_node *root)
917 topo_init_node(root);
918 root->type = TOPO_TYPE_SYSTEM;
922 * Add a child node with the given ID under the given parent.
923 * Do nothing if there is already a child with that ID.
926 topo_add_node_by_hwid(struct topo_node *parent, int hwid,
927 topo_node_type type, uintptr_t subtype)
929 struct topo_node *node;
931 TAILQ_FOREACH_REVERSE(node, &parent->children,
932 topo_children, siblings) {
933 if (node->hwid == hwid
934 && node->type == type && node->subtype == subtype) {
939 node = malloc(sizeof(*node), M_TOPO, M_WAITOK);
940 topo_init_node(node);
941 node->parent = parent;
944 node->subtype = subtype;
945 TAILQ_INSERT_TAIL(&parent->children, node, siblings);
952 * Find a child node with the given ID under the given parent.
955 topo_find_node_by_hwid(struct topo_node *parent, int hwid,
956 topo_node_type type, uintptr_t subtype)
959 struct topo_node *node;
961 TAILQ_FOREACH(node, &parent->children, siblings) {
962 if (node->hwid == hwid
963 && node->type == type && node->subtype == subtype) {
972 * Given a node change the order of its parent's child nodes such
973 * that the node becomes the firt child while preserving the cyclic
974 * order of the children. In other words, the given node is promoted
978 topo_promote_child(struct topo_node *child)
980 struct topo_node *next;
981 struct topo_node *node;
982 struct topo_node *parent;
984 parent = child->parent;
985 next = TAILQ_NEXT(child, siblings);
986 TAILQ_REMOVE(&parent->children, child, siblings);
987 TAILQ_INSERT_HEAD(&parent->children, child, siblings);
989 while (next != NULL) {
991 next = TAILQ_NEXT(node, siblings);
992 TAILQ_REMOVE(&parent->children, node, siblings);
993 TAILQ_INSERT_AFTER(&parent->children, child, node, siblings);
999 * Iterate to the next node in the depth-first search (traversal) of
1000 * the topology tree.
1003 topo_next_node(struct topo_node *top, struct topo_node *node)
1005 struct topo_node *next;
1007 if ((next = TAILQ_FIRST(&node->children)) != NULL)
1010 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1013 while (node != top && (node = node->parent) != top)
1014 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1021 * Iterate to the next node in the depth-first search of the topology tree,
1022 * but without descending below the current node.
1025 topo_next_nonchild_node(struct topo_node *top, struct topo_node *node)
1027 struct topo_node *next;
1029 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1032 while (node != top && (node = node->parent) != top)
1033 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1040 * Assign the given ID to the given topology node that represents a logical
1044 topo_set_pu_id(struct topo_node *node, cpuid_t id)
1047 KASSERT(node->type == TOPO_TYPE_PU,
1048 ("topo_set_pu_id: wrong node type: %u", node->type));
1049 KASSERT(CPU_EMPTY(&node->cpuset) && node->cpu_count == 0,
1050 ("topo_set_pu_id: cpuset already not empty"));
1052 CPU_SET(id, &node->cpuset);
1053 node->cpu_count = 1;
1056 while ((node = node->parent) != NULL) {
1057 KASSERT(!CPU_ISSET(id, &node->cpuset),
1058 ("logical ID %u is already set in node %p", id, node));
1059 CPU_SET(id, &node->cpuset);
1064 static struct topology_spec {
1065 topo_node_type type;
1068 } topology_level_table[TOPO_LEVEL_COUNT] = {
1069 [TOPO_LEVEL_PKG] = { .type = TOPO_TYPE_PKG, },
1070 [TOPO_LEVEL_GROUP] = { .type = TOPO_TYPE_GROUP, },
1071 [TOPO_LEVEL_CACHEGROUP] = {
1072 .type = TOPO_TYPE_CACHE,
1073 .match_subtype = true,
1074 .subtype = CG_SHARE_L3,
1076 [TOPO_LEVEL_CORE] = { .type = TOPO_TYPE_CORE, },
1077 [TOPO_LEVEL_THREAD] = { .type = TOPO_TYPE_PU, },
1081 topo_analyze_table(struct topo_node *root, int all, enum topo_level level,
1082 struct topo_analysis *results)
1084 struct topology_spec *spec;
1085 struct topo_node *node;
1088 if (level >= TOPO_LEVEL_COUNT)
1091 spec = &topology_level_table[level];
1093 node = topo_next_node(root, root);
1095 while (node != NULL) {
1096 if (node->type != spec->type ||
1097 (spec->match_subtype && node->subtype != spec->subtype)) {
1098 node = topo_next_node(root, node);
1101 if (!all && CPU_EMPTY(&node->cpuset)) {
1102 node = topo_next_nonchild_node(root, node);
1108 if (!topo_analyze_table(node, all, level + 1, results))
1111 node = topo_next_nonchild_node(root, node);
1114 /* No explicit subgroups is essentially one subgroup. */
1118 if (!topo_analyze_table(root, all, level + 1, results))
1122 if (results->entities[level] == -1)
1123 results->entities[level] = count;
1124 else if (results->entities[level] != count)
1131 * Check if the topology is uniform, that is, each package has the same number
1132 * of cores in it and each core has the same number of threads (logical
1133 * processors) in it. If so, calculate the number of packages, the number of
1134 * groups per package, the number of cachegroups per group, and the number of
1135 * logical processors per cachegroup. 'all' parameter tells whether to include
1136 * administratively disabled logical processors into the analysis.
1139 topo_analyze(struct topo_node *topo_root, int all,
1140 struct topo_analysis *results)
1143 results->entities[TOPO_LEVEL_PKG] = -1;
1144 results->entities[TOPO_LEVEL_CORE] = -1;
1145 results->entities[TOPO_LEVEL_THREAD] = -1;
1146 results->entities[TOPO_LEVEL_GROUP] = -1;
1147 results->entities[TOPO_LEVEL_CACHEGROUP] = -1;
1149 if (!topo_analyze_table(topo_root, all, TOPO_LEVEL_PKG, results))
1152 KASSERT(results->entities[TOPO_LEVEL_PKG] > 0,
1153 ("bug in topology or analysis"));