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 or global 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
121 // This slice records the initializing tasks that need to be
122 // done to start up the runtime. It is built by the linker.
123 var runtime_inittasks []*initTask
125 // main_init_done is a signal used by cgocallbackg that initialization
126 // has been completed. It is made before _cgo_notify_runtime_init_done,
127 // so all cgo calls can rely on it existing. When main_init is complete,
128 // it is closed, meaning cgocallbackg can reliably receive from it.
129 var main_init_done chan bool
131 //go:linkname main_main main.main
134 // mainStarted indicates that the main M has started.
137 // runtimeInitTime is the nanotime() at which the runtime started.
138 var runtimeInitTime int64
140 // Value to use for signal mask for newly created M's.
141 var initSigmask sigset
143 // The main goroutine.
147 // Racectx of m0->g0 is used only as the parent of the main goroutine.
148 // It must not be used for anything else.
151 // Max stack size is 1 GB on 64-bit, 250 MB on 32-bit.
152 // Using decimal instead of binary GB and MB because
153 // they look nicer in the stack overflow failure message.
154 if goarch.PtrSize == 8 {
155 maxstacksize = 1000000000
157 maxstacksize = 250000000
160 // An upper limit for max stack size. Used to avoid random crashes
161 // after calling SetMaxStack and trying to allocate a stack that is too big,
162 // since stackalloc works with 32-bit sizes.
163 maxstackceiling = 2 * maxstacksize
165 // Allow newproc to start new Ms.
168 if GOARCH != "wasm" { // no threads on wasm yet, so no sysmon
170 newm(sysmon, nil, -1)
174 // Lock the main goroutine onto this, the main OS thread,
175 // during initialization. Most programs won't care, but a few
176 // do require certain calls to be made by the main thread.
177 // Those can arrange for main.main to run in the main thread
178 // by calling runtime.LockOSThread during initialization
179 // to preserve the lock.
183 throw("runtime.main not on m0")
186 // Record when the world started.
187 // Must be before doInit for tracing init.
188 runtimeInitTime = nanotime()
189 if runtimeInitTime == 0 {
190 throw("nanotime returning zero")
193 if debug.inittrace != 0 {
194 inittrace.id = getg().goid
195 inittrace.active = true
198 doInit(runtime_inittasks) // Must be before defer.
200 // Defer unlock so that runtime.Goexit during init does the unlock too.
210 main_init_done = make(chan bool)
212 if _cgo_pthread_key_created == nil {
213 throw("_cgo_pthread_key_created missing")
216 if _cgo_thread_start == nil {
217 throw("_cgo_thread_start missing")
219 if GOOS != "windows" {
220 if _cgo_setenv == nil {
221 throw("_cgo_setenv missing")
223 if _cgo_unsetenv == nil {
224 throw("_cgo_unsetenv missing")
227 if _cgo_notify_runtime_init_done == nil {
228 throw("_cgo_notify_runtime_init_done missing")
231 // Set the x_crosscall2_ptr C function pointer variable point to crosscall2.
232 if set_crosscall2 == nil {
233 throw("set_crosscall2 missing")
237 // Start the template thread in case we enter Go from
238 // a C-created thread and need to create a new thread.
239 startTemplateThread()
240 cgocall(_cgo_notify_runtime_init_done, nil)
243 // Run the initializing tasks. Depending on build mode this
244 // list can arrive a few different ways, but it will always
245 // contain the init tasks computed by the linker for all the
246 // packages in the program (excluding those added at runtime
247 // by package plugin).
248 for _, m := range activeModules() {
252 // Disable init tracing after main init done to avoid overhead
253 // of collecting statistics in malloc and newproc
254 inittrace.active = false
256 close(main_init_done)
261 if isarchive || islibrary {
262 // A program compiled with -buildmode=c-archive or c-shared
263 // has a main, but it is not executed.
266 fn := main_main // make an indirect call, as the linker doesn't know the address of the main package when laying down the runtime
269 runExitHooks(0) // run hooks now, since racefini does not return
273 // Make racy client program work: if panicking on
274 // another goroutine at the same time as main returns,
275 // let the other goroutine finish printing the panic trace.
276 // Once it does, it will exit. See issues 3934 and 20018.
277 if runningPanicDefers.Load() != 0 {
278 // Running deferred functions should not take long.
279 for c := 0; c < 1000; c++ {
280 if runningPanicDefers.Load() == 0 {
286 if panicking.Load() != 0 {
287 gopark(nil, nil, waitReasonPanicWait, traceBlockForever, 1)
298 // os_beforeExit is called from os.Exit(0).
300 //go:linkname os_beforeExit os.runtime_beforeExit
301 func os_beforeExit(exitCode int) {
302 runExitHooks(exitCode)
303 if exitCode == 0 && raceenabled {
308 // start forcegc helper goroutine
313 func forcegchelper() {
315 lockInit(&forcegc.lock, lockRankForcegc)
318 if forcegc.idle.Load() {
319 throw("forcegc: phase error")
321 forcegc.idle.Store(true)
322 goparkunlock(&forcegc.lock, waitReasonForceGCIdle, traceBlockSystemGoroutine, 1)
323 // this goroutine is explicitly resumed by sysmon
324 if debug.gctrace > 0 {
327 // Time-triggered, fully concurrent.
328 gcStart(gcTrigger{kind: gcTriggerTime, now: nanotime()})
332 // Gosched yields the processor, allowing other goroutines to run. It does not
333 // suspend the current goroutine, so execution resumes automatically.
341 // goschedguarded yields the processor like gosched, but also checks
342 // for forbidden states and opts out of the yield in those cases.
345 func goschedguarded() {
346 mcall(goschedguarded_m)
349 // goschedIfBusy yields the processor like gosched, but only does so if
350 // there are no idle Ps or if we're on the only P and there's nothing in
351 // the run queue. In both cases, there is freely available idle time.
354 func goschedIfBusy() {
356 // Call gosched if gp.preempt is set; we may be in a tight loop that
357 // doesn't otherwise yield.
358 if !gp.preempt && sched.npidle.Load() > 0 {
364 // Puts the current goroutine into a waiting state and calls unlockf on the
367 // If unlockf returns false, the goroutine is resumed.
369 // unlockf must not access this G's stack, as it may be moved between
370 // the call to gopark and the call to unlockf.
372 // Note that because unlockf is called after putting the G into a waiting
373 // state, the G may have already been readied by the time unlockf is called
374 // unless there is external synchronization preventing the G from being
375 // readied. If unlockf returns false, it must guarantee that the G cannot be
376 // externally readied.
378 // Reason explains why the goroutine has been parked. It is displayed in stack
379 // traces and heap dumps. Reasons should be unique and descriptive. Do not
380 // re-use reasons, add new ones.
381 func gopark(unlockf func(*g, unsafe.Pointer) bool, lock unsafe.Pointer, reason waitReason, traceReason traceBlockReason, traceskip int) {
382 if reason != waitReasonSleep {
383 checkTimeouts() // timeouts may expire while two goroutines keep the scheduler busy
387 status := readgstatus(gp)
388 if status != _Grunning && status != _Gscanrunning {
389 throw("gopark: bad g status")
392 mp.waitunlockf = unlockf
393 gp.waitreason = reason
394 mp.waitTraceBlockReason = traceReason
395 mp.waitTraceSkip = traceskip
397 // can't do anything that might move the G between Ms here.
401 // Puts the current goroutine into a waiting state and unlocks the lock.
402 // The goroutine can be made runnable again by calling goready(gp).
403 func goparkunlock(lock *mutex, reason waitReason, traceReason traceBlockReason, traceskip int) {
404 gopark(parkunlock_c, unsafe.Pointer(lock), reason, traceReason, traceskip)
407 func goready(gp *g, traceskip int) {
409 ready(gp, traceskip, true)
414 func acquireSudog() *sudog {
415 // Delicate dance: the semaphore implementation calls
416 // acquireSudog, acquireSudog calls new(sudog),
417 // new calls malloc, malloc can call the garbage collector,
418 // and the garbage collector calls the semaphore implementation
420 // Break the cycle by doing acquirem/releasem around new(sudog).
421 // The acquirem/releasem increments m.locks during new(sudog),
422 // which keeps the garbage collector from being invoked.
425 if len(pp.sudogcache) == 0 {
426 lock(&sched.sudoglock)
427 // First, try to grab a batch from central cache.
428 for len(pp.sudogcache) < cap(pp.sudogcache)/2 && sched.sudogcache != nil {
429 s := sched.sudogcache
430 sched.sudogcache = s.next
432 pp.sudogcache = append(pp.sudogcache, s)
434 unlock(&sched.sudoglock)
435 // If the central cache is empty, allocate a new one.
436 if len(pp.sudogcache) == 0 {
437 pp.sudogcache = append(pp.sudogcache, new(sudog))
440 n := len(pp.sudogcache)
441 s := pp.sudogcache[n-1]
442 pp.sudogcache[n-1] = nil
443 pp.sudogcache = pp.sudogcache[:n-1]
445 throw("acquireSudog: found s.elem != nil in cache")
452 func releaseSudog(s *sudog) {
454 throw("runtime: sudog with non-nil elem")
457 throw("runtime: sudog with non-false isSelect")
460 throw("runtime: sudog with non-nil next")
463 throw("runtime: sudog with non-nil prev")
465 if s.waitlink != nil {
466 throw("runtime: sudog with non-nil waitlink")
469 throw("runtime: sudog with non-nil c")
473 throw("runtime: releaseSudog with non-nil gp.param")
475 mp := acquirem() // avoid rescheduling to another P
477 if len(pp.sudogcache) == cap(pp.sudogcache) {
478 // Transfer half of local cache to the central cache.
479 var first, last *sudog
480 for len(pp.sudogcache) > cap(pp.sudogcache)/2 {
481 n := len(pp.sudogcache)
482 p := pp.sudogcache[n-1]
483 pp.sudogcache[n-1] = nil
484 pp.sudogcache = pp.sudogcache[:n-1]
492 lock(&sched.sudoglock)
493 last.next = sched.sudogcache
494 sched.sudogcache = first
495 unlock(&sched.sudoglock)
497 pp.sudogcache = append(pp.sudogcache, s)
501 // called from assembly.
502 func badmcall(fn func(*g)) {
503 throw("runtime: mcall called on m->g0 stack")
506 func badmcall2(fn func(*g)) {
507 throw("runtime: mcall function returned")
510 func badreflectcall() {
511 panic(plainError("arg size to reflect.call more than 1GB"))
515 //go:nowritebarrierrec
516 func badmorestackg0() {
517 writeErrStr("fatal: morestack on g0\n")
521 //go:nowritebarrierrec
522 func badmorestackgsignal() {
523 writeErrStr("fatal: morestack on gsignal\n")
531 func lockedOSThread() bool {
533 return gp.lockedm != 0 && gp.m.lockedg != 0
537 // allgs contains all Gs ever created (including dead Gs), and thus
540 // Access via the slice is protected by allglock or stop-the-world.
541 // Readers that cannot take the lock may (carefully!) use the atomic
546 // allglen and allgptr are atomic variables that contain len(allgs) and
547 // &allgs[0] respectively. Proper ordering depends on totally-ordered
548 // loads and stores. Writes are protected by allglock.
550 // allgptr is updated before allglen. Readers should read allglen
551 // before allgptr to ensure that allglen is always <= len(allgptr). New
552 // Gs appended during the race can be missed. For a consistent view of
553 // all Gs, allglock must be held.
555 // allgptr copies should always be stored as a concrete type or
556 // unsafe.Pointer, not uintptr, to ensure that GC can still reach it
557 // even if it points to a stale array.
562 func allgadd(gp *g) {
563 if readgstatus(gp) == _Gidle {
564 throw("allgadd: bad status Gidle")
568 allgs = append(allgs, gp)
569 if &allgs[0] != allgptr {
570 atomicstorep(unsafe.Pointer(&allgptr), unsafe.Pointer(&allgs[0]))
572 atomic.Storeuintptr(&allglen, uintptr(len(allgs)))
576 // allGsSnapshot returns a snapshot of the slice of all Gs.
578 // The world must be stopped or allglock must be held.
579 func allGsSnapshot() []*g {
580 assertWorldStoppedOrLockHeld(&allglock)
582 // Because the world is stopped or allglock is held, allgadd
583 // cannot happen concurrently with this. allgs grows
584 // monotonically and existing entries never change, so we can
585 // simply return a copy of the slice header. For added safety,
586 // we trim everything past len because that can still change.
587 return allgs[:len(allgs):len(allgs)]
590 // atomicAllG returns &allgs[0] and len(allgs) for use with atomicAllGIndex.
591 func atomicAllG() (**g, uintptr) {
592 length := atomic.Loaduintptr(&allglen)
593 ptr := (**g)(atomic.Loadp(unsafe.Pointer(&allgptr)))
597 // atomicAllGIndex returns ptr[i] with the allgptr returned from atomicAllG.
598 func atomicAllGIndex(ptr **g, i uintptr) *g {
599 return *(**g)(add(unsafe.Pointer(ptr), i*goarch.PtrSize))
602 // forEachG calls fn on every G from allgs.
604 // forEachG takes a lock to exclude concurrent addition of new Gs.
605 func forEachG(fn func(gp *g)) {
607 for _, gp := range allgs {
613 // forEachGRace calls fn on every G from allgs.
615 // forEachGRace avoids locking, but does not exclude addition of new Gs during
616 // execution, which may be missed.
617 func forEachGRace(fn func(gp *g)) {
618 ptr, length := atomicAllG()
619 for i := uintptr(0); i < length; i++ {
620 gp := atomicAllGIndex(ptr, i)
627 // Number of goroutine ids to grab from sched.goidgen to local per-P cache at once.
628 // 16 seems to provide enough amortization, but other than that it's mostly arbitrary number.
632 // cpuinit sets up CPU feature flags and calls internal/cpu.Initialize. env should be the complete
633 // value of the GODEBUG environment variable.
634 func cpuinit(env string) {
636 case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
637 cpu.DebugOptions = true
641 // Support cpu feature variables are used in code generated by the compiler
642 // to guard execution of instructions that can not be assumed to be always supported.
645 x86HasPOPCNT = cpu.X86.HasPOPCNT
646 x86HasSSE41 = cpu.X86.HasSSE41
647 x86HasFMA = cpu.X86.HasFMA
650 armHasVFPv4 = cpu.ARM.HasVFPv4
653 arm64HasATOMICS = cpu.ARM64.HasATOMICS
657 // getGodebugEarly extracts the environment variable GODEBUG from the environment on
658 // Unix-like operating systems and returns it. This function exists to extract GODEBUG
659 // early before much of the runtime is initialized.
660 func getGodebugEarly() string {
661 const prefix = "GODEBUG="
664 case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
665 // Similar to goenv_unix but extracts the environment value for
667 // TODO(moehrmann): remove when general goenvs() can be called before cpuinit()
669 for argv_index(argv, argc+1+n) != nil {
673 for i := int32(0); i < n; i++ {
674 p := argv_index(argv, argc+1+i)
675 s := unsafe.String(p, findnull(p))
677 if hasPrefix(s, prefix) {
678 env = gostring(p)[len(prefix):]
686 // The bootstrap sequence is:
690 // make & queue new G
691 // call runtime·mstart
693 // The new G calls runtime·main.
695 lockInit(&sched.lock, lockRankSched)
696 lockInit(&sched.sysmonlock, lockRankSysmon)
697 lockInit(&sched.deferlock, lockRankDefer)
698 lockInit(&sched.sudoglock, lockRankSudog)
699 lockInit(&deadlock, lockRankDeadlock)
700 lockInit(&paniclk, lockRankPanic)
701 lockInit(&allglock, lockRankAllg)
702 lockInit(&allpLock, lockRankAllp)
703 lockInit(&reflectOffs.lock, lockRankReflectOffs)
704 lockInit(&finlock, lockRankFin)
705 lockInit(&cpuprof.lock, lockRankCpuprof)
707 // Enforce that this lock is always a leaf lock.
708 // All of this lock's critical sections should be
710 lockInit(&memstats.heapStats.noPLock, lockRankLeafRank)
712 // raceinit must be the first call to race detector.
713 // In particular, it must be done before mallocinit below calls racemapshadow.
716 gp.racectx, raceprocctx0 = raceinit()
719 sched.maxmcount = 10000
721 // The world starts stopped.
727 godebug := getGodebugEarly()
728 initPageTrace(godebug) // must run after mallocinit but before anything allocates
729 cpuinit(godebug) // must run before alginit
730 alginit() // maps, hash, fastrand must not be used before this call
731 fastrandinit() // must run before mcommoninit
732 mcommoninit(gp.m, -1)
733 modulesinit() // provides activeModules
734 typelinksinit() // uses maps, activeModules
735 itabsinit() // uses activeModules
736 stkobjinit() // must run before GC starts
738 sigsave(&gp.m.sigmask)
739 initSigmask = gp.m.sigmask
747 // if disableMemoryProfiling is set, update MemProfileRate to 0 to turn off memprofile.
748 // Note: parsedebugvars may update MemProfileRate, but when disableMemoryProfiling is
749 // set to true by the linker, it means that nothing is consuming the profile, it is
750 // safe to set MemProfileRate to 0.
751 if disableMemoryProfiling {
756 sched.lastpoll.Store(nanotime())
758 if n, ok := atoi32(gogetenv("GOMAXPROCS")); ok && n > 0 {
761 if procresize(procs) != nil {
762 throw("unknown runnable goroutine during bootstrap")
766 // World is effectively started now, as P's can run.
769 if buildVersion == "" {
770 // Condition should never trigger. This code just serves
771 // to ensure runtime·buildVersion is kept in the resulting binary.
772 buildVersion = "unknown"
774 if len(modinfo) == 1 {
775 // Condition should never trigger. This code just serves
776 // to ensure runtime·modinfo is kept in the resulting binary.
781 func dumpgstatus(gp *g) {
783 print("runtime: gp: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
784 print("runtime: getg: g=", thisg, ", goid=", thisg.goid, ", g->atomicstatus=", readgstatus(thisg), "\n")
787 // sched.lock must be held.
789 assertLockHeld(&sched.lock)
791 // Exclude extra M's, which are used for cgocallback from threads
794 // The purpose of the SetMaxThreads limit is to avoid accidental fork
795 // bomb from something like millions of goroutines blocking on system
796 // calls, causing the runtime to create millions of threads. By
797 // definition, this isn't a problem for threads created in C, so we
798 // exclude them from the limit. See https://go.dev/issue/60004.
799 count := mcount() - int32(extraMInUse.Load()) - int32(extraMLength.Load())
800 if count > sched.maxmcount {
801 print("runtime: program exceeds ", sched.maxmcount, "-thread limit\n")
802 throw("thread exhaustion")
806 // mReserveID returns the next ID to use for a new m. This new m is immediately
807 // considered 'running' by checkdead.
809 // sched.lock must be held.
810 func mReserveID() int64 {
811 assertLockHeld(&sched.lock)
813 if sched.mnext+1 < sched.mnext {
814 throw("runtime: thread ID overflow")
822 // Pre-allocated ID may be passed as 'id', or omitted by passing -1.
823 func mcommoninit(mp *m, id int64) {
826 // g0 stack won't make sense for user (and is not necessary unwindable).
828 callers(1, mp.createstack[:])
839 lo := uint32(int64Hash(uint64(mp.id), fastrandseed))
840 hi := uint32(int64Hash(uint64(cputicks()), ^fastrandseed))
844 // Same behavior as for 1.17.
845 // TODO: Simplify this.
846 if goarch.BigEndian {
847 mp.fastrand = uint64(lo)<<32 | uint64(hi)
849 mp.fastrand = uint64(hi)<<32 | uint64(lo)
853 if mp.gsignal != nil {
854 mp.gsignal.stackguard1 = mp.gsignal.stack.lo + stackGuard
857 // Add to allm so garbage collector doesn't free g->m
858 // when it is just in a register or thread-local storage.
861 // NumCgoCall() iterates over allm w/o schedlock,
862 // so we need to publish it safely.
863 atomicstorep(unsafe.Pointer(&allm), unsafe.Pointer(mp))
866 // Allocate memory to hold a cgo traceback if the cgo call crashes.
867 if iscgo || GOOS == "solaris" || GOOS == "illumos" || GOOS == "windows" {
868 mp.cgoCallers = new(cgoCallers)
872 func (mp *m) becomeSpinning() {
874 sched.nmspinning.Add(1)
875 sched.needspinning.Store(0)
878 func (mp *m) hasCgoOnStack() bool {
879 return mp.ncgo > 0 || mp.isextra
882 var fastrandseed uintptr
884 func fastrandinit() {
885 s := (*[unsafe.Sizeof(fastrandseed)]byte)(unsafe.Pointer(&fastrandseed))[:]
889 // Mark gp ready to run.
890 func ready(gp *g, traceskip int, next bool) {
892 traceGoUnpark(gp, traceskip)
895 status := readgstatus(gp)
898 mp := acquirem() // disable preemption because it can be holding p in a local var
899 if status&^_Gscan != _Gwaiting {
901 throw("bad g->status in ready")
904 // status is Gwaiting or Gscanwaiting, make Grunnable and put on runq
905 casgstatus(gp, _Gwaiting, _Grunnable)
906 runqput(mp.p.ptr(), gp, next)
911 // freezeStopWait is a large value that freezetheworld sets
912 // sched.stopwait to in order to request that all Gs permanently stop.
913 const freezeStopWait = 0x7fffffff
915 // freezing is set to non-zero if the runtime is trying to freeze the
917 var freezing atomic.Bool
919 // Similar to stopTheWorld but best-effort and can be called several times.
920 // There is no reverse operation, used during crashing.
921 // This function must not lock any mutexes.
922 func freezetheworld() {
924 if debug.dontfreezetheworld > 0 {
925 // Don't prempt Ps to stop goroutines. That will perturb
926 // scheduler state, making debugging more difficult. Instead,
927 // allow goroutines to continue execution.
929 // fatalpanic will tracebackothers to trace all goroutines. It
930 // is unsafe to trace a running goroutine, so tracebackothers
931 // will skip running goroutines. That is OK and expected, we
932 // expect users of dontfreezetheworld to use core files anyway.
934 // However, allowing the scheduler to continue running free
935 // introduces a race: a goroutine may be stopped when
936 // tracebackothers checks its status, and then start running
937 // later when we are in the middle of traceback, potentially
940 // To mitigate this, when an M naturally enters the scheduler,
941 // schedule checks if freezing is set and if so stops
942 // execution. This guarantees that while Gs can transition from
943 // running to stopped, they can never transition from stopped
946 // The sleep here allows racing Ms that missed freezing and are
947 // about to run a G to complete the transition to running
948 // before we start traceback.
953 // stopwait and preemption requests can be lost
954 // due to races with concurrently executing threads,
955 // so try several times
956 for i := 0; i < 5; i++ {
957 // this should tell the scheduler to not start any new goroutines
958 sched.stopwait = freezeStopWait
959 sched.gcwaiting.Store(true)
960 // this should stop running goroutines
962 break // no running goroutines
972 // All reads and writes of g's status go through readgstatus, casgstatus
973 // castogscanstatus, casfrom_Gscanstatus.
976 func readgstatus(gp *g) uint32 {
977 return gp.atomicstatus.Load()
980 // The Gscanstatuses are acting like locks and this releases them.
981 // If it proves to be a performance hit we should be able to make these
982 // simple atomic stores but for now we are going to throw if
983 // we see an inconsistent state.
984 func casfrom_Gscanstatus(gp *g, oldval, newval uint32) {
987 // Check that transition is valid.
990 print("runtime: casfrom_Gscanstatus bad oldval gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
992 throw("casfrom_Gscanstatus:top gp->status is not in scan state")
998 if newval == oldval&^_Gscan {
999 success = gp.atomicstatus.CompareAndSwap(oldval, newval)
1003 print("runtime: casfrom_Gscanstatus failed gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
1005 throw("casfrom_Gscanstatus: gp->status is not in scan state")
1007 releaseLockRank(lockRankGscan)
1010 // This will return false if the gp is not in the expected status and the cas fails.
1011 // This acts like a lock acquire while the casfromgstatus acts like a lock release.
1012 func castogscanstatus(gp *g, oldval, newval uint32) bool {
1018 if newval == oldval|_Gscan {
1019 r := gp.atomicstatus.CompareAndSwap(oldval, newval)
1021 acquireLockRank(lockRankGscan)
1027 print("runtime: castogscanstatus oldval=", hex(oldval), " newval=", hex(newval), "\n")
1028 throw("castogscanstatus")
1029 panic("not reached")
1032 // casgstatusAlwaysTrack is a debug flag that causes casgstatus to always track
1033 // various latencies on every transition instead of sampling them.
1034 var casgstatusAlwaysTrack = false
1036 // If asked to move to or from a Gscanstatus this will throw. Use the castogscanstatus
1037 // and casfrom_Gscanstatus instead.
1038 // casgstatus will loop if the g->atomicstatus is in a Gscan status until the routine that
1039 // put it in the Gscan state is finished.
1042 func casgstatus(gp *g, oldval, newval uint32) {
1043 if (oldval&_Gscan != 0) || (newval&_Gscan != 0) || oldval == newval {
1044 systemstack(func() {
1045 print("runtime: casgstatus: oldval=", hex(oldval), " newval=", hex(newval), "\n")
1046 throw("casgstatus: bad incoming values")
1050 acquireLockRank(lockRankGscan)
1051 releaseLockRank(lockRankGscan)
1053 // See https://golang.org/cl/21503 for justification of the yield delay.
1054 const yieldDelay = 5 * 1000
1057 // loop if gp->atomicstatus is in a scan state giving
1058 // GC time to finish and change the state to oldval.
1059 for i := 0; !gp.atomicstatus.CompareAndSwap(oldval, newval); i++ {
1060 if oldval == _Gwaiting && gp.atomicstatus.Load() == _Grunnable {
1061 throw("casgstatus: waiting for Gwaiting but is Grunnable")
1064 nextYield = nanotime() + yieldDelay
1066 if nanotime() < nextYield {
1067 for x := 0; x < 10 && gp.atomicstatus.Load() != oldval; x++ {
1072 nextYield = nanotime() + yieldDelay/2
1076 if oldval == _Grunning {
1077 // Track every gTrackingPeriod time a goroutine transitions out of running.
1078 if casgstatusAlwaysTrack || gp.trackingSeq%gTrackingPeriod == 0 {
1087 // Handle various kinds of tracking.
1090 // - Time spent in runnable.
1091 // - Time spent blocked on a sync.Mutex or sync.RWMutex.
1094 // We transitioned out of runnable, so measure how much
1095 // time we spent in this state and add it to
1098 gp.runnableTime += now - gp.trackingStamp
1099 gp.trackingStamp = 0
1101 if !gp.waitreason.isMutexWait() {
1102 // Not blocking on a lock.
1105 // Blocking on a lock, measure it. Note that because we're
1106 // sampling, we have to multiply by our sampling period to get
1107 // a more representative estimate of the absolute value.
1108 // gTrackingPeriod also represents an accurate sampling period
1109 // because we can only enter this state from _Grunning.
1111 sched.totalMutexWaitTime.Add((now - gp.trackingStamp) * gTrackingPeriod)
1112 gp.trackingStamp = 0
1116 if !gp.waitreason.isMutexWait() {
1117 // Not blocking on a lock.
1120 // Blocking on a lock. Write down the timestamp.
1122 gp.trackingStamp = now
1124 // We just transitioned into runnable, so record what
1125 // time that happened.
1127 gp.trackingStamp = now
1129 // We're transitioning into running, so turn off
1130 // tracking and record how much time we spent in
1133 sched.timeToRun.record(gp.runnableTime)
1138 // casGToWaiting transitions gp from old to _Gwaiting, and sets the wait reason.
1140 // Use this over casgstatus when possible to ensure that a waitreason is set.
1141 func casGToWaiting(gp *g, old uint32, reason waitReason) {
1142 // Set the wait reason before calling casgstatus, because casgstatus will use it.
1143 gp.waitreason = reason
1144 casgstatus(gp, old, _Gwaiting)
1147 // casgstatus(gp, oldstatus, Gcopystack), assuming oldstatus is Gwaiting or Grunnable.
1148 // Returns old status. Cannot call casgstatus directly, because we are racing with an
1149 // async wakeup that might come in from netpoll. If we see Gwaiting from the readgstatus,
1150 // it might have become Grunnable by the time we get to the cas. If we called casgstatus,
1151 // it would loop waiting for the status to go back to Gwaiting, which it never will.
1154 func casgcopystack(gp *g) uint32 {
1156 oldstatus := readgstatus(gp) &^ _Gscan
1157 if oldstatus != _Gwaiting && oldstatus != _Grunnable {
1158 throw("copystack: bad status, not Gwaiting or Grunnable")
1160 if gp.atomicstatus.CompareAndSwap(oldstatus, _Gcopystack) {
1166 // casGToPreemptScan transitions gp from _Grunning to _Gscan|_Gpreempted.
1168 // TODO(austin): This is the only status operation that both changes
1169 // the status and locks the _Gscan bit. Rethink this.
1170 func casGToPreemptScan(gp *g, old, new uint32) {
1171 if old != _Grunning || new != _Gscan|_Gpreempted {
1172 throw("bad g transition")
1174 acquireLockRank(lockRankGscan)
1175 for !gp.atomicstatus.CompareAndSwap(_Grunning, _Gscan|_Gpreempted) {
1179 // casGFromPreempted attempts to transition gp from _Gpreempted to
1180 // _Gwaiting. If successful, the caller is responsible for
1181 // re-scheduling gp.
1182 func casGFromPreempted(gp *g, old, new uint32) bool {
1183 if old != _Gpreempted || new != _Gwaiting {
1184 throw("bad g transition")
1186 gp.waitreason = waitReasonPreempted
1187 return gp.atomicstatus.CompareAndSwap(_Gpreempted, _Gwaiting)
1190 // stwReason is an enumeration of reasons the world is stopping.
1191 type stwReason uint8
1193 // Reasons to stop-the-world.
1195 // Avoid reusing reasons and add new ones instead.
1197 stwUnknown stwReason = iota // "unknown"
1198 stwGCMarkTerm // "GC mark termination"
1199 stwGCSweepTerm // "GC sweep termination"
1200 stwWriteHeapDump // "write heap dump"
1201 stwGoroutineProfile // "goroutine profile"
1202 stwGoroutineProfileCleanup // "goroutine profile cleanup"
1203 stwAllGoroutinesStack // "all goroutines stack trace"
1204 stwReadMemStats // "read mem stats"
1205 stwAllThreadsSyscall // "AllThreadsSyscall"
1206 stwGOMAXPROCS // "GOMAXPROCS"
1207 stwStartTrace // "start trace"
1208 stwStopTrace // "stop trace"
1209 stwForTestCountPagesInUse // "CountPagesInUse (test)"
1210 stwForTestReadMetricsSlow // "ReadMetricsSlow (test)"
1211 stwForTestReadMemStatsSlow // "ReadMemStatsSlow (test)"
1212 stwForTestPageCachePagesLeaked // "PageCachePagesLeaked (test)"
1213 stwForTestResetDebugLog // "ResetDebugLog (test)"
1216 func (r stwReason) String() string {
1217 return stwReasonStrings[r]
1220 // If you add to this list, also add it to src/internal/trace/parser.go.
1221 // If you change the values of any of the stw* constants, bump the trace
1222 // version number and make a copy of this.
1223 var stwReasonStrings = [...]string{
1224 stwUnknown: "unknown",
1225 stwGCMarkTerm: "GC mark termination",
1226 stwGCSweepTerm: "GC sweep termination",
1227 stwWriteHeapDump: "write heap dump",
1228 stwGoroutineProfile: "goroutine profile",
1229 stwGoroutineProfileCleanup: "goroutine profile cleanup",
1230 stwAllGoroutinesStack: "all goroutines stack trace",
1231 stwReadMemStats: "read mem stats",
1232 stwAllThreadsSyscall: "AllThreadsSyscall",
1233 stwGOMAXPROCS: "GOMAXPROCS",
1234 stwStartTrace: "start trace",
1235 stwStopTrace: "stop trace",
1236 stwForTestCountPagesInUse: "CountPagesInUse (test)",
1237 stwForTestReadMetricsSlow: "ReadMetricsSlow (test)",
1238 stwForTestReadMemStatsSlow: "ReadMemStatsSlow (test)",
1239 stwForTestPageCachePagesLeaked: "PageCachePagesLeaked (test)",
1240 stwForTestResetDebugLog: "ResetDebugLog (test)",
1243 // stopTheWorld stops all P's from executing goroutines, interrupting
1244 // all goroutines at GC safe points and records reason as the reason
1245 // for the stop. On return, only the current goroutine's P is running.
1246 // stopTheWorld must not be called from a system stack and the caller
1247 // must not hold worldsema. The caller must call startTheWorld when
1248 // other P's should resume execution.
1250 // stopTheWorld is safe for multiple goroutines to call at the
1251 // same time. Each will execute its own stop, and the stops will
1254 // This is also used by routines that do stack dumps. If the system is
1255 // in panic or being exited, this may not reliably stop all
1257 func stopTheWorld(reason stwReason) {
1258 semacquire(&worldsema)
1260 gp.m.preemptoff = reason.String()
1261 systemstack(func() {
1262 // Mark the goroutine which called stopTheWorld preemptible so its
1263 // stack may be scanned.
1264 // This lets a mark worker scan us while we try to stop the world
1265 // since otherwise we could get in a mutual preemption deadlock.
1266 // We must not modify anything on the G stack because a stack shrink
1267 // may occur. A stack shrink is otherwise OK though because in order
1268 // to return from this function (and to leave the system stack) we
1269 // must have preempted all goroutines, including any attempting
1270 // to scan our stack, in which case, any stack shrinking will
1271 // have already completed by the time we exit.
1272 // Don't provide a wait reason because we're still executing.
1273 casGToWaiting(gp, _Grunning, waitReasonStoppingTheWorld)
1274 stopTheWorldWithSema(reason)
1275 casgstatus(gp, _Gwaiting, _Grunning)
1279 // startTheWorld undoes the effects of stopTheWorld.
1280 func startTheWorld() {
1281 systemstack(func() { startTheWorldWithSema() })
1283 // worldsema must be held over startTheWorldWithSema to ensure
1284 // gomaxprocs cannot change while worldsema is held.
1286 // Release worldsema with direct handoff to the next waiter, but
1287 // acquirem so that semrelease1 doesn't try to yield our time.
1289 // Otherwise if e.g. ReadMemStats is being called in a loop,
1290 // it might stomp on other attempts to stop the world, such as
1291 // for starting or ending GC. The operation this blocks is
1292 // so heavy-weight that we should just try to be as fair as
1295 // We don't want to just allow us to get preempted between now
1296 // and releasing the semaphore because then we keep everyone
1297 // (including, for example, GCs) waiting longer.
1300 semrelease1(&worldsema, true, 0)
1304 // stopTheWorldGC has the same effect as stopTheWorld, but blocks
1305 // until the GC is not running. It also blocks a GC from starting
1306 // until startTheWorldGC is called.
1307 func stopTheWorldGC(reason stwReason) {
1309 stopTheWorld(reason)
1312 // startTheWorldGC undoes the effects of stopTheWorldGC.
1313 func startTheWorldGC() {
1318 // Holding worldsema grants an M the right to try to stop the world.
1319 var worldsema uint32 = 1
1321 // Holding gcsema grants the M the right to block a GC, and blocks
1322 // until the current GC is done. In particular, it prevents gomaxprocs
1323 // from changing concurrently.
1325 // TODO(mknyszek): Once gomaxprocs and the execution tracer can handle
1326 // being changed/enabled during a GC, remove this.
1327 var gcsema uint32 = 1
1329 // stopTheWorldWithSema is the core implementation of stopTheWorld.
1330 // The caller is responsible for acquiring worldsema and disabling
1331 // preemption first and then should stopTheWorldWithSema on the system
1334 // semacquire(&worldsema, 0)
1335 // m.preemptoff = "reason"
1336 // systemstack(stopTheWorldWithSema)
1338 // When finished, the caller must either call startTheWorld or undo
1339 // these three operations separately:
1341 // m.preemptoff = ""
1342 // systemstack(startTheWorldWithSema)
1343 // semrelease(&worldsema)
1345 // It is allowed to acquire worldsema once and then execute multiple
1346 // startTheWorldWithSema/stopTheWorldWithSema pairs.
1347 // Other P's are able to execute between successive calls to
1348 // startTheWorldWithSema and stopTheWorldWithSema.
1349 // Holding worldsema causes any other goroutines invoking
1350 // stopTheWorld to block.
1351 func stopTheWorldWithSema(reason stwReason) {
1353 traceSTWStart(reason)
1357 // If we hold a lock, then we won't be able to stop another M
1358 // that is blocked trying to acquire the lock.
1360 throw("stopTheWorld: holding locks")
1364 sched.stopwait = gomaxprocs
1365 sched.gcwaiting.Store(true)
1368 gp.m.p.ptr().status = _Pgcstop // Pgcstop is only diagnostic.
1370 // try to retake all P's in Psyscall status
1371 for _, pp := range allp {
1373 if s == _Psyscall && atomic.Cas(&pp.status, s, _Pgcstop) {
1385 pp, _ := pidleget(now)
1389 pp.status = _Pgcstop
1392 wait := sched.stopwait > 0
1395 // wait for remaining P's to stop voluntarily
1398 // wait for 100us, then try to re-preempt in case of any races
1399 if notetsleep(&sched.stopnote, 100*1000) {
1400 noteclear(&sched.stopnote)
1409 if sched.stopwait != 0 {
1410 bad = "stopTheWorld: not stopped (stopwait != 0)"
1412 for _, pp := range allp {
1413 if pp.status != _Pgcstop {
1414 bad = "stopTheWorld: not stopped (status != _Pgcstop)"
1418 if freezing.Load() {
1419 // Some other thread is panicking. This can cause the
1420 // sanity checks above to fail if the panic happens in
1421 // the signal handler on a stopped thread. Either way,
1422 // we should halt this thread.
1433 func startTheWorldWithSema() int64 {
1434 assertWorldStopped()
1436 mp := acquirem() // disable preemption because it can be holding p in a local var
1437 if netpollinited() {
1438 list, delta := netpoll(0) // non-blocking
1440 netpollAdjustWaiters(delta)
1449 p1 := procresize(procs)
1450 sched.gcwaiting.Store(false)
1451 if sched.sysmonwait.Load() {
1452 sched.sysmonwait.Store(false)
1453 notewakeup(&sched.sysmonnote)
1466 throw("startTheWorld: inconsistent mp->nextp")
1469 notewakeup(&mp.park)
1471 // Start M to run P. Do not start another M below.
1476 // Capture start-the-world time before doing clean-up tasks.
1477 startTime := nanotime()
1482 // Wakeup an additional proc in case we have excessive runnable goroutines
1483 // in local queues or in the global queue. If we don't, the proc will park itself.
1484 // If we have lots of excessive work, resetspinning will unpark additional procs as necessary.
1492 // usesLibcall indicates whether this runtime performs system calls
1494 func usesLibcall() bool {
1496 case "aix", "darwin", "illumos", "ios", "solaris", "windows":
1499 return GOARCH == "386" || GOARCH == "amd64" || GOARCH == "arm" || GOARCH == "arm64"
1504 // mStackIsSystemAllocated indicates whether this runtime starts on a
1505 // system-allocated stack.
1506 func mStackIsSystemAllocated() bool {
1508 case "aix", "darwin", "plan9", "illumos", "ios", "solaris", "windows":
1512 case "386", "amd64", "arm", "arm64":
1519 // mstart is the entry-point for new Ms.
1520 // It is written in assembly, uses ABI0, is marked TOPFRAME, and calls mstart0.
1523 // mstart0 is the Go entry-point for new Ms.
1524 // This must not split the stack because we may not even have stack
1525 // bounds set up yet.
1527 // May run during STW (because it doesn't have a P yet), so write
1528 // barriers are not allowed.
1531 //go:nowritebarrierrec
1535 osStack := gp.stack.lo == 0
1537 // Initialize stack bounds from system stack.
1538 // Cgo may have left stack size in stack.hi.
1539 // minit may update the stack bounds.
1541 // Note: these bounds may not be very accurate.
1542 // We set hi to &size, but there are things above
1543 // it. The 1024 is supposed to compensate this,
1544 // but is somewhat arbitrary.
1547 size = 8192 * sys.StackGuardMultiplier
1549 gp.stack.hi = uintptr(noescape(unsafe.Pointer(&size)))
1550 gp.stack.lo = gp.stack.hi - size + 1024
1552 // Initialize stack guard so that we can start calling regular
1554 gp.stackguard0 = gp.stack.lo + stackGuard
1555 // This is the g0, so we can also call go:systemstack
1556 // functions, which check stackguard1.
1557 gp.stackguard1 = gp.stackguard0
1560 // Exit this thread.
1561 if mStackIsSystemAllocated() {
1562 // Windows, Solaris, illumos, Darwin, AIX and Plan 9 always system-allocate
1563 // the stack, but put it in gp.stack before mstart,
1564 // so the logic above hasn't set osStack yet.
1570 // The go:noinline is to guarantee the getcallerpc/getcallersp below are safe,
1571 // so that we can set up g0.sched to return to the call of mstart1 above.
1578 throw("bad runtime·mstart")
1581 // Set up m.g0.sched as a label returning to just
1582 // after the mstart1 call in mstart0 above, for use by goexit0 and mcall.
1583 // We're never coming back to mstart1 after we call schedule,
1584 // so other calls can reuse the current frame.
1585 // And goexit0 does a gogo that needs to return from mstart1
1586 // and let mstart0 exit the thread.
1587 gp.sched.g = guintptr(unsafe.Pointer(gp))
1588 gp.sched.pc = getcallerpc()
1589 gp.sched.sp = getcallersp()
1594 // Install signal handlers; after minit so that minit can
1595 // prepare the thread to be able to handle the signals.
1600 if fn := gp.m.mstartfn; fn != nil {
1605 acquirep(gp.m.nextp.ptr())
1611 // mstartm0 implements part of mstart1 that only runs on the m0.
1613 // Write barriers are allowed here because we know the GC can't be
1614 // running yet, so they'll be no-ops.
1616 //go:yeswritebarrierrec
1618 // Create an extra M for callbacks on threads not created by Go.
1619 // An extra M is also needed on Windows for callbacks created by
1620 // syscall.NewCallback. See issue #6751 for details.
1621 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1628 // mPark causes a thread to park itself, returning once woken.
1633 notesleep(&gp.m.park)
1634 noteclear(&gp.m.park)
1637 // mexit tears down and exits the current thread.
1639 // Don't call this directly to exit the thread, since it must run at
1640 // the top of the thread stack. Instead, use gogo(&gp.m.g0.sched) to
1641 // unwind the stack to the point that exits the thread.
1643 // It is entered with m.p != nil, so write barriers are allowed. It
1644 // will release the P before exiting.
1646 //go:yeswritebarrierrec
1647 func mexit(osStack bool) {
1651 // This is the main thread. Just wedge it.
1653 // On Linux, exiting the main thread puts the process
1654 // into a non-waitable zombie state. On Plan 9,
1655 // exiting the main thread unblocks wait even though
1656 // other threads are still running. On Solaris we can
1657 // neither exitThread nor return from mstart. Other
1658 // bad things probably happen on other platforms.
1660 // We could try to clean up this M more before wedging
1661 // it, but that complicates signal handling.
1662 handoffp(releasep())
1668 throw("locked m0 woke up")
1674 // Free the gsignal stack.
1675 if mp.gsignal != nil {
1676 stackfree(mp.gsignal.stack)
1677 // On some platforms, when calling into VDSO (e.g. nanotime)
1678 // we store our g on the gsignal stack, if there is one.
1679 // Now the stack is freed, unlink it from the m, so we
1680 // won't write to it when calling VDSO code.
1684 // Remove m from allm.
1686 for pprev := &allm; *pprev != nil; pprev = &(*pprev).alllink {
1692 throw("m not found in allm")
1694 // Delay reaping m until it's done with the stack.
1696 // Put mp on the free list, though it will not be reaped while freeWait
1697 // is freeMWait. mp is no longer reachable via allm, so even if it is
1698 // on an OS stack, we must keep a reference to mp alive so that the GC
1699 // doesn't free mp while we are still using it.
1701 // Note that the free list must not be linked through alllink because
1702 // some functions walk allm without locking, so may be using alllink.
1703 mp.freeWait.Store(freeMWait)
1704 mp.freelink = sched.freem
1708 atomic.Xadd64(&ncgocall, int64(mp.ncgocall))
1711 handoffp(releasep())
1712 // After this point we must not have write barriers.
1714 // Invoke the deadlock detector. This must happen after
1715 // handoffp because it may have started a new M to take our
1722 if GOOS == "darwin" || GOOS == "ios" {
1723 // Make sure pendingPreemptSignals is correct when an M exits.
1725 if mp.signalPending.Load() != 0 {
1726 pendingPreemptSignals.Add(-1)
1730 // Destroy all allocated resources. After this is called, we may no
1731 // longer take any locks.
1735 // No more uses of mp, so it is safe to drop the reference.
1736 mp.freeWait.Store(freeMRef)
1738 // Return from mstart and let the system thread
1739 // library free the g0 stack and terminate the thread.
1743 // mstart is the thread's entry point, so there's nothing to
1744 // return to. Exit the thread directly. exitThread will clear
1745 // m.freeWait when it's done with the stack and the m can be
1747 exitThread(&mp.freeWait)
1750 // forEachP calls fn(p) for every P p when p reaches a GC safe point.
1751 // If a P is currently executing code, this will bring the P to a GC
1752 // safe point and execute fn on that P. If the P is not executing code
1753 // (it is idle or in a syscall), this will call fn(p) directly while
1754 // preventing the P from exiting its state. This does not ensure that
1755 // fn will run on every CPU executing Go code, but it acts as a global
1756 // memory barrier. GC uses this as a "ragged barrier."
1758 // The caller must hold worldsema.
1761 func forEachP(fn func(*p)) {
1763 pp := getg().m.p.ptr()
1766 if sched.safePointWait != 0 {
1767 throw("forEachP: sched.safePointWait != 0")
1769 sched.safePointWait = gomaxprocs - 1
1770 sched.safePointFn = fn
1772 // Ask all Ps to run the safe point function.
1773 for _, p2 := range allp {
1775 atomic.Store(&p2.runSafePointFn, 1)
1780 // Any P entering _Pidle or _Psyscall from now on will observe
1781 // p.runSafePointFn == 1 and will call runSafePointFn when
1782 // changing its status to _Pidle/_Psyscall.
1784 // Run safe point function for all idle Ps. sched.pidle will
1785 // not change because we hold sched.lock.
1786 for p := sched.pidle.ptr(); p != nil; p = p.link.ptr() {
1787 if atomic.Cas(&p.runSafePointFn, 1, 0) {
1789 sched.safePointWait--
1793 wait := sched.safePointWait > 0
1796 // Run fn for the current P.
1799 // Force Ps currently in _Psyscall into _Pidle and hand them
1800 // off to induce safe point function execution.
1801 for _, p2 := range allp {
1803 if s == _Psyscall && p2.runSafePointFn == 1 && atomic.Cas(&p2.status, s, _Pidle) {
1813 // Wait for remaining Ps to run fn.
1816 // Wait for 100us, then try to re-preempt in
1817 // case of any races.
1819 // Requires system stack.
1820 if notetsleep(&sched.safePointNote, 100*1000) {
1821 noteclear(&sched.safePointNote)
1827 if sched.safePointWait != 0 {
1828 throw("forEachP: not done")
1830 for _, p2 := range allp {
1831 if p2.runSafePointFn != 0 {
1832 throw("forEachP: P did not run fn")
1837 sched.safePointFn = nil
1842 // runSafePointFn runs the safe point function, if any, for this P.
1843 // This should be called like
1845 // if getg().m.p.runSafePointFn != 0 {
1849 // runSafePointFn must be checked on any transition in to _Pidle or
1850 // _Psyscall to avoid a race where forEachP sees that the P is running
1851 // just before the P goes into _Pidle/_Psyscall and neither forEachP
1852 // nor the P run the safe-point function.
1853 func runSafePointFn() {
1854 p := getg().m.p.ptr()
1855 // Resolve the race between forEachP running the safe-point
1856 // function on this P's behalf and this P running the
1857 // safe-point function directly.
1858 if !atomic.Cas(&p.runSafePointFn, 1, 0) {
1861 sched.safePointFn(p)
1863 sched.safePointWait--
1864 if sched.safePointWait == 0 {
1865 notewakeup(&sched.safePointNote)
1870 // When running with cgo, we call _cgo_thread_start
1871 // to start threads for us so that we can play nicely with
1873 var cgoThreadStart unsafe.Pointer
1875 type cgothreadstart struct {
1881 // Allocate a new m unassociated with any thread.
1882 // Can use p for allocation context if needed.
1883 // fn is recorded as the new m's m.mstartfn.
1884 // id is optional pre-allocated m ID. Omit by passing -1.
1886 // This function is allowed to have write barriers even if the caller
1887 // isn't because it borrows pp.
1889 //go:yeswritebarrierrec
1890 func allocm(pp *p, fn func(), id int64) *m {
1893 // The caller owns pp, but we may borrow (i.e., acquirep) it. We must
1894 // disable preemption to ensure it is not stolen, which would make the
1895 // caller lose ownership.
1900 acquirep(pp) // temporarily borrow p for mallocs in this function
1903 // Release the free M list. We need to do this somewhere and
1904 // this may free up a stack we can use.
1905 if sched.freem != nil {
1908 for freem := sched.freem; freem != nil; {
1909 wait := freem.freeWait.Load()
1910 if wait == freeMWait {
1911 next := freem.freelink
1912 freem.freelink = newList
1917 // Free the stack if needed. For freeMRef, there is
1918 // nothing to do except drop freem from the sched.freem
1920 if wait == freeMStack {
1921 // stackfree must be on the system stack, but allocm is
1922 // reachable off the system stack transitively from
1924 systemstack(func() {
1925 stackfree(freem.g0.stack)
1928 freem = freem.freelink
1930 sched.freem = newList
1938 // In case of cgo or Solaris or illumos or Darwin, pthread_create will make us a stack.
1939 // Windows and Plan 9 will layout sched stack on OS stack.
1940 if iscgo || mStackIsSystemAllocated() {
1943 mp.g0 = malg(8192 * sys.StackGuardMultiplier)
1947 if pp == gp.m.p.ptr() {
1952 allocmLock.runlock()
1956 // needm is called when a cgo callback happens on a
1957 // thread without an m (a thread not created by Go).
1958 // In this case, needm is expected to find an m to use
1959 // and return with m, g initialized correctly.
1960 // Since m and g are not set now (likely nil, but see below)
1961 // needm is limited in what routines it can call. In particular
1962 // it can only call nosplit functions (textflag 7) and cannot
1963 // do any scheduling that requires an m.
1965 // In order to avoid needing heavy lifting here, we adopt
1966 // the following strategy: there is a stack of available m's
1967 // that can be stolen. Using compare-and-swap
1968 // to pop from the stack has ABA races, so we simulate
1969 // a lock by doing an exchange (via Casuintptr) to steal the stack
1970 // head and replace the top pointer with MLOCKED (1).
1971 // This serves as a simple spin lock that we can use even
1972 // without an m. The thread that locks the stack in this way
1973 // unlocks the stack by storing a valid stack head pointer.
1975 // In order to make sure that there is always an m structure
1976 // available to be stolen, we maintain the invariant that there
1977 // is always one more than needed. At the beginning of the
1978 // program (if cgo is in use) the list is seeded with a single m.
1979 // If needm finds that it has taken the last m off the list, its job
1980 // is - once it has installed its own m so that it can do things like
1981 // allocate memory - to create a spare m and put it on the list.
1983 // Each of these extra m's also has a g0 and a curg that are
1984 // pressed into service as the scheduling stack and current
1985 // goroutine for the duration of the cgo callback.
1987 // It calls dropm to put the m back on the list,
1988 // 1. when the callback is done with the m in non-pthread platforms,
1989 // 2. or when the C thread exiting on pthread platforms.
1991 // The signal argument indicates whether we're called from a signal
1995 func needm(signal bool) {
1996 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1997 // Can happen if C/C++ code calls Go from a global ctor.
1998 // Can also happen on Windows if a global ctor uses a
1999 // callback created by syscall.NewCallback. See issue #6751
2002 // Can not throw, because scheduler is not initialized yet.
2003 writeErrStr("fatal error: cgo callback before cgo call\n")
2007 // Save and block signals before getting an M.
2008 // The signal handler may call needm itself,
2009 // and we must avoid a deadlock. Also, once g is installed,
2010 // any incoming signals will try to execute,
2011 // but we won't have the sigaltstack settings and other data
2012 // set up appropriately until the end of minit, which will
2013 // unblock the signals. This is the same dance as when
2014 // starting a new m to run Go code via newosproc.
2019 // getExtraM is safe here because of the invariant above,
2020 // that the extra list always contains or will soon contain
2022 mp, last := getExtraM()
2024 // Set needextram when we've just emptied the list,
2025 // so that the eventual call into cgocallbackg will
2026 // allocate a new m for the extra list. We delay the
2027 // allocation until then so that it can be done
2028 // after exitsyscall makes sure it is okay to be
2029 // running at all (that is, there's no garbage collection
2030 // running right now).
2031 mp.needextram = last
2033 // Store the original signal mask for use by minit.
2034 mp.sigmask = sigmask
2036 // Install TLS on some platforms (previously setg
2037 // would do this if necessary).
2040 // Install g (= m->g0) and set the stack bounds
2041 // to match the current stack. If we don't actually know
2042 // how big the stack is, like we don't know how big any
2043 // scheduling stack is, but we assume there's at least 32 kB.
2044 // If we can get a more accurate stack bound from pthread,
2048 gp.stack.hi = getcallersp() + 1024
2049 gp.stack.lo = getcallersp() - 32*1024
2050 if !signal && _cgo_getstackbound != nil {
2051 // Don't adjust if called from the signal handler.
2052 // We are on the signal stack, not the pthread stack.
2053 // (We could get the stack bounds from sigaltstack, but
2054 // we're getting out of the signal handler very soon
2055 // anyway. Not worth it.)
2056 var bounds [2]uintptr
2057 asmcgocall(_cgo_getstackbound, unsafe.Pointer(&bounds))
2058 // getstackbound is an unsupported no-op on Windows.
2060 gp.stack.lo = bounds[0]
2061 gp.stack.hi = bounds[1]
2064 gp.stackguard0 = gp.stack.lo + stackGuard
2066 // Should mark we are already in Go now.
2067 // Otherwise, we may call needm again when we get a signal, before cgocallbackg1,
2068 // which means the extram list may be empty, that will cause a deadlock.
2069 mp.isExtraInC = false
2071 // Initialize this thread to use the m.
2075 // mp.curg is now a real goroutine.
2076 casgstatus(mp.curg, _Gdead, _Gsyscall)
2080 // Acquire an extra m and bind it to the C thread when a pthread key has been created.
2083 func needAndBindM() {
2086 if _cgo_pthread_key_created != nil && *(*uintptr)(_cgo_pthread_key_created) != 0 {
2091 // newextram allocates m's and puts them on the extra list.
2092 // It is called with a working local m, so that it can do things
2093 // like call schedlock and allocate.
2095 c := extraMWaiters.Swap(0)
2097 for i := uint32(0); i < c; i++ {
2100 } else if extraMLength.Load() == 0 {
2101 // Make sure there is at least one extra M.
2106 // oneNewExtraM allocates an m and puts it on the extra list.
2107 func oneNewExtraM() {
2108 // Create extra goroutine locked to extra m.
2109 // The goroutine is the context in which the cgo callback will run.
2110 // The sched.pc will never be returned to, but setting it to
2111 // goexit makes clear to the traceback routines where
2112 // the goroutine stack ends.
2113 mp := allocm(nil, nil, -1)
2115 gp.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum
2116 gp.sched.sp = gp.stack.hi
2117 gp.sched.sp -= 4 * goarch.PtrSize // extra space in case of reads slightly beyond frame
2119 gp.sched.g = guintptr(unsafe.Pointer(gp))
2120 gp.syscallpc = gp.sched.pc
2121 gp.syscallsp = gp.sched.sp
2122 gp.stktopsp = gp.sched.sp
2123 // malg returns status as _Gidle. Change to _Gdead before
2124 // adding to allg where GC can see it. We use _Gdead to hide
2125 // this from tracebacks and stack scans since it isn't a
2126 // "real" goroutine until needm grabs it.
2127 casgstatus(gp, _Gidle, _Gdead)
2131 // mark we are in C by default.
2132 mp.isExtraInC = true
2136 gp.goid = sched.goidgen.Add(1)
2138 gp.racectx = racegostart(abi.FuncPCABIInternal(newextram) + sys.PCQuantum)
2141 traceOneNewExtraM(gp)
2143 // put on allg for garbage collector
2146 // gp is now on the allg list, but we don't want it to be
2147 // counted by gcount. It would be more "proper" to increment
2148 // sched.ngfree, but that requires locking. Incrementing ngsys
2149 // has the same effect.
2152 // Add m to the extra list.
2156 // dropm puts the current m back onto the extra list.
2158 // 1. On systems without pthreads, like Windows
2159 // dropm is called when a cgo callback has called needm but is now
2160 // done with the callback and returning back into the non-Go thread.
2162 // The main expense here is the call to signalstack to release the
2163 // m's signal stack, and then the call to needm on the next callback
2164 // from this thread. It is tempting to try to save the m for next time,
2165 // which would eliminate both these costs, but there might not be
2166 // a next time: the current thread (which Go does not control) might exit.
2167 // If we saved the m for that thread, there would be an m leak each time
2168 // such a thread exited. Instead, we acquire and release an m on each
2169 // call. These should typically not be scheduling operations, just a few
2170 // atomics, so the cost should be small.
2172 // 2. On systems with pthreads
2173 // dropm is called while a non-Go thread is exiting.
2174 // We allocate a pthread per-thread variable using pthread_key_create,
2175 // to register a thread-exit-time destructor.
2176 // And store the g into a thread-specific value associated with the pthread key,
2177 // when first return back to C.
2178 // So that the destructor would invoke dropm while the non-Go thread is exiting.
2179 // This is much faster since it avoids expensive signal-related syscalls.
2181 // NOTE: this always runs without a P, so, nowritebarrierrec required.
2183 //go:nowritebarrierrec
2185 // Clear m and g, and return m to the extra list.
2186 // After the call to setg we can only call nosplit functions
2187 // with no pointer manipulation.
2190 // Return mp.curg to dead state.
2191 casgstatus(mp.curg, _Gsyscall, _Gdead)
2192 mp.curg.preemptStop = false
2195 // Block signals before unminit.
2196 // Unminit unregisters the signal handling stack (but needs g on some systems).
2197 // Setg(nil) clears g, which is the signal handler's cue not to run Go handlers.
2198 // It's important not to try to handle a signal between those two steps.
2199 sigmask := mp.sigmask
2207 msigrestore(sigmask)
2210 // bindm store the g0 of the current m into a thread-specific value.
2212 // We allocate a pthread per-thread variable using pthread_key_create,
2213 // to register a thread-exit-time destructor.
2214 // We are here setting the thread-specific value of the pthread key, to enable the destructor.
2215 // So that the pthread_key_destructor would dropm while the C thread is exiting.
2217 // And the saved g will be used in pthread_key_destructor,
2218 // since the g stored in the TLS by Go might be cleared in some platforms,
2219 // before the destructor invoked, so, we restore g by the stored g, before dropm.
2221 // We store g0 instead of m, to make the assembly code simpler,
2222 // since we need to restore g0 in runtime.cgocallback.
2224 // On systems without pthreads, like Windows, bindm shouldn't be used.
2226 // NOTE: this always runs without a P, so, nowritebarrierrec required.
2229 //go:nowritebarrierrec
2231 if GOOS == "windows" || GOOS == "plan9" {
2232 fatal("bindm in unexpected GOOS")
2236 fatal("the current g is not g0")
2238 if _cgo_bindm != nil {
2239 asmcgocall(_cgo_bindm, unsafe.Pointer(g))
2243 // A helper function for EnsureDropM.
2244 func getm() uintptr {
2245 return uintptr(unsafe.Pointer(getg().m))
2249 // Locking linked list of extra M's, via mp.schedlink. Must be accessed
2250 // only via lockextra/unlockextra.
2252 // Can't be atomic.Pointer[m] because we use an invalid pointer as a
2253 // "locked" sentinel value. M's on this list remain visible to the GC
2254 // because their mp.curg is on allgs.
2255 extraM atomic.Uintptr
2256 // Number of M's in the extraM list.
2257 extraMLength atomic.Uint32
2258 // Number of waiters in lockextra.
2259 extraMWaiters atomic.Uint32
2261 // Number of extra M's in use by threads.
2262 extraMInUse atomic.Uint32
2265 // lockextra locks the extra list and returns the list head.
2266 // The caller must unlock the list by storing a new list head
2267 // to extram. If nilokay is true, then lockextra will
2268 // return a nil list head if that's what it finds. If nilokay is false,
2269 // lockextra will keep waiting until the list head is no longer nil.
2272 func lockextra(nilokay bool) *m {
2277 old := extraM.Load()
2282 if old == 0 && !nilokay {
2284 // Add 1 to the number of threads
2285 // waiting for an M.
2286 // This is cleared by newextram.
2287 extraMWaiters.Add(1)
2293 if extraM.CompareAndSwap(old, locked) {
2294 return (*m)(unsafe.Pointer(old))
2302 func unlockextra(mp *m, delta int32) {
2303 extraMLength.Add(delta)
2304 extraM.Store(uintptr(unsafe.Pointer(mp)))
2307 // Return an M from the extra M list. Returns last == true if the list becomes
2308 // empty because of this call.
2310 // Spins waiting for an extra M, so caller must ensure that the list always
2311 // contains or will soon contain at least one M.
2314 func getExtraM() (mp *m, last bool) {
2315 mp = lockextra(false)
2317 unlockextra(mp.schedlink.ptr(), -1)
2318 return mp, mp.schedlink.ptr() == nil
2321 // Returns an extra M back to the list. mp must be from getExtraM. Newly
2322 // allocated M's should use addExtraM.
2325 func putExtraM(mp *m) {
2330 // Adds a newly allocated M to the extra M list.
2333 func addExtraM(mp *m) {
2334 mnext := lockextra(true)
2335 mp.schedlink.set(mnext)
2340 // allocmLock is locked for read when creating new Ms in allocm and their
2341 // addition to allm. Thus acquiring this lock for write blocks the
2342 // creation of new Ms.
2345 // execLock serializes exec and clone to avoid bugs or unspecified
2346 // behaviour around exec'ing while creating/destroying threads. See
2351 // These errors are reported (via writeErrStr) by some OS-specific
2352 // versions of newosproc and newosproc0.
2354 failthreadcreate = "runtime: failed to create new OS thread\n"
2355 failallocatestack = "runtime: failed to allocate stack for the new OS thread\n"
2358 // newmHandoff contains a list of m structures that need new OS threads.
2359 // This is used by newm in situations where newm itself can't safely
2360 // start an OS thread.
2361 var newmHandoff struct {
2364 // newm points to a list of M structures that need new OS
2365 // threads. The list is linked through m.schedlink.
2368 // waiting indicates that wake needs to be notified when an m
2369 // is put on the list.
2373 // haveTemplateThread indicates that the templateThread has
2374 // been started. This is not protected by lock. Use cas to set
2376 haveTemplateThread uint32
2379 // Create a new m. It will start off with a call to fn, or else the scheduler.
2380 // fn needs to be static and not a heap allocated closure.
2381 // May run with m.p==nil, so write barriers are not allowed.
2383 // id is optional pre-allocated m ID. Omit by passing -1.
2385 //go:nowritebarrierrec
2386 func newm(fn func(), pp *p, id int64) {
2387 // allocm adds a new M to allm, but they do not start until created by
2388 // the OS in newm1 or the template thread.
2390 // doAllThreadsSyscall requires that every M in allm will eventually
2391 // start and be signal-able, even with a STW.
2393 // Disable preemption here until we start the thread to ensure that
2394 // newm is not preempted between allocm and starting the new thread,
2395 // ensuring that anything added to allm is guaranteed to eventually
2399 mp := allocm(pp, fn, id)
2401 mp.sigmask = initSigmask
2402 if gp := getg(); gp != nil && gp.m != nil && (gp.m.lockedExt != 0 || gp.m.incgo) && GOOS != "plan9" {
2403 // We're on a locked M or a thread that may have been
2404 // started by C. The kernel state of this thread may
2405 // be strange (the user may have locked it for that
2406 // purpose). We don't want to clone that into another
2407 // thread. Instead, ask a known-good thread to create
2408 // the thread for us.
2410 // This is disabled on Plan 9. See golang.org/issue/22227.
2412 // TODO: This may be unnecessary on Windows, which
2413 // doesn't model thread creation off fork.
2414 lock(&newmHandoff.lock)
2415 if newmHandoff.haveTemplateThread == 0 {
2416 throw("on a locked thread with no template thread")
2418 mp.schedlink = newmHandoff.newm
2419 newmHandoff.newm.set(mp)
2420 if newmHandoff.waiting {
2421 newmHandoff.waiting = false
2422 notewakeup(&newmHandoff.wake)
2424 unlock(&newmHandoff.lock)
2425 // The M has not started yet, but the template thread does not
2426 // participate in STW, so it will always process queued Ms and
2427 // it is safe to releasem.
2437 var ts cgothreadstart
2438 if _cgo_thread_start == nil {
2439 throw("_cgo_thread_start missing")
2442 ts.tls = (*uint64)(unsafe.Pointer(&mp.tls[0]))
2443 ts.fn = unsafe.Pointer(abi.FuncPCABI0(mstart))
2445 msanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2448 asanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2450 execLock.rlock() // Prevent process clone.
2451 asmcgocall(_cgo_thread_start, unsafe.Pointer(&ts))
2455 execLock.rlock() // Prevent process clone.
2460 // startTemplateThread starts the template thread if it is not already
2463 // The calling thread must itself be in a known-good state.
2464 func startTemplateThread() {
2465 if GOARCH == "wasm" { // no threads on wasm yet
2469 // Disable preemption to guarantee that the template thread will be
2470 // created before a park once haveTemplateThread is set.
2472 if !atomic.Cas(&newmHandoff.haveTemplateThread, 0, 1) {
2476 newm(templateThread, nil, -1)
2480 // templateThread is a thread in a known-good state that exists solely
2481 // to start new threads in known-good states when the calling thread
2482 // may not be in a good state.
2484 // Many programs never need this, so templateThread is started lazily
2485 // when we first enter a state that might lead to running on a thread
2486 // in an unknown state.
2488 // templateThread runs on an M without a P, so it must not have write
2491 //go:nowritebarrierrec
2492 func templateThread() {
2499 lock(&newmHandoff.lock)
2500 for newmHandoff.newm != 0 {
2501 newm := newmHandoff.newm.ptr()
2502 newmHandoff.newm = 0
2503 unlock(&newmHandoff.lock)
2505 next := newm.schedlink.ptr()
2510 lock(&newmHandoff.lock)
2512 newmHandoff.waiting = true
2513 noteclear(&newmHandoff.wake)
2514 unlock(&newmHandoff.lock)
2515 notesleep(&newmHandoff.wake)
2519 // Stops execution of the current m until new work is available.
2520 // Returns with acquired P.
2524 if gp.m.locks != 0 {
2525 throw("stopm holding locks")
2528 throw("stopm holding p")
2531 throw("stopm spinning")
2538 acquirep(gp.m.nextp.ptr())
2543 // startm's caller incremented nmspinning. Set the new M's spinning.
2544 getg().m.spinning = true
2547 // Schedules some M to run the p (creates an M if necessary).
2548 // If p==nil, tries to get an idle P, if no idle P's does nothing.
2549 // May run with m.p==nil, so write barriers are not allowed.
2550 // If spinning is set, the caller has incremented nmspinning and must provide a
2551 // P. startm will set m.spinning in the newly started M.
2553 // Callers passing a non-nil P must call from a non-preemptible context. See
2554 // comment on acquirem below.
2556 // Argument lockheld indicates whether the caller already acquired the
2557 // scheduler lock. Callers holding the lock when making the call must pass
2558 // true. The lock might be temporarily dropped, but will be reacquired before
2561 // Must not have write barriers because this may be called without a P.
2563 //go:nowritebarrierrec
2564 func startm(pp *p, spinning, lockheld bool) {
2565 // Disable preemption.
2567 // Every owned P must have an owner that will eventually stop it in the
2568 // event of a GC stop request. startm takes transient ownership of a P
2569 // (either from argument or pidleget below) and transfers ownership to
2570 // a started M, which will be responsible for performing the stop.
2572 // Preemption must be disabled during this transient ownership,
2573 // otherwise the P this is running on may enter GC stop while still
2574 // holding the transient P, leaving that P in limbo and deadlocking the
2577 // Callers passing a non-nil P must already be in non-preemptible
2578 // context, otherwise such preemption could occur on function entry to
2579 // startm. Callers passing a nil P may be preemptible, so we must
2580 // disable preemption before acquiring a P from pidleget below.
2587 // TODO(prattmic): All remaining calls to this function
2588 // with _p_ == nil could be cleaned up to find a P
2589 // before calling startm.
2590 throw("startm: P required for spinning=true")
2603 // No M is available, we must drop sched.lock and call newm.
2604 // However, we already own a P to assign to the M.
2606 // Once sched.lock is released, another G (e.g., in a syscall),
2607 // could find no idle P while checkdead finds a runnable G but
2608 // no running M's because this new M hasn't started yet, thus
2609 // throwing in an apparent deadlock.
2610 // This apparent deadlock is possible when startm is called
2611 // from sysmon, which doesn't count as a running M.
2613 // Avoid this situation by pre-allocating the ID for the new M,
2614 // thus marking it as 'running' before we drop sched.lock. This
2615 // new M will eventually run the scheduler to execute any
2622 // The caller incremented nmspinning, so set m.spinning in the new M.
2630 // Ownership transfer of pp committed by start in newm.
2631 // Preemption is now safe.
2639 throw("startm: m is spinning")
2642 throw("startm: m has p")
2644 if spinning && !runqempty(pp) {
2645 throw("startm: p has runnable gs")
2647 // The caller incremented nmspinning, so set m.spinning in the new M.
2648 nmp.spinning = spinning
2650 notewakeup(&nmp.park)
2651 // Ownership transfer of pp committed by wakeup. Preemption is now
2656 // Hands off P from syscall or locked M.
2657 // Always runs without a P, so write barriers are not allowed.
2659 //go:nowritebarrierrec
2660 func handoffp(pp *p) {
2661 // handoffp must start an M in any situation where
2662 // findrunnable would return a G to run on pp.
2664 // if it has local work, start it straight away
2665 if !runqempty(pp) || sched.runqsize != 0 {
2666 startm(pp, false, false)
2669 // if there's trace work to do, start it straight away
2670 if (traceEnabled() || traceShuttingDown()) && traceReaderAvailable() != nil {
2671 startm(pp, false, false)
2674 // if it has GC work, start it straight away
2675 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) {
2676 startm(pp, false, false)
2679 // no local work, check that there are no spinning/idle M's,
2680 // otherwise our help is not required
2681 if sched.nmspinning.Load()+sched.npidle.Load() == 0 && sched.nmspinning.CompareAndSwap(0, 1) { // TODO: fast atomic
2682 sched.needspinning.Store(0)
2683 startm(pp, true, false)
2687 if sched.gcwaiting.Load() {
2688 pp.status = _Pgcstop
2690 if sched.stopwait == 0 {
2691 notewakeup(&sched.stopnote)
2696 if pp.runSafePointFn != 0 && atomic.Cas(&pp.runSafePointFn, 1, 0) {
2697 sched.safePointFn(pp)
2698 sched.safePointWait--
2699 if sched.safePointWait == 0 {
2700 notewakeup(&sched.safePointNote)
2703 if sched.runqsize != 0 {
2705 startm(pp, false, false)
2708 // If this is the last running P and nobody is polling network,
2709 // need to wakeup another M to poll network.
2710 if sched.npidle.Load() == gomaxprocs-1 && sched.lastpoll.Load() != 0 {
2712 startm(pp, false, false)
2716 // The scheduler lock cannot be held when calling wakeNetPoller below
2717 // because wakeNetPoller may call wakep which may call startm.
2718 when := nobarrierWakeTime(pp)
2727 // Tries to add one more P to execute G's.
2728 // Called when a G is made runnable (newproc, ready).
2729 // Must be called with a P.
2731 // Be conservative about spinning threads, only start one if none exist
2733 if sched.nmspinning.Load() != 0 || !sched.nmspinning.CompareAndSwap(0, 1) {
2737 // Disable preemption until ownership of pp transfers to the next M in
2738 // startm. Otherwise preemption here would leave pp stuck waiting to
2741 // See preemption comment on acquirem in startm for more details.
2746 pp, _ = pidlegetSpinning(0)
2748 if sched.nmspinning.Add(-1) < 0 {
2749 throw("wakep: negative nmspinning")
2755 // Since we always have a P, the race in the "No M is available"
2756 // comment in startm doesn't apply during the small window between the
2757 // unlock here and lock in startm. A checkdead in between will always
2758 // see at least one running M (ours).
2761 startm(pp, true, false)
2766 // Stops execution of the current m that is locked to a g until the g is runnable again.
2767 // Returns with acquired P.
2768 func stoplockedm() {
2771 if gp.m.lockedg == 0 || gp.m.lockedg.ptr().lockedm.ptr() != gp.m {
2772 throw("stoplockedm: inconsistent locking")
2775 // Schedule another M to run this p.
2780 // Wait until another thread schedules lockedg again.
2782 status := readgstatus(gp.m.lockedg.ptr())
2783 if status&^_Gscan != _Grunnable {
2784 print("runtime:stoplockedm: lockedg (atomicstatus=", status, ") is not Grunnable or Gscanrunnable\n")
2785 dumpgstatus(gp.m.lockedg.ptr())
2786 throw("stoplockedm: not runnable")
2788 acquirep(gp.m.nextp.ptr())
2792 // Schedules the locked m to run the locked gp.
2793 // May run during STW, so write barriers are not allowed.
2795 //go:nowritebarrierrec
2796 func startlockedm(gp *g) {
2797 mp := gp.lockedm.ptr()
2799 throw("startlockedm: locked to me")
2802 throw("startlockedm: m has p")
2804 // directly handoff current P to the locked m
2808 notewakeup(&mp.park)
2812 // Stops the current m for stopTheWorld.
2813 // Returns when the world is restarted.
2817 if !sched.gcwaiting.Load() {
2818 throw("gcstopm: not waiting for gc")
2821 gp.m.spinning = false
2822 // OK to just drop nmspinning here,
2823 // startTheWorld will unpark threads as necessary.
2824 if sched.nmspinning.Add(-1) < 0 {
2825 throw("gcstopm: negative nmspinning")
2830 pp.status = _Pgcstop
2832 if sched.stopwait == 0 {
2833 notewakeup(&sched.stopnote)
2839 // Schedules gp to run on the current M.
2840 // If inheritTime is true, gp inherits the remaining time in the
2841 // current time slice. Otherwise, it starts a new time slice.
2844 // Write barriers are allowed because this is called immediately after
2845 // acquiring a P in several places.
2847 //go:yeswritebarrierrec
2848 func execute(gp *g, inheritTime bool) {
2851 if goroutineProfile.active {
2852 // Make sure that gp has had its stack written out to the goroutine
2853 // profile, exactly as it was when the goroutine profiler first stopped
2855 tryRecordGoroutineProfile(gp, osyield)
2858 // Assign gp.m before entering _Grunning so running Gs have an
2862 casgstatus(gp, _Grunnable, _Grunning)
2865 gp.stackguard0 = gp.stack.lo + stackGuard
2867 mp.p.ptr().schedtick++
2870 // Check whether the profiler needs to be turned on or off.
2871 hz := sched.profilehz
2872 if mp.profilehz != hz {
2873 setThreadCPUProfiler(hz)
2877 // GoSysExit has to happen when we have a P, but before GoStart.
2878 // So we emit it here.
2879 if gp.syscallsp != 0 {
2888 // Finds a runnable goroutine to execute.
2889 // Tries to steal from other P's, get g from local or global queue, poll network.
2890 // tryWakeP indicates that the returned goroutine is not normal (GC worker, trace
2891 // reader) so the caller should try to wake a P.
2892 func findRunnable() (gp *g, inheritTime, tryWakeP bool) {
2895 // The conditions here and in handoffp must agree: if
2896 // findrunnable would return a G to run, handoffp must start
2901 if sched.gcwaiting.Load() {
2905 if pp.runSafePointFn != 0 {
2909 // now and pollUntil are saved for work stealing later,
2910 // which may steal timers. It's important that between now
2911 // and then, nothing blocks, so these numbers remain mostly
2913 now, pollUntil, _ := checkTimers(pp, 0)
2915 // Try to schedule the trace reader.
2916 if traceEnabled() || traceShuttingDown() {
2919 casgstatus(gp, _Gwaiting, _Grunnable)
2920 traceGoUnpark(gp, 0)
2921 return gp, false, true
2925 // Try to schedule a GC worker.
2926 if gcBlackenEnabled != 0 {
2927 gp, tnow := gcController.findRunnableGCWorker(pp, now)
2929 return gp, false, true
2934 // Check the global runnable queue once in a while to ensure fairness.
2935 // Otherwise two goroutines can completely occupy the local runqueue
2936 // by constantly respawning each other.
2937 if pp.schedtick%61 == 0 && sched.runqsize > 0 {
2939 gp := globrunqget(pp, 1)
2942 return gp, false, false
2946 // Wake up the finalizer G.
2947 if fingStatus.Load()&(fingWait|fingWake) == fingWait|fingWake {
2948 if gp := wakefing(); gp != nil {
2952 if *cgo_yield != nil {
2953 asmcgocall(*cgo_yield, nil)
2957 if gp, inheritTime := runqget(pp); gp != nil {
2958 return gp, inheritTime, false
2962 if sched.runqsize != 0 {
2964 gp := globrunqget(pp, 0)
2967 return gp, false, false
2972 // This netpoll is only an optimization before we resort to stealing.
2973 // We can safely skip it if there are no waiters or a thread is blocked
2974 // in netpoll already. If there is any kind of logical race with that
2975 // blocked thread (e.g. it has already returned from netpoll, but does
2976 // not set lastpoll yet), this thread will do blocking netpoll below
2978 if netpollinited() && netpollAnyWaiters() && sched.lastpoll.Load() != 0 {
2979 if list, delta := netpoll(0); !list.empty() { // non-blocking
2982 netpollAdjustWaiters(delta)
2983 casgstatus(gp, _Gwaiting, _Grunnable)
2985 traceGoUnpark(gp, 0)
2987 return gp, false, false
2991 // Spinning Ms: steal work from other Ps.
2993 // Limit the number of spinning Ms to half the number of busy Ps.
2994 // This is necessary to prevent excessive CPU consumption when
2995 // GOMAXPROCS>>1 but the program parallelism is low.
2996 if mp.spinning || 2*sched.nmspinning.Load() < gomaxprocs-sched.npidle.Load() {
3001 gp, inheritTime, tnow, w, newWork := stealWork(now)
3003 // Successfully stole.
3004 return gp, inheritTime, false
3007 // There may be new timer or GC work; restart to
3013 if w != 0 && (pollUntil == 0 || w < pollUntil) {
3014 // Earlier timer to wait for.
3019 // We have nothing to do.
3021 // If we're in the GC mark phase, can safely scan and blacken objects,
3022 // and have work to do, run idle-time marking rather than give up the P.
3023 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) && gcController.addIdleMarkWorker() {
3024 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
3026 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
3028 casgstatus(gp, _Gwaiting, _Grunnable)
3030 traceGoUnpark(gp, 0)
3032 return gp, false, false
3034 gcController.removeIdleMarkWorker()
3038 // If a callback returned and no other goroutine is awake,
3039 // then wake event handler goroutine which pauses execution
3040 // until a callback was triggered.
3041 gp, otherReady := beforeIdle(now, pollUntil)
3043 casgstatus(gp, _Gwaiting, _Grunnable)
3045 traceGoUnpark(gp, 0)
3047 return gp, false, false
3053 // Before we drop our P, make a snapshot of the allp slice,
3054 // which can change underfoot once we no longer block
3055 // safe-points. We don't need to snapshot the contents because
3056 // everything up to cap(allp) is immutable.
3057 allpSnapshot := allp
3058 // Also snapshot masks. Value changes are OK, but we can't allow
3059 // len to change out from under us.
3060 idlepMaskSnapshot := idlepMask
3061 timerpMaskSnapshot := timerpMask
3063 // return P and block
3065 if sched.gcwaiting.Load() || pp.runSafePointFn != 0 {
3069 if sched.runqsize != 0 {
3070 gp := globrunqget(pp, 0)
3072 return gp, false, false
3074 if !mp.spinning && sched.needspinning.Load() == 1 {
3075 // See "Delicate dance" comment below.
3080 if releasep() != pp {
3081 throw("findrunnable: wrong p")
3083 now = pidleput(pp, now)
3086 // Delicate dance: thread transitions from spinning to non-spinning
3087 // state, potentially concurrently with submission of new work. We must
3088 // drop nmspinning first and then check all sources again (with
3089 // #StoreLoad memory barrier in between). If we do it the other way
3090 // around, another thread can submit work after we've checked all
3091 // sources but before we drop nmspinning; as a result nobody will
3092 // unpark a thread to run the work.
3094 // This applies to the following sources of work:
3096 // * Goroutines added to the global or a per-P run queue.
3097 // * New/modified-earlier timers on a per-P timer heap.
3098 // * Idle-priority GC work (barring golang.org/issue/19112).
3100 // If we discover new work below, we need to restore m.spinning as a
3101 // signal for resetspinning to unpark a new worker thread (because
3102 // there can be more than one starving goroutine).
3104 // However, if after discovering new work we also observe no idle Ps
3105 // (either here or in resetspinning), we have a problem. We may be
3106 // racing with a non-spinning M in the block above, having found no
3107 // work and preparing to release its P and park. Allowing that P to go
3108 // idle will result in loss of work conservation (idle P while there is
3109 // runnable work). This could result in complete deadlock in the
3110 // unlikely event that we discover new work (from netpoll) right as we
3111 // are racing with _all_ other Ps going idle.
3113 // We use sched.needspinning to synchronize with non-spinning Ms going
3114 // idle. If needspinning is set when they are about to drop their P,
3115 // they abort the drop and instead become a new spinning M on our
3116 // behalf. If we are not racing and the system is truly fully loaded
3117 // then no spinning threads are required, and the next thread to
3118 // naturally become spinning will clear the flag.
3120 // Also see "Worker thread parking/unparking" comment at the top of the
3122 wasSpinning := mp.spinning
3125 if sched.nmspinning.Add(-1) < 0 {
3126 throw("findrunnable: negative nmspinning")
3129 // Note the for correctness, only the last M transitioning from
3130 // spinning to non-spinning must perform these rechecks to
3131 // ensure no missed work. However, the runtime has some cases
3132 // of transient increments of nmspinning that are decremented
3133 // without going through this path, so we must be conservative
3134 // and perform the check on all spinning Ms.
3136 // See https://go.dev/issue/43997.
3138 // Check global and P runqueues again.
3141 if sched.runqsize != 0 {
3142 pp, _ := pidlegetSpinning(0)
3144 gp := globrunqget(pp, 0)
3146 throw("global runq empty with non-zero runqsize")
3151 return gp, false, false
3156 pp := checkRunqsNoP(allpSnapshot, idlepMaskSnapshot)
3163 // Check for idle-priority GC work again.
3164 pp, gp := checkIdleGCNoP()
3169 // Run the idle worker.
3170 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
3171 casgstatus(gp, _Gwaiting, _Grunnable)
3173 traceGoUnpark(gp, 0)
3175 return gp, false, false
3178 // Finally, check for timer creation or expiry concurrently with
3179 // transitioning from spinning to non-spinning.
3181 // Note that we cannot use checkTimers here because it calls
3182 // adjusttimers which may need to allocate memory, and that isn't
3183 // allowed when we don't have an active P.
3184 pollUntil = checkTimersNoP(allpSnapshot, timerpMaskSnapshot, pollUntil)
3187 // Poll network until next timer.
3188 if netpollinited() && (netpollAnyWaiters() || pollUntil != 0) && sched.lastpoll.Swap(0) != 0 {
3189 sched.pollUntil.Store(pollUntil)
3191 throw("findrunnable: netpoll with p")
3194 throw("findrunnable: netpoll with spinning")
3201 delay = pollUntil - now
3207 // When using fake time, just poll.
3210 list, delta := netpoll(delay) // block until new work is available
3211 // Refresh now again, after potentially blocking.
3213 sched.pollUntil.Store(0)
3214 sched.lastpoll.Store(now)
3215 if faketime != 0 && list.empty() {
3216 // Using fake time and nothing is ready; stop M.
3217 // When all M's stop, checkdead will call timejump.
3222 pp, _ := pidleget(now)
3226 netpollAdjustWaiters(delta)
3232 netpollAdjustWaiters(delta)
3233 casgstatus(gp, _Gwaiting, _Grunnable)
3235 traceGoUnpark(gp, 0)
3237 return gp, false, false
3244 } else if pollUntil != 0 && netpollinited() {
3245 pollerPollUntil := sched.pollUntil.Load()
3246 if pollerPollUntil == 0 || pollerPollUntil > pollUntil {
3254 // pollWork reports whether there is non-background work this P could
3255 // be doing. This is a fairly lightweight check to be used for
3256 // background work loops, like idle GC. It checks a subset of the
3257 // conditions checked by the actual scheduler.
3258 func pollWork() bool {
3259 if sched.runqsize != 0 {
3262 p := getg().m.p.ptr()
3266 if netpollinited() && netpollAnyWaiters() && sched.lastpoll.Load() != 0 {
3267 if list, delta := netpoll(0); !list.empty() {
3269 netpollAdjustWaiters(delta)
3276 // stealWork attempts to steal a runnable goroutine or timer from any P.
3278 // If newWork is true, new work may have been readied.
3280 // If now is not 0 it is the current time. stealWork returns the passed time or
3281 // the current time if now was passed as 0.
3282 func stealWork(now int64) (gp *g, inheritTime bool, rnow, pollUntil int64, newWork bool) {
3283 pp := getg().m.p.ptr()
3287 const stealTries = 4
3288 for i := 0; i < stealTries; i++ {
3289 stealTimersOrRunNextG := i == stealTries-1
3291 for enum := stealOrder.start(fastrand()); !enum.done(); enum.next() {
3292 if sched.gcwaiting.Load() {
3293 // GC work may be available.
3294 return nil, false, now, pollUntil, true
3296 p2 := allp[enum.position()]
3301 // Steal timers from p2. This call to checkTimers is the only place
3302 // where we might hold a lock on a different P's timers. We do this
3303 // once on the last pass before checking runnext because stealing
3304 // from the other P's runnext should be the last resort, so if there
3305 // are timers to steal do that first.
3307 // We only check timers on one of the stealing iterations because
3308 // the time stored in now doesn't change in this loop and checking
3309 // the timers for each P more than once with the same value of now
3310 // is probably a waste of time.
3312 // timerpMask tells us whether the P may have timers at all. If it
3313 // can't, no need to check at all.
3314 if stealTimersOrRunNextG && timerpMask.read(enum.position()) {
3315 tnow, w, ran := checkTimers(p2, now)
3317 if w != 0 && (pollUntil == 0 || w < pollUntil) {
3321 // Running the timers may have
3322 // made an arbitrary number of G's
3323 // ready and added them to this P's
3324 // local run queue. That invalidates
3325 // the assumption of runqsteal
3326 // that it always has room to add
3327 // stolen G's. So check now if there
3328 // is a local G to run.
3329 if gp, inheritTime := runqget(pp); gp != nil {
3330 return gp, inheritTime, now, pollUntil, ranTimer
3336 // Don't bother to attempt to steal if p2 is idle.
3337 if !idlepMask.read(enum.position()) {
3338 if gp := runqsteal(pp, p2, stealTimersOrRunNextG); gp != nil {
3339 return gp, false, now, pollUntil, ranTimer
3345 // No goroutines found to steal. Regardless, running a timer may have
3346 // made some goroutine ready that we missed. Indicate the next timer to
3348 return nil, false, now, pollUntil, ranTimer
3351 // Check all Ps for a runnable G to steal.
3353 // On entry we have no P. If a G is available to steal and a P is available,
3354 // the P is returned which the caller should acquire and attempt to steal the
3356 func checkRunqsNoP(allpSnapshot []*p, idlepMaskSnapshot pMask) *p {
3357 for id, p2 := range allpSnapshot {
3358 if !idlepMaskSnapshot.read(uint32(id)) && !runqempty(p2) {
3360 pp, _ := pidlegetSpinning(0)
3362 // Can't get a P, don't bother checking remaining Ps.
3371 // No work available.
3375 // Check all Ps for a timer expiring sooner than pollUntil.
3377 // Returns updated pollUntil value.
3378 func checkTimersNoP(allpSnapshot []*p, timerpMaskSnapshot pMask, pollUntil int64) int64 {
3379 for id, p2 := range allpSnapshot {
3380 if timerpMaskSnapshot.read(uint32(id)) {
3381 w := nobarrierWakeTime(p2)
3382 if w != 0 && (pollUntil == 0 || w < pollUntil) {
3391 // Check for idle-priority GC, without a P on entry.
3393 // If some GC work, a P, and a worker G are all available, the P and G will be
3394 // returned. The returned P has not been wired yet.
3395 func checkIdleGCNoP() (*p, *g) {
3396 // N.B. Since we have no P, gcBlackenEnabled may change at any time; we
3397 // must check again after acquiring a P. As an optimization, we also check
3398 // if an idle mark worker is needed at all. This is OK here, because if we
3399 // observe that one isn't needed, at least one is currently running. Even if
3400 // it stops running, its own journey into the scheduler should schedule it
3401 // again, if need be (at which point, this check will pass, if relevant).
3402 if atomic.Load(&gcBlackenEnabled) == 0 || !gcController.needIdleMarkWorker() {
3405 if !gcMarkWorkAvailable(nil) {
3409 // Work is available; we can start an idle GC worker only if there is
3410 // an available P and available worker G.
3412 // We can attempt to acquire these in either order, though both have
3413 // synchronization concerns (see below). Workers are almost always
3414 // available (see comment in findRunnableGCWorker for the one case
3415 // there may be none). Since we're slightly less likely to find a P,
3416 // check for that first.
3418 // Synchronization: note that we must hold sched.lock until we are
3419 // committed to keeping it. Otherwise we cannot put the unnecessary P
3420 // back in sched.pidle without performing the full set of idle
3421 // transition checks.
3423 // If we were to check gcBgMarkWorkerPool first, we must somehow handle
3424 // the assumption in gcControllerState.findRunnableGCWorker that an
3425 // empty gcBgMarkWorkerPool is only possible if gcMarkDone is running.
3427 pp, now := pidlegetSpinning(0)
3433 // Now that we own a P, gcBlackenEnabled can't change (as it requires STW).
3434 if gcBlackenEnabled == 0 || !gcController.addIdleMarkWorker() {
3440 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
3444 gcController.removeIdleMarkWorker()
3450 return pp, node.gp.ptr()
3453 // wakeNetPoller wakes up the thread sleeping in the network poller if it isn't
3454 // going to wake up before the when argument; or it wakes an idle P to service
3455 // timers and the network poller if there isn't one already.
3456 func wakeNetPoller(when int64) {
3457 if sched.lastpoll.Load() == 0 {
3458 // In findrunnable we ensure that when polling the pollUntil
3459 // field is either zero or the time to which the current
3460 // poll is expected to run. This can have a spurious wakeup
3461 // but should never miss a wakeup.
3462 pollerPollUntil := sched.pollUntil.Load()
3463 if pollerPollUntil == 0 || pollerPollUntil > when {
3467 // There are no threads in the network poller, try to get
3468 // one there so it can handle new timers.
3469 if GOOS != "plan9" { // Temporary workaround - see issue #42303.
3475 func resetspinning() {
3478 throw("resetspinning: not a spinning m")
3480 gp.m.spinning = false
3481 nmspinning := sched.nmspinning.Add(-1)
3483 throw("findrunnable: negative nmspinning")
3485 // M wakeup policy is deliberately somewhat conservative, so check if we
3486 // need to wakeup another P here. See "Worker thread parking/unparking"
3487 // comment at the top of the file for details.
3491 // injectglist adds each runnable G on the list to some run queue,
3492 // and clears glist. If there is no current P, they are added to the
3493 // global queue, and up to npidle M's are started to run them.
3494 // Otherwise, for each idle P, this adds a G to the global queue
3495 // and starts an M. Any remaining G's are added to the current P's
3497 // This may temporarily acquire sched.lock.
3498 // Can run concurrently with GC.
3499 func injectglist(glist *gList) {
3504 for gp := glist.head.ptr(); gp != nil; gp = gp.schedlink.ptr() {
3505 traceGoUnpark(gp, 0)
3509 // Mark all the goroutines as runnable before we put them
3510 // on the run queues.
3511 head := glist.head.ptr()
3514 for gp := head; gp != nil; gp = gp.schedlink.ptr() {
3517 casgstatus(gp, _Gwaiting, _Grunnable)
3520 // Turn the gList into a gQueue.
3526 startIdle := func(n int) {
3527 for i := 0; i < n; i++ {
3528 mp := acquirem() // See comment in startm.
3531 pp, _ := pidlegetSpinning(0)
3538 startm(pp, false, true)
3544 pp := getg().m.p.ptr()
3547 globrunqputbatch(&q, int32(qsize))
3553 npidle := int(sched.npidle.Load())
3556 for n = 0; n < npidle && !q.empty(); n++ {
3562 globrunqputbatch(&globq, int32(n))
3569 runqputbatch(pp, &q, qsize)
3573 // One round of scheduler: find a runnable goroutine and execute it.
3579 throw("schedule: holding locks")
3582 if mp.lockedg != 0 {
3584 execute(mp.lockedg.ptr(), false) // Never returns.
3587 // We should not schedule away from a g that is executing a cgo call,
3588 // since the cgo call is using the m's g0 stack.
3590 throw("schedule: in cgo")
3597 // Safety check: if we are spinning, the run queue should be empty.
3598 // Check this before calling checkTimers, as that might call
3599 // goready to put a ready goroutine on the local run queue.
3600 if mp.spinning && (pp.runnext != 0 || pp.runqhead != pp.runqtail) {
3601 throw("schedule: spinning with local work")
3604 gp, inheritTime, tryWakeP := findRunnable() // blocks until work is available
3606 if debug.dontfreezetheworld > 0 && freezing.Load() {
3607 // See comment in freezetheworld. We don't want to perturb
3608 // scheduler state, so we didn't gcstopm in findRunnable, but
3609 // also don't want to allow new goroutines to run.
3611 // Deadlock here rather than in the findRunnable loop so if
3612 // findRunnable is stuck in a loop we don't perturb that
3618 // This thread is going to run a goroutine and is not spinning anymore,
3619 // so if it was marked as spinning we need to reset it now and potentially
3620 // start a new spinning M.
3625 if sched.disable.user && !schedEnabled(gp) {
3626 // Scheduling of this goroutine is disabled. Put it on
3627 // the list of pending runnable goroutines for when we
3628 // re-enable user scheduling and look again.
3630 if schedEnabled(gp) {
3631 // Something re-enabled scheduling while we
3632 // were acquiring the lock.
3635 sched.disable.runnable.pushBack(gp)
3642 // If about to schedule a not-normal goroutine (a GCworker or tracereader),
3643 // wake a P if there is one.
3647 if gp.lockedm != 0 {
3648 // Hands off own p to the locked m,
3649 // then blocks waiting for a new p.
3654 execute(gp, inheritTime)
3657 // dropg removes the association between m and the current goroutine m->curg (gp for short).
3658 // Typically a caller sets gp's status away from Grunning and then
3659 // immediately calls dropg to finish the job. The caller is also responsible
3660 // for arranging that gp will be restarted using ready at an
3661 // appropriate time. After calling dropg and arranging for gp to be
3662 // readied later, the caller can do other work but eventually should
3663 // call schedule to restart the scheduling of goroutines on this m.
3667 setMNoWB(&gp.m.curg.m, nil)
3668 setGNoWB(&gp.m.curg, nil)
3671 // checkTimers runs any timers for the P that are ready.
3672 // If now is not 0 it is the current time.
3673 // It returns the passed time or the current time if now was passed as 0.
3674 // and the time when the next timer should run or 0 if there is no next timer,
3675 // and reports whether it ran any timers.
3676 // If the time when the next timer should run is not 0,
3677 // it is always larger than the returned time.
3678 // We pass now in and out to avoid extra calls of nanotime.
3680 //go:yeswritebarrierrec
3681 func checkTimers(pp *p, now int64) (rnow, pollUntil int64, ran bool) {
3682 // If it's not yet time for the first timer, or the first adjusted
3683 // timer, then there is nothing to do.
3684 next := pp.timer0When.Load()
3685 nextAdj := pp.timerModifiedEarliest.Load()
3686 if next == 0 || (nextAdj != 0 && nextAdj < next) {
3691 // No timers to run or adjust.
3692 return now, 0, false
3699 // Next timer is not ready to run, but keep going
3700 // if we would clear deleted timers.
3701 // This corresponds to the condition below where
3702 // we decide whether to call clearDeletedTimers.
3703 if pp != getg().m.p.ptr() || int(pp.deletedTimers.Load()) <= int(pp.numTimers.Load()/4) {
3704 return now, next, false
3708 lock(&pp.timersLock)
3710 if len(pp.timers) > 0 {
3711 adjusttimers(pp, now)
3712 for len(pp.timers) > 0 {
3713 // Note that runtimer may temporarily unlock
3715 if tw := runtimer(pp, now); tw != 0 {
3725 // If this is the local P, and there are a lot of deleted timers,
3726 // clear them out. We only do this for the local P to reduce
3727 // lock contention on timersLock.
3728 if pp == getg().m.p.ptr() && int(pp.deletedTimers.Load()) > len(pp.timers)/4 {
3729 clearDeletedTimers(pp)
3732 unlock(&pp.timersLock)
3734 return now, pollUntil, ran
3737 func parkunlock_c(gp *g, lock unsafe.Pointer) bool {
3738 unlock((*mutex)(lock))
3742 // park continuation on g0.
3743 func park_m(gp *g) {
3747 traceGoPark(mp.waitTraceBlockReason, mp.waitTraceSkip)
3750 // N.B. Not using casGToWaiting here because the waitreason is
3751 // set by park_m's caller.
3752 casgstatus(gp, _Grunning, _Gwaiting)
3755 if fn := mp.waitunlockf; fn != nil {
3756 ok := fn(gp, mp.waitlock)
3757 mp.waitunlockf = nil
3761 traceGoUnpark(gp, 2)
3763 casgstatus(gp, _Gwaiting, _Grunnable)
3764 execute(gp, true) // Schedule it back, never returns.
3770 func goschedImpl(gp *g) {
3771 status := readgstatus(gp)
3772 if status&^_Gscan != _Grunning {
3774 throw("bad g status")
3776 casgstatus(gp, _Grunning, _Grunnable)
3789 // Gosched continuation on g0.
3790 func gosched_m(gp *g) {
3797 // goschedguarded is a forbidden-states-avoided version of gosched_m.
3798 func goschedguarded_m(gp *g) {
3800 if !canPreemptM(gp.m) {
3801 gogo(&gp.sched) // never return
3810 func gopreempt_m(gp *g) {
3817 // preemptPark parks gp and puts it in _Gpreempted.
3820 func preemptPark(gp *g) {
3822 traceGoPark(traceBlockPreempted, 0)
3824 status := readgstatus(gp)
3825 if status&^_Gscan != _Grunning {
3827 throw("bad g status")
3830 if gp.asyncSafePoint {
3831 // Double-check that async preemption does not
3832 // happen in SPWRITE assembly functions.
3833 // isAsyncSafePoint must exclude this case.
3834 f := findfunc(gp.sched.pc)
3836 throw("preempt at unknown pc")
3838 if f.flag&abi.FuncFlagSPWrite != 0 {
3839 println("runtime: unexpected SPWRITE function", funcname(f), "in async preempt")
3840 throw("preempt SPWRITE")
3844 // Transition from _Grunning to _Gscan|_Gpreempted. We can't
3845 // be in _Grunning when we dropg because then we'd be running
3846 // without an M, but the moment we're in _Gpreempted,
3847 // something could claim this G before we've fully cleaned it
3848 // up. Hence, we set the scan bit to lock down further
3849 // transitions until we can dropg.
3850 casGToPreemptScan(gp, _Grunning, _Gscan|_Gpreempted)
3852 casfrom_Gscanstatus(gp, _Gscan|_Gpreempted, _Gpreempted)
3856 // goyield is like Gosched, but it:
3857 // - emits a GoPreempt trace event instead of a GoSched trace event
3858 // - puts the current G on the runq of the current P instead of the globrunq
3864 func goyield_m(gp *g) {
3869 casgstatus(gp, _Grunning, _Grunnable)
3871 runqput(pp, gp, false)
3875 // Finishes execution of the current goroutine.
3886 // goexit continuation on g0.
3887 func goexit0(gp *g) {
3891 casgstatus(gp, _Grunning, _Gdead)
3892 gcController.addScannableStack(pp, -int64(gp.stack.hi-gp.stack.lo))
3893 if isSystemGoroutine(gp, false) {
3897 locked := gp.lockedm != 0
3900 gp.preemptStop = false
3901 gp.paniconfault = false
3902 gp._defer = nil // should be true already but just in case.
3903 gp._panic = nil // non-nil for Goexit during panic. points at stack-allocated data.
3905 gp.waitreason = waitReasonZero
3910 if gcBlackenEnabled != 0 && gp.gcAssistBytes > 0 {
3911 // Flush assist credit to the global pool. This gives
3912 // better information to pacing if the application is
3913 // rapidly creating an exiting goroutines.
3914 assistWorkPerByte := gcController.assistWorkPerByte.Load()
3915 scanCredit := int64(assistWorkPerByte * float64(gp.gcAssistBytes))
3916 gcController.bgScanCredit.Add(scanCredit)
3917 gp.gcAssistBytes = 0
3922 if GOARCH == "wasm" { // no threads yet on wasm
3924 schedule() // never returns
3927 if mp.lockedInt != 0 {
3928 print("invalid m->lockedInt = ", mp.lockedInt, "\n")
3929 throw("internal lockOSThread error")
3933 // The goroutine may have locked this thread because
3934 // it put it in an unusual kernel state. Kill it
3935 // rather than returning it to the thread pool.
3937 // Return to mstart, which will release the P and exit
3939 if GOOS != "plan9" { // See golang.org/issue/22227.
3942 // Clear lockedExt on plan9 since we may end up re-using
3950 // save updates getg().sched to refer to pc and sp so that a following
3951 // gogo will restore pc and sp.
3953 // save must not have write barriers because invoking a write barrier
3954 // can clobber getg().sched.
3957 //go:nowritebarrierrec
3958 func save(pc, sp uintptr) {
3961 if gp == gp.m.g0 || gp == gp.m.gsignal {
3962 // m.g0.sched is special and must describe the context
3963 // for exiting the thread. mstart1 writes to it directly.
3964 // m.gsignal.sched should not be used at all.
3965 // This check makes sure save calls do not accidentally
3966 // run in contexts where they'd write to system g's.
3967 throw("save on system g not allowed")
3974 // We need to ensure ctxt is zero, but can't have a write
3975 // barrier here. However, it should always already be zero.
3977 if gp.sched.ctxt != nil {
3982 // The goroutine g is about to enter a system call.
3983 // Record that it's not using the cpu anymore.
3984 // This is called only from the go syscall library and cgocall,
3985 // not from the low-level system calls used by the runtime.
3987 // Entersyscall cannot split the stack: the save must
3988 // make g->sched refer to the caller's stack segment, because
3989 // entersyscall is going to return immediately after.
3991 // Nothing entersyscall calls can split the stack either.
3992 // We cannot safely move the stack during an active call to syscall,
3993 // because we do not know which of the uintptr arguments are
3994 // really pointers (back into the stack).
3995 // In practice, this means that we make the fast path run through
3996 // entersyscall doing no-split things, and the slow path has to use systemstack
3997 // to run bigger things on the system stack.
3999 // reentersyscall is the entry point used by cgo callbacks, where explicitly
4000 // saved SP and PC are restored. This is needed when exitsyscall will be called
4001 // from a function further up in the call stack than the parent, as g->syscallsp
4002 // must always point to a valid stack frame. entersyscall below is the normal
4003 // entry point for syscalls, which obtains the SP and PC from the caller.
4006 // At the start of a syscall we emit traceGoSysCall to capture the stack trace.
4007 // If the syscall does not block, that is it, we do not emit any other events.
4008 // If the syscall blocks (that is, P is retaken), retaker emits traceGoSysBlock;
4009 // when syscall returns we emit traceGoSysExit and when the goroutine starts running
4010 // (potentially instantly, if exitsyscallfast returns true) we emit traceGoStart.
4011 // To ensure that traceGoSysExit is emitted strictly after traceGoSysBlock,
4012 // we remember current value of syscalltick in m (gp.m.syscalltick = gp.m.p.ptr().syscalltick),
4013 // whoever emits traceGoSysBlock increments p.syscalltick afterwards;
4014 // and we wait for the increment before emitting traceGoSysExit.
4015 // Note that the increment is done even if tracing is not enabled,
4016 // because tracing can be enabled in the middle of syscall. We don't want the wait to hang.
4019 func reentersyscall(pc, sp uintptr) {
4022 // Disable preemption because during this function g is in Gsyscall status,
4023 // but can have inconsistent g->sched, do not let GC observe it.
4026 // Entersyscall must not call any function that might split/grow the stack.
4027 // (See details in comment above.)
4028 // Catch calls that might, by replacing the stack guard with something that
4029 // will trip any stack check and leaving a flag to tell newstack to die.
4030 gp.stackguard0 = stackPreempt
4031 gp.throwsplit = true
4033 // Leave SP around for GC and traceback.
4037 casgstatus(gp, _Grunning, _Gsyscall)
4038 if staticLockRanking {
4039 // When doing static lock ranking casgstatus can call
4040 // systemstack which clobbers g.sched.
4043 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
4044 systemstack(func() {
4045 print("entersyscall inconsistent ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
4046 throw("entersyscall")
4051 systemstack(traceGoSysCall)
4052 // systemstack itself clobbers g.sched.{pc,sp} and we might
4053 // need them later when the G is genuinely blocked in a
4058 if sched.sysmonwait.Load() {
4059 systemstack(entersyscall_sysmon)
4063 if gp.m.p.ptr().runSafePointFn != 0 {
4064 // runSafePointFn may stack split if run on this stack
4065 systemstack(runSafePointFn)
4069 gp.m.syscalltick = gp.m.p.ptr().syscalltick
4074 atomic.Store(&pp.status, _Psyscall)
4075 if sched.gcwaiting.Load() {
4076 systemstack(entersyscall_gcwait)
4083 // Standard syscall entry used by the go syscall library and normal cgo calls.
4085 // This is exported via linkname to assembly in the syscall package and x/sys.
4088 //go:linkname entersyscall
4089 func entersyscall() {
4090 reentersyscall(getcallerpc(), getcallersp())
4093 func entersyscall_sysmon() {
4095 if sched.sysmonwait.Load() {
4096 sched.sysmonwait.Store(false)
4097 notewakeup(&sched.sysmonnote)
4102 func entersyscall_gcwait() {
4104 pp := gp.m.oldp.ptr()
4107 if sched.stopwait > 0 && atomic.Cas(&pp.status, _Psyscall, _Pgcstop) {
4113 if sched.stopwait--; sched.stopwait == 0 {
4114 notewakeup(&sched.stopnote)
4120 // The same as entersyscall(), but with a hint that the syscall is blocking.
4123 func entersyscallblock() {
4126 gp.m.locks++ // see comment in entersyscall
4127 gp.throwsplit = true
4128 gp.stackguard0 = stackPreempt // see comment in entersyscall
4129 gp.m.syscalltick = gp.m.p.ptr().syscalltick
4130 gp.m.p.ptr().syscalltick++
4132 // Leave SP around for GC and traceback.
4136 gp.syscallsp = gp.sched.sp
4137 gp.syscallpc = gp.sched.pc
4138 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
4142 systemstack(func() {
4143 print("entersyscallblock inconsistent ", hex(sp1), " ", hex(sp2), " ", hex(sp3), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
4144 throw("entersyscallblock")
4147 casgstatus(gp, _Grunning, _Gsyscall)
4148 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
4149 systemstack(func() {
4150 print("entersyscallblock inconsistent ", hex(sp), " ", hex(gp.sched.sp), " ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
4151 throw("entersyscallblock")
4155 systemstack(entersyscallblock_handoff)
4157 // Resave for traceback during blocked call.
4158 save(getcallerpc(), getcallersp())
4163 func entersyscallblock_handoff() {
4166 traceGoSysBlock(getg().m.p.ptr())
4168 handoffp(releasep())
4171 // The goroutine g exited its system call.
4172 // Arrange for it to run on a cpu again.
4173 // This is called only from the go syscall library, not
4174 // from the low-level system calls used by the runtime.
4176 // Write barriers are not allowed because our P may have been stolen.
4178 // This is exported via linkname to assembly in the syscall package.
4181 //go:nowritebarrierrec
4182 //go:linkname exitsyscall
4183 func exitsyscall() {
4186 gp.m.locks++ // see comment in entersyscall
4187 if getcallersp() > gp.syscallsp {
4188 throw("exitsyscall: syscall frame is no longer valid")
4192 oldp := gp.m.oldp.ptr()
4194 if exitsyscallfast(oldp) {
4195 // When exitsyscallfast returns success, we have a P so can now use
4197 if goroutineProfile.active {
4198 // Make sure that gp has had its stack written out to the goroutine
4199 // profile, exactly as it was when the goroutine profiler first
4200 // stopped the world.
4201 systemstack(func() {
4202 tryRecordGoroutineProfileWB(gp)
4206 if oldp != gp.m.p.ptr() || gp.m.syscalltick != gp.m.p.ptr().syscalltick {
4207 systemstack(traceGoStart)
4210 // There's a cpu for us, so we can run.
4211 gp.m.p.ptr().syscalltick++
4212 // We need to cas the status and scan before resuming...
4213 casgstatus(gp, _Gsyscall, _Grunning)
4215 // Garbage collector isn't running (since we are),
4216 // so okay to clear syscallsp.
4220 // restore the preemption request in case we've cleared it in newstack
4221 gp.stackguard0 = stackPreempt
4223 // otherwise restore the real stackGuard, we've spoiled it in entersyscall/entersyscallblock
4224 gp.stackguard0 = gp.stack.lo + stackGuard
4226 gp.throwsplit = false
4228 if sched.disable.user && !schedEnabled(gp) {
4229 // Scheduling of this goroutine is disabled.
4237 // Wait till traceGoSysBlock event is emitted.
4238 // This ensures consistency of the trace (the goroutine is started after it is blocked).
4239 for oldp != nil && oldp.syscalltick == gp.m.syscalltick {
4242 // We can't trace syscall exit right now because we don't have a P.
4243 // Tracing code can invoke write barriers that cannot run without a P.
4244 // So instead we remember the syscall exit time and emit the event
4245 // in execute when we have a P.
4246 gp.trace.sysExitTime = traceClockNow()
4251 // Call the scheduler.
4254 // Scheduler returned, so we're allowed to run now.
4255 // Delete the syscallsp information that we left for
4256 // the garbage collector during the system call.
4257 // Must wait until now because until gosched returns
4258 // we don't know for sure that the garbage collector
4261 gp.m.p.ptr().syscalltick++
4262 gp.throwsplit = false
4266 func exitsyscallfast(oldp *p) bool {
4269 // Freezetheworld sets stopwait but does not retake P's.
4270 if sched.stopwait == freezeStopWait {
4274 // Try to re-acquire the last P.
4275 if oldp != nil && oldp.status == _Psyscall && atomic.Cas(&oldp.status, _Psyscall, _Pidle) {
4276 // There's a cpu for us, so we can run.
4278 exitsyscallfast_reacquired()
4282 // Try to get any other idle P.
4283 if sched.pidle != 0 {
4285 systemstack(func() {
4286 ok = exitsyscallfast_pidle()
4287 if ok && traceEnabled() {
4289 // Wait till traceGoSysBlock event is emitted.
4290 // This ensures consistency of the trace (the goroutine is started after it is blocked).
4291 for oldp.syscalltick == gp.m.syscalltick {
4305 // exitsyscallfast_reacquired is the exitsyscall path on which this G
4306 // has successfully reacquired the P it was running on before the
4310 func exitsyscallfast_reacquired() {
4312 if gp.m.syscalltick != gp.m.p.ptr().syscalltick {
4314 // The p was retaken and then enter into syscall again (since gp.m.syscalltick has changed).
4315 // traceGoSysBlock for this syscall was already emitted,
4316 // but here we effectively retake the p from the new syscall running on the same p.
4317 systemstack(func() {
4318 // Denote blocking of the new syscall.
4319 traceGoSysBlock(gp.m.p.ptr())
4320 // Denote completion of the current syscall.
4324 gp.m.p.ptr().syscalltick++
4328 func exitsyscallfast_pidle() bool {
4330 pp, _ := pidleget(0)
4331 if pp != nil && sched.sysmonwait.Load() {
4332 sched.sysmonwait.Store(false)
4333 notewakeup(&sched.sysmonnote)
4343 // exitsyscall slow path on g0.
4344 // Failed to acquire P, enqueue gp as runnable.
4346 // Called via mcall, so gp is the calling g from this M.
4348 //go:nowritebarrierrec
4349 func exitsyscall0(gp *g) {
4350 casgstatus(gp, _Gsyscall, _Grunnable)
4354 if schedEnabled(gp) {
4361 // Below, we stoplockedm if gp is locked. globrunqput releases
4362 // ownership of gp, so we must check if gp is locked prior to
4363 // committing the release by unlocking sched.lock, otherwise we
4364 // could race with another M transitioning gp from unlocked to
4366 locked = gp.lockedm != 0
4367 } else if sched.sysmonwait.Load() {
4368 sched.sysmonwait.Store(false)
4369 notewakeup(&sched.sysmonnote)
4374 execute(gp, false) // Never returns.
4377 // Wait until another thread schedules gp and so m again.
4379 // N.B. lockedm must be this M, as this g was running on this M
4380 // before entersyscall.
4382 execute(gp, false) // Never returns.
4385 schedule() // Never returns.
4388 // Called from syscall package before fork.
4390 //go:linkname syscall_runtime_BeforeFork syscall.runtime_BeforeFork
4392 func syscall_runtime_BeforeFork() {
4395 // Block signals during a fork, so that the child does not run
4396 // a signal handler before exec if a signal is sent to the process
4397 // group. See issue #18600.
4399 sigsave(&gp.m.sigmask)
4402 // This function is called before fork in syscall package.
4403 // Code between fork and exec must not allocate memory nor even try to grow stack.
4404 // Here we spoil g.stackguard0 to reliably detect any attempts to grow stack.
4405 // runtime_AfterFork will undo this in parent process, but not in child.
4406 gp.stackguard0 = stackFork
4409 // Called from syscall package after fork in parent.
4411 //go:linkname syscall_runtime_AfterFork syscall.runtime_AfterFork
4413 func syscall_runtime_AfterFork() {
4416 // See the comments in beforefork.
4417 gp.stackguard0 = gp.stack.lo + stackGuard
4419 msigrestore(gp.m.sigmask)
4424 // inForkedChild is true while manipulating signals in the child process.
4425 // This is used to avoid calling libc functions in case we are using vfork.
4426 var inForkedChild bool
4428 // Called from syscall package after fork in child.
4429 // It resets non-sigignored signals to the default handler, and
4430 // restores the signal mask in preparation for the exec.
4432 // Because this might be called during a vfork, and therefore may be
4433 // temporarily sharing address space with the parent process, this must
4434 // not change any global variables or calling into C code that may do so.
4436 //go:linkname syscall_runtime_AfterForkInChild syscall.runtime_AfterForkInChild
4438 //go:nowritebarrierrec
4439 func syscall_runtime_AfterForkInChild() {
4440 // It's OK to change the global variable inForkedChild here
4441 // because we are going to change it back. There is no race here,
4442 // because if we are sharing address space with the parent process,
4443 // then the parent process can not be running concurrently.
4444 inForkedChild = true
4446 clearSignalHandlers()
4448 // When we are the child we are the only thread running,
4449 // so we know that nothing else has changed gp.m.sigmask.
4450 msigrestore(getg().m.sigmask)
4452 inForkedChild = false
4455 // pendingPreemptSignals is the number of preemption signals
4456 // that have been sent but not received. This is only used on Darwin.
4458 var pendingPreemptSignals atomic.Int32
4460 // Called from syscall package before Exec.
4462 //go:linkname syscall_runtime_BeforeExec syscall.runtime_BeforeExec
4463 func syscall_runtime_BeforeExec() {
4464 // Prevent thread creation during exec.
4467 // On Darwin, wait for all pending preemption signals to
4468 // be received. See issue #41702.
4469 if GOOS == "darwin" || GOOS == "ios" {
4470 for pendingPreemptSignals.Load() > 0 {
4476 // Called from syscall package after Exec.
4478 //go:linkname syscall_runtime_AfterExec syscall.runtime_AfterExec
4479 func syscall_runtime_AfterExec() {
4483 // Allocate a new g, with a stack big enough for stacksize bytes.
4484 func malg(stacksize int32) *g {
4487 stacksize = round2(stackSystem + stacksize)
4488 systemstack(func() {
4489 newg.stack = stackalloc(uint32(stacksize))
4491 newg.stackguard0 = newg.stack.lo + stackGuard
4492 newg.stackguard1 = ^uintptr(0)
4493 // Clear the bottom word of the stack. We record g
4494 // there on gsignal stack during VDSO on ARM and ARM64.
4495 *(*uintptr)(unsafe.Pointer(newg.stack.lo)) = 0
4500 // Create a new g running fn.
4501 // Put it on the queue of g's waiting to run.
4502 // The compiler turns a go statement into a call to this.
4503 func newproc(fn *funcval) {
4506 systemstack(func() {
4507 newg := newproc1(fn, gp, pc)
4509 pp := getg().m.p.ptr()
4510 runqput(pp, newg, true)
4518 // Create a new g in state _Grunnable, starting at fn. callerpc is the
4519 // address of the go statement that created this. The caller is responsible
4520 // for adding the new g to the scheduler.
4521 func newproc1(fn *funcval, callergp *g, callerpc uintptr) *g {
4523 fatal("go of nil func value")
4526 mp := acquirem() // disable preemption because we hold M and P in local vars.
4530 newg = malg(stackMin)
4531 casgstatus(newg, _Gidle, _Gdead)
4532 allgadd(newg) // publishes with a g->status of Gdead so GC scanner doesn't look at uninitialized stack.
4534 if newg.stack.hi == 0 {
4535 throw("newproc1: newg missing stack")
4538 if readgstatus(newg) != _Gdead {
4539 throw("newproc1: new g is not Gdead")
4542 totalSize := uintptr(4*goarch.PtrSize + sys.MinFrameSize) // extra space in case of reads slightly beyond frame
4543 totalSize = alignUp(totalSize, sys.StackAlign)
4544 sp := newg.stack.hi - totalSize
4548 *(*uintptr)(unsafe.Pointer(sp)) = 0
4550 spArg += sys.MinFrameSize
4553 memclrNoHeapPointers(unsafe.Pointer(&newg.sched), unsafe.Sizeof(newg.sched))
4556 newg.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum // +PCQuantum so that previous instruction is in same function
4557 newg.sched.g = guintptr(unsafe.Pointer(newg))
4558 gostartcallfn(&newg.sched, fn)
4559 newg.parentGoid = callergp.goid
4560 newg.gopc = callerpc
4561 newg.ancestors = saveAncestors(callergp)
4562 newg.startpc = fn.fn
4563 if isSystemGoroutine(newg, false) {
4566 // Only user goroutines inherit pprof labels.
4568 newg.labels = mp.curg.labels
4570 if goroutineProfile.active {
4571 // A concurrent goroutine profile is running. It should include
4572 // exactly the set of goroutines that were alive when the goroutine
4573 // profiler first stopped the world. That does not include newg, so
4574 // mark it as not needing a profile before transitioning it from
4576 newg.goroutineProfiled.Store(goroutineProfileSatisfied)
4579 // Track initial transition?
4580 newg.trackingSeq = uint8(fastrand())
4581 if newg.trackingSeq%gTrackingPeriod == 0 {
4582 newg.tracking = true
4584 casgstatus(newg, _Gdead, _Grunnable)
4585 gcController.addScannableStack(pp, int64(newg.stack.hi-newg.stack.lo))
4587 if pp.goidcache == pp.goidcacheend {
4588 // Sched.goidgen is the last allocated id,
4589 // this batch must be [sched.goidgen+1, sched.goidgen+GoidCacheBatch].
4590 // At startup sched.goidgen=0, so main goroutine receives goid=1.
4591 pp.goidcache = sched.goidgen.Add(_GoidCacheBatch)
4592 pp.goidcache -= _GoidCacheBatch - 1
4593 pp.goidcacheend = pp.goidcache + _GoidCacheBatch
4595 newg.goid = pp.goidcache
4598 newg.racectx = racegostart(callerpc)
4600 if newg.labels != nil {
4601 // See note in proflabel.go on labelSync's role in synchronizing
4602 // with the reads in the signal handler.
4603 racereleasemergeg(newg, unsafe.Pointer(&labelSync))
4607 traceGoCreate(newg, newg.startpc)
4614 // saveAncestors copies previous ancestors of the given caller g and
4615 // includes info for the current caller into a new set of tracebacks for
4616 // a g being created.
4617 func saveAncestors(callergp *g) *[]ancestorInfo {
4618 // Copy all prior info, except for the root goroutine (goid 0).
4619 if debug.tracebackancestors <= 0 || callergp.goid == 0 {
4622 var callerAncestors []ancestorInfo
4623 if callergp.ancestors != nil {
4624 callerAncestors = *callergp.ancestors
4626 n := int32(len(callerAncestors)) + 1
4627 if n > debug.tracebackancestors {
4628 n = debug.tracebackancestors
4630 ancestors := make([]ancestorInfo, n)
4631 copy(ancestors[1:], callerAncestors)
4633 var pcs [tracebackInnerFrames]uintptr
4634 npcs := gcallers(callergp, 0, pcs[:])
4635 ipcs := make([]uintptr, npcs)
4637 ancestors[0] = ancestorInfo{
4639 goid: callergp.goid,
4640 gopc: callergp.gopc,
4643 ancestorsp := new([]ancestorInfo)
4644 *ancestorsp = ancestors
4648 // Put on gfree list.
4649 // If local list is too long, transfer a batch to the global list.
4650 func gfput(pp *p, gp *g) {
4651 if readgstatus(gp) != _Gdead {
4652 throw("gfput: bad status (not Gdead)")
4655 stksize := gp.stack.hi - gp.stack.lo
4657 if stksize != uintptr(startingStackSize) {
4658 // non-standard stack size - free it.
4667 if pp.gFree.n >= 64 {
4673 for pp.gFree.n >= 32 {
4674 gp := pp.gFree.pop()
4676 if gp.stack.lo == 0 {
4683 lock(&sched.gFree.lock)
4684 sched.gFree.noStack.pushAll(noStackQ)
4685 sched.gFree.stack.pushAll(stackQ)
4686 sched.gFree.n += inc
4687 unlock(&sched.gFree.lock)
4691 // Get from gfree list.
4692 // If local list is empty, grab a batch from global list.
4693 func gfget(pp *p) *g {
4695 if pp.gFree.empty() && (!sched.gFree.stack.empty() || !sched.gFree.noStack.empty()) {
4696 lock(&sched.gFree.lock)
4697 // Move a batch of free Gs to the P.
4698 for pp.gFree.n < 32 {
4699 // Prefer Gs with stacks.
4700 gp := sched.gFree.stack.pop()
4702 gp = sched.gFree.noStack.pop()
4711 unlock(&sched.gFree.lock)
4714 gp := pp.gFree.pop()
4719 if gp.stack.lo != 0 && gp.stack.hi-gp.stack.lo != uintptr(startingStackSize) {
4720 // Deallocate old stack. We kept it in gfput because it was the
4721 // right size when the goroutine was put on the free list, but
4722 // the right size has changed since then.
4723 systemstack(func() {
4730 if gp.stack.lo == 0 {
4731 // Stack was deallocated in gfput or just above. Allocate a new one.
4732 systemstack(func() {
4733 gp.stack = stackalloc(startingStackSize)
4735 gp.stackguard0 = gp.stack.lo + stackGuard
4738 racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4741 msanmalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4744 asanunpoison(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4750 // Purge all cached G's from gfree list to the global list.
4751 func gfpurge(pp *p) {
4757 for !pp.gFree.empty() {
4758 gp := pp.gFree.pop()
4760 if gp.stack.lo == 0 {
4767 lock(&sched.gFree.lock)
4768 sched.gFree.noStack.pushAll(noStackQ)
4769 sched.gFree.stack.pushAll(stackQ)
4770 sched.gFree.n += inc
4771 unlock(&sched.gFree.lock)
4774 // Breakpoint executes a breakpoint trap.
4779 // dolockOSThread is called by LockOSThread and lockOSThread below
4780 // after they modify m.locked. Do not allow preemption during this call,
4781 // or else the m might be different in this function than in the caller.
4784 func dolockOSThread() {
4785 if GOARCH == "wasm" {
4786 return // no threads on wasm yet
4789 gp.m.lockedg.set(gp)
4790 gp.lockedm.set(gp.m)
4793 // LockOSThread wires the calling goroutine to its current operating system thread.
4794 // The calling goroutine will always execute in that thread,
4795 // and no other goroutine will execute in it,
4796 // until the calling goroutine has made as many calls to
4797 // UnlockOSThread as to LockOSThread.
4798 // If the calling goroutine exits without unlocking the thread,
4799 // the thread will be terminated.
4801 // All init functions are run on the startup thread. Calling LockOSThread
4802 // from an init function will cause the main function to be invoked on
4805 // A goroutine should call LockOSThread before calling OS services or
4806 // non-Go library functions that depend on per-thread state.
4809 func LockOSThread() {
4810 if atomic.Load(&newmHandoff.haveTemplateThread) == 0 && GOOS != "plan9" {
4811 // If we need to start a new thread from the locked
4812 // thread, we need the template thread. Start it now
4813 // while we're in a known-good state.
4814 startTemplateThread()
4818 if gp.m.lockedExt == 0 {
4820 panic("LockOSThread nesting overflow")
4826 func lockOSThread() {
4827 getg().m.lockedInt++
4831 // dounlockOSThread is called by UnlockOSThread and unlockOSThread below
4832 // after they update m->locked. Do not allow preemption during this call,
4833 // or else the m might be in different in this function than in the caller.
4836 func dounlockOSThread() {
4837 if GOARCH == "wasm" {
4838 return // no threads on wasm yet
4841 if gp.m.lockedInt != 0 || gp.m.lockedExt != 0 {
4848 // UnlockOSThread undoes an earlier call to LockOSThread.
4849 // If this drops the number of active LockOSThread calls on the
4850 // calling goroutine to zero, it unwires the calling goroutine from
4851 // its fixed operating system thread.
4852 // If there are no active LockOSThread calls, this is a no-op.
4854 // Before calling UnlockOSThread, the caller must ensure that the OS
4855 // thread is suitable for running other goroutines. If the caller made
4856 // any permanent changes to the state of the thread that would affect
4857 // other goroutines, it should not call this function and thus leave
4858 // the goroutine locked to the OS thread until the goroutine (and
4859 // hence the thread) exits.
4862 func UnlockOSThread() {
4864 if gp.m.lockedExt == 0 {
4872 func unlockOSThread() {
4874 if gp.m.lockedInt == 0 {
4875 systemstack(badunlockosthread)
4881 func badunlockosthread() {
4882 throw("runtime: internal error: misuse of lockOSThread/unlockOSThread")
4885 func gcount() int32 {
4886 n := int32(atomic.Loaduintptr(&allglen)) - sched.gFree.n - sched.ngsys.Load()
4887 for _, pp := range allp {
4891 // All these variables can be changed concurrently, so the result can be inconsistent.
4892 // But at least the current goroutine is running.
4899 func mcount() int32 {
4900 return int32(sched.mnext - sched.nmfreed)
4904 signalLock atomic.Uint32
4906 // Must hold signalLock to write. Reads may be lock-free, but
4907 // signalLock should be taken to synchronize with changes.
4911 func _System() { _System() }
4912 func _ExternalCode() { _ExternalCode() }
4913 func _LostExternalCode() { _LostExternalCode() }
4914 func _GC() { _GC() }
4915 func _LostSIGPROFDuringAtomic64() { _LostSIGPROFDuringAtomic64() }
4916 func _VDSO() { _VDSO() }
4918 // Called if we receive a SIGPROF signal.
4919 // Called by the signal handler, may run during STW.
4921 //go:nowritebarrierrec
4922 func sigprof(pc, sp, lr uintptr, gp *g, mp *m) {
4923 if prof.hz.Load() == 0 {
4927 // If mp.profilehz is 0, then profiling is not enabled for this thread.
4928 // We must check this to avoid a deadlock between setcpuprofilerate
4929 // and the call to cpuprof.add, below.
4930 if mp != nil && mp.profilehz == 0 {
4934 // On mips{,le}/arm, 64bit atomics are emulated with spinlocks, in
4935 // runtime/internal/atomic. If SIGPROF arrives while the program is inside
4936 // the critical section, it creates a deadlock (when writing the sample).
4937 // As a workaround, create a counter of SIGPROFs while in critical section
4938 // to store the count, and pass it to sigprof.add() later when SIGPROF is
4939 // received from somewhere else (with _LostSIGPROFDuringAtomic64 as pc).
4940 if GOARCH == "mips" || GOARCH == "mipsle" || GOARCH == "arm" {
4941 if f := findfunc(pc); f.valid() {
4942 if hasPrefix(funcname(f), "runtime/internal/atomic") {
4943 cpuprof.lostAtomic++
4947 if GOARCH == "arm" && goarm < 7 && GOOS == "linux" && pc&0xffff0000 == 0xffff0000 {
4948 // runtime/internal/atomic functions call into kernel
4949 // helpers on arm < 7. See
4950 // runtime/internal/atomic/sys_linux_arm.s.
4951 cpuprof.lostAtomic++
4956 // Profiling runs concurrently with GC, so it must not allocate.
4957 // Set a trap in case the code does allocate.
4958 // Note that on windows, one thread takes profiles of all the
4959 // other threads, so mp is usually not getg().m.
4960 // In fact mp may not even be stopped.
4961 // See golang.org/issue/17165.
4962 getg().m.mallocing++
4965 var stk [maxCPUProfStack]uintptr
4967 if mp.ncgo > 0 && mp.curg != nil && mp.curg.syscallpc != 0 && mp.curg.syscallsp != 0 {
4969 // Check cgoCallersUse to make sure that we are not
4970 // interrupting other code that is fiddling with
4971 // cgoCallers. We are running in a signal handler
4972 // with all signals blocked, so we don't have to worry
4973 // about any other code interrupting us.
4974 if mp.cgoCallersUse.Load() == 0 && mp.cgoCallers != nil && mp.cgoCallers[0] != 0 {
4975 for cgoOff < len(mp.cgoCallers) && mp.cgoCallers[cgoOff] != 0 {
4978 n += copy(stk[:], mp.cgoCallers[:cgoOff])
4979 mp.cgoCallers[0] = 0
4982 // Collect Go stack that leads to the cgo call.
4983 u.initAt(mp.curg.syscallpc, mp.curg.syscallsp, 0, mp.curg, unwindSilentErrors)
4984 } else if usesLibcall() && mp.libcallg != 0 && mp.libcallpc != 0 && mp.libcallsp != 0 {
4985 // Libcall, i.e. runtime syscall on windows.
4986 // Collect Go stack that leads to the call.
4987 u.initAt(mp.libcallpc, mp.libcallsp, 0, mp.libcallg.ptr(), unwindSilentErrors)
4988 } else if mp != nil && mp.vdsoSP != 0 {
4989 // VDSO call, e.g. nanotime1 on Linux.
4990 // Collect Go stack that leads to the call.
4991 u.initAt(mp.vdsoPC, mp.vdsoSP, 0, gp, unwindSilentErrors|unwindJumpStack)
4993 u.initAt(pc, sp, lr, gp, unwindSilentErrors|unwindTrap|unwindJumpStack)
4995 n += tracebackPCs(&u, 0, stk[n:])
4998 // Normal traceback is impossible or has failed.
4999 // Account it against abstract "System" or "GC".
5002 pc = abi.FuncPCABIInternal(_VDSO) + sys.PCQuantum
5003 } else if pc > firstmoduledata.etext {
5004 // "ExternalCode" is better than "etext".
5005 pc = abi.FuncPCABIInternal(_ExternalCode) + sys.PCQuantum
5008 if mp.preemptoff != "" {
5009 stk[1] = abi.FuncPCABIInternal(_GC) + sys.PCQuantum
5011 stk[1] = abi.FuncPCABIInternal(_System) + sys.PCQuantum
5015 if prof.hz.Load() != 0 {
5016 // Note: it can happen on Windows that we interrupted a system thread
5017 // with no g, so gp could nil. The other nil checks are done out of
5018 // caution, but not expected to be nil in practice.
5019 var tagPtr *unsafe.Pointer
5020 if gp != nil && gp.m != nil && gp.m.curg != nil {
5021 tagPtr = &gp.m.curg.labels
5023 cpuprof.add(tagPtr, stk[:n])
5027 if gp != nil && gp.m != nil {
5028 if gp.m.curg != nil {
5033 traceCPUSample(gprof, pp, stk[:n])
5035 getg().m.mallocing--
5038 // setcpuprofilerate sets the CPU profiling rate to hz times per second.
5039 // If hz <= 0, setcpuprofilerate turns off CPU profiling.
5040 func setcpuprofilerate(hz int32) {
5041 // Force sane arguments.
5046 // Disable preemption, otherwise we can be rescheduled to another thread
5047 // that has profiling enabled.
5051 // Stop profiler on this thread so that it is safe to lock prof.
5052 // if a profiling signal came in while we had prof locked,
5053 // it would deadlock.
5054 setThreadCPUProfiler(0)
5056 for !prof.signalLock.CompareAndSwap(0, 1) {
5059 if prof.hz.Load() != hz {
5060 setProcessCPUProfiler(hz)
5063 prof.signalLock.Store(0)
5066 sched.profilehz = hz
5070 setThreadCPUProfiler(hz)
5076 // init initializes pp, which may be a freshly allocated p or a
5077 // previously destroyed p, and transitions it to status _Pgcstop.
5078 func (pp *p) init(id int32) {
5080 pp.status = _Pgcstop
5081 pp.sudogcache = pp.sudogbuf[:0]
5082 pp.deferpool = pp.deferpoolbuf[:0]
5084 if pp.mcache == nil {
5087 throw("missing mcache?")
5089 // Use the bootstrap mcache0. Only one P will get
5090 // mcache0: the one with ID 0.
5093 pp.mcache = allocmcache()
5096 if raceenabled && pp.raceprocctx == 0 {
5098 pp.raceprocctx = raceprocctx0
5099 raceprocctx0 = 0 // bootstrap
5101 pp.raceprocctx = raceproccreate()
5104 lockInit(&pp.timersLock, lockRankTimers)
5106 // This P may get timers when it starts running. Set the mask here
5107 // since the P may not go through pidleget (notably P 0 on startup).
5109 // Similarly, we may not go through pidleget before this P starts
5110 // running if it is P 0 on startup.
5114 // destroy releases all of the resources associated with pp and
5115 // transitions it to status _Pdead.
5117 // sched.lock must be held and the world must be stopped.
5118 func (pp *p) destroy() {
5119 assertLockHeld(&sched.lock)
5120 assertWorldStopped()
5122 // Move all runnable goroutines to the global queue
5123 for pp.runqhead != pp.runqtail {
5124 // Pop from tail of local queue
5126 gp := pp.runq[pp.runqtail%uint32(len(pp.runq))].ptr()
5127 // Push onto head of global queue
5130 if pp.runnext != 0 {
5131 globrunqputhead(pp.runnext.ptr())
5134 if len(pp.timers) > 0 {
5135 plocal := getg().m.p.ptr()
5136 // The world is stopped, but we acquire timersLock to
5137 // protect against sysmon calling timeSleepUntil.
5138 // This is the only case where we hold the timersLock of
5139 // more than one P, so there are no deadlock concerns.
5140 lock(&plocal.timersLock)
5141 lock(&pp.timersLock)
5142 moveTimers(plocal, pp.timers)
5144 pp.numTimers.Store(0)
5145 pp.deletedTimers.Store(0)
5146 pp.timer0When.Store(0)
5147 unlock(&pp.timersLock)
5148 unlock(&plocal.timersLock)
5150 // Flush p's write barrier buffer.
5151 if gcphase != _GCoff {
5155 for i := range pp.sudogbuf {
5156 pp.sudogbuf[i] = nil
5158 pp.sudogcache = pp.sudogbuf[:0]
5159 pp.pinnerCache = nil
5160 for j := range pp.deferpoolbuf {
5161 pp.deferpoolbuf[j] = nil
5163 pp.deferpool = pp.deferpoolbuf[:0]
5164 systemstack(func() {
5165 for i := 0; i < pp.mspancache.len; i++ {
5166 // Safe to call since the world is stopped.
5167 mheap_.spanalloc.free(unsafe.Pointer(pp.mspancache.buf[i]))
5169 pp.mspancache.len = 0
5171 pp.pcache.flush(&mheap_.pages)
5172 unlock(&mheap_.lock)
5174 freemcache(pp.mcache)
5179 if pp.timerRaceCtx != 0 {
5180 // The race detector code uses a callback to fetch
5181 // the proc context, so arrange for that callback
5182 // to see the right thing.
5183 // This hack only works because we are the only
5189 racectxend(pp.timerRaceCtx)
5194 raceprocdestroy(pp.raceprocctx)
5201 // Change number of processors.
5203 // sched.lock must be held, and the world must be stopped.
5205 // gcworkbufs must not be being modified by either the GC or the write barrier
5206 // code, so the GC must not be running if the number of Ps actually changes.
5208 // Returns list of Ps with local work, they need to be scheduled by the caller.
5209 func procresize(nprocs int32) *p {
5210 assertLockHeld(&sched.lock)
5211 assertWorldStopped()
5214 if old < 0 || nprocs <= 0 {
5215 throw("procresize: invalid arg")
5218 traceGomaxprocs(nprocs)
5221 // update statistics
5223 if sched.procresizetime != 0 {
5224 sched.totaltime += int64(old) * (now - sched.procresizetime)
5226 sched.procresizetime = now
5228 maskWords := (nprocs + 31) / 32
5230 // Grow allp if necessary.
5231 if nprocs > int32(len(allp)) {
5232 // Synchronize with retake, which could be running
5233 // concurrently since it doesn't run on a P.
5235 if nprocs <= int32(cap(allp)) {
5236 allp = allp[:nprocs]
5238 nallp := make([]*p, nprocs)
5239 // Copy everything up to allp's cap so we
5240 // never lose old allocated Ps.
5241 copy(nallp, allp[:cap(allp)])
5245 if maskWords <= int32(cap(idlepMask)) {
5246 idlepMask = idlepMask[:maskWords]
5247 timerpMask = timerpMask[:maskWords]
5249 nidlepMask := make([]uint32, maskWords)
5250 // No need to copy beyond len, old Ps are irrelevant.
5251 copy(nidlepMask, idlepMask)
5252 idlepMask = nidlepMask
5254 ntimerpMask := make([]uint32, maskWords)
5255 copy(ntimerpMask, timerpMask)
5256 timerpMask = ntimerpMask
5261 // initialize new P's
5262 for i := old; i < nprocs; i++ {
5268 atomicstorep(unsafe.Pointer(&allp[i]), unsafe.Pointer(pp))
5272 if gp.m.p != 0 && gp.m.p.ptr().id < nprocs {
5273 // continue to use the current P
5274 gp.m.p.ptr().status = _Prunning
5275 gp.m.p.ptr().mcache.prepareForSweep()
5277 // release the current P and acquire allp[0].
5279 // We must do this before destroying our current P
5280 // because p.destroy itself has write barriers, so we
5281 // need to do that from a valid P.
5284 // Pretend that we were descheduled
5285 // and then scheduled again to keep
5288 traceProcStop(gp.m.p.ptr())
5302 // g.m.p is now set, so we no longer need mcache0 for bootstrapping.
5305 // release resources from unused P's
5306 for i := nprocs; i < old; i++ {
5309 // can't free P itself because it can be referenced by an M in syscall
5313 if int32(len(allp)) != nprocs {
5315 allp = allp[:nprocs]
5316 idlepMask = idlepMask[:maskWords]
5317 timerpMask = timerpMask[:maskWords]
5322 for i := nprocs - 1; i >= 0; i-- {
5324 if gp.m.p.ptr() == pp {
5332 pp.link.set(runnablePs)
5336 stealOrder.reset(uint32(nprocs))
5337 var int32p *int32 = &gomaxprocs // make compiler check that gomaxprocs is an int32
5338 atomic.Store((*uint32)(unsafe.Pointer(int32p)), uint32(nprocs))
5340 // Notify the limiter that the amount of procs has changed.
5341 gcCPULimiter.resetCapacity(now, nprocs)
5346 // Associate p and the current m.
5348 // This function is allowed to have write barriers even if the caller
5349 // isn't because it immediately acquires pp.
5351 //go:yeswritebarrierrec
5352 func acquirep(pp *p) {
5353 // Do the part that isn't allowed to have write barriers.
5356 // Have p; write barriers now allowed.
5358 // Perform deferred mcache flush before this P can allocate
5359 // from a potentially stale mcache.
5360 pp.mcache.prepareForSweep()
5367 // wirep is the first step of acquirep, which actually associates the
5368 // current M to pp. This is broken out so we can disallow write
5369 // barriers for this part, since we don't yet have a P.
5371 //go:nowritebarrierrec
5377 throw("wirep: already in go")
5379 if pp.m != 0 || pp.status != _Pidle {
5384 print("wirep: p->m=", pp.m, "(", id, ") p->status=", pp.status, "\n")
5385 throw("wirep: invalid p state")
5389 pp.status = _Prunning
5392 // Disassociate p and the current m.
5393 func releasep() *p {
5397 throw("releasep: invalid arg")
5400 if pp.m.ptr() != gp.m || pp.status != _Prunning {
5401 print("releasep: m=", gp.m, " m->p=", gp.m.p.ptr(), " p->m=", hex(pp.m), " p->status=", pp.status, "\n")
5402 throw("releasep: invalid p state")
5405 traceProcStop(gp.m.p.ptr())
5413 func incidlelocked(v int32) {
5415 sched.nmidlelocked += v
5422 // Check for deadlock situation.
5423 // The check is based on number of running M's, if 0 -> deadlock.
5424 // sched.lock must be held.
5426 assertLockHeld(&sched.lock)
5428 // For -buildmode=c-shared or -buildmode=c-archive it's OK if
5429 // there are no running goroutines. The calling program is
5430 // assumed to be running.
5431 if islibrary || isarchive {
5435 // If we are dying because of a signal caught on an already idle thread,
5436 // freezetheworld will cause all running threads to block.
5437 // And runtime will essentially enter into deadlock state,
5438 // except that there is a thread that will call exit soon.
5439 if panicking.Load() > 0 {
5443 // If we are not running under cgo, but we have an extra M then account
5444 // for it. (It is possible to have an extra M on Windows without cgo to
5445 // accommodate callbacks created by syscall.NewCallback. See issue #6751
5448 if !iscgo && cgoHasExtraM && extraMLength.Load() > 0 {
5452 run := mcount() - sched.nmidle - sched.nmidlelocked - sched.nmsys
5457 print("runtime: checkdead: nmidle=", sched.nmidle, " nmidlelocked=", sched.nmidlelocked, " mcount=", mcount(), " nmsys=", sched.nmsys, "\n")
5459 throw("checkdead: inconsistent counts")
5463 forEachG(func(gp *g) {
5464 if isSystemGoroutine(gp, false) {
5467 s := readgstatus(gp)
5468 switch s &^ _Gscan {
5475 print("runtime: checkdead: find g ", gp.goid, " in status ", s, "\n")
5477 throw("checkdead: runnable g")
5480 if grunning == 0 { // possible if main goroutine calls runtime·Goexit()
5481 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5482 fatal("no goroutines (main called runtime.Goexit) - deadlock!")
5485 // Maybe jump time forward for playground.
5487 if when := timeSleepUntil(); when < maxWhen {
5490 // Start an M to steal the timer.
5491 pp, _ := pidleget(faketime)
5493 // There should always be a free P since
5494 // nothing is running.
5496 throw("checkdead: no p for timer")
5500 // There should always be a free M since
5501 // nothing is running.
5503 throw("checkdead: no m for timer")
5505 // M must be spinning to steal. We set this to be
5506 // explicit, but since this is the only M it would
5507 // become spinning on its own anyways.
5508 sched.nmspinning.Add(1)
5511 notewakeup(&mp.park)
5516 // There are no goroutines running, so we can look at the P's.
5517 for _, pp := range allp {
5518 if len(pp.timers) > 0 {
5523 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5524 fatal("all goroutines are asleep - deadlock!")
5527 // forcegcperiod is the maximum time in nanoseconds between garbage
5528 // collections. If we go this long without a garbage collection, one
5529 // is forced to run.
5531 // This is a variable for testing purposes. It normally doesn't change.
5532 var forcegcperiod int64 = 2 * 60 * 1e9
5534 // needSysmonWorkaround is true if the workaround for
5535 // golang.org/issue/42515 is needed on NetBSD.
5536 var needSysmonWorkaround bool = false
5538 // Always runs without a P, so write barriers are not allowed.
5540 //go:nowritebarrierrec
5547 lasttrace := int64(0)
5548 idle := 0 // how many cycles in succession we had not wokeup somebody
5552 if idle == 0 { // start with 20us sleep...
5554 } else if idle > 50 { // start doubling the sleep after 1ms...
5557 if delay > 10*1000 { // up to 10ms
5562 // sysmon should not enter deep sleep if schedtrace is enabled so that
5563 // it can print that information at the right time.
5565 // It should also not enter deep sleep if there are any active P's so
5566 // that it can retake P's from syscalls, preempt long running G's, and
5567 // poll the network if all P's are busy for long stretches.
5569 // It should wakeup from deep sleep if any P's become active either due
5570 // to exiting a syscall or waking up due to a timer expiring so that it
5571 // can resume performing those duties. If it wakes from a syscall it
5572 // resets idle and delay as a bet that since it had retaken a P from a
5573 // syscall before, it may need to do it again shortly after the
5574 // application starts work again. It does not reset idle when waking
5575 // from a timer to avoid adding system load to applications that spend
5576 // most of their time sleeping.
5578 if debug.schedtrace <= 0 && (sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs) {
5580 if sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs {
5581 syscallWake := false
5582 next := timeSleepUntil()
5584 sched.sysmonwait.Store(true)
5586 // Make wake-up period small enough
5587 // for the sampling to be correct.
5588 sleep := forcegcperiod / 2
5589 if next-now < sleep {
5592 shouldRelax := sleep >= osRelaxMinNS
5596 syscallWake = notetsleep(&sched.sysmonnote, sleep)
5601 sched.sysmonwait.Store(false)
5602 noteclear(&sched.sysmonnote)
5612 lock(&sched.sysmonlock)
5613 // Update now in case we blocked on sysmonnote or spent a long time
5614 // blocked on schedlock or sysmonlock above.
5617 // trigger libc interceptors if needed
5618 if *cgo_yield != nil {
5619 asmcgocall(*cgo_yield, nil)
5621 // poll network if not polled for more than 10ms
5622 lastpoll := sched.lastpoll.Load()
5623 if netpollinited() && lastpoll != 0 && lastpoll+10*1000*1000 < now {
5624 sched.lastpoll.CompareAndSwap(lastpoll, now)
5625 list, delta := netpoll(0) // non-blocking - returns list of goroutines
5627 // Need to decrement number of idle locked M's
5628 // (pretending that one more is running) before injectglist.
5629 // Otherwise it can lead to the following situation:
5630 // injectglist grabs all P's but before it starts M's to run the P's,
5631 // another M returns from syscall, finishes running its G,
5632 // observes that there is no work to do and no other running M's
5633 // and reports deadlock.
5637 netpollAdjustWaiters(delta)
5640 if GOOS == "netbsd" && needSysmonWorkaround {
5641 // netpoll is responsible for waiting for timer
5642 // expiration, so we typically don't have to worry
5643 // about starting an M to service timers. (Note that
5644 // sleep for timeSleepUntil above simply ensures sysmon
5645 // starts running again when that timer expiration may
5646 // cause Go code to run again).
5648 // However, netbsd has a kernel bug that sometimes
5649 // misses netpollBreak wake-ups, which can lead to
5650 // unbounded delays servicing timers. If we detect this
5651 // overrun, then startm to get something to handle the
5654 // See issue 42515 and
5655 // https://gnats.netbsd.org/cgi-bin/query-pr-single.pl?number=50094.
5656 if next := timeSleepUntil(); next < now {
5657 startm(nil, false, false)
5660 if scavenger.sysmonWake.Load() != 0 {
5661 // Kick the scavenger awake if someone requested it.
5664 // retake P's blocked in syscalls
5665 // and preempt long running G's
5666 if retake(now) != 0 {
5671 // check if we need to force a GC
5672 if t := (gcTrigger{kind: gcTriggerTime, now: now}); t.test() && forcegc.idle.Load() {
5674 forcegc.idle.Store(false)
5676 list.push(forcegc.g)
5678 unlock(&forcegc.lock)
5680 if debug.schedtrace > 0 && lasttrace+int64(debug.schedtrace)*1000000 <= now {
5682 schedtrace(debug.scheddetail > 0)
5684 unlock(&sched.sysmonlock)
5688 type sysmontick struct {
5695 // forcePreemptNS is the time slice given to a G before it is
5697 const forcePreemptNS = 10 * 1000 * 1000 // 10ms
5699 func retake(now int64) uint32 {
5701 // Prevent allp slice changes. This lock will be completely
5702 // uncontended unless we're already stopping the world.
5704 // We can't use a range loop over allp because we may
5705 // temporarily drop the allpLock. Hence, we need to re-fetch
5706 // allp each time around the loop.
5707 for i := 0; i < len(allp); i++ {
5710 // This can happen if procresize has grown
5711 // allp but not yet created new Ps.
5714 pd := &pp.sysmontick
5717 if s == _Prunning || s == _Psyscall {
5718 // Preempt G if it's running for too long.
5719 t := int64(pp.schedtick)
5720 if int64(pd.schedtick) != t {
5721 pd.schedtick = uint32(t)
5723 } else if pd.schedwhen+forcePreemptNS <= now {
5725 // In case of syscall, preemptone() doesn't
5726 // work, because there is no M wired to P.
5731 // Retake P from syscall if it's there for more than 1 sysmon tick (at least 20us).
5732 t := int64(pp.syscalltick)
5733 if !sysretake && int64(pd.syscalltick) != t {
5734 pd.syscalltick = uint32(t)
5735 pd.syscallwhen = now
5738 // On the one hand we don't want to retake Ps if there is no other work to do,
5739 // but on the other hand we want to retake them eventually
5740 // because they can prevent the sysmon thread from deep sleep.
5741 if runqempty(pp) && sched.nmspinning.Load()+sched.npidle.Load() > 0 && pd.syscallwhen+10*1000*1000 > now {
5744 // Drop allpLock so we can take sched.lock.
5746 // Need to decrement number of idle locked M's
5747 // (pretending that one more is running) before the CAS.
5748 // Otherwise the M from which we retake can exit the syscall,
5749 // increment nmidle and report deadlock.
5751 if atomic.Cas(&pp.status, s, _Pidle) {
5768 // Tell all goroutines that they have been preempted and they should stop.
5769 // This function is purely best-effort. It can fail to inform a goroutine if a
5770 // processor just started running it.
5771 // No locks need to be held.
5772 // Returns true if preemption request was issued to at least one goroutine.
5773 func preemptall() bool {
5775 for _, pp := range allp {
5776 if pp.status != _Prunning {
5786 // Tell the goroutine running on processor P to stop.
5787 // This function is purely best-effort. It can incorrectly fail to inform the
5788 // goroutine. It can inform the wrong goroutine. Even if it informs the
5789 // correct goroutine, that goroutine might ignore the request if it is
5790 // simultaneously executing newstack.
5791 // No lock needs to be held.
5792 // Returns true if preemption request was issued.
5793 // The actual preemption will happen at some point in the future
5794 // and will be indicated by the gp->status no longer being
5796 func preemptone(pp *p) bool {
5798 if mp == nil || mp == getg().m {
5802 if gp == nil || gp == mp.g0 {
5808 // Every call in a goroutine checks for stack overflow by
5809 // comparing the current stack pointer to gp->stackguard0.
5810 // Setting gp->stackguard0 to StackPreempt folds
5811 // preemption into the normal stack overflow check.
5812 gp.stackguard0 = stackPreempt
5814 // Request an async preemption of this P.
5815 if preemptMSupported && debug.asyncpreemptoff == 0 {
5825 func schedtrace(detailed bool) {
5832 print("SCHED ", (now-starttime)/1e6, "ms: gomaxprocs=", gomaxprocs, " idleprocs=", sched.npidle.Load(), " threads=", mcount(), " spinningthreads=", sched.nmspinning.Load(), " needspinning=", sched.needspinning.Load(), " idlethreads=", sched.nmidle, " runqueue=", sched.runqsize)
5834 print(" gcwaiting=", sched.gcwaiting.Load(), " nmidlelocked=", sched.nmidlelocked, " stopwait=", sched.stopwait, " sysmonwait=", sched.sysmonwait.Load(), "\n")
5836 // We must be careful while reading data from P's, M's and G's.
5837 // Even if we hold schedlock, most data can be changed concurrently.
5838 // E.g. (p->m ? p->m->id : -1) can crash if p->m changes from non-nil to nil.
5839 for i, pp := range allp {
5841 h := atomic.Load(&pp.runqhead)
5842 t := atomic.Load(&pp.runqtail)
5844 print(" P", i, ": status=", pp.status, " schedtick=", pp.schedtick, " syscalltick=", pp.syscalltick, " m=")
5850 print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers), "\n")
5852 // In non-detailed mode format lengths of per-P run queues as:
5853 // [len1 len2 len3 len4]
5859 if i == len(allp)-1 {
5870 for mp := allm; mp != nil; mp = mp.alllink {
5872 print(" M", mp.id, ": p=")
5884 print(" mallocing=", mp.mallocing, " throwing=", mp.throwing, " preemptoff=", mp.preemptoff, " locks=", mp.locks, " dying=", mp.dying, " spinning=", mp.spinning, " blocked=", mp.blocked, " lockedg=")
5885 if lockedg := mp.lockedg.ptr(); lockedg != nil {
5893 forEachG(func(gp *g) {
5894 print(" G", gp.goid, ": status=", readgstatus(gp), "(", gp.waitreason.String(), ") m=")
5901 if lockedm := gp.lockedm.ptr(); lockedm != nil {
5911 // schedEnableUser enables or disables the scheduling of user
5914 // This does not stop already running user goroutines, so the caller
5915 // should first stop the world when disabling user goroutines.
5916 func schedEnableUser(enable bool) {
5918 if sched.disable.user == !enable {
5922 sched.disable.user = !enable
5924 n := sched.disable.n
5926 globrunqputbatch(&sched.disable.runnable, n)
5928 for ; n != 0 && sched.npidle.Load() != 0; n-- {
5929 startm(nil, false, false)
5936 // schedEnabled reports whether gp should be scheduled. It returns
5937 // false is scheduling of gp is disabled.
5939 // sched.lock must be held.
5940 func schedEnabled(gp *g) bool {
5941 assertLockHeld(&sched.lock)
5943 if sched.disable.user {
5944 return isSystemGoroutine(gp, true)
5949 // Put mp on midle list.
5950 // sched.lock must be held.
5951 // May run during STW, so write barriers are not allowed.
5953 //go:nowritebarrierrec
5955 assertLockHeld(&sched.lock)
5957 mp.schedlink = sched.midle
5963 // Try to get an m from midle list.
5964 // sched.lock must be held.
5965 // May run during STW, so write barriers are not allowed.
5967 //go:nowritebarrierrec
5969 assertLockHeld(&sched.lock)
5971 mp := sched.midle.ptr()
5973 sched.midle = mp.schedlink
5979 // Put gp on the global runnable queue.
5980 // sched.lock must be held.
5981 // May run during STW, so write barriers are not allowed.
5983 //go:nowritebarrierrec
5984 func globrunqput(gp *g) {
5985 assertLockHeld(&sched.lock)
5987 sched.runq.pushBack(gp)
5991 // Put gp at the head of the global runnable queue.
5992 // sched.lock must be held.
5993 // May run during STW, so write barriers are not allowed.
5995 //go:nowritebarrierrec
5996 func globrunqputhead(gp *g) {
5997 assertLockHeld(&sched.lock)
6003 // Put a batch of runnable goroutines on the global runnable queue.
6004 // This clears *batch.
6005 // sched.lock must be held.
6006 // May run during STW, so write barriers are not allowed.
6008 //go:nowritebarrierrec
6009 func globrunqputbatch(batch *gQueue, n int32) {
6010 assertLockHeld(&sched.lock)
6012 sched.runq.pushBackAll(*batch)
6017 // Try get a batch of G's from the global runnable queue.
6018 // sched.lock must be held.
6019 func globrunqget(pp *p, max int32) *g {
6020 assertLockHeld(&sched.lock)
6022 if sched.runqsize == 0 {
6026 n := sched.runqsize/gomaxprocs + 1
6027 if n > sched.runqsize {
6030 if max > 0 && n > max {
6033 if n > int32(len(pp.runq))/2 {
6034 n = int32(len(pp.runq)) / 2
6039 gp := sched.runq.pop()
6042 gp1 := sched.runq.pop()
6043 runqput(pp, gp1, false)
6048 // pMask is an atomic bitstring with one bit per P.
6051 // read returns true if P id's bit is set.
6052 func (p pMask) read(id uint32) bool {
6054 mask := uint32(1) << (id % 32)
6055 return (atomic.Load(&p[word]) & mask) != 0
6058 // set sets P id's bit.
6059 func (p pMask) set(id int32) {
6061 mask := uint32(1) << (id % 32)
6062 atomic.Or(&p[word], mask)
6065 // clear clears P id's bit.
6066 func (p pMask) clear(id int32) {
6068 mask := uint32(1) << (id % 32)
6069 atomic.And(&p[word], ^mask)
6072 // updateTimerPMask clears pp's timer mask if it has no timers on its heap.
6074 // Ideally, the timer mask would be kept immediately consistent on any timer
6075 // operations. Unfortunately, updating a shared global data structure in the
6076 // timer hot path adds too much overhead in applications frequently switching
6077 // between no timers and some timers.
6079 // As a compromise, the timer mask is updated only on pidleget / pidleput. A
6080 // running P (returned by pidleget) may add a timer at any time, so its mask
6081 // must be set. An idle P (passed to pidleput) cannot add new timers while
6082 // idle, so if it has no timers at that time, its mask may be cleared.
6084 // Thus, we get the following effects on timer-stealing in findrunnable:
6086 // - Idle Ps with no timers when they go idle are never checked in findrunnable
6087 // (for work- or timer-stealing; this is the ideal case).
6088 // - Running Ps must always be checked.
6089 // - Idle Ps whose timers are stolen must continue to be checked until they run
6090 // again, even after timer expiration.
6092 // When the P starts running again, the mask should be set, as a timer may be
6093 // added at any time.
6095 // TODO(prattmic): Additional targeted updates may improve the above cases.
6096 // e.g., updating the mask when stealing a timer.
6097 func updateTimerPMask(pp *p) {
6098 if pp.numTimers.Load() > 0 {
6102 // Looks like there are no timers, however another P may transiently
6103 // decrement numTimers when handling a timerModified timer in
6104 // checkTimers. We must take timersLock to serialize with these changes.
6105 lock(&pp.timersLock)
6106 if pp.numTimers.Load() == 0 {
6107 timerpMask.clear(pp.id)
6109 unlock(&pp.timersLock)
6112 // pidleput puts p on the _Pidle list. now must be a relatively recent call
6113 // to nanotime or zero. Returns now or the current time if now was zero.
6115 // This releases ownership of p. Once sched.lock is released it is no longer
6118 // sched.lock must be held.
6120 // May run during STW, so write barriers are not allowed.
6122 //go:nowritebarrierrec
6123 func pidleput(pp *p, now int64) int64 {
6124 assertLockHeld(&sched.lock)
6127 throw("pidleput: P has non-empty run queue")
6132 updateTimerPMask(pp) // clear if there are no timers.
6133 idlepMask.set(pp.id)
6134 pp.link = sched.pidle
6137 if !pp.limiterEvent.start(limiterEventIdle, now) {
6138 throw("must be able to track idle limiter event")
6143 // pidleget tries to get a p from the _Pidle list, acquiring ownership.
6145 // sched.lock must be held.
6147 // May run during STW, so write barriers are not allowed.
6149 //go:nowritebarrierrec
6150 func pidleget(now int64) (*p, int64) {
6151 assertLockHeld(&sched.lock)
6153 pp := sched.pidle.ptr()
6155 // Timer may get added at any time now.
6159 timerpMask.set(pp.id)
6160 idlepMask.clear(pp.id)
6161 sched.pidle = pp.link
6162 sched.npidle.Add(-1)
6163 pp.limiterEvent.stop(limiterEventIdle, now)
6168 // pidlegetSpinning tries to get a p from the _Pidle list, acquiring ownership.
6169 // This is called by spinning Ms (or callers than need a spinning M) that have
6170 // found work. If no P is available, this must synchronized with non-spinning
6171 // Ms that may be preparing to drop their P without discovering this work.
6173 // sched.lock must be held.
6175 // May run during STW, so write barriers are not allowed.
6177 //go:nowritebarrierrec
6178 func pidlegetSpinning(now int64) (*p, int64) {
6179 assertLockHeld(&sched.lock)
6181 pp, now := pidleget(now)
6183 // See "Delicate dance" comment in findrunnable. We found work
6184 // that we cannot take, we must synchronize with non-spinning
6185 // Ms that may be preparing to drop their P.
6186 sched.needspinning.Store(1)
6193 // runqempty reports whether pp has no Gs on its local run queue.
6194 // It never returns true spuriously.
6195 func runqempty(pp *p) bool {
6196 // Defend against a race where 1) pp has G1 in runqnext but runqhead == runqtail,
6197 // 2) runqput on pp kicks G1 to the runq, 3) runqget on pp empties runqnext.
6198 // Simply observing that runqhead == runqtail and then observing that runqnext == nil
6199 // does not mean the queue is empty.
6201 head := atomic.Load(&pp.runqhead)
6202 tail := atomic.Load(&pp.runqtail)
6203 runnext := atomic.Loaduintptr((*uintptr)(unsafe.Pointer(&pp.runnext)))
6204 if tail == atomic.Load(&pp.runqtail) {
6205 return head == tail && runnext == 0
6210 // To shake out latent assumptions about scheduling order,
6211 // we introduce some randomness into scheduling decisions
6212 // when running with the race detector.
6213 // The need for this was made obvious by changing the
6214 // (deterministic) scheduling order in Go 1.5 and breaking
6215 // many poorly-written tests.
6216 // With the randomness here, as long as the tests pass
6217 // consistently with -race, they shouldn't have latent scheduling
6219 const randomizeScheduler = raceenabled
6221 // runqput tries to put g on the local runnable queue.
6222 // If next is false, runqput adds g to the tail of the runnable queue.
6223 // If next is true, runqput puts g in the pp.runnext slot.
6224 // If the run queue is full, runnext puts g on the global queue.
6225 // Executed only by the owner P.
6226 func runqput(pp *p, gp *g, next bool) {
6227 if randomizeScheduler && next && fastrandn(2) == 0 {
6233 oldnext := pp.runnext
6234 if !pp.runnext.cas(oldnext, guintptr(unsafe.Pointer(gp))) {
6240 // Kick the old runnext out to the regular run queue.
6245 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
6247 if t-h < uint32(len(pp.runq)) {
6248 pp.runq[t%uint32(len(pp.runq))].set(gp)
6249 atomic.StoreRel(&pp.runqtail, t+1) // store-release, makes the item available for consumption
6252 if runqputslow(pp, gp, h, t) {
6255 // the queue is not full, now the put above must succeed
6259 // Put g and a batch of work from local runnable queue on global queue.
6260 // Executed only by the owner P.
6261 func runqputslow(pp *p, gp *g, h, t uint32) bool {
6262 var batch [len(pp.runq)/2 + 1]*g
6264 // First, grab a batch from local queue.
6267 if n != uint32(len(pp.runq)/2) {
6268 throw("runqputslow: queue is not full")
6270 for i := uint32(0); i < n; i++ {
6271 batch[i] = pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
6273 if !atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
6278 if randomizeScheduler {
6279 for i := uint32(1); i <= n; i++ {
6280 j := fastrandn(i + 1)
6281 batch[i], batch[j] = batch[j], batch[i]
6285 // Link the goroutines.
6286 for i := uint32(0); i < n; i++ {
6287 batch[i].schedlink.set(batch[i+1])
6290 q.head.set(batch[0])
6291 q.tail.set(batch[n])
6293 // Now put the batch on global queue.
6295 globrunqputbatch(&q, int32(n+1))
6300 // runqputbatch tries to put all the G's on q on the local runnable queue.
6301 // If the queue is full, they are put on the global queue; in that case
6302 // this will temporarily acquire the scheduler lock.
6303 // Executed only by the owner P.
6304 func runqputbatch(pp *p, q *gQueue, qsize int) {
6305 h := atomic.LoadAcq(&pp.runqhead)
6308 for !q.empty() && t-h < uint32(len(pp.runq)) {
6310 pp.runq[t%uint32(len(pp.runq))].set(gp)
6316 if randomizeScheduler {
6317 off := func(o uint32) uint32 {
6318 return (pp.runqtail + o) % uint32(len(pp.runq))
6320 for i := uint32(1); i < n; i++ {
6321 j := fastrandn(i + 1)
6322 pp.runq[off(i)], pp.runq[off(j)] = pp.runq[off(j)], pp.runq[off(i)]
6326 atomic.StoreRel(&pp.runqtail, t)
6329 globrunqputbatch(q, int32(qsize))
6334 // Get g from local runnable queue.
6335 // If inheritTime is true, gp should inherit the remaining time in the
6336 // current time slice. Otherwise, it should start a new time slice.
6337 // Executed only by the owner P.
6338 func runqget(pp *p) (gp *g, inheritTime bool) {
6339 // If there's a runnext, it's the next G to run.
6341 // If the runnext is non-0 and the CAS fails, it could only have been stolen by another P,
6342 // because other Ps can race to set runnext to 0, but only the current P can set it to non-0.
6343 // Hence, there's no need to retry this CAS if it fails.
6344 if next != 0 && pp.runnext.cas(next, 0) {
6345 return next.ptr(), true
6349 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6354 gp := pp.runq[h%uint32(len(pp.runq))].ptr()
6355 if atomic.CasRel(&pp.runqhead, h, h+1) { // cas-release, commits consume
6361 // runqdrain drains the local runnable queue of pp and returns all goroutines in it.
6362 // Executed only by the owner P.
6363 func runqdrain(pp *p) (drainQ gQueue, n uint32) {
6364 oldNext := pp.runnext
6365 if oldNext != 0 && pp.runnext.cas(oldNext, 0) {
6366 drainQ.pushBack(oldNext.ptr())
6371 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6377 if qn > uint32(len(pp.runq)) { // read inconsistent h and t
6381 if !atomic.CasRel(&pp.runqhead, h, h+qn) { // cas-release, commits consume
6385 // We've inverted the order in which it gets G's from the local P's runnable queue
6386 // and then advances the head pointer because we don't want to mess up the statuses of G's
6387 // while runqdrain() and runqsteal() are running in parallel.
6388 // Thus we should advance the head pointer before draining the local P into a gQueue,
6389 // so that we can update any gp.schedlink only after we take the full ownership of G,
6390 // meanwhile, other P's can't access to all G's in local P's runnable queue and steal them.
6391 // See https://groups.google.com/g/golang-dev/c/0pTKxEKhHSc/m/6Q85QjdVBQAJ for more details.
6392 for i := uint32(0); i < qn; i++ {
6393 gp := pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
6400 // Grabs a batch of goroutines from pp's runnable queue into batch.
6401 // Batch is a ring buffer starting at batchHead.
6402 // Returns number of grabbed goroutines.
6403 // Can be executed by any P.
6404 func runqgrab(pp *p, batch *[256]guintptr, batchHead uint32, stealRunNextG bool) uint32 {
6406 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6407 t := atomic.LoadAcq(&pp.runqtail) // load-acquire, synchronize with the producer
6412 // Try to steal from pp.runnext.
6413 if next := pp.runnext; next != 0 {
6414 if pp.status == _Prunning {
6415 // Sleep to ensure that pp isn't about to run the g
6416 // we are about to steal.
6417 // The important use case here is when the g running
6418 // on pp ready()s another g and then almost
6419 // immediately blocks. Instead of stealing runnext
6420 // in this window, back off to give pp a chance to
6421 // schedule runnext. This will avoid thrashing gs
6422 // between different Ps.
6423 // A sync chan send/recv takes ~50ns as of time of
6424 // writing, so 3us gives ~50x overshoot.
6425 if GOOS != "windows" && GOOS != "openbsd" && GOOS != "netbsd" {
6428 // On some platforms system timer granularity is
6429 // 1-15ms, which is way too much for this
6430 // optimization. So just yield.
6434 if !pp.runnext.cas(next, 0) {
6437 batch[batchHead%uint32(len(batch))] = next
6443 if n > uint32(len(pp.runq)/2) { // read inconsistent h and t
6446 for i := uint32(0); i < n; i++ {
6447 g := pp.runq[(h+i)%uint32(len(pp.runq))]
6448 batch[(batchHead+i)%uint32(len(batch))] = g
6450 if atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
6456 // Steal half of elements from local runnable queue of p2
6457 // and put onto local runnable queue of p.
6458 // Returns one of the stolen elements (or nil if failed).
6459 func runqsteal(pp, p2 *p, stealRunNextG bool) *g {
6461 n := runqgrab(p2, &pp.runq, t, stealRunNextG)
6466 gp := pp.runq[(t+n)%uint32(len(pp.runq))].ptr()
6470 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
6471 if t-h+n >= uint32(len(pp.runq)) {
6472 throw("runqsteal: runq overflow")
6474 atomic.StoreRel(&pp.runqtail, t+n) // store-release, makes the item available for consumption
6478 // A gQueue is a dequeue of Gs linked through g.schedlink. A G can only
6479 // be on one gQueue or gList at a time.
6480 type gQueue struct {
6485 // empty reports whether q is empty.
6486 func (q *gQueue) empty() bool {
6490 // push adds gp to the head of q.
6491 func (q *gQueue) push(gp *g) {
6492 gp.schedlink = q.head
6499 // pushBack adds gp to the tail of q.
6500 func (q *gQueue) pushBack(gp *g) {
6503 q.tail.ptr().schedlink.set(gp)
6510 // pushBackAll adds all Gs in q2 to the tail of q. After this q2 must
6512 func (q *gQueue) pushBackAll(q2 gQueue) {
6516 q2.tail.ptr().schedlink = 0
6518 q.tail.ptr().schedlink = q2.head
6525 // pop removes and returns the head of queue q. It returns nil if
6527 func (q *gQueue) pop() *g {
6530 q.head = gp.schedlink
6538 // popList takes all Gs in q and returns them as a gList.
6539 func (q *gQueue) popList() gList {
6540 stack := gList{q.head}
6545 // A gList is a list of Gs linked through g.schedlink. A G can only be
6546 // on one gQueue or gList at a time.
6551 // empty reports whether l is empty.
6552 func (l *gList) empty() bool {
6556 // push adds gp to the head of l.
6557 func (l *gList) push(gp *g) {
6558 gp.schedlink = l.head
6562 // pushAll prepends all Gs in q to l.
6563 func (l *gList) pushAll(q gQueue) {
6565 q.tail.ptr().schedlink = l.head
6570 // pop removes and returns the head of l. If l is empty, it returns nil.
6571 func (l *gList) pop() *g {
6574 l.head = gp.schedlink
6579 //go:linkname setMaxThreads runtime/debug.setMaxThreads
6580 func setMaxThreads(in int) (out int) {
6582 out = int(sched.maxmcount)
6583 if in > 0x7fffffff { // MaxInt32
6584 sched.maxmcount = 0x7fffffff
6586 sched.maxmcount = int32(in)
6594 func procPin() int {
6599 return int(mp.p.ptr().id)
6608 //go:linkname sync_runtime_procPin sync.runtime_procPin
6610 func sync_runtime_procPin() int {
6614 //go:linkname sync_runtime_procUnpin sync.runtime_procUnpin
6616 func sync_runtime_procUnpin() {
6620 //go:linkname sync_atomic_runtime_procPin sync/atomic.runtime_procPin
6622 func sync_atomic_runtime_procPin() int {
6626 //go:linkname sync_atomic_runtime_procUnpin sync/atomic.runtime_procUnpin
6628 func sync_atomic_runtime_procUnpin() {
6632 // Active spinning for sync.Mutex.
6634 //go:linkname sync_runtime_canSpin sync.runtime_canSpin
6636 func sync_runtime_canSpin(i int) bool {
6637 // sync.Mutex is cooperative, so we are conservative with spinning.
6638 // Spin only few times and only if running on a multicore machine and
6639 // GOMAXPROCS>1 and there is at least one other running P and local runq is empty.
6640 // As opposed to runtime mutex we don't do passive spinning here,
6641 // because there can be work on global runq or on other Ps.
6642 if i >= active_spin || ncpu <= 1 || gomaxprocs <= sched.npidle.Load()+sched.nmspinning.Load()+1 {
6645 if p := getg().m.p.ptr(); !runqempty(p) {
6651 //go:linkname sync_runtime_doSpin sync.runtime_doSpin
6653 func sync_runtime_doSpin() {
6654 procyield(active_spin_cnt)
6657 var stealOrder randomOrder
6659 // randomOrder/randomEnum are helper types for randomized work stealing.
6660 // They allow to enumerate all Ps in different pseudo-random orders without repetitions.
6661 // The algorithm is based on the fact that if we have X such that X and GOMAXPROCS
6662 // are coprime, then a sequences of (i + X) % GOMAXPROCS gives the required enumeration.
6663 type randomOrder struct {
6668 type randomEnum struct {
6675 func (ord *randomOrder) reset(count uint32) {
6677 ord.coprimes = ord.coprimes[:0]
6678 for i := uint32(1); i <= count; i++ {
6679 if gcd(i, count) == 1 {
6680 ord.coprimes = append(ord.coprimes, i)
6685 func (ord *randomOrder) start(i uint32) randomEnum {
6689 inc: ord.coprimes[i/ord.count%uint32(len(ord.coprimes))],
6693 func (enum *randomEnum) done() bool {
6694 return enum.i == enum.count
6697 func (enum *randomEnum) next() {
6699 enum.pos = (enum.pos + enum.inc) % enum.count
6702 func (enum *randomEnum) position() uint32 {
6706 func gcd(a, b uint32) uint32 {
6713 // An initTask represents the set of initializations that need to be done for a package.
6714 // Keep in sync with ../../test/noinit.go:initTask
6715 type initTask struct {
6716 state uint32 // 0 = uninitialized, 1 = in progress, 2 = done
6718 // followed by nfns pcs, uintptr sized, one per init function to run
6721 // inittrace stores statistics for init functions which are
6722 // updated by malloc and newproc when active is true.
6723 var inittrace tracestat
6725 type tracestat struct {
6726 active bool // init tracing activation status
6727 id uint64 // init goroutine id
6728 allocs uint64 // heap allocations
6729 bytes uint64 // heap allocated bytes
6732 func doInit(ts []*initTask) {
6733 for _, t := range ts {
6738 func doInit1(t *initTask) {
6740 case 2: // fully initialized
6742 case 1: // initialization in progress
6743 throw("recursive call during initialization - linker skew")
6744 default: // not initialized yet
6745 t.state = 1 // initialization in progress
6752 if inittrace.active {
6754 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6759 // We should have pruned all of these in the linker.
6760 throw("inittask with no functions")
6763 firstFunc := add(unsafe.Pointer(t), 8)
6764 for i := uint32(0); i < t.nfns; i++ {
6765 p := add(firstFunc, uintptr(i)*goarch.PtrSize)
6766 f := *(*func())(unsafe.Pointer(&p))
6770 if inittrace.active {
6772 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6775 f := *(*func())(unsafe.Pointer(&firstFunc))
6776 pkg := funcpkgpath(findfunc(abi.FuncPCABIInternal(f)))
6779 print("init ", pkg, " @")
6780 print(string(fmtNSAsMS(sbuf[:], uint64(start-runtimeInitTime))), " ms, ")
6781 print(string(fmtNSAsMS(sbuf[:], uint64(end-start))), " ms clock, ")
6782 print(string(itoa(sbuf[:], after.bytes-before.bytes)), " bytes, ")
6783 print(string(itoa(sbuf[:], after.allocs-before.allocs)), " allocs")
6787 t.state = 2 // initialization done