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 != 0 {
299 throw("forcegc: phase error")
301 atomic.Store(&forcegc.idle, 1)
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 var fastrandseed uintptr
832 func fastrandinit() {
833 s := (*[unsafe.Sizeof(fastrandseed)]byte)(unsafe.Pointer(&fastrandseed))[:]
837 // Mark gp ready to run.
838 func ready(gp *g, traceskip int, next bool) {
840 traceGoUnpark(gp, traceskip)
843 status := readgstatus(gp)
846 mp := acquirem() // disable preemption because it can be holding p in a local var
847 if status&^_Gscan != _Gwaiting {
849 throw("bad g->status in ready")
852 // status is Gwaiting or Gscanwaiting, make Grunnable and put on runq
853 casgstatus(gp, _Gwaiting, _Grunnable)
854 runqput(mp.p.ptr(), gp, next)
859 // freezeStopWait is a large value that freezetheworld sets
860 // sched.stopwait to in order to request that all Gs permanently stop.
861 const freezeStopWait = 0x7fffffff
863 // freezing is set to non-zero if the runtime is trying to freeze the
867 // Similar to stopTheWorld but best-effort and can be called several times.
868 // There is no reverse operation, used during crashing.
869 // This function must not lock any mutexes.
870 func freezetheworld() {
871 atomic.Store(&freezing, 1)
872 // stopwait and preemption requests can be lost
873 // due to races with concurrently executing threads,
874 // so try several times
875 for i := 0; i < 5; i++ {
876 // this should tell the scheduler to not start any new goroutines
877 sched.stopwait = freezeStopWait
878 sched.gcwaiting.Store(true)
879 // this should stop running goroutines
881 break // no running goroutines
891 // All reads and writes of g's status go through readgstatus, casgstatus
892 // castogscanstatus, casfrom_Gscanstatus.
895 func readgstatus(gp *g) uint32 {
896 return atomic.Load(&gp.atomicstatus)
899 // The Gscanstatuses are acting like locks and this releases them.
900 // If it proves to be a performance hit we should be able to make these
901 // simple atomic stores but for now we are going to throw if
902 // we see an inconsistent state.
903 func casfrom_Gscanstatus(gp *g, oldval, newval uint32) {
906 // Check that transition is valid.
909 print("runtime: casfrom_Gscanstatus bad oldval gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
911 throw("casfrom_Gscanstatus:top gp->status is not in scan state")
917 if newval == oldval&^_Gscan {
918 success = atomic.Cas(&gp.atomicstatus, oldval, newval)
922 print("runtime: casfrom_Gscanstatus failed gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
924 throw("casfrom_Gscanstatus: gp->status is not in scan state")
926 releaseLockRank(lockRankGscan)
929 // This will return false if the gp is not in the expected status and the cas fails.
930 // This acts like a lock acquire while the casfromgstatus acts like a lock release.
931 func castogscanstatus(gp *g, oldval, newval uint32) bool {
937 if newval == oldval|_Gscan {
938 r := atomic.Cas(&gp.atomicstatus, oldval, newval)
940 acquireLockRank(lockRankGscan)
946 print("runtime: castogscanstatus oldval=", hex(oldval), " newval=", hex(newval), "\n")
947 throw("castogscanstatus")
951 // If asked to move to or from a Gscanstatus this will throw. Use the castogscanstatus
952 // and casfrom_Gscanstatus instead.
953 // casgstatus will loop if the g->atomicstatus is in a Gscan status until the routine that
954 // put it in the Gscan state is finished.
957 func casgstatus(gp *g, oldval, newval uint32) {
958 if (oldval&_Gscan != 0) || (newval&_Gscan != 0) || oldval == newval {
960 print("runtime: casgstatus: oldval=", hex(oldval), " newval=", hex(newval), "\n")
961 throw("casgstatus: bad incoming values")
965 acquireLockRank(lockRankGscan)
966 releaseLockRank(lockRankGscan)
968 // See https://golang.org/cl/21503 for justification of the yield delay.
969 const yieldDelay = 5 * 1000
972 // loop if gp->atomicstatus is in a scan state giving
973 // GC time to finish and change the state to oldval.
974 for i := 0; !atomic.Cas(&gp.atomicstatus, oldval, newval); i++ {
975 if oldval == _Gwaiting && gp.atomicstatus == _Grunnable {
976 throw("casgstatus: waiting for Gwaiting but is Grunnable")
979 nextYield = nanotime() + yieldDelay
981 if nanotime() < nextYield {
982 for x := 0; x < 10 && gp.atomicstatus != oldval; x++ {
987 nextYield = nanotime() + yieldDelay/2
991 // Handle tracking for scheduling latencies.
992 if oldval == _Grunning {
993 // Track every 8th time a goroutine transitions out of running.
994 if gp.trackingSeq%gTrackingPeriod == 0 {
1000 if oldval == _Grunnable {
1001 // We transitioned out of runnable, so measure how much
1002 // time we spent in this state and add it to
1005 gp.runnableTime += now - gp.runnableStamp
1006 gp.runnableStamp = 0
1008 if newval == _Grunnable {
1009 // We just transitioned into runnable, so record what
1010 // time that happened.
1012 gp.runnableStamp = now
1013 } else if newval == _Grunning {
1014 // We're transitioning into running, so turn off
1015 // tracking and record how much time we spent in
1018 sched.timeToRun.record(gp.runnableTime)
1024 // casgstatus(gp, oldstatus, Gcopystack), assuming oldstatus is Gwaiting or Grunnable.
1025 // Returns old status. Cannot call casgstatus directly, because we are racing with an
1026 // async wakeup that might come in from netpoll. If we see Gwaiting from the readgstatus,
1027 // it might have become Grunnable by the time we get to the cas. If we called casgstatus,
1028 // it would loop waiting for the status to go back to Gwaiting, which it never will.
1031 func casgcopystack(gp *g) uint32 {
1033 oldstatus := readgstatus(gp) &^ _Gscan
1034 if oldstatus != _Gwaiting && oldstatus != _Grunnable {
1035 throw("copystack: bad status, not Gwaiting or Grunnable")
1037 if atomic.Cas(&gp.atomicstatus, oldstatus, _Gcopystack) {
1043 // casGToPreemptScan transitions gp from _Grunning to _Gscan|_Gpreempted.
1045 // TODO(austin): This is the only status operation that both changes
1046 // the status and locks the _Gscan bit. Rethink this.
1047 func casGToPreemptScan(gp *g, old, new uint32) {
1048 if old != _Grunning || new != _Gscan|_Gpreempted {
1049 throw("bad g transition")
1051 acquireLockRank(lockRankGscan)
1052 for !atomic.Cas(&gp.atomicstatus, _Grunning, _Gscan|_Gpreempted) {
1056 // casGFromPreempted attempts to transition gp from _Gpreempted to
1057 // _Gwaiting. If successful, the caller is responsible for
1058 // re-scheduling gp.
1059 func casGFromPreempted(gp *g, old, new uint32) bool {
1060 if old != _Gpreempted || new != _Gwaiting {
1061 throw("bad g transition")
1063 return atomic.Cas(&gp.atomicstatus, _Gpreempted, _Gwaiting)
1066 // stopTheWorld stops all P's from executing goroutines, interrupting
1067 // all goroutines at GC safe points and records reason as the reason
1068 // for the stop. On return, only the current goroutine's P is running.
1069 // stopTheWorld must not be called from a system stack and the caller
1070 // must not hold worldsema. The caller must call startTheWorld when
1071 // other P's should resume execution.
1073 // stopTheWorld is safe for multiple goroutines to call at the
1074 // same time. Each will execute its own stop, and the stops will
1077 // This is also used by routines that do stack dumps. If the system is
1078 // in panic or being exited, this may not reliably stop all
1080 func stopTheWorld(reason string) {
1081 semacquire(&worldsema)
1083 gp.m.preemptoff = reason
1084 systemstack(func() {
1085 // Mark the goroutine which called stopTheWorld preemptible so its
1086 // stack may be scanned.
1087 // This lets a mark worker scan us while we try to stop the world
1088 // since otherwise we could get in a mutual preemption deadlock.
1089 // We must not modify anything on the G stack because a stack shrink
1090 // may occur. A stack shrink is otherwise OK though because in order
1091 // to return from this function (and to leave the system stack) we
1092 // must have preempted all goroutines, including any attempting
1093 // to scan our stack, in which case, any stack shrinking will
1094 // have already completed by the time we exit.
1095 casgstatus(gp, _Grunning, _Gwaiting)
1096 stopTheWorldWithSema()
1097 casgstatus(gp, _Gwaiting, _Grunning)
1101 // startTheWorld undoes the effects of stopTheWorld.
1102 func startTheWorld() {
1103 systemstack(func() { startTheWorldWithSema(false) })
1105 // worldsema must be held over startTheWorldWithSema to ensure
1106 // gomaxprocs cannot change while worldsema is held.
1108 // Release worldsema with direct handoff to the next waiter, but
1109 // acquirem so that semrelease1 doesn't try to yield our time.
1111 // Otherwise if e.g. ReadMemStats is being called in a loop,
1112 // it might stomp on other attempts to stop the world, such as
1113 // for starting or ending GC. The operation this blocks is
1114 // so heavy-weight that we should just try to be as fair as
1117 // We don't want to just allow us to get preempted between now
1118 // and releasing the semaphore because then we keep everyone
1119 // (including, for example, GCs) waiting longer.
1122 semrelease1(&worldsema, true, 0)
1126 // stopTheWorldGC has the same effect as stopTheWorld, but blocks
1127 // until the GC is not running. It also blocks a GC from starting
1128 // until startTheWorldGC is called.
1129 func stopTheWorldGC(reason string) {
1131 stopTheWorld(reason)
1134 // startTheWorldGC undoes the effects of stopTheWorldGC.
1135 func startTheWorldGC() {
1140 // Holding worldsema grants an M the right to try to stop the world.
1141 var worldsema uint32 = 1
1143 // Holding gcsema grants the M the right to block a GC, and blocks
1144 // until the current GC is done. In particular, it prevents gomaxprocs
1145 // from changing concurrently.
1147 // TODO(mknyszek): Once gomaxprocs and the execution tracer can handle
1148 // being changed/enabled during a GC, remove this.
1149 var gcsema uint32 = 1
1151 // stopTheWorldWithSema is the core implementation of stopTheWorld.
1152 // The caller is responsible for acquiring worldsema and disabling
1153 // preemption first and then should stopTheWorldWithSema on the system
1156 // semacquire(&worldsema, 0)
1157 // m.preemptoff = "reason"
1158 // systemstack(stopTheWorldWithSema)
1160 // When finished, the caller must either call startTheWorld or undo
1161 // these three operations separately:
1163 // m.preemptoff = ""
1164 // systemstack(startTheWorldWithSema)
1165 // semrelease(&worldsema)
1167 // It is allowed to acquire worldsema once and then execute multiple
1168 // startTheWorldWithSema/stopTheWorldWithSema pairs.
1169 // Other P's are able to execute between successive calls to
1170 // startTheWorldWithSema and stopTheWorldWithSema.
1171 // Holding worldsema causes any other goroutines invoking
1172 // stopTheWorld to block.
1173 func stopTheWorldWithSema() {
1176 // If we hold a lock, then we won't be able to stop another M
1177 // that is blocked trying to acquire the lock.
1179 throw("stopTheWorld: holding locks")
1183 sched.stopwait = gomaxprocs
1184 sched.gcwaiting.Store(true)
1187 gp.m.p.ptr().status = _Pgcstop // Pgcstop is only diagnostic.
1189 // try to retake all P's in Psyscall status
1190 for _, pp := range allp {
1192 if s == _Psyscall && atomic.Cas(&pp.status, s, _Pgcstop) {
1204 pp, _ := pidleget(now)
1208 pp.status = _Pgcstop
1211 wait := sched.stopwait > 0
1214 // wait for remaining P's to stop voluntarily
1217 // wait for 100us, then try to re-preempt in case of any races
1218 if notetsleep(&sched.stopnote, 100*1000) {
1219 noteclear(&sched.stopnote)
1228 if sched.stopwait != 0 {
1229 bad = "stopTheWorld: not stopped (stopwait != 0)"
1231 for _, pp := range allp {
1232 if pp.status != _Pgcstop {
1233 bad = "stopTheWorld: not stopped (status != _Pgcstop)"
1237 if atomic.Load(&freezing) != 0 {
1238 // Some other thread is panicking. This can cause the
1239 // sanity checks above to fail if the panic happens in
1240 // the signal handler on a stopped thread. Either way,
1241 // we should halt this thread.
1252 func startTheWorldWithSema(emitTraceEvent bool) int64 {
1253 assertWorldStopped()
1255 mp := acquirem() // disable preemption because it can be holding p in a local var
1256 if netpollinited() {
1257 list := netpoll(0) // non-blocking
1267 p1 := procresize(procs)
1268 sched.gcwaiting.Store(false)
1269 if sched.sysmonwait.Load() {
1270 sched.sysmonwait.Store(false)
1271 notewakeup(&sched.sysmonnote)
1284 throw("startTheWorld: inconsistent mp->nextp")
1287 notewakeup(&mp.park)
1289 // Start M to run P. Do not start another M below.
1294 // Capture start-the-world time before doing clean-up tasks.
1295 startTime := nanotime()
1300 // Wakeup an additional proc in case we have excessive runnable goroutines
1301 // in local queues or in the global queue. If we don't, the proc will park itself.
1302 // If we have lots of excessive work, resetspinning will unpark additional procs as necessary.
1310 // usesLibcall indicates whether this runtime performs system calls
1312 func usesLibcall() bool {
1314 case "aix", "darwin", "illumos", "ios", "solaris", "windows":
1317 return GOARCH == "386" || GOARCH == "amd64" || GOARCH == "arm" || GOARCH == "arm64"
1322 // mStackIsSystemAllocated indicates whether this runtime starts on a
1323 // system-allocated stack.
1324 func mStackIsSystemAllocated() bool {
1326 case "aix", "darwin", "plan9", "illumos", "ios", "solaris", "windows":
1330 case "386", "amd64", "arm", "arm64":
1337 // mstart is the entry-point for new Ms.
1338 // It is written in assembly, uses ABI0, is marked TOPFRAME, and calls mstart0.
1341 // mstart0 is the Go entry-point for new Ms.
1342 // This must not split the stack because we may not even have stack
1343 // bounds set up yet.
1345 // May run during STW (because it doesn't have a P yet), so write
1346 // barriers are not allowed.
1349 //go:nowritebarrierrec
1353 osStack := gp.stack.lo == 0
1355 // Initialize stack bounds from system stack.
1356 // Cgo may have left stack size in stack.hi.
1357 // minit may update the stack bounds.
1359 // Note: these bounds may not be very accurate.
1360 // We set hi to &size, but there are things above
1361 // it. The 1024 is supposed to compensate this,
1362 // but is somewhat arbitrary.
1365 size = 8192 * sys.StackGuardMultiplier
1367 gp.stack.hi = uintptr(noescape(unsafe.Pointer(&size)))
1368 gp.stack.lo = gp.stack.hi - size + 1024
1370 // Initialize stack guard so that we can start calling regular
1372 gp.stackguard0 = gp.stack.lo + _StackGuard
1373 // This is the g0, so we can also call go:systemstack
1374 // functions, which check stackguard1.
1375 gp.stackguard1 = gp.stackguard0
1378 // Exit this thread.
1379 if mStackIsSystemAllocated() {
1380 // Windows, Solaris, illumos, Darwin, AIX and Plan 9 always system-allocate
1381 // the stack, but put it in gp.stack before mstart,
1382 // so the logic above hasn't set osStack yet.
1388 // The go:noinline is to guarantee the getcallerpc/getcallersp below are safe,
1389 // so that we can set up g0.sched to return to the call of mstart1 above.
1396 throw("bad runtime·mstart")
1399 // Set up m.g0.sched as a label returning to just
1400 // after the mstart1 call in mstart0 above, for use by goexit0 and mcall.
1401 // We're never coming back to mstart1 after we call schedule,
1402 // so other calls can reuse the current frame.
1403 // And goexit0 does a gogo that needs to return from mstart1
1404 // and let mstart0 exit the thread.
1405 gp.sched.g = guintptr(unsafe.Pointer(gp))
1406 gp.sched.pc = getcallerpc()
1407 gp.sched.sp = getcallersp()
1412 // Install signal handlers; after minit so that minit can
1413 // prepare the thread to be able to handle the signals.
1418 if fn := gp.m.mstartfn; fn != nil {
1423 acquirep(gp.m.nextp.ptr())
1429 // mstartm0 implements part of mstart1 that only runs on the m0.
1431 // Write barriers are allowed here because we know the GC can't be
1432 // running yet, so they'll be no-ops.
1434 //go:yeswritebarrierrec
1436 // Create an extra M for callbacks on threads not created by Go.
1437 // An extra M is also needed on Windows for callbacks created by
1438 // syscall.NewCallback. See issue #6751 for details.
1439 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1446 // mPark causes a thread to park itself, returning once woken.
1451 notesleep(&gp.m.park)
1452 noteclear(&gp.m.park)
1455 // mexit tears down and exits the current thread.
1457 // Don't call this directly to exit the thread, since it must run at
1458 // the top of the thread stack. Instead, use gogo(&gp.m.g0.sched) to
1459 // unwind the stack to the point that exits the thread.
1461 // It is entered with m.p != nil, so write barriers are allowed. It
1462 // will release the P before exiting.
1464 //go:yeswritebarrierrec
1465 func mexit(osStack bool) {
1469 // This is the main thread. Just wedge it.
1471 // On Linux, exiting the main thread puts the process
1472 // into a non-waitable zombie state. On Plan 9,
1473 // exiting the main thread unblocks wait even though
1474 // other threads are still running. On Solaris we can
1475 // neither exitThread nor return from mstart. Other
1476 // bad things probably happen on other platforms.
1478 // We could try to clean up this M more before wedging
1479 // it, but that complicates signal handling.
1480 handoffp(releasep())
1486 throw("locked m0 woke up")
1492 // Free the gsignal stack.
1493 if mp.gsignal != nil {
1494 stackfree(mp.gsignal.stack)
1495 // On some platforms, when calling into VDSO (e.g. nanotime)
1496 // we store our g on the gsignal stack, if there is one.
1497 // Now the stack is freed, unlink it from the m, so we
1498 // won't write to it when calling VDSO code.
1502 // Remove m from allm.
1504 for pprev := &allm; *pprev != nil; pprev = &(*pprev).alllink {
1510 throw("m not found in allm")
1513 // Delay reaping m until it's done with the stack.
1515 // If this is using an OS stack, the OS will free it
1516 // so there's no need for reaping.
1517 atomic.Store(&mp.freeWait, 1)
1518 // Put m on the free list, though it will not be reaped until
1519 // freeWait is 0. Note that the free list must not be linked
1520 // through alllink because some functions walk allm without
1521 // locking, so may be using alllink.
1522 mp.freelink = sched.freem
1527 atomic.Xadd64(&ncgocall, int64(mp.ncgocall))
1530 handoffp(releasep())
1531 // After this point we must not have write barriers.
1533 // Invoke the deadlock detector. This must happen after
1534 // handoffp because it may have started a new M to take our
1541 if GOOS == "darwin" || GOOS == "ios" {
1542 // Make sure pendingPreemptSignals is correct when an M exits.
1544 if atomic.Load(&mp.signalPending) != 0 {
1545 pendingPreemptSignals.Add(-1)
1549 // Destroy all allocated resources. After this is called, we may no
1550 // longer take any locks.
1554 // Return from mstart and let the system thread
1555 // library free the g0 stack and terminate the thread.
1559 // mstart is the thread's entry point, so there's nothing to
1560 // return to. Exit the thread directly. exitThread will clear
1561 // m.freeWait when it's done with the stack and the m can be
1563 exitThread(&mp.freeWait)
1566 // forEachP calls fn(p) for every P p when p reaches a GC safe point.
1567 // If a P is currently executing code, this will bring the P to a GC
1568 // safe point and execute fn on that P. If the P is not executing code
1569 // (it is idle or in a syscall), this will call fn(p) directly while
1570 // preventing the P from exiting its state. This does not ensure that
1571 // fn will run on every CPU executing Go code, but it acts as a global
1572 // memory barrier. GC uses this as a "ragged barrier."
1574 // The caller must hold worldsema.
1577 func forEachP(fn func(*p)) {
1579 pp := getg().m.p.ptr()
1582 if sched.safePointWait != 0 {
1583 throw("forEachP: sched.safePointWait != 0")
1585 sched.safePointWait = gomaxprocs - 1
1586 sched.safePointFn = fn
1588 // Ask all Ps to run the safe point function.
1589 for _, p2 := range allp {
1591 atomic.Store(&p2.runSafePointFn, 1)
1596 // Any P entering _Pidle or _Psyscall from now on will observe
1597 // p.runSafePointFn == 1 and will call runSafePointFn when
1598 // changing its status to _Pidle/_Psyscall.
1600 // Run safe point function for all idle Ps. sched.pidle will
1601 // not change because we hold sched.lock.
1602 for p := sched.pidle.ptr(); p != nil; p = p.link.ptr() {
1603 if atomic.Cas(&p.runSafePointFn, 1, 0) {
1605 sched.safePointWait--
1609 wait := sched.safePointWait > 0
1612 // Run fn for the current P.
1615 // Force Ps currently in _Psyscall into _Pidle and hand them
1616 // off to induce safe point function execution.
1617 for _, p2 := range allp {
1619 if s == _Psyscall && p2.runSafePointFn == 1 && atomic.Cas(&p2.status, s, _Pidle) {
1629 // Wait for remaining Ps to run fn.
1632 // Wait for 100us, then try to re-preempt in
1633 // case of any races.
1635 // Requires system stack.
1636 if notetsleep(&sched.safePointNote, 100*1000) {
1637 noteclear(&sched.safePointNote)
1643 if sched.safePointWait != 0 {
1644 throw("forEachP: not done")
1646 for _, p2 := range allp {
1647 if p2.runSafePointFn != 0 {
1648 throw("forEachP: P did not run fn")
1653 sched.safePointFn = nil
1658 // runSafePointFn runs the safe point function, if any, for this P.
1659 // This should be called like
1661 // if getg().m.p.runSafePointFn != 0 {
1665 // runSafePointFn must be checked on any transition in to _Pidle or
1666 // _Psyscall to avoid a race where forEachP sees that the P is running
1667 // just before the P goes into _Pidle/_Psyscall and neither forEachP
1668 // nor the P run the safe-point function.
1669 func runSafePointFn() {
1670 p := getg().m.p.ptr()
1671 // Resolve the race between forEachP running the safe-point
1672 // function on this P's behalf and this P running the
1673 // safe-point function directly.
1674 if !atomic.Cas(&p.runSafePointFn, 1, 0) {
1677 sched.safePointFn(p)
1679 sched.safePointWait--
1680 if sched.safePointWait == 0 {
1681 notewakeup(&sched.safePointNote)
1686 // When running with cgo, we call _cgo_thread_start
1687 // to start threads for us so that we can play nicely with
1689 var cgoThreadStart unsafe.Pointer
1691 type cgothreadstart struct {
1697 // Allocate a new m unassociated with any thread.
1698 // Can use p for allocation context if needed.
1699 // fn is recorded as the new m's m.mstartfn.
1700 // id is optional pre-allocated m ID. Omit by passing -1.
1702 // This function is allowed to have write barriers even if the caller
1703 // isn't because it borrows pp.
1705 //go:yeswritebarrierrec
1706 func allocm(pp *p, fn func(), id int64) *m {
1709 // The caller owns pp, but we may borrow (i.e., acquirep) it. We must
1710 // disable preemption to ensure it is not stolen, which would make the
1711 // caller lose ownership.
1716 acquirep(pp) // temporarily borrow p for mallocs in this function
1719 // Release the free M list. We need to do this somewhere and
1720 // this may free up a stack we can use.
1721 if sched.freem != nil {
1724 for freem := sched.freem; freem != nil; {
1725 if freem.freeWait != 0 {
1726 next := freem.freelink
1727 freem.freelink = newList
1732 // stackfree must be on the system stack, but allocm is
1733 // reachable off the system stack transitively from
1735 systemstack(func() {
1736 stackfree(freem.g0.stack)
1738 freem = freem.freelink
1740 sched.freem = newList
1748 // In case of cgo or Solaris or illumos or Darwin, pthread_create will make us a stack.
1749 // Windows and Plan 9 will layout sched stack on OS stack.
1750 if iscgo || mStackIsSystemAllocated() {
1753 mp.g0 = malg(8192 * sys.StackGuardMultiplier)
1757 if pp == gp.m.p.ptr() {
1762 allocmLock.runlock()
1766 // needm is called when a cgo callback happens on a
1767 // thread without an m (a thread not created by Go).
1768 // In this case, needm is expected to find an m to use
1769 // and return with m, g initialized correctly.
1770 // Since m and g are not set now (likely nil, but see below)
1771 // needm is limited in what routines it can call. In particular
1772 // it can only call nosplit functions (textflag 7) and cannot
1773 // do any scheduling that requires an m.
1775 // In order to avoid needing heavy lifting here, we adopt
1776 // the following strategy: there is a stack of available m's
1777 // that can be stolen. Using compare-and-swap
1778 // to pop from the stack has ABA races, so we simulate
1779 // a lock by doing an exchange (via Casuintptr) to steal the stack
1780 // head and replace the top pointer with MLOCKED (1).
1781 // This serves as a simple spin lock that we can use even
1782 // without an m. The thread that locks the stack in this way
1783 // unlocks the stack by storing a valid stack head pointer.
1785 // In order to make sure that there is always an m structure
1786 // available to be stolen, we maintain the invariant that there
1787 // is always one more than needed. At the beginning of the
1788 // program (if cgo is in use) the list is seeded with a single m.
1789 // If needm finds that it has taken the last m off the list, its job
1790 // is - once it has installed its own m so that it can do things like
1791 // allocate memory - to create a spare m and put it on the list.
1793 // Each of these extra m's also has a g0 and a curg that are
1794 // pressed into service as the scheduling stack and current
1795 // goroutine for the duration of the cgo callback.
1797 // When the callback is done with the m, it calls dropm to
1798 // put the m back on the list.
1802 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1803 // Can happen if C/C++ code calls Go from a global ctor.
1804 // Can also happen on Windows if a global ctor uses a
1805 // callback created by syscall.NewCallback. See issue #6751
1808 // Can not throw, because scheduler is not initialized yet.
1809 write(2, unsafe.Pointer(&earlycgocallback[0]), int32(len(earlycgocallback)))
1813 // Save and block signals before getting an M.
1814 // The signal handler may call needm itself,
1815 // and we must avoid a deadlock. Also, once g is installed,
1816 // any incoming signals will try to execute,
1817 // but we won't have the sigaltstack settings and other data
1818 // set up appropriately until the end of minit, which will
1819 // unblock the signals. This is the same dance as when
1820 // starting a new m to run Go code via newosproc.
1825 // Lock extra list, take head, unlock popped list.
1826 // nilokay=false is safe here because of the invariant above,
1827 // that the extra list always contains or will soon contain
1829 mp := lockextra(false)
1831 // Set needextram when we've just emptied the list,
1832 // so that the eventual call into cgocallbackg will
1833 // allocate a new m for the extra list. We delay the
1834 // allocation until then so that it can be done
1835 // after exitsyscall makes sure it is okay to be
1836 // running at all (that is, there's no garbage collection
1837 // running right now).
1838 mp.needextram = mp.schedlink == 0
1840 unlockextra(mp.schedlink.ptr())
1842 // Store the original signal mask for use by minit.
1843 mp.sigmask = sigmask
1845 // Install TLS on some platforms (previously setg
1846 // would do this if necessary).
1849 // Install g (= m->g0) and set the stack bounds
1850 // to match the current stack. We don't actually know
1851 // how big the stack is, like we don't know how big any
1852 // scheduling stack is, but we assume there's at least 32 kB,
1853 // which is more than enough for us.
1856 gp.stack.hi = getcallersp() + 1024
1857 gp.stack.lo = getcallersp() - 32*1024
1858 gp.stackguard0 = gp.stack.lo + _StackGuard
1860 // Initialize this thread to use the m.
1864 // mp.curg is now a real goroutine.
1865 casgstatus(mp.curg, _Gdead, _Gsyscall)
1869 var earlycgocallback = []byte("fatal error: cgo callback before cgo call\n")
1871 // newextram allocates m's and puts them on the extra list.
1872 // It is called with a working local m, so that it can do things
1873 // like call schedlock and allocate.
1875 c := atomic.Xchg(&extraMWaiters, 0)
1877 for i := uint32(0); i < c; i++ {
1881 // Make sure there is at least one extra M.
1882 mp := lockextra(true)
1890 // oneNewExtraM allocates an m and puts it on the extra list.
1891 func oneNewExtraM() {
1892 // Create extra goroutine locked to extra m.
1893 // The goroutine is the context in which the cgo callback will run.
1894 // The sched.pc will never be returned to, but setting it to
1895 // goexit makes clear to the traceback routines where
1896 // the goroutine stack ends.
1897 mp := allocm(nil, nil, -1)
1899 gp.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum
1900 gp.sched.sp = gp.stack.hi
1901 gp.sched.sp -= 4 * goarch.PtrSize // extra space in case of reads slightly beyond frame
1903 gp.sched.g = guintptr(unsafe.Pointer(gp))
1904 gp.syscallpc = gp.sched.pc
1905 gp.syscallsp = gp.sched.sp
1906 gp.stktopsp = gp.sched.sp
1907 // malg returns status as _Gidle. Change to _Gdead before
1908 // adding to allg where GC can see it. We use _Gdead to hide
1909 // this from tracebacks and stack scans since it isn't a
1910 // "real" goroutine until needm grabs it.
1911 casgstatus(gp, _Gidle, _Gdead)
1917 gp.goid = sched.goidgen.Add(1)
1919 gp.racectx = racegostart(abi.FuncPCABIInternal(newextram) + sys.PCQuantum)
1921 // put on allg for garbage collector
1924 // gp is now on the allg list, but we don't want it to be
1925 // counted by gcount. It would be more "proper" to increment
1926 // sched.ngfree, but that requires locking. Incrementing ngsys
1927 // has the same effect.
1930 // Add m to the extra list.
1931 mnext := lockextra(true)
1932 mp.schedlink.set(mnext)
1937 // dropm is called when a cgo callback has called needm but is now
1938 // done with the callback and returning back into the non-Go thread.
1939 // It puts the current m back onto the extra list.
1941 // The main expense here is the call to signalstack to release the
1942 // m's signal stack, and then the call to needm on the next callback
1943 // from this thread. It is tempting to try to save the m for next time,
1944 // which would eliminate both these costs, but there might not be
1945 // a next time: the current thread (which Go does not control) might exit.
1946 // If we saved the m for that thread, there would be an m leak each time
1947 // such a thread exited. Instead, we acquire and release an m on each
1948 // call. These should typically not be scheduling operations, just a few
1949 // atomics, so the cost should be small.
1951 // TODO(rsc): An alternative would be to allocate a dummy pthread per-thread
1952 // variable using pthread_key_create. Unlike the pthread keys we already use
1953 // on OS X, this dummy key would never be read by Go code. It would exist
1954 // only so that we could register at thread-exit-time destructor.
1955 // That destructor would put the m back onto the extra list.
1956 // This is purely a performance optimization. The current version,
1957 // in which dropm happens on each cgo call, is still correct too.
1958 // We may have to keep the current version on systems with cgo
1959 // but without pthreads, like Windows.
1961 // Clear m and g, and return m to the extra list.
1962 // After the call to setg we can only call nosplit functions
1963 // with no pointer manipulation.
1966 // Return mp.curg to dead state.
1967 casgstatus(mp.curg, _Gsyscall, _Gdead)
1968 mp.curg.preemptStop = false
1971 // Block signals before unminit.
1972 // Unminit unregisters the signal handling stack (but needs g on some systems).
1973 // Setg(nil) clears g, which is the signal handler's cue not to run Go handlers.
1974 // It's important not to try to handle a signal between those two steps.
1975 sigmask := mp.sigmask
1979 mnext := lockextra(true)
1981 mp.schedlink.set(mnext)
1985 // Commit the release of mp.
1988 msigrestore(sigmask)
1991 // A helper function for EnsureDropM.
1992 func getm() uintptr {
1993 return uintptr(unsafe.Pointer(getg().m))
1997 var extraMCount uint32 // Protected by lockextra
1998 var extraMWaiters uint32
2000 // lockextra locks the extra list and returns the list head.
2001 // The caller must unlock the list by storing a new list head
2002 // to extram. If nilokay is true, then lockextra will
2003 // return a nil list head if that's what it finds. If nilokay is false,
2004 // lockextra will keep waiting until the list head is no longer nil.
2007 func lockextra(nilokay bool) *m {
2012 old := atomic.Loaduintptr(&extram)
2017 if old == 0 && !nilokay {
2019 // Add 1 to the number of threads
2020 // waiting for an M.
2021 // This is cleared by newextram.
2022 atomic.Xadd(&extraMWaiters, 1)
2028 if atomic.Casuintptr(&extram, old, locked) {
2029 return (*m)(unsafe.Pointer(old))
2037 func unlockextra(mp *m) {
2038 atomic.Storeuintptr(&extram, uintptr(unsafe.Pointer(mp)))
2042 // allocmLock is locked for read when creating new Ms in allocm and their
2043 // addition to allm. Thus acquiring this lock for write blocks the
2044 // creation of new Ms.
2047 // execLock serializes exec and clone to avoid bugs or unspecified
2048 // behaviour around exec'ing while creating/destroying threads. See
2053 // newmHandoff contains a list of m structures that need new OS threads.
2054 // This is used by newm in situations where newm itself can't safely
2055 // start an OS thread.
2056 var newmHandoff struct {
2059 // newm points to a list of M structures that need new OS
2060 // threads. The list is linked through m.schedlink.
2063 // waiting indicates that wake needs to be notified when an m
2064 // is put on the list.
2068 // haveTemplateThread indicates that the templateThread has
2069 // been started. This is not protected by lock. Use cas to set
2071 haveTemplateThread uint32
2074 // Create a new m. It will start off with a call to fn, or else the scheduler.
2075 // fn needs to be static and not a heap allocated closure.
2076 // May run with m.p==nil, so write barriers are not allowed.
2078 // id is optional pre-allocated m ID. Omit by passing -1.
2080 //go:nowritebarrierrec
2081 func newm(fn func(), pp *p, id int64) {
2082 // allocm adds a new M to allm, but they do not start until created by
2083 // the OS in newm1 or the template thread.
2085 // doAllThreadsSyscall requires that every M in allm will eventually
2086 // start and be signal-able, even with a STW.
2088 // Disable preemption here until we start the thread to ensure that
2089 // newm is not preempted between allocm and starting the new thread,
2090 // ensuring that anything added to allm is guaranteed to eventually
2094 mp := allocm(pp, fn, id)
2096 mp.sigmask = initSigmask
2097 if gp := getg(); gp != nil && gp.m != nil && (gp.m.lockedExt != 0 || gp.m.incgo) && GOOS != "plan9" {
2098 // We're on a locked M or a thread that may have been
2099 // started by C. The kernel state of this thread may
2100 // be strange (the user may have locked it for that
2101 // purpose). We don't want to clone that into another
2102 // thread. Instead, ask a known-good thread to create
2103 // the thread for us.
2105 // This is disabled on Plan 9. See golang.org/issue/22227.
2107 // TODO: This may be unnecessary on Windows, which
2108 // doesn't model thread creation off fork.
2109 lock(&newmHandoff.lock)
2110 if newmHandoff.haveTemplateThread == 0 {
2111 throw("on a locked thread with no template thread")
2113 mp.schedlink = newmHandoff.newm
2114 newmHandoff.newm.set(mp)
2115 if newmHandoff.waiting {
2116 newmHandoff.waiting = false
2117 notewakeup(&newmHandoff.wake)
2119 unlock(&newmHandoff.lock)
2120 // The M has not started yet, but the template thread does not
2121 // participate in STW, so it will always process queued Ms and
2122 // it is safe to releasem.
2132 var ts cgothreadstart
2133 if _cgo_thread_start == nil {
2134 throw("_cgo_thread_start missing")
2137 ts.tls = (*uint64)(unsafe.Pointer(&mp.tls[0]))
2138 ts.fn = unsafe.Pointer(abi.FuncPCABI0(mstart))
2140 msanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2143 asanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2145 execLock.rlock() // Prevent process clone.
2146 asmcgocall(_cgo_thread_start, unsafe.Pointer(&ts))
2150 execLock.rlock() // Prevent process clone.
2155 // startTemplateThread starts the template thread if it is not already
2158 // The calling thread must itself be in a known-good state.
2159 func startTemplateThread() {
2160 if GOARCH == "wasm" { // no threads on wasm yet
2164 // Disable preemption to guarantee that the template thread will be
2165 // created before a park once haveTemplateThread is set.
2167 if !atomic.Cas(&newmHandoff.haveTemplateThread, 0, 1) {
2171 newm(templateThread, nil, -1)
2175 // templateThread is a thread in a known-good state that exists solely
2176 // to start new threads in known-good states when the calling thread
2177 // may not be in a good state.
2179 // Many programs never need this, so templateThread is started lazily
2180 // when we first enter a state that might lead to running on a thread
2181 // in an unknown state.
2183 // templateThread runs on an M without a P, so it must not have write
2186 //go:nowritebarrierrec
2187 func templateThread() {
2194 lock(&newmHandoff.lock)
2195 for newmHandoff.newm != 0 {
2196 newm := newmHandoff.newm.ptr()
2197 newmHandoff.newm = 0
2198 unlock(&newmHandoff.lock)
2200 next := newm.schedlink.ptr()
2205 lock(&newmHandoff.lock)
2207 newmHandoff.waiting = true
2208 noteclear(&newmHandoff.wake)
2209 unlock(&newmHandoff.lock)
2210 notesleep(&newmHandoff.wake)
2214 // Stops execution of the current m until new work is available.
2215 // Returns with acquired P.
2219 if gp.m.locks != 0 {
2220 throw("stopm holding locks")
2223 throw("stopm holding p")
2226 throw("stopm spinning")
2233 acquirep(gp.m.nextp.ptr())
2238 // startm's caller incremented nmspinning. Set the new M's spinning.
2239 getg().m.spinning = true
2242 // Schedules some M to run the p (creates an M if necessary).
2243 // If p==nil, tries to get an idle P, if no idle P's does nothing.
2244 // May run with m.p==nil, so write barriers are not allowed.
2245 // If spinning is set, the caller has incremented nmspinning and startm will
2246 // either decrement nmspinning or set m.spinning in the newly started M.
2248 // Callers passing a non-nil P must call from a non-preemptible context. See
2249 // comment on acquirem below.
2251 // Must not have write barriers because this may be called without a P.
2253 //go:nowritebarrierrec
2254 func startm(pp *p, spinning bool) {
2255 // Disable preemption.
2257 // Every owned P must have an owner that will eventually stop it in the
2258 // event of a GC stop request. startm takes transient ownership of a P
2259 // (either from argument or pidleget below) and transfers ownership to
2260 // a started M, which will be responsible for performing the stop.
2262 // Preemption must be disabled during this transient ownership,
2263 // otherwise the P this is running on may enter GC stop while still
2264 // holding the transient P, leaving that P in limbo and deadlocking the
2267 // Callers passing a non-nil P must already be in non-preemptible
2268 // context, otherwise such preemption could occur on function entry to
2269 // startm. Callers passing a nil P may be preemptible, so we must
2270 // disable preemption before acquiring a P from pidleget below.
2278 // The caller incremented nmspinning, but there are no idle Ps,
2279 // so it's okay to just undo the increment and give up.
2280 if sched.nmspinning.Add(-1) < 0 {
2281 throw("startm: negative nmspinning")
2290 // No M is available, we must drop sched.lock and call newm.
2291 // However, we already own a P to assign to the M.
2293 // Once sched.lock is released, another G (e.g., in a syscall),
2294 // could find no idle P while checkdead finds a runnable G but
2295 // no running M's because this new M hasn't started yet, thus
2296 // throwing in an apparent deadlock.
2298 // Avoid this situation by pre-allocating the ID for the new M,
2299 // thus marking it as 'running' before we drop sched.lock. This
2300 // new M will eventually run the scheduler to execute any
2307 // The caller incremented nmspinning, so set m.spinning in the new M.
2311 // Ownership transfer of pp committed by start in newm.
2312 // Preemption is now safe.
2318 throw("startm: m is spinning")
2321 throw("startm: m has p")
2323 if spinning && !runqempty(pp) {
2324 throw("startm: p has runnable gs")
2326 // The caller incremented nmspinning, so set m.spinning in the new M.
2327 nmp.spinning = spinning
2329 notewakeup(&nmp.park)
2330 // Ownership transfer of pp committed by wakeup. Preemption is now
2335 // Hands off P from syscall or locked M.
2336 // Always runs without a P, so write barriers are not allowed.
2338 //go:nowritebarrierrec
2339 func handoffp(pp *p) {
2340 // handoffp must start an M in any situation where
2341 // findrunnable would return a G to run on pp.
2343 // if it has local work, start it straight away
2344 if !runqempty(pp) || sched.runqsize != 0 {
2348 // if there's trace work to do, start it straight away
2349 if (trace.enabled || trace.shutdown) && traceReaderAvailable() != nil {
2353 // if it has GC work, start it straight away
2354 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) {
2358 // no local work, check that there are no spinning/idle M's,
2359 // otherwise our help is not required
2360 if sched.nmspinning.Load()+sched.npidle.Load() == 0 && sched.nmspinning.CompareAndSwap(0, 1) { // TODO: fast atomic
2365 if sched.gcwaiting.Load() {
2366 pp.status = _Pgcstop
2368 if sched.stopwait == 0 {
2369 notewakeup(&sched.stopnote)
2374 if pp.runSafePointFn != 0 && atomic.Cas(&pp.runSafePointFn, 1, 0) {
2375 sched.safePointFn(pp)
2376 sched.safePointWait--
2377 if sched.safePointWait == 0 {
2378 notewakeup(&sched.safePointNote)
2381 if sched.runqsize != 0 {
2386 // If this is the last running P and nobody is polling network,
2387 // need to wakeup another M to poll network.
2388 if sched.npidle.Load() == gomaxprocs-1 && sched.lastpoll.Load() != 0 {
2394 // The scheduler lock cannot be held when calling wakeNetPoller below
2395 // because wakeNetPoller may call wakep which may call startm.
2396 when := nobarrierWakeTime(pp)
2405 // Tries to add one more P to execute G's.
2406 // Called when a G is made runnable (newproc, ready).
2408 if sched.npidle.Load() == 0 {
2411 // be conservative about spinning threads
2412 if sched.nmspinning.Load() != 0 || !sched.nmspinning.CompareAndSwap(0, 1) {
2418 // Stops execution of the current m that is locked to a g until the g is runnable again.
2419 // Returns with acquired P.
2420 func stoplockedm() {
2423 if gp.m.lockedg == 0 || gp.m.lockedg.ptr().lockedm.ptr() != gp.m {
2424 throw("stoplockedm: inconsistent locking")
2427 // Schedule another M to run this p.
2432 // Wait until another thread schedules lockedg again.
2434 status := readgstatus(gp.m.lockedg.ptr())
2435 if status&^_Gscan != _Grunnable {
2436 print("runtime:stoplockedm: lockedg (atomicstatus=", status, ") is not Grunnable or Gscanrunnable\n")
2437 dumpgstatus(gp.m.lockedg.ptr())
2438 throw("stoplockedm: not runnable")
2440 acquirep(gp.m.nextp.ptr())
2444 // Schedules the locked m to run the locked gp.
2445 // May run during STW, so write barriers are not allowed.
2447 //go:nowritebarrierrec
2448 func startlockedm(gp *g) {
2449 mp := gp.lockedm.ptr()
2451 throw("startlockedm: locked to me")
2454 throw("startlockedm: m has p")
2456 // directly handoff current P to the locked m
2460 notewakeup(&mp.park)
2464 // Stops the current m for stopTheWorld.
2465 // Returns when the world is restarted.
2469 if !sched.gcwaiting.Load() {
2470 throw("gcstopm: not waiting for gc")
2473 gp.m.spinning = false
2474 // OK to just drop nmspinning here,
2475 // startTheWorld will unpark threads as necessary.
2476 if sched.nmspinning.Add(-1) < 0 {
2477 throw("gcstopm: negative nmspinning")
2482 pp.status = _Pgcstop
2484 if sched.stopwait == 0 {
2485 notewakeup(&sched.stopnote)
2491 // Schedules gp to run on the current M.
2492 // If inheritTime is true, gp inherits the remaining time in the
2493 // current time slice. Otherwise, it starts a new time slice.
2496 // Write barriers are allowed because this is called immediately after
2497 // acquiring a P in several places.
2499 //go:yeswritebarrierrec
2500 func execute(gp *g, inheritTime bool) {
2503 if goroutineProfile.active {
2504 // Make sure that gp has had its stack written out to the goroutine
2505 // profile, exactly as it was when the goroutine profiler first stopped
2507 tryRecordGoroutineProfile(gp, osyield)
2510 // Assign gp.m before entering _Grunning so running Gs have an
2514 casgstatus(gp, _Grunnable, _Grunning)
2517 gp.stackguard0 = gp.stack.lo + _StackGuard
2519 mp.p.ptr().schedtick++
2522 // Check whether the profiler needs to be turned on or off.
2523 hz := sched.profilehz
2524 if mp.profilehz != hz {
2525 setThreadCPUProfiler(hz)
2529 // GoSysExit has to happen when we have a P, but before GoStart.
2530 // So we emit it here.
2531 if gp.syscallsp != 0 && gp.sysblocktraced {
2532 traceGoSysExit(gp.sysexitticks)
2540 // Finds a runnable goroutine to execute.
2541 // Tries to steal from other P's, get g from local or global queue, poll network.
2542 // tryWakeP indicates that the returned goroutine is not normal (GC worker, trace
2543 // reader) so the caller should try to wake a P.
2544 func findRunnable() (gp *g, inheritTime, tryWakeP bool) {
2547 // The conditions here and in handoffp must agree: if
2548 // findrunnable would return a G to run, handoffp must start
2553 if sched.gcwaiting.Load() {
2557 if pp.runSafePointFn != 0 {
2561 // now and pollUntil are saved for work stealing later,
2562 // which may steal timers. It's important that between now
2563 // and then, nothing blocks, so these numbers remain mostly
2565 now, pollUntil, _ := checkTimers(pp, 0)
2567 // Try to schedule the trace reader.
2568 if trace.enabled || trace.shutdown {
2571 casgstatus(gp, _Gwaiting, _Grunnable)
2572 traceGoUnpark(gp, 0)
2573 return gp, false, true
2577 // Try to schedule a GC worker.
2578 if gcBlackenEnabled != 0 {
2579 gp, tnow := gcController.findRunnableGCWorker(pp, now)
2581 return gp, false, true
2586 // Check the global runnable queue once in a while to ensure fairness.
2587 // Otherwise two goroutines can completely occupy the local runqueue
2588 // by constantly respawning each other.
2589 if pp.schedtick%61 == 0 && sched.runqsize > 0 {
2591 gp := globrunqget(pp, 1)
2594 return gp, false, false
2598 // Wake up the finalizer G.
2599 if fingwait && fingwake {
2600 if gp := wakefing(); gp != nil {
2604 if *cgo_yield != nil {
2605 asmcgocall(*cgo_yield, nil)
2609 if gp, inheritTime := runqget(pp); gp != nil {
2610 return gp, inheritTime, false
2614 if sched.runqsize != 0 {
2616 gp := globrunqget(pp, 0)
2619 return gp, false, false
2624 // This netpoll is only an optimization before we resort to stealing.
2625 // We can safely skip it if there are no waiters or a thread is blocked
2626 // in netpoll already. If there is any kind of logical race with that
2627 // blocked thread (e.g. it has already returned from netpoll, but does
2628 // not set lastpoll yet), this thread will do blocking netpoll below
2630 if netpollinited() && atomic.Load(&netpollWaiters) > 0 && sched.lastpoll.Load() != 0 {
2631 if list := netpoll(0); !list.empty() { // non-blocking
2634 casgstatus(gp, _Gwaiting, _Grunnable)
2636 traceGoUnpark(gp, 0)
2638 return gp, false, false
2642 // Spinning Ms: steal work from other Ps.
2644 // Limit the number of spinning Ms to half the number of busy Ps.
2645 // This is necessary to prevent excessive CPU consumption when
2646 // GOMAXPROCS>>1 but the program parallelism is low.
2647 if mp.spinning || 2*sched.nmspinning.Load() < gomaxprocs-sched.npidle.Load() {
2650 sched.nmspinning.Add(1)
2653 gp, inheritTime, tnow, w, newWork := stealWork(now)
2655 // Successfully stole.
2656 return gp, inheritTime, false
2659 // There may be new timer or GC work; restart to
2665 if w != 0 && (pollUntil == 0 || w < pollUntil) {
2666 // Earlier timer to wait for.
2671 // We have nothing to do.
2673 // If we're in the GC mark phase, can safely scan and blacken objects,
2674 // and have work to do, run idle-time marking rather than give up the P.
2675 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) && gcController.addIdleMarkWorker() {
2676 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
2678 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
2680 casgstatus(gp, _Gwaiting, _Grunnable)
2682 traceGoUnpark(gp, 0)
2684 return gp, false, false
2686 gcController.removeIdleMarkWorker()
2690 // If a callback returned and no other goroutine is awake,
2691 // then wake event handler goroutine which pauses execution
2692 // until a callback was triggered.
2693 gp, otherReady := beforeIdle(now, pollUntil)
2695 casgstatus(gp, _Gwaiting, _Grunnable)
2697 traceGoUnpark(gp, 0)
2699 return gp, false, false
2705 // Before we drop our P, make a snapshot of the allp slice,
2706 // which can change underfoot once we no longer block
2707 // safe-points. We don't need to snapshot the contents because
2708 // everything up to cap(allp) is immutable.
2709 allpSnapshot := allp
2710 // Also snapshot masks. Value changes are OK, but we can't allow
2711 // len to change out from under us.
2712 idlepMaskSnapshot := idlepMask
2713 timerpMaskSnapshot := timerpMask
2715 // return P and block
2717 if sched.gcwaiting.Load() || pp.runSafePointFn != 0 {
2721 if sched.runqsize != 0 {
2722 gp := globrunqget(pp, 0)
2724 return gp, false, false
2726 if releasep() != pp {
2727 throw("findrunnable: wrong p")
2729 now = pidleput(pp, now)
2732 // Delicate dance: thread transitions from spinning to non-spinning
2733 // state, potentially concurrently with submission of new work. We must
2734 // drop nmspinning first and then check all sources again (with
2735 // #StoreLoad memory barrier in between). If we do it the other way
2736 // around, another thread can submit work after we've checked all
2737 // sources but before we drop nmspinning; as a result nobody will
2738 // unpark a thread to run the work.
2740 // This applies to the following sources of work:
2742 // * Goroutines added to a per-P run queue.
2743 // * New/modified-earlier timers on a per-P timer heap.
2744 // * Idle-priority GC work (barring golang.org/issue/19112).
2746 // If we discover new work below, we need to restore m.spinning as a signal
2747 // for resetspinning to unpark a new worker thread (because there can be more
2748 // than one starving goroutine). However, if after discovering new work
2749 // we also observe no idle Ps it is OK to skip unparking a new worker
2750 // thread: the system is fully loaded so no spinning threads are required.
2751 // Also see "Worker thread parking/unparking" comment at the top of the file.
2752 wasSpinning := mp.spinning
2755 if sched.nmspinning.Add(-1) < 0 {
2756 throw("findrunnable: negative nmspinning")
2759 // Note the for correctness, only the last M transitioning from
2760 // spinning to non-spinning must perform these rechecks to
2761 // ensure no missed work. We are performing it on every M that
2762 // transitions as a conservative change to monitor effects on
2763 // latency. See golang.org/issue/43997.
2765 // Check all runqueues once again.
2766 pp := checkRunqsNoP(allpSnapshot, idlepMaskSnapshot)
2770 sched.nmspinning.Add(1)
2774 // Check for idle-priority GC work again.
2775 pp, gp := checkIdleGCNoP()
2779 sched.nmspinning.Add(1)
2781 // Run the idle worker.
2782 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
2783 casgstatus(gp, _Gwaiting, _Grunnable)
2785 traceGoUnpark(gp, 0)
2787 return gp, false, false
2790 // Finally, check for timer creation or expiry concurrently with
2791 // transitioning from spinning to non-spinning.
2793 // Note that we cannot use checkTimers here because it calls
2794 // adjusttimers which may need to allocate memory, and that isn't
2795 // allowed when we don't have an active P.
2796 pollUntil = checkTimersNoP(allpSnapshot, timerpMaskSnapshot, pollUntil)
2799 // Poll network until next timer.
2800 if netpollinited() && (atomic.Load(&netpollWaiters) > 0 || pollUntil != 0) && sched.lastpoll.Swap(0) != 0 {
2801 sched.pollUntil.Store(pollUntil)
2803 throw("findrunnable: netpoll with p")
2806 throw("findrunnable: netpoll with spinning")
2812 delay = pollUntil - now
2818 // When using fake time, just poll.
2821 list := netpoll(delay) // block until new work is available
2822 sched.pollUntil.Store(0)
2823 sched.lastpoll.Store(now)
2824 if faketime != 0 && list.empty() {
2825 // Using fake time and nothing is ready; stop M.
2826 // When all M's stop, checkdead will call timejump.
2831 pp, _ := pidleget(now)
2840 casgstatus(gp, _Gwaiting, _Grunnable)
2842 traceGoUnpark(gp, 0)
2844 return gp, false, false
2848 sched.nmspinning.Add(1)
2852 } else if pollUntil != 0 && netpollinited() {
2853 pollerPollUntil := sched.pollUntil.Load()
2854 if pollerPollUntil == 0 || pollerPollUntil > pollUntil {
2862 // pollWork reports whether there is non-background work this P could
2863 // be doing. This is a fairly lightweight check to be used for
2864 // background work loops, like idle GC. It checks a subset of the
2865 // conditions checked by the actual scheduler.
2866 func pollWork() bool {
2867 if sched.runqsize != 0 {
2870 p := getg().m.p.ptr()
2874 if netpollinited() && atomic.Load(&netpollWaiters) > 0 && sched.lastpoll.Load() != 0 {
2875 if list := netpoll(0); !list.empty() {
2883 // stealWork attempts to steal a runnable goroutine or timer from any P.
2885 // If newWork is true, new work may have been readied.
2887 // If now is not 0 it is the current time. stealWork returns the passed time or
2888 // the current time if now was passed as 0.
2889 func stealWork(now int64) (gp *g, inheritTime bool, rnow, pollUntil int64, newWork bool) {
2890 pp := getg().m.p.ptr()
2894 const stealTries = 4
2895 for i := 0; i < stealTries; i++ {
2896 stealTimersOrRunNextG := i == stealTries-1
2898 for enum := stealOrder.start(fastrand()); !enum.done(); enum.next() {
2899 if sched.gcwaiting.Load() {
2900 // GC work may be available.
2901 return nil, false, now, pollUntil, true
2903 p2 := allp[enum.position()]
2908 // Steal timers from p2. This call to checkTimers is the only place
2909 // where we might hold a lock on a different P's timers. We do this
2910 // once on the last pass before checking runnext because stealing
2911 // from the other P's runnext should be the last resort, so if there
2912 // are timers to steal do that first.
2914 // We only check timers on one of the stealing iterations because
2915 // the time stored in now doesn't change in this loop and checking
2916 // the timers for each P more than once with the same value of now
2917 // is probably a waste of time.
2919 // timerpMask tells us whether the P may have timers at all. If it
2920 // can't, no need to check at all.
2921 if stealTimersOrRunNextG && timerpMask.read(enum.position()) {
2922 tnow, w, ran := checkTimers(p2, now)
2924 if w != 0 && (pollUntil == 0 || w < pollUntil) {
2928 // Running the timers may have
2929 // made an arbitrary number of G's
2930 // ready and added them to this P's
2931 // local run queue. That invalidates
2932 // the assumption of runqsteal
2933 // that it always has room to add
2934 // stolen G's. So check now if there
2935 // is a local G to run.
2936 if gp, inheritTime := runqget(pp); gp != nil {
2937 return gp, inheritTime, now, pollUntil, ranTimer
2943 // Don't bother to attempt to steal if p2 is idle.
2944 if !idlepMask.read(enum.position()) {
2945 if gp := runqsteal(pp, p2, stealTimersOrRunNextG); gp != nil {
2946 return gp, false, now, pollUntil, ranTimer
2952 // No goroutines found to steal. Regardless, running a timer may have
2953 // made some goroutine ready that we missed. Indicate the next timer to
2955 return nil, false, now, pollUntil, ranTimer
2958 // Check all Ps for a runnable G to steal.
2960 // On entry we have no P. If a G is available to steal and a P is available,
2961 // the P is returned which the caller should acquire and attempt to steal the
2963 func checkRunqsNoP(allpSnapshot []*p, idlepMaskSnapshot pMask) *p {
2964 for id, p2 := range allpSnapshot {
2965 if !idlepMaskSnapshot.read(uint32(id)) && !runqempty(p2) {
2967 pp, _ := pidleget(0)
2973 // Can't get a P, don't bother checking remaining Ps.
2981 // Check all Ps for a timer expiring sooner than pollUntil.
2983 // Returns updated pollUntil value.
2984 func checkTimersNoP(allpSnapshot []*p, timerpMaskSnapshot pMask, pollUntil int64) int64 {
2985 for id, p2 := range allpSnapshot {
2986 if timerpMaskSnapshot.read(uint32(id)) {
2987 w := nobarrierWakeTime(p2)
2988 if w != 0 && (pollUntil == 0 || w < pollUntil) {
2997 // Check for idle-priority GC, without a P on entry.
2999 // If some GC work, a P, and a worker G are all available, the P and G will be
3000 // returned. The returned P has not been wired yet.
3001 func checkIdleGCNoP() (*p, *g) {
3002 // N.B. Since we have no P, gcBlackenEnabled may change at any time; we
3003 // must check again after acquiring a P. As an optimization, we also check
3004 // if an idle mark worker is needed at all. This is OK here, because if we
3005 // observe that one isn't needed, at least one is currently running. Even if
3006 // it stops running, its own journey into the scheduler should schedule it
3007 // again, if need be (at which point, this check will pass, if relevant).
3008 if atomic.Load(&gcBlackenEnabled) == 0 || !gcController.needIdleMarkWorker() {
3011 if !gcMarkWorkAvailable(nil) {
3015 // Work is available; we can start an idle GC worker only if there is
3016 // an available P and available worker G.
3018 // We can attempt to acquire these in either order, though both have
3019 // synchronization concerns (see below). Workers are almost always
3020 // available (see comment in findRunnableGCWorker for the one case
3021 // there may be none). Since we're slightly less likely to find a P,
3022 // check for that first.
3024 // Synchronization: note that we must hold sched.lock until we are
3025 // committed to keeping it. Otherwise we cannot put the unnecessary P
3026 // back in sched.pidle without performing the full set of idle
3027 // transition checks.
3029 // If we were to check gcBgMarkWorkerPool first, we must somehow handle
3030 // the assumption in gcControllerState.findRunnableGCWorker that an
3031 // empty gcBgMarkWorkerPool is only possible if gcMarkDone is running.
3033 pp, now := pidleget(0)
3039 // Now that we own a P, gcBlackenEnabled can't change (as it requires STW).
3040 if gcBlackenEnabled == 0 || !gcController.addIdleMarkWorker() {
3046 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
3050 gcController.removeIdleMarkWorker()
3056 return pp, node.gp.ptr()
3059 // wakeNetPoller wakes up the thread sleeping in the network poller if it isn't
3060 // going to wake up before the when argument; or it wakes an idle P to service
3061 // timers and the network poller if there isn't one already.
3062 func wakeNetPoller(when int64) {
3063 if sched.lastpoll.Load() == 0 {
3064 // In findrunnable we ensure that when polling the pollUntil
3065 // field is either zero or the time to which the current
3066 // poll is expected to run. This can have a spurious wakeup
3067 // but should never miss a wakeup.
3068 pollerPollUntil := sched.pollUntil.Load()
3069 if pollerPollUntil == 0 || pollerPollUntil > when {
3073 // There are no threads in the network poller, try to get
3074 // one there so it can handle new timers.
3075 if GOOS != "plan9" { // Temporary workaround - see issue #42303.
3081 func resetspinning() {
3084 throw("resetspinning: not a spinning m")
3086 gp.m.spinning = false
3087 nmspinning := sched.nmspinning.Add(-1)
3089 throw("findrunnable: negative nmspinning")
3091 // M wakeup policy is deliberately somewhat conservative, so check if we
3092 // need to wakeup another P here. See "Worker thread parking/unparking"
3093 // comment at the top of the file for details.
3097 // injectglist adds each runnable G on the list to some run queue,
3098 // and clears glist. If there is no current P, they are added to the
3099 // global queue, and up to npidle M's are started to run them.
3100 // Otherwise, for each idle P, this adds a G to the global queue
3101 // and starts an M. Any remaining G's are added to the current P's
3103 // This may temporarily acquire sched.lock.
3104 // Can run concurrently with GC.
3105 func injectglist(glist *gList) {
3110 for gp := glist.head.ptr(); gp != nil; gp = gp.schedlink.ptr() {
3111 traceGoUnpark(gp, 0)
3115 // Mark all the goroutines as runnable before we put them
3116 // on the run queues.
3117 head := glist.head.ptr()
3120 for gp := head; gp != nil; gp = gp.schedlink.ptr() {
3123 casgstatus(gp, _Gwaiting, _Grunnable)
3126 // Turn the gList into a gQueue.
3132 startIdle := func(n int) {
3133 for ; n != 0 && sched.npidle.Load() != 0; n-- {
3138 pp := getg().m.p.ptr()
3141 globrunqputbatch(&q, int32(qsize))
3147 npidle := int(sched.npidle.Load())
3150 for n = 0; n < npidle && !q.empty(); n++ {
3156 globrunqputbatch(&globq, int32(n))
3163 runqputbatch(pp, &q, qsize)
3167 // One round of scheduler: find a runnable goroutine and execute it.
3173 throw("schedule: holding locks")
3176 if mp.lockedg != 0 {
3178 execute(mp.lockedg.ptr(), false) // Never returns.
3181 // We should not schedule away from a g that is executing a cgo call,
3182 // since the cgo call is using the m's g0 stack.
3184 throw("schedule: in cgo")
3191 // Safety check: if we are spinning, the run queue should be empty.
3192 // Check this before calling checkTimers, as that might call
3193 // goready to put a ready goroutine on the local run queue.
3194 if mp.spinning && (pp.runnext != 0 || pp.runqhead != pp.runqtail) {
3195 throw("schedule: spinning with local work")
3198 gp, inheritTime, tryWakeP := findRunnable() // blocks until work is available
3200 // This thread is going to run a goroutine and is not spinning anymore,
3201 // so if it was marked as spinning we need to reset it now and potentially
3202 // start a new spinning M.
3207 if sched.disable.user && !schedEnabled(gp) {
3208 // Scheduling of this goroutine is disabled. Put it on
3209 // the list of pending runnable goroutines for when we
3210 // re-enable user scheduling and look again.
3212 if schedEnabled(gp) {
3213 // Something re-enabled scheduling while we
3214 // were acquiring the lock.
3217 sched.disable.runnable.pushBack(gp)
3224 // If about to schedule a not-normal goroutine (a GCworker or tracereader),
3225 // wake a P if there is one.
3229 if gp.lockedm != 0 {
3230 // Hands off own p to the locked m,
3231 // then blocks waiting for a new p.
3236 execute(gp, inheritTime)
3239 // dropg removes the association between m and the current goroutine m->curg (gp for short).
3240 // Typically a caller sets gp's status away from Grunning and then
3241 // immediately calls dropg to finish the job. The caller is also responsible
3242 // for arranging that gp will be restarted using ready at an
3243 // appropriate time. After calling dropg and arranging for gp to be
3244 // readied later, the caller can do other work but eventually should
3245 // call schedule to restart the scheduling of goroutines on this m.
3249 setMNoWB(&gp.m.curg.m, nil)
3250 setGNoWB(&gp.m.curg, nil)
3253 // checkTimers runs any timers for the P that are ready.
3254 // If now is not 0 it is the current time.
3255 // It returns the passed time or the current time if now was passed as 0.
3256 // and the time when the next timer should run or 0 if there is no next timer,
3257 // and reports whether it ran any timers.
3258 // If the time when the next timer should run is not 0,
3259 // it is always larger than the returned time.
3260 // We pass now in and out to avoid extra calls of nanotime.
3262 //go:yeswritebarrierrec
3263 func checkTimers(pp *p, now int64) (rnow, pollUntil int64, ran bool) {
3264 // If it's not yet time for the first timer, or the first adjusted
3265 // timer, then there is nothing to do.
3266 next := int64(atomic.Load64(&pp.timer0When))
3267 nextAdj := int64(atomic.Load64(&pp.timerModifiedEarliest))
3268 if next == 0 || (nextAdj != 0 && nextAdj < next) {
3273 // No timers to run or adjust.
3274 return now, 0, false
3281 // Next timer is not ready to run, but keep going
3282 // if we would clear deleted timers.
3283 // This corresponds to the condition below where
3284 // we decide whether to call clearDeletedTimers.
3285 if pp != getg().m.p.ptr() || int(atomic.Load(&pp.deletedTimers)) <= int(atomic.Load(&pp.numTimers)/4) {
3286 return now, next, false
3290 lock(&pp.timersLock)
3292 if len(pp.timers) > 0 {
3293 adjusttimers(pp, now)
3294 for len(pp.timers) > 0 {
3295 // Note that runtimer may temporarily unlock
3297 if tw := runtimer(pp, now); tw != 0 {
3307 // If this is the local P, and there are a lot of deleted timers,
3308 // clear them out. We only do this for the local P to reduce
3309 // lock contention on timersLock.
3310 if pp == getg().m.p.ptr() && int(atomic.Load(&pp.deletedTimers)) > len(pp.timers)/4 {
3311 clearDeletedTimers(pp)
3314 unlock(&pp.timersLock)
3316 return now, pollUntil, ran
3319 func parkunlock_c(gp *g, lock unsafe.Pointer) bool {
3320 unlock((*mutex)(lock))
3324 // park continuation on g0.
3325 func park_m(gp *g) {
3329 traceGoPark(mp.waittraceev, mp.waittraceskip)
3332 casgstatus(gp, _Grunning, _Gwaiting)
3335 if fn := mp.waitunlockf; fn != nil {
3336 ok := fn(gp, mp.waitlock)
3337 mp.waitunlockf = nil
3341 traceGoUnpark(gp, 2)
3343 casgstatus(gp, _Gwaiting, _Grunnable)
3344 execute(gp, true) // Schedule it back, never returns.
3350 func goschedImpl(gp *g) {
3351 status := readgstatus(gp)
3352 if status&^_Gscan != _Grunning {
3354 throw("bad g status")
3356 casgstatus(gp, _Grunning, _Grunnable)
3365 // Gosched continuation on g0.
3366 func gosched_m(gp *g) {
3373 // goschedguarded is a forbidden-states-avoided version of gosched_m
3374 func goschedguarded_m(gp *g) {
3376 if !canPreemptM(gp.m) {
3377 gogo(&gp.sched) // never return
3386 func gopreempt_m(gp *g) {
3393 // preemptPark parks gp and puts it in _Gpreempted.
3396 func preemptPark(gp *g) {
3398 traceGoPark(traceEvGoBlock, 0)
3400 status := readgstatus(gp)
3401 if status&^_Gscan != _Grunning {
3403 throw("bad g status")
3405 gp.waitreason = waitReasonPreempted
3407 if gp.asyncSafePoint {
3408 // Double-check that async preemption does not
3409 // happen in SPWRITE assembly functions.
3410 // isAsyncSafePoint must exclude this case.
3411 f := findfunc(gp.sched.pc)
3413 throw("preempt at unknown pc")
3415 if f.flag&funcFlag_SPWRITE != 0 {
3416 println("runtime: unexpected SPWRITE function", funcname(f), "in async preempt")
3417 throw("preempt SPWRITE")
3421 // Transition from _Grunning to _Gscan|_Gpreempted. We can't
3422 // be in _Grunning when we dropg because then we'd be running
3423 // without an M, but the moment we're in _Gpreempted,
3424 // something could claim this G before we've fully cleaned it
3425 // up. Hence, we set the scan bit to lock down further
3426 // transitions until we can dropg.
3427 casGToPreemptScan(gp, _Grunning, _Gscan|_Gpreempted)
3429 casfrom_Gscanstatus(gp, _Gscan|_Gpreempted, _Gpreempted)
3433 // goyield is like Gosched, but it:
3434 // - emits a GoPreempt trace event instead of a GoSched trace event
3435 // - puts the current G on the runq of the current P instead of the globrunq
3441 func goyield_m(gp *g) {
3446 casgstatus(gp, _Grunning, _Grunnable)
3448 runqput(pp, gp, false)
3452 // Finishes execution of the current goroutine.
3463 // goexit continuation on g0.
3464 func goexit0(gp *g) {
3468 casgstatus(gp, _Grunning, _Gdead)
3469 gcController.addScannableStack(pp, -int64(gp.stack.hi-gp.stack.lo))
3470 if isSystemGoroutine(gp, false) {
3474 locked := gp.lockedm != 0
3477 gp.preemptStop = false
3478 gp.paniconfault = false
3479 gp._defer = nil // should be true already but just in case.
3480 gp._panic = nil // non-nil for Goexit during panic. points at stack-allocated data.
3487 if gcBlackenEnabled != 0 && gp.gcAssistBytes > 0 {
3488 // Flush assist credit to the global pool. This gives
3489 // better information to pacing if the application is
3490 // rapidly creating an exiting goroutines.
3491 assistWorkPerByte := gcController.assistWorkPerByte.Load()
3492 scanCredit := int64(assistWorkPerByte * float64(gp.gcAssistBytes))
3493 gcController.bgScanCredit.Add(scanCredit)
3494 gp.gcAssistBytes = 0
3499 if GOARCH == "wasm" { // no threads yet on wasm
3501 schedule() // never returns
3504 if mp.lockedInt != 0 {
3505 print("invalid m->lockedInt = ", mp.lockedInt, "\n")
3506 throw("internal lockOSThread error")
3510 // The goroutine may have locked this thread because
3511 // it put it in an unusual kernel state. Kill it
3512 // rather than returning it to the thread pool.
3514 // Return to mstart, which will release the P and exit
3516 if GOOS != "plan9" { // See golang.org/issue/22227.
3519 // Clear lockedExt on plan9 since we may end up re-using
3527 // save updates getg().sched to refer to pc and sp so that a following
3528 // gogo will restore pc and sp.
3530 // save must not have write barriers because invoking a write barrier
3531 // can clobber getg().sched.
3534 //go:nowritebarrierrec
3535 func save(pc, sp uintptr) {
3538 if gp == gp.m.g0 || gp == gp.m.gsignal {
3539 // m.g0.sched is special and must describe the context
3540 // for exiting the thread. mstart1 writes to it directly.
3541 // m.gsignal.sched should not be used at all.
3542 // This check makes sure save calls do not accidentally
3543 // run in contexts where they'd write to system g's.
3544 throw("save on system g not allowed")
3551 // We need to ensure ctxt is zero, but can't have a write
3552 // barrier here. However, it should always already be zero.
3554 if gp.sched.ctxt != nil {
3559 // The goroutine g is about to enter a system call.
3560 // Record that it's not using the cpu anymore.
3561 // This is called only from the go syscall library and cgocall,
3562 // not from the low-level system calls used by the runtime.
3564 // Entersyscall cannot split the stack: the save must
3565 // make g->sched refer to the caller's stack segment, because
3566 // entersyscall is going to return immediately after.
3568 // Nothing entersyscall calls can split the stack either.
3569 // We cannot safely move the stack during an active call to syscall,
3570 // because we do not know which of the uintptr arguments are
3571 // really pointers (back into the stack).
3572 // In practice, this means that we make the fast path run through
3573 // entersyscall doing no-split things, and the slow path has to use systemstack
3574 // to run bigger things on the system stack.
3576 // reentersyscall is the entry point used by cgo callbacks, where explicitly
3577 // saved SP and PC are restored. This is needed when exitsyscall will be called
3578 // from a function further up in the call stack than the parent, as g->syscallsp
3579 // must always point to a valid stack frame. entersyscall below is the normal
3580 // entry point for syscalls, which obtains the SP and PC from the caller.
3583 // At the start of a syscall we emit traceGoSysCall to capture the stack trace.
3584 // If the syscall does not block, that is it, we do not emit any other events.
3585 // If the syscall blocks (that is, P is retaken), retaker emits traceGoSysBlock;
3586 // when syscall returns we emit traceGoSysExit and when the goroutine starts running
3587 // (potentially instantly, if exitsyscallfast returns true) we emit traceGoStart.
3588 // To ensure that traceGoSysExit is emitted strictly after traceGoSysBlock,
3589 // we remember current value of syscalltick in m (gp.m.syscalltick = gp.m.p.ptr().syscalltick),
3590 // whoever emits traceGoSysBlock increments p.syscalltick afterwards;
3591 // and we wait for the increment before emitting traceGoSysExit.
3592 // Note that the increment is done even if tracing is not enabled,
3593 // because tracing can be enabled in the middle of syscall. We don't want the wait to hang.
3596 func reentersyscall(pc, sp uintptr) {
3599 // Disable preemption because during this function g is in Gsyscall status,
3600 // but can have inconsistent g->sched, do not let GC observe it.
3603 // Entersyscall must not call any function that might split/grow the stack.
3604 // (See details in comment above.)
3605 // Catch calls that might, by replacing the stack guard with something that
3606 // will trip any stack check and leaving a flag to tell newstack to die.
3607 gp.stackguard0 = stackPreempt
3608 gp.throwsplit = true
3610 // Leave SP around for GC and traceback.
3614 casgstatus(gp, _Grunning, _Gsyscall)
3615 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3616 systemstack(func() {
3617 print("entersyscall inconsistent ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3618 throw("entersyscall")
3623 systemstack(traceGoSysCall)
3624 // systemstack itself clobbers g.sched.{pc,sp} and we might
3625 // need them later when the G is genuinely blocked in a
3630 if sched.sysmonwait.Load() {
3631 systemstack(entersyscall_sysmon)
3635 if gp.m.p.ptr().runSafePointFn != 0 {
3636 // runSafePointFn may stack split if run on this stack
3637 systemstack(runSafePointFn)
3641 gp.m.syscalltick = gp.m.p.ptr().syscalltick
3642 gp.sysblocktraced = true
3647 atomic.Store(&pp.status, _Psyscall)
3648 if sched.gcwaiting.Load() {
3649 systemstack(entersyscall_gcwait)
3656 // Standard syscall entry used by the go syscall library and normal cgo calls.
3658 // This is exported via linkname to assembly in the syscall package and x/sys.
3661 //go:linkname entersyscall
3662 func entersyscall() {
3663 reentersyscall(getcallerpc(), getcallersp())
3666 func entersyscall_sysmon() {
3668 if sched.sysmonwait.Load() {
3669 sched.sysmonwait.Store(false)
3670 notewakeup(&sched.sysmonnote)
3675 func entersyscall_gcwait() {
3677 pp := gp.m.oldp.ptr()
3680 if sched.stopwait > 0 && atomic.Cas(&pp.status, _Psyscall, _Pgcstop) {
3686 if sched.stopwait--; sched.stopwait == 0 {
3687 notewakeup(&sched.stopnote)
3693 // The same as entersyscall(), but with a hint that the syscall is blocking.
3696 func entersyscallblock() {
3699 gp.m.locks++ // see comment in entersyscall
3700 gp.throwsplit = true
3701 gp.stackguard0 = stackPreempt // see comment in entersyscall
3702 gp.m.syscalltick = gp.m.p.ptr().syscalltick
3703 gp.sysblocktraced = true
3704 gp.m.p.ptr().syscalltick++
3706 // Leave SP around for GC and traceback.
3710 gp.syscallsp = gp.sched.sp
3711 gp.syscallpc = gp.sched.pc
3712 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3716 systemstack(func() {
3717 print("entersyscallblock inconsistent ", hex(sp1), " ", hex(sp2), " ", hex(sp3), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3718 throw("entersyscallblock")
3721 casgstatus(gp, _Grunning, _Gsyscall)
3722 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3723 systemstack(func() {
3724 print("entersyscallblock inconsistent ", hex(sp), " ", hex(gp.sched.sp), " ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3725 throw("entersyscallblock")
3729 systemstack(entersyscallblock_handoff)
3731 // Resave for traceback during blocked call.
3732 save(getcallerpc(), getcallersp())
3737 func entersyscallblock_handoff() {
3740 traceGoSysBlock(getg().m.p.ptr())
3742 handoffp(releasep())
3745 // The goroutine g exited its system call.
3746 // Arrange for it to run on a cpu again.
3747 // This is called only from the go syscall library, not
3748 // from the low-level system calls used by the runtime.
3750 // Write barriers are not allowed because our P may have been stolen.
3752 // This is exported via linkname to assembly in the syscall package.
3755 //go:nowritebarrierrec
3756 //go:linkname exitsyscall
3757 func exitsyscall() {
3760 gp.m.locks++ // see comment in entersyscall
3761 if getcallersp() > gp.syscallsp {
3762 throw("exitsyscall: syscall frame is no longer valid")
3766 oldp := gp.m.oldp.ptr()
3768 if exitsyscallfast(oldp) {
3769 // When exitsyscallfast returns success, we have a P so can now use
3771 if goroutineProfile.active {
3772 // Make sure that gp has had its stack written out to the goroutine
3773 // profile, exactly as it was when the goroutine profiler first
3774 // stopped the world.
3775 systemstack(func() {
3776 tryRecordGoroutineProfileWB(gp)
3780 if oldp != gp.m.p.ptr() || gp.m.syscalltick != gp.m.p.ptr().syscalltick {
3781 systemstack(traceGoStart)
3784 // There's a cpu for us, so we can run.
3785 gp.m.p.ptr().syscalltick++
3786 // We need to cas the status and scan before resuming...
3787 casgstatus(gp, _Gsyscall, _Grunning)
3789 // Garbage collector isn't running (since we are),
3790 // so okay to clear syscallsp.
3794 // restore the preemption request in case we've cleared it in newstack
3795 gp.stackguard0 = stackPreempt
3797 // otherwise restore the real _StackGuard, we've spoiled it in entersyscall/entersyscallblock
3798 gp.stackguard0 = gp.stack.lo + _StackGuard
3800 gp.throwsplit = false
3802 if sched.disable.user && !schedEnabled(gp) {
3803 // Scheduling of this goroutine is disabled.
3812 // Wait till traceGoSysBlock event is emitted.
3813 // This ensures consistency of the trace (the goroutine is started after it is blocked).
3814 for oldp != nil && oldp.syscalltick == gp.m.syscalltick {
3817 // We can't trace syscall exit right now because we don't have a P.
3818 // Tracing code can invoke write barriers that cannot run without a P.
3819 // So instead we remember the syscall exit time and emit the event
3820 // in execute when we have a P.
3821 gp.sysexitticks = cputicks()
3826 // Call the scheduler.
3829 // Scheduler returned, so we're allowed to run now.
3830 // Delete the syscallsp information that we left for
3831 // the garbage collector during the system call.
3832 // Must wait until now because until gosched returns
3833 // we don't know for sure that the garbage collector
3836 gp.m.p.ptr().syscalltick++
3837 gp.throwsplit = false
3841 func exitsyscallfast(oldp *p) bool {
3844 // Freezetheworld sets stopwait but does not retake P's.
3845 if sched.stopwait == freezeStopWait {
3849 // Try to re-acquire the last P.
3850 if oldp != nil && oldp.status == _Psyscall && atomic.Cas(&oldp.status, _Psyscall, _Pidle) {
3851 // There's a cpu for us, so we can run.
3853 exitsyscallfast_reacquired()
3857 // Try to get any other idle P.
3858 if sched.pidle != 0 {
3860 systemstack(func() {
3861 ok = exitsyscallfast_pidle()
3862 if ok && trace.enabled {
3864 // Wait till traceGoSysBlock event is emitted.
3865 // This ensures consistency of the trace (the goroutine is started after it is blocked).
3866 for oldp.syscalltick == gp.m.syscalltick {
3880 // exitsyscallfast_reacquired is the exitsyscall path on which this G
3881 // has successfully reacquired the P it was running on before the
3885 func exitsyscallfast_reacquired() {
3887 if gp.m.syscalltick != gp.m.p.ptr().syscalltick {
3889 // The p was retaken and then enter into syscall again (since gp.m.syscalltick has changed).
3890 // traceGoSysBlock for this syscall was already emitted,
3891 // but here we effectively retake the p from the new syscall running on the same p.
3892 systemstack(func() {
3893 // Denote blocking of the new syscall.
3894 traceGoSysBlock(gp.m.p.ptr())
3895 // Denote completion of the current syscall.
3899 gp.m.p.ptr().syscalltick++
3903 func exitsyscallfast_pidle() bool {
3905 pp, _ := pidleget(0)
3906 if pp != nil && sched.sysmonwait.Load() {
3907 sched.sysmonwait.Store(false)
3908 notewakeup(&sched.sysmonnote)
3918 // exitsyscall slow path on g0.
3919 // Failed to acquire P, enqueue gp as runnable.
3921 // Called via mcall, so gp is the calling g from this M.
3923 //go:nowritebarrierrec
3924 func exitsyscall0(gp *g) {
3925 casgstatus(gp, _Gsyscall, _Grunnable)
3929 if schedEnabled(gp) {
3936 // Below, we stoplockedm if gp is locked. globrunqput releases
3937 // ownership of gp, so we must check if gp is locked prior to
3938 // committing the release by unlocking sched.lock, otherwise we
3939 // could race with another M transitioning gp from unlocked to
3941 locked = gp.lockedm != 0
3942 } else if sched.sysmonwait.Load() {
3943 sched.sysmonwait.Store(false)
3944 notewakeup(&sched.sysmonnote)
3949 execute(gp, false) // Never returns.
3952 // Wait until another thread schedules gp and so m again.
3954 // N.B. lockedm must be this M, as this g was running on this M
3955 // before entersyscall.
3957 execute(gp, false) // Never returns.
3960 schedule() // Never returns.
3963 // Called from syscall package before fork.
3965 //go:linkname syscall_runtime_BeforeFork syscall.runtime_BeforeFork
3967 func syscall_runtime_BeforeFork() {
3970 // Block signals during a fork, so that the child does not run
3971 // a signal handler before exec if a signal is sent to the process
3972 // group. See issue #18600.
3974 sigsave(&gp.m.sigmask)
3977 // This function is called before fork in syscall package.
3978 // Code between fork and exec must not allocate memory nor even try to grow stack.
3979 // Here we spoil g->_StackGuard to reliably detect any attempts to grow stack.
3980 // runtime_AfterFork will undo this in parent process, but not in child.
3981 gp.stackguard0 = stackFork
3984 // Called from syscall package after fork in parent.
3986 //go:linkname syscall_runtime_AfterFork syscall.runtime_AfterFork
3988 func syscall_runtime_AfterFork() {
3991 // See the comments in beforefork.
3992 gp.stackguard0 = gp.stack.lo + _StackGuard
3994 msigrestore(gp.m.sigmask)
3999 // inForkedChild is true while manipulating signals in the child process.
4000 // This is used to avoid calling libc functions in case we are using vfork.
4001 var inForkedChild bool
4003 // Called from syscall package after fork in child.
4004 // It resets non-sigignored signals to the default handler, and
4005 // restores the signal mask in preparation for the exec.
4007 // Because this might be called during a vfork, and therefore may be
4008 // temporarily sharing address space with the parent process, this must
4009 // not change any global variables or calling into C code that may do so.
4011 //go:linkname syscall_runtime_AfterForkInChild syscall.runtime_AfterForkInChild
4013 //go:nowritebarrierrec
4014 func syscall_runtime_AfterForkInChild() {
4015 // It's OK to change the global variable inForkedChild here
4016 // because we are going to change it back. There is no race here,
4017 // because if we are sharing address space with the parent process,
4018 // then the parent process can not be running concurrently.
4019 inForkedChild = true
4021 clearSignalHandlers()
4023 // When we are the child we are the only thread running,
4024 // so we know that nothing else has changed gp.m.sigmask.
4025 msigrestore(getg().m.sigmask)
4027 inForkedChild = false
4030 // pendingPreemptSignals is the number of preemption signals
4031 // that have been sent but not received. This is only used on Darwin.
4033 var pendingPreemptSignals atomic.Int32
4035 // Called from syscall package before Exec.
4037 //go:linkname syscall_runtime_BeforeExec syscall.runtime_BeforeExec
4038 func syscall_runtime_BeforeExec() {
4039 // Prevent thread creation during exec.
4042 // On Darwin, wait for all pending preemption signals to
4043 // be received. See issue #41702.
4044 if GOOS == "darwin" || GOOS == "ios" {
4045 for pendingPreemptSignals.Load() > 0 {
4051 // Called from syscall package after Exec.
4053 //go:linkname syscall_runtime_AfterExec syscall.runtime_AfterExec
4054 func syscall_runtime_AfterExec() {
4058 // Allocate a new g, with a stack big enough for stacksize bytes.
4059 func malg(stacksize int32) *g {
4062 stacksize = round2(_StackSystem + stacksize)
4063 systemstack(func() {
4064 newg.stack = stackalloc(uint32(stacksize))
4066 newg.stackguard0 = newg.stack.lo + _StackGuard
4067 newg.stackguard1 = ^uintptr(0)
4068 // Clear the bottom word of the stack. We record g
4069 // there on gsignal stack during VDSO on ARM and ARM64.
4070 *(*uintptr)(unsafe.Pointer(newg.stack.lo)) = 0
4075 // Create a new g running fn.
4076 // Put it on the queue of g's waiting to run.
4077 // The compiler turns a go statement into a call to this.
4078 func newproc(fn *funcval) {
4081 systemstack(func() {
4082 newg := newproc1(fn, gp, pc)
4084 pp := getg().m.p.ptr()
4085 runqput(pp, newg, true)
4093 // Create a new g in state _Grunnable, starting at fn. callerpc is the
4094 // address of the go statement that created this. The caller is responsible
4095 // for adding the new g to the scheduler.
4096 func newproc1(fn *funcval, callergp *g, callerpc uintptr) *g {
4098 fatal("go of nil func value")
4101 mp := acquirem() // disable preemption because we hold M and P in local vars.
4105 newg = malg(_StackMin)
4106 casgstatus(newg, _Gidle, _Gdead)
4107 allgadd(newg) // publishes with a g->status of Gdead so GC scanner doesn't look at uninitialized stack.
4109 if newg.stack.hi == 0 {
4110 throw("newproc1: newg missing stack")
4113 if readgstatus(newg) != _Gdead {
4114 throw("newproc1: new g is not Gdead")
4117 totalSize := uintptr(4*goarch.PtrSize + sys.MinFrameSize) // extra space in case of reads slightly beyond frame
4118 totalSize = alignUp(totalSize, sys.StackAlign)
4119 sp := newg.stack.hi - totalSize
4123 *(*uintptr)(unsafe.Pointer(sp)) = 0
4125 spArg += sys.MinFrameSize
4128 memclrNoHeapPointers(unsafe.Pointer(&newg.sched), unsafe.Sizeof(newg.sched))
4131 newg.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum // +PCQuantum so that previous instruction is in same function
4132 newg.sched.g = guintptr(unsafe.Pointer(newg))
4133 gostartcallfn(&newg.sched, fn)
4134 newg.gopc = callerpc
4135 newg.ancestors = saveAncestors(callergp)
4136 newg.startpc = fn.fn
4137 if isSystemGoroutine(newg, false) {
4140 // Only user goroutines inherit pprof labels.
4142 newg.labels = mp.curg.labels
4144 if goroutineProfile.active {
4145 // A concurrent goroutine profile is running. It should include
4146 // exactly the set of goroutines that were alive when the goroutine
4147 // profiler first stopped the world. That does not include newg, so
4148 // mark it as not needing a profile before transitioning it from
4150 newg.goroutineProfiled.Store(goroutineProfileSatisfied)
4153 // Track initial transition?
4154 newg.trackingSeq = uint8(fastrand())
4155 if newg.trackingSeq%gTrackingPeriod == 0 {
4156 newg.tracking = true
4158 casgstatus(newg, _Gdead, _Grunnable)
4159 gcController.addScannableStack(pp, int64(newg.stack.hi-newg.stack.lo))
4161 if pp.goidcache == pp.goidcacheend {
4162 // Sched.goidgen is the last allocated id,
4163 // this batch must be [sched.goidgen+1, sched.goidgen+GoidCacheBatch].
4164 // At startup sched.goidgen=0, so main goroutine receives goid=1.
4165 pp.goidcache = sched.goidgen.Add(_GoidCacheBatch)
4166 pp.goidcache -= _GoidCacheBatch - 1
4167 pp.goidcacheend = pp.goidcache + _GoidCacheBatch
4169 newg.goid = pp.goidcache
4172 newg.racectx = racegostart(callerpc)
4173 if newg.labels != nil {
4174 // See note in proflabel.go on labelSync's role in synchronizing
4175 // with the reads in the signal handler.
4176 racereleasemergeg(newg, unsafe.Pointer(&labelSync))
4180 traceGoCreate(newg, newg.startpc)
4187 // saveAncestors copies previous ancestors of the given caller g and
4188 // includes infor for the current caller into a new set of tracebacks for
4189 // a g being created.
4190 func saveAncestors(callergp *g) *[]ancestorInfo {
4191 // Copy all prior info, except for the root goroutine (goid 0).
4192 if debug.tracebackancestors <= 0 || callergp.goid == 0 {
4195 var callerAncestors []ancestorInfo
4196 if callergp.ancestors != nil {
4197 callerAncestors = *callergp.ancestors
4199 n := int32(len(callerAncestors)) + 1
4200 if n > debug.tracebackancestors {
4201 n = debug.tracebackancestors
4203 ancestors := make([]ancestorInfo, n)
4204 copy(ancestors[1:], callerAncestors)
4206 var pcs [_TracebackMaxFrames]uintptr
4207 npcs := gcallers(callergp, 0, pcs[:])
4208 ipcs := make([]uintptr, npcs)
4210 ancestors[0] = ancestorInfo{
4212 goid: callergp.goid,
4213 gopc: callergp.gopc,
4216 ancestorsp := new([]ancestorInfo)
4217 *ancestorsp = ancestors
4221 // Put on gfree list.
4222 // If local list is too long, transfer a batch to the global list.
4223 func gfput(pp *p, gp *g) {
4224 if readgstatus(gp) != _Gdead {
4225 throw("gfput: bad status (not Gdead)")
4228 stksize := gp.stack.hi - gp.stack.lo
4230 if stksize != uintptr(startingStackSize) {
4231 // non-standard stack size - free it.
4240 if pp.gFree.n >= 64 {
4246 for pp.gFree.n >= 32 {
4247 gp := pp.gFree.pop()
4249 if gp.stack.lo == 0 {
4256 lock(&sched.gFree.lock)
4257 sched.gFree.noStack.pushAll(noStackQ)
4258 sched.gFree.stack.pushAll(stackQ)
4259 sched.gFree.n += inc
4260 unlock(&sched.gFree.lock)
4264 // Get from gfree list.
4265 // If local list is empty, grab a batch from global list.
4266 func gfget(pp *p) *g {
4268 if pp.gFree.empty() && (!sched.gFree.stack.empty() || !sched.gFree.noStack.empty()) {
4269 lock(&sched.gFree.lock)
4270 // Move a batch of free Gs to the P.
4271 for pp.gFree.n < 32 {
4272 // Prefer Gs with stacks.
4273 gp := sched.gFree.stack.pop()
4275 gp = sched.gFree.noStack.pop()
4284 unlock(&sched.gFree.lock)
4287 gp := pp.gFree.pop()
4292 if gp.stack.lo != 0 && gp.stack.hi-gp.stack.lo != uintptr(startingStackSize) {
4293 // Deallocate old stack. We kept it in gfput because it was the
4294 // right size when the goroutine was put on the free list, but
4295 // the right size has changed since then.
4296 systemstack(func() {
4303 if gp.stack.lo == 0 {
4304 // Stack was deallocated in gfput or just above. Allocate a new one.
4305 systemstack(func() {
4306 gp.stack = stackalloc(startingStackSize)
4308 gp.stackguard0 = gp.stack.lo + _StackGuard
4311 racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4314 msanmalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4317 asanunpoison(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4323 // Purge all cached G's from gfree list to the global list.
4324 func gfpurge(pp *p) {
4330 for !pp.gFree.empty() {
4331 gp := pp.gFree.pop()
4333 if gp.stack.lo == 0 {
4340 lock(&sched.gFree.lock)
4341 sched.gFree.noStack.pushAll(noStackQ)
4342 sched.gFree.stack.pushAll(stackQ)
4343 sched.gFree.n += inc
4344 unlock(&sched.gFree.lock)
4347 // Breakpoint executes a breakpoint trap.
4352 // dolockOSThread is called by LockOSThread and lockOSThread below
4353 // after they modify m.locked. Do not allow preemption during this call,
4354 // or else the m might be different in this function than in the caller.
4357 func dolockOSThread() {
4358 if GOARCH == "wasm" {
4359 return // no threads on wasm yet
4362 gp.m.lockedg.set(gp)
4363 gp.lockedm.set(gp.m)
4368 // LockOSThread wires the calling goroutine to its current operating system thread.
4369 // The calling goroutine will always execute in that thread,
4370 // and no other goroutine will execute in it,
4371 // until the calling goroutine has made as many calls to
4372 // UnlockOSThread as to LockOSThread.
4373 // If the calling goroutine exits without unlocking the thread,
4374 // the thread will be terminated.
4376 // All init functions are run on the startup thread. Calling LockOSThread
4377 // from an init function will cause the main function to be invoked on
4380 // A goroutine should call LockOSThread before calling OS services or
4381 // non-Go library functions that depend on per-thread state.
4382 func LockOSThread() {
4383 if atomic.Load(&newmHandoff.haveTemplateThread) == 0 && GOOS != "plan9" {
4384 // If we need to start a new thread from the locked
4385 // thread, we need the template thread. Start it now
4386 // while we're in a known-good state.
4387 startTemplateThread()
4391 if gp.m.lockedExt == 0 {
4393 panic("LockOSThread nesting overflow")
4399 func lockOSThread() {
4400 getg().m.lockedInt++
4404 // dounlockOSThread is called by UnlockOSThread and unlockOSThread below
4405 // after they update m->locked. Do not allow preemption during this call,
4406 // or else the m might be in different in this function than in the caller.
4409 func dounlockOSThread() {
4410 if GOARCH == "wasm" {
4411 return // no threads on wasm yet
4414 if gp.m.lockedInt != 0 || gp.m.lockedExt != 0 {
4423 // UnlockOSThread undoes an earlier call to LockOSThread.
4424 // If this drops the number of active LockOSThread calls on the
4425 // calling goroutine to zero, it unwires the calling goroutine from
4426 // its fixed operating system thread.
4427 // If there are no active LockOSThread calls, this is a no-op.
4429 // Before calling UnlockOSThread, the caller must ensure that the OS
4430 // thread is suitable for running other goroutines. If the caller made
4431 // any permanent changes to the state of the thread that would affect
4432 // other goroutines, it should not call this function and thus leave
4433 // the goroutine locked to the OS thread until the goroutine (and
4434 // hence the thread) exits.
4435 func UnlockOSThread() {
4437 if gp.m.lockedExt == 0 {
4445 func unlockOSThread() {
4447 if gp.m.lockedInt == 0 {
4448 systemstack(badunlockosthread)
4454 func badunlockosthread() {
4455 throw("runtime: internal error: misuse of lockOSThread/unlockOSThread")
4458 func gcount() int32 {
4459 n := int32(atomic.Loaduintptr(&allglen)) - sched.gFree.n - sched.ngsys.Load()
4460 for _, pp := range allp {
4464 // All these variables can be changed concurrently, so the result can be inconsistent.
4465 // But at least the current goroutine is running.
4472 func mcount() int32 {
4473 return int32(sched.mnext - sched.nmfreed)
4481 func _System() { _System() }
4482 func _ExternalCode() { _ExternalCode() }
4483 func _LostExternalCode() { _LostExternalCode() }
4484 func _GC() { _GC() }
4485 func _LostSIGPROFDuringAtomic64() { _LostSIGPROFDuringAtomic64() }
4486 func _VDSO() { _VDSO() }
4488 // Called if we receive a SIGPROF signal.
4489 // Called by the signal handler, may run during STW.
4491 //go:nowritebarrierrec
4492 func sigprof(pc, sp, lr uintptr, gp *g, mp *m) {
4497 // If mp.profilehz is 0, then profiling is not enabled for this thread.
4498 // We must check this to avoid a deadlock between setcpuprofilerate
4499 // and the call to cpuprof.add, below.
4500 if mp != nil && mp.profilehz == 0 {
4504 // On mips{,le}/arm, 64bit atomics are emulated with spinlocks, in
4505 // runtime/internal/atomic. If SIGPROF arrives while the program is inside
4506 // the critical section, it creates a deadlock (when writing the sample).
4507 // As a workaround, create a counter of SIGPROFs while in critical section
4508 // to store the count, and pass it to sigprof.add() later when SIGPROF is
4509 // received from somewhere else (with _LostSIGPROFDuringAtomic64 as pc).
4510 if GOARCH == "mips" || GOARCH == "mipsle" || GOARCH == "arm" {
4511 if f := findfunc(pc); f.valid() {
4512 if hasPrefix(funcname(f), "runtime/internal/atomic") {
4513 cpuprof.lostAtomic++
4517 if GOARCH == "arm" && goarm < 7 && GOOS == "linux" && pc&0xffff0000 == 0xffff0000 {
4518 // runtime/internal/atomic functions call into kernel
4519 // helpers on arm < 7. See
4520 // runtime/internal/atomic/sys_linux_arm.s.
4521 cpuprof.lostAtomic++
4526 // Profiling runs concurrently with GC, so it must not allocate.
4527 // Set a trap in case the code does allocate.
4528 // Note that on windows, one thread takes profiles of all the
4529 // other threads, so mp is usually not getg().m.
4530 // In fact mp may not even be stopped.
4531 // See golang.org/issue/17165.
4532 getg().m.mallocing++
4534 var stk [maxCPUProfStack]uintptr
4536 if mp.ncgo > 0 && mp.curg != nil && mp.curg.syscallpc != 0 && mp.curg.syscallsp != 0 {
4538 // Check cgoCallersUse to make sure that we are not
4539 // interrupting other code that is fiddling with
4540 // cgoCallers. We are running in a signal handler
4541 // with all signals blocked, so we don't have to worry
4542 // about any other code interrupting us.
4543 if atomic.Load(&mp.cgoCallersUse) == 0 && mp.cgoCallers != nil && mp.cgoCallers[0] != 0 {
4544 for cgoOff < len(mp.cgoCallers) && mp.cgoCallers[cgoOff] != 0 {
4547 copy(stk[:], mp.cgoCallers[:cgoOff])
4548 mp.cgoCallers[0] = 0
4551 // Collect Go stack that leads to the cgo call.
4552 n = gentraceback(mp.curg.syscallpc, mp.curg.syscallsp, 0, mp.curg, 0, &stk[cgoOff], len(stk)-cgoOff, nil, nil, 0)
4557 n = gentraceback(pc, sp, lr, gp, 0, &stk[0], len(stk), nil, nil, _TraceTrap|_TraceJumpStack)
4561 // Normal traceback is impossible or has failed.
4562 // See if it falls into several common cases.
4564 if usesLibcall() && mp.libcallg != 0 && mp.libcallpc != 0 && mp.libcallsp != 0 {
4565 // Libcall, i.e. runtime syscall on windows.
4566 // Collect Go stack that leads to the call.
4567 n = gentraceback(mp.libcallpc, mp.libcallsp, 0, mp.libcallg.ptr(), 0, &stk[0], len(stk), nil, nil, 0)
4569 if n == 0 && mp != nil && mp.vdsoSP != 0 {
4570 n = gentraceback(mp.vdsoPC, mp.vdsoSP, 0, gp, 0, &stk[0], len(stk), nil, nil, _TraceTrap|_TraceJumpStack)
4573 // If all of the above has failed, account it against abstract "System" or "GC".
4576 pc = abi.FuncPCABIInternal(_VDSO) + sys.PCQuantum
4577 } else if pc > firstmoduledata.etext {
4578 // "ExternalCode" is better than "etext".
4579 pc = abi.FuncPCABIInternal(_ExternalCode) + sys.PCQuantum
4582 if mp.preemptoff != "" {
4583 stk[1] = abi.FuncPCABIInternal(_GC) + sys.PCQuantum
4585 stk[1] = abi.FuncPCABIInternal(_System) + sys.PCQuantum
4591 // Note: it can happen on Windows that we interrupted a system thread
4592 // with no g, so gp could nil. The other nil checks are done out of
4593 // caution, but not expected to be nil in practice.
4594 var tagPtr *unsafe.Pointer
4595 if gp != nil && gp.m != nil && gp.m.curg != nil {
4596 tagPtr = &gp.m.curg.labels
4598 cpuprof.add(tagPtr, stk[:n])
4602 if gp != nil && gp.m != nil {
4603 if gp.m.curg != nil {
4608 traceCPUSample(gprof, pp, stk[:n])
4610 getg().m.mallocing--
4613 // setcpuprofilerate sets the CPU profiling rate to hz times per second.
4614 // If hz <= 0, setcpuprofilerate turns off CPU profiling.
4615 func setcpuprofilerate(hz int32) {
4616 // Force sane arguments.
4621 // Disable preemption, otherwise we can be rescheduled to another thread
4622 // that has profiling enabled.
4626 // Stop profiler on this thread so that it is safe to lock prof.
4627 // if a profiling signal came in while we had prof locked,
4628 // it would deadlock.
4629 setThreadCPUProfiler(0)
4631 for !atomic.Cas(&prof.signalLock, 0, 1) {
4635 setProcessCPUProfiler(hz)
4638 atomic.Store(&prof.signalLock, 0)
4641 sched.profilehz = hz
4645 setThreadCPUProfiler(hz)
4651 // init initializes pp, which may be a freshly allocated p or a
4652 // previously destroyed p, and transitions it to status _Pgcstop.
4653 func (pp *p) init(id int32) {
4655 pp.status = _Pgcstop
4656 pp.sudogcache = pp.sudogbuf[:0]
4657 pp.deferpool = pp.deferpoolbuf[:0]
4659 if pp.mcache == nil {
4662 throw("missing mcache?")
4664 // Use the bootstrap mcache0. Only one P will get
4665 // mcache0: the one with ID 0.
4668 pp.mcache = allocmcache()
4671 if raceenabled && pp.raceprocctx == 0 {
4673 pp.raceprocctx = raceprocctx0
4674 raceprocctx0 = 0 // bootstrap
4676 pp.raceprocctx = raceproccreate()
4679 lockInit(&pp.timersLock, lockRankTimers)
4681 // This P may get timers when it starts running. Set the mask here
4682 // since the P may not go through pidleget (notably P 0 on startup).
4684 // Similarly, we may not go through pidleget before this P starts
4685 // running if it is P 0 on startup.
4689 // destroy releases all of the resources associated with pp and
4690 // transitions it to status _Pdead.
4692 // sched.lock must be held and the world must be stopped.
4693 func (pp *p) destroy() {
4694 assertLockHeld(&sched.lock)
4695 assertWorldStopped()
4697 // Move all runnable goroutines to the global queue
4698 for pp.runqhead != pp.runqtail {
4699 // Pop from tail of local queue
4701 gp := pp.runq[pp.runqtail%uint32(len(pp.runq))].ptr()
4702 // Push onto head of global queue
4705 if pp.runnext != 0 {
4706 globrunqputhead(pp.runnext.ptr())
4709 if len(pp.timers) > 0 {
4710 plocal := getg().m.p.ptr()
4711 // The world is stopped, but we acquire timersLock to
4712 // protect against sysmon calling timeSleepUntil.
4713 // This is the only case where we hold the timersLock of
4714 // more than one P, so there are no deadlock concerns.
4715 lock(&plocal.timersLock)
4716 lock(&pp.timersLock)
4717 moveTimers(plocal, pp.timers)
4720 pp.deletedTimers = 0
4721 atomic.Store64(&pp.timer0When, 0)
4722 unlock(&pp.timersLock)
4723 unlock(&plocal.timersLock)
4725 // Flush p's write barrier buffer.
4726 if gcphase != _GCoff {
4730 for i := range pp.sudogbuf {
4731 pp.sudogbuf[i] = nil
4733 pp.sudogcache = pp.sudogbuf[:0]
4734 for j := range pp.deferpoolbuf {
4735 pp.deferpoolbuf[j] = nil
4737 pp.deferpool = pp.deferpoolbuf[:0]
4738 systemstack(func() {
4739 for i := 0; i < pp.mspancache.len; i++ {
4740 // Safe to call since the world is stopped.
4741 mheap_.spanalloc.free(unsafe.Pointer(pp.mspancache.buf[i]))
4743 pp.mspancache.len = 0
4745 pp.pcache.flush(&mheap_.pages)
4746 unlock(&mheap_.lock)
4748 freemcache(pp.mcache)
4753 if pp.timerRaceCtx != 0 {
4754 // The race detector code uses a callback to fetch
4755 // the proc context, so arrange for that callback
4756 // to see the right thing.
4757 // This hack only works because we are the only
4763 racectxend(pp.timerRaceCtx)
4768 raceprocdestroy(pp.raceprocctx)
4775 // Change number of processors.
4777 // sched.lock must be held, and the world must be stopped.
4779 // gcworkbufs must not be being modified by either the GC or the write barrier
4780 // code, so the GC must not be running if the number of Ps actually changes.
4782 // Returns list of Ps with local work, they need to be scheduled by the caller.
4783 func procresize(nprocs int32) *p {
4784 assertLockHeld(&sched.lock)
4785 assertWorldStopped()
4788 if old < 0 || nprocs <= 0 {
4789 throw("procresize: invalid arg")
4792 traceGomaxprocs(nprocs)
4795 // update statistics
4797 if sched.procresizetime != 0 {
4798 sched.totaltime += int64(old) * (now - sched.procresizetime)
4800 sched.procresizetime = now
4802 maskWords := (nprocs + 31) / 32
4804 // Grow allp if necessary.
4805 if nprocs > int32(len(allp)) {
4806 // Synchronize with retake, which could be running
4807 // concurrently since it doesn't run on a P.
4809 if nprocs <= int32(cap(allp)) {
4810 allp = allp[:nprocs]
4812 nallp := make([]*p, nprocs)
4813 // Copy everything up to allp's cap so we
4814 // never lose old allocated Ps.
4815 copy(nallp, allp[:cap(allp)])
4819 if maskWords <= int32(cap(idlepMask)) {
4820 idlepMask = idlepMask[:maskWords]
4821 timerpMask = timerpMask[:maskWords]
4823 nidlepMask := make([]uint32, maskWords)
4824 // No need to copy beyond len, old Ps are irrelevant.
4825 copy(nidlepMask, idlepMask)
4826 idlepMask = nidlepMask
4828 ntimerpMask := make([]uint32, maskWords)
4829 copy(ntimerpMask, timerpMask)
4830 timerpMask = ntimerpMask
4835 // initialize new P's
4836 for i := old; i < nprocs; i++ {
4842 atomicstorep(unsafe.Pointer(&allp[i]), unsafe.Pointer(pp))
4846 if gp.m.p != 0 && gp.m.p.ptr().id < nprocs {
4847 // continue to use the current P
4848 gp.m.p.ptr().status = _Prunning
4849 gp.m.p.ptr().mcache.prepareForSweep()
4851 // release the current P and acquire allp[0].
4853 // We must do this before destroying our current P
4854 // because p.destroy itself has write barriers, so we
4855 // need to do that from a valid P.
4858 // Pretend that we were descheduled
4859 // and then scheduled again to keep
4862 traceProcStop(gp.m.p.ptr())
4876 // g.m.p is now set, so we no longer need mcache0 for bootstrapping.
4879 // release resources from unused P's
4880 for i := nprocs; i < old; i++ {
4883 // can't free P itself because it can be referenced by an M in syscall
4887 if int32(len(allp)) != nprocs {
4889 allp = allp[:nprocs]
4890 idlepMask = idlepMask[:maskWords]
4891 timerpMask = timerpMask[:maskWords]
4896 for i := nprocs - 1; i >= 0; i-- {
4898 if gp.m.p.ptr() == pp {
4906 pp.link.set(runnablePs)
4910 stealOrder.reset(uint32(nprocs))
4911 var int32p *int32 = &gomaxprocs // make compiler check that gomaxprocs is an int32
4912 atomic.Store((*uint32)(unsafe.Pointer(int32p)), uint32(nprocs))
4914 // Notify the limiter that the amount of procs has changed.
4915 gcCPULimiter.resetCapacity(now, nprocs)
4920 // Associate p and the current m.
4922 // This function is allowed to have write barriers even if the caller
4923 // isn't because it immediately acquires pp.
4925 //go:yeswritebarrierrec
4926 func acquirep(pp *p) {
4927 // Do the part that isn't allowed to have write barriers.
4930 // Have p; write barriers now allowed.
4932 // Perform deferred mcache flush before this P can allocate
4933 // from a potentially stale mcache.
4934 pp.mcache.prepareForSweep()
4941 // wirep is the first step of acquirep, which actually associates the
4942 // current M to pp. This is broken out so we can disallow write
4943 // barriers for this part, since we don't yet have a P.
4945 //go:nowritebarrierrec
4951 throw("wirep: already in go")
4953 if pp.m != 0 || pp.status != _Pidle {
4958 print("wirep: p->m=", pp.m, "(", id, ") p->status=", pp.status, "\n")
4959 throw("wirep: invalid p state")
4963 pp.status = _Prunning
4966 // Disassociate p and the current m.
4967 func releasep() *p {
4971 throw("releasep: invalid arg")
4974 if pp.m.ptr() != gp.m || pp.status != _Prunning {
4975 print("releasep: m=", gp.m, " m->p=", gp.m.p.ptr(), " p->m=", hex(pp.m), " p->status=", pp.status, "\n")
4976 throw("releasep: invalid p state")
4979 traceProcStop(gp.m.p.ptr())
4987 func incidlelocked(v int32) {
4989 sched.nmidlelocked += v
4996 // Check for deadlock situation.
4997 // The check is based on number of running M's, if 0 -> deadlock.
4998 // sched.lock must be held.
5000 assertLockHeld(&sched.lock)
5002 // For -buildmode=c-shared or -buildmode=c-archive it's OK if
5003 // there are no running goroutines. The calling program is
5004 // assumed to be running.
5005 if islibrary || isarchive {
5009 // If we are dying because of a signal caught on an already idle thread,
5010 // freezetheworld will cause all running threads to block.
5011 // And runtime will essentially enter into deadlock state,
5012 // except that there is a thread that will call exit soon.
5013 if panicking.Load() > 0 {
5017 // If we are not running under cgo, but we have an extra M then account
5018 // for it. (It is possible to have an extra M on Windows without cgo to
5019 // accommodate callbacks created by syscall.NewCallback. See issue #6751
5022 if !iscgo && cgoHasExtraM {
5023 mp := lockextra(true)
5024 haveExtraM := extraMCount > 0
5031 run := mcount() - sched.nmidle - sched.nmidlelocked - sched.nmsys
5036 print("runtime: checkdead: nmidle=", sched.nmidle, " nmidlelocked=", sched.nmidlelocked, " mcount=", mcount(), " nmsys=", sched.nmsys, "\n")
5037 throw("checkdead: inconsistent counts")
5041 forEachG(func(gp *g) {
5042 if isSystemGoroutine(gp, false) {
5045 s := readgstatus(gp)
5046 switch s &^ _Gscan {
5053 print("runtime: checkdead: find g ", gp.goid, " in status ", s, "\n")
5054 throw("checkdead: runnable g")
5057 if grunning == 0 { // possible if main goroutine calls runtime·Goexit()
5058 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5059 fatal("no goroutines (main called runtime.Goexit) - deadlock!")
5062 // Maybe jump time forward for playground.
5064 if when := timeSleepUntil(); when < maxWhen {
5067 // Start an M to steal the timer.
5068 pp, _ := pidleget(faketime)
5070 // There should always be a free P since
5071 // nothing is running.
5072 throw("checkdead: no p for timer")
5076 // There should always be a free M since
5077 // nothing is running.
5078 throw("checkdead: no m for timer")
5080 // M must be spinning to steal. We set this to be
5081 // explicit, but since this is the only M it would
5082 // become spinning on its own anyways.
5083 sched.nmspinning.Add(1)
5086 notewakeup(&mp.park)
5091 // There are no goroutines running, so we can look at the P's.
5092 for _, pp := range allp {
5093 if len(pp.timers) > 0 {
5098 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5099 fatal("all goroutines are asleep - deadlock!")
5102 // forcegcperiod is the maximum time in nanoseconds between garbage
5103 // collections. If we go this long without a garbage collection, one
5104 // is forced to run.
5106 // This is a variable for testing purposes. It normally doesn't change.
5107 var forcegcperiod int64 = 2 * 60 * 1e9
5109 // needSysmonWorkaround is true if the workaround for
5110 // golang.org/issue/42515 is needed on NetBSD.
5111 var needSysmonWorkaround bool = false
5113 // Always runs without a P, so write barriers are not allowed.
5115 //go:nowritebarrierrec
5122 lasttrace := int64(0)
5123 idle := 0 // how many cycles in succession we had not wokeup somebody
5127 if idle == 0 { // start with 20us sleep...
5129 } else if idle > 50 { // start doubling the sleep after 1ms...
5132 if delay > 10*1000 { // up to 10ms
5137 // sysmon should not enter deep sleep if schedtrace is enabled so that
5138 // it can print that information at the right time.
5140 // It should also not enter deep sleep if there are any active P's so
5141 // that it can retake P's from syscalls, preempt long running G's, and
5142 // poll the network if all P's are busy for long stretches.
5144 // It should wakeup from deep sleep if any P's become active either due
5145 // to exiting a syscall or waking up due to a timer expiring so that it
5146 // can resume performing those duties. If it wakes from a syscall it
5147 // resets idle and delay as a bet that since it had retaken a P from a
5148 // syscall before, it may need to do it again shortly after the
5149 // application starts work again. It does not reset idle when waking
5150 // from a timer to avoid adding system load to applications that spend
5151 // most of their time sleeping.
5153 if debug.schedtrace <= 0 && (sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs) {
5155 if sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs {
5156 syscallWake := false
5157 next := timeSleepUntil()
5159 sched.sysmonwait.Store(true)
5161 // Make wake-up period small enough
5162 // for the sampling to be correct.
5163 sleep := forcegcperiod / 2
5164 if next-now < sleep {
5167 shouldRelax := sleep >= osRelaxMinNS
5171 syscallWake = notetsleep(&sched.sysmonnote, sleep)
5176 sched.sysmonwait.Store(false)
5177 noteclear(&sched.sysmonnote)
5187 lock(&sched.sysmonlock)
5188 // Update now in case we blocked on sysmonnote or spent a long time
5189 // blocked on schedlock or sysmonlock above.
5192 // trigger libc interceptors if needed
5193 if *cgo_yield != nil {
5194 asmcgocall(*cgo_yield, nil)
5196 // poll network if not polled for more than 10ms
5197 lastpoll := sched.lastpoll.Load()
5198 if netpollinited() && lastpoll != 0 && lastpoll+10*1000*1000 < now {
5199 sched.lastpoll.CompareAndSwap(lastpoll, now)
5200 list := netpoll(0) // non-blocking - returns list of goroutines
5202 // Need to decrement number of idle locked M's
5203 // (pretending that one more is running) before injectglist.
5204 // Otherwise it can lead to the following situation:
5205 // injectglist grabs all P's but before it starts M's to run the P's,
5206 // another M returns from syscall, finishes running its G,
5207 // observes that there is no work to do and no other running M's
5208 // and reports deadlock.
5214 if GOOS == "netbsd" && needSysmonWorkaround {
5215 // netpoll is responsible for waiting for timer
5216 // expiration, so we typically don't have to worry
5217 // about starting an M to service timers. (Note that
5218 // sleep for timeSleepUntil above simply ensures sysmon
5219 // starts running again when that timer expiration may
5220 // cause Go code to run again).
5222 // However, netbsd has a kernel bug that sometimes
5223 // misses netpollBreak wake-ups, which can lead to
5224 // unbounded delays servicing timers. If we detect this
5225 // overrun, then startm to get something to handle the
5228 // See issue 42515 and
5229 // https://gnats.netbsd.org/cgi-bin/query-pr-single.pl?number=50094.
5230 if next := timeSleepUntil(); next < now {
5234 if scavenger.sysmonWake.Load() != 0 {
5235 // Kick the scavenger awake if someone requested it.
5238 // retake P's blocked in syscalls
5239 // and preempt long running G's
5240 if retake(now) != 0 {
5245 // check if we need to force a GC
5246 if t := (gcTrigger{kind: gcTriggerTime, now: now}); t.test() && atomic.Load(&forcegc.idle) != 0 {
5250 list.push(forcegc.g)
5252 unlock(&forcegc.lock)
5254 if debug.schedtrace > 0 && lasttrace+int64(debug.schedtrace)*1000000 <= now {
5256 schedtrace(debug.scheddetail > 0)
5258 unlock(&sched.sysmonlock)
5262 type sysmontick struct {
5269 // forcePreemptNS is the time slice given to a G before it is
5271 const forcePreemptNS = 10 * 1000 * 1000 // 10ms
5273 func retake(now int64) uint32 {
5275 // Prevent allp slice changes. This lock will be completely
5276 // uncontended unless we're already stopping the world.
5278 // We can't use a range loop over allp because we may
5279 // temporarily drop the allpLock. Hence, we need to re-fetch
5280 // allp each time around the loop.
5281 for i := 0; i < len(allp); i++ {
5284 // This can happen if procresize has grown
5285 // allp but not yet created new Ps.
5288 pd := &pp.sysmontick
5291 if s == _Prunning || s == _Psyscall {
5292 // Preempt G if it's running for too long.
5293 t := int64(pp.schedtick)
5294 if int64(pd.schedtick) != t {
5295 pd.schedtick = uint32(t)
5297 } else if pd.schedwhen+forcePreemptNS <= now {
5299 // In case of syscall, preemptone() doesn't
5300 // work, because there is no M wired to P.
5305 // Retake P from syscall if it's there for more than 1 sysmon tick (at least 20us).
5306 t := int64(pp.syscalltick)
5307 if !sysretake && int64(pd.syscalltick) != t {
5308 pd.syscalltick = uint32(t)
5309 pd.syscallwhen = now
5312 // On the one hand we don't want to retake Ps if there is no other work to do,
5313 // but on the other hand we want to retake them eventually
5314 // because they can prevent the sysmon thread from deep sleep.
5315 if runqempty(pp) && sched.nmspinning.Load()+sched.npidle.Load() > 0 && pd.syscallwhen+10*1000*1000 > now {
5318 // Drop allpLock so we can take sched.lock.
5320 // Need to decrement number of idle locked M's
5321 // (pretending that one more is running) before the CAS.
5322 // Otherwise the M from which we retake can exit the syscall,
5323 // increment nmidle and report deadlock.
5325 if atomic.Cas(&pp.status, s, _Pidle) {
5342 // Tell all goroutines that they have been preempted and they should stop.
5343 // This function is purely best-effort. It can fail to inform a goroutine if a
5344 // processor just started running it.
5345 // No locks need to be held.
5346 // Returns true if preemption request was issued to at least one goroutine.
5347 func preemptall() bool {
5349 for _, pp := range allp {
5350 if pp.status != _Prunning {
5360 // Tell the goroutine running on processor P to stop.
5361 // This function is purely best-effort. It can incorrectly fail to inform the
5362 // goroutine. It can inform the wrong goroutine. Even if it informs the
5363 // correct goroutine, that goroutine might ignore the request if it is
5364 // simultaneously executing newstack.
5365 // No lock needs to be held.
5366 // Returns true if preemption request was issued.
5367 // The actual preemption will happen at some point in the future
5368 // and will be indicated by the gp->status no longer being
5370 func preemptone(pp *p) bool {
5372 if mp == nil || mp == getg().m {
5376 if gp == nil || gp == mp.g0 {
5382 // Every call in a goroutine checks for stack overflow by
5383 // comparing the current stack pointer to gp->stackguard0.
5384 // Setting gp->stackguard0 to StackPreempt folds
5385 // preemption into the normal stack overflow check.
5386 gp.stackguard0 = stackPreempt
5388 // Request an async preemption of this P.
5389 if preemptMSupported && debug.asyncpreemptoff == 0 {
5399 func schedtrace(detailed bool) {
5406 print("SCHED ", (now-starttime)/1e6, "ms: gomaxprocs=", gomaxprocs, " idleprocs=", sched.npidle.Load(), " threads=", mcount(), " spinningthreads=", sched.nmspinning.Load(), " idlethreads=", sched.nmidle, " runqueue=", sched.runqsize)
5408 print(" gcwaiting=", sched.gcwaiting.Load(), " nmidlelocked=", sched.nmidlelocked, " stopwait=", sched.stopwait, " sysmonwait=", sched.sysmonwait.Load(), "\n")
5410 // We must be careful while reading data from P's, M's and G's.
5411 // Even if we hold schedlock, most data can be changed concurrently.
5412 // E.g. (p->m ? p->m->id : -1) can crash if p->m changes from non-nil to nil.
5413 for i, pp := range allp {
5415 h := atomic.Load(&pp.runqhead)
5416 t := atomic.Load(&pp.runqtail)
5418 print(" P", i, ": status=", pp.status, " schedtick=", pp.schedtick, " syscalltick=", pp.syscalltick, " m=")
5424 print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers), "\n")
5426 // In non-detailed mode format lengths of per-P run queues as:
5427 // [len1 len2 len3 len4]
5433 if i == len(allp)-1 {
5444 for mp := allm; mp != nil; mp = mp.alllink {
5446 print(" M", mp.id, ": p=")
5458 print(" mallocing=", mp.mallocing, " throwing=", mp.throwing, " preemptoff=", mp.preemptoff, " locks=", mp.locks, " dying=", mp.dying, " spinning=", mp.spinning, " blocked=", mp.blocked, " lockedg=")
5459 if lockedg := mp.lockedg.ptr(); lockedg != nil {
5467 forEachG(func(gp *g) {
5468 print(" G", gp.goid, ": status=", readgstatus(gp), "(", gp.waitreason.String(), ") m=")
5475 if lockedm := gp.lockedm.ptr(); lockedm != nil {
5485 // schedEnableUser enables or disables the scheduling of user
5488 // This does not stop already running user goroutines, so the caller
5489 // should first stop the world when disabling user goroutines.
5490 func schedEnableUser(enable bool) {
5492 if sched.disable.user == !enable {
5496 sched.disable.user = !enable
5498 n := sched.disable.n
5500 globrunqputbatch(&sched.disable.runnable, n)
5502 for ; n != 0 && sched.npidle.Load() != 0; n-- {
5510 // schedEnabled reports whether gp should be scheduled. It returns
5511 // false is scheduling of gp is disabled.
5513 // sched.lock must be held.
5514 func schedEnabled(gp *g) bool {
5515 assertLockHeld(&sched.lock)
5517 if sched.disable.user {
5518 return isSystemGoroutine(gp, true)
5523 // Put mp on midle list.
5524 // sched.lock must be held.
5525 // May run during STW, so write barriers are not allowed.
5527 //go:nowritebarrierrec
5529 assertLockHeld(&sched.lock)
5531 mp.schedlink = sched.midle
5537 // Try to get an m from midle list.
5538 // sched.lock must be held.
5539 // May run during STW, so write barriers are not allowed.
5541 //go:nowritebarrierrec
5543 assertLockHeld(&sched.lock)
5545 mp := sched.midle.ptr()
5547 sched.midle = mp.schedlink
5553 // Put gp on the global runnable queue.
5554 // sched.lock must be held.
5555 // May run during STW, so write barriers are not allowed.
5557 //go:nowritebarrierrec
5558 func globrunqput(gp *g) {
5559 assertLockHeld(&sched.lock)
5561 sched.runq.pushBack(gp)
5565 // Put gp at the head of the global runnable queue.
5566 // sched.lock must be held.
5567 // May run during STW, so write barriers are not allowed.
5569 //go:nowritebarrierrec
5570 func globrunqputhead(gp *g) {
5571 assertLockHeld(&sched.lock)
5577 // Put a batch of runnable goroutines on the global runnable queue.
5578 // This clears *batch.
5579 // sched.lock must be held.
5580 // May run during STW, so write barriers are not allowed.
5582 //go:nowritebarrierrec
5583 func globrunqputbatch(batch *gQueue, n int32) {
5584 assertLockHeld(&sched.lock)
5586 sched.runq.pushBackAll(*batch)
5591 // Try get a batch of G's from the global runnable queue.
5592 // sched.lock must be held.
5593 func globrunqget(pp *p, max int32) *g {
5594 assertLockHeld(&sched.lock)
5596 if sched.runqsize == 0 {
5600 n := sched.runqsize/gomaxprocs + 1
5601 if n > sched.runqsize {
5604 if max > 0 && n > max {
5607 if n > int32(len(pp.runq))/2 {
5608 n = int32(len(pp.runq)) / 2
5613 gp := sched.runq.pop()
5616 gp1 := sched.runq.pop()
5617 runqput(pp, gp1, false)
5622 // pMask is an atomic bitstring with one bit per P.
5625 // read returns true if P id's bit is set.
5626 func (p pMask) read(id uint32) bool {
5628 mask := uint32(1) << (id % 32)
5629 return (atomic.Load(&p[word]) & mask) != 0
5632 // set sets P id's bit.
5633 func (p pMask) set(id int32) {
5635 mask := uint32(1) << (id % 32)
5636 atomic.Or(&p[word], mask)
5639 // clear clears P id's bit.
5640 func (p pMask) clear(id int32) {
5642 mask := uint32(1) << (id % 32)
5643 atomic.And(&p[word], ^mask)
5646 // updateTimerPMask clears pp's timer mask if it has no timers on its heap.
5648 // Ideally, the timer mask would be kept immediately consistent on any timer
5649 // operations. Unfortunately, updating a shared global data structure in the
5650 // timer hot path adds too much overhead in applications frequently switching
5651 // between no timers and some timers.
5653 // As a compromise, the timer mask is updated only on pidleget / pidleput. A
5654 // running P (returned by pidleget) may add a timer at any time, so its mask
5655 // must be set. An idle P (passed to pidleput) cannot add new timers while
5656 // idle, so if it has no timers at that time, its mask may be cleared.
5658 // Thus, we get the following effects on timer-stealing in findrunnable:
5660 // - Idle Ps with no timers when they go idle are never checked in findrunnable
5661 // (for work- or timer-stealing; this is the ideal case).
5662 // - Running Ps must always be checked.
5663 // - Idle Ps whose timers are stolen must continue to be checked until they run
5664 // again, even after timer expiration.
5666 // When the P starts running again, the mask should be set, as a timer may be
5667 // added at any time.
5669 // TODO(prattmic): Additional targeted updates may improve the above cases.
5670 // e.g., updating the mask when stealing a timer.
5671 func updateTimerPMask(pp *p) {
5672 if atomic.Load(&pp.numTimers) > 0 {
5676 // Looks like there are no timers, however another P may transiently
5677 // decrement numTimers when handling a timerModified timer in
5678 // checkTimers. We must take timersLock to serialize with these changes.
5679 lock(&pp.timersLock)
5680 if atomic.Load(&pp.numTimers) == 0 {
5681 timerpMask.clear(pp.id)
5683 unlock(&pp.timersLock)
5686 // pidleput puts p on the _Pidle list. now must be a relatively recent call
5687 // to nanotime or zero. Returns now or the current time if now was zero.
5689 // This releases ownership of p. Once sched.lock is released it is no longer
5692 // sched.lock must be held.
5694 // May run during STW, so write barriers are not allowed.
5696 //go:nowritebarrierrec
5697 func pidleput(pp *p, now int64) int64 {
5698 assertLockHeld(&sched.lock)
5701 throw("pidleput: P has non-empty run queue")
5706 updateTimerPMask(pp) // clear if there are no timers.
5707 idlepMask.set(pp.id)
5708 pp.link = sched.pidle
5711 if !pp.limiterEvent.start(limiterEventIdle, now) {
5712 throw("must be able to track idle limiter event")
5717 // pidleget tries to get a p from the _Pidle list, acquiring ownership.
5719 // sched.lock must be held.
5721 // May run during STW, so write barriers are not allowed.
5723 //go:nowritebarrierrec
5724 func pidleget(now int64) (*p, int64) {
5725 assertLockHeld(&sched.lock)
5727 pp := sched.pidle.ptr()
5729 // Timer may get added at any time now.
5733 timerpMask.set(pp.id)
5734 idlepMask.clear(pp.id)
5735 sched.pidle = pp.link
5736 sched.npidle.Add(-1)
5737 pp.limiterEvent.stop(limiterEventIdle, now)
5742 // runqempty reports whether pp has no Gs on its local run queue.
5743 // It never returns true spuriously.
5744 func runqempty(pp *p) bool {
5745 // Defend against a race where 1) pp has G1 in runqnext but runqhead == runqtail,
5746 // 2) runqput on pp kicks G1 to the runq, 3) runqget on pp empties runqnext.
5747 // Simply observing that runqhead == runqtail and then observing that runqnext == nil
5748 // does not mean the queue is empty.
5750 head := atomic.Load(&pp.runqhead)
5751 tail := atomic.Load(&pp.runqtail)
5752 runnext := atomic.Loaduintptr((*uintptr)(unsafe.Pointer(&pp.runnext)))
5753 if tail == atomic.Load(&pp.runqtail) {
5754 return head == tail && runnext == 0
5759 // To shake out latent assumptions about scheduling order,
5760 // we introduce some randomness into scheduling decisions
5761 // when running with the race detector.
5762 // The need for this was made obvious by changing the
5763 // (deterministic) scheduling order in Go 1.5 and breaking
5764 // many poorly-written tests.
5765 // With the randomness here, as long as the tests pass
5766 // consistently with -race, they shouldn't have latent scheduling
5768 const randomizeScheduler = raceenabled
5770 // runqput tries to put g on the local runnable queue.
5771 // If next is false, runqput adds g to the tail of the runnable queue.
5772 // If next is true, runqput puts g in the pp.runnext slot.
5773 // If the run queue is full, runnext puts g on the global queue.
5774 // Executed only by the owner P.
5775 func runqput(pp *p, gp *g, next bool) {
5776 if randomizeScheduler && next && fastrandn(2) == 0 {
5782 oldnext := pp.runnext
5783 if !pp.runnext.cas(oldnext, guintptr(unsafe.Pointer(gp))) {
5789 // Kick the old runnext out to the regular run queue.
5794 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
5796 if t-h < uint32(len(pp.runq)) {
5797 pp.runq[t%uint32(len(pp.runq))].set(gp)
5798 atomic.StoreRel(&pp.runqtail, t+1) // store-release, makes the item available for consumption
5801 if runqputslow(pp, gp, h, t) {
5804 // the queue is not full, now the put above must succeed
5808 // Put g and a batch of work from local runnable queue on global queue.
5809 // Executed only by the owner P.
5810 func runqputslow(pp *p, gp *g, h, t uint32) bool {
5811 var batch [len(pp.runq)/2 + 1]*g
5813 // First, grab a batch from local queue.
5816 if n != uint32(len(pp.runq)/2) {
5817 throw("runqputslow: queue is not full")
5819 for i := uint32(0); i < n; i++ {
5820 batch[i] = pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
5822 if !atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
5827 if randomizeScheduler {
5828 for i := uint32(1); i <= n; i++ {
5829 j := fastrandn(i + 1)
5830 batch[i], batch[j] = batch[j], batch[i]
5834 // Link the goroutines.
5835 for i := uint32(0); i < n; i++ {
5836 batch[i].schedlink.set(batch[i+1])
5839 q.head.set(batch[0])
5840 q.tail.set(batch[n])
5842 // Now put the batch on global queue.
5844 globrunqputbatch(&q, int32(n+1))
5849 // runqputbatch tries to put all the G's on q on the local runnable queue.
5850 // If the queue is full, they are put on the global queue; in that case
5851 // this will temporarily acquire the scheduler lock.
5852 // Executed only by the owner P.
5853 func runqputbatch(pp *p, q *gQueue, qsize int) {
5854 h := atomic.LoadAcq(&pp.runqhead)
5857 for !q.empty() && t-h < uint32(len(pp.runq)) {
5859 pp.runq[t%uint32(len(pp.runq))].set(gp)
5865 if randomizeScheduler {
5866 off := func(o uint32) uint32 {
5867 return (pp.runqtail + o) % uint32(len(pp.runq))
5869 for i := uint32(1); i < n; i++ {
5870 j := fastrandn(i + 1)
5871 pp.runq[off(i)], pp.runq[off(j)] = pp.runq[off(j)], pp.runq[off(i)]
5875 atomic.StoreRel(&pp.runqtail, t)
5878 globrunqputbatch(q, int32(qsize))
5883 // Get g from local runnable queue.
5884 // If inheritTime is true, gp should inherit the remaining time in the
5885 // current time slice. Otherwise, it should start a new time slice.
5886 // Executed only by the owner P.
5887 func runqget(pp *p) (gp *g, inheritTime bool) {
5888 // If there's a runnext, it's the next G to run.
5890 // If the runnext is non-0 and the CAS fails, it could only have been stolen by another P,
5891 // because other Ps can race to set runnext to 0, but only the current P can set it to non-0.
5892 // Hence, there's no need to retry this CAS if it falls.
5893 if next != 0 && pp.runnext.cas(next, 0) {
5894 return next.ptr(), true
5898 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
5903 gp := pp.runq[h%uint32(len(pp.runq))].ptr()
5904 if atomic.CasRel(&pp.runqhead, h, h+1) { // cas-release, commits consume
5910 // runqdrain drains the local runnable queue of pp and returns all goroutines in it.
5911 // Executed only by the owner P.
5912 func runqdrain(pp *p) (drainQ gQueue, n uint32) {
5913 oldNext := pp.runnext
5914 if oldNext != 0 && pp.runnext.cas(oldNext, 0) {
5915 drainQ.pushBack(oldNext.ptr())
5920 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
5926 if qn > uint32(len(pp.runq)) { // read inconsistent h and t
5930 if !atomic.CasRel(&pp.runqhead, h, h+qn) { // cas-release, commits consume
5934 // We've inverted the order in which it gets G's from the local P's runnable queue
5935 // and then advances the head pointer because we don't want to mess up the statuses of G's
5936 // while runqdrain() and runqsteal() are running in parallel.
5937 // Thus we should advance the head pointer before draining the local P into a gQueue,
5938 // so that we can update any gp.schedlink only after we take the full ownership of G,
5939 // meanwhile, other P's can't access to all G's in local P's runnable queue and steal them.
5940 // See https://groups.google.com/g/golang-dev/c/0pTKxEKhHSc/m/6Q85QjdVBQAJ for more details.
5941 for i := uint32(0); i < qn; i++ {
5942 gp := pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
5949 // Grabs a batch of goroutines from pp's runnable queue into batch.
5950 // Batch is a ring buffer starting at batchHead.
5951 // Returns number of grabbed goroutines.
5952 // Can be executed by any P.
5953 func runqgrab(pp *p, batch *[256]guintptr, batchHead uint32, stealRunNextG bool) uint32 {
5955 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
5956 t := atomic.LoadAcq(&pp.runqtail) // load-acquire, synchronize with the producer
5961 // Try to steal from pp.runnext.
5962 if next := pp.runnext; next != 0 {
5963 if pp.status == _Prunning {
5964 // Sleep to ensure that pp isn't about to run the g
5965 // we are about to steal.
5966 // The important use case here is when the g running
5967 // on pp ready()s another g and then almost
5968 // immediately blocks. Instead of stealing runnext
5969 // in this window, back off to give pp a chance to
5970 // schedule runnext. This will avoid thrashing gs
5971 // between different Ps.
5972 // A sync chan send/recv takes ~50ns as of time of
5973 // writing, so 3us gives ~50x overshoot.
5974 if GOOS != "windows" && GOOS != "openbsd" && GOOS != "netbsd" {
5977 // On some platforms system timer granularity is
5978 // 1-15ms, which is way too much for this
5979 // optimization. So just yield.
5983 if !pp.runnext.cas(next, 0) {
5986 batch[batchHead%uint32(len(batch))] = next
5992 if n > uint32(len(pp.runq)/2) { // read inconsistent h and t
5995 for i := uint32(0); i < n; i++ {
5996 g := pp.runq[(h+i)%uint32(len(pp.runq))]
5997 batch[(batchHead+i)%uint32(len(batch))] = g
5999 if atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
6005 // Steal half of elements from local runnable queue of p2
6006 // and put onto local runnable queue of p.
6007 // Returns one of the stolen elements (or nil if failed).
6008 func runqsteal(pp, p2 *p, stealRunNextG bool) *g {
6010 n := runqgrab(p2, &pp.runq, t, stealRunNextG)
6015 gp := pp.runq[(t+n)%uint32(len(pp.runq))].ptr()
6019 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
6020 if t-h+n >= uint32(len(pp.runq)) {
6021 throw("runqsteal: runq overflow")
6023 atomic.StoreRel(&pp.runqtail, t+n) // store-release, makes the item available for consumption
6027 // A gQueue is a dequeue of Gs linked through g.schedlink. A G can only
6028 // be on one gQueue or gList at a time.
6029 type gQueue struct {
6034 // empty reports whether q is empty.
6035 func (q *gQueue) empty() bool {
6039 // push adds gp to the head of q.
6040 func (q *gQueue) push(gp *g) {
6041 gp.schedlink = q.head
6048 // pushBack adds gp to the tail of q.
6049 func (q *gQueue) pushBack(gp *g) {
6052 q.tail.ptr().schedlink.set(gp)
6059 // pushBackAll adds all Gs in q2 to the tail of q. After this q2 must
6061 func (q *gQueue) pushBackAll(q2 gQueue) {
6065 q2.tail.ptr().schedlink = 0
6067 q.tail.ptr().schedlink = q2.head
6074 // pop removes and returns the head of queue q. It returns nil if
6076 func (q *gQueue) pop() *g {
6079 q.head = gp.schedlink
6087 // popList takes all Gs in q and returns them as a gList.
6088 func (q *gQueue) popList() gList {
6089 stack := gList{q.head}
6094 // A gList is a list of Gs linked through g.schedlink. A G can only be
6095 // on one gQueue or gList at a time.
6100 // empty reports whether l is empty.
6101 func (l *gList) empty() bool {
6105 // push adds gp to the head of l.
6106 func (l *gList) push(gp *g) {
6107 gp.schedlink = l.head
6111 // pushAll prepends all Gs in q to l.
6112 func (l *gList) pushAll(q gQueue) {
6114 q.tail.ptr().schedlink = l.head
6119 // pop removes and returns the head of l. If l is empty, it returns nil.
6120 func (l *gList) pop() *g {
6123 l.head = gp.schedlink
6128 //go:linkname setMaxThreads runtime/debug.setMaxThreads
6129 func setMaxThreads(in int) (out int) {
6131 out = int(sched.maxmcount)
6132 if in > 0x7fffffff { // MaxInt32
6133 sched.maxmcount = 0x7fffffff
6135 sched.maxmcount = int32(in)
6143 func procPin() int {
6148 return int(mp.p.ptr().id)
6157 //go:linkname sync_runtime_procPin sync.runtime_procPin
6159 func sync_runtime_procPin() int {
6163 //go:linkname sync_runtime_procUnpin sync.runtime_procUnpin
6165 func sync_runtime_procUnpin() {
6169 //go:linkname sync_atomic_runtime_procPin sync/atomic.runtime_procPin
6171 func sync_atomic_runtime_procPin() int {
6175 //go:linkname sync_atomic_runtime_procUnpin sync/atomic.runtime_procUnpin
6177 func sync_atomic_runtime_procUnpin() {
6181 // Active spinning for sync.Mutex.
6183 //go:linkname sync_runtime_canSpin sync.runtime_canSpin
6185 func sync_runtime_canSpin(i int) bool {
6186 // sync.Mutex is cooperative, so we are conservative with spinning.
6187 // Spin only few times and only if running on a multicore machine and
6188 // GOMAXPROCS>1 and there is at least one other running P and local runq is empty.
6189 // As opposed to runtime mutex we don't do passive spinning here,
6190 // because there can be work on global runq or on other Ps.
6191 if i >= active_spin || ncpu <= 1 || gomaxprocs <= sched.npidle.Load()+sched.nmspinning.Load()+1 {
6194 if p := getg().m.p.ptr(); !runqempty(p) {
6200 //go:linkname sync_runtime_doSpin sync.runtime_doSpin
6202 func sync_runtime_doSpin() {
6203 procyield(active_spin_cnt)
6206 var stealOrder randomOrder
6208 // randomOrder/randomEnum are helper types for randomized work stealing.
6209 // They allow to enumerate all Ps in different pseudo-random orders without repetitions.
6210 // The algorithm is based on the fact that if we have X such that X and GOMAXPROCS
6211 // are coprime, then a sequences of (i + X) % GOMAXPROCS gives the required enumeration.
6212 type randomOrder struct {
6217 type randomEnum struct {
6224 func (ord *randomOrder) reset(count uint32) {
6226 ord.coprimes = ord.coprimes[:0]
6227 for i := uint32(1); i <= count; i++ {
6228 if gcd(i, count) == 1 {
6229 ord.coprimes = append(ord.coprimes, i)
6234 func (ord *randomOrder) start(i uint32) randomEnum {
6238 inc: ord.coprimes[i/ord.count%uint32(len(ord.coprimes))],
6242 func (enum *randomEnum) done() bool {
6243 return enum.i == enum.count
6246 func (enum *randomEnum) next() {
6248 enum.pos = (enum.pos + enum.inc) % enum.count
6251 func (enum *randomEnum) position() uint32 {
6255 func gcd(a, b uint32) uint32 {
6262 // An initTask represents the set of initializations that need to be done for a package.
6263 // Keep in sync with ../../test/initempty.go:initTask
6264 type initTask struct {
6265 // TODO: pack the first 3 fields more tightly?
6266 state uintptr // 0 = uninitialized, 1 = in progress, 2 = done
6269 // followed by ndeps instances of an *initTask, one per package depended on
6270 // followed by nfns pcs, one per init function to run
6273 // inittrace stores statistics for init functions which are
6274 // updated by malloc and newproc when active is true.
6275 var inittrace tracestat
6277 type tracestat struct {
6278 active bool // init tracing activation status
6279 id uint64 // init goroutine id
6280 allocs uint64 // heap allocations
6281 bytes uint64 // heap allocated bytes
6284 func doInit(t *initTask) {
6286 case 2: // fully initialized
6288 case 1: // initialization in progress
6289 throw("recursive call during initialization - linker skew")
6290 default: // not initialized yet
6291 t.state = 1 // initialization in progress
6293 for i := uintptr(0); i < t.ndeps; i++ {
6294 p := add(unsafe.Pointer(t), (3+i)*goarch.PtrSize)
6295 t2 := *(**initTask)(p)
6300 t.state = 2 // initialization done
6309 if inittrace.active {
6311 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6315 firstFunc := add(unsafe.Pointer(t), (3+t.ndeps)*goarch.PtrSize)
6316 for i := uintptr(0); i < t.nfns; i++ {
6317 p := add(firstFunc, i*goarch.PtrSize)
6318 f := *(*func())(unsafe.Pointer(&p))
6322 if inittrace.active {
6324 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6327 f := *(*func())(unsafe.Pointer(&firstFunc))
6328 pkg := funcpkgpath(findfunc(abi.FuncPCABIInternal(f)))
6331 print("init ", pkg, " @")
6332 print(string(fmtNSAsMS(sbuf[:], uint64(start-runtimeInitTime))), " ms, ")
6333 print(string(fmtNSAsMS(sbuf[:], uint64(end-start))), " ms clock, ")
6334 print(string(itoa(sbuf[:], after.bytes-before.bytes)), " bytes, ")
6335 print(string(itoa(sbuf[:], after.allocs-before.allocs)), " allocs")
6339 t.state = 2 // initialization done