1 // Copyright 2014 The Go Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style
3 // license that can be found in the LICENSE file.
11 "runtime/internal/atomic"
12 "runtime/internal/sys"
16 // set using cmd/go/internal/modload.ModInfoProg
19 // Goroutine scheduler
20 // The scheduler's job is to distribute ready-to-run goroutines over worker threads.
22 // The main concepts are:
24 // M - worker thread, or machine.
25 // P - processor, a resource that is required to execute Go code.
26 // M must have an associated P to execute Go code, however it can be
27 // blocked or in a syscall w/o an associated P.
29 // Design doc at https://golang.org/s/go11sched.
31 // Worker thread parking/unparking.
32 // We need to balance between keeping enough running worker threads to utilize
33 // available hardware parallelism and parking excessive running worker threads
34 // to conserve CPU resources and power. This is not simple for two reasons:
35 // (1) scheduler state is intentionally distributed (in particular, per-P work
36 // queues), so it is not possible to compute global predicates on fast paths;
37 // (2) for optimal thread management we would need to know the future (don't park
38 // a worker thread when a new goroutine will be readied in near future).
40 // Three rejected approaches that would work badly:
41 // 1. Centralize all scheduler state (would inhibit scalability).
42 // 2. Direct goroutine handoff. That is, when we ready a new goroutine and there
43 // is a spare P, unpark a thread and handoff it the thread and the goroutine.
44 // This would lead to thread state thrashing, as the thread that readied the
45 // goroutine can be out of work the very next moment, we will need to park it.
46 // Also, it would destroy locality of computation as we want to preserve
47 // dependent goroutines on the same thread; and introduce additional latency.
48 // 3. Unpark an additional thread whenever we ready a goroutine and there is an
49 // idle P, but don't do handoff. This would lead to excessive thread parking/
50 // unparking as the additional threads will instantly park without discovering
53 // The current approach:
55 // This approach applies to three primary sources of potential work: readying a
56 // goroutine, new/modified-earlier timers, and idle-priority GC. See below for
57 // additional details.
59 // We unpark an additional thread when we submit work if (this is wakep()):
60 // 1. There is an idle P, and
61 // 2. There are no "spinning" worker threads.
63 // A worker thread is considered spinning if it is out of local work and did
64 // not find work in the global run queue or netpoller; the spinning state is
65 // denoted in m.spinning and in sched.nmspinning. Threads unparked this way are
66 // also considered spinning; we don't do goroutine handoff so such threads are
67 // out of work initially. Spinning threads spin on looking for work in per-P
68 // run queues and timer heaps or from the GC before parking. If a spinning
69 // thread finds work it takes itself out of the spinning state and proceeds to
70 // execution. If it does not find work it takes itself out of the spinning
71 // state and then parks.
73 // If there is at least one spinning thread (sched.nmspinning>1), we don't
74 // unpark new threads when submitting work. To compensate for that, if the last
75 // spinning thread finds work and stops spinning, it must unpark a new spinning
76 // thread. This approach smooths out unjustified spikes of thread unparking,
77 // but at the same time guarantees eventual maximal CPU parallelism
80 // The main implementation complication is that we need to be very careful
81 // during spinning->non-spinning thread transition. This transition can race
82 // with submission of new work, and either one part or another needs to unpark
83 // another worker thread. If they both fail to do that, we can end up with
84 // semi-persistent CPU underutilization.
86 // The general pattern for submission is:
87 // 1. Submit work to the local run queue, timer heap, or GC state.
88 // 2. #StoreLoad-style memory barrier.
89 // 3. Check sched.nmspinning.
91 // The general pattern for spinning->non-spinning transition is:
92 // 1. Decrement nmspinning.
93 // 2. #StoreLoad-style memory barrier.
94 // 3. Check all per-P work queues and GC for new work.
96 // Note that all this complexity does not apply to global run queue as we are
97 // not sloppy about thread unparking when submitting to global queue. Also see
98 // comments for nmspinning manipulation.
100 // How these different sources of work behave varies, though it doesn't affect
101 // the synchronization approach:
102 // * Ready goroutine: this is an obvious source of work; the goroutine is
103 // immediately ready and must run on some thread eventually.
104 // * New/modified-earlier timer: The current timer implementation (see time.go)
105 // uses netpoll in a thread with no work available to wait for the soonest
106 // timer. If there is no thread waiting, we want a new spinning thread to go
108 // * Idle-priority GC: The GC wakes a stopped idle thread to contribute to
109 // background GC work (note: currently disabled per golang.org/issue/19112).
110 // Also see golang.org/issue/44313, as this should be extended to all GC
120 //go:linkname runtime_inittask runtime..inittask
121 var runtime_inittask initTask
123 //go:linkname main_inittask main..inittask
124 var main_inittask initTask
126 // main_init_done is a signal used by cgocallbackg that initialization
127 // has been completed. It is made before _cgo_notify_runtime_init_done,
128 // so all cgo calls can rely on it existing. When main_init is complete,
129 // it is closed, meaning cgocallbackg can reliably receive from it.
130 var main_init_done chan bool
132 //go:linkname main_main main.main
135 // mainStarted indicates that the main M has started.
138 // runtimeInitTime is the nanotime() at which the runtime started.
139 var runtimeInitTime int64
141 // Value to use for signal mask for newly created M's.
142 var initSigmask sigset
144 // The main goroutine.
148 // Racectx of m0->g0 is used only as the parent of the main goroutine.
149 // It must not be used for anything else.
152 // Max stack size is 1 GB on 64-bit, 250 MB on 32-bit.
153 // Using decimal instead of binary GB and MB because
154 // they look nicer in the stack overflow failure message.
155 if goarch.PtrSize == 8 {
156 maxstacksize = 1000000000
158 maxstacksize = 250000000
161 // An upper limit for max stack size. Used to avoid random crashes
162 // after calling SetMaxStack and trying to allocate a stack that is too big,
163 // since stackalloc works with 32-bit sizes.
164 maxstackceiling = 2 * maxstacksize
166 // Allow newproc to start new Ms.
169 if GOARCH != "wasm" { // no threads on wasm yet, so no sysmon
171 newm(sysmon, nil, -1)
175 // Lock the main goroutine onto this, the main OS thread,
176 // during initialization. Most programs won't care, but a few
177 // do require certain calls to be made by the main thread.
178 // Those can arrange for main.main to run in the main thread
179 // by calling runtime.LockOSThread during initialization
180 // to preserve the lock.
184 throw("runtime.main not on m0")
187 // Record when the world started.
188 // Must be before doInit for tracing init.
189 runtimeInitTime = nanotime()
190 if runtimeInitTime == 0 {
191 throw("nanotime returning zero")
194 if debug.inittrace != 0 {
195 inittrace.id = getg().goid
196 inittrace.active = true
199 doInit(&runtime_inittask) // Must be before defer.
201 // Defer unlock so that runtime.Goexit during init does the unlock too.
211 main_init_done = make(chan bool)
213 if _cgo_thread_start == nil {
214 throw("_cgo_thread_start missing")
216 if GOOS != "windows" {
217 if _cgo_setenv == nil {
218 throw("_cgo_setenv missing")
220 if _cgo_unsetenv == nil {
221 throw("_cgo_unsetenv missing")
224 if _cgo_notify_runtime_init_done == nil {
225 throw("_cgo_notify_runtime_init_done missing")
227 // Start the template thread in case we enter Go from
228 // a C-created thread and need to create a new thread.
229 startTemplateThread()
230 cgocall(_cgo_notify_runtime_init_done, nil)
233 doInit(&main_inittask)
235 // Disable init tracing after main init done to avoid overhead
236 // of collecting statistics in malloc and newproc
237 inittrace.active = false
239 close(main_init_done)
244 if isarchive || islibrary {
245 // A program compiled with -buildmode=c-archive or c-shared
246 // has a main, but it is not executed.
249 fn := main_main // make an indirect call, as the linker doesn't know the address of the main package when laying down the runtime
255 // Make racy client program work: if panicking on
256 // another goroutine at the same time as main returns,
257 // let the other goroutine finish printing the panic trace.
258 // Once it does, it will exit. See issues 3934 and 20018.
259 if runningPanicDefers.Load() != 0 {
260 // Running deferred functions should not take long.
261 for c := 0; c < 1000; c++ {
262 if runningPanicDefers.Load() == 0 {
268 if panicking.Load() != 0 {
269 gopark(nil, nil, waitReasonPanicWait, traceEvGoStop, 1)
279 // os_beforeExit is called from os.Exit(0).
281 //go:linkname os_beforeExit os.runtime_beforeExit
282 func os_beforeExit() {
288 // start forcegc helper goroutine
293 func forcegchelper() {
295 lockInit(&forcegc.lock, lockRankForcegc)
298 if forcegc.idle.Load() {
299 throw("forcegc: phase error")
301 forcegc.idle.Store(true)
302 goparkunlock(&forcegc.lock, waitReasonForceGCIdle, traceEvGoBlock, 1)
303 // this goroutine is explicitly resumed by sysmon
304 if debug.gctrace > 0 {
307 // Time-triggered, fully concurrent.
308 gcStart(gcTrigger{kind: gcTriggerTime, now: nanotime()})
314 // Gosched yields the processor, allowing other goroutines to run. It does not
315 // suspend the current goroutine, so execution resumes automatically.
321 // goschedguarded yields the processor like gosched, but also checks
322 // for forbidden states and opts out of the yield in those cases.
325 func goschedguarded() {
326 mcall(goschedguarded_m)
329 // Puts the current goroutine into a waiting state and calls unlockf on the
332 // If unlockf returns false, the goroutine is resumed.
334 // unlockf must not access this G's stack, as it may be moved between
335 // the call to gopark and the call to unlockf.
337 // Note that because unlockf is called after putting the G into a waiting
338 // state, the G may have already been readied by the time unlockf is called
339 // unless there is external synchronization preventing the G from being
340 // readied. If unlockf returns false, it must guarantee that the G cannot be
341 // externally readied.
343 // Reason explains why the goroutine has been parked. It is displayed in stack
344 // traces and heap dumps. Reasons should be unique and descriptive. Do not
345 // re-use reasons, add new ones.
346 func gopark(unlockf func(*g, unsafe.Pointer) bool, lock unsafe.Pointer, reason waitReason, traceEv byte, traceskip int) {
347 if reason != waitReasonSleep {
348 checkTimeouts() // timeouts may expire while two goroutines keep the scheduler busy
352 status := readgstatus(gp)
353 if status != _Grunning && status != _Gscanrunning {
354 throw("gopark: bad g status")
357 mp.waitunlockf = unlockf
358 gp.waitreason = reason
359 mp.waittraceev = traceEv
360 mp.waittraceskip = traceskip
362 // can't do anything that might move the G between Ms here.
366 // Puts the current goroutine into a waiting state and unlocks the lock.
367 // The goroutine can be made runnable again by calling goready(gp).
368 func goparkunlock(lock *mutex, reason waitReason, traceEv byte, traceskip int) {
369 gopark(parkunlock_c, unsafe.Pointer(lock), reason, traceEv, traceskip)
372 func goready(gp *g, traceskip int) {
374 ready(gp, traceskip, true)
379 func acquireSudog() *sudog {
380 // Delicate dance: the semaphore implementation calls
381 // acquireSudog, acquireSudog calls new(sudog),
382 // new calls malloc, malloc can call the garbage collector,
383 // and the garbage collector calls the semaphore implementation
385 // Break the cycle by doing acquirem/releasem around new(sudog).
386 // The acquirem/releasem increments m.locks during new(sudog),
387 // which keeps the garbage collector from being invoked.
390 if len(pp.sudogcache) == 0 {
391 lock(&sched.sudoglock)
392 // First, try to grab a batch from central cache.
393 for len(pp.sudogcache) < cap(pp.sudogcache)/2 && sched.sudogcache != nil {
394 s := sched.sudogcache
395 sched.sudogcache = s.next
397 pp.sudogcache = append(pp.sudogcache, s)
399 unlock(&sched.sudoglock)
400 // If the central cache is empty, allocate a new one.
401 if len(pp.sudogcache) == 0 {
402 pp.sudogcache = append(pp.sudogcache, new(sudog))
405 n := len(pp.sudogcache)
406 s := pp.sudogcache[n-1]
407 pp.sudogcache[n-1] = nil
408 pp.sudogcache = pp.sudogcache[:n-1]
410 throw("acquireSudog: found s.elem != nil in cache")
417 func releaseSudog(s *sudog) {
419 throw("runtime: sudog with non-nil elem")
422 throw("runtime: sudog with non-false isSelect")
425 throw("runtime: sudog with non-nil next")
428 throw("runtime: sudog with non-nil prev")
430 if s.waitlink != nil {
431 throw("runtime: sudog with non-nil waitlink")
434 throw("runtime: sudog with non-nil c")
438 throw("runtime: releaseSudog with non-nil gp.param")
440 mp := acquirem() // avoid rescheduling to another P
442 if len(pp.sudogcache) == cap(pp.sudogcache) {
443 // Transfer half of local cache to the central cache.
444 var first, last *sudog
445 for len(pp.sudogcache) > cap(pp.sudogcache)/2 {
446 n := len(pp.sudogcache)
447 p := pp.sudogcache[n-1]
448 pp.sudogcache[n-1] = nil
449 pp.sudogcache = pp.sudogcache[:n-1]
457 lock(&sched.sudoglock)
458 last.next = sched.sudogcache
459 sched.sudogcache = first
460 unlock(&sched.sudoglock)
462 pp.sudogcache = append(pp.sudogcache, s)
466 // called from assembly
467 func badmcall(fn func(*g)) {
468 throw("runtime: mcall called on m->g0 stack")
471 func badmcall2(fn func(*g)) {
472 throw("runtime: mcall function returned")
475 func badreflectcall() {
476 panic(plainError("arg size to reflect.call more than 1GB"))
479 var badmorestackg0Msg = "fatal: morestack on g0\n"
482 //go:nowritebarrierrec
483 func badmorestackg0() {
484 sp := stringStructOf(&badmorestackg0Msg)
485 write(2, sp.str, int32(sp.len))
488 var badmorestackgsignalMsg = "fatal: morestack on gsignal\n"
491 //go:nowritebarrierrec
492 func badmorestackgsignal() {
493 sp := stringStructOf(&badmorestackgsignalMsg)
494 write(2, sp.str, int32(sp.len))
502 func lockedOSThread() bool {
504 return gp.lockedm != 0 && gp.m.lockedg != 0
508 // allgs contains all Gs ever created (including dead Gs), and thus
511 // Access via the slice is protected by allglock or stop-the-world.
512 // Readers that cannot take the lock may (carefully!) use the atomic
517 // allglen and allgptr are atomic variables that contain len(allgs) and
518 // &allgs[0] respectively. Proper ordering depends on totally-ordered
519 // loads and stores. Writes are protected by allglock.
521 // allgptr is updated before allglen. Readers should read allglen
522 // before allgptr to ensure that allglen is always <= len(allgptr). New
523 // Gs appended during the race can be missed. For a consistent view of
524 // all Gs, allglock must be held.
526 // allgptr copies should always be stored as a concrete type or
527 // unsafe.Pointer, not uintptr, to ensure that GC can still reach it
528 // even if it points to a stale array.
533 func allgadd(gp *g) {
534 if readgstatus(gp) == _Gidle {
535 throw("allgadd: bad status Gidle")
539 allgs = append(allgs, gp)
540 if &allgs[0] != allgptr {
541 atomicstorep(unsafe.Pointer(&allgptr), unsafe.Pointer(&allgs[0]))
543 atomic.Storeuintptr(&allglen, uintptr(len(allgs)))
547 // allGsSnapshot returns a snapshot of the slice of all Gs.
549 // The world must be stopped or allglock must be held.
550 func allGsSnapshot() []*g {
551 assertWorldStoppedOrLockHeld(&allglock)
553 // Because the world is stopped or allglock is held, allgadd
554 // cannot happen concurrently with this. allgs grows
555 // monotonically and existing entries never change, so we can
556 // simply return a copy of the slice header. For added safety,
557 // we trim everything past len because that can still change.
558 return allgs[:len(allgs):len(allgs)]
561 // atomicAllG returns &allgs[0] and len(allgs) for use with atomicAllGIndex.
562 func atomicAllG() (**g, uintptr) {
563 length := atomic.Loaduintptr(&allglen)
564 ptr := (**g)(atomic.Loadp(unsafe.Pointer(&allgptr)))
568 // atomicAllGIndex returns ptr[i] with the allgptr returned from atomicAllG.
569 func atomicAllGIndex(ptr **g, i uintptr) *g {
570 return *(**g)(add(unsafe.Pointer(ptr), i*goarch.PtrSize))
573 // forEachG calls fn on every G from allgs.
575 // forEachG takes a lock to exclude concurrent addition of new Gs.
576 func forEachG(fn func(gp *g)) {
578 for _, gp := range allgs {
584 // forEachGRace calls fn on every G from allgs.
586 // forEachGRace avoids locking, but does not exclude addition of new Gs during
587 // execution, which may be missed.
588 func forEachGRace(fn func(gp *g)) {
589 ptr, length := atomicAllG()
590 for i := uintptr(0); i < length; i++ {
591 gp := atomicAllGIndex(ptr, i)
598 // Number of goroutine ids to grab from sched.goidgen to local per-P cache at once.
599 // 16 seems to provide enough amortization, but other than that it's mostly arbitrary number.
603 // cpuinit extracts the environment variable GODEBUG from the environment on
604 // Unix-like operating systems and calls internal/cpu.Initialize.
606 const prefix = "GODEBUG="
610 case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
611 cpu.DebugOptions = true
613 // Similar to goenv_unix but extracts the environment value for
615 // TODO(moehrmann): remove when general goenvs() can be called before cpuinit()
617 for argv_index(argv, argc+1+n) != nil {
621 for i := int32(0); i < n; i++ {
622 p := argv_index(argv, argc+1+i)
623 s := *(*string)(unsafe.Pointer(&stringStruct{unsafe.Pointer(p), findnull(p)}))
625 if hasPrefix(s, prefix) {
626 env = gostring(p)[len(prefix):]
634 // Support cpu feature variables are used in code generated by the compiler
635 // to guard execution of instructions that can not be assumed to be always supported.
638 x86HasPOPCNT = cpu.X86.HasPOPCNT
639 x86HasSSE41 = cpu.X86.HasSSE41
640 x86HasFMA = cpu.X86.HasFMA
643 armHasVFPv4 = cpu.ARM.HasVFPv4
646 arm64HasATOMICS = cpu.ARM64.HasATOMICS
650 // The bootstrap sequence is:
654 // make & queue new G
655 // call runtime·mstart
657 // The new G calls runtime·main.
659 lockInit(&sched.lock, lockRankSched)
660 lockInit(&sched.sysmonlock, lockRankSysmon)
661 lockInit(&sched.deferlock, lockRankDefer)
662 lockInit(&sched.sudoglock, lockRankSudog)
663 lockInit(&deadlock, lockRankDeadlock)
664 lockInit(&paniclk, lockRankPanic)
665 lockInit(&allglock, lockRankAllg)
666 lockInit(&allpLock, lockRankAllp)
667 lockInit(&reflectOffs.lock, lockRankReflectOffs)
668 lockInit(&finlock, lockRankFin)
669 lockInit(&trace.bufLock, lockRankTraceBuf)
670 lockInit(&trace.stringsLock, lockRankTraceStrings)
671 lockInit(&trace.lock, lockRankTrace)
672 lockInit(&cpuprof.lock, lockRankCpuprof)
673 lockInit(&trace.stackTab.lock, lockRankTraceStackTab)
674 // Enforce that this lock is always a leaf lock.
675 // All of this lock's critical sections should be
677 lockInit(&memstats.heapStats.noPLock, lockRankLeafRank)
679 // raceinit must be the first call to race detector.
680 // In particular, it must be done before mallocinit below calls racemapshadow.
683 gp.racectx, raceprocctx0 = raceinit()
686 sched.maxmcount = 10000
688 // The world starts stopped.
694 cpuinit() // must run before alginit
695 alginit() // maps, hash, fastrand must not be used before this call
696 fastrandinit() // must run before mcommoninit
697 mcommoninit(gp.m, -1)
698 modulesinit() // provides activeModules
699 typelinksinit() // uses maps, activeModules
700 itabsinit() // uses activeModules
701 stkobjinit() // must run before GC starts
703 sigsave(&gp.m.sigmask)
704 initSigmask = gp.m.sigmask
712 sched.lastpoll.Store(nanotime())
714 if n, ok := atoi32(gogetenv("GOMAXPROCS")); ok && n > 0 {
717 if procresize(procs) != nil {
718 throw("unknown runnable goroutine during bootstrap")
722 // World is effectively started now, as P's can run.
725 // For cgocheck > 1, we turn on the write barrier at all times
726 // and check all pointer writes. We can't do this until after
727 // procresize because the write barrier needs a P.
728 if debug.cgocheck > 1 {
729 writeBarrier.cgo = true
730 writeBarrier.enabled = true
731 for _, pp := range allp {
736 if buildVersion == "" {
737 // Condition should never trigger. This code just serves
738 // to ensure runtime·buildVersion is kept in the resulting binary.
739 buildVersion = "unknown"
741 if len(modinfo) == 1 {
742 // Condition should never trigger. This code just serves
743 // to ensure runtime·modinfo is kept in the resulting binary.
748 func dumpgstatus(gp *g) {
750 print("runtime: gp: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
751 print("runtime: getg: g=", thisg, ", goid=", thisg.goid, ", g->atomicstatus=", readgstatus(thisg), "\n")
754 // sched.lock must be held.
756 assertLockHeld(&sched.lock)
758 if mcount() > sched.maxmcount {
759 print("runtime: program exceeds ", sched.maxmcount, "-thread limit\n")
760 throw("thread exhaustion")
764 // mReserveID returns the next ID to use for a new m. This new m is immediately
765 // considered 'running' by checkdead.
767 // sched.lock must be held.
768 func mReserveID() int64 {
769 assertLockHeld(&sched.lock)
771 if sched.mnext+1 < sched.mnext {
772 throw("runtime: thread ID overflow")
780 // Pre-allocated ID may be passed as 'id', or omitted by passing -1.
781 func mcommoninit(mp *m, id int64) {
784 // g0 stack won't make sense for user (and is not necessary unwindable).
786 callers(1, mp.createstack[:])
797 lo := uint32(int64Hash(uint64(mp.id), fastrandseed))
798 hi := uint32(int64Hash(uint64(cputicks()), ^fastrandseed))
802 // Same behavior as for 1.17.
803 // TODO: Simplify ths.
804 if goarch.BigEndian {
805 mp.fastrand = uint64(lo)<<32 | uint64(hi)
807 mp.fastrand = uint64(hi)<<32 | uint64(lo)
811 if mp.gsignal != nil {
812 mp.gsignal.stackguard1 = mp.gsignal.stack.lo + _StackGuard
815 // Add to allm so garbage collector doesn't free g->m
816 // when it is just in a register or thread-local storage.
819 // NumCgoCall() iterates over allm w/o schedlock,
820 // so we need to publish it safely.
821 atomicstorep(unsafe.Pointer(&allm), unsafe.Pointer(mp))
824 // Allocate memory to hold a cgo traceback if the cgo call crashes.
825 if iscgo || GOOS == "solaris" || GOOS == "illumos" || GOOS == "windows" {
826 mp.cgoCallers = new(cgoCallers)
830 func (mp *m) becomeSpinning() {
832 sched.nmspinning.Add(1)
833 sched.needspinning.Store(0)
836 var fastrandseed uintptr
838 func fastrandinit() {
839 s := (*[unsafe.Sizeof(fastrandseed)]byte)(unsafe.Pointer(&fastrandseed))[:]
843 // Mark gp ready to run.
844 func ready(gp *g, traceskip int, next bool) {
846 traceGoUnpark(gp, traceskip)
849 status := readgstatus(gp)
852 mp := acquirem() // disable preemption because it can be holding p in a local var
853 if status&^_Gscan != _Gwaiting {
855 throw("bad g->status in ready")
858 // status is Gwaiting or Gscanwaiting, make Grunnable and put on runq
859 casgstatus(gp, _Gwaiting, _Grunnable)
860 runqput(mp.p.ptr(), gp, next)
865 // freezeStopWait is a large value that freezetheworld sets
866 // sched.stopwait to in order to request that all Gs permanently stop.
867 const freezeStopWait = 0x7fffffff
869 // freezing is set to non-zero if the runtime is trying to freeze the
871 var freezing atomic.Bool
873 // Similar to stopTheWorld but best-effort and can be called several times.
874 // There is no reverse operation, used during crashing.
875 // This function must not lock any mutexes.
876 func freezetheworld() {
878 // stopwait and preemption requests can be lost
879 // due to races with concurrently executing threads,
880 // so try several times
881 for i := 0; i < 5; i++ {
882 // this should tell the scheduler to not start any new goroutines
883 sched.stopwait = freezeStopWait
884 sched.gcwaiting.Store(true)
885 // this should stop running goroutines
887 break // no running goroutines
897 // All reads and writes of g's status go through readgstatus, casgstatus
898 // castogscanstatus, casfrom_Gscanstatus.
901 func readgstatus(gp *g) uint32 {
902 return atomic.Load(&gp.atomicstatus)
905 // The Gscanstatuses are acting like locks and this releases them.
906 // If it proves to be a performance hit we should be able to make these
907 // simple atomic stores but for now we are going to throw if
908 // we see an inconsistent state.
909 func casfrom_Gscanstatus(gp *g, oldval, newval uint32) {
912 // Check that transition is valid.
915 print("runtime: casfrom_Gscanstatus bad oldval gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
917 throw("casfrom_Gscanstatus:top gp->status is not in scan state")
923 if newval == oldval&^_Gscan {
924 success = atomic.Cas(&gp.atomicstatus, oldval, newval)
928 print("runtime: casfrom_Gscanstatus failed gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
930 throw("casfrom_Gscanstatus: gp->status is not in scan state")
932 releaseLockRank(lockRankGscan)
935 // This will return false if the gp is not in the expected status and the cas fails.
936 // This acts like a lock acquire while the casfromgstatus acts like a lock release.
937 func castogscanstatus(gp *g, oldval, newval uint32) bool {
943 if newval == oldval|_Gscan {
944 r := atomic.Cas(&gp.atomicstatus, oldval, newval)
946 acquireLockRank(lockRankGscan)
952 print("runtime: castogscanstatus oldval=", hex(oldval), " newval=", hex(newval), "\n")
953 throw("castogscanstatus")
957 // If asked to move to or from a Gscanstatus this will throw. Use the castogscanstatus
958 // and casfrom_Gscanstatus instead.
959 // casgstatus will loop if the g->atomicstatus is in a Gscan status until the routine that
960 // put it in the Gscan state is finished.
963 func casgstatus(gp *g, oldval, newval uint32) {
964 if (oldval&_Gscan != 0) || (newval&_Gscan != 0) || oldval == newval {
966 print("runtime: casgstatus: oldval=", hex(oldval), " newval=", hex(newval), "\n")
967 throw("casgstatus: bad incoming values")
971 acquireLockRank(lockRankGscan)
972 releaseLockRank(lockRankGscan)
974 // See https://golang.org/cl/21503 for justification of the yield delay.
975 const yieldDelay = 5 * 1000
978 // loop if gp->atomicstatus is in a scan state giving
979 // GC time to finish and change the state to oldval.
980 for i := 0; !atomic.Cas(&gp.atomicstatus, oldval, newval); i++ {
981 if oldval == _Gwaiting && gp.atomicstatus == _Grunnable {
982 throw("casgstatus: waiting for Gwaiting but is Grunnable")
985 nextYield = nanotime() + yieldDelay
987 if nanotime() < nextYield {
988 for x := 0; x < 10 && gp.atomicstatus != oldval; x++ {
993 nextYield = nanotime() + yieldDelay/2
997 // Handle tracking for scheduling latencies.
998 if oldval == _Grunning {
999 // Track every 8th time a goroutine transitions out of running.
1000 if gp.trackingSeq%gTrackingPeriod == 0 {
1006 if oldval == _Grunnable {
1007 // We transitioned out of runnable, so measure how much
1008 // time we spent in this state and add it to
1011 gp.runnableTime += now - gp.runnableStamp
1012 gp.runnableStamp = 0
1014 if newval == _Grunnable {
1015 // We just transitioned into runnable, so record what
1016 // time that happened.
1018 gp.runnableStamp = now
1019 } else if newval == _Grunning {
1020 // We're transitioning into running, so turn off
1021 // tracking and record how much time we spent in
1024 sched.timeToRun.record(gp.runnableTime)
1030 // casgstatus(gp, oldstatus, Gcopystack), assuming oldstatus is Gwaiting or Grunnable.
1031 // Returns old status. Cannot call casgstatus directly, because we are racing with an
1032 // async wakeup that might come in from netpoll. If we see Gwaiting from the readgstatus,
1033 // it might have become Grunnable by the time we get to the cas. If we called casgstatus,
1034 // it would loop waiting for the status to go back to Gwaiting, which it never will.
1037 func casgcopystack(gp *g) uint32 {
1039 oldstatus := readgstatus(gp) &^ _Gscan
1040 if oldstatus != _Gwaiting && oldstatus != _Grunnable {
1041 throw("copystack: bad status, not Gwaiting or Grunnable")
1043 if atomic.Cas(&gp.atomicstatus, oldstatus, _Gcopystack) {
1049 // casGToPreemptScan transitions gp from _Grunning to _Gscan|_Gpreempted.
1051 // TODO(austin): This is the only status operation that both changes
1052 // the status and locks the _Gscan bit. Rethink this.
1053 func casGToPreemptScan(gp *g, old, new uint32) {
1054 if old != _Grunning || new != _Gscan|_Gpreempted {
1055 throw("bad g transition")
1057 acquireLockRank(lockRankGscan)
1058 for !atomic.Cas(&gp.atomicstatus, _Grunning, _Gscan|_Gpreempted) {
1062 // casGFromPreempted attempts to transition gp from _Gpreempted to
1063 // _Gwaiting. If successful, the caller is responsible for
1064 // re-scheduling gp.
1065 func casGFromPreempted(gp *g, old, new uint32) bool {
1066 if old != _Gpreempted || new != _Gwaiting {
1067 throw("bad g transition")
1069 return atomic.Cas(&gp.atomicstatus, _Gpreempted, _Gwaiting)
1072 // stopTheWorld stops all P's from executing goroutines, interrupting
1073 // all goroutines at GC safe points and records reason as the reason
1074 // for the stop. On return, only the current goroutine's P is running.
1075 // stopTheWorld must not be called from a system stack and the caller
1076 // must not hold worldsema. The caller must call startTheWorld when
1077 // other P's should resume execution.
1079 // stopTheWorld is safe for multiple goroutines to call at the
1080 // same time. Each will execute its own stop, and the stops will
1083 // This is also used by routines that do stack dumps. If the system is
1084 // in panic or being exited, this may not reliably stop all
1086 func stopTheWorld(reason string) {
1087 semacquire(&worldsema)
1089 gp.m.preemptoff = reason
1090 systemstack(func() {
1091 // Mark the goroutine which called stopTheWorld preemptible so its
1092 // stack may be scanned.
1093 // This lets a mark worker scan us while we try to stop the world
1094 // since otherwise we could get in a mutual preemption deadlock.
1095 // We must not modify anything on the G stack because a stack shrink
1096 // may occur. A stack shrink is otherwise OK though because in order
1097 // to return from this function (and to leave the system stack) we
1098 // must have preempted all goroutines, including any attempting
1099 // to scan our stack, in which case, any stack shrinking will
1100 // have already completed by the time we exit.
1101 casgstatus(gp, _Grunning, _Gwaiting)
1102 stopTheWorldWithSema()
1103 casgstatus(gp, _Gwaiting, _Grunning)
1107 // startTheWorld undoes the effects of stopTheWorld.
1108 func startTheWorld() {
1109 systemstack(func() { startTheWorldWithSema(false) })
1111 // worldsema must be held over startTheWorldWithSema to ensure
1112 // gomaxprocs cannot change while worldsema is held.
1114 // Release worldsema with direct handoff to the next waiter, but
1115 // acquirem so that semrelease1 doesn't try to yield our time.
1117 // Otherwise if e.g. ReadMemStats is being called in a loop,
1118 // it might stomp on other attempts to stop the world, such as
1119 // for starting or ending GC. The operation this blocks is
1120 // so heavy-weight that we should just try to be as fair as
1123 // We don't want to just allow us to get preempted between now
1124 // and releasing the semaphore because then we keep everyone
1125 // (including, for example, GCs) waiting longer.
1128 semrelease1(&worldsema, true, 0)
1132 // stopTheWorldGC has the same effect as stopTheWorld, but blocks
1133 // until the GC is not running. It also blocks a GC from starting
1134 // until startTheWorldGC is called.
1135 func stopTheWorldGC(reason string) {
1137 stopTheWorld(reason)
1140 // startTheWorldGC undoes the effects of stopTheWorldGC.
1141 func startTheWorldGC() {
1146 // Holding worldsema grants an M the right to try to stop the world.
1147 var worldsema uint32 = 1
1149 // Holding gcsema grants the M the right to block a GC, and blocks
1150 // until the current GC is done. In particular, it prevents gomaxprocs
1151 // from changing concurrently.
1153 // TODO(mknyszek): Once gomaxprocs and the execution tracer can handle
1154 // being changed/enabled during a GC, remove this.
1155 var gcsema uint32 = 1
1157 // stopTheWorldWithSema is the core implementation of stopTheWorld.
1158 // The caller is responsible for acquiring worldsema and disabling
1159 // preemption first and then should stopTheWorldWithSema on the system
1162 // semacquire(&worldsema, 0)
1163 // m.preemptoff = "reason"
1164 // systemstack(stopTheWorldWithSema)
1166 // When finished, the caller must either call startTheWorld or undo
1167 // these three operations separately:
1169 // m.preemptoff = ""
1170 // systemstack(startTheWorldWithSema)
1171 // semrelease(&worldsema)
1173 // It is allowed to acquire worldsema once and then execute multiple
1174 // startTheWorldWithSema/stopTheWorldWithSema pairs.
1175 // Other P's are able to execute between successive calls to
1176 // startTheWorldWithSema and stopTheWorldWithSema.
1177 // Holding worldsema causes any other goroutines invoking
1178 // stopTheWorld to block.
1179 func stopTheWorldWithSema() {
1182 // If we hold a lock, then we won't be able to stop another M
1183 // that is blocked trying to acquire the lock.
1185 throw("stopTheWorld: holding locks")
1189 sched.stopwait = gomaxprocs
1190 sched.gcwaiting.Store(true)
1193 gp.m.p.ptr().status = _Pgcstop // Pgcstop is only diagnostic.
1195 // try to retake all P's in Psyscall status
1196 for _, pp := range allp {
1198 if s == _Psyscall && atomic.Cas(&pp.status, s, _Pgcstop) {
1210 pp, _ := pidleget(now)
1214 pp.status = _Pgcstop
1217 wait := sched.stopwait > 0
1220 // wait for remaining P's to stop voluntarily
1223 // wait for 100us, then try to re-preempt in case of any races
1224 if notetsleep(&sched.stopnote, 100*1000) {
1225 noteclear(&sched.stopnote)
1234 if sched.stopwait != 0 {
1235 bad = "stopTheWorld: not stopped (stopwait != 0)"
1237 for _, pp := range allp {
1238 if pp.status != _Pgcstop {
1239 bad = "stopTheWorld: not stopped (status != _Pgcstop)"
1243 if freezing.Load() {
1244 // Some other thread is panicking. This can cause the
1245 // sanity checks above to fail if the panic happens in
1246 // the signal handler on a stopped thread. Either way,
1247 // we should halt this thread.
1258 func startTheWorldWithSema(emitTraceEvent bool) int64 {
1259 assertWorldStopped()
1261 mp := acquirem() // disable preemption because it can be holding p in a local var
1262 if netpollinited() {
1263 list := netpoll(0) // non-blocking
1273 p1 := procresize(procs)
1274 sched.gcwaiting.Store(false)
1275 if sched.sysmonwait.Load() {
1276 sched.sysmonwait.Store(false)
1277 notewakeup(&sched.sysmonnote)
1290 throw("startTheWorld: inconsistent mp->nextp")
1293 notewakeup(&mp.park)
1295 // Start M to run P. Do not start another M below.
1300 // Capture start-the-world time before doing clean-up tasks.
1301 startTime := nanotime()
1306 // Wakeup an additional proc in case we have excessive runnable goroutines
1307 // in local queues or in the global queue. If we don't, the proc will park itself.
1308 // If we have lots of excessive work, resetspinning will unpark additional procs as necessary.
1316 // usesLibcall indicates whether this runtime performs system calls
1318 func usesLibcall() bool {
1320 case "aix", "darwin", "illumos", "ios", "solaris", "windows":
1323 return GOARCH == "386" || GOARCH == "amd64" || GOARCH == "arm" || GOARCH == "arm64"
1328 // mStackIsSystemAllocated indicates whether this runtime starts on a
1329 // system-allocated stack.
1330 func mStackIsSystemAllocated() bool {
1332 case "aix", "darwin", "plan9", "illumos", "ios", "solaris", "windows":
1336 case "386", "amd64", "arm", "arm64":
1343 // mstart is the entry-point for new Ms.
1344 // It is written in assembly, uses ABI0, is marked TOPFRAME, and calls mstart0.
1347 // mstart0 is the Go entry-point for new Ms.
1348 // This must not split the stack because we may not even have stack
1349 // bounds set up yet.
1351 // May run during STW (because it doesn't have a P yet), so write
1352 // barriers are not allowed.
1355 //go:nowritebarrierrec
1359 osStack := gp.stack.lo == 0
1361 // Initialize stack bounds from system stack.
1362 // Cgo may have left stack size in stack.hi.
1363 // minit may update the stack bounds.
1365 // Note: these bounds may not be very accurate.
1366 // We set hi to &size, but there are things above
1367 // it. The 1024 is supposed to compensate this,
1368 // but is somewhat arbitrary.
1371 size = 8192 * sys.StackGuardMultiplier
1373 gp.stack.hi = uintptr(noescape(unsafe.Pointer(&size)))
1374 gp.stack.lo = gp.stack.hi - size + 1024
1376 // Initialize stack guard so that we can start calling regular
1378 gp.stackguard0 = gp.stack.lo + _StackGuard
1379 // This is the g0, so we can also call go:systemstack
1380 // functions, which check stackguard1.
1381 gp.stackguard1 = gp.stackguard0
1384 // Exit this thread.
1385 if mStackIsSystemAllocated() {
1386 // Windows, Solaris, illumos, Darwin, AIX and Plan 9 always system-allocate
1387 // the stack, but put it in gp.stack before mstart,
1388 // so the logic above hasn't set osStack yet.
1394 // The go:noinline is to guarantee the getcallerpc/getcallersp below are safe,
1395 // so that we can set up g0.sched to return to the call of mstart1 above.
1402 throw("bad runtime·mstart")
1405 // Set up m.g0.sched as a label returning to just
1406 // after the mstart1 call in mstart0 above, for use by goexit0 and mcall.
1407 // We're never coming back to mstart1 after we call schedule,
1408 // so other calls can reuse the current frame.
1409 // And goexit0 does a gogo that needs to return from mstart1
1410 // and let mstart0 exit the thread.
1411 gp.sched.g = guintptr(unsafe.Pointer(gp))
1412 gp.sched.pc = getcallerpc()
1413 gp.sched.sp = getcallersp()
1418 // Install signal handlers; after minit so that minit can
1419 // prepare the thread to be able to handle the signals.
1424 if fn := gp.m.mstartfn; fn != nil {
1429 acquirep(gp.m.nextp.ptr())
1435 // mstartm0 implements part of mstart1 that only runs on the m0.
1437 // Write barriers are allowed here because we know the GC can't be
1438 // running yet, so they'll be no-ops.
1440 //go:yeswritebarrierrec
1442 // Create an extra M for callbacks on threads not created by Go.
1443 // An extra M is also needed on Windows for callbacks created by
1444 // syscall.NewCallback. See issue #6751 for details.
1445 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1452 // mPark causes a thread to park itself, returning once woken.
1457 notesleep(&gp.m.park)
1458 noteclear(&gp.m.park)
1461 // mexit tears down and exits the current thread.
1463 // Don't call this directly to exit the thread, since it must run at
1464 // the top of the thread stack. Instead, use gogo(&gp.m.g0.sched) to
1465 // unwind the stack to the point that exits the thread.
1467 // It is entered with m.p != nil, so write barriers are allowed. It
1468 // will release the P before exiting.
1470 //go:yeswritebarrierrec
1471 func mexit(osStack bool) {
1475 // This is the main thread. Just wedge it.
1477 // On Linux, exiting the main thread puts the process
1478 // into a non-waitable zombie state. On Plan 9,
1479 // exiting the main thread unblocks wait even though
1480 // other threads are still running. On Solaris we can
1481 // neither exitThread nor return from mstart. Other
1482 // bad things probably happen on other platforms.
1484 // We could try to clean up this M more before wedging
1485 // it, but that complicates signal handling.
1486 handoffp(releasep())
1492 throw("locked m0 woke up")
1498 // Free the gsignal stack.
1499 if mp.gsignal != nil {
1500 stackfree(mp.gsignal.stack)
1501 // On some platforms, when calling into VDSO (e.g. nanotime)
1502 // we store our g on the gsignal stack, if there is one.
1503 // Now the stack is freed, unlink it from the m, so we
1504 // won't write to it when calling VDSO code.
1508 // Remove m from allm.
1510 for pprev := &allm; *pprev != nil; pprev = &(*pprev).alllink {
1516 throw("m not found in allm")
1519 // Delay reaping m until it's done with the stack.
1521 // If this is using an OS stack, the OS will free it
1522 // so there's no need for reaping.
1523 atomic.Store(&mp.freeWait, 1)
1524 // Put m on the free list, though it will not be reaped until
1525 // freeWait is 0. Note that the free list must not be linked
1526 // through alllink because some functions walk allm without
1527 // locking, so may be using alllink.
1528 mp.freelink = sched.freem
1533 atomic.Xadd64(&ncgocall, int64(mp.ncgocall))
1536 handoffp(releasep())
1537 // After this point we must not have write barriers.
1539 // Invoke the deadlock detector. This must happen after
1540 // handoffp because it may have started a new M to take our
1547 if GOOS == "darwin" || GOOS == "ios" {
1548 // Make sure pendingPreemptSignals is correct when an M exits.
1550 if mp.signalPending.Load() != 0 {
1551 pendingPreemptSignals.Add(-1)
1555 // Destroy all allocated resources. After this is called, we may no
1556 // longer take any locks.
1560 // Return from mstart and let the system thread
1561 // library free the g0 stack and terminate the thread.
1565 // mstart is the thread's entry point, so there's nothing to
1566 // return to. Exit the thread directly. exitThread will clear
1567 // m.freeWait when it's done with the stack and the m can be
1569 exitThread(&mp.freeWait)
1572 // forEachP calls fn(p) for every P p when p reaches a GC safe point.
1573 // If a P is currently executing code, this will bring the P to a GC
1574 // safe point and execute fn on that P. If the P is not executing code
1575 // (it is idle or in a syscall), this will call fn(p) directly while
1576 // preventing the P from exiting its state. This does not ensure that
1577 // fn will run on every CPU executing Go code, but it acts as a global
1578 // memory barrier. GC uses this as a "ragged barrier."
1580 // The caller must hold worldsema.
1583 func forEachP(fn func(*p)) {
1585 pp := getg().m.p.ptr()
1588 if sched.safePointWait != 0 {
1589 throw("forEachP: sched.safePointWait != 0")
1591 sched.safePointWait = gomaxprocs - 1
1592 sched.safePointFn = fn
1594 // Ask all Ps to run the safe point function.
1595 for _, p2 := range allp {
1597 atomic.Store(&p2.runSafePointFn, 1)
1602 // Any P entering _Pidle or _Psyscall from now on will observe
1603 // p.runSafePointFn == 1 and will call runSafePointFn when
1604 // changing its status to _Pidle/_Psyscall.
1606 // Run safe point function for all idle Ps. sched.pidle will
1607 // not change because we hold sched.lock.
1608 for p := sched.pidle.ptr(); p != nil; p = p.link.ptr() {
1609 if atomic.Cas(&p.runSafePointFn, 1, 0) {
1611 sched.safePointWait--
1615 wait := sched.safePointWait > 0
1618 // Run fn for the current P.
1621 // Force Ps currently in _Psyscall into _Pidle and hand them
1622 // off to induce safe point function execution.
1623 for _, p2 := range allp {
1625 if s == _Psyscall && p2.runSafePointFn == 1 && atomic.Cas(&p2.status, s, _Pidle) {
1635 // Wait for remaining Ps to run fn.
1638 // Wait for 100us, then try to re-preempt in
1639 // case of any races.
1641 // Requires system stack.
1642 if notetsleep(&sched.safePointNote, 100*1000) {
1643 noteclear(&sched.safePointNote)
1649 if sched.safePointWait != 0 {
1650 throw("forEachP: not done")
1652 for _, p2 := range allp {
1653 if p2.runSafePointFn != 0 {
1654 throw("forEachP: P did not run fn")
1659 sched.safePointFn = nil
1664 // runSafePointFn runs the safe point function, if any, for this P.
1665 // This should be called like
1667 // if getg().m.p.runSafePointFn != 0 {
1671 // runSafePointFn must be checked on any transition in to _Pidle or
1672 // _Psyscall to avoid a race where forEachP sees that the P is running
1673 // just before the P goes into _Pidle/_Psyscall and neither forEachP
1674 // nor the P run the safe-point function.
1675 func runSafePointFn() {
1676 p := getg().m.p.ptr()
1677 // Resolve the race between forEachP running the safe-point
1678 // function on this P's behalf and this P running the
1679 // safe-point function directly.
1680 if !atomic.Cas(&p.runSafePointFn, 1, 0) {
1683 sched.safePointFn(p)
1685 sched.safePointWait--
1686 if sched.safePointWait == 0 {
1687 notewakeup(&sched.safePointNote)
1692 // When running with cgo, we call _cgo_thread_start
1693 // to start threads for us so that we can play nicely with
1695 var cgoThreadStart unsafe.Pointer
1697 type cgothreadstart struct {
1703 // Allocate a new m unassociated with any thread.
1704 // Can use p for allocation context if needed.
1705 // fn is recorded as the new m's m.mstartfn.
1706 // id is optional pre-allocated m ID. Omit by passing -1.
1708 // This function is allowed to have write barriers even if the caller
1709 // isn't because it borrows pp.
1711 //go:yeswritebarrierrec
1712 func allocm(pp *p, fn func(), id int64) *m {
1715 // The caller owns pp, but we may borrow (i.e., acquirep) it. We must
1716 // disable preemption to ensure it is not stolen, which would make the
1717 // caller lose ownership.
1722 acquirep(pp) // temporarily borrow p for mallocs in this function
1725 // Release the free M list. We need to do this somewhere and
1726 // this may free up a stack we can use.
1727 if sched.freem != nil {
1730 for freem := sched.freem; freem != nil; {
1731 if freem.freeWait != 0 {
1732 next := freem.freelink
1733 freem.freelink = newList
1738 // stackfree must be on the system stack, but allocm is
1739 // reachable off the system stack transitively from
1741 systemstack(func() {
1742 stackfree(freem.g0.stack)
1744 freem = freem.freelink
1746 sched.freem = newList
1754 // In case of cgo or Solaris or illumos or Darwin, pthread_create will make us a stack.
1755 // Windows and Plan 9 will layout sched stack on OS stack.
1756 if iscgo || mStackIsSystemAllocated() {
1759 mp.g0 = malg(8192 * sys.StackGuardMultiplier)
1763 if pp == gp.m.p.ptr() {
1768 allocmLock.runlock()
1772 // needm is called when a cgo callback happens on a
1773 // thread without an m (a thread not created by Go).
1774 // In this case, needm is expected to find an m to use
1775 // and return with m, g initialized correctly.
1776 // Since m and g are not set now (likely nil, but see below)
1777 // needm is limited in what routines it can call. In particular
1778 // it can only call nosplit functions (textflag 7) and cannot
1779 // do any scheduling that requires an m.
1781 // In order to avoid needing heavy lifting here, we adopt
1782 // the following strategy: there is a stack of available m's
1783 // that can be stolen. Using compare-and-swap
1784 // to pop from the stack has ABA races, so we simulate
1785 // a lock by doing an exchange (via Casuintptr) to steal the stack
1786 // head and replace the top pointer with MLOCKED (1).
1787 // This serves as a simple spin lock that we can use even
1788 // without an m. The thread that locks the stack in this way
1789 // unlocks the stack by storing a valid stack head pointer.
1791 // In order to make sure that there is always an m structure
1792 // available to be stolen, we maintain the invariant that there
1793 // is always one more than needed. At the beginning of the
1794 // program (if cgo is in use) the list is seeded with a single m.
1795 // If needm finds that it has taken the last m off the list, its job
1796 // is - once it has installed its own m so that it can do things like
1797 // allocate memory - to create a spare m and put it on the list.
1799 // Each of these extra m's also has a g0 and a curg that are
1800 // pressed into service as the scheduling stack and current
1801 // goroutine for the duration of the cgo callback.
1803 // When the callback is done with the m, it calls dropm to
1804 // put the m back on the list.
1808 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1809 // Can happen if C/C++ code calls Go from a global ctor.
1810 // Can also happen on Windows if a global ctor uses a
1811 // callback created by syscall.NewCallback. See issue #6751
1814 // Can not throw, because scheduler is not initialized yet.
1815 write(2, unsafe.Pointer(&earlycgocallback[0]), int32(len(earlycgocallback)))
1819 // Save and block signals before getting an M.
1820 // The signal handler may call needm itself,
1821 // and we must avoid a deadlock. Also, once g is installed,
1822 // any incoming signals will try to execute,
1823 // but we won't have the sigaltstack settings and other data
1824 // set up appropriately until the end of minit, which will
1825 // unblock the signals. This is the same dance as when
1826 // starting a new m to run Go code via newosproc.
1831 // Lock extra list, take head, unlock popped list.
1832 // nilokay=false is safe here because of the invariant above,
1833 // that the extra list always contains or will soon contain
1835 mp := lockextra(false)
1837 // Set needextram when we've just emptied the list,
1838 // so that the eventual call into cgocallbackg will
1839 // allocate a new m for the extra list. We delay the
1840 // allocation until then so that it can be done
1841 // after exitsyscall makes sure it is okay to be
1842 // running at all (that is, there's no garbage collection
1843 // running right now).
1844 mp.needextram = mp.schedlink == 0
1846 unlockextra(mp.schedlink.ptr())
1848 // Store the original signal mask for use by minit.
1849 mp.sigmask = sigmask
1851 // Install TLS on some platforms (previously setg
1852 // would do this if necessary).
1855 // Install g (= m->g0) and set the stack bounds
1856 // to match the current stack. We don't actually know
1857 // how big the stack is, like we don't know how big any
1858 // scheduling stack is, but we assume there's at least 32 kB,
1859 // which is more than enough for us.
1862 gp.stack.hi = getcallersp() + 1024
1863 gp.stack.lo = getcallersp() - 32*1024
1864 gp.stackguard0 = gp.stack.lo + _StackGuard
1866 // Initialize this thread to use the m.
1870 // mp.curg is now a real goroutine.
1871 casgstatus(mp.curg, _Gdead, _Gsyscall)
1875 var earlycgocallback = []byte("fatal error: cgo callback before cgo call\n")
1877 // newextram allocates m's and puts them on the extra list.
1878 // It is called with a working local m, so that it can do things
1879 // like call schedlock and allocate.
1881 c := extraMWaiters.Swap(0)
1883 for i := uint32(0); i < c; i++ {
1887 // Make sure there is at least one extra M.
1888 mp := lockextra(true)
1896 // oneNewExtraM allocates an m and puts it on the extra list.
1897 func oneNewExtraM() {
1898 // Create extra goroutine locked to extra m.
1899 // The goroutine is the context in which the cgo callback will run.
1900 // The sched.pc will never be returned to, but setting it to
1901 // goexit makes clear to the traceback routines where
1902 // the goroutine stack ends.
1903 mp := allocm(nil, nil, -1)
1905 gp.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum
1906 gp.sched.sp = gp.stack.hi
1907 gp.sched.sp -= 4 * goarch.PtrSize // extra space in case of reads slightly beyond frame
1909 gp.sched.g = guintptr(unsafe.Pointer(gp))
1910 gp.syscallpc = gp.sched.pc
1911 gp.syscallsp = gp.sched.sp
1912 gp.stktopsp = gp.sched.sp
1913 // malg returns status as _Gidle. Change to _Gdead before
1914 // adding to allg where GC can see it. We use _Gdead to hide
1915 // this from tracebacks and stack scans since it isn't a
1916 // "real" goroutine until needm grabs it.
1917 casgstatus(gp, _Gidle, _Gdead)
1923 gp.goid = sched.goidgen.Add(1)
1925 gp.racectx = racegostart(abi.FuncPCABIInternal(newextram) + sys.PCQuantum)
1927 // put on allg for garbage collector
1930 // gp is now on the allg list, but we don't want it to be
1931 // counted by gcount. It would be more "proper" to increment
1932 // sched.ngfree, but that requires locking. Incrementing ngsys
1933 // has the same effect.
1936 // Add m to the extra list.
1937 mnext := lockextra(true)
1938 mp.schedlink.set(mnext)
1943 // dropm is called when a cgo callback has called needm but is now
1944 // done with the callback and returning back into the non-Go thread.
1945 // It puts the current m back onto the extra list.
1947 // The main expense here is the call to signalstack to release the
1948 // m's signal stack, and then the call to needm on the next callback
1949 // from this thread. It is tempting to try to save the m for next time,
1950 // which would eliminate both these costs, but there might not be
1951 // a next time: the current thread (which Go does not control) might exit.
1952 // If we saved the m for that thread, there would be an m leak each time
1953 // such a thread exited. Instead, we acquire and release an m on each
1954 // call. These should typically not be scheduling operations, just a few
1955 // atomics, so the cost should be small.
1957 // TODO(rsc): An alternative would be to allocate a dummy pthread per-thread
1958 // variable using pthread_key_create. Unlike the pthread keys we already use
1959 // on OS X, this dummy key would never be read by Go code. It would exist
1960 // only so that we could register at thread-exit-time destructor.
1961 // That destructor would put the m back onto the extra list.
1962 // This is purely a performance optimization. The current version,
1963 // in which dropm happens on each cgo call, is still correct too.
1964 // We may have to keep the current version on systems with cgo
1965 // but without pthreads, like Windows.
1967 // Clear m and g, and return m to the extra list.
1968 // After the call to setg we can only call nosplit functions
1969 // with no pointer manipulation.
1972 // Return mp.curg to dead state.
1973 casgstatus(mp.curg, _Gsyscall, _Gdead)
1974 mp.curg.preemptStop = false
1977 // Block signals before unminit.
1978 // Unminit unregisters the signal handling stack (but needs g on some systems).
1979 // Setg(nil) clears g, which is the signal handler's cue not to run Go handlers.
1980 // It's important not to try to handle a signal between those two steps.
1981 sigmask := mp.sigmask
1985 mnext := lockextra(true)
1987 mp.schedlink.set(mnext)
1991 // Commit the release of mp.
1994 msigrestore(sigmask)
1997 // A helper function for EnsureDropM.
1998 func getm() uintptr {
1999 return uintptr(unsafe.Pointer(getg().m))
2002 var extram atomic.Uintptr
2003 var extraMCount uint32 // Protected by lockextra
2004 var extraMWaiters atomic.Uint32
2006 // lockextra locks the extra list and returns the list head.
2007 // The caller must unlock the list by storing a new list head
2008 // to extram. If nilokay is true, then lockextra will
2009 // return a nil list head if that's what it finds. If nilokay is false,
2010 // lockextra will keep waiting until the list head is no longer nil.
2013 func lockextra(nilokay bool) *m {
2018 old := extram.Load()
2023 if old == 0 && !nilokay {
2025 // Add 1 to the number of threads
2026 // waiting for an M.
2027 // This is cleared by newextram.
2028 extraMWaiters.Add(1)
2034 if extram.CompareAndSwap(old, locked) {
2035 return (*m)(unsafe.Pointer(old))
2043 func unlockextra(mp *m) {
2044 extram.Store(uintptr(unsafe.Pointer(mp)))
2048 // allocmLock is locked for read when creating new Ms in allocm and their
2049 // addition to allm. Thus acquiring this lock for write blocks the
2050 // creation of new Ms.
2053 // execLock serializes exec and clone to avoid bugs or unspecified
2054 // behaviour around exec'ing while creating/destroying threads. See
2059 // newmHandoff contains a list of m structures that need new OS threads.
2060 // This is used by newm in situations where newm itself can't safely
2061 // start an OS thread.
2062 var newmHandoff struct {
2065 // newm points to a list of M structures that need new OS
2066 // threads. The list is linked through m.schedlink.
2069 // waiting indicates that wake needs to be notified when an m
2070 // is put on the list.
2074 // haveTemplateThread indicates that the templateThread has
2075 // been started. This is not protected by lock. Use cas to set
2077 haveTemplateThread uint32
2080 // Create a new m. It will start off with a call to fn, or else the scheduler.
2081 // fn needs to be static and not a heap allocated closure.
2082 // May run with m.p==nil, so write barriers are not allowed.
2084 // id is optional pre-allocated m ID. Omit by passing -1.
2086 //go:nowritebarrierrec
2087 func newm(fn func(), pp *p, id int64) {
2088 // allocm adds a new M to allm, but they do not start until created by
2089 // the OS in newm1 or the template thread.
2091 // doAllThreadsSyscall requires that every M in allm will eventually
2092 // start and be signal-able, even with a STW.
2094 // Disable preemption here until we start the thread to ensure that
2095 // newm is not preempted between allocm and starting the new thread,
2096 // ensuring that anything added to allm is guaranteed to eventually
2100 mp := allocm(pp, fn, id)
2102 mp.sigmask = initSigmask
2103 if gp := getg(); gp != nil && gp.m != nil && (gp.m.lockedExt != 0 || gp.m.incgo) && GOOS != "plan9" {
2104 // We're on a locked M or a thread that may have been
2105 // started by C. The kernel state of this thread may
2106 // be strange (the user may have locked it for that
2107 // purpose). We don't want to clone that into another
2108 // thread. Instead, ask a known-good thread to create
2109 // the thread for us.
2111 // This is disabled on Plan 9. See golang.org/issue/22227.
2113 // TODO: This may be unnecessary on Windows, which
2114 // doesn't model thread creation off fork.
2115 lock(&newmHandoff.lock)
2116 if newmHandoff.haveTemplateThread == 0 {
2117 throw("on a locked thread with no template thread")
2119 mp.schedlink = newmHandoff.newm
2120 newmHandoff.newm.set(mp)
2121 if newmHandoff.waiting {
2122 newmHandoff.waiting = false
2123 notewakeup(&newmHandoff.wake)
2125 unlock(&newmHandoff.lock)
2126 // The M has not started yet, but the template thread does not
2127 // participate in STW, so it will always process queued Ms and
2128 // it is safe to releasem.
2138 var ts cgothreadstart
2139 if _cgo_thread_start == nil {
2140 throw("_cgo_thread_start missing")
2143 ts.tls = (*uint64)(unsafe.Pointer(&mp.tls[0]))
2144 ts.fn = unsafe.Pointer(abi.FuncPCABI0(mstart))
2146 msanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2149 asanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2151 execLock.rlock() // Prevent process clone.
2152 asmcgocall(_cgo_thread_start, unsafe.Pointer(&ts))
2156 execLock.rlock() // Prevent process clone.
2161 // startTemplateThread starts the template thread if it is not already
2164 // The calling thread must itself be in a known-good state.
2165 func startTemplateThread() {
2166 if GOARCH == "wasm" { // no threads on wasm yet
2170 // Disable preemption to guarantee that the template thread will be
2171 // created before a park once haveTemplateThread is set.
2173 if !atomic.Cas(&newmHandoff.haveTemplateThread, 0, 1) {
2177 newm(templateThread, nil, -1)
2181 // templateThread is a thread in a known-good state that exists solely
2182 // to start new threads in known-good states when the calling thread
2183 // may not be in a good state.
2185 // Many programs never need this, so templateThread is started lazily
2186 // when we first enter a state that might lead to running on a thread
2187 // in an unknown state.
2189 // templateThread runs on an M without a P, so it must not have write
2192 //go:nowritebarrierrec
2193 func templateThread() {
2200 lock(&newmHandoff.lock)
2201 for newmHandoff.newm != 0 {
2202 newm := newmHandoff.newm.ptr()
2203 newmHandoff.newm = 0
2204 unlock(&newmHandoff.lock)
2206 next := newm.schedlink.ptr()
2211 lock(&newmHandoff.lock)
2213 newmHandoff.waiting = true
2214 noteclear(&newmHandoff.wake)
2215 unlock(&newmHandoff.lock)
2216 notesleep(&newmHandoff.wake)
2220 // Stops execution of the current m until new work is available.
2221 // Returns with acquired P.
2225 if gp.m.locks != 0 {
2226 throw("stopm holding locks")
2229 throw("stopm holding p")
2232 throw("stopm spinning")
2239 acquirep(gp.m.nextp.ptr())
2244 // startm's caller incremented nmspinning. Set the new M's spinning.
2245 getg().m.spinning = true
2248 // Schedules some M to run the p (creates an M if necessary).
2249 // If p==nil, tries to get an idle P, if no idle P's does nothing.
2250 // May run with m.p==nil, so write barriers are not allowed.
2251 // If spinning is set, the caller has incremented nmspinning and must provide a
2252 // P. startm will set m.spinning in the newly started M.
2254 // Callers passing a non-nil P must call from a non-preemptible context. See
2255 // comment on acquirem below.
2257 // Must not have write barriers because this may be called without a P.
2259 //go:nowritebarrierrec
2260 func startm(pp *p, spinning bool) {
2261 // Disable preemption.
2263 // Every owned P must have an owner that will eventually stop it in the
2264 // event of a GC stop request. startm takes transient ownership of a P
2265 // (either from argument or pidleget below) and transfers ownership to
2266 // a started M, which will be responsible for performing the stop.
2268 // Preemption must be disabled during this transient ownership,
2269 // otherwise the P this is running on may enter GC stop while still
2270 // holding the transient P, leaving that P in limbo and deadlocking the
2273 // Callers passing a non-nil P must already be in non-preemptible
2274 // context, otherwise such preemption could occur on function entry to
2275 // startm. Callers passing a nil P may be preemptible, so we must
2276 // disable preemption before acquiring a P from pidleget below.
2281 // TODO(prattmic): All remaining calls to this function
2282 // with _p_ == nil could be cleaned up to find a P
2283 // before calling startm.
2284 throw("startm: P required for spinning=true")
2295 // No M is available, we must drop sched.lock and call newm.
2296 // However, we already own a P to assign to the M.
2298 // Once sched.lock is released, another G (e.g., in a syscall),
2299 // could find no idle P while checkdead finds a runnable G but
2300 // no running M's because this new M hasn't started yet, thus
2301 // throwing in an apparent deadlock.
2303 // Avoid this situation by pre-allocating the ID for the new M,
2304 // thus marking it as 'running' before we drop sched.lock. This
2305 // new M will eventually run the scheduler to execute any
2312 // The caller incremented nmspinning, so set m.spinning in the new M.
2316 // Ownership transfer of pp committed by start in newm.
2317 // Preemption is now safe.
2323 throw("startm: m is spinning")
2326 throw("startm: m has p")
2328 if spinning && !runqempty(pp) {
2329 throw("startm: p has runnable gs")
2331 // The caller incremented nmspinning, so set m.spinning in the new M.
2332 nmp.spinning = spinning
2334 notewakeup(&nmp.park)
2335 // Ownership transfer of pp committed by wakeup. Preemption is now
2340 // Hands off P from syscall or locked M.
2341 // Always runs without a P, so write barriers are not allowed.
2343 //go:nowritebarrierrec
2344 func handoffp(pp *p) {
2345 // handoffp must start an M in any situation where
2346 // findrunnable would return a G to run on pp.
2348 // if it has local work, start it straight away
2349 if !runqempty(pp) || sched.runqsize != 0 {
2353 // if there's trace work to do, start it straight away
2354 if (trace.enabled || trace.shutdown) && traceReaderAvailable() != nil {
2358 // if it has GC work, start it straight away
2359 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) {
2363 // no local work, check that there are no spinning/idle M's,
2364 // otherwise our help is not required
2365 if sched.nmspinning.Load()+sched.npidle.Load() == 0 && sched.nmspinning.CompareAndSwap(0, 1) { // TODO: fast atomic
2366 sched.needspinning.Store(0)
2371 if sched.gcwaiting.Load() {
2372 pp.status = _Pgcstop
2374 if sched.stopwait == 0 {
2375 notewakeup(&sched.stopnote)
2380 if pp.runSafePointFn != 0 && atomic.Cas(&pp.runSafePointFn, 1, 0) {
2381 sched.safePointFn(pp)
2382 sched.safePointWait--
2383 if sched.safePointWait == 0 {
2384 notewakeup(&sched.safePointNote)
2387 if sched.runqsize != 0 {
2392 // If this is the last running P and nobody is polling network,
2393 // need to wakeup another M to poll network.
2394 if sched.npidle.Load() == gomaxprocs-1 && sched.lastpoll.Load() != 0 {
2400 // The scheduler lock cannot be held when calling wakeNetPoller below
2401 // because wakeNetPoller may call wakep which may call startm.
2402 when := nobarrierWakeTime(pp)
2411 // Tries to add one more P to execute G's.
2412 // Called when a G is made runnable (newproc, ready).
2413 // Must be called with a P.
2415 // Be conservative about spinning threads, only start one if none exist
2417 if sched.nmspinning.Load() != 0 || !sched.nmspinning.CompareAndSwap(0, 1) {
2421 // Disable preemption until ownership of pp transfers to the next M in
2422 // startm. Otherwise preemption here would leave pp stuck waiting to
2425 // See preemption comment on acquirem in startm for more details.
2430 pp, _ = pidlegetSpinning(0)
2432 if sched.nmspinning.Add(-1) < 0 {
2433 throw("wakep: negative nmspinning")
2439 // Since we always have a P, the race in the "No M is available"
2440 // comment in startm doesn't apply during the small window between the
2441 // unlock here and lock in startm. A checkdead in between will always
2442 // see at least one running M (ours).
2450 // Stops execution of the current m that is locked to a g until the g is runnable again.
2451 // Returns with acquired P.
2452 func stoplockedm() {
2455 if gp.m.lockedg == 0 || gp.m.lockedg.ptr().lockedm.ptr() != gp.m {
2456 throw("stoplockedm: inconsistent locking")
2459 // Schedule another M to run this p.
2464 // Wait until another thread schedules lockedg again.
2466 status := readgstatus(gp.m.lockedg.ptr())
2467 if status&^_Gscan != _Grunnable {
2468 print("runtime:stoplockedm: lockedg (atomicstatus=", status, ") is not Grunnable or Gscanrunnable\n")
2469 dumpgstatus(gp.m.lockedg.ptr())
2470 throw("stoplockedm: not runnable")
2472 acquirep(gp.m.nextp.ptr())
2476 // Schedules the locked m to run the locked gp.
2477 // May run during STW, so write barriers are not allowed.
2479 //go:nowritebarrierrec
2480 func startlockedm(gp *g) {
2481 mp := gp.lockedm.ptr()
2483 throw("startlockedm: locked to me")
2486 throw("startlockedm: m has p")
2488 // directly handoff current P to the locked m
2492 notewakeup(&mp.park)
2496 // Stops the current m for stopTheWorld.
2497 // Returns when the world is restarted.
2501 if !sched.gcwaiting.Load() {
2502 throw("gcstopm: not waiting for gc")
2505 gp.m.spinning = false
2506 // OK to just drop nmspinning here,
2507 // startTheWorld will unpark threads as necessary.
2508 if sched.nmspinning.Add(-1) < 0 {
2509 throw("gcstopm: negative nmspinning")
2514 pp.status = _Pgcstop
2516 if sched.stopwait == 0 {
2517 notewakeup(&sched.stopnote)
2523 // Schedules gp to run on the current M.
2524 // If inheritTime is true, gp inherits the remaining time in the
2525 // current time slice. Otherwise, it starts a new time slice.
2528 // Write barriers are allowed because this is called immediately after
2529 // acquiring a P in several places.
2531 //go:yeswritebarrierrec
2532 func execute(gp *g, inheritTime bool) {
2535 if goroutineProfile.active {
2536 // Make sure that gp has had its stack written out to the goroutine
2537 // profile, exactly as it was when the goroutine profiler first stopped
2539 tryRecordGoroutineProfile(gp, osyield)
2542 // Assign gp.m before entering _Grunning so running Gs have an
2546 casgstatus(gp, _Grunnable, _Grunning)
2549 gp.stackguard0 = gp.stack.lo + _StackGuard
2551 mp.p.ptr().schedtick++
2554 // Check whether the profiler needs to be turned on or off.
2555 hz := sched.profilehz
2556 if mp.profilehz != hz {
2557 setThreadCPUProfiler(hz)
2561 // GoSysExit has to happen when we have a P, but before GoStart.
2562 // So we emit it here.
2563 if gp.syscallsp != 0 && gp.sysblocktraced {
2564 traceGoSysExit(gp.sysexitticks)
2572 // Finds a runnable goroutine to execute.
2573 // Tries to steal from other P's, get g from local or global queue, poll network.
2574 // tryWakeP indicates that the returned goroutine is not normal (GC worker, trace
2575 // reader) so the caller should try to wake a P.
2576 func findRunnable() (gp *g, inheritTime, tryWakeP bool) {
2579 // The conditions here and in handoffp must agree: if
2580 // findrunnable would return a G to run, handoffp must start
2585 if sched.gcwaiting.Load() {
2589 if pp.runSafePointFn != 0 {
2593 // now and pollUntil are saved for work stealing later,
2594 // which may steal timers. It's important that between now
2595 // and then, nothing blocks, so these numbers remain mostly
2597 now, pollUntil, _ := checkTimers(pp, 0)
2599 // Try to schedule the trace reader.
2600 if trace.enabled || trace.shutdown {
2603 casgstatus(gp, _Gwaiting, _Grunnable)
2604 traceGoUnpark(gp, 0)
2605 return gp, false, true
2609 // Try to schedule a GC worker.
2610 if gcBlackenEnabled != 0 {
2611 gp, tnow := gcController.findRunnableGCWorker(pp, now)
2613 return gp, false, true
2618 // Check the global runnable queue once in a while to ensure fairness.
2619 // Otherwise two goroutines can completely occupy the local runqueue
2620 // by constantly respawning each other.
2621 if pp.schedtick%61 == 0 && sched.runqsize > 0 {
2623 gp := globrunqget(pp, 1)
2626 return gp, false, false
2630 // Wake up the finalizer G.
2631 if fingwait && fingwake {
2632 if gp := wakefing(); gp != nil {
2636 if *cgo_yield != nil {
2637 asmcgocall(*cgo_yield, nil)
2641 if gp, inheritTime := runqget(pp); gp != nil {
2642 return gp, inheritTime, false
2646 if sched.runqsize != 0 {
2648 gp := globrunqget(pp, 0)
2651 return gp, false, false
2656 // This netpoll is only an optimization before we resort to stealing.
2657 // We can safely skip it if there are no waiters or a thread is blocked
2658 // in netpoll already. If there is any kind of logical race with that
2659 // blocked thread (e.g. it has already returned from netpoll, but does
2660 // not set lastpoll yet), this thread will do blocking netpoll below
2662 if netpollinited() && netpollWaiters.Load() > 0 && sched.lastpoll.Load() != 0 {
2663 if list := netpoll(0); !list.empty() { // non-blocking
2666 casgstatus(gp, _Gwaiting, _Grunnable)
2668 traceGoUnpark(gp, 0)
2670 return gp, false, false
2674 // Spinning Ms: steal work from other Ps.
2676 // Limit the number of spinning Ms to half the number of busy Ps.
2677 // This is necessary to prevent excessive CPU consumption when
2678 // GOMAXPROCS>>1 but the program parallelism is low.
2679 if mp.spinning || 2*sched.nmspinning.Load() < gomaxprocs-sched.npidle.Load() {
2684 gp, inheritTime, tnow, w, newWork := stealWork(now)
2686 // Successfully stole.
2687 return gp, inheritTime, false
2690 // There may be new timer or GC work; restart to
2696 if w != 0 && (pollUntil == 0 || w < pollUntil) {
2697 // Earlier timer to wait for.
2702 // We have nothing to do.
2704 // If we're in the GC mark phase, can safely scan and blacken objects,
2705 // and have work to do, run idle-time marking rather than give up the P.
2706 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) && gcController.addIdleMarkWorker() {
2707 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
2709 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
2711 casgstatus(gp, _Gwaiting, _Grunnable)
2713 traceGoUnpark(gp, 0)
2715 return gp, false, false
2717 gcController.removeIdleMarkWorker()
2721 // If a callback returned and no other goroutine is awake,
2722 // then wake event handler goroutine which pauses execution
2723 // until a callback was triggered.
2724 gp, otherReady := beforeIdle(now, pollUntil)
2726 casgstatus(gp, _Gwaiting, _Grunnable)
2728 traceGoUnpark(gp, 0)
2730 return gp, false, false
2736 // Before we drop our P, make a snapshot of the allp slice,
2737 // which can change underfoot once we no longer block
2738 // safe-points. We don't need to snapshot the contents because
2739 // everything up to cap(allp) is immutable.
2740 allpSnapshot := allp
2741 // Also snapshot masks. Value changes are OK, but we can't allow
2742 // len to change out from under us.
2743 idlepMaskSnapshot := idlepMask
2744 timerpMaskSnapshot := timerpMask
2746 // return P and block
2748 if sched.gcwaiting.Load() || pp.runSafePointFn != 0 {
2752 if sched.runqsize != 0 {
2753 gp := globrunqget(pp, 0)
2755 return gp, false, false
2757 if !mp.spinning && sched.needspinning.Load() == 1 {
2758 // See "Delicate dance" comment below.
2763 if releasep() != pp {
2764 throw("findrunnable: wrong p")
2766 now = pidleput(pp, now)
2769 // Delicate dance: thread transitions from spinning to non-spinning
2770 // state, potentially concurrently with submission of new work. We must
2771 // drop nmspinning first and then check all sources again (with
2772 // #StoreLoad memory barrier in between). If we do it the other way
2773 // around, another thread can submit work after we've checked all
2774 // sources but before we drop nmspinning; as a result nobody will
2775 // unpark a thread to run the work.
2777 // This applies to the following sources of work:
2779 // * Goroutines added to a per-P run queue.
2780 // * New/modified-earlier timers on a per-P timer heap.
2781 // * Idle-priority GC work (barring golang.org/issue/19112).
2783 // If we discover new work below, we need to restore m.spinning as a
2784 // signal for resetspinning to unpark a new worker thread (because
2785 // there can be more than one starving goroutine).
2787 // However, if after discovering new work we also observe no idle Ps
2788 // (either here or in resetspinning), we have a problem. We may be
2789 // racing with a non-spinning M in the block above, having found no
2790 // work and preparing to release its P and park. Allowing that P to go
2791 // idle will result in loss of work conservation (idle P while there is
2792 // runnable work). This could result in complete deadlock in the
2793 // unlikely event that we discover new work (from netpoll) right as we
2794 // are racing with _all_ other Ps going idle.
2796 // We use sched.needspinning to synchronize with non-spinning Ms going
2797 // idle. If needspinning is set when they are about to drop their P,
2798 // they abort the drop and instead become a new spinning M on our
2799 // behalf. If we are not racing and the system is truly fully loaded
2800 // then no spinning threads are required, and the next thread to
2801 // naturally become spinning will clear the flag.
2803 // Also see "Worker thread parking/unparking" comment at the top of the
2805 wasSpinning := mp.spinning
2808 if sched.nmspinning.Add(-1) < 0 {
2809 throw("findrunnable: negative nmspinning")
2812 // Note the for correctness, only the last M transitioning from
2813 // spinning to non-spinning must perform these rechecks to
2814 // ensure no missed work. However, the runtime has some cases
2815 // of transient increments of nmspinning that are decremented
2816 // without going through this path, so we must be conservative
2817 // and perform the check on all spinning Ms.
2819 // See https://go.dev/issue/43997.
2821 // Check all runqueues once again.
2822 pp := checkRunqsNoP(allpSnapshot, idlepMaskSnapshot)
2829 // Check for idle-priority GC work again.
2830 pp, gp := checkIdleGCNoP()
2835 // Run the idle worker.
2836 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
2837 casgstatus(gp, _Gwaiting, _Grunnable)
2839 traceGoUnpark(gp, 0)
2841 return gp, false, false
2844 // Finally, check for timer creation or expiry concurrently with
2845 // transitioning from spinning to non-spinning.
2847 // Note that we cannot use checkTimers here because it calls
2848 // adjusttimers which may need to allocate memory, and that isn't
2849 // allowed when we don't have an active P.
2850 pollUntil = checkTimersNoP(allpSnapshot, timerpMaskSnapshot, pollUntil)
2853 // Poll network until next timer.
2854 if netpollinited() && (netpollWaiters.Load() > 0 || pollUntil != 0) && sched.lastpoll.Swap(0) != 0 {
2855 sched.pollUntil.Store(pollUntil)
2857 throw("findrunnable: netpoll with p")
2860 throw("findrunnable: netpoll with spinning")
2866 delay = pollUntil - now
2872 // When using fake time, just poll.
2875 list := netpoll(delay) // block until new work is available
2876 sched.pollUntil.Store(0)
2877 sched.lastpoll.Store(now)
2878 if faketime != 0 && list.empty() {
2879 // Using fake time and nothing is ready; stop M.
2880 // When all M's stop, checkdead will call timejump.
2885 pp, _ := pidleget(now)
2894 casgstatus(gp, _Gwaiting, _Grunnable)
2896 traceGoUnpark(gp, 0)
2898 return gp, false, false
2905 } else if pollUntil != 0 && netpollinited() {
2906 pollerPollUntil := sched.pollUntil.Load()
2907 if pollerPollUntil == 0 || pollerPollUntil > pollUntil {
2915 // pollWork reports whether there is non-background work this P could
2916 // be doing. This is a fairly lightweight check to be used for
2917 // background work loops, like idle GC. It checks a subset of the
2918 // conditions checked by the actual scheduler.
2919 func pollWork() bool {
2920 if sched.runqsize != 0 {
2923 p := getg().m.p.ptr()
2927 if netpollinited() && netpollWaiters.Load() > 0 && sched.lastpoll.Load() != 0 {
2928 if list := netpoll(0); !list.empty() {
2936 // stealWork attempts to steal a runnable goroutine or timer from any P.
2938 // If newWork is true, new work may have been readied.
2940 // If now is not 0 it is the current time. stealWork returns the passed time or
2941 // the current time if now was passed as 0.
2942 func stealWork(now int64) (gp *g, inheritTime bool, rnow, pollUntil int64, newWork bool) {
2943 pp := getg().m.p.ptr()
2947 const stealTries = 4
2948 for i := 0; i < stealTries; i++ {
2949 stealTimersOrRunNextG := i == stealTries-1
2951 for enum := stealOrder.start(fastrand()); !enum.done(); enum.next() {
2952 if sched.gcwaiting.Load() {
2953 // GC work may be available.
2954 return nil, false, now, pollUntil, true
2956 p2 := allp[enum.position()]
2961 // Steal timers from p2. This call to checkTimers is the only place
2962 // where we might hold a lock on a different P's timers. We do this
2963 // once on the last pass before checking runnext because stealing
2964 // from the other P's runnext should be the last resort, so if there
2965 // are timers to steal do that first.
2967 // We only check timers on one of the stealing iterations because
2968 // the time stored in now doesn't change in this loop and checking
2969 // the timers for each P more than once with the same value of now
2970 // is probably a waste of time.
2972 // timerpMask tells us whether the P may have timers at all. If it
2973 // can't, no need to check at all.
2974 if stealTimersOrRunNextG && timerpMask.read(enum.position()) {
2975 tnow, w, ran := checkTimers(p2, now)
2977 if w != 0 && (pollUntil == 0 || w < pollUntil) {
2981 // Running the timers may have
2982 // made an arbitrary number of G's
2983 // ready and added them to this P's
2984 // local run queue. That invalidates
2985 // the assumption of runqsteal
2986 // that it always has room to add
2987 // stolen G's. So check now if there
2988 // is a local G to run.
2989 if gp, inheritTime := runqget(pp); gp != nil {
2990 return gp, inheritTime, now, pollUntil, ranTimer
2996 // Don't bother to attempt to steal if p2 is idle.
2997 if !idlepMask.read(enum.position()) {
2998 if gp := runqsteal(pp, p2, stealTimersOrRunNextG); gp != nil {
2999 return gp, false, now, pollUntil, ranTimer
3005 // No goroutines found to steal. Regardless, running a timer may have
3006 // made some goroutine ready that we missed. Indicate the next timer to
3008 return nil, false, now, pollUntil, ranTimer
3011 // Check all Ps for a runnable G to steal.
3013 // On entry we have no P. If a G is available to steal and a P is available,
3014 // the P is returned which the caller should acquire and attempt to steal the
3016 func checkRunqsNoP(allpSnapshot []*p, idlepMaskSnapshot pMask) *p {
3017 for id, p2 := range allpSnapshot {
3018 if !idlepMaskSnapshot.read(uint32(id)) && !runqempty(p2) {
3020 pp, _ := pidlegetSpinning(0)
3022 // Can't get a P, don't bother checking remaining Ps.
3031 // No work available.
3035 // Check all Ps for a timer expiring sooner than pollUntil.
3037 // Returns updated pollUntil value.
3038 func checkTimersNoP(allpSnapshot []*p, timerpMaskSnapshot pMask, pollUntil int64) int64 {
3039 for id, p2 := range allpSnapshot {
3040 if timerpMaskSnapshot.read(uint32(id)) {
3041 w := nobarrierWakeTime(p2)
3042 if w != 0 && (pollUntil == 0 || w < pollUntil) {
3051 // Check for idle-priority GC, without a P on entry.
3053 // If some GC work, a P, and a worker G are all available, the P and G will be
3054 // returned. The returned P has not been wired yet.
3055 func checkIdleGCNoP() (*p, *g) {
3056 // N.B. Since we have no P, gcBlackenEnabled may change at any time; we
3057 // must check again after acquiring a P. As an optimization, we also check
3058 // if an idle mark worker is needed at all. This is OK here, because if we
3059 // observe that one isn't needed, at least one is currently running. Even if
3060 // it stops running, its own journey into the scheduler should schedule it
3061 // again, if need be (at which point, this check will pass, if relevant).
3062 if atomic.Load(&gcBlackenEnabled) == 0 || !gcController.needIdleMarkWorker() {
3065 if !gcMarkWorkAvailable(nil) {
3069 // Work is available; we can start an idle GC worker only if there is
3070 // an available P and available worker G.
3072 // We can attempt to acquire these in either order, though both have
3073 // synchronization concerns (see below). Workers are almost always
3074 // available (see comment in findRunnableGCWorker for the one case
3075 // there may be none). Since we're slightly less likely to find a P,
3076 // check for that first.
3078 // Synchronization: note that we must hold sched.lock until we are
3079 // committed to keeping it. Otherwise we cannot put the unnecessary P
3080 // back in sched.pidle without performing the full set of idle
3081 // transition checks.
3083 // If we were to check gcBgMarkWorkerPool first, we must somehow handle
3084 // the assumption in gcControllerState.findRunnableGCWorker that an
3085 // empty gcBgMarkWorkerPool is only possible if gcMarkDone is running.
3087 pp, now := pidlegetSpinning(0)
3093 // Now that we own a P, gcBlackenEnabled can't change (as it requires STW).
3094 if gcBlackenEnabled == 0 || !gcController.addIdleMarkWorker() {
3100 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
3104 gcController.removeIdleMarkWorker()
3110 return pp, node.gp.ptr()
3113 // wakeNetPoller wakes up the thread sleeping in the network poller if it isn't
3114 // going to wake up before the when argument; or it wakes an idle P to service
3115 // timers and the network poller if there isn't one already.
3116 func wakeNetPoller(when int64) {
3117 if sched.lastpoll.Load() == 0 {
3118 // In findrunnable we ensure that when polling the pollUntil
3119 // field is either zero or the time to which the current
3120 // poll is expected to run. This can have a spurious wakeup
3121 // but should never miss a wakeup.
3122 pollerPollUntil := sched.pollUntil.Load()
3123 if pollerPollUntil == 0 || pollerPollUntil > when {
3127 // There are no threads in the network poller, try to get
3128 // one there so it can handle new timers.
3129 if GOOS != "plan9" { // Temporary workaround - see issue #42303.
3135 func resetspinning() {
3138 throw("resetspinning: not a spinning m")
3140 gp.m.spinning = false
3141 nmspinning := sched.nmspinning.Add(-1)
3143 throw("findrunnable: negative nmspinning")
3145 // M wakeup policy is deliberately somewhat conservative, so check if we
3146 // need to wakeup another P here. See "Worker thread parking/unparking"
3147 // comment at the top of the file for details.
3151 // injectglist adds each runnable G on the list to some run queue,
3152 // and clears glist. If there is no current P, they are added to the
3153 // global queue, and up to npidle M's are started to run them.
3154 // Otherwise, for each idle P, this adds a G to the global queue
3155 // and starts an M. Any remaining G's are added to the current P's
3157 // This may temporarily acquire sched.lock.
3158 // Can run concurrently with GC.
3159 func injectglist(glist *gList) {
3164 for gp := glist.head.ptr(); gp != nil; gp = gp.schedlink.ptr() {
3165 traceGoUnpark(gp, 0)
3169 // Mark all the goroutines as runnable before we put them
3170 // on the run queues.
3171 head := glist.head.ptr()
3174 for gp := head; gp != nil; gp = gp.schedlink.ptr() {
3177 casgstatus(gp, _Gwaiting, _Grunnable)
3180 // Turn the gList into a gQueue.
3186 startIdle := func(n int) {
3187 for i := 0; i < n; i++ {
3188 mp := acquirem() // See comment in startm.
3191 pp, _ := pidlegetSpinning(0)
3204 pp := getg().m.p.ptr()
3207 globrunqputbatch(&q, int32(qsize))
3213 npidle := int(sched.npidle.Load())
3216 for n = 0; n < npidle && !q.empty(); n++ {
3222 globrunqputbatch(&globq, int32(n))
3229 runqputbatch(pp, &q, qsize)
3233 // One round of scheduler: find a runnable goroutine and execute it.
3239 throw("schedule: holding locks")
3242 if mp.lockedg != 0 {
3244 execute(mp.lockedg.ptr(), false) // Never returns.
3247 // We should not schedule away from a g that is executing a cgo call,
3248 // since the cgo call is using the m's g0 stack.
3250 throw("schedule: in cgo")
3257 // Safety check: if we are spinning, the run queue should be empty.
3258 // Check this before calling checkTimers, as that might call
3259 // goready to put a ready goroutine on the local run queue.
3260 if mp.spinning && (pp.runnext != 0 || pp.runqhead != pp.runqtail) {
3261 throw("schedule: spinning with local work")
3264 gp, inheritTime, tryWakeP := findRunnable() // blocks until work is available
3266 // This thread is going to run a goroutine and is not spinning anymore,
3267 // so if it was marked as spinning we need to reset it now and potentially
3268 // start a new spinning M.
3273 if sched.disable.user && !schedEnabled(gp) {
3274 // Scheduling of this goroutine is disabled. Put it on
3275 // the list of pending runnable goroutines for when we
3276 // re-enable user scheduling and look again.
3278 if schedEnabled(gp) {
3279 // Something re-enabled scheduling while we
3280 // were acquiring the lock.
3283 sched.disable.runnable.pushBack(gp)
3290 // If about to schedule a not-normal goroutine (a GCworker or tracereader),
3291 // wake a P if there is one.
3295 if gp.lockedm != 0 {
3296 // Hands off own p to the locked m,
3297 // then blocks waiting for a new p.
3302 execute(gp, inheritTime)
3305 // dropg removes the association between m and the current goroutine m->curg (gp for short).
3306 // Typically a caller sets gp's status away from Grunning and then
3307 // immediately calls dropg to finish the job. The caller is also responsible
3308 // for arranging that gp will be restarted using ready at an
3309 // appropriate time. After calling dropg and arranging for gp to be
3310 // readied later, the caller can do other work but eventually should
3311 // call schedule to restart the scheduling of goroutines on this m.
3315 setMNoWB(&gp.m.curg.m, nil)
3316 setGNoWB(&gp.m.curg, nil)
3319 // checkTimers runs any timers for the P that are ready.
3320 // If now is not 0 it is the current time.
3321 // It returns the passed time or the current time if now was passed as 0.
3322 // and the time when the next timer should run or 0 if there is no next timer,
3323 // and reports whether it ran any timers.
3324 // If the time when the next timer should run is not 0,
3325 // it is always larger than the returned time.
3326 // We pass now in and out to avoid extra calls of nanotime.
3328 //go:yeswritebarrierrec
3329 func checkTimers(pp *p, now int64) (rnow, pollUntil int64, ran bool) {
3330 // If it's not yet time for the first timer, or the first adjusted
3331 // timer, then there is nothing to do.
3332 next := pp.timer0When.Load()
3333 nextAdj := pp.timerModifiedEarliest.Load()
3334 if next == 0 || (nextAdj != 0 && nextAdj < next) {
3339 // No timers to run or adjust.
3340 return now, 0, false
3347 // Next timer is not ready to run, but keep going
3348 // if we would clear deleted timers.
3349 // This corresponds to the condition below where
3350 // we decide whether to call clearDeletedTimers.
3351 if pp != getg().m.p.ptr() || int(pp.deletedTimers.Load()) <= int(pp.numTimers.Load()/4) {
3352 return now, next, false
3356 lock(&pp.timersLock)
3358 if len(pp.timers) > 0 {
3359 adjusttimers(pp, now)
3360 for len(pp.timers) > 0 {
3361 // Note that runtimer may temporarily unlock
3363 if tw := runtimer(pp, now); tw != 0 {
3373 // If this is the local P, and there are a lot of deleted timers,
3374 // clear them out. We only do this for the local P to reduce
3375 // lock contention on timersLock.
3376 if pp == getg().m.p.ptr() && int(pp.deletedTimers.Load()) > len(pp.timers)/4 {
3377 clearDeletedTimers(pp)
3380 unlock(&pp.timersLock)
3382 return now, pollUntil, ran
3385 func parkunlock_c(gp *g, lock unsafe.Pointer) bool {
3386 unlock((*mutex)(lock))
3390 // park continuation on g0.
3391 func park_m(gp *g) {
3395 traceGoPark(mp.waittraceev, mp.waittraceskip)
3398 casgstatus(gp, _Grunning, _Gwaiting)
3401 if fn := mp.waitunlockf; fn != nil {
3402 ok := fn(gp, mp.waitlock)
3403 mp.waitunlockf = nil
3407 traceGoUnpark(gp, 2)
3409 casgstatus(gp, _Gwaiting, _Grunnable)
3410 execute(gp, true) // Schedule it back, never returns.
3416 func goschedImpl(gp *g) {
3417 status := readgstatus(gp)
3418 if status&^_Gscan != _Grunning {
3420 throw("bad g status")
3422 casgstatus(gp, _Grunning, _Grunnable)
3431 // Gosched continuation on g0.
3432 func gosched_m(gp *g) {
3439 // goschedguarded is a forbidden-states-avoided version of gosched_m
3440 func goschedguarded_m(gp *g) {
3442 if !canPreemptM(gp.m) {
3443 gogo(&gp.sched) // never return
3452 func gopreempt_m(gp *g) {
3459 // preemptPark parks gp and puts it in _Gpreempted.
3462 func preemptPark(gp *g) {
3464 traceGoPark(traceEvGoBlock, 0)
3466 status := readgstatus(gp)
3467 if status&^_Gscan != _Grunning {
3469 throw("bad g status")
3471 gp.waitreason = waitReasonPreempted
3473 if gp.asyncSafePoint {
3474 // Double-check that async preemption does not
3475 // happen in SPWRITE assembly functions.
3476 // isAsyncSafePoint must exclude this case.
3477 f := findfunc(gp.sched.pc)
3479 throw("preempt at unknown pc")
3481 if f.flag&funcFlag_SPWRITE != 0 {
3482 println("runtime: unexpected SPWRITE function", funcname(f), "in async preempt")
3483 throw("preempt SPWRITE")
3487 // Transition from _Grunning to _Gscan|_Gpreempted. We can't
3488 // be in _Grunning when we dropg because then we'd be running
3489 // without an M, but the moment we're in _Gpreempted,
3490 // something could claim this G before we've fully cleaned it
3491 // up. Hence, we set the scan bit to lock down further
3492 // transitions until we can dropg.
3493 casGToPreemptScan(gp, _Grunning, _Gscan|_Gpreempted)
3495 casfrom_Gscanstatus(gp, _Gscan|_Gpreempted, _Gpreempted)
3499 // goyield is like Gosched, but it:
3500 // - emits a GoPreempt trace event instead of a GoSched trace event
3501 // - puts the current G on the runq of the current P instead of the globrunq
3507 func goyield_m(gp *g) {
3512 casgstatus(gp, _Grunning, _Grunnable)
3514 runqput(pp, gp, false)
3518 // Finishes execution of the current goroutine.
3529 // goexit continuation on g0.
3530 func goexit0(gp *g) {
3534 casgstatus(gp, _Grunning, _Gdead)
3535 gcController.addScannableStack(pp, -int64(gp.stack.hi-gp.stack.lo))
3536 if isSystemGoroutine(gp, false) {
3540 locked := gp.lockedm != 0
3543 gp.preemptStop = false
3544 gp.paniconfault = false
3545 gp._defer = nil // should be true already but just in case.
3546 gp._panic = nil // non-nil for Goexit during panic. points at stack-allocated data.
3553 if gcBlackenEnabled != 0 && gp.gcAssistBytes > 0 {
3554 // Flush assist credit to the global pool. This gives
3555 // better information to pacing if the application is
3556 // rapidly creating an exiting goroutines.
3557 assistWorkPerByte := gcController.assistWorkPerByte.Load()
3558 scanCredit := int64(assistWorkPerByte * float64(gp.gcAssistBytes))
3559 gcController.bgScanCredit.Add(scanCredit)
3560 gp.gcAssistBytes = 0
3565 if GOARCH == "wasm" { // no threads yet on wasm
3567 schedule() // never returns
3570 if mp.lockedInt != 0 {
3571 print("invalid m->lockedInt = ", mp.lockedInt, "\n")
3572 throw("internal lockOSThread error")
3576 // The goroutine may have locked this thread because
3577 // it put it in an unusual kernel state. Kill it
3578 // rather than returning it to the thread pool.
3580 // Return to mstart, which will release the P and exit
3582 if GOOS != "plan9" { // See golang.org/issue/22227.
3585 // Clear lockedExt on plan9 since we may end up re-using
3593 // save updates getg().sched to refer to pc and sp so that a following
3594 // gogo will restore pc and sp.
3596 // save must not have write barriers because invoking a write barrier
3597 // can clobber getg().sched.
3600 //go:nowritebarrierrec
3601 func save(pc, sp uintptr) {
3604 if gp == gp.m.g0 || gp == gp.m.gsignal {
3605 // m.g0.sched is special and must describe the context
3606 // for exiting the thread. mstart1 writes to it directly.
3607 // m.gsignal.sched should not be used at all.
3608 // This check makes sure save calls do not accidentally
3609 // run in contexts where they'd write to system g's.
3610 throw("save on system g not allowed")
3617 // We need to ensure ctxt is zero, but can't have a write
3618 // barrier here. However, it should always already be zero.
3620 if gp.sched.ctxt != nil {
3625 // The goroutine g is about to enter a system call.
3626 // Record that it's not using the cpu anymore.
3627 // This is called only from the go syscall library and cgocall,
3628 // not from the low-level system calls used by the runtime.
3630 // Entersyscall cannot split the stack: the save must
3631 // make g->sched refer to the caller's stack segment, because
3632 // entersyscall is going to return immediately after.
3634 // Nothing entersyscall calls can split the stack either.
3635 // We cannot safely move the stack during an active call to syscall,
3636 // because we do not know which of the uintptr arguments are
3637 // really pointers (back into the stack).
3638 // In practice, this means that we make the fast path run through
3639 // entersyscall doing no-split things, and the slow path has to use systemstack
3640 // to run bigger things on the system stack.
3642 // reentersyscall is the entry point used by cgo callbacks, where explicitly
3643 // saved SP and PC are restored. This is needed when exitsyscall will be called
3644 // from a function further up in the call stack than the parent, as g->syscallsp
3645 // must always point to a valid stack frame. entersyscall below is the normal
3646 // entry point for syscalls, which obtains the SP and PC from the caller.
3649 // At the start of a syscall we emit traceGoSysCall to capture the stack trace.
3650 // If the syscall does not block, that is it, we do not emit any other events.
3651 // If the syscall blocks (that is, P is retaken), retaker emits traceGoSysBlock;
3652 // when syscall returns we emit traceGoSysExit and when the goroutine starts running
3653 // (potentially instantly, if exitsyscallfast returns true) we emit traceGoStart.
3654 // To ensure that traceGoSysExit is emitted strictly after traceGoSysBlock,
3655 // we remember current value of syscalltick in m (gp.m.syscalltick = gp.m.p.ptr().syscalltick),
3656 // whoever emits traceGoSysBlock increments p.syscalltick afterwards;
3657 // and we wait for the increment before emitting traceGoSysExit.
3658 // Note that the increment is done even if tracing is not enabled,
3659 // because tracing can be enabled in the middle of syscall. We don't want the wait to hang.
3662 func reentersyscall(pc, sp uintptr) {
3665 // Disable preemption because during this function g is in Gsyscall status,
3666 // but can have inconsistent g->sched, do not let GC observe it.
3669 // Entersyscall must not call any function that might split/grow the stack.
3670 // (See details in comment above.)
3671 // Catch calls that might, by replacing the stack guard with something that
3672 // will trip any stack check and leaving a flag to tell newstack to die.
3673 gp.stackguard0 = stackPreempt
3674 gp.throwsplit = true
3676 // Leave SP around for GC and traceback.
3680 casgstatus(gp, _Grunning, _Gsyscall)
3681 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3682 systemstack(func() {
3683 print("entersyscall inconsistent ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3684 throw("entersyscall")
3689 systemstack(traceGoSysCall)
3690 // systemstack itself clobbers g.sched.{pc,sp} and we might
3691 // need them later when the G is genuinely blocked in a
3696 if sched.sysmonwait.Load() {
3697 systemstack(entersyscall_sysmon)
3701 if gp.m.p.ptr().runSafePointFn != 0 {
3702 // runSafePointFn may stack split if run on this stack
3703 systemstack(runSafePointFn)
3707 gp.m.syscalltick = gp.m.p.ptr().syscalltick
3708 gp.sysblocktraced = true
3713 atomic.Store(&pp.status, _Psyscall)
3714 if sched.gcwaiting.Load() {
3715 systemstack(entersyscall_gcwait)
3722 // Standard syscall entry used by the go syscall library and normal cgo calls.
3724 // This is exported via linkname to assembly in the syscall package and x/sys.
3727 //go:linkname entersyscall
3728 func entersyscall() {
3729 reentersyscall(getcallerpc(), getcallersp())
3732 func entersyscall_sysmon() {
3734 if sched.sysmonwait.Load() {
3735 sched.sysmonwait.Store(false)
3736 notewakeup(&sched.sysmonnote)
3741 func entersyscall_gcwait() {
3743 pp := gp.m.oldp.ptr()
3746 if sched.stopwait > 0 && atomic.Cas(&pp.status, _Psyscall, _Pgcstop) {
3752 if sched.stopwait--; sched.stopwait == 0 {
3753 notewakeup(&sched.stopnote)
3759 // The same as entersyscall(), but with a hint that the syscall is blocking.
3762 func entersyscallblock() {
3765 gp.m.locks++ // see comment in entersyscall
3766 gp.throwsplit = true
3767 gp.stackguard0 = stackPreempt // see comment in entersyscall
3768 gp.m.syscalltick = gp.m.p.ptr().syscalltick
3769 gp.sysblocktraced = true
3770 gp.m.p.ptr().syscalltick++
3772 // Leave SP around for GC and traceback.
3776 gp.syscallsp = gp.sched.sp
3777 gp.syscallpc = gp.sched.pc
3778 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3782 systemstack(func() {
3783 print("entersyscallblock inconsistent ", hex(sp1), " ", hex(sp2), " ", hex(sp3), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3784 throw("entersyscallblock")
3787 casgstatus(gp, _Grunning, _Gsyscall)
3788 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3789 systemstack(func() {
3790 print("entersyscallblock inconsistent ", hex(sp), " ", hex(gp.sched.sp), " ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3791 throw("entersyscallblock")
3795 systemstack(entersyscallblock_handoff)
3797 // Resave for traceback during blocked call.
3798 save(getcallerpc(), getcallersp())
3803 func entersyscallblock_handoff() {
3806 traceGoSysBlock(getg().m.p.ptr())
3808 handoffp(releasep())
3811 // The goroutine g exited its system call.
3812 // Arrange for it to run on a cpu again.
3813 // This is called only from the go syscall library, not
3814 // from the low-level system calls used by the runtime.
3816 // Write barriers are not allowed because our P may have been stolen.
3818 // This is exported via linkname to assembly in the syscall package.
3821 //go:nowritebarrierrec
3822 //go:linkname exitsyscall
3823 func exitsyscall() {
3826 gp.m.locks++ // see comment in entersyscall
3827 if getcallersp() > gp.syscallsp {
3828 throw("exitsyscall: syscall frame is no longer valid")
3832 oldp := gp.m.oldp.ptr()
3834 if exitsyscallfast(oldp) {
3835 // When exitsyscallfast returns success, we have a P so can now use
3837 if goroutineProfile.active {
3838 // Make sure that gp has had its stack written out to the goroutine
3839 // profile, exactly as it was when the goroutine profiler first
3840 // stopped the world.
3841 systemstack(func() {
3842 tryRecordGoroutineProfileWB(gp)
3846 if oldp != gp.m.p.ptr() || gp.m.syscalltick != gp.m.p.ptr().syscalltick {
3847 systemstack(traceGoStart)
3850 // There's a cpu for us, so we can run.
3851 gp.m.p.ptr().syscalltick++
3852 // We need to cas the status and scan before resuming...
3853 casgstatus(gp, _Gsyscall, _Grunning)
3855 // Garbage collector isn't running (since we are),
3856 // so okay to clear syscallsp.
3860 // restore the preemption request in case we've cleared it in newstack
3861 gp.stackguard0 = stackPreempt
3863 // otherwise restore the real _StackGuard, we've spoiled it in entersyscall/entersyscallblock
3864 gp.stackguard0 = gp.stack.lo + _StackGuard
3866 gp.throwsplit = false
3868 if sched.disable.user && !schedEnabled(gp) {
3869 // Scheduling of this goroutine is disabled.
3878 // Wait till traceGoSysBlock event is emitted.
3879 // This ensures consistency of the trace (the goroutine is started after it is blocked).
3880 for oldp != nil && oldp.syscalltick == gp.m.syscalltick {
3883 // We can't trace syscall exit right now because we don't have a P.
3884 // Tracing code can invoke write barriers that cannot run without a P.
3885 // So instead we remember the syscall exit time and emit the event
3886 // in execute when we have a P.
3887 gp.sysexitticks = cputicks()
3892 // Call the scheduler.
3895 // Scheduler returned, so we're allowed to run now.
3896 // Delete the syscallsp information that we left for
3897 // the garbage collector during the system call.
3898 // Must wait until now because until gosched returns
3899 // we don't know for sure that the garbage collector
3902 gp.m.p.ptr().syscalltick++
3903 gp.throwsplit = false
3907 func exitsyscallfast(oldp *p) bool {
3910 // Freezetheworld sets stopwait but does not retake P's.
3911 if sched.stopwait == freezeStopWait {
3915 // Try to re-acquire the last P.
3916 if oldp != nil && oldp.status == _Psyscall && atomic.Cas(&oldp.status, _Psyscall, _Pidle) {
3917 // There's a cpu for us, so we can run.
3919 exitsyscallfast_reacquired()
3923 // Try to get any other idle P.
3924 if sched.pidle != 0 {
3926 systemstack(func() {
3927 ok = exitsyscallfast_pidle()
3928 if ok && trace.enabled {
3930 // Wait till traceGoSysBlock event is emitted.
3931 // This ensures consistency of the trace (the goroutine is started after it is blocked).
3932 for oldp.syscalltick == gp.m.syscalltick {
3946 // exitsyscallfast_reacquired is the exitsyscall path on which this G
3947 // has successfully reacquired the P it was running on before the
3951 func exitsyscallfast_reacquired() {
3953 if gp.m.syscalltick != gp.m.p.ptr().syscalltick {
3955 // The p was retaken and then enter into syscall again (since gp.m.syscalltick has changed).
3956 // traceGoSysBlock for this syscall was already emitted,
3957 // but here we effectively retake the p from the new syscall running on the same p.
3958 systemstack(func() {
3959 // Denote blocking of the new syscall.
3960 traceGoSysBlock(gp.m.p.ptr())
3961 // Denote completion of the current syscall.
3965 gp.m.p.ptr().syscalltick++
3969 func exitsyscallfast_pidle() bool {
3971 pp, _ := pidleget(0)
3972 if pp != nil && sched.sysmonwait.Load() {
3973 sched.sysmonwait.Store(false)
3974 notewakeup(&sched.sysmonnote)
3984 // exitsyscall slow path on g0.
3985 // Failed to acquire P, enqueue gp as runnable.
3987 // Called via mcall, so gp is the calling g from this M.
3989 //go:nowritebarrierrec
3990 func exitsyscall0(gp *g) {
3991 casgstatus(gp, _Gsyscall, _Grunnable)
3995 if schedEnabled(gp) {
4002 // Below, we stoplockedm if gp is locked. globrunqput releases
4003 // ownership of gp, so we must check if gp is locked prior to
4004 // committing the release by unlocking sched.lock, otherwise we
4005 // could race with another M transitioning gp from unlocked to
4007 locked = gp.lockedm != 0
4008 } else if sched.sysmonwait.Load() {
4009 sched.sysmonwait.Store(false)
4010 notewakeup(&sched.sysmonnote)
4015 execute(gp, false) // Never returns.
4018 // Wait until another thread schedules gp and so m again.
4020 // N.B. lockedm must be this M, as this g was running on this M
4021 // before entersyscall.
4023 execute(gp, false) // Never returns.
4026 schedule() // Never returns.
4029 // Called from syscall package before fork.
4031 //go:linkname syscall_runtime_BeforeFork syscall.runtime_BeforeFork
4033 func syscall_runtime_BeforeFork() {
4036 // Block signals during a fork, so that the child does not run
4037 // a signal handler before exec if a signal is sent to the process
4038 // group. See issue #18600.
4040 sigsave(&gp.m.sigmask)
4043 // This function is called before fork in syscall package.
4044 // Code between fork and exec must not allocate memory nor even try to grow stack.
4045 // Here we spoil g->_StackGuard to reliably detect any attempts to grow stack.
4046 // runtime_AfterFork will undo this in parent process, but not in child.
4047 gp.stackguard0 = stackFork
4050 // Called from syscall package after fork in parent.
4052 //go:linkname syscall_runtime_AfterFork syscall.runtime_AfterFork
4054 func syscall_runtime_AfterFork() {
4057 // See the comments in beforefork.
4058 gp.stackguard0 = gp.stack.lo + _StackGuard
4060 msigrestore(gp.m.sigmask)
4065 // inForkedChild is true while manipulating signals in the child process.
4066 // This is used to avoid calling libc functions in case we are using vfork.
4067 var inForkedChild bool
4069 // Called from syscall package after fork in child.
4070 // It resets non-sigignored signals to the default handler, and
4071 // restores the signal mask in preparation for the exec.
4073 // Because this might be called during a vfork, and therefore may be
4074 // temporarily sharing address space with the parent process, this must
4075 // not change any global variables or calling into C code that may do so.
4077 //go:linkname syscall_runtime_AfterForkInChild syscall.runtime_AfterForkInChild
4079 //go:nowritebarrierrec
4080 func syscall_runtime_AfterForkInChild() {
4081 // It's OK to change the global variable inForkedChild here
4082 // because we are going to change it back. There is no race here,
4083 // because if we are sharing address space with the parent process,
4084 // then the parent process can not be running concurrently.
4085 inForkedChild = true
4087 clearSignalHandlers()
4089 // When we are the child we are the only thread running,
4090 // so we know that nothing else has changed gp.m.sigmask.
4091 msigrestore(getg().m.sigmask)
4093 inForkedChild = false
4096 // pendingPreemptSignals is the number of preemption signals
4097 // that have been sent but not received. This is only used on Darwin.
4099 var pendingPreemptSignals atomic.Int32
4101 // Called from syscall package before Exec.
4103 //go:linkname syscall_runtime_BeforeExec syscall.runtime_BeforeExec
4104 func syscall_runtime_BeforeExec() {
4105 // Prevent thread creation during exec.
4108 // On Darwin, wait for all pending preemption signals to
4109 // be received. See issue #41702.
4110 if GOOS == "darwin" || GOOS == "ios" {
4111 for pendingPreemptSignals.Load() > 0 {
4117 // Called from syscall package after Exec.
4119 //go:linkname syscall_runtime_AfterExec syscall.runtime_AfterExec
4120 func syscall_runtime_AfterExec() {
4124 // Allocate a new g, with a stack big enough for stacksize bytes.
4125 func malg(stacksize int32) *g {
4128 stacksize = round2(_StackSystem + stacksize)
4129 systemstack(func() {
4130 newg.stack = stackalloc(uint32(stacksize))
4132 newg.stackguard0 = newg.stack.lo + _StackGuard
4133 newg.stackguard1 = ^uintptr(0)
4134 // Clear the bottom word of the stack. We record g
4135 // there on gsignal stack during VDSO on ARM and ARM64.
4136 *(*uintptr)(unsafe.Pointer(newg.stack.lo)) = 0
4141 // Create a new g running fn.
4142 // Put it on the queue of g's waiting to run.
4143 // The compiler turns a go statement into a call to this.
4144 func newproc(fn *funcval) {
4147 systemstack(func() {
4148 newg := newproc1(fn, gp, pc)
4150 pp := getg().m.p.ptr()
4151 runqput(pp, newg, true)
4159 // Create a new g in state _Grunnable, starting at fn. callerpc is the
4160 // address of the go statement that created this. The caller is responsible
4161 // for adding the new g to the scheduler.
4162 func newproc1(fn *funcval, callergp *g, callerpc uintptr) *g {
4164 fatal("go of nil func value")
4167 mp := acquirem() // disable preemption because we hold M and P in local vars.
4171 newg = malg(_StackMin)
4172 casgstatus(newg, _Gidle, _Gdead)
4173 allgadd(newg) // publishes with a g->status of Gdead so GC scanner doesn't look at uninitialized stack.
4175 if newg.stack.hi == 0 {
4176 throw("newproc1: newg missing stack")
4179 if readgstatus(newg) != _Gdead {
4180 throw("newproc1: new g is not Gdead")
4183 totalSize := uintptr(4*goarch.PtrSize + sys.MinFrameSize) // extra space in case of reads slightly beyond frame
4184 totalSize = alignUp(totalSize, sys.StackAlign)
4185 sp := newg.stack.hi - totalSize
4189 *(*uintptr)(unsafe.Pointer(sp)) = 0
4191 spArg += sys.MinFrameSize
4194 memclrNoHeapPointers(unsafe.Pointer(&newg.sched), unsafe.Sizeof(newg.sched))
4197 newg.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum // +PCQuantum so that previous instruction is in same function
4198 newg.sched.g = guintptr(unsafe.Pointer(newg))
4199 gostartcallfn(&newg.sched, fn)
4200 newg.gopc = callerpc
4201 newg.ancestors = saveAncestors(callergp)
4202 newg.startpc = fn.fn
4203 if isSystemGoroutine(newg, false) {
4206 // Only user goroutines inherit pprof labels.
4208 newg.labels = mp.curg.labels
4210 if goroutineProfile.active {
4211 // A concurrent goroutine profile is running. It should include
4212 // exactly the set of goroutines that were alive when the goroutine
4213 // profiler first stopped the world. That does not include newg, so
4214 // mark it as not needing a profile before transitioning it from
4216 newg.goroutineProfiled.Store(goroutineProfileSatisfied)
4219 // Track initial transition?
4220 newg.trackingSeq = uint8(fastrand())
4221 if newg.trackingSeq%gTrackingPeriod == 0 {
4222 newg.tracking = true
4224 casgstatus(newg, _Gdead, _Grunnable)
4225 gcController.addScannableStack(pp, int64(newg.stack.hi-newg.stack.lo))
4227 if pp.goidcache == pp.goidcacheend {
4228 // Sched.goidgen is the last allocated id,
4229 // this batch must be [sched.goidgen+1, sched.goidgen+GoidCacheBatch].
4230 // At startup sched.goidgen=0, so main goroutine receives goid=1.
4231 pp.goidcache = sched.goidgen.Add(_GoidCacheBatch)
4232 pp.goidcache -= _GoidCacheBatch - 1
4233 pp.goidcacheend = pp.goidcache + _GoidCacheBatch
4235 newg.goid = pp.goidcache
4238 newg.racectx = racegostart(callerpc)
4239 if newg.labels != nil {
4240 // See note in proflabel.go on labelSync's role in synchronizing
4241 // with the reads in the signal handler.
4242 racereleasemergeg(newg, unsafe.Pointer(&labelSync))
4246 traceGoCreate(newg, newg.startpc)
4253 // saveAncestors copies previous ancestors of the given caller g and
4254 // includes infor for the current caller into a new set of tracebacks for
4255 // a g being created.
4256 func saveAncestors(callergp *g) *[]ancestorInfo {
4257 // Copy all prior info, except for the root goroutine (goid 0).
4258 if debug.tracebackancestors <= 0 || callergp.goid == 0 {
4261 var callerAncestors []ancestorInfo
4262 if callergp.ancestors != nil {
4263 callerAncestors = *callergp.ancestors
4265 n := int32(len(callerAncestors)) + 1
4266 if n > debug.tracebackancestors {
4267 n = debug.tracebackancestors
4269 ancestors := make([]ancestorInfo, n)
4270 copy(ancestors[1:], callerAncestors)
4272 var pcs [_TracebackMaxFrames]uintptr
4273 npcs := gcallers(callergp, 0, pcs[:])
4274 ipcs := make([]uintptr, npcs)
4276 ancestors[0] = ancestorInfo{
4278 goid: callergp.goid,
4279 gopc: callergp.gopc,
4282 ancestorsp := new([]ancestorInfo)
4283 *ancestorsp = ancestors
4287 // Put on gfree list.
4288 // If local list is too long, transfer a batch to the global list.
4289 func gfput(pp *p, gp *g) {
4290 if readgstatus(gp) != _Gdead {
4291 throw("gfput: bad status (not Gdead)")
4294 stksize := gp.stack.hi - gp.stack.lo
4296 if stksize != uintptr(startingStackSize) {
4297 // non-standard stack size - free it.
4306 if pp.gFree.n >= 64 {
4312 for pp.gFree.n >= 32 {
4313 gp := pp.gFree.pop()
4315 if gp.stack.lo == 0 {
4322 lock(&sched.gFree.lock)
4323 sched.gFree.noStack.pushAll(noStackQ)
4324 sched.gFree.stack.pushAll(stackQ)
4325 sched.gFree.n += inc
4326 unlock(&sched.gFree.lock)
4330 // Get from gfree list.
4331 // If local list is empty, grab a batch from global list.
4332 func gfget(pp *p) *g {
4334 if pp.gFree.empty() && (!sched.gFree.stack.empty() || !sched.gFree.noStack.empty()) {
4335 lock(&sched.gFree.lock)
4336 // Move a batch of free Gs to the P.
4337 for pp.gFree.n < 32 {
4338 // Prefer Gs with stacks.
4339 gp := sched.gFree.stack.pop()
4341 gp = sched.gFree.noStack.pop()
4350 unlock(&sched.gFree.lock)
4353 gp := pp.gFree.pop()
4358 if gp.stack.lo != 0 && gp.stack.hi-gp.stack.lo != uintptr(startingStackSize) {
4359 // Deallocate old stack. We kept it in gfput because it was the
4360 // right size when the goroutine was put on the free list, but
4361 // the right size has changed since then.
4362 systemstack(func() {
4369 if gp.stack.lo == 0 {
4370 // Stack was deallocated in gfput or just above. Allocate a new one.
4371 systemstack(func() {
4372 gp.stack = stackalloc(startingStackSize)
4374 gp.stackguard0 = gp.stack.lo + _StackGuard
4377 racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4380 msanmalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4383 asanunpoison(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4389 // Purge all cached G's from gfree list to the global list.
4390 func gfpurge(pp *p) {
4396 for !pp.gFree.empty() {
4397 gp := pp.gFree.pop()
4399 if gp.stack.lo == 0 {
4406 lock(&sched.gFree.lock)
4407 sched.gFree.noStack.pushAll(noStackQ)
4408 sched.gFree.stack.pushAll(stackQ)
4409 sched.gFree.n += inc
4410 unlock(&sched.gFree.lock)
4413 // Breakpoint executes a breakpoint trap.
4418 // dolockOSThread is called by LockOSThread and lockOSThread below
4419 // after they modify m.locked. Do not allow preemption during this call,
4420 // or else the m might be different in this function than in the caller.
4423 func dolockOSThread() {
4424 if GOARCH == "wasm" {
4425 return // no threads on wasm yet
4428 gp.m.lockedg.set(gp)
4429 gp.lockedm.set(gp.m)
4434 // LockOSThread wires the calling goroutine to its current operating system thread.
4435 // The calling goroutine will always execute in that thread,
4436 // and no other goroutine will execute in it,
4437 // until the calling goroutine has made as many calls to
4438 // UnlockOSThread as to LockOSThread.
4439 // If the calling goroutine exits without unlocking the thread,
4440 // the thread will be terminated.
4442 // All init functions are run on the startup thread. Calling LockOSThread
4443 // from an init function will cause the main function to be invoked on
4446 // A goroutine should call LockOSThread before calling OS services or
4447 // non-Go library functions that depend on per-thread state.
4448 func LockOSThread() {
4449 if atomic.Load(&newmHandoff.haveTemplateThread) == 0 && GOOS != "plan9" {
4450 // If we need to start a new thread from the locked
4451 // thread, we need the template thread. Start it now
4452 // while we're in a known-good state.
4453 startTemplateThread()
4457 if gp.m.lockedExt == 0 {
4459 panic("LockOSThread nesting overflow")
4465 func lockOSThread() {
4466 getg().m.lockedInt++
4470 // dounlockOSThread is called by UnlockOSThread and unlockOSThread below
4471 // after they update m->locked. Do not allow preemption during this call,
4472 // or else the m might be in different in this function than in the caller.
4475 func dounlockOSThread() {
4476 if GOARCH == "wasm" {
4477 return // no threads on wasm yet
4480 if gp.m.lockedInt != 0 || gp.m.lockedExt != 0 {
4489 // UnlockOSThread undoes an earlier call to LockOSThread.
4490 // If this drops the number of active LockOSThread calls on the
4491 // calling goroutine to zero, it unwires the calling goroutine from
4492 // its fixed operating system thread.
4493 // If there are no active LockOSThread calls, this is a no-op.
4495 // Before calling UnlockOSThread, the caller must ensure that the OS
4496 // thread is suitable for running other goroutines. If the caller made
4497 // any permanent changes to the state of the thread that would affect
4498 // other goroutines, it should not call this function and thus leave
4499 // the goroutine locked to the OS thread until the goroutine (and
4500 // hence the thread) exits.
4501 func UnlockOSThread() {
4503 if gp.m.lockedExt == 0 {
4511 func unlockOSThread() {
4513 if gp.m.lockedInt == 0 {
4514 systemstack(badunlockosthread)
4520 func badunlockosthread() {
4521 throw("runtime: internal error: misuse of lockOSThread/unlockOSThread")
4524 func gcount() int32 {
4525 n := int32(atomic.Loaduintptr(&allglen)) - sched.gFree.n - sched.ngsys.Load()
4526 for _, pp := range allp {
4530 // All these variables can be changed concurrently, so the result can be inconsistent.
4531 // But at least the current goroutine is running.
4538 func mcount() int32 {
4539 return int32(sched.mnext - sched.nmfreed)
4543 signalLock atomic.Uint32
4545 // Must hold signalLock to write. Reads may be lock-free, but
4546 // signalLock should be taken to synchronize with changes.
4550 func _System() { _System() }
4551 func _ExternalCode() { _ExternalCode() }
4552 func _LostExternalCode() { _LostExternalCode() }
4553 func _GC() { _GC() }
4554 func _LostSIGPROFDuringAtomic64() { _LostSIGPROFDuringAtomic64() }
4555 func _VDSO() { _VDSO() }
4557 // Called if we receive a SIGPROF signal.
4558 // Called by the signal handler, may run during STW.
4560 //go:nowritebarrierrec
4561 func sigprof(pc, sp, lr uintptr, gp *g, mp *m) {
4562 if prof.hz.Load() == 0 {
4566 // If mp.profilehz is 0, then profiling is not enabled for this thread.
4567 // We must check this to avoid a deadlock between setcpuprofilerate
4568 // and the call to cpuprof.add, below.
4569 if mp != nil && mp.profilehz == 0 {
4573 // On mips{,le}/arm, 64bit atomics are emulated with spinlocks, in
4574 // runtime/internal/atomic. If SIGPROF arrives while the program is inside
4575 // the critical section, it creates a deadlock (when writing the sample).
4576 // As a workaround, create a counter of SIGPROFs while in critical section
4577 // to store the count, and pass it to sigprof.add() later when SIGPROF is
4578 // received from somewhere else (with _LostSIGPROFDuringAtomic64 as pc).
4579 if GOARCH == "mips" || GOARCH == "mipsle" || GOARCH == "arm" {
4580 if f := findfunc(pc); f.valid() {
4581 if hasPrefix(funcname(f), "runtime/internal/atomic") {
4582 cpuprof.lostAtomic++
4586 if GOARCH == "arm" && goarm < 7 && GOOS == "linux" && pc&0xffff0000 == 0xffff0000 {
4587 // runtime/internal/atomic functions call into kernel
4588 // helpers on arm < 7. See
4589 // runtime/internal/atomic/sys_linux_arm.s.
4590 cpuprof.lostAtomic++
4595 // Profiling runs concurrently with GC, so it must not allocate.
4596 // Set a trap in case the code does allocate.
4597 // Note that on windows, one thread takes profiles of all the
4598 // other threads, so mp is usually not getg().m.
4599 // In fact mp may not even be stopped.
4600 // See golang.org/issue/17165.
4601 getg().m.mallocing++
4603 var stk [maxCPUProfStack]uintptr
4605 if mp.ncgo > 0 && mp.curg != nil && mp.curg.syscallpc != 0 && mp.curg.syscallsp != 0 {
4607 // Check cgoCallersUse to make sure that we are not
4608 // interrupting other code that is fiddling with
4609 // cgoCallers. We are running in a signal handler
4610 // with all signals blocked, so we don't have to worry
4611 // about any other code interrupting us.
4612 if mp.cgoCallersUse.Load() == 0 && mp.cgoCallers != nil && mp.cgoCallers[0] != 0 {
4613 for cgoOff < len(mp.cgoCallers) && mp.cgoCallers[cgoOff] != 0 {
4616 copy(stk[:], mp.cgoCallers[:cgoOff])
4617 mp.cgoCallers[0] = 0
4620 // Collect Go stack that leads to the cgo call.
4621 n = gentraceback(mp.curg.syscallpc, mp.curg.syscallsp, 0, mp.curg, 0, &stk[cgoOff], len(stk)-cgoOff, nil, nil, 0)
4626 n = gentraceback(pc, sp, lr, gp, 0, &stk[0], len(stk), nil, nil, _TraceTrap|_TraceJumpStack)
4630 // Normal traceback is impossible or has failed.
4631 // See if it falls into several common cases.
4633 if usesLibcall() && mp.libcallg != 0 && mp.libcallpc != 0 && mp.libcallsp != 0 {
4634 // Libcall, i.e. runtime syscall on windows.
4635 // Collect Go stack that leads to the call.
4636 n = gentraceback(mp.libcallpc, mp.libcallsp, 0, mp.libcallg.ptr(), 0, &stk[0], len(stk), nil, nil, 0)
4638 if n == 0 && mp != nil && mp.vdsoSP != 0 {
4639 n = gentraceback(mp.vdsoPC, mp.vdsoSP, 0, gp, 0, &stk[0], len(stk), nil, nil, _TraceTrap|_TraceJumpStack)
4642 // If all of the above has failed, account it against abstract "System" or "GC".
4645 pc = abi.FuncPCABIInternal(_VDSO) + sys.PCQuantum
4646 } else if pc > firstmoduledata.etext {
4647 // "ExternalCode" is better than "etext".
4648 pc = abi.FuncPCABIInternal(_ExternalCode) + sys.PCQuantum
4651 if mp.preemptoff != "" {
4652 stk[1] = abi.FuncPCABIInternal(_GC) + sys.PCQuantum
4654 stk[1] = abi.FuncPCABIInternal(_System) + sys.PCQuantum
4659 if prof.hz.Load() != 0 {
4660 // Note: it can happen on Windows that we interrupted a system thread
4661 // with no g, so gp could nil. The other nil checks are done out of
4662 // caution, but not expected to be nil in practice.
4663 var tagPtr *unsafe.Pointer
4664 if gp != nil && gp.m != nil && gp.m.curg != nil {
4665 tagPtr = &gp.m.curg.labels
4667 cpuprof.add(tagPtr, stk[:n])
4671 if gp != nil && gp.m != nil {
4672 if gp.m.curg != nil {
4677 traceCPUSample(gprof, pp, stk[:n])
4679 getg().m.mallocing--
4682 // setcpuprofilerate sets the CPU profiling rate to hz times per second.
4683 // If hz <= 0, setcpuprofilerate turns off CPU profiling.
4684 func setcpuprofilerate(hz int32) {
4685 // Force sane arguments.
4690 // Disable preemption, otherwise we can be rescheduled to another thread
4691 // that has profiling enabled.
4695 // Stop profiler on this thread so that it is safe to lock prof.
4696 // if a profiling signal came in while we had prof locked,
4697 // it would deadlock.
4698 setThreadCPUProfiler(0)
4700 for !prof.signalLock.CompareAndSwap(0, 1) {
4703 if prof.hz.Load() != hz {
4704 setProcessCPUProfiler(hz)
4707 prof.signalLock.Store(0)
4710 sched.profilehz = hz
4714 setThreadCPUProfiler(hz)
4720 // init initializes pp, which may be a freshly allocated p or a
4721 // previously destroyed p, and transitions it to status _Pgcstop.
4722 func (pp *p) init(id int32) {
4724 pp.status = _Pgcstop
4725 pp.sudogcache = pp.sudogbuf[:0]
4726 pp.deferpool = pp.deferpoolbuf[:0]
4728 if pp.mcache == nil {
4731 throw("missing mcache?")
4733 // Use the bootstrap mcache0. Only one P will get
4734 // mcache0: the one with ID 0.
4737 pp.mcache = allocmcache()
4740 if raceenabled && pp.raceprocctx == 0 {
4742 pp.raceprocctx = raceprocctx0
4743 raceprocctx0 = 0 // bootstrap
4745 pp.raceprocctx = raceproccreate()
4748 lockInit(&pp.timersLock, lockRankTimers)
4750 // This P may get timers when it starts running. Set the mask here
4751 // since the P may not go through pidleget (notably P 0 on startup).
4753 // Similarly, we may not go through pidleget before this P starts
4754 // running if it is P 0 on startup.
4758 // destroy releases all of the resources associated with pp and
4759 // transitions it to status _Pdead.
4761 // sched.lock must be held and the world must be stopped.
4762 func (pp *p) destroy() {
4763 assertLockHeld(&sched.lock)
4764 assertWorldStopped()
4766 // Move all runnable goroutines to the global queue
4767 for pp.runqhead != pp.runqtail {
4768 // Pop from tail of local queue
4770 gp := pp.runq[pp.runqtail%uint32(len(pp.runq))].ptr()
4771 // Push onto head of global queue
4774 if pp.runnext != 0 {
4775 globrunqputhead(pp.runnext.ptr())
4778 if len(pp.timers) > 0 {
4779 plocal := getg().m.p.ptr()
4780 // The world is stopped, but we acquire timersLock to
4781 // protect against sysmon calling timeSleepUntil.
4782 // This is the only case where we hold the timersLock of
4783 // more than one P, so there are no deadlock concerns.
4784 lock(&plocal.timersLock)
4785 lock(&pp.timersLock)
4786 moveTimers(plocal, pp.timers)
4788 pp.numTimers.Store(0)
4789 pp.deletedTimers.Store(0)
4790 pp.timer0When.Store(0)
4791 unlock(&pp.timersLock)
4792 unlock(&plocal.timersLock)
4794 // Flush p's write barrier buffer.
4795 if gcphase != _GCoff {
4799 for i := range pp.sudogbuf {
4800 pp.sudogbuf[i] = nil
4802 pp.sudogcache = pp.sudogbuf[:0]
4803 for j := range pp.deferpoolbuf {
4804 pp.deferpoolbuf[j] = nil
4806 pp.deferpool = pp.deferpoolbuf[:0]
4807 systemstack(func() {
4808 for i := 0; i < pp.mspancache.len; i++ {
4809 // Safe to call since the world is stopped.
4810 mheap_.spanalloc.free(unsafe.Pointer(pp.mspancache.buf[i]))
4812 pp.mspancache.len = 0
4814 pp.pcache.flush(&mheap_.pages)
4815 unlock(&mheap_.lock)
4817 freemcache(pp.mcache)
4822 if pp.timerRaceCtx != 0 {
4823 // The race detector code uses a callback to fetch
4824 // the proc context, so arrange for that callback
4825 // to see the right thing.
4826 // This hack only works because we are the only
4832 racectxend(pp.timerRaceCtx)
4837 raceprocdestroy(pp.raceprocctx)
4844 // Change number of processors.
4846 // sched.lock must be held, and the world must be stopped.
4848 // gcworkbufs must not be being modified by either the GC or the write barrier
4849 // code, so the GC must not be running if the number of Ps actually changes.
4851 // Returns list of Ps with local work, they need to be scheduled by the caller.
4852 func procresize(nprocs int32) *p {
4853 assertLockHeld(&sched.lock)
4854 assertWorldStopped()
4857 if old < 0 || nprocs <= 0 {
4858 throw("procresize: invalid arg")
4861 traceGomaxprocs(nprocs)
4864 // update statistics
4866 if sched.procresizetime != 0 {
4867 sched.totaltime += int64(old) * (now - sched.procresizetime)
4869 sched.procresizetime = now
4871 maskWords := (nprocs + 31) / 32
4873 // Grow allp if necessary.
4874 if nprocs > int32(len(allp)) {
4875 // Synchronize with retake, which could be running
4876 // concurrently since it doesn't run on a P.
4878 if nprocs <= int32(cap(allp)) {
4879 allp = allp[:nprocs]
4881 nallp := make([]*p, nprocs)
4882 // Copy everything up to allp's cap so we
4883 // never lose old allocated Ps.
4884 copy(nallp, allp[:cap(allp)])
4888 if maskWords <= int32(cap(idlepMask)) {
4889 idlepMask = idlepMask[:maskWords]
4890 timerpMask = timerpMask[:maskWords]
4892 nidlepMask := make([]uint32, maskWords)
4893 // No need to copy beyond len, old Ps are irrelevant.
4894 copy(nidlepMask, idlepMask)
4895 idlepMask = nidlepMask
4897 ntimerpMask := make([]uint32, maskWords)
4898 copy(ntimerpMask, timerpMask)
4899 timerpMask = ntimerpMask
4904 // initialize new P's
4905 for i := old; i < nprocs; i++ {
4911 atomicstorep(unsafe.Pointer(&allp[i]), unsafe.Pointer(pp))
4915 if gp.m.p != 0 && gp.m.p.ptr().id < nprocs {
4916 // continue to use the current P
4917 gp.m.p.ptr().status = _Prunning
4918 gp.m.p.ptr().mcache.prepareForSweep()
4920 // release the current P and acquire allp[0].
4922 // We must do this before destroying our current P
4923 // because p.destroy itself has write barriers, so we
4924 // need to do that from a valid P.
4927 // Pretend that we were descheduled
4928 // and then scheduled again to keep
4931 traceProcStop(gp.m.p.ptr())
4945 // g.m.p is now set, so we no longer need mcache0 for bootstrapping.
4948 // release resources from unused P's
4949 for i := nprocs; i < old; i++ {
4952 // can't free P itself because it can be referenced by an M in syscall
4956 if int32(len(allp)) != nprocs {
4958 allp = allp[:nprocs]
4959 idlepMask = idlepMask[:maskWords]
4960 timerpMask = timerpMask[:maskWords]
4965 for i := nprocs - 1; i >= 0; i-- {
4967 if gp.m.p.ptr() == pp {
4975 pp.link.set(runnablePs)
4979 stealOrder.reset(uint32(nprocs))
4980 var int32p *int32 = &gomaxprocs // make compiler check that gomaxprocs is an int32
4981 atomic.Store((*uint32)(unsafe.Pointer(int32p)), uint32(nprocs))
4983 // Notify the limiter that the amount of procs has changed.
4984 gcCPULimiter.resetCapacity(now, nprocs)
4989 // Associate p and the current m.
4991 // This function is allowed to have write barriers even if the caller
4992 // isn't because it immediately acquires pp.
4994 //go:yeswritebarrierrec
4995 func acquirep(pp *p) {
4996 // Do the part that isn't allowed to have write barriers.
4999 // Have p; write barriers now allowed.
5001 // Perform deferred mcache flush before this P can allocate
5002 // from a potentially stale mcache.
5003 pp.mcache.prepareForSweep()
5010 // wirep is the first step of acquirep, which actually associates the
5011 // current M to pp. This is broken out so we can disallow write
5012 // barriers for this part, since we don't yet have a P.
5014 //go:nowritebarrierrec
5020 throw("wirep: already in go")
5022 if pp.m != 0 || pp.status != _Pidle {
5027 print("wirep: p->m=", pp.m, "(", id, ") p->status=", pp.status, "\n")
5028 throw("wirep: invalid p state")
5032 pp.status = _Prunning
5035 // Disassociate p and the current m.
5036 func releasep() *p {
5040 throw("releasep: invalid arg")
5043 if pp.m.ptr() != gp.m || pp.status != _Prunning {
5044 print("releasep: m=", gp.m, " m->p=", gp.m.p.ptr(), " p->m=", hex(pp.m), " p->status=", pp.status, "\n")
5045 throw("releasep: invalid p state")
5048 traceProcStop(gp.m.p.ptr())
5056 func incidlelocked(v int32) {
5058 sched.nmidlelocked += v
5065 // Check for deadlock situation.
5066 // The check is based on number of running M's, if 0 -> deadlock.
5067 // sched.lock must be held.
5069 assertLockHeld(&sched.lock)
5071 // For -buildmode=c-shared or -buildmode=c-archive it's OK if
5072 // there are no running goroutines. The calling program is
5073 // assumed to be running.
5074 if islibrary || isarchive {
5078 // If we are dying because of a signal caught on an already idle thread,
5079 // freezetheworld will cause all running threads to block.
5080 // And runtime will essentially enter into deadlock state,
5081 // except that there is a thread that will call exit soon.
5082 if panicking.Load() > 0 {
5086 // If we are not running under cgo, but we have an extra M then account
5087 // for it. (It is possible to have an extra M on Windows without cgo to
5088 // accommodate callbacks created by syscall.NewCallback. See issue #6751
5091 if !iscgo && cgoHasExtraM {
5092 mp := lockextra(true)
5093 haveExtraM := extraMCount > 0
5100 run := mcount() - sched.nmidle - sched.nmidlelocked - sched.nmsys
5105 print("runtime: checkdead: nmidle=", sched.nmidle, " nmidlelocked=", sched.nmidlelocked, " mcount=", mcount(), " nmsys=", sched.nmsys, "\n")
5106 throw("checkdead: inconsistent counts")
5110 forEachG(func(gp *g) {
5111 if isSystemGoroutine(gp, false) {
5114 s := readgstatus(gp)
5115 switch s &^ _Gscan {
5122 print("runtime: checkdead: find g ", gp.goid, " in status ", s, "\n")
5123 throw("checkdead: runnable g")
5126 if grunning == 0 { // possible if main goroutine calls runtime·Goexit()
5127 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5128 fatal("no goroutines (main called runtime.Goexit) - deadlock!")
5131 // Maybe jump time forward for playground.
5133 if when := timeSleepUntil(); when < maxWhen {
5136 // Start an M to steal the timer.
5137 pp, _ := pidleget(faketime)
5139 // There should always be a free P since
5140 // nothing is running.
5141 throw("checkdead: no p for timer")
5145 // There should always be a free M since
5146 // nothing is running.
5147 throw("checkdead: no m for timer")
5149 // M must be spinning to steal. We set this to be
5150 // explicit, but since this is the only M it would
5151 // become spinning on its own anyways.
5152 sched.nmspinning.Add(1)
5155 notewakeup(&mp.park)
5160 // There are no goroutines running, so we can look at the P's.
5161 for _, pp := range allp {
5162 if len(pp.timers) > 0 {
5167 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5168 fatal("all goroutines are asleep - deadlock!")
5171 // forcegcperiod is the maximum time in nanoseconds between garbage
5172 // collections. If we go this long without a garbage collection, one
5173 // is forced to run.
5175 // This is a variable for testing purposes. It normally doesn't change.
5176 var forcegcperiod int64 = 2 * 60 * 1e9
5178 // needSysmonWorkaround is true if the workaround for
5179 // golang.org/issue/42515 is needed on NetBSD.
5180 var needSysmonWorkaround bool = false
5182 // Always runs without a P, so write barriers are not allowed.
5184 //go:nowritebarrierrec
5191 lasttrace := int64(0)
5192 idle := 0 // how many cycles in succession we had not wokeup somebody
5196 if idle == 0 { // start with 20us sleep...
5198 } else if idle > 50 { // start doubling the sleep after 1ms...
5201 if delay > 10*1000 { // up to 10ms
5206 // sysmon should not enter deep sleep if schedtrace is enabled so that
5207 // it can print that information at the right time.
5209 // It should also not enter deep sleep if there are any active P's so
5210 // that it can retake P's from syscalls, preempt long running G's, and
5211 // poll the network if all P's are busy for long stretches.
5213 // It should wakeup from deep sleep if any P's become active either due
5214 // to exiting a syscall or waking up due to a timer expiring so that it
5215 // can resume performing those duties. If it wakes from a syscall it
5216 // resets idle and delay as a bet that since it had retaken a P from a
5217 // syscall before, it may need to do it again shortly after the
5218 // application starts work again. It does not reset idle when waking
5219 // from a timer to avoid adding system load to applications that spend
5220 // most of their time sleeping.
5222 if debug.schedtrace <= 0 && (sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs) {
5224 if sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs {
5225 syscallWake := false
5226 next := timeSleepUntil()
5228 sched.sysmonwait.Store(true)
5230 // Make wake-up period small enough
5231 // for the sampling to be correct.
5232 sleep := forcegcperiod / 2
5233 if next-now < sleep {
5236 shouldRelax := sleep >= osRelaxMinNS
5240 syscallWake = notetsleep(&sched.sysmonnote, sleep)
5245 sched.sysmonwait.Store(false)
5246 noteclear(&sched.sysmonnote)
5256 lock(&sched.sysmonlock)
5257 // Update now in case we blocked on sysmonnote or spent a long time
5258 // blocked on schedlock or sysmonlock above.
5261 // trigger libc interceptors if needed
5262 if *cgo_yield != nil {
5263 asmcgocall(*cgo_yield, nil)
5265 // poll network if not polled for more than 10ms
5266 lastpoll := sched.lastpoll.Load()
5267 if netpollinited() && lastpoll != 0 && lastpoll+10*1000*1000 < now {
5268 sched.lastpoll.CompareAndSwap(lastpoll, now)
5269 list := netpoll(0) // non-blocking - returns list of goroutines
5271 // Need to decrement number of idle locked M's
5272 // (pretending that one more is running) before injectglist.
5273 // Otherwise it can lead to the following situation:
5274 // injectglist grabs all P's but before it starts M's to run the P's,
5275 // another M returns from syscall, finishes running its G,
5276 // observes that there is no work to do and no other running M's
5277 // and reports deadlock.
5283 if GOOS == "netbsd" && needSysmonWorkaround {
5284 // netpoll is responsible for waiting for timer
5285 // expiration, so we typically don't have to worry
5286 // about starting an M to service timers. (Note that
5287 // sleep for timeSleepUntil above simply ensures sysmon
5288 // starts running again when that timer expiration may
5289 // cause Go code to run again).
5291 // However, netbsd has a kernel bug that sometimes
5292 // misses netpollBreak wake-ups, which can lead to
5293 // unbounded delays servicing timers. If we detect this
5294 // overrun, then startm to get something to handle the
5297 // See issue 42515 and
5298 // https://gnats.netbsd.org/cgi-bin/query-pr-single.pl?number=50094.
5299 if next := timeSleepUntil(); next < now {
5303 if scavenger.sysmonWake.Load() != 0 {
5304 // Kick the scavenger awake if someone requested it.
5307 // retake P's blocked in syscalls
5308 // and preempt long running G's
5309 if retake(now) != 0 {
5314 // check if we need to force a GC
5315 if t := (gcTrigger{kind: gcTriggerTime, now: now}); t.test() && forcegc.idle.Load() {
5317 forcegc.idle.Store(false)
5319 list.push(forcegc.g)
5321 unlock(&forcegc.lock)
5323 if debug.schedtrace > 0 && lasttrace+int64(debug.schedtrace)*1000000 <= now {
5325 schedtrace(debug.scheddetail > 0)
5327 unlock(&sched.sysmonlock)
5331 type sysmontick struct {
5338 // forcePreemptNS is the time slice given to a G before it is
5340 const forcePreemptNS = 10 * 1000 * 1000 // 10ms
5342 func retake(now int64) uint32 {
5344 // Prevent allp slice changes. This lock will be completely
5345 // uncontended unless we're already stopping the world.
5347 // We can't use a range loop over allp because we may
5348 // temporarily drop the allpLock. Hence, we need to re-fetch
5349 // allp each time around the loop.
5350 for i := 0; i < len(allp); i++ {
5353 // This can happen if procresize has grown
5354 // allp but not yet created new Ps.
5357 pd := &pp.sysmontick
5360 if s == _Prunning || s == _Psyscall {
5361 // Preempt G if it's running for too long.
5362 t := int64(pp.schedtick)
5363 if int64(pd.schedtick) != t {
5364 pd.schedtick = uint32(t)
5366 } else if pd.schedwhen+forcePreemptNS <= now {
5368 // In case of syscall, preemptone() doesn't
5369 // work, because there is no M wired to P.
5374 // Retake P from syscall if it's there for more than 1 sysmon tick (at least 20us).
5375 t := int64(pp.syscalltick)
5376 if !sysretake && int64(pd.syscalltick) != t {
5377 pd.syscalltick = uint32(t)
5378 pd.syscallwhen = now
5381 // On the one hand we don't want to retake Ps if there is no other work to do,
5382 // but on the other hand we want to retake them eventually
5383 // because they can prevent the sysmon thread from deep sleep.
5384 if runqempty(pp) && sched.nmspinning.Load()+sched.npidle.Load() > 0 && pd.syscallwhen+10*1000*1000 > now {
5387 // Drop allpLock so we can take sched.lock.
5389 // Need to decrement number of idle locked M's
5390 // (pretending that one more is running) before the CAS.
5391 // Otherwise the M from which we retake can exit the syscall,
5392 // increment nmidle and report deadlock.
5394 if atomic.Cas(&pp.status, s, _Pidle) {
5411 // Tell all goroutines that they have been preempted and they should stop.
5412 // This function is purely best-effort. It can fail to inform a goroutine if a
5413 // processor just started running it.
5414 // No locks need to be held.
5415 // Returns true if preemption request was issued to at least one goroutine.
5416 func preemptall() bool {
5418 for _, pp := range allp {
5419 if pp.status != _Prunning {
5429 // Tell the goroutine running on processor P to stop.
5430 // This function is purely best-effort. It can incorrectly fail to inform the
5431 // goroutine. It can inform the wrong goroutine. Even if it informs the
5432 // correct goroutine, that goroutine might ignore the request if it is
5433 // simultaneously executing newstack.
5434 // No lock needs to be held.
5435 // Returns true if preemption request was issued.
5436 // The actual preemption will happen at some point in the future
5437 // and will be indicated by the gp->status no longer being
5439 func preemptone(pp *p) bool {
5441 if mp == nil || mp == getg().m {
5445 if gp == nil || gp == mp.g0 {
5451 // Every call in a goroutine checks for stack overflow by
5452 // comparing the current stack pointer to gp->stackguard0.
5453 // Setting gp->stackguard0 to StackPreempt folds
5454 // preemption into the normal stack overflow check.
5455 gp.stackguard0 = stackPreempt
5457 // Request an async preemption of this P.
5458 if preemptMSupported && debug.asyncpreemptoff == 0 {
5468 func schedtrace(detailed bool) {
5475 print("SCHED ", (now-starttime)/1e6, "ms: gomaxprocs=", gomaxprocs, " idleprocs=", sched.npidle.Load(), " threads=", mcount(), " spinningthreads=", sched.nmspinning.Load(), " needspinning=", sched.needspinning.Load(), " idlethreads=", sched.nmidle, " runqueue=", sched.runqsize)
5477 print(" gcwaiting=", sched.gcwaiting.Load(), " nmidlelocked=", sched.nmidlelocked, " stopwait=", sched.stopwait, " sysmonwait=", sched.sysmonwait.Load(), "\n")
5479 // We must be careful while reading data from P's, M's and G's.
5480 // Even if we hold schedlock, most data can be changed concurrently.
5481 // E.g. (p->m ? p->m->id : -1) can crash if p->m changes from non-nil to nil.
5482 for i, pp := range allp {
5484 h := atomic.Load(&pp.runqhead)
5485 t := atomic.Load(&pp.runqtail)
5487 print(" P", i, ": status=", pp.status, " schedtick=", pp.schedtick, " syscalltick=", pp.syscalltick, " m=")
5493 print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers), "\n")
5495 // In non-detailed mode format lengths of per-P run queues as:
5496 // [len1 len2 len3 len4]
5502 if i == len(allp)-1 {
5513 for mp := allm; mp != nil; mp = mp.alllink {
5515 print(" M", mp.id, ": p=")
5527 print(" mallocing=", mp.mallocing, " throwing=", mp.throwing, " preemptoff=", mp.preemptoff, " locks=", mp.locks, " dying=", mp.dying, " spinning=", mp.spinning, " blocked=", mp.blocked, " lockedg=")
5528 if lockedg := mp.lockedg.ptr(); lockedg != nil {
5536 forEachG(func(gp *g) {
5537 print(" G", gp.goid, ": status=", readgstatus(gp), "(", gp.waitreason.String(), ") m=")
5544 if lockedm := gp.lockedm.ptr(); lockedm != nil {
5554 // schedEnableUser enables or disables the scheduling of user
5557 // This does not stop already running user goroutines, so the caller
5558 // should first stop the world when disabling user goroutines.
5559 func schedEnableUser(enable bool) {
5561 if sched.disable.user == !enable {
5565 sched.disable.user = !enable
5567 n := sched.disable.n
5569 globrunqputbatch(&sched.disable.runnable, n)
5571 for ; n != 0 && sched.npidle.Load() != 0; n-- {
5579 // schedEnabled reports whether gp should be scheduled. It returns
5580 // false is scheduling of gp is disabled.
5582 // sched.lock must be held.
5583 func schedEnabled(gp *g) bool {
5584 assertLockHeld(&sched.lock)
5586 if sched.disable.user {
5587 return isSystemGoroutine(gp, true)
5592 // Put mp on midle list.
5593 // sched.lock must be held.
5594 // May run during STW, so write barriers are not allowed.
5596 //go:nowritebarrierrec
5598 assertLockHeld(&sched.lock)
5600 mp.schedlink = sched.midle
5606 // Try to get an m from midle list.
5607 // sched.lock must be held.
5608 // May run during STW, so write barriers are not allowed.
5610 //go:nowritebarrierrec
5612 assertLockHeld(&sched.lock)
5614 mp := sched.midle.ptr()
5616 sched.midle = mp.schedlink
5622 // Put gp on the global runnable queue.
5623 // sched.lock must be held.
5624 // May run during STW, so write barriers are not allowed.
5626 //go:nowritebarrierrec
5627 func globrunqput(gp *g) {
5628 assertLockHeld(&sched.lock)
5630 sched.runq.pushBack(gp)
5634 // Put gp at the head of the global runnable queue.
5635 // sched.lock must be held.
5636 // May run during STW, so write barriers are not allowed.
5638 //go:nowritebarrierrec
5639 func globrunqputhead(gp *g) {
5640 assertLockHeld(&sched.lock)
5646 // Put a batch of runnable goroutines on the global runnable queue.
5647 // This clears *batch.
5648 // sched.lock must be held.
5649 // May run during STW, so write barriers are not allowed.
5651 //go:nowritebarrierrec
5652 func globrunqputbatch(batch *gQueue, n int32) {
5653 assertLockHeld(&sched.lock)
5655 sched.runq.pushBackAll(*batch)
5660 // Try get a batch of G's from the global runnable queue.
5661 // sched.lock must be held.
5662 func globrunqget(pp *p, max int32) *g {
5663 assertLockHeld(&sched.lock)
5665 if sched.runqsize == 0 {
5669 n := sched.runqsize/gomaxprocs + 1
5670 if n > sched.runqsize {
5673 if max > 0 && n > max {
5676 if n > int32(len(pp.runq))/2 {
5677 n = int32(len(pp.runq)) / 2
5682 gp := sched.runq.pop()
5685 gp1 := sched.runq.pop()
5686 runqput(pp, gp1, false)
5691 // pMask is an atomic bitstring with one bit per P.
5694 // read returns true if P id's bit is set.
5695 func (p pMask) read(id uint32) bool {
5697 mask := uint32(1) << (id % 32)
5698 return (atomic.Load(&p[word]) & mask) != 0
5701 // set sets P id's bit.
5702 func (p pMask) set(id int32) {
5704 mask := uint32(1) << (id % 32)
5705 atomic.Or(&p[word], mask)
5708 // clear clears P id's bit.
5709 func (p pMask) clear(id int32) {
5711 mask := uint32(1) << (id % 32)
5712 atomic.And(&p[word], ^mask)
5715 // updateTimerPMask clears pp's timer mask if it has no timers on its heap.
5717 // Ideally, the timer mask would be kept immediately consistent on any timer
5718 // operations. Unfortunately, updating a shared global data structure in the
5719 // timer hot path adds too much overhead in applications frequently switching
5720 // between no timers and some timers.
5722 // As a compromise, the timer mask is updated only on pidleget / pidleput. A
5723 // running P (returned by pidleget) may add a timer at any time, so its mask
5724 // must be set. An idle P (passed to pidleput) cannot add new timers while
5725 // idle, so if it has no timers at that time, its mask may be cleared.
5727 // Thus, we get the following effects on timer-stealing in findrunnable:
5729 // - Idle Ps with no timers when they go idle are never checked in findrunnable
5730 // (for work- or timer-stealing; this is the ideal case).
5731 // - Running Ps must always be checked.
5732 // - Idle Ps whose timers are stolen must continue to be checked until they run
5733 // again, even after timer expiration.
5735 // When the P starts running again, the mask should be set, as a timer may be
5736 // added at any time.
5738 // TODO(prattmic): Additional targeted updates may improve the above cases.
5739 // e.g., updating the mask when stealing a timer.
5740 func updateTimerPMask(pp *p) {
5741 if pp.numTimers.Load() > 0 {
5745 // Looks like there are no timers, however another P may transiently
5746 // decrement numTimers when handling a timerModified timer in
5747 // checkTimers. We must take timersLock to serialize with these changes.
5748 lock(&pp.timersLock)
5749 if pp.numTimers.Load() == 0 {
5750 timerpMask.clear(pp.id)
5752 unlock(&pp.timersLock)
5755 // pidleput puts p on the _Pidle list. now must be a relatively recent call
5756 // to nanotime or zero. Returns now or the current time if now was zero.
5758 // This releases ownership of p. Once sched.lock is released it is no longer
5761 // sched.lock must be held.
5763 // May run during STW, so write barriers are not allowed.
5765 //go:nowritebarrierrec
5766 func pidleput(pp *p, now int64) int64 {
5767 assertLockHeld(&sched.lock)
5770 throw("pidleput: P has non-empty run queue")
5775 updateTimerPMask(pp) // clear if there are no timers.
5776 idlepMask.set(pp.id)
5777 pp.link = sched.pidle
5780 if !pp.limiterEvent.start(limiterEventIdle, now) {
5781 throw("must be able to track idle limiter event")
5786 // pidleget tries to get a p from the _Pidle list, acquiring ownership.
5788 // sched.lock must be held.
5790 // May run during STW, so write barriers are not allowed.
5792 //go:nowritebarrierrec
5793 func pidleget(now int64) (*p, int64) {
5794 assertLockHeld(&sched.lock)
5796 pp := sched.pidle.ptr()
5798 // Timer may get added at any time now.
5802 timerpMask.set(pp.id)
5803 idlepMask.clear(pp.id)
5804 sched.pidle = pp.link
5805 sched.npidle.Add(-1)
5806 pp.limiterEvent.stop(limiterEventIdle, now)
5811 // pidlegetSpinning tries to get a p from the _Pidle list, acquiring ownership.
5812 // This is called by spinning Ms (or callers than need a spinning M) that have
5813 // found work. If no P is available, this must synchronized with non-spinning
5814 // Ms that may be preparing to drop their P without discovering this work.
5816 // sched.lock must be held.
5818 // May run during STW, so write barriers are not allowed.
5820 //go:nowritebarrierrec
5821 func pidlegetSpinning(now int64) (*p, int64) {
5822 assertLockHeld(&sched.lock)
5824 pp, now := pidleget(now)
5826 // See "Delicate dance" comment in findrunnable. We found work
5827 // that we cannot take, we must synchronize with non-spinning
5828 // Ms that may be preparing to drop their P.
5829 sched.needspinning.Store(1)
5836 // runqempty reports whether pp has no Gs on its local run queue.
5837 // It never returns true spuriously.
5838 func runqempty(pp *p) bool {
5839 // Defend against a race where 1) pp has G1 in runqnext but runqhead == runqtail,
5840 // 2) runqput on pp kicks G1 to the runq, 3) runqget on pp empties runqnext.
5841 // Simply observing that runqhead == runqtail and then observing that runqnext == nil
5842 // does not mean the queue is empty.
5844 head := atomic.Load(&pp.runqhead)
5845 tail := atomic.Load(&pp.runqtail)
5846 runnext := atomic.Loaduintptr((*uintptr)(unsafe.Pointer(&pp.runnext)))
5847 if tail == atomic.Load(&pp.runqtail) {
5848 return head == tail && runnext == 0
5853 // To shake out latent assumptions about scheduling order,
5854 // we introduce some randomness into scheduling decisions
5855 // when running with the race detector.
5856 // The need for this was made obvious by changing the
5857 // (deterministic) scheduling order in Go 1.5 and breaking
5858 // many poorly-written tests.
5859 // With the randomness here, as long as the tests pass
5860 // consistently with -race, they shouldn't have latent scheduling
5862 const randomizeScheduler = raceenabled
5864 // runqput tries to put g on the local runnable queue.
5865 // If next is false, runqput adds g to the tail of the runnable queue.
5866 // If next is true, runqput puts g in the pp.runnext slot.
5867 // If the run queue is full, runnext puts g on the global queue.
5868 // Executed only by the owner P.
5869 func runqput(pp *p, gp *g, next bool) {
5870 if randomizeScheduler && next && fastrandn(2) == 0 {
5876 oldnext := pp.runnext
5877 if !pp.runnext.cas(oldnext, guintptr(unsafe.Pointer(gp))) {
5883 // Kick the old runnext out to the regular run queue.
5888 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
5890 if t-h < uint32(len(pp.runq)) {
5891 pp.runq[t%uint32(len(pp.runq))].set(gp)
5892 atomic.StoreRel(&pp.runqtail, t+1) // store-release, makes the item available for consumption
5895 if runqputslow(pp, gp, h, t) {
5898 // the queue is not full, now the put above must succeed
5902 // Put g and a batch of work from local runnable queue on global queue.
5903 // Executed only by the owner P.
5904 func runqputslow(pp *p, gp *g, h, t uint32) bool {
5905 var batch [len(pp.runq)/2 + 1]*g
5907 // First, grab a batch from local queue.
5910 if n != uint32(len(pp.runq)/2) {
5911 throw("runqputslow: queue is not full")
5913 for i := uint32(0); i < n; i++ {
5914 batch[i] = pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
5916 if !atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
5921 if randomizeScheduler {
5922 for i := uint32(1); i <= n; i++ {
5923 j := fastrandn(i + 1)
5924 batch[i], batch[j] = batch[j], batch[i]
5928 // Link the goroutines.
5929 for i := uint32(0); i < n; i++ {
5930 batch[i].schedlink.set(batch[i+1])
5933 q.head.set(batch[0])
5934 q.tail.set(batch[n])
5936 // Now put the batch on global queue.
5938 globrunqputbatch(&q, int32(n+1))
5943 // runqputbatch tries to put all the G's on q on the local runnable queue.
5944 // If the queue is full, they are put on the global queue; in that case
5945 // this will temporarily acquire the scheduler lock.
5946 // Executed only by the owner P.
5947 func runqputbatch(pp *p, q *gQueue, qsize int) {
5948 h := atomic.LoadAcq(&pp.runqhead)
5951 for !q.empty() && t-h < uint32(len(pp.runq)) {
5953 pp.runq[t%uint32(len(pp.runq))].set(gp)
5959 if randomizeScheduler {
5960 off := func(o uint32) uint32 {
5961 return (pp.runqtail + o) % uint32(len(pp.runq))
5963 for i := uint32(1); i < n; i++ {
5964 j := fastrandn(i + 1)
5965 pp.runq[off(i)], pp.runq[off(j)] = pp.runq[off(j)], pp.runq[off(i)]
5969 atomic.StoreRel(&pp.runqtail, t)
5972 globrunqputbatch(q, int32(qsize))
5977 // Get g from local runnable queue.
5978 // If inheritTime is true, gp should inherit the remaining time in the
5979 // current time slice. Otherwise, it should start a new time slice.
5980 // Executed only by the owner P.
5981 func runqget(pp *p) (gp *g, inheritTime bool) {
5982 // If there's a runnext, it's the next G to run.
5984 // If the runnext is non-0 and the CAS fails, it could only have been stolen by another P,
5985 // because other Ps can race to set runnext to 0, but only the current P can set it to non-0.
5986 // Hence, there's no need to retry this CAS if it fails.
5987 if next != 0 && pp.runnext.cas(next, 0) {
5988 return next.ptr(), true
5992 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
5997 gp := pp.runq[h%uint32(len(pp.runq))].ptr()
5998 if atomic.CasRel(&pp.runqhead, h, h+1) { // cas-release, commits consume
6004 // runqdrain drains the local runnable queue of pp and returns all goroutines in it.
6005 // Executed only by the owner P.
6006 func runqdrain(pp *p) (drainQ gQueue, n uint32) {
6007 oldNext := pp.runnext
6008 if oldNext != 0 && pp.runnext.cas(oldNext, 0) {
6009 drainQ.pushBack(oldNext.ptr())
6014 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6020 if qn > uint32(len(pp.runq)) { // read inconsistent h and t
6024 if !atomic.CasRel(&pp.runqhead, h, h+qn) { // cas-release, commits consume
6028 // We've inverted the order in which it gets G's from the local P's runnable queue
6029 // and then advances the head pointer because we don't want to mess up the statuses of G's
6030 // while runqdrain() and runqsteal() are running in parallel.
6031 // Thus we should advance the head pointer before draining the local P into a gQueue,
6032 // so that we can update any gp.schedlink only after we take the full ownership of G,
6033 // meanwhile, other P's can't access to all G's in local P's runnable queue and steal them.
6034 // See https://groups.google.com/g/golang-dev/c/0pTKxEKhHSc/m/6Q85QjdVBQAJ for more details.
6035 for i := uint32(0); i < qn; i++ {
6036 gp := pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
6043 // Grabs a batch of goroutines from pp's runnable queue into batch.
6044 // Batch is a ring buffer starting at batchHead.
6045 // Returns number of grabbed goroutines.
6046 // Can be executed by any P.
6047 func runqgrab(pp *p, batch *[256]guintptr, batchHead uint32, stealRunNextG bool) uint32 {
6049 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6050 t := atomic.LoadAcq(&pp.runqtail) // load-acquire, synchronize with the producer
6055 // Try to steal from pp.runnext.
6056 if next := pp.runnext; next != 0 {
6057 if pp.status == _Prunning {
6058 // Sleep to ensure that pp isn't about to run the g
6059 // we are about to steal.
6060 // The important use case here is when the g running
6061 // on pp ready()s another g and then almost
6062 // immediately blocks. Instead of stealing runnext
6063 // in this window, back off to give pp a chance to
6064 // schedule runnext. This will avoid thrashing gs
6065 // between different Ps.
6066 // A sync chan send/recv takes ~50ns as of time of
6067 // writing, so 3us gives ~50x overshoot.
6068 if GOOS != "windows" && GOOS != "openbsd" && GOOS != "netbsd" {
6071 // On some platforms system timer granularity is
6072 // 1-15ms, which is way too much for this
6073 // optimization. So just yield.
6077 if !pp.runnext.cas(next, 0) {
6080 batch[batchHead%uint32(len(batch))] = next
6086 if n > uint32(len(pp.runq)/2) { // read inconsistent h and t
6089 for i := uint32(0); i < n; i++ {
6090 g := pp.runq[(h+i)%uint32(len(pp.runq))]
6091 batch[(batchHead+i)%uint32(len(batch))] = g
6093 if atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
6099 // Steal half of elements from local runnable queue of p2
6100 // and put onto local runnable queue of p.
6101 // Returns one of the stolen elements (or nil if failed).
6102 func runqsteal(pp, p2 *p, stealRunNextG bool) *g {
6104 n := runqgrab(p2, &pp.runq, t, stealRunNextG)
6109 gp := pp.runq[(t+n)%uint32(len(pp.runq))].ptr()
6113 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
6114 if t-h+n >= uint32(len(pp.runq)) {
6115 throw("runqsteal: runq overflow")
6117 atomic.StoreRel(&pp.runqtail, t+n) // store-release, makes the item available for consumption
6121 // A gQueue is a dequeue of Gs linked through g.schedlink. A G can only
6122 // be on one gQueue or gList at a time.
6123 type gQueue struct {
6128 // empty reports whether q is empty.
6129 func (q *gQueue) empty() bool {
6133 // push adds gp to the head of q.
6134 func (q *gQueue) push(gp *g) {
6135 gp.schedlink = q.head
6142 // pushBack adds gp to the tail of q.
6143 func (q *gQueue) pushBack(gp *g) {
6146 q.tail.ptr().schedlink.set(gp)
6153 // pushBackAll adds all Gs in q2 to the tail of q. After this q2 must
6155 func (q *gQueue) pushBackAll(q2 gQueue) {
6159 q2.tail.ptr().schedlink = 0
6161 q.tail.ptr().schedlink = q2.head
6168 // pop removes and returns the head of queue q. It returns nil if
6170 func (q *gQueue) pop() *g {
6173 q.head = gp.schedlink
6181 // popList takes all Gs in q and returns them as a gList.
6182 func (q *gQueue) popList() gList {
6183 stack := gList{q.head}
6188 // A gList is a list of Gs linked through g.schedlink. A G can only be
6189 // on one gQueue or gList at a time.
6194 // empty reports whether l is empty.
6195 func (l *gList) empty() bool {
6199 // push adds gp to the head of l.
6200 func (l *gList) push(gp *g) {
6201 gp.schedlink = l.head
6205 // pushAll prepends all Gs in q to l.
6206 func (l *gList) pushAll(q gQueue) {
6208 q.tail.ptr().schedlink = l.head
6213 // pop removes and returns the head of l. If l is empty, it returns nil.
6214 func (l *gList) pop() *g {
6217 l.head = gp.schedlink
6222 //go:linkname setMaxThreads runtime/debug.setMaxThreads
6223 func setMaxThreads(in int) (out int) {
6225 out = int(sched.maxmcount)
6226 if in > 0x7fffffff { // MaxInt32
6227 sched.maxmcount = 0x7fffffff
6229 sched.maxmcount = int32(in)
6237 func procPin() int {
6242 return int(mp.p.ptr().id)
6251 //go:linkname sync_runtime_procPin sync.runtime_procPin
6253 func sync_runtime_procPin() int {
6257 //go:linkname sync_runtime_procUnpin sync.runtime_procUnpin
6259 func sync_runtime_procUnpin() {
6263 //go:linkname sync_atomic_runtime_procPin sync/atomic.runtime_procPin
6265 func sync_atomic_runtime_procPin() int {
6269 //go:linkname sync_atomic_runtime_procUnpin sync/atomic.runtime_procUnpin
6271 func sync_atomic_runtime_procUnpin() {
6275 // Active spinning for sync.Mutex.
6277 //go:linkname sync_runtime_canSpin sync.runtime_canSpin
6279 func sync_runtime_canSpin(i int) bool {
6280 // sync.Mutex is cooperative, so we are conservative with spinning.
6281 // Spin only few times and only if running on a multicore machine and
6282 // GOMAXPROCS>1 and there is at least one other running P and local runq is empty.
6283 // As opposed to runtime mutex we don't do passive spinning here,
6284 // because there can be work on global runq or on other Ps.
6285 if i >= active_spin || ncpu <= 1 || gomaxprocs <= sched.npidle.Load()+sched.nmspinning.Load()+1 {
6288 if p := getg().m.p.ptr(); !runqempty(p) {
6294 //go:linkname sync_runtime_doSpin sync.runtime_doSpin
6296 func sync_runtime_doSpin() {
6297 procyield(active_spin_cnt)
6300 var stealOrder randomOrder
6302 // randomOrder/randomEnum are helper types for randomized work stealing.
6303 // They allow to enumerate all Ps in different pseudo-random orders without repetitions.
6304 // The algorithm is based on the fact that if we have X such that X and GOMAXPROCS
6305 // are coprime, then a sequences of (i + X) % GOMAXPROCS gives the required enumeration.
6306 type randomOrder struct {
6311 type randomEnum struct {
6318 func (ord *randomOrder) reset(count uint32) {
6320 ord.coprimes = ord.coprimes[:0]
6321 for i := uint32(1); i <= count; i++ {
6322 if gcd(i, count) == 1 {
6323 ord.coprimes = append(ord.coprimes, i)
6328 func (ord *randomOrder) start(i uint32) randomEnum {
6332 inc: ord.coprimes[i/ord.count%uint32(len(ord.coprimes))],
6336 func (enum *randomEnum) done() bool {
6337 return enum.i == enum.count
6340 func (enum *randomEnum) next() {
6342 enum.pos = (enum.pos + enum.inc) % enum.count
6345 func (enum *randomEnum) position() uint32 {
6349 func gcd(a, b uint32) uint32 {
6356 // An initTask represents the set of initializations that need to be done for a package.
6357 // Keep in sync with ../../test/initempty.go:initTask
6358 type initTask struct {
6359 // TODO: pack the first 3 fields more tightly?
6360 state uintptr // 0 = uninitialized, 1 = in progress, 2 = done
6363 // followed by ndeps instances of an *initTask, one per package depended on
6364 // followed by nfns pcs, one per init function to run
6367 // inittrace stores statistics for init functions which are
6368 // updated by malloc and newproc when active is true.
6369 var inittrace tracestat
6371 type tracestat struct {
6372 active bool // init tracing activation status
6373 id uint64 // init goroutine id
6374 allocs uint64 // heap allocations
6375 bytes uint64 // heap allocated bytes
6378 func doInit(t *initTask) {
6380 case 2: // fully initialized
6382 case 1: // initialization in progress
6383 throw("recursive call during initialization - linker skew")
6384 default: // not initialized yet
6385 t.state = 1 // initialization in progress
6387 for i := uintptr(0); i < t.ndeps; i++ {
6388 p := add(unsafe.Pointer(t), (3+i)*goarch.PtrSize)
6389 t2 := *(**initTask)(p)
6394 t.state = 2 // initialization done
6403 if inittrace.active {
6405 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6409 firstFunc := add(unsafe.Pointer(t), (3+t.ndeps)*goarch.PtrSize)
6410 for i := uintptr(0); i < t.nfns; i++ {
6411 p := add(firstFunc, i*goarch.PtrSize)
6412 f := *(*func())(unsafe.Pointer(&p))
6416 if inittrace.active {
6418 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6421 f := *(*func())(unsafe.Pointer(&firstFunc))
6422 pkg := funcpkgpath(findfunc(abi.FuncPCABIInternal(f)))
6425 print("init ", pkg, " @")
6426 print(string(fmtNSAsMS(sbuf[:], uint64(start-runtimeInitTime))), " ms, ")
6427 print(string(fmtNSAsMS(sbuf[:], uint64(end-start))), " ms clock, ")
6428 print(string(itoa(sbuf[:], after.bytes-before.bytes)), " bytes, ")
6429 print(string(itoa(sbuf[:], after.allocs-before.allocs)), " allocs")
6433 t.state = 2 // initialization done