2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2001, John Baldwin <jhb@FreeBSD.org>.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * This module holds the global variables and machine independent functions
30 * used for the kernel SMP support.
33 #include <sys/cdefs.h>
34 __FBSDID("$FreeBSD$");
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/kernel.h>
43 #include <sys/malloc.h>
44 #include <sys/mutex.h>
46 #include <sys/sched.h>
48 #include <sys/sysctl.h>
50 #include <machine/cpu.h>
51 #include <machine/smp.h>
53 #include "opt_sched.h"
56 MALLOC_DEFINE(M_TOPO, "toponodes", "SMP topology data");
58 volatile cpuset_t stopped_cpus;
59 volatile cpuset_t started_cpus;
60 volatile cpuset_t suspended_cpus;
61 cpuset_t hlt_cpus_mask;
62 cpuset_t logical_cpus_mask;
64 void (*cpustop_restartfunc)(void);
67 static int sysctl_kern_smp_active(SYSCTL_HANDLER_ARGS);
69 /* This is used in modules that need to work in both SMP and UP. */
73 /* export this for libkvm consumers. */
74 int mp_maxcpus = MAXCPU;
76 volatile int smp_started;
79 static SYSCTL_NODE(_kern, OID_AUTO, smp,
80 CTLFLAG_RD | CTLFLAG_CAPRD | CTLFLAG_MPSAFE, 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_threads_per_core = 1; /* how many SMT threads are running per core */
102 SYSCTL_INT(_kern_smp, OID_AUTO, threads_per_core, CTLFLAG_RD|CTLFLAG_CAPRD,
103 &smp_threads_per_core, 0, "Number of SMT threads online per core");
105 int mp_ncores = -1; /* how many physical cores running */
106 SYSCTL_INT(_kern_smp, OID_AUTO, cores, CTLFLAG_RD|CTLFLAG_CAPRD, &mp_ncores, 0,
107 "Number of physical cores online");
109 int smp_topology = 0; /* Which topology we're using. */
110 SYSCTL_INT(_kern_smp, OID_AUTO, topology, CTLFLAG_RDTUN, &smp_topology, 0,
111 "Topology override setting; 0 is default provided by hardware.");
114 /* Enable forwarding of a signal to a process running on a different CPU */
115 static int forward_signal_enabled = 1;
116 SYSCTL_INT(_kern_smp, OID_AUTO, forward_signal_enabled, CTLFLAG_RW,
117 &forward_signal_enabled, 0,
118 "Forwarding of a signal to a process on a different CPU");
120 /* Variables needed for SMP rendezvous. */
121 static volatile int smp_rv_ncpus;
122 static void (*volatile smp_rv_setup_func)(void *arg);
123 static void (*volatile smp_rv_action_func)(void *arg);
124 static void (*volatile smp_rv_teardown_func)(void *arg);
125 static void *volatile smp_rv_func_arg;
126 static volatile int smp_rv_waiters[4];
129 * Shared mutex to restrict busywaits between smp_rendezvous() and
130 * smp(_targeted)_tlb_shootdown(). A deadlock occurs if both of these
131 * functions trigger at once and cause multiple CPUs to busywait with
132 * interrupts disabled.
134 struct mtx smp_ipi_mtx;
137 * Let the MD SMP code initialize mp_maxid very early if it can.
140 mp_setmaxid(void *dummy)
145 KASSERT(mp_ncpus >= 1, ("%s: CPU count < 1", __func__));
146 KASSERT(mp_ncpus > 1 || mp_maxid == 0,
147 ("%s: one CPU but mp_maxid is not zero", __func__));
148 KASSERT(mp_maxid >= mp_ncpus - 1,
149 ("%s: counters out of sync: max %d, count %d", __func__,
150 mp_maxid, mp_ncpus));
152 SYSINIT(cpu_mp_setmaxid, SI_SUB_TUNABLES, SI_ORDER_FIRST, mp_setmaxid, NULL);
155 * Call the MD SMP initialization code.
158 mp_start(void *dummy)
161 mtx_init(&smp_ipi_mtx, "smp rendezvous", NULL, MTX_SPIN);
163 /* Probe for MP hardware. */
164 if (smp_disabled != 0 || cpu_mp_probe() == 0) {
167 CPU_SETOF(PCPU_GET(cpuid), &all_cpus);
172 printf("FreeBSD/SMP: Multiprocessor System Detected: %d CPUs\n",
175 /* Provide a default for most architectures that don't have SMT/HTT. */
177 mp_ncores = mp_ncpus;
181 SYSINIT(cpu_mp, SI_SUB_CPU, SI_ORDER_THIRD, mp_start, NULL);
184 forward_signal(struct thread *td)
189 * signotify() has already set TDF_ASTPENDING and TDF_NEEDSIGCHECK on
190 * this thread, so all we need to do is poke it if it is currently
191 * executing so that it executes ast().
193 THREAD_LOCK_ASSERT(td, MA_OWNED);
194 KASSERT(TD_IS_RUNNING(td),
195 ("forward_signal: thread is not TDS_RUNNING"));
197 CTR1(KTR_SMP, "forward_signal(%p)", td->td_proc);
199 if (!smp_started || cold || KERNEL_PANICKED())
201 if (!forward_signal_enabled)
204 /* No need to IPI ourself. */
211 ipi_cpu(id, IPI_AST);
215 * When called the executing CPU will send an IPI to all other CPUs
216 * requesting that they halt execution.
218 * Usually (but not necessarily) called with 'other_cpus' as its arg.
220 * - Signals all CPUs in map to stop.
221 * - Waits for each to stop.
229 #if defined(__amd64__) || defined(__i386__)
235 generic_stop_cpus(cpuset_t map, u_int type)
238 char cpusetbuf[CPUSETBUFSIZ];
240 static volatile u_int stopping_cpu = NOCPU;
242 volatile cpuset_t *cpus;
245 type == IPI_STOP || type == IPI_STOP_HARD
247 || type == IPI_SUSPEND
249 , ("%s: invalid stop type", __func__));
254 CTR2(KTR_SMP, "stop_cpus(%s) with %u type",
255 cpusetobj_strprint(cpusetbuf, &map), type);
259 * When suspending, ensure there are are no IPIs in progress.
260 * IPIs that have been issued, but not yet delivered (e.g.
261 * not pending on a vCPU when running under virtualization)
262 * will be lost, violating FreeBSD's assumption of reliable
265 if (type == IPI_SUSPEND)
266 mtx_lock_spin(&smp_ipi_mtx);
270 if (!nmi_is_broadcast || nmi_kdb_lock == 0) {
272 if (stopping_cpu != PCPU_GET(cpuid))
273 while (atomic_cmpset_int(&stopping_cpu, NOCPU,
274 PCPU_GET(cpuid)) == 0)
275 while (stopping_cpu != NOCPU)
276 cpu_spinwait(); /* spin */
278 /* send the stop IPI to all CPUs in map */
279 ipi_selected(map, type);
285 if (type == IPI_SUSPEND)
286 cpus = &suspended_cpus;
289 cpus = &stopped_cpus;
292 while (!CPU_SUBSET(cpus, &map)) {
296 if (i == 100000000) {
297 printf("timeout stopping cpus\n");
303 if (type == IPI_SUSPEND)
304 mtx_unlock_spin(&smp_ipi_mtx);
307 stopping_cpu = NOCPU;
312 stop_cpus(cpuset_t map)
315 return (generic_stop_cpus(map, IPI_STOP));
319 stop_cpus_hard(cpuset_t map)
322 return (generic_stop_cpus(map, IPI_STOP_HARD));
327 suspend_cpus(cpuset_t map)
330 return (generic_stop_cpus(map, IPI_SUSPEND));
335 * Called by a CPU to restart stopped CPUs.
337 * Usually (but not necessarily) called with 'stopped_cpus' as its arg.
339 * - Signals all CPUs in map to restart.
340 * - Waits for each to restart.
348 generic_restart_cpus(cpuset_t map, u_int type)
351 char cpusetbuf[CPUSETBUFSIZ];
353 volatile cpuset_t *cpus;
356 KASSERT(type == IPI_STOP || type == IPI_STOP_HARD
357 || type == IPI_SUSPEND, ("%s: invalid stop type", __func__));
362 CTR1(KTR_SMP, "restart_cpus(%s)", cpusetobj_strprint(cpusetbuf, &map));
364 if (type == IPI_SUSPEND)
365 cpus = &resuming_cpus;
367 cpus = &stopped_cpus;
369 /* signal other cpus to restart */
370 if (type == IPI_SUSPEND)
371 CPU_COPY_STORE_REL(&map, &toresume_cpus);
373 CPU_COPY_STORE_REL(&map, &started_cpus);
376 * Wake up any CPUs stopped with MWAIT. From MI code we can't tell if
377 * MONITOR/MWAIT is enabled, but the potentially redundant writes are
378 * relatively inexpensive.
380 if (type == IPI_STOP) {
381 struct monitorbuf *mb;
385 if (!CPU_ISSET(id, &map))
388 mb = &pcpu_find(id)->pc_monitorbuf;
389 atomic_store_int(&mb->stop_state,
390 MONITOR_STOPSTATE_RUNNING);
394 if (!nmi_is_broadcast || nmi_kdb_lock == 0) {
395 /* wait for each to clear its bit */
396 while (CPU_OVERLAP(cpus, &map))
400 KASSERT(type == IPI_STOP || type == IPI_STOP_HARD,
401 ("%s: invalid stop type", __func__));
406 CTR1(KTR_SMP, "restart_cpus(%s)", cpusetobj_strprint(cpusetbuf, &map));
408 cpus = &stopped_cpus;
410 /* signal other cpus to restart */
411 CPU_COPY_STORE_REL(&map, &started_cpus);
413 /* wait for each to clear its bit */
414 while (CPU_OVERLAP(cpus, &map))
421 restart_cpus(cpuset_t map)
424 return (generic_restart_cpus(map, IPI_STOP));
429 resume_cpus(cpuset_t map)
432 return (generic_restart_cpus(map, IPI_SUSPEND));
438 * All-CPU rendezvous. CPUs are signalled, all execute the setup function
439 * (if specified), rendezvous, execute the action function (if specified),
440 * rendezvous again, execute the teardown function (if specified), and then
443 * Note that the supplied external functions _must_ be reentrant and aware
444 * that they are running in parallel and in an unknown lock context.
447 smp_rendezvous_action(void)
450 void *local_func_arg;
451 void (*local_setup_func)(void*);
452 void (*local_action_func)(void*);
453 void (*local_teardown_func)(void*);
458 /* Ensure we have up-to-date values. */
459 atomic_add_acq_int(&smp_rv_waiters[0], 1);
460 while (smp_rv_waiters[0] < smp_rv_ncpus)
463 /* Fetch rendezvous parameters after acquire barrier. */
464 local_func_arg = smp_rv_func_arg;
465 local_setup_func = smp_rv_setup_func;
466 local_action_func = smp_rv_action_func;
467 local_teardown_func = smp_rv_teardown_func;
470 * Use a nested critical section to prevent any preemptions
471 * from occurring during a rendezvous action routine.
472 * Specifically, if a rendezvous handler is invoked via an IPI
473 * and the interrupted thread was in the critical_exit()
474 * function after setting td_critnest to 0 but before
475 * performing a deferred preemption, this routine can be
476 * invoked with td_critnest set to 0 and td_owepreempt true.
477 * In that case, a critical_exit() during the rendezvous
478 * action would trigger a preemption which is not permitted in
479 * a rendezvous action. To fix this, wrap all of the
480 * rendezvous action handlers in a critical section. We
481 * cannot use a regular critical section however as having
482 * critical_exit() preempt from this routine would also be
483 * problematic (the preemption must not occur before the IPI
484 * has been acknowledged via an EOI). Instead, we
485 * intentionally ignore td_owepreempt when leaving the
486 * critical section. This should be harmless because we do
487 * not permit rendezvous action routines to schedule threads,
488 * and thus td_owepreempt should never transition from 0 to 1
489 * during this routine.
494 owepreempt = td->td_owepreempt;
498 * If requested, run a setup function before the main action
499 * function. Ensure all CPUs have completed the setup
500 * function before moving on to the action function.
502 if (local_setup_func != smp_no_rendezvous_barrier) {
503 if (smp_rv_setup_func != NULL)
504 smp_rv_setup_func(smp_rv_func_arg);
505 atomic_add_int(&smp_rv_waiters[1], 1);
506 while (smp_rv_waiters[1] < smp_rv_ncpus)
510 if (local_action_func != NULL)
511 local_action_func(local_func_arg);
513 if (local_teardown_func != smp_no_rendezvous_barrier) {
515 * Signal that the main action has been completed. If a
516 * full exit rendezvous is requested, then all CPUs will
517 * wait here until all CPUs have finished the main action.
519 atomic_add_int(&smp_rv_waiters[2], 1);
520 while (smp_rv_waiters[2] < smp_rv_ncpus)
523 if (local_teardown_func != NULL)
524 local_teardown_func(local_func_arg);
528 * Signal that the rendezvous is fully completed by this CPU.
529 * This means that no member of smp_rv_* pseudo-structure will be
530 * accessed by this target CPU after this point; in particular,
531 * memory pointed by smp_rv_func_arg.
533 * The release semantic ensures that all accesses performed by
534 * the current CPU are visible when smp_rendezvous_cpus()
535 * returns, by synchronizing with the
536 * atomic_load_acq_int(&smp_rv_waiters[3]).
538 atomic_add_rel_int(&smp_rv_waiters[3], 1);
541 KASSERT(owepreempt == td->td_owepreempt,
542 ("rendezvous action changed td_owepreempt"));
546 smp_rendezvous_cpus(cpuset_t map,
547 void (* setup_func)(void *),
548 void (* action_func)(void *),
549 void (* teardown_func)(void *),
552 int curcpumap, i, ncpus = 0;
554 /* See comments in the !SMP case. */
557 if (setup_func != NULL)
559 if (action_func != NULL)
561 if (teardown_func != NULL)
568 * Make sure we come here with interrupts enabled. Otherwise we
569 * livelock if smp_ipi_mtx is owned by a thread which sent us an IPI.
571 MPASS(curthread->td_md.md_spinlock_count == 0);
574 if (CPU_ISSET(i, &map))
578 panic("ncpus is 0 with non-zero map");
580 mtx_lock_spin(&smp_ipi_mtx);
582 /* Pass rendezvous parameters via global variables. */
583 smp_rv_ncpus = ncpus;
584 smp_rv_setup_func = setup_func;
585 smp_rv_action_func = action_func;
586 smp_rv_teardown_func = teardown_func;
587 smp_rv_func_arg = arg;
588 smp_rv_waiters[1] = 0;
589 smp_rv_waiters[2] = 0;
590 smp_rv_waiters[3] = 0;
591 atomic_store_rel_int(&smp_rv_waiters[0], 0);
594 * Signal other processors, which will enter the IPI with
597 curcpumap = CPU_ISSET(curcpu, &map);
598 CPU_CLR(curcpu, &map);
599 ipi_selected(map, IPI_RENDEZVOUS);
601 /* Check if the current CPU is in the map */
603 smp_rendezvous_action();
606 * Ensure that the master CPU waits for all the other
607 * CPUs to finish the rendezvous, so that smp_rv_*
608 * pseudo-structure and the arg are guaranteed to not
611 * Load acquire synchronizes with the release add in
612 * smp_rendezvous_action(), which ensures that our caller sees
613 * all memory actions done by the called functions on other
616 while (atomic_load_acq_int(&smp_rv_waiters[3]) < ncpus)
619 mtx_unlock_spin(&smp_ipi_mtx);
623 smp_rendezvous(void (* setup_func)(void *),
624 void (* action_func)(void *),
625 void (* teardown_func)(void *),
628 smp_rendezvous_cpus(all_cpus, setup_func, action_func, teardown_func, arg);
631 static struct cpu_group group[MAXCPU * MAX_CACHE_LEVELS + 1];
636 char cpusetbuf[CPUSETBUFSIZ], cpusetbuf2[CPUSETBUFSIZ];
637 struct cpu_group *top;
640 * Check for a fake topology request for debugging purposes.
642 switch (smp_topology) {
644 /* Dual core with no sharing. */
645 top = smp_topo_1level(CG_SHARE_NONE, 2, 0);
648 /* No topology, all cpus are equal. */
649 top = smp_topo_none();
652 /* Dual core with shared L2. */
653 top = smp_topo_1level(CG_SHARE_L2, 2, 0);
656 /* quad core, shared l3 among each package, private l2. */
657 top = smp_topo_1level(CG_SHARE_L3, 4, 0);
660 /* quad core, 2 dualcore parts on each package share l2. */
661 top = smp_topo_2level(CG_SHARE_NONE, 2, CG_SHARE_L2, 2, 0);
664 /* Single-core 2xHTT */
665 top = smp_topo_1level(CG_SHARE_L1, 2, CG_FLAG_HTT);
668 /* quad core with a shared l3, 8 threads sharing L2. */
669 top = smp_topo_2level(CG_SHARE_L3, 4, CG_SHARE_L2, 8,
673 /* Default, ask the system what it wants. */
678 * Verify the returned topology.
680 if (top->cg_count != mp_ncpus)
681 panic("Built bad topology at %p. CPU count %d != %d",
682 top, top->cg_count, mp_ncpus);
683 if (CPU_CMP(&top->cg_mask, &all_cpus))
684 panic("Built bad topology at %p. CPU mask (%s) != (%s)",
685 top, cpusetobj_strprint(cpusetbuf, &top->cg_mask),
686 cpusetobj_strprint(cpusetbuf2, &all_cpus));
689 * Collapse nonsense levels that may be created out of convenience by
690 * the MD layers. They cause extra work in the search functions.
692 while (top->cg_children == 1) {
693 top = &top->cg_child[0];
694 top->cg_parent = NULL;
700 smp_topo_alloc(u_int count)
707 return (&group[curr]);
713 struct cpu_group *top;
716 top->cg_parent = NULL;
717 top->cg_child = NULL;
718 top->cg_mask = all_cpus;
719 top->cg_count = mp_ncpus;
720 top->cg_children = 0;
721 top->cg_level = CG_SHARE_NONE;
728 smp_topo_addleaf(struct cpu_group *parent, struct cpu_group *child, int share,
729 int count, int flags, int start)
731 char cpusetbuf[CPUSETBUFSIZ], cpusetbuf2[CPUSETBUFSIZ];
736 for (i = 0; i < count; i++, start++)
737 CPU_SET(start, &mask);
738 child->cg_parent = parent;
739 child->cg_child = NULL;
740 child->cg_children = 0;
741 child->cg_level = share;
742 child->cg_count = count;
743 child->cg_flags = flags;
744 child->cg_mask = mask;
745 parent->cg_children++;
746 for (; parent != NULL; parent = parent->cg_parent) {
747 if (CPU_OVERLAP(&parent->cg_mask, &child->cg_mask))
748 panic("Duplicate children in %p. mask (%s) child (%s)",
750 cpusetobj_strprint(cpusetbuf, &parent->cg_mask),
751 cpusetobj_strprint(cpusetbuf2, &child->cg_mask));
752 CPU_OR(&parent->cg_mask, &child->cg_mask);
753 parent->cg_count += child->cg_count;
760 smp_topo_1level(int share, int count, int flags)
762 struct cpu_group *child;
763 struct cpu_group *top;
770 packages = mp_ncpus / count;
771 top->cg_child = child = &group[1];
772 top->cg_level = CG_SHARE_NONE;
773 for (i = 0; i < packages; i++, child++)
774 cpu = smp_topo_addleaf(top, child, share, count, flags, cpu);
779 smp_topo_2level(int l2share, int l2count, int l1share, int l1count,
782 struct cpu_group *top;
783 struct cpu_group *l1g;
784 struct cpu_group *l2g;
793 top->cg_level = CG_SHARE_NONE;
794 top->cg_children = mp_ncpus / (l2count * l1count);
795 l1g = l2g + top->cg_children;
796 for (i = 0; i < top->cg_children; i++, l2g++) {
797 l2g->cg_parent = top;
799 l2g->cg_level = l2share;
800 for (j = 0; j < l2count; j++, l1g++)
801 cpu = smp_topo_addleaf(l2g, l1g, l1share, l1count,
808 smp_topo_find(struct cpu_group *top, int cpu)
810 struct cpu_group *cg;
815 CPU_SETOF(cpu, &mask);
818 if (!CPU_OVERLAP(&cg->cg_mask, &mask))
820 if (cg->cg_children == 0)
822 children = cg->cg_children;
823 for (i = 0, cg = cg->cg_child; i < children; cg++, i++)
824 if (CPU_OVERLAP(&cg->cg_mask, &mask))
832 smp_rendezvous_cpus(cpuset_t map,
833 void (*setup_func)(void *),
834 void (*action_func)(void *),
835 void (*teardown_func)(void *),
839 * In the !SMP case we just need to ensure the same initial conditions
843 if (setup_func != NULL)
845 if (action_func != NULL)
847 if (teardown_func != NULL)
853 smp_rendezvous(void (*setup_func)(void *),
854 void (*action_func)(void *),
855 void (*teardown_func)(void *),
859 smp_rendezvous_cpus(all_cpus, setup_func, action_func, teardown_func,
864 * Provide dummy SMP support for UP kernels. Modules that need to use SMP
865 * APIs will still work using this dummy support.
868 mp_setvariables_for_up(void *dummy)
872 mp_maxid = PCPU_GET(cpuid);
873 CPU_SETOF(mp_maxid, &all_cpus);
874 KASSERT(PCPU_GET(cpuid) == 0, ("UP must have a CPU ID of zero"));
876 SYSINIT(cpu_mp_setvariables, SI_SUB_TUNABLES, SI_ORDER_FIRST,
877 mp_setvariables_for_up, NULL);
881 smp_no_rendezvous_barrier(void *dummy)
884 KASSERT((!smp_started),("smp_no_rendezvous called and smp is started"));
889 smp_rendezvous_cpus_retry(cpuset_t map,
890 void (* setup_func)(void *),
891 void (* action_func)(void *),
892 void (* teardown_func)(void *),
893 void (* wait_func)(void *, int),
894 struct smp_rendezvous_cpus_retry_arg *arg)
899 * Execute an action on all specified CPUs while retrying until they
900 * all acknowledge completion.
902 CPU_COPY(&map, &arg->cpus);
911 if (CPU_EMPTY(&arg->cpus))
915 if (!CPU_ISSET(cpu, &arg->cpus))
923 smp_rendezvous_cpus_done(struct smp_rendezvous_cpus_retry_arg *arg)
926 CPU_CLR_ATOMIC(curcpu, &arg->cpus);
930 * Wait for specified idle threads to switch once. This ensures that even
931 * preempted threads have cycled through the switch function once,
932 * exiting their codepaths. This allows us to change global pointers
933 * with no other synchronization.
936 quiesce_cpus(cpuset_t map, const char *wmesg, int prio)
944 for (cpu = 0; cpu <= mp_maxid; cpu++) {
945 if (!CPU_ISSET(cpu, &map) || CPU_ABSENT(cpu))
947 pcpu = pcpu_find(cpu);
948 gen[cpu] = pcpu->pc_idlethread->td_generation;
950 for (cpu = 0; cpu <= mp_maxid; cpu++) {
951 if (!CPU_ISSET(cpu, &map) || CPU_ABSENT(cpu))
953 pcpu = pcpu_find(cpu);
954 thread_lock(curthread);
955 sched_bind(curthread, cpu);
956 thread_unlock(curthread);
957 while (gen[cpu] == pcpu->pc_idlethread->td_generation) {
958 error = tsleep(quiesce_cpus, prio, wmesg, 1);
959 if (error != EWOULDBLOCK)
965 thread_lock(curthread);
966 sched_unbind(curthread);
967 thread_unlock(curthread);
973 quiesce_all_cpus(const char *wmesg, int prio)
976 return quiesce_cpus(all_cpus, wmesg, prio);
980 * Observe all CPUs not executing in critical section.
981 * We are not in one so the check for us is safe. If the found
982 * thread changes to something else we know the section was
986 quiesce_all_critical(void)
988 struct thread *td, *newtd;
992 MPASS(curthread->td_critnest == 0);
995 pcpu = cpuid_to_pcpu[cpu];
996 td = pcpu->pc_curthread;
998 if (td->td_critnest == 0)
1001 newtd = (struct thread *)
1002 atomic_load_acq_ptr((void *)pcpu->pc_curthread);
1010 cpus_fence_seq_cst_issue(void *arg __unused)
1013 atomic_thread_fence_seq_cst();
1017 * Send an IPI forcing a sequentially consistent fence.
1019 * Allows replacement of an explicitly fence with a compiler barrier.
1020 * Trades speed up during normal execution for a significant slowdown when
1021 * the barrier is needed.
1024 cpus_fence_seq_cst(void)
1029 smp_no_rendezvous_barrier,
1030 cpus_fence_seq_cst_issue,
1031 smp_no_rendezvous_barrier,
1035 cpus_fence_seq_cst_issue(NULL);
1039 /* Extra care is taken with this sysctl because the data type is volatile */
1041 sysctl_kern_smp_active(SYSCTL_HANDLER_ARGS)
1045 active = smp_started;
1046 error = SYSCTL_OUT(req, &active, sizeof(active));
1052 topo_init_node(struct topo_node *node)
1055 bzero(node, sizeof(*node));
1056 TAILQ_INIT(&node->children);
1060 topo_init_root(struct topo_node *root)
1063 topo_init_node(root);
1064 root->type = TOPO_TYPE_SYSTEM;
1068 * Add a child node with the given ID under the given parent.
1069 * Do nothing if there is already a child with that ID.
1072 topo_add_node_by_hwid(struct topo_node *parent, int hwid,
1073 topo_node_type type, uintptr_t subtype)
1075 struct topo_node *node;
1077 TAILQ_FOREACH_REVERSE(node, &parent->children,
1078 topo_children, siblings) {
1079 if (node->hwid == hwid
1080 && node->type == type && node->subtype == subtype) {
1085 node = malloc(sizeof(*node), M_TOPO, M_WAITOK);
1086 topo_init_node(node);
1087 node->parent = parent;
1090 node->subtype = subtype;
1091 TAILQ_INSERT_TAIL(&parent->children, node, siblings);
1092 parent->nchildren++;
1098 * Find a child node with the given ID under the given parent.
1101 topo_find_node_by_hwid(struct topo_node *parent, int hwid,
1102 topo_node_type type, uintptr_t subtype)
1105 struct topo_node *node;
1107 TAILQ_FOREACH(node, &parent->children, siblings) {
1108 if (node->hwid == hwid
1109 && node->type == type && node->subtype == subtype) {
1118 * Given a node change the order of its parent's child nodes such
1119 * that the node becomes the firt child while preserving the cyclic
1120 * order of the children. In other words, the given node is promoted
1124 topo_promote_child(struct topo_node *child)
1126 struct topo_node *next;
1127 struct topo_node *node;
1128 struct topo_node *parent;
1130 parent = child->parent;
1131 next = TAILQ_NEXT(child, siblings);
1132 TAILQ_REMOVE(&parent->children, child, siblings);
1133 TAILQ_INSERT_HEAD(&parent->children, child, siblings);
1135 while (next != NULL) {
1137 next = TAILQ_NEXT(node, siblings);
1138 TAILQ_REMOVE(&parent->children, node, siblings);
1139 TAILQ_INSERT_AFTER(&parent->children, child, node, siblings);
1145 * Iterate to the next node in the depth-first search (traversal) of
1146 * the topology tree.
1149 topo_next_node(struct topo_node *top, struct topo_node *node)
1151 struct topo_node *next;
1153 if ((next = TAILQ_FIRST(&node->children)) != NULL)
1156 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1159 while (node != top && (node = node->parent) != top)
1160 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1167 * Iterate to the next node in the depth-first search of the topology tree,
1168 * but without descending below the current node.
1171 topo_next_nonchild_node(struct topo_node *top, struct topo_node *node)
1173 struct topo_node *next;
1175 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1178 while (node != top && (node = node->parent) != top)
1179 if ((next = TAILQ_NEXT(node, siblings)) != NULL)
1186 * Assign the given ID to the given topology node that represents a logical
1190 topo_set_pu_id(struct topo_node *node, cpuid_t id)
1193 KASSERT(node->type == TOPO_TYPE_PU,
1194 ("topo_set_pu_id: wrong node type: %u", node->type));
1195 KASSERT(CPU_EMPTY(&node->cpuset) && node->cpu_count == 0,
1196 ("topo_set_pu_id: cpuset already not empty"));
1198 CPU_SET(id, &node->cpuset);
1199 node->cpu_count = 1;
1202 while ((node = node->parent) != NULL) {
1203 KASSERT(!CPU_ISSET(id, &node->cpuset),
1204 ("logical ID %u is already set in node %p", id, node));
1205 CPU_SET(id, &node->cpuset);
1210 static struct topology_spec {
1211 topo_node_type type;
1214 } topology_level_table[TOPO_LEVEL_COUNT] = {
1215 [TOPO_LEVEL_PKG] = { .type = TOPO_TYPE_PKG, },
1216 [TOPO_LEVEL_GROUP] = { .type = TOPO_TYPE_GROUP, },
1217 [TOPO_LEVEL_CACHEGROUP] = {
1218 .type = TOPO_TYPE_CACHE,
1219 .match_subtype = true,
1220 .subtype = CG_SHARE_L3,
1222 [TOPO_LEVEL_CORE] = { .type = TOPO_TYPE_CORE, },
1223 [TOPO_LEVEL_THREAD] = { .type = TOPO_TYPE_PU, },
1227 topo_analyze_table(struct topo_node *root, int all, enum topo_level level,
1228 struct topo_analysis *results)
1230 struct topology_spec *spec;
1231 struct topo_node *node;
1234 if (level >= TOPO_LEVEL_COUNT)
1237 spec = &topology_level_table[level];
1239 node = topo_next_node(root, root);
1241 while (node != NULL) {
1242 if (node->type != spec->type ||
1243 (spec->match_subtype && node->subtype != spec->subtype)) {
1244 node = topo_next_node(root, node);
1247 if (!all && CPU_EMPTY(&node->cpuset)) {
1248 node = topo_next_nonchild_node(root, node);
1254 if (!topo_analyze_table(node, all, level + 1, results))
1257 node = topo_next_nonchild_node(root, node);
1260 /* No explicit subgroups is essentially one subgroup. */
1264 if (!topo_analyze_table(root, all, level + 1, results))
1268 if (results->entities[level] == -1)
1269 results->entities[level] = count;
1270 else if (results->entities[level] != count)
1277 * Check if the topology is uniform, that is, each package has the same number
1278 * of cores in it and each core has the same number of threads (logical
1279 * processors) in it. If so, calculate the number of packages, the number of
1280 * groups per package, the number of cachegroups per group, and the number of
1281 * logical processors per cachegroup. 'all' parameter tells whether to include
1282 * administratively disabled logical processors into the analysis.
1285 topo_analyze(struct topo_node *topo_root, int all,
1286 struct topo_analysis *results)
1289 results->entities[TOPO_LEVEL_PKG] = -1;
1290 results->entities[TOPO_LEVEL_CORE] = -1;
1291 results->entities[TOPO_LEVEL_THREAD] = -1;
1292 results->entities[TOPO_LEVEL_GROUP] = -1;
1293 results->entities[TOPO_LEVEL_CACHEGROUP] = -1;
1295 if (!topo_analyze_table(topo_root, all, TOPO_LEVEL_PKG, results))
1298 KASSERT(results->entities[TOPO_LEVEL_PKG] > 0,
1299 ("bug in topology or analysis"));