1 // Copyright 2014 The Go Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style
3 // license that can be found in the LICENSE file.
11 "runtime/internal/atomic"
12 "runtime/internal/sys"
16 // set using cmd/go/internal/modload.ModInfoProg
19 // Goroutine scheduler
20 // The scheduler's job is to distribute ready-to-run goroutines over worker threads.
22 // The main concepts are:
24 // M - worker thread, or machine.
25 // P - processor, a resource that is required to execute Go code.
26 // M must have an associated P to execute Go code, however it can be
27 // blocked or in a syscall w/o an associated P.
29 // Design doc at https://golang.org/s/go11sched.
31 // Worker thread parking/unparking.
32 // We need to balance between keeping enough running worker threads to utilize
33 // available hardware parallelism and parking excessive running worker threads
34 // to conserve CPU resources and power. This is not simple for two reasons:
35 // (1) scheduler state is intentionally distributed (in particular, per-P work
36 // queues), so it is not possible to compute global predicates on fast paths;
37 // (2) for optimal thread management we would need to know the future (don't park
38 // a worker thread when a new goroutine will be readied in near future).
40 // Three rejected approaches that would work badly:
41 // 1. Centralize all scheduler state (would inhibit scalability).
42 // 2. Direct goroutine handoff. That is, when we ready a new goroutine and there
43 // is a spare P, unpark a thread and handoff it the thread and the goroutine.
44 // This would lead to thread state thrashing, as the thread that readied the
45 // goroutine can be out of work the very next moment, we will need to park it.
46 // Also, it would destroy locality of computation as we want to preserve
47 // dependent goroutines on the same thread; and introduce additional latency.
48 // 3. Unpark an additional thread whenever we ready a goroutine and there is an
49 // idle P, but don't do handoff. This would lead to excessive thread parking/
50 // unparking as the additional threads will instantly park without discovering
53 // The current approach:
55 // This approach applies to three primary sources of potential work: readying a
56 // goroutine, new/modified-earlier timers, and idle-priority GC. See below for
57 // additional details.
59 // We unpark an additional thread when we submit work if (this is wakep()):
60 // 1. There is an idle P, and
61 // 2. There are no "spinning" worker threads.
63 // A worker thread is considered spinning if it is out of local work and did
64 // not find work in the global run queue or netpoller; the spinning state is
65 // denoted in m.spinning and in sched.nmspinning. Threads unparked this way are
66 // also considered spinning; we don't do goroutine handoff so such threads are
67 // out of work initially. Spinning threads spin on looking for work in per-P
68 // run queues and timer heaps or from the GC before parking. If a spinning
69 // thread finds work it takes itself out of the spinning state and proceeds to
70 // execution. If it does not find work it takes itself out of the spinning
71 // state and then parks.
73 // If there is at least one spinning thread (sched.nmspinning>1), we don't
74 // unpark new threads when submitting work. To compensate for that, if the last
75 // spinning thread finds work and stops spinning, it must unpark a new spinning
76 // thread. This approach smooths out unjustified spikes of thread unparking,
77 // but at the same time guarantees eventual maximal CPU parallelism
80 // The main implementation complication is that we need to be very careful
81 // during spinning->non-spinning thread transition. This transition can race
82 // with submission of new work, and either one part or another needs to unpark
83 // another worker thread. If they both fail to do that, we can end up with
84 // semi-persistent CPU underutilization.
86 // The general pattern for submission is:
87 // 1. Submit work to the local run queue, timer heap, or GC state.
88 // 2. #StoreLoad-style memory barrier.
89 // 3. Check sched.nmspinning.
91 // The general pattern for spinning->non-spinning transition is:
92 // 1. Decrement nmspinning.
93 // 2. #StoreLoad-style memory barrier.
94 // 3. Check all per-P work queues and GC for new work.
96 // Note that all this complexity does not apply to global run queue as we are
97 // not sloppy about thread unparking when submitting to global queue. Also see
98 // comments for nmspinning manipulation.
100 // How these different sources of work behave varies, though it doesn't affect
101 // the synchronization approach:
102 // * Ready goroutine: this is an obvious source of work; the goroutine is
103 // immediately ready and must run on some thread eventually.
104 // * New/modified-earlier timer: The current timer implementation (see time.go)
105 // uses netpoll in a thread with no work available to wait for the soonest
106 // timer. If there is no thread waiting, we want a new spinning thread to go
108 // * Idle-priority GC: The GC wakes a stopped idle thread to contribute to
109 // background GC work (note: currently disabled per golang.org/issue/19112).
110 // Also see golang.org/issue/44313, as this should be extended to all GC
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_thread_start == nil {
213 throw("_cgo_thread_start missing")
215 if GOOS != "windows" {
216 if _cgo_setenv == nil {
217 throw("_cgo_setenv missing")
219 if _cgo_unsetenv == nil {
220 throw("_cgo_unsetenv missing")
223 if _cgo_notify_runtime_init_done == nil {
224 throw("_cgo_notify_runtime_init_done missing")
226 // Start the template thread in case we enter Go from
227 // a C-created thread and need to create a new thread.
228 startTemplateThread()
229 cgocall(_cgo_notify_runtime_init_done, nil)
232 // Run the initializing tasks. Depending on build mode this
233 // list can arrive a few different ways, but it will always
234 // contain the init tasks computed by the linker for all the
235 // packages in the program (excluding those added at runtime
236 // by package plugin).
237 for _, m := range activeModules() {
241 // Disable init tracing after main init done to avoid overhead
242 // of collecting statistics in malloc and newproc
243 inittrace.active = false
245 close(main_init_done)
250 if isarchive || islibrary {
251 // A program compiled with -buildmode=c-archive or c-shared
252 // has a main, but it is not executed.
255 fn := main_main // make an indirect call, as the linker doesn't know the address of the main package when laying down the runtime
258 runExitHooks(0) // run hooks now, since racefini does not return
262 // Make racy client program work: if panicking on
263 // another goroutine at the same time as main returns,
264 // let the other goroutine finish printing the panic trace.
265 // Once it does, it will exit. See issues 3934 and 20018.
266 if runningPanicDefers.Load() != 0 {
267 // Running deferred functions should not take long.
268 for c := 0; c < 1000; c++ {
269 if runningPanicDefers.Load() == 0 {
275 if panicking.Load() != 0 {
276 gopark(nil, nil, waitReasonPanicWait, traceEvGoStop, 1)
287 // os_beforeExit is called from os.Exit(0).
289 //go:linkname os_beforeExit os.runtime_beforeExit
290 func os_beforeExit(exitCode int) {
291 runExitHooks(exitCode)
292 if exitCode == 0 && raceenabled {
297 // start forcegc helper goroutine
302 func forcegchelper() {
304 lockInit(&forcegc.lock, lockRankForcegc)
307 if forcegc.idle.Load() {
308 throw("forcegc: phase error")
310 forcegc.idle.Store(true)
311 goparkunlock(&forcegc.lock, waitReasonForceGCIdle, traceEvGoBlock, 1)
312 // this goroutine is explicitly resumed by sysmon
313 if debug.gctrace > 0 {
316 // Time-triggered, fully concurrent.
317 gcStart(gcTrigger{kind: gcTriggerTime, now: nanotime()})
321 // Gosched yields the processor, allowing other goroutines to run. It does not
322 // suspend the current goroutine, so execution resumes automatically.
330 // goschedguarded yields the processor like gosched, but also checks
331 // for forbidden states and opts out of the yield in those cases.
334 func goschedguarded() {
335 mcall(goschedguarded_m)
338 // goschedIfBusy yields the processor like gosched, but only does so if
339 // there are no idle Ps or if we're on the only P and there's nothing in
340 // the run queue. In both cases, there is freely available idle time.
343 func goschedIfBusy() {
345 // Call gosched if gp.preempt is set; we may be in a tight loop that
346 // doesn't otherwise yield.
347 if !gp.preempt && sched.npidle.Load() > 0 {
353 // Puts the current goroutine into a waiting state and calls unlockf on the
356 // If unlockf returns false, the goroutine is resumed.
358 // unlockf must not access this G's stack, as it may be moved between
359 // the call to gopark and the call to unlockf.
361 // Note that because unlockf is called after putting the G into a waiting
362 // state, the G may have already been readied by the time unlockf is called
363 // unless there is external synchronization preventing the G from being
364 // readied. If unlockf returns false, it must guarantee that the G cannot be
365 // externally readied.
367 // Reason explains why the goroutine has been parked. It is displayed in stack
368 // traces and heap dumps. Reasons should be unique and descriptive. Do not
369 // re-use reasons, add new ones.
370 func gopark(unlockf func(*g, unsafe.Pointer) bool, lock unsafe.Pointer, reason waitReason, traceEv byte, traceskip int) {
371 if reason != waitReasonSleep {
372 checkTimeouts() // timeouts may expire while two goroutines keep the scheduler busy
376 status := readgstatus(gp)
377 if status != _Grunning && status != _Gscanrunning {
378 throw("gopark: bad g status")
381 mp.waitunlockf = unlockf
382 gp.waitreason = reason
383 mp.waittraceev = traceEv
384 mp.waittraceskip = traceskip
386 // can't do anything that might move the G between Ms here.
390 // Puts the current goroutine into a waiting state and unlocks the lock.
391 // The goroutine can be made runnable again by calling goready(gp).
392 func goparkunlock(lock *mutex, reason waitReason, traceEv byte, traceskip int) {
393 gopark(parkunlock_c, unsafe.Pointer(lock), reason, traceEv, traceskip)
396 func goready(gp *g, traceskip int) {
398 ready(gp, traceskip, true)
403 func acquireSudog() *sudog {
404 // Delicate dance: the semaphore implementation calls
405 // acquireSudog, acquireSudog calls new(sudog),
406 // new calls malloc, malloc can call the garbage collector,
407 // and the garbage collector calls the semaphore implementation
409 // Break the cycle by doing acquirem/releasem around new(sudog).
410 // The acquirem/releasem increments m.locks during new(sudog),
411 // which keeps the garbage collector from being invoked.
414 if len(pp.sudogcache) == 0 {
415 lock(&sched.sudoglock)
416 // First, try to grab a batch from central cache.
417 for len(pp.sudogcache) < cap(pp.sudogcache)/2 && sched.sudogcache != nil {
418 s := sched.sudogcache
419 sched.sudogcache = s.next
421 pp.sudogcache = append(pp.sudogcache, s)
423 unlock(&sched.sudoglock)
424 // If the central cache is empty, allocate a new one.
425 if len(pp.sudogcache) == 0 {
426 pp.sudogcache = append(pp.sudogcache, new(sudog))
429 n := len(pp.sudogcache)
430 s := pp.sudogcache[n-1]
431 pp.sudogcache[n-1] = nil
432 pp.sudogcache = pp.sudogcache[:n-1]
434 throw("acquireSudog: found s.elem != nil in cache")
441 func releaseSudog(s *sudog) {
443 throw("runtime: sudog with non-nil elem")
446 throw("runtime: sudog with non-false isSelect")
449 throw("runtime: sudog with non-nil next")
452 throw("runtime: sudog with non-nil prev")
454 if s.waitlink != nil {
455 throw("runtime: sudog with non-nil waitlink")
458 throw("runtime: sudog with non-nil c")
462 throw("runtime: releaseSudog with non-nil gp.param")
464 mp := acquirem() // avoid rescheduling to another P
466 if len(pp.sudogcache) == cap(pp.sudogcache) {
467 // Transfer half of local cache to the central cache.
468 var first, last *sudog
469 for len(pp.sudogcache) > cap(pp.sudogcache)/2 {
470 n := len(pp.sudogcache)
471 p := pp.sudogcache[n-1]
472 pp.sudogcache[n-1] = nil
473 pp.sudogcache = pp.sudogcache[:n-1]
481 lock(&sched.sudoglock)
482 last.next = sched.sudogcache
483 sched.sudogcache = first
484 unlock(&sched.sudoglock)
486 pp.sudogcache = append(pp.sudogcache, s)
490 // called from assembly.
491 func badmcall(fn func(*g)) {
492 throw("runtime: mcall called on m->g0 stack")
495 func badmcall2(fn func(*g)) {
496 throw("runtime: mcall function returned")
499 func badreflectcall() {
500 panic(plainError("arg size to reflect.call more than 1GB"))
504 //go:nowritebarrierrec
505 func badmorestackg0() {
506 writeErrStr("fatal: morestack on g0\n")
510 //go:nowritebarrierrec
511 func badmorestackgsignal() {
512 writeErrStr("fatal: morestack on gsignal\n")
520 func lockedOSThread() bool {
522 return gp.lockedm != 0 && gp.m.lockedg != 0
526 // allgs contains all Gs ever created (including dead Gs), and thus
529 // Access via the slice is protected by allglock or stop-the-world.
530 // Readers that cannot take the lock may (carefully!) use the atomic
535 // allglen and allgptr are atomic variables that contain len(allgs) and
536 // &allgs[0] respectively. Proper ordering depends on totally-ordered
537 // loads and stores. Writes are protected by allglock.
539 // allgptr is updated before allglen. Readers should read allglen
540 // before allgptr to ensure that allglen is always <= len(allgptr). New
541 // Gs appended during the race can be missed. For a consistent view of
542 // all Gs, allglock must be held.
544 // allgptr copies should always be stored as a concrete type or
545 // unsafe.Pointer, not uintptr, to ensure that GC can still reach it
546 // even if it points to a stale array.
551 func allgadd(gp *g) {
552 if readgstatus(gp) == _Gidle {
553 throw("allgadd: bad status Gidle")
557 allgs = append(allgs, gp)
558 if &allgs[0] != allgptr {
559 atomicstorep(unsafe.Pointer(&allgptr), unsafe.Pointer(&allgs[0]))
561 atomic.Storeuintptr(&allglen, uintptr(len(allgs)))
565 // allGsSnapshot returns a snapshot of the slice of all Gs.
567 // The world must be stopped or allglock must be held.
568 func allGsSnapshot() []*g {
569 assertWorldStoppedOrLockHeld(&allglock)
571 // Because the world is stopped or allglock is held, allgadd
572 // cannot happen concurrently with this. allgs grows
573 // monotonically and existing entries never change, so we can
574 // simply return a copy of the slice header. For added safety,
575 // we trim everything past len because that can still change.
576 return allgs[:len(allgs):len(allgs)]
579 // atomicAllG returns &allgs[0] and len(allgs) for use with atomicAllGIndex.
580 func atomicAllG() (**g, uintptr) {
581 length := atomic.Loaduintptr(&allglen)
582 ptr := (**g)(atomic.Loadp(unsafe.Pointer(&allgptr)))
586 // atomicAllGIndex returns ptr[i] with the allgptr returned from atomicAllG.
587 func atomicAllGIndex(ptr **g, i uintptr) *g {
588 return *(**g)(add(unsafe.Pointer(ptr), i*goarch.PtrSize))
591 // forEachG calls fn on every G from allgs.
593 // forEachG takes a lock to exclude concurrent addition of new Gs.
594 func forEachG(fn func(gp *g)) {
596 for _, gp := range allgs {
602 // forEachGRace calls fn on every G from allgs.
604 // forEachGRace avoids locking, but does not exclude addition of new Gs during
605 // execution, which may be missed.
606 func forEachGRace(fn func(gp *g)) {
607 ptr, length := atomicAllG()
608 for i := uintptr(0); i < length; i++ {
609 gp := atomicAllGIndex(ptr, i)
616 // Number of goroutine ids to grab from sched.goidgen to local per-P cache at once.
617 // 16 seems to provide enough amortization, but other than that it's mostly arbitrary number.
621 // cpuinit sets up CPU feature flags and calls internal/cpu.Initialize. env should be the complete
622 // value of the GODEBUG environment variable.
623 func cpuinit(env string) {
625 case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
626 cpu.DebugOptions = true
630 // Support cpu feature variables are used in code generated by the compiler
631 // to guard execution of instructions that can not be assumed to be always supported.
634 x86HasPOPCNT = cpu.X86.HasPOPCNT
635 x86HasSSE41 = cpu.X86.HasSSE41
636 x86HasFMA = cpu.X86.HasFMA
639 armHasVFPv4 = cpu.ARM.HasVFPv4
642 arm64HasATOMICS = cpu.ARM64.HasATOMICS
646 // getGodebugEarly extracts the environment variable GODEBUG from the environment on
647 // Unix-like operating systems and returns it. This function exists to extract GODEBUG
648 // early before much of the runtime is initialized.
649 func getGodebugEarly() string {
650 const prefix = "GODEBUG="
653 case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
654 // Similar to goenv_unix but extracts the environment value for
656 // TODO(moehrmann): remove when general goenvs() can be called before cpuinit()
658 for argv_index(argv, argc+1+n) != nil {
662 for i := int32(0); i < n; i++ {
663 p := argv_index(argv, argc+1+i)
664 s := unsafe.String(p, findnull(p))
666 if hasPrefix(s, prefix) {
667 env = gostring(p)[len(prefix):]
675 // The bootstrap sequence is:
679 // make & queue new G
680 // call runtime·mstart
682 // The new G calls runtime·main.
684 lockInit(&sched.lock, lockRankSched)
685 lockInit(&sched.sysmonlock, lockRankSysmon)
686 lockInit(&sched.deferlock, lockRankDefer)
687 lockInit(&sched.sudoglock, lockRankSudog)
688 lockInit(&deadlock, lockRankDeadlock)
689 lockInit(&paniclk, lockRankPanic)
690 lockInit(&allglock, lockRankAllg)
691 lockInit(&allpLock, lockRankAllp)
692 lockInit(&reflectOffs.lock, lockRankReflectOffs)
693 lockInit(&finlock, lockRankFin)
694 lockInit(&trace.bufLock, lockRankTraceBuf)
695 lockInit(&trace.stringsLock, lockRankTraceStrings)
696 lockInit(&trace.lock, lockRankTrace)
697 lockInit(&cpuprof.lock, lockRankCpuprof)
698 lockInit(&trace.stackTab.lock, lockRankTraceStackTab)
699 // Enforce that this lock is always a leaf lock.
700 // All of this lock's critical sections should be
702 lockInit(&memstats.heapStats.noPLock, lockRankLeafRank)
704 // raceinit must be the first call to race detector.
705 // In particular, it must be done before mallocinit below calls racemapshadow.
708 gp.racectx, raceprocctx0 = raceinit()
711 sched.maxmcount = 10000
713 // The world starts stopped.
719 godebug := getGodebugEarly()
720 initPageTrace(godebug) // must run after mallocinit but before anything allocates
721 cpuinit(godebug) // must run before alginit
722 alginit() // maps, hash, fastrand must not be used before this call
723 fastrandinit() // must run before mcommoninit
724 mcommoninit(gp.m, -1)
725 modulesinit() // provides activeModules
726 typelinksinit() // uses maps, activeModules
727 itabsinit() // uses activeModules
728 stkobjinit() // must run before GC starts
730 sigsave(&gp.m.sigmask)
731 initSigmask = gp.m.sigmask
738 // if disableMemoryProfiling is set, update MemProfileRate to 0 to turn off memprofile.
739 // Note: parsedebugvars may update MemProfileRate, but when disableMemoryProfiling is
740 // set to true by the linker, it means that nothing is consuming the profile, it is
741 // safe to set MemProfileRate to 0.
742 if disableMemoryProfiling {
747 sched.lastpoll.Store(nanotime())
749 if n, ok := atoi32(gogetenv("GOMAXPROCS")); ok && n > 0 {
752 if procresize(procs) != nil {
753 throw("unknown runnable goroutine during bootstrap")
757 // World is effectively started now, as P's can run.
760 if buildVersion == "" {
761 // Condition should never trigger. This code just serves
762 // to ensure runtime·buildVersion is kept in the resulting binary.
763 buildVersion = "unknown"
765 if len(modinfo) == 1 {
766 // Condition should never trigger. This code just serves
767 // to ensure runtime·modinfo is kept in the resulting binary.
772 func dumpgstatus(gp *g) {
774 print("runtime: gp: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
775 print("runtime: getg: g=", thisg, ", goid=", thisg.goid, ", g->atomicstatus=", readgstatus(thisg), "\n")
778 // sched.lock must be held.
780 assertLockHeld(&sched.lock)
782 // Exclude extra M's, which are used for cgocallback from threads
785 // The purpose of the SetMaxThreads limit is to avoid accidental fork
786 // bomb from something like millions of goroutines blocking on system
787 // calls, causing the runtime to create millions of threads. By
788 // definition, this isn't a problem for threads created in C, so we
789 // exclude them from the limit. See https://go.dev/issue/60004.
790 count := mcount() - int32(extraMInUse.Load()) - int32(extraMLength.Load())
791 if count > sched.maxmcount {
792 print("runtime: program exceeds ", sched.maxmcount, "-thread limit\n")
793 throw("thread exhaustion")
797 // mReserveID returns the next ID to use for a new m. This new m is immediately
798 // considered 'running' by checkdead.
800 // sched.lock must be held.
801 func mReserveID() int64 {
802 assertLockHeld(&sched.lock)
804 if sched.mnext+1 < sched.mnext {
805 throw("runtime: thread ID overflow")
813 // Pre-allocated ID may be passed as 'id', or omitted by passing -1.
814 func mcommoninit(mp *m, id int64) {
817 // g0 stack won't make sense for user (and is not necessary unwindable).
819 callers(1, mp.createstack[:])
830 lo := uint32(int64Hash(uint64(mp.id), fastrandseed))
831 hi := uint32(int64Hash(uint64(cputicks()), ^fastrandseed))
835 // Same behavior as for 1.17.
836 // TODO: Simplify this.
837 if goarch.BigEndian {
838 mp.fastrand = uint64(lo)<<32 | uint64(hi)
840 mp.fastrand = uint64(hi)<<32 | uint64(lo)
844 if mp.gsignal != nil {
845 mp.gsignal.stackguard1 = mp.gsignal.stack.lo + stackGuard
848 // Add to allm so garbage collector doesn't free g->m
849 // when it is just in a register or thread-local storage.
852 // NumCgoCall() iterates over allm w/o schedlock,
853 // so we need to publish it safely.
854 atomicstorep(unsafe.Pointer(&allm), unsafe.Pointer(mp))
857 // Allocate memory to hold a cgo traceback if the cgo call crashes.
858 if iscgo || GOOS == "solaris" || GOOS == "illumos" || GOOS == "windows" {
859 mp.cgoCallers = new(cgoCallers)
863 func (mp *m) becomeSpinning() {
865 sched.nmspinning.Add(1)
866 sched.needspinning.Store(0)
869 func (mp *m) hasCgoOnStack() bool {
870 return mp.ncgo > 0 || mp.isextra
873 var fastrandseed uintptr
875 func fastrandinit() {
876 s := (*[unsafe.Sizeof(fastrandseed)]byte)(unsafe.Pointer(&fastrandseed))[:]
880 // Mark gp ready to run.
881 func ready(gp *g, traceskip int, next bool) {
883 traceGoUnpark(gp, traceskip)
886 status := readgstatus(gp)
889 mp := acquirem() // disable preemption because it can be holding p in a local var
890 if status&^_Gscan != _Gwaiting {
892 throw("bad g->status in ready")
895 // status is Gwaiting or Gscanwaiting, make Grunnable and put on runq
896 casgstatus(gp, _Gwaiting, _Grunnable)
897 runqput(mp.p.ptr(), gp, next)
902 // freezeStopWait is a large value that freezetheworld sets
903 // sched.stopwait to in order to request that all Gs permanently stop.
904 const freezeStopWait = 0x7fffffff
906 // freezing is set to non-zero if the runtime is trying to freeze the
908 var freezing atomic.Bool
910 // Similar to stopTheWorld but best-effort and can be called several times.
911 // There is no reverse operation, used during crashing.
912 // This function must not lock any mutexes.
913 func freezetheworld() {
915 // stopwait and preemption requests can be lost
916 // due to races with concurrently executing threads,
917 // so try several times
918 for i := 0; i < 5; i++ {
919 // this should tell the scheduler to not start any new goroutines
920 sched.stopwait = freezeStopWait
921 sched.gcwaiting.Store(true)
922 // this should stop running goroutines
924 break // no running goroutines
934 // All reads and writes of g's status go through readgstatus, casgstatus
935 // castogscanstatus, casfrom_Gscanstatus.
938 func readgstatus(gp *g) uint32 {
939 return gp.atomicstatus.Load()
942 // The Gscanstatuses are acting like locks and this releases them.
943 // If it proves to be a performance hit we should be able to make these
944 // simple atomic stores but for now we are going to throw if
945 // we see an inconsistent state.
946 func casfrom_Gscanstatus(gp *g, oldval, newval uint32) {
949 // Check that transition is valid.
952 print("runtime: casfrom_Gscanstatus bad oldval gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
954 throw("casfrom_Gscanstatus:top gp->status is not in scan state")
960 if newval == oldval&^_Gscan {
961 success = gp.atomicstatus.CompareAndSwap(oldval, newval)
965 print("runtime: casfrom_Gscanstatus failed gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
967 throw("casfrom_Gscanstatus: gp->status is not in scan state")
969 releaseLockRank(lockRankGscan)
972 // This will return false if the gp is not in the expected status and the cas fails.
973 // This acts like a lock acquire while the casfromgstatus acts like a lock release.
974 func castogscanstatus(gp *g, oldval, newval uint32) bool {
980 if newval == oldval|_Gscan {
981 r := gp.atomicstatus.CompareAndSwap(oldval, newval)
983 acquireLockRank(lockRankGscan)
989 print("runtime: castogscanstatus oldval=", hex(oldval), " newval=", hex(newval), "\n")
990 throw("castogscanstatus")
994 // casgstatusAlwaysTrack is a debug flag that causes casgstatus to always track
995 // various latencies on every transition instead of sampling them.
996 var casgstatusAlwaysTrack = false
998 // If asked to move to or from a Gscanstatus this will throw. Use the castogscanstatus
999 // and casfrom_Gscanstatus instead.
1000 // casgstatus will loop if the g->atomicstatus is in a Gscan status until the routine that
1001 // put it in the Gscan state is finished.
1004 func casgstatus(gp *g, oldval, newval uint32) {
1005 if (oldval&_Gscan != 0) || (newval&_Gscan != 0) || oldval == newval {
1006 systemstack(func() {
1007 print("runtime: casgstatus: oldval=", hex(oldval), " newval=", hex(newval), "\n")
1008 throw("casgstatus: bad incoming values")
1012 acquireLockRank(lockRankGscan)
1013 releaseLockRank(lockRankGscan)
1015 // See https://golang.org/cl/21503 for justification of the yield delay.
1016 const yieldDelay = 5 * 1000
1019 // loop if gp->atomicstatus is in a scan state giving
1020 // GC time to finish and change the state to oldval.
1021 for i := 0; !gp.atomicstatus.CompareAndSwap(oldval, newval); i++ {
1022 if oldval == _Gwaiting && gp.atomicstatus.Load() == _Grunnable {
1023 throw("casgstatus: waiting for Gwaiting but is Grunnable")
1026 nextYield = nanotime() + yieldDelay
1028 if nanotime() < nextYield {
1029 for x := 0; x < 10 && gp.atomicstatus.Load() != oldval; x++ {
1034 nextYield = nanotime() + yieldDelay/2
1038 if oldval == _Grunning {
1039 // Track every gTrackingPeriod time a goroutine transitions out of running.
1040 if casgstatusAlwaysTrack || gp.trackingSeq%gTrackingPeriod == 0 {
1049 // Handle various kinds of tracking.
1052 // - Time spent in runnable.
1053 // - Time spent blocked on a sync.Mutex or sync.RWMutex.
1056 // We transitioned out of runnable, so measure how much
1057 // time we spent in this state and add it to
1060 gp.runnableTime += now - gp.trackingStamp
1061 gp.trackingStamp = 0
1063 if !gp.waitreason.isMutexWait() {
1064 // Not blocking on a lock.
1067 // Blocking on a lock, measure it. Note that because we're
1068 // sampling, we have to multiply by our sampling period to get
1069 // a more representative estimate of the absolute value.
1070 // gTrackingPeriod also represents an accurate sampling period
1071 // because we can only enter this state from _Grunning.
1073 sched.totalMutexWaitTime.Add((now - gp.trackingStamp) * gTrackingPeriod)
1074 gp.trackingStamp = 0
1078 if !gp.waitreason.isMutexWait() {
1079 // Not blocking on a lock.
1082 // Blocking on a lock. Write down the timestamp.
1084 gp.trackingStamp = now
1086 // We just transitioned into runnable, so record what
1087 // time that happened.
1089 gp.trackingStamp = now
1091 // We're transitioning into running, so turn off
1092 // tracking and record how much time we spent in
1095 sched.timeToRun.record(gp.runnableTime)
1100 // casGToWaiting transitions gp from old to _Gwaiting, and sets the wait reason.
1102 // Use this over casgstatus when possible to ensure that a waitreason is set.
1103 func casGToWaiting(gp *g, old uint32, reason waitReason) {
1104 // Set the wait reason before calling casgstatus, because casgstatus will use it.
1105 gp.waitreason = reason
1106 casgstatus(gp, old, _Gwaiting)
1109 // casgstatus(gp, oldstatus, Gcopystack), assuming oldstatus is Gwaiting or Grunnable.
1110 // Returns old status. Cannot call casgstatus directly, because we are racing with an
1111 // async wakeup that might come in from netpoll. If we see Gwaiting from the readgstatus,
1112 // it might have become Grunnable by the time we get to the cas. If we called casgstatus,
1113 // it would loop waiting for the status to go back to Gwaiting, which it never will.
1116 func casgcopystack(gp *g) uint32 {
1118 oldstatus := readgstatus(gp) &^ _Gscan
1119 if oldstatus != _Gwaiting && oldstatus != _Grunnable {
1120 throw("copystack: bad status, not Gwaiting or Grunnable")
1122 if gp.atomicstatus.CompareAndSwap(oldstatus, _Gcopystack) {
1128 // casGToPreemptScan transitions gp from _Grunning to _Gscan|_Gpreempted.
1130 // TODO(austin): This is the only status operation that both changes
1131 // the status and locks the _Gscan bit. Rethink this.
1132 func casGToPreemptScan(gp *g, old, new uint32) {
1133 if old != _Grunning || new != _Gscan|_Gpreempted {
1134 throw("bad g transition")
1136 acquireLockRank(lockRankGscan)
1137 for !gp.atomicstatus.CompareAndSwap(_Grunning, _Gscan|_Gpreempted) {
1141 // casGFromPreempted attempts to transition gp from _Gpreempted to
1142 // _Gwaiting. If successful, the caller is responsible for
1143 // re-scheduling gp.
1144 func casGFromPreempted(gp *g, old, new uint32) bool {
1145 if old != _Gpreempted || new != _Gwaiting {
1146 throw("bad g transition")
1148 gp.waitreason = waitReasonPreempted
1149 return gp.atomicstatus.CompareAndSwap(_Gpreempted, _Gwaiting)
1152 // stopTheWorld stops all P's from executing goroutines, interrupting
1153 // all goroutines at GC safe points and records reason as the reason
1154 // for the stop. On return, only the current goroutine's P is running.
1155 // stopTheWorld must not be called from a system stack and the caller
1156 // must not hold worldsema. The caller must call startTheWorld when
1157 // other P's should resume execution.
1159 // stopTheWorld is safe for multiple goroutines to call at the
1160 // same time. Each will execute its own stop, and the stops will
1163 // This is also used by routines that do stack dumps. If the system is
1164 // in panic or being exited, this may not reliably stop all
1166 func stopTheWorld(reason string) {
1167 semacquire(&worldsema)
1169 gp.m.preemptoff = reason
1170 systemstack(func() {
1171 // Mark the goroutine which called stopTheWorld preemptible so its
1172 // stack may be scanned.
1173 // This lets a mark worker scan us while we try to stop the world
1174 // since otherwise we could get in a mutual preemption deadlock.
1175 // We must not modify anything on the G stack because a stack shrink
1176 // may occur. A stack shrink is otherwise OK though because in order
1177 // to return from this function (and to leave the system stack) we
1178 // must have preempted all goroutines, including any attempting
1179 // to scan our stack, in which case, any stack shrinking will
1180 // have already completed by the time we exit.
1181 // Don't provide a wait reason because we're still executing.
1182 casGToWaiting(gp, _Grunning, waitReasonStoppingTheWorld)
1183 stopTheWorldWithSema()
1184 casgstatus(gp, _Gwaiting, _Grunning)
1188 // startTheWorld undoes the effects of stopTheWorld.
1189 func startTheWorld() {
1190 systemstack(func() { startTheWorldWithSema(false) })
1192 // worldsema must be held over startTheWorldWithSema to ensure
1193 // gomaxprocs cannot change while worldsema is held.
1195 // Release worldsema with direct handoff to the next waiter, but
1196 // acquirem so that semrelease1 doesn't try to yield our time.
1198 // Otherwise if e.g. ReadMemStats is being called in a loop,
1199 // it might stomp on other attempts to stop the world, such as
1200 // for starting or ending GC. The operation this blocks is
1201 // so heavy-weight that we should just try to be as fair as
1204 // We don't want to just allow us to get preempted between now
1205 // and releasing the semaphore because then we keep everyone
1206 // (including, for example, GCs) waiting longer.
1209 semrelease1(&worldsema, true, 0)
1213 // stopTheWorldGC has the same effect as stopTheWorld, but blocks
1214 // until the GC is not running. It also blocks a GC from starting
1215 // until startTheWorldGC is called.
1216 func stopTheWorldGC(reason string) {
1218 stopTheWorld(reason)
1221 // startTheWorldGC undoes the effects of stopTheWorldGC.
1222 func startTheWorldGC() {
1227 // Holding worldsema grants an M the right to try to stop the world.
1228 var worldsema uint32 = 1
1230 // Holding gcsema grants the M the right to block a GC, and blocks
1231 // until the current GC is done. In particular, it prevents gomaxprocs
1232 // from changing concurrently.
1234 // TODO(mknyszek): Once gomaxprocs and the execution tracer can handle
1235 // being changed/enabled during a GC, remove this.
1236 var gcsema uint32 = 1
1238 // stopTheWorldWithSema is the core implementation of stopTheWorld.
1239 // The caller is responsible for acquiring worldsema and disabling
1240 // preemption first and then should stopTheWorldWithSema on the system
1243 // semacquire(&worldsema, 0)
1244 // m.preemptoff = "reason"
1245 // systemstack(stopTheWorldWithSema)
1247 // When finished, the caller must either call startTheWorld or undo
1248 // these three operations separately:
1250 // m.preemptoff = ""
1251 // systemstack(startTheWorldWithSema)
1252 // semrelease(&worldsema)
1254 // It is allowed to acquire worldsema once and then execute multiple
1255 // startTheWorldWithSema/stopTheWorldWithSema pairs.
1256 // Other P's are able to execute between successive calls to
1257 // startTheWorldWithSema and stopTheWorldWithSema.
1258 // Holding worldsema causes any other goroutines invoking
1259 // stopTheWorld to block.
1260 func stopTheWorldWithSema() {
1263 // If we hold a lock, then we won't be able to stop another M
1264 // that is blocked trying to acquire the lock.
1266 throw("stopTheWorld: holding locks")
1270 sched.stopwait = gomaxprocs
1271 sched.gcwaiting.Store(true)
1274 gp.m.p.ptr().status = _Pgcstop // Pgcstop is only diagnostic.
1276 // try to retake all P's in Psyscall status
1277 for _, pp := range allp {
1279 if s == _Psyscall && atomic.Cas(&pp.status, s, _Pgcstop) {
1291 pp, _ := pidleget(now)
1295 pp.status = _Pgcstop
1298 wait := sched.stopwait > 0
1301 // wait for remaining P's to stop voluntarily
1304 // wait for 100us, then try to re-preempt in case of any races
1305 if notetsleep(&sched.stopnote, 100*1000) {
1306 noteclear(&sched.stopnote)
1315 if sched.stopwait != 0 {
1316 bad = "stopTheWorld: not stopped (stopwait != 0)"
1318 for _, pp := range allp {
1319 if pp.status != _Pgcstop {
1320 bad = "stopTheWorld: not stopped (status != _Pgcstop)"
1324 if freezing.Load() {
1325 // Some other thread is panicking. This can cause the
1326 // sanity checks above to fail if the panic happens in
1327 // the signal handler on a stopped thread. Either way,
1328 // we should halt this thread.
1339 func startTheWorldWithSema(emitTraceEvent bool) int64 {
1340 assertWorldStopped()
1342 mp := acquirem() // disable preemption because it can be holding p in a local var
1343 if netpollinited() {
1344 list := netpoll(0) // non-blocking
1354 p1 := procresize(procs)
1355 sched.gcwaiting.Store(false)
1356 if sched.sysmonwait.Load() {
1357 sched.sysmonwait.Store(false)
1358 notewakeup(&sched.sysmonnote)
1371 throw("startTheWorld: inconsistent mp->nextp")
1374 notewakeup(&mp.park)
1376 // Start M to run P. Do not start another M below.
1381 // Capture start-the-world time before doing clean-up tasks.
1382 startTime := nanotime()
1387 // Wakeup an additional proc in case we have excessive runnable goroutines
1388 // in local queues or in the global queue. If we don't, the proc will park itself.
1389 // If we have lots of excessive work, resetspinning will unpark additional procs as necessary.
1397 // usesLibcall indicates whether this runtime performs system calls
1399 func usesLibcall() bool {
1401 case "aix", "darwin", "illumos", "ios", "solaris", "windows":
1404 return GOARCH == "386" || GOARCH == "amd64" || GOARCH == "arm" || GOARCH == "arm64"
1409 // mStackIsSystemAllocated indicates whether this runtime starts on a
1410 // system-allocated stack.
1411 func mStackIsSystemAllocated() bool {
1413 case "aix", "darwin", "plan9", "illumos", "ios", "solaris", "windows":
1417 case "386", "amd64", "arm", "arm64":
1424 // mstart is the entry-point for new Ms.
1425 // It is written in assembly, uses ABI0, is marked TOPFRAME, and calls mstart0.
1428 // mstart0 is the Go entry-point for new Ms.
1429 // This must not split the stack because we may not even have stack
1430 // bounds set up yet.
1432 // May run during STW (because it doesn't have a P yet), so write
1433 // barriers are not allowed.
1436 //go:nowritebarrierrec
1440 osStack := gp.stack.lo == 0
1442 // Initialize stack bounds from system stack.
1443 // Cgo may have left stack size in stack.hi.
1444 // minit may update the stack bounds.
1446 // Note: these bounds may not be very accurate.
1447 // We set hi to &size, but there are things above
1448 // it. The 1024 is supposed to compensate this,
1449 // but is somewhat arbitrary.
1452 size = 8192 * sys.StackGuardMultiplier
1454 gp.stack.hi = uintptr(noescape(unsafe.Pointer(&size)))
1455 gp.stack.lo = gp.stack.hi - size + 1024
1457 // Initialize stack guard so that we can start calling regular
1459 gp.stackguard0 = gp.stack.lo + stackGuard
1460 // This is the g0, so we can also call go:systemstack
1461 // functions, which check stackguard1.
1462 gp.stackguard1 = gp.stackguard0
1465 // Exit this thread.
1466 if mStackIsSystemAllocated() {
1467 // Windows, Solaris, illumos, Darwin, AIX and Plan 9 always system-allocate
1468 // the stack, but put it in gp.stack before mstart,
1469 // so the logic above hasn't set osStack yet.
1475 // The go:noinline is to guarantee the getcallerpc/getcallersp below are safe,
1476 // so that we can set up g0.sched to return to the call of mstart1 above.
1483 throw("bad runtime·mstart")
1486 // Set up m.g0.sched as a label returning to just
1487 // after the mstart1 call in mstart0 above, for use by goexit0 and mcall.
1488 // We're never coming back to mstart1 after we call schedule,
1489 // so other calls can reuse the current frame.
1490 // And goexit0 does a gogo that needs to return from mstart1
1491 // and let mstart0 exit the thread.
1492 gp.sched.g = guintptr(unsafe.Pointer(gp))
1493 gp.sched.pc = getcallerpc()
1494 gp.sched.sp = getcallersp()
1499 // Install signal handlers; after minit so that minit can
1500 // prepare the thread to be able to handle the signals.
1505 if fn := gp.m.mstartfn; fn != nil {
1510 acquirep(gp.m.nextp.ptr())
1516 // mstartm0 implements part of mstart1 that only runs on the m0.
1518 // Write barriers are allowed here because we know the GC can't be
1519 // running yet, so they'll be no-ops.
1521 //go:yeswritebarrierrec
1523 // Create an extra M for callbacks on threads not created by Go.
1524 // An extra M is also needed on Windows for callbacks created by
1525 // syscall.NewCallback. See issue #6751 for details.
1526 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1533 // mPark causes a thread to park itself, returning once woken.
1538 notesleep(&gp.m.park)
1539 noteclear(&gp.m.park)
1542 // mexit tears down and exits the current thread.
1544 // Don't call this directly to exit the thread, since it must run at
1545 // the top of the thread stack. Instead, use gogo(&gp.m.g0.sched) to
1546 // unwind the stack to the point that exits the thread.
1548 // It is entered with m.p != nil, so write barriers are allowed. It
1549 // will release the P before exiting.
1551 //go:yeswritebarrierrec
1552 func mexit(osStack bool) {
1556 // This is the main thread. Just wedge it.
1558 // On Linux, exiting the main thread puts the process
1559 // into a non-waitable zombie state. On Plan 9,
1560 // exiting the main thread unblocks wait even though
1561 // other threads are still running. On Solaris we can
1562 // neither exitThread nor return from mstart. Other
1563 // bad things probably happen on other platforms.
1565 // We could try to clean up this M more before wedging
1566 // it, but that complicates signal handling.
1567 handoffp(releasep())
1573 throw("locked m0 woke up")
1579 // Free the gsignal stack.
1580 if mp.gsignal != nil {
1581 stackfree(mp.gsignal.stack)
1582 // On some platforms, when calling into VDSO (e.g. nanotime)
1583 // we store our g on the gsignal stack, if there is one.
1584 // Now the stack is freed, unlink it from the m, so we
1585 // won't write to it when calling VDSO code.
1589 // Remove m from allm.
1591 for pprev := &allm; *pprev != nil; pprev = &(*pprev).alllink {
1597 throw("m not found in allm")
1599 // Delay reaping m until it's done with the stack.
1601 // Put mp on the free list, though it will not be reaped while freeWait
1602 // is freeMWait. mp is no longer reachable via allm, so even if it is
1603 // on an OS stack, we must keep a reference to mp alive so that the GC
1604 // doesn't free mp while we are still using it.
1606 // Note that the free list must not be linked through alllink because
1607 // some functions walk allm without locking, so may be using alllink.
1608 mp.freeWait.Store(freeMWait)
1609 mp.freelink = sched.freem
1613 atomic.Xadd64(&ncgocall, int64(mp.ncgocall))
1616 handoffp(releasep())
1617 // After this point we must not have write barriers.
1619 // Invoke the deadlock detector. This must happen after
1620 // handoffp because it may have started a new M to take our
1627 if GOOS == "darwin" || GOOS == "ios" {
1628 // Make sure pendingPreemptSignals is correct when an M exits.
1630 if mp.signalPending.Load() != 0 {
1631 pendingPreemptSignals.Add(-1)
1635 // Destroy all allocated resources. After this is called, we may no
1636 // longer take any locks.
1640 // No more uses of mp, so it is safe to drop the reference.
1641 mp.freeWait.Store(freeMRef)
1643 // Return from mstart and let the system thread
1644 // library free the g0 stack and terminate the thread.
1648 // mstart is the thread's entry point, so there's nothing to
1649 // return to. Exit the thread directly. exitThread will clear
1650 // m.freeWait when it's done with the stack and the m can be
1652 exitThread(&mp.freeWait)
1655 // forEachP calls fn(p) for every P p when p reaches a GC safe point.
1656 // If a P is currently executing code, this will bring the P to a GC
1657 // safe point and execute fn on that P. If the P is not executing code
1658 // (it is idle or in a syscall), this will call fn(p) directly while
1659 // preventing the P from exiting its state. This does not ensure that
1660 // fn will run on every CPU executing Go code, but it acts as a global
1661 // memory barrier. GC uses this as a "ragged barrier."
1663 // The caller must hold worldsema.
1666 func forEachP(fn func(*p)) {
1668 pp := getg().m.p.ptr()
1671 if sched.safePointWait != 0 {
1672 throw("forEachP: sched.safePointWait != 0")
1674 sched.safePointWait = gomaxprocs - 1
1675 sched.safePointFn = fn
1677 // Ask all Ps to run the safe point function.
1678 for _, p2 := range allp {
1680 atomic.Store(&p2.runSafePointFn, 1)
1685 // Any P entering _Pidle or _Psyscall from now on will observe
1686 // p.runSafePointFn == 1 and will call runSafePointFn when
1687 // changing its status to _Pidle/_Psyscall.
1689 // Run safe point function for all idle Ps. sched.pidle will
1690 // not change because we hold sched.lock.
1691 for p := sched.pidle.ptr(); p != nil; p = p.link.ptr() {
1692 if atomic.Cas(&p.runSafePointFn, 1, 0) {
1694 sched.safePointWait--
1698 wait := sched.safePointWait > 0
1701 // Run fn for the current P.
1704 // Force Ps currently in _Psyscall into _Pidle and hand them
1705 // off to induce safe point function execution.
1706 for _, p2 := range allp {
1708 if s == _Psyscall && p2.runSafePointFn == 1 && atomic.Cas(&p2.status, s, _Pidle) {
1718 // Wait for remaining Ps to run fn.
1721 // Wait for 100us, then try to re-preempt in
1722 // case of any races.
1724 // Requires system stack.
1725 if notetsleep(&sched.safePointNote, 100*1000) {
1726 noteclear(&sched.safePointNote)
1732 if sched.safePointWait != 0 {
1733 throw("forEachP: not done")
1735 for _, p2 := range allp {
1736 if p2.runSafePointFn != 0 {
1737 throw("forEachP: P did not run fn")
1742 sched.safePointFn = nil
1747 // runSafePointFn runs the safe point function, if any, for this P.
1748 // This should be called like
1750 // if getg().m.p.runSafePointFn != 0 {
1754 // runSafePointFn must be checked on any transition in to _Pidle or
1755 // _Psyscall to avoid a race where forEachP sees that the P is running
1756 // just before the P goes into _Pidle/_Psyscall and neither forEachP
1757 // nor the P run the safe-point function.
1758 func runSafePointFn() {
1759 p := getg().m.p.ptr()
1760 // Resolve the race between forEachP running the safe-point
1761 // function on this P's behalf and this P running the
1762 // safe-point function directly.
1763 if !atomic.Cas(&p.runSafePointFn, 1, 0) {
1766 sched.safePointFn(p)
1768 sched.safePointWait--
1769 if sched.safePointWait == 0 {
1770 notewakeup(&sched.safePointNote)
1775 // When running with cgo, we call _cgo_thread_start
1776 // to start threads for us so that we can play nicely with
1778 var cgoThreadStart unsafe.Pointer
1780 type cgothreadstart struct {
1786 // Allocate a new m unassociated with any thread.
1787 // Can use p for allocation context if needed.
1788 // fn is recorded as the new m's m.mstartfn.
1789 // id is optional pre-allocated m ID. Omit by passing -1.
1791 // This function is allowed to have write barriers even if the caller
1792 // isn't because it borrows pp.
1794 //go:yeswritebarrierrec
1795 func allocm(pp *p, fn func(), id int64) *m {
1798 // The caller owns pp, but we may borrow (i.e., acquirep) it. We must
1799 // disable preemption to ensure it is not stolen, which would make the
1800 // caller lose ownership.
1805 acquirep(pp) // temporarily borrow p for mallocs in this function
1808 // Release the free M list. We need to do this somewhere and
1809 // this may free up a stack we can use.
1810 if sched.freem != nil {
1813 for freem := sched.freem; freem != nil; {
1814 wait := freem.freeWait.Load()
1815 if wait == freeMWait {
1816 next := freem.freelink
1817 freem.freelink = newList
1822 // Free the stack if needed. For freeMRef, there is
1823 // nothing to do except drop freem from the sched.freem
1825 if wait == freeMStack {
1826 // stackfree must be on the system stack, but allocm is
1827 // reachable off the system stack transitively from
1829 systemstack(func() {
1830 stackfree(freem.g0.stack)
1833 freem = freem.freelink
1835 sched.freem = newList
1843 // In case of cgo or Solaris or illumos or Darwin, pthread_create will make us a stack.
1844 // Windows and Plan 9 will layout sched stack on OS stack.
1845 if iscgo || mStackIsSystemAllocated() {
1848 mp.g0 = malg(8192 * sys.StackGuardMultiplier)
1852 if pp == gp.m.p.ptr() {
1857 allocmLock.runlock()
1861 // needm is called when a cgo callback happens on a
1862 // thread without an m (a thread not created by Go).
1863 // In this case, needm is expected to find an m to use
1864 // and return with m, g initialized correctly.
1865 // Since m and g are not set now (likely nil, but see below)
1866 // needm is limited in what routines it can call. In particular
1867 // it can only call nosplit functions (textflag 7) and cannot
1868 // do any scheduling that requires an m.
1870 // In order to avoid needing heavy lifting here, we adopt
1871 // the following strategy: there is a stack of available m's
1872 // that can be stolen. Using compare-and-swap
1873 // to pop from the stack has ABA races, so we simulate
1874 // a lock by doing an exchange (via Casuintptr) to steal the stack
1875 // head and replace the top pointer with MLOCKED (1).
1876 // This serves as a simple spin lock that we can use even
1877 // without an m. The thread that locks the stack in this way
1878 // unlocks the stack by storing a valid stack head pointer.
1880 // In order to make sure that there is always an m structure
1881 // available to be stolen, we maintain the invariant that there
1882 // is always one more than needed. At the beginning of the
1883 // program (if cgo is in use) the list is seeded with a single m.
1884 // If needm finds that it has taken the last m off the list, its job
1885 // is - once it has installed its own m so that it can do things like
1886 // allocate memory - to create a spare m and put it on the list.
1888 // Each of these extra m's also has a g0 and a curg that are
1889 // pressed into service as the scheduling stack and current
1890 // goroutine for the duration of the cgo callback.
1892 // When the callback is done with the m, it calls dropm to
1893 // put the m back on the list.
1897 if (iscgo || GOOS == "windows") && !cgoHasExtraM {
1898 // Can happen if C/C++ code calls Go from a global ctor.
1899 // Can also happen on Windows if a global ctor uses a
1900 // callback created by syscall.NewCallback. See issue #6751
1903 // Can not throw, because scheduler is not initialized yet.
1904 writeErrStr("fatal error: cgo callback before cgo call\n")
1908 // Save and block signals before getting an M.
1909 // The signal handler may call needm itself,
1910 // and we must avoid a deadlock. Also, once g is installed,
1911 // any incoming signals will try to execute,
1912 // but we won't have the sigaltstack settings and other data
1913 // set up appropriately until the end of minit, which will
1914 // unblock the signals. This is the same dance as when
1915 // starting a new m to run Go code via newosproc.
1920 // nilokay=false is safe here because of the invariant above,
1921 // that the extra list always contains or will soon contain
1923 mp, last := getExtraM(false)
1925 // Set needextram when we've just emptied the list,
1926 // so that the eventual call into cgocallbackg will
1927 // allocate a new m for the extra list. We delay the
1928 // allocation until then so that it can be done
1929 // after exitsyscall makes sure it is okay to be
1930 // running at all (that is, there's no garbage collection
1931 // running right now).
1932 mp.needextram = last
1934 // Store the original signal mask for use by minit.
1935 mp.sigmask = sigmask
1937 // Install TLS on some platforms (previously setg
1938 // would do this if necessary).
1941 // Install g (= m->g0) and set the stack bounds
1942 // to match the current stack. We don't actually know
1943 // how big the stack is, like we don't know how big any
1944 // scheduling stack is, but we assume there's at least 32 kB,
1945 // which is more than enough for us.
1948 gp.stack.hi = getcallersp() + 1024
1949 gp.stack.lo = getcallersp() - 32*1024
1950 gp.stackguard0 = gp.stack.lo + stackGuard
1952 // Initialize this thread to use the m.
1956 // mp.curg is now a real goroutine.
1957 casgstatus(mp.curg, _Gdead, _Gsyscall)
1961 // newextram allocates m's and puts them on the extra list.
1962 // It is called with a working local m, so that it can do things
1963 // like call schedlock and allocate.
1965 c := extraMWaiters.Swap(0)
1967 for i := uint32(0); i < c; i++ {
1970 } else if extraMLength.Load() == 0 {
1971 // Make sure there is at least one extra M.
1976 // oneNewExtraM allocates an m and puts it on the extra list.
1977 func oneNewExtraM() {
1978 // Create extra goroutine locked to extra m.
1979 // The goroutine is the context in which the cgo callback will run.
1980 // The sched.pc will never be returned to, but setting it to
1981 // goexit makes clear to the traceback routines where
1982 // the goroutine stack ends.
1983 mp := allocm(nil, nil, -1)
1985 gp.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum
1986 gp.sched.sp = gp.stack.hi
1987 gp.sched.sp -= 4 * goarch.PtrSize // extra space in case of reads slightly beyond frame
1989 gp.sched.g = guintptr(unsafe.Pointer(gp))
1990 gp.syscallpc = gp.sched.pc
1991 gp.syscallsp = gp.sched.sp
1992 gp.stktopsp = gp.sched.sp
1993 // malg returns status as _Gidle. Change to _Gdead before
1994 // adding to allg where GC can see it. We use _Gdead to hide
1995 // this from tracebacks and stack scans since it isn't a
1996 // "real" goroutine until needm grabs it.
1997 casgstatus(gp, _Gidle, _Gdead)
2004 gp.goid = sched.goidgen.Add(1)
2005 gp.sysblocktraced = true
2007 gp.racectx = racegostart(abi.FuncPCABIInternal(newextram) + sys.PCQuantum)
2010 // Trigger two trace events for the locked g in the extra m,
2011 // since the next event of the g will be traceEvGoSysExit in exitsyscall,
2012 // while calling from C thread to Go.
2013 traceGoCreate(gp, 0) // no start pc
2015 traceEvent(traceEvGoInSyscall, -1, gp.goid)
2017 // put on allg for garbage collector
2020 // gp is now on the allg list, but we don't want it to be
2021 // counted by gcount. It would be more "proper" to increment
2022 // sched.ngfree, but that requires locking. Incrementing ngsys
2023 // has the same effect.
2026 // Add m to the extra list.
2030 // dropm is called when a cgo callback has called needm but is now
2031 // done with the callback and returning back into the non-Go thread.
2032 // It puts the current m back onto the extra list.
2034 // The main expense here is the call to signalstack to release the
2035 // m's signal stack, and then the call to needm on the next callback
2036 // from this thread. It is tempting to try to save the m for next time,
2037 // which would eliminate both these costs, but there might not be
2038 // a next time: the current thread (which Go does not control) might exit.
2039 // If we saved the m for that thread, there would be an m leak each time
2040 // such a thread exited. Instead, we acquire and release an m on each
2041 // call. These should typically not be scheduling operations, just a few
2042 // atomics, so the cost should be small.
2044 // TODO(rsc): An alternative would be to allocate a dummy pthread per-thread
2045 // variable using pthread_key_create. Unlike the pthread keys we already use
2046 // on OS X, this dummy key would never be read by Go code. It would exist
2047 // only so that we could register at thread-exit-time destructor.
2048 // That destructor would put the m back onto the extra list.
2049 // This is purely a performance optimization. The current version,
2050 // in which dropm happens on each cgo call, is still correct too.
2051 // We may have to keep the current version on systems with cgo
2052 // but without pthreads, like Windows.
2054 // Clear m and g, and return m to the extra list.
2055 // After the call to setg we can only call nosplit functions
2056 // with no pointer manipulation.
2059 // Return mp.curg to dead state.
2060 casgstatus(mp.curg, _Gsyscall, _Gdead)
2061 mp.curg.preemptStop = false
2064 // Block signals before unminit.
2065 // Unminit unregisters the signal handling stack (but needs g on some systems).
2066 // Setg(nil) clears g, which is the signal handler's cue not to run Go handlers.
2067 // It's important not to try to handle a signal between those two steps.
2068 sigmask := mp.sigmask
2076 msigrestore(sigmask)
2079 // A helper function for EnsureDropM.
2080 func getm() uintptr {
2081 return uintptr(unsafe.Pointer(getg().m))
2085 // Locking linked list of extra M's, via mp.schedlink. Must be accessed
2086 // only via lockextra/unlockextra.
2088 // Can't be atomic.Pointer[m] because we use an invalid pointer as a
2089 // "locked" sentinel value. M's on this list remain visible to the GC
2090 // because their mp.curg is on allgs.
2091 extraM atomic.Uintptr
2092 // Number of M's in the extraM list.
2093 extraMLength atomic.Uint32
2094 // Number of waiters in lockextra.
2095 extraMWaiters atomic.Uint32
2097 // Number of extra M's in use by threads.
2098 extraMInUse atomic.Uint32
2101 // lockextra locks the extra list and returns the list head.
2102 // The caller must unlock the list by storing a new list head
2103 // to extram. If nilokay is true, then lockextra will
2104 // return a nil list head if that's what it finds. If nilokay is false,
2105 // lockextra will keep waiting until the list head is no longer nil.
2108 func lockextra(nilokay bool) *m {
2113 old := extraM.Load()
2118 if old == 0 && !nilokay {
2120 // Add 1 to the number of threads
2121 // waiting for an M.
2122 // This is cleared by newextram.
2123 extraMWaiters.Add(1)
2129 if extraM.CompareAndSwap(old, locked) {
2131 return (*m)(unsafe.Pointer(old))
2139 func unlockextra(mp *m, delta int32) {
2140 extraMLength.Add(delta)
2141 extraM.Store(uintptr(unsafe.Pointer(mp)))
2144 // Return an M from the extra M list. Returns last == true if the list becomes
2145 // empty because of this call.
2148 func getExtraM(nilokay bool) (mp *m, last bool) {
2149 mp = lockextra(nilokay)
2154 unlockextra(mp.schedlink.ptr(), -1)
2155 return mp, mp.schedlink.ptr() == nil
2158 // Returns an extra M back to the list. mp must be from getExtraM. Newly
2159 // allocated M's should use addExtraM.
2162 func putExtraM(mp *m) {
2167 // Adds a newly allocated M to the extra M list.
2170 func addExtraM(mp *m) {
2171 mnext := lockextra(true)
2172 mp.schedlink.set(mnext)
2177 // allocmLock is locked for read when creating new Ms in allocm and their
2178 // addition to allm. Thus acquiring this lock for write blocks the
2179 // creation of new Ms.
2182 // execLock serializes exec and clone to avoid bugs or unspecified
2183 // behaviour around exec'ing while creating/destroying threads. See
2188 // These errors are reported (via writeErrStr) by some OS-specific
2189 // versions of newosproc and newosproc0.
2191 failthreadcreate = "runtime: failed to create new OS thread\n"
2192 failallocatestack = "runtime: failed to allocate stack for the new OS thread\n"
2195 // newmHandoff contains a list of m structures that need new OS threads.
2196 // This is used by newm in situations where newm itself can't safely
2197 // start an OS thread.
2198 var newmHandoff struct {
2201 // newm points to a list of M structures that need new OS
2202 // threads. The list is linked through m.schedlink.
2205 // waiting indicates that wake needs to be notified when an m
2206 // is put on the list.
2210 // haveTemplateThread indicates that the templateThread has
2211 // been started. This is not protected by lock. Use cas to set
2213 haveTemplateThread uint32
2216 // Create a new m. It will start off with a call to fn, or else the scheduler.
2217 // fn needs to be static and not a heap allocated closure.
2218 // May run with m.p==nil, so write barriers are not allowed.
2220 // id is optional pre-allocated m ID. Omit by passing -1.
2222 //go:nowritebarrierrec
2223 func newm(fn func(), pp *p, id int64) {
2224 // allocm adds a new M to allm, but they do not start until created by
2225 // the OS in newm1 or the template thread.
2227 // doAllThreadsSyscall requires that every M in allm will eventually
2228 // start and be signal-able, even with a STW.
2230 // Disable preemption here until we start the thread to ensure that
2231 // newm is not preempted between allocm and starting the new thread,
2232 // ensuring that anything added to allm is guaranteed to eventually
2236 mp := allocm(pp, fn, id)
2238 mp.sigmask = initSigmask
2239 if gp := getg(); gp != nil && gp.m != nil && (gp.m.lockedExt != 0 || gp.m.incgo) && GOOS != "plan9" {
2240 // We're on a locked M or a thread that may have been
2241 // started by C. The kernel state of this thread may
2242 // be strange (the user may have locked it for that
2243 // purpose). We don't want to clone that into another
2244 // thread. Instead, ask a known-good thread to create
2245 // the thread for us.
2247 // This is disabled on Plan 9. See golang.org/issue/22227.
2249 // TODO: This may be unnecessary on Windows, which
2250 // doesn't model thread creation off fork.
2251 lock(&newmHandoff.lock)
2252 if newmHandoff.haveTemplateThread == 0 {
2253 throw("on a locked thread with no template thread")
2255 mp.schedlink = newmHandoff.newm
2256 newmHandoff.newm.set(mp)
2257 if newmHandoff.waiting {
2258 newmHandoff.waiting = false
2259 notewakeup(&newmHandoff.wake)
2261 unlock(&newmHandoff.lock)
2262 // The M has not started yet, but the template thread does not
2263 // participate in STW, so it will always process queued Ms and
2264 // it is safe to releasem.
2274 var ts cgothreadstart
2275 if _cgo_thread_start == nil {
2276 throw("_cgo_thread_start missing")
2279 ts.tls = (*uint64)(unsafe.Pointer(&mp.tls[0]))
2280 ts.fn = unsafe.Pointer(abi.FuncPCABI0(mstart))
2282 msanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2285 asanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
2287 execLock.rlock() // Prevent process clone.
2288 asmcgocall(_cgo_thread_start, unsafe.Pointer(&ts))
2292 execLock.rlock() // Prevent process clone.
2297 // startTemplateThread starts the template thread if it is not already
2300 // The calling thread must itself be in a known-good state.
2301 func startTemplateThread() {
2302 if GOARCH == "wasm" { // no threads on wasm yet
2306 // Disable preemption to guarantee that the template thread will be
2307 // created before a park once haveTemplateThread is set.
2309 if !atomic.Cas(&newmHandoff.haveTemplateThread, 0, 1) {
2313 newm(templateThread, nil, -1)
2317 // templateThread is a thread in a known-good state that exists solely
2318 // to start new threads in known-good states when the calling thread
2319 // may not be in a good state.
2321 // Many programs never need this, so templateThread is started lazily
2322 // when we first enter a state that might lead to running on a thread
2323 // in an unknown state.
2325 // templateThread runs on an M without a P, so it must not have write
2328 //go:nowritebarrierrec
2329 func templateThread() {
2336 lock(&newmHandoff.lock)
2337 for newmHandoff.newm != 0 {
2338 newm := newmHandoff.newm.ptr()
2339 newmHandoff.newm = 0
2340 unlock(&newmHandoff.lock)
2342 next := newm.schedlink.ptr()
2347 lock(&newmHandoff.lock)
2349 newmHandoff.waiting = true
2350 noteclear(&newmHandoff.wake)
2351 unlock(&newmHandoff.lock)
2352 notesleep(&newmHandoff.wake)
2356 // Stops execution of the current m until new work is available.
2357 // Returns with acquired P.
2361 if gp.m.locks != 0 {
2362 throw("stopm holding locks")
2365 throw("stopm holding p")
2368 throw("stopm spinning")
2375 acquirep(gp.m.nextp.ptr())
2380 // startm's caller incremented nmspinning. Set the new M's spinning.
2381 getg().m.spinning = true
2384 // Schedules some M to run the p (creates an M if necessary).
2385 // If p==nil, tries to get an idle P, if no idle P's does nothing.
2386 // May run with m.p==nil, so write barriers are not allowed.
2387 // If spinning is set, the caller has incremented nmspinning and must provide a
2388 // P. startm will set m.spinning in the newly started M.
2390 // Callers passing a non-nil P must call from a non-preemptible context. See
2391 // comment on acquirem below.
2393 // Argument lockheld indicates whether the caller already acquired the
2394 // scheduler lock. Callers holding the lock when making the call must pass
2395 // true. The lock might be temporarily dropped, but will be reacquired before
2398 // Must not have write barriers because this may be called without a P.
2400 //go:nowritebarrierrec
2401 func startm(pp *p, spinning, lockheld bool) {
2402 // Disable preemption.
2404 // Every owned P must have an owner that will eventually stop it in the
2405 // event of a GC stop request. startm takes transient ownership of a P
2406 // (either from argument or pidleget below) and transfers ownership to
2407 // a started M, which will be responsible for performing the stop.
2409 // Preemption must be disabled during this transient ownership,
2410 // otherwise the P this is running on may enter GC stop while still
2411 // holding the transient P, leaving that P in limbo and deadlocking the
2414 // Callers passing a non-nil P must already be in non-preemptible
2415 // context, otherwise such preemption could occur on function entry to
2416 // startm. Callers passing a nil P may be preemptible, so we must
2417 // disable preemption before acquiring a P from pidleget below.
2424 // TODO(prattmic): All remaining calls to this function
2425 // with _p_ == nil could be cleaned up to find a P
2426 // before calling startm.
2427 throw("startm: P required for spinning=true")
2440 // No M is available, we must drop sched.lock and call newm.
2441 // However, we already own a P to assign to the M.
2443 // Once sched.lock is released, another G (e.g., in a syscall),
2444 // could find no idle P while checkdead finds a runnable G but
2445 // no running M's because this new M hasn't started yet, thus
2446 // throwing in an apparent deadlock.
2447 // This apparent deadlock is possible when startm is called
2448 // from sysmon, which doesn't count as a running M.
2450 // Avoid this situation by pre-allocating the ID for the new M,
2451 // thus marking it as 'running' before we drop sched.lock. This
2452 // new M will eventually run the scheduler to execute any
2459 // The caller incremented nmspinning, so set m.spinning in the new M.
2467 // Ownership transfer of pp committed by start in newm.
2468 // Preemption is now safe.
2476 throw("startm: m is spinning")
2479 throw("startm: m has p")
2481 if spinning && !runqempty(pp) {
2482 throw("startm: p has runnable gs")
2484 // The caller incremented nmspinning, so set m.spinning in the new M.
2485 nmp.spinning = spinning
2487 notewakeup(&nmp.park)
2488 // Ownership transfer of pp committed by wakeup. Preemption is now
2493 // Hands off P from syscall or locked M.
2494 // Always runs without a P, so write barriers are not allowed.
2496 //go:nowritebarrierrec
2497 func handoffp(pp *p) {
2498 // handoffp must start an M in any situation where
2499 // findrunnable would return a G to run on pp.
2501 // if it has local work, start it straight away
2502 if !runqempty(pp) || sched.runqsize != 0 {
2503 startm(pp, false, false)
2506 // if there's trace work to do, start it straight away
2507 if (trace.enabled || trace.shutdown) && traceReaderAvailable() != nil {
2508 startm(pp, false, false)
2511 // if it has GC work, start it straight away
2512 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) {
2513 startm(pp, false, false)
2516 // no local work, check that there are no spinning/idle M's,
2517 // otherwise our help is not required
2518 if sched.nmspinning.Load()+sched.npidle.Load() == 0 && sched.nmspinning.CompareAndSwap(0, 1) { // TODO: fast atomic
2519 sched.needspinning.Store(0)
2520 startm(pp, true, false)
2524 if sched.gcwaiting.Load() {
2525 pp.status = _Pgcstop
2527 if sched.stopwait == 0 {
2528 notewakeup(&sched.stopnote)
2533 if pp.runSafePointFn != 0 && atomic.Cas(&pp.runSafePointFn, 1, 0) {
2534 sched.safePointFn(pp)
2535 sched.safePointWait--
2536 if sched.safePointWait == 0 {
2537 notewakeup(&sched.safePointNote)
2540 if sched.runqsize != 0 {
2542 startm(pp, false, false)
2545 // If this is the last running P and nobody is polling network,
2546 // need to wakeup another M to poll network.
2547 if sched.npidle.Load() == gomaxprocs-1 && sched.lastpoll.Load() != 0 {
2549 startm(pp, false, false)
2553 // The scheduler lock cannot be held when calling wakeNetPoller below
2554 // because wakeNetPoller may call wakep which may call startm.
2555 when := nobarrierWakeTime(pp)
2564 // Tries to add one more P to execute G's.
2565 // Called when a G is made runnable (newproc, ready).
2566 // Must be called with a P.
2568 // Be conservative about spinning threads, only start one if none exist
2570 if sched.nmspinning.Load() != 0 || !sched.nmspinning.CompareAndSwap(0, 1) {
2574 // Disable preemption until ownership of pp transfers to the next M in
2575 // startm. Otherwise preemption here would leave pp stuck waiting to
2578 // See preemption comment on acquirem in startm for more details.
2583 pp, _ = pidlegetSpinning(0)
2585 if sched.nmspinning.Add(-1) < 0 {
2586 throw("wakep: negative nmspinning")
2592 // Since we always have a P, the race in the "No M is available"
2593 // comment in startm doesn't apply during the small window between the
2594 // unlock here and lock in startm. A checkdead in between will always
2595 // see at least one running M (ours).
2598 startm(pp, true, false)
2603 // Stops execution of the current m that is locked to a g until the g is runnable again.
2604 // Returns with acquired P.
2605 func stoplockedm() {
2608 if gp.m.lockedg == 0 || gp.m.lockedg.ptr().lockedm.ptr() != gp.m {
2609 throw("stoplockedm: inconsistent locking")
2612 // Schedule another M to run this p.
2617 // Wait until another thread schedules lockedg again.
2619 status := readgstatus(gp.m.lockedg.ptr())
2620 if status&^_Gscan != _Grunnable {
2621 print("runtime:stoplockedm: lockedg (atomicstatus=", status, ") is not Grunnable or Gscanrunnable\n")
2622 dumpgstatus(gp.m.lockedg.ptr())
2623 throw("stoplockedm: not runnable")
2625 acquirep(gp.m.nextp.ptr())
2629 // Schedules the locked m to run the locked gp.
2630 // May run during STW, so write barriers are not allowed.
2632 //go:nowritebarrierrec
2633 func startlockedm(gp *g) {
2634 mp := gp.lockedm.ptr()
2636 throw("startlockedm: locked to me")
2639 throw("startlockedm: m has p")
2641 // directly handoff current P to the locked m
2645 notewakeup(&mp.park)
2649 // Stops the current m for stopTheWorld.
2650 // Returns when the world is restarted.
2654 if !sched.gcwaiting.Load() {
2655 throw("gcstopm: not waiting for gc")
2658 gp.m.spinning = false
2659 // OK to just drop nmspinning here,
2660 // startTheWorld will unpark threads as necessary.
2661 if sched.nmspinning.Add(-1) < 0 {
2662 throw("gcstopm: negative nmspinning")
2667 pp.status = _Pgcstop
2669 if sched.stopwait == 0 {
2670 notewakeup(&sched.stopnote)
2676 // Schedules gp to run on the current M.
2677 // If inheritTime is true, gp inherits the remaining time in the
2678 // current time slice. Otherwise, it starts a new time slice.
2681 // Write barriers are allowed because this is called immediately after
2682 // acquiring a P in several places.
2684 //go:yeswritebarrierrec
2685 func execute(gp *g, inheritTime bool) {
2688 if goroutineProfile.active {
2689 // Make sure that gp has had its stack written out to the goroutine
2690 // profile, exactly as it was when the goroutine profiler first stopped
2692 tryRecordGoroutineProfile(gp, osyield)
2695 // Assign gp.m before entering _Grunning so running Gs have an
2699 casgstatus(gp, _Grunnable, _Grunning)
2702 gp.stackguard0 = gp.stack.lo + stackGuard
2704 mp.p.ptr().schedtick++
2707 // Check whether the profiler needs to be turned on or off.
2708 hz := sched.profilehz
2709 if mp.profilehz != hz {
2710 setThreadCPUProfiler(hz)
2714 // GoSysExit has to happen when we have a P, but before GoStart.
2715 // So we emit it here.
2716 if gp.syscallsp != 0 && gp.sysblocktraced {
2717 traceGoSysExit(gp.sysexitticks)
2725 // Finds a runnable goroutine to execute.
2726 // Tries to steal from other P's, get g from local or global queue, poll network.
2727 // tryWakeP indicates that the returned goroutine is not normal (GC worker, trace
2728 // reader) so the caller should try to wake a P.
2729 func findRunnable() (gp *g, inheritTime, tryWakeP bool) {
2732 // The conditions here and in handoffp must agree: if
2733 // findrunnable would return a G to run, handoffp must start
2738 if sched.gcwaiting.Load() {
2742 if pp.runSafePointFn != 0 {
2746 // now and pollUntil are saved for work stealing later,
2747 // which may steal timers. It's important that between now
2748 // and then, nothing blocks, so these numbers remain mostly
2750 now, pollUntil, _ := checkTimers(pp, 0)
2752 // Try to schedule the trace reader.
2753 if trace.enabled || trace.shutdown {
2756 casgstatus(gp, _Gwaiting, _Grunnable)
2757 traceGoUnpark(gp, 0)
2758 return gp, false, true
2762 // Try to schedule a GC worker.
2763 if gcBlackenEnabled != 0 {
2764 gp, tnow := gcController.findRunnableGCWorker(pp, now)
2766 return gp, false, true
2771 // Check the global runnable queue once in a while to ensure fairness.
2772 // Otherwise two goroutines can completely occupy the local runqueue
2773 // by constantly respawning each other.
2774 if pp.schedtick%61 == 0 && sched.runqsize > 0 {
2776 gp := globrunqget(pp, 1)
2779 return gp, false, false
2783 // Wake up the finalizer G.
2784 if fingStatus.Load()&(fingWait|fingWake) == fingWait|fingWake {
2785 if gp := wakefing(); gp != nil {
2789 if *cgo_yield != nil {
2790 asmcgocall(*cgo_yield, nil)
2794 if gp, inheritTime := runqget(pp); gp != nil {
2795 return gp, inheritTime, false
2799 if sched.runqsize != 0 {
2801 gp := globrunqget(pp, 0)
2804 return gp, false, false
2809 // This netpoll is only an optimization before we resort to stealing.
2810 // We can safely skip it if there are no waiters or a thread is blocked
2811 // in netpoll already. If there is any kind of logical race with that
2812 // blocked thread (e.g. it has already returned from netpoll, but does
2813 // not set lastpoll yet), this thread will do blocking netpoll below
2815 if netpollinited() && netpollWaiters.Load() > 0 && sched.lastpoll.Load() != 0 {
2816 if list := netpoll(0); !list.empty() { // non-blocking
2819 casgstatus(gp, _Gwaiting, _Grunnable)
2821 traceGoUnpark(gp, 0)
2823 return gp, false, false
2827 // Spinning Ms: steal work from other Ps.
2829 // Limit the number of spinning Ms to half the number of busy Ps.
2830 // This is necessary to prevent excessive CPU consumption when
2831 // GOMAXPROCS>>1 but the program parallelism is low.
2832 if mp.spinning || 2*sched.nmspinning.Load() < gomaxprocs-sched.npidle.Load() {
2837 gp, inheritTime, tnow, w, newWork := stealWork(now)
2839 // Successfully stole.
2840 return gp, inheritTime, false
2843 // There may be new timer or GC work; restart to
2849 if w != 0 && (pollUntil == 0 || w < pollUntil) {
2850 // Earlier timer to wait for.
2855 // We have nothing to do.
2857 // If we're in the GC mark phase, can safely scan and blacken objects,
2858 // and have work to do, run idle-time marking rather than give up the P.
2859 if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) && gcController.addIdleMarkWorker() {
2860 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
2862 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
2864 casgstatus(gp, _Gwaiting, _Grunnable)
2866 traceGoUnpark(gp, 0)
2868 return gp, false, false
2870 gcController.removeIdleMarkWorker()
2874 // If a callback returned and no other goroutine is awake,
2875 // then wake event handler goroutine which pauses execution
2876 // until a callback was triggered.
2877 gp, otherReady := beforeIdle(now, pollUntil)
2879 casgstatus(gp, _Gwaiting, _Grunnable)
2881 traceGoUnpark(gp, 0)
2883 return gp, false, false
2889 // Before we drop our P, make a snapshot of the allp slice,
2890 // which can change underfoot once we no longer block
2891 // safe-points. We don't need to snapshot the contents because
2892 // everything up to cap(allp) is immutable.
2893 allpSnapshot := allp
2894 // Also snapshot masks. Value changes are OK, but we can't allow
2895 // len to change out from under us.
2896 idlepMaskSnapshot := idlepMask
2897 timerpMaskSnapshot := timerpMask
2899 // return P and block
2901 if sched.gcwaiting.Load() || pp.runSafePointFn != 0 {
2905 if sched.runqsize != 0 {
2906 gp := globrunqget(pp, 0)
2908 return gp, false, false
2910 if !mp.spinning && sched.needspinning.Load() == 1 {
2911 // See "Delicate dance" comment below.
2916 if releasep() != pp {
2917 throw("findrunnable: wrong p")
2919 now = pidleput(pp, now)
2922 // Delicate dance: thread transitions from spinning to non-spinning
2923 // state, potentially concurrently with submission of new work. We must
2924 // drop nmspinning first and then check all sources again (with
2925 // #StoreLoad memory barrier in between). If we do it the other way
2926 // around, another thread can submit work after we've checked all
2927 // sources but before we drop nmspinning; as a result nobody will
2928 // unpark a thread to run the work.
2930 // This applies to the following sources of work:
2932 // * Goroutines added to a per-P run queue.
2933 // * New/modified-earlier timers on a per-P timer heap.
2934 // * Idle-priority GC work (barring golang.org/issue/19112).
2936 // If we discover new work below, we need to restore m.spinning as a
2937 // signal for resetspinning to unpark a new worker thread (because
2938 // there can be more than one starving goroutine).
2940 // However, if after discovering new work we also observe no idle Ps
2941 // (either here or in resetspinning), we have a problem. We may be
2942 // racing with a non-spinning M in the block above, having found no
2943 // work and preparing to release its P and park. Allowing that P to go
2944 // idle will result in loss of work conservation (idle P while there is
2945 // runnable work). This could result in complete deadlock in the
2946 // unlikely event that we discover new work (from netpoll) right as we
2947 // are racing with _all_ other Ps going idle.
2949 // We use sched.needspinning to synchronize with non-spinning Ms going
2950 // idle. If needspinning is set when they are about to drop their P,
2951 // they abort the drop and instead become a new spinning M on our
2952 // behalf. If we are not racing and the system is truly fully loaded
2953 // then no spinning threads are required, and the next thread to
2954 // naturally become spinning will clear the flag.
2956 // Also see "Worker thread parking/unparking" comment at the top of the
2958 wasSpinning := mp.spinning
2961 if sched.nmspinning.Add(-1) < 0 {
2962 throw("findrunnable: negative nmspinning")
2965 // Note the for correctness, only the last M transitioning from
2966 // spinning to non-spinning must perform these rechecks to
2967 // ensure no missed work. However, the runtime has some cases
2968 // of transient increments of nmspinning that are decremented
2969 // without going through this path, so we must be conservative
2970 // and perform the check on all spinning Ms.
2972 // See https://go.dev/issue/43997.
2974 // Check all runqueues once again.
2975 pp := checkRunqsNoP(allpSnapshot, idlepMaskSnapshot)
2982 // Check for idle-priority GC work again.
2983 pp, gp := checkIdleGCNoP()
2988 // Run the idle worker.
2989 pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
2990 casgstatus(gp, _Gwaiting, _Grunnable)
2992 traceGoUnpark(gp, 0)
2994 return gp, false, false
2997 // Finally, check for timer creation or expiry concurrently with
2998 // transitioning from spinning to non-spinning.
3000 // Note that we cannot use checkTimers here because it calls
3001 // adjusttimers which may need to allocate memory, and that isn't
3002 // allowed when we don't have an active P.
3003 pollUntil = checkTimersNoP(allpSnapshot, timerpMaskSnapshot, pollUntil)
3006 // Poll network until next timer.
3007 if netpollinited() && (netpollWaiters.Load() > 0 || pollUntil != 0) && sched.lastpoll.Swap(0) != 0 {
3008 sched.pollUntil.Store(pollUntil)
3010 throw("findrunnable: netpoll with p")
3013 throw("findrunnable: netpoll with spinning")
3019 delay = pollUntil - now
3025 // When using fake time, just poll.
3028 list := netpoll(delay) // block until new work is available
3029 sched.pollUntil.Store(0)
3030 sched.lastpoll.Store(now)
3031 if faketime != 0 && list.empty() {
3032 // Using fake time and nothing is ready; stop M.
3033 // When all M's stop, checkdead will call timejump.
3038 pp, _ := pidleget(now)
3047 casgstatus(gp, _Gwaiting, _Grunnable)
3049 traceGoUnpark(gp, 0)
3051 return gp, false, false
3058 } else if pollUntil != 0 && netpollinited() {
3059 pollerPollUntil := sched.pollUntil.Load()
3060 if pollerPollUntil == 0 || pollerPollUntil > pollUntil {
3068 // pollWork reports whether there is non-background work this P could
3069 // be doing. This is a fairly lightweight check to be used for
3070 // background work loops, like idle GC. It checks a subset of the
3071 // conditions checked by the actual scheduler.
3072 func pollWork() bool {
3073 if sched.runqsize != 0 {
3076 p := getg().m.p.ptr()
3080 if netpollinited() && netpollWaiters.Load() > 0 && sched.lastpoll.Load() != 0 {
3081 if list := netpoll(0); !list.empty() {
3089 // stealWork attempts to steal a runnable goroutine or timer from any P.
3091 // If newWork is true, new work may have been readied.
3093 // If now is not 0 it is the current time. stealWork returns the passed time or
3094 // the current time if now was passed as 0.
3095 func stealWork(now int64) (gp *g, inheritTime bool, rnow, pollUntil int64, newWork bool) {
3096 pp := getg().m.p.ptr()
3100 const stealTries = 4
3101 for i := 0; i < stealTries; i++ {
3102 stealTimersOrRunNextG := i == stealTries-1
3104 for enum := stealOrder.start(fastrand()); !enum.done(); enum.next() {
3105 if sched.gcwaiting.Load() {
3106 // GC work may be available.
3107 return nil, false, now, pollUntil, true
3109 p2 := allp[enum.position()]
3114 // Steal timers from p2. This call to checkTimers is the only place
3115 // where we might hold a lock on a different P's timers. We do this
3116 // once on the last pass before checking runnext because stealing
3117 // from the other P's runnext should be the last resort, so if there
3118 // are timers to steal do that first.
3120 // We only check timers on one of the stealing iterations because
3121 // the time stored in now doesn't change in this loop and checking
3122 // the timers for each P more than once with the same value of now
3123 // is probably a waste of time.
3125 // timerpMask tells us whether the P may have timers at all. If it
3126 // can't, no need to check at all.
3127 if stealTimersOrRunNextG && timerpMask.read(enum.position()) {
3128 tnow, w, ran := checkTimers(p2, now)
3130 if w != 0 && (pollUntil == 0 || w < pollUntil) {
3134 // Running the timers may have
3135 // made an arbitrary number of G's
3136 // ready and added them to this P's
3137 // local run queue. That invalidates
3138 // the assumption of runqsteal
3139 // that it always has room to add
3140 // stolen G's. So check now if there
3141 // is a local G to run.
3142 if gp, inheritTime := runqget(pp); gp != nil {
3143 return gp, inheritTime, now, pollUntil, ranTimer
3149 // Don't bother to attempt to steal if p2 is idle.
3150 if !idlepMask.read(enum.position()) {
3151 if gp := runqsteal(pp, p2, stealTimersOrRunNextG); gp != nil {
3152 return gp, false, now, pollUntil, ranTimer
3158 // No goroutines found to steal. Regardless, running a timer may have
3159 // made some goroutine ready that we missed. Indicate the next timer to
3161 return nil, false, now, pollUntil, ranTimer
3164 // Check all Ps for a runnable G to steal.
3166 // On entry we have no P. If a G is available to steal and a P is available,
3167 // the P is returned which the caller should acquire and attempt to steal the
3169 func checkRunqsNoP(allpSnapshot []*p, idlepMaskSnapshot pMask) *p {
3170 for id, p2 := range allpSnapshot {
3171 if !idlepMaskSnapshot.read(uint32(id)) && !runqempty(p2) {
3173 pp, _ := pidlegetSpinning(0)
3175 // Can't get a P, don't bother checking remaining Ps.
3184 // No work available.
3188 // Check all Ps for a timer expiring sooner than pollUntil.
3190 // Returns updated pollUntil value.
3191 func checkTimersNoP(allpSnapshot []*p, timerpMaskSnapshot pMask, pollUntil int64) int64 {
3192 for id, p2 := range allpSnapshot {
3193 if timerpMaskSnapshot.read(uint32(id)) {
3194 w := nobarrierWakeTime(p2)
3195 if w != 0 && (pollUntil == 0 || w < pollUntil) {
3204 // Check for idle-priority GC, without a P on entry.
3206 // If some GC work, a P, and a worker G are all available, the P and G will be
3207 // returned. The returned P has not been wired yet.
3208 func checkIdleGCNoP() (*p, *g) {
3209 // N.B. Since we have no P, gcBlackenEnabled may change at any time; we
3210 // must check again after acquiring a P. As an optimization, we also check
3211 // if an idle mark worker is needed at all. This is OK here, because if we
3212 // observe that one isn't needed, at least one is currently running. Even if
3213 // it stops running, its own journey into the scheduler should schedule it
3214 // again, if need be (at which point, this check will pass, if relevant).
3215 if atomic.Load(&gcBlackenEnabled) == 0 || !gcController.needIdleMarkWorker() {
3218 if !gcMarkWorkAvailable(nil) {
3222 // Work is available; we can start an idle GC worker only if there is
3223 // an available P and available worker G.
3225 // We can attempt to acquire these in either order, though both have
3226 // synchronization concerns (see below). Workers are almost always
3227 // available (see comment in findRunnableGCWorker for the one case
3228 // there may be none). Since we're slightly less likely to find a P,
3229 // check for that first.
3231 // Synchronization: note that we must hold sched.lock until we are
3232 // committed to keeping it. Otherwise we cannot put the unnecessary P
3233 // back in sched.pidle without performing the full set of idle
3234 // transition checks.
3236 // If we were to check gcBgMarkWorkerPool first, we must somehow handle
3237 // the assumption in gcControllerState.findRunnableGCWorker that an
3238 // empty gcBgMarkWorkerPool is only possible if gcMarkDone is running.
3240 pp, now := pidlegetSpinning(0)
3246 // Now that we own a P, gcBlackenEnabled can't change (as it requires STW).
3247 if gcBlackenEnabled == 0 || !gcController.addIdleMarkWorker() {
3253 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
3257 gcController.removeIdleMarkWorker()
3263 return pp, node.gp.ptr()
3266 // wakeNetPoller wakes up the thread sleeping in the network poller if it isn't
3267 // going to wake up before the when argument; or it wakes an idle P to service
3268 // timers and the network poller if there isn't one already.
3269 func wakeNetPoller(when int64) {
3270 if sched.lastpoll.Load() == 0 {
3271 // In findrunnable we ensure that when polling the pollUntil
3272 // field is either zero or the time to which the current
3273 // poll is expected to run. This can have a spurious wakeup
3274 // but should never miss a wakeup.
3275 pollerPollUntil := sched.pollUntil.Load()
3276 if pollerPollUntil == 0 || pollerPollUntil > when {
3280 // There are no threads in the network poller, try to get
3281 // one there so it can handle new timers.
3282 if GOOS != "plan9" { // Temporary workaround - see issue #42303.
3288 func resetspinning() {
3291 throw("resetspinning: not a spinning m")
3293 gp.m.spinning = false
3294 nmspinning := sched.nmspinning.Add(-1)
3296 throw("findrunnable: negative nmspinning")
3298 // M wakeup policy is deliberately somewhat conservative, so check if we
3299 // need to wakeup another P here. See "Worker thread parking/unparking"
3300 // comment at the top of the file for details.
3304 // injectglist adds each runnable G on the list to some run queue,
3305 // and clears glist. If there is no current P, they are added to the
3306 // global queue, and up to npidle M's are started to run them.
3307 // Otherwise, for each idle P, this adds a G to the global queue
3308 // and starts an M. Any remaining G's are added to the current P's
3310 // This may temporarily acquire sched.lock.
3311 // Can run concurrently with GC.
3312 func injectglist(glist *gList) {
3317 for gp := glist.head.ptr(); gp != nil; gp = gp.schedlink.ptr() {
3318 traceGoUnpark(gp, 0)
3322 // Mark all the goroutines as runnable before we put them
3323 // on the run queues.
3324 head := glist.head.ptr()
3327 for gp := head; gp != nil; gp = gp.schedlink.ptr() {
3330 casgstatus(gp, _Gwaiting, _Grunnable)
3333 // Turn the gList into a gQueue.
3339 startIdle := func(n int) {
3340 for i := 0; i < n; i++ {
3341 mp := acquirem() // See comment in startm.
3344 pp, _ := pidlegetSpinning(0)
3351 startm(pp, false, true)
3357 pp := getg().m.p.ptr()
3360 globrunqputbatch(&q, int32(qsize))
3366 npidle := int(sched.npidle.Load())
3369 for n = 0; n < npidle && !q.empty(); n++ {
3375 globrunqputbatch(&globq, int32(n))
3382 runqputbatch(pp, &q, qsize)
3386 // One round of scheduler: find a runnable goroutine and execute it.
3392 throw("schedule: holding locks")
3395 if mp.lockedg != 0 {
3397 execute(mp.lockedg.ptr(), false) // Never returns.
3400 // We should not schedule away from a g that is executing a cgo call,
3401 // since the cgo call is using the m's g0 stack.
3403 throw("schedule: in cgo")
3410 // Safety check: if we are spinning, the run queue should be empty.
3411 // Check this before calling checkTimers, as that might call
3412 // goready to put a ready goroutine on the local run queue.
3413 if mp.spinning && (pp.runnext != 0 || pp.runqhead != pp.runqtail) {
3414 throw("schedule: spinning with local work")
3417 gp, inheritTime, tryWakeP := findRunnable() // blocks until work is available
3419 // This thread is going to run a goroutine and is not spinning anymore,
3420 // so if it was marked as spinning we need to reset it now and potentially
3421 // start a new spinning M.
3426 if sched.disable.user && !schedEnabled(gp) {
3427 // Scheduling of this goroutine is disabled. Put it on
3428 // the list of pending runnable goroutines for when we
3429 // re-enable user scheduling and look again.
3431 if schedEnabled(gp) {
3432 // Something re-enabled scheduling while we
3433 // were acquiring the lock.
3436 sched.disable.runnable.pushBack(gp)
3443 // If about to schedule a not-normal goroutine (a GCworker or tracereader),
3444 // wake a P if there is one.
3448 if gp.lockedm != 0 {
3449 // Hands off own p to the locked m,
3450 // then blocks waiting for a new p.
3455 execute(gp, inheritTime)
3458 // dropg removes the association between m and the current goroutine m->curg (gp for short).
3459 // Typically a caller sets gp's status away from Grunning and then
3460 // immediately calls dropg to finish the job. The caller is also responsible
3461 // for arranging that gp will be restarted using ready at an
3462 // appropriate time. After calling dropg and arranging for gp to be
3463 // readied later, the caller can do other work but eventually should
3464 // call schedule to restart the scheduling of goroutines on this m.
3468 setMNoWB(&gp.m.curg.m, nil)
3469 setGNoWB(&gp.m.curg, nil)
3472 // checkTimers runs any timers for the P that are ready.
3473 // If now is not 0 it is the current time.
3474 // It returns the passed time or the current time if now was passed as 0.
3475 // and the time when the next timer should run or 0 if there is no next timer,
3476 // and reports whether it ran any timers.
3477 // If the time when the next timer should run is not 0,
3478 // it is always larger than the returned time.
3479 // We pass now in and out to avoid extra calls of nanotime.
3481 //go:yeswritebarrierrec
3482 func checkTimers(pp *p, now int64) (rnow, pollUntil int64, ran bool) {
3483 // If it's not yet time for the first timer, or the first adjusted
3484 // timer, then there is nothing to do.
3485 next := pp.timer0When.Load()
3486 nextAdj := pp.timerModifiedEarliest.Load()
3487 if next == 0 || (nextAdj != 0 && nextAdj < next) {
3492 // No timers to run or adjust.
3493 return now, 0, false
3500 // Next timer is not ready to run, but keep going
3501 // if we would clear deleted timers.
3502 // This corresponds to the condition below where
3503 // we decide whether to call clearDeletedTimers.
3504 if pp != getg().m.p.ptr() || int(pp.deletedTimers.Load()) <= int(pp.numTimers.Load()/4) {
3505 return now, next, false
3509 lock(&pp.timersLock)
3511 if len(pp.timers) > 0 {
3512 adjusttimers(pp, now)
3513 for len(pp.timers) > 0 {
3514 // Note that runtimer may temporarily unlock
3516 if tw := runtimer(pp, now); tw != 0 {
3526 // If this is the local P, and there are a lot of deleted timers,
3527 // clear them out. We only do this for the local P to reduce
3528 // lock contention on timersLock.
3529 if pp == getg().m.p.ptr() && int(pp.deletedTimers.Load()) > len(pp.timers)/4 {
3530 clearDeletedTimers(pp)
3533 unlock(&pp.timersLock)
3535 return now, pollUntil, ran
3538 func parkunlock_c(gp *g, lock unsafe.Pointer) bool {
3539 unlock((*mutex)(lock))
3543 // park continuation on g0.
3544 func park_m(gp *g) {
3548 traceGoPark(mp.waittraceev, mp.waittraceskip)
3551 // N.B. Not using casGToWaiting here because the waitreason is
3552 // set by park_m's caller.
3553 casgstatus(gp, _Grunning, _Gwaiting)
3556 if fn := mp.waitunlockf; fn != nil {
3557 ok := fn(gp, mp.waitlock)
3558 mp.waitunlockf = nil
3562 traceGoUnpark(gp, 2)
3564 casgstatus(gp, _Gwaiting, _Grunnable)
3565 execute(gp, true) // Schedule it back, never returns.
3571 func goschedImpl(gp *g) {
3572 status := readgstatus(gp)
3573 if status&^_Gscan != _Grunning {
3575 throw("bad g status")
3577 casgstatus(gp, _Grunning, _Grunnable)
3586 // Gosched continuation on g0.
3587 func gosched_m(gp *g) {
3594 // goschedguarded is a forbidden-states-avoided version of gosched_m.
3595 func goschedguarded_m(gp *g) {
3597 if !canPreemptM(gp.m) {
3598 gogo(&gp.sched) // never return
3607 func gopreempt_m(gp *g) {
3614 // preemptPark parks gp and puts it in _Gpreempted.
3617 func preemptPark(gp *g) {
3619 traceGoPark(traceEvGoBlock, 0)
3621 status := readgstatus(gp)
3622 if status&^_Gscan != _Grunning {
3624 throw("bad g status")
3627 if gp.asyncSafePoint {
3628 // Double-check that async preemption does not
3629 // happen in SPWRITE assembly functions.
3630 // isAsyncSafePoint must exclude this case.
3631 f := findfunc(gp.sched.pc)
3633 throw("preempt at unknown pc")
3635 if f.flag&abi.FuncFlagSPWrite != 0 {
3636 println("runtime: unexpected SPWRITE function", funcname(f), "in async preempt")
3637 throw("preempt SPWRITE")
3641 // Transition from _Grunning to _Gscan|_Gpreempted. We can't
3642 // be in _Grunning when we dropg because then we'd be running
3643 // without an M, but the moment we're in _Gpreempted,
3644 // something could claim this G before we've fully cleaned it
3645 // up. Hence, we set the scan bit to lock down further
3646 // transitions until we can dropg.
3647 casGToPreemptScan(gp, _Grunning, _Gscan|_Gpreempted)
3649 casfrom_Gscanstatus(gp, _Gscan|_Gpreempted, _Gpreempted)
3653 // goyield is like Gosched, but it:
3654 // - emits a GoPreempt trace event instead of a GoSched trace event
3655 // - puts the current G on the runq of the current P instead of the globrunq
3661 func goyield_m(gp *g) {
3666 casgstatus(gp, _Grunning, _Grunnable)
3668 runqput(pp, gp, false)
3672 // Finishes execution of the current goroutine.
3683 // goexit continuation on g0.
3684 func goexit0(gp *g) {
3688 casgstatus(gp, _Grunning, _Gdead)
3689 gcController.addScannableStack(pp, -int64(gp.stack.hi-gp.stack.lo))
3690 if isSystemGoroutine(gp, false) {
3694 locked := gp.lockedm != 0
3697 gp.preemptStop = false
3698 gp.paniconfault = false
3699 gp._defer = nil // should be true already but just in case.
3700 gp._panic = nil // non-nil for Goexit during panic. points at stack-allocated data.
3702 gp.waitreason = waitReasonZero
3707 if gcBlackenEnabled != 0 && gp.gcAssistBytes > 0 {
3708 // Flush assist credit to the global pool. This gives
3709 // better information to pacing if the application is
3710 // rapidly creating an exiting goroutines.
3711 assistWorkPerByte := gcController.assistWorkPerByte.Load()
3712 scanCredit := int64(assistWorkPerByte * float64(gp.gcAssistBytes))
3713 gcController.bgScanCredit.Add(scanCredit)
3714 gp.gcAssistBytes = 0
3719 if GOARCH == "wasm" { // no threads yet on wasm
3721 schedule() // never returns
3724 if mp.lockedInt != 0 {
3725 print("invalid m->lockedInt = ", mp.lockedInt, "\n")
3726 throw("internal lockOSThread error")
3730 // The goroutine may have locked this thread because
3731 // it put it in an unusual kernel state. Kill it
3732 // rather than returning it to the thread pool.
3734 // Return to mstart, which will release the P and exit
3736 if GOOS != "plan9" { // See golang.org/issue/22227.
3739 // Clear lockedExt on plan9 since we may end up re-using
3747 // save updates getg().sched to refer to pc and sp so that a following
3748 // gogo will restore pc and sp.
3750 // save must not have write barriers because invoking a write barrier
3751 // can clobber getg().sched.
3754 //go:nowritebarrierrec
3755 func save(pc, sp uintptr) {
3758 if gp == gp.m.g0 || gp == gp.m.gsignal {
3759 // m.g0.sched is special and must describe the context
3760 // for exiting the thread. mstart1 writes to it directly.
3761 // m.gsignal.sched should not be used at all.
3762 // This check makes sure save calls do not accidentally
3763 // run in contexts where they'd write to system g's.
3764 throw("save on system g not allowed")
3771 // We need to ensure ctxt is zero, but can't have a write
3772 // barrier here. However, it should always already be zero.
3774 if gp.sched.ctxt != nil {
3779 // The goroutine g is about to enter a system call.
3780 // Record that it's not using the cpu anymore.
3781 // This is called only from the go syscall library and cgocall,
3782 // not from the low-level system calls used by the runtime.
3784 // Entersyscall cannot split the stack: the save must
3785 // make g->sched refer to the caller's stack segment, because
3786 // entersyscall is going to return immediately after.
3788 // Nothing entersyscall calls can split the stack either.
3789 // We cannot safely move the stack during an active call to syscall,
3790 // because we do not know which of the uintptr arguments are
3791 // really pointers (back into the stack).
3792 // In practice, this means that we make the fast path run through
3793 // entersyscall doing no-split things, and the slow path has to use systemstack
3794 // to run bigger things on the system stack.
3796 // reentersyscall is the entry point used by cgo callbacks, where explicitly
3797 // saved SP and PC are restored. This is needed when exitsyscall will be called
3798 // from a function further up in the call stack than the parent, as g->syscallsp
3799 // must always point to a valid stack frame. entersyscall below is the normal
3800 // entry point for syscalls, which obtains the SP and PC from the caller.
3803 // At the start of a syscall we emit traceGoSysCall to capture the stack trace.
3804 // If the syscall does not block, that is it, we do not emit any other events.
3805 // If the syscall blocks (that is, P is retaken), retaker emits traceGoSysBlock;
3806 // when syscall returns we emit traceGoSysExit and when the goroutine starts running
3807 // (potentially instantly, if exitsyscallfast returns true) we emit traceGoStart.
3808 // To ensure that traceGoSysExit is emitted strictly after traceGoSysBlock,
3809 // we remember current value of syscalltick in m (gp.m.syscalltick = gp.m.p.ptr().syscalltick),
3810 // whoever emits traceGoSysBlock increments p.syscalltick afterwards;
3811 // and we wait for the increment before emitting traceGoSysExit.
3812 // Note that the increment is done even if tracing is not enabled,
3813 // because tracing can be enabled in the middle of syscall. We don't want the wait to hang.
3816 func reentersyscall(pc, sp uintptr) {
3819 // Disable preemption because during this function g is in Gsyscall status,
3820 // but can have inconsistent g->sched, do not let GC observe it.
3823 // Entersyscall must not call any function that might split/grow the stack.
3824 // (See details in comment above.)
3825 // Catch calls that might, by replacing the stack guard with something that
3826 // will trip any stack check and leaving a flag to tell newstack to die.
3827 gp.stackguard0 = stackPreempt
3828 gp.throwsplit = true
3830 // Leave SP around for GC and traceback.
3834 casgstatus(gp, _Grunning, _Gsyscall)
3835 if staticLockRanking {
3836 // When doing static lock ranking casgstatus can call
3837 // systemstack which clobbers g.sched.
3840 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3841 systemstack(func() {
3842 print("entersyscall inconsistent ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3843 throw("entersyscall")
3848 systemstack(traceGoSysCall)
3849 // systemstack itself clobbers g.sched.{pc,sp} and we might
3850 // need them later when the G is genuinely blocked in a
3855 if sched.sysmonwait.Load() {
3856 systemstack(entersyscall_sysmon)
3860 if gp.m.p.ptr().runSafePointFn != 0 {
3861 // runSafePointFn may stack split if run on this stack
3862 systemstack(runSafePointFn)
3866 gp.m.syscalltick = gp.m.p.ptr().syscalltick
3867 gp.sysblocktraced = true
3872 atomic.Store(&pp.status, _Psyscall)
3873 if sched.gcwaiting.Load() {
3874 systemstack(entersyscall_gcwait)
3881 // Standard syscall entry used by the go syscall library and normal cgo calls.
3883 // This is exported via linkname to assembly in the syscall package and x/sys.
3886 //go:linkname entersyscall
3887 func entersyscall() {
3888 reentersyscall(getcallerpc(), getcallersp())
3891 func entersyscall_sysmon() {
3893 if sched.sysmonwait.Load() {
3894 sched.sysmonwait.Store(false)
3895 notewakeup(&sched.sysmonnote)
3900 func entersyscall_gcwait() {
3902 pp := gp.m.oldp.ptr()
3905 if sched.stopwait > 0 && atomic.Cas(&pp.status, _Psyscall, _Pgcstop) {
3911 if sched.stopwait--; sched.stopwait == 0 {
3912 notewakeup(&sched.stopnote)
3918 // The same as entersyscall(), but with a hint that the syscall is blocking.
3921 func entersyscallblock() {
3924 gp.m.locks++ // see comment in entersyscall
3925 gp.throwsplit = true
3926 gp.stackguard0 = stackPreempt // see comment in entersyscall
3927 gp.m.syscalltick = gp.m.p.ptr().syscalltick
3928 gp.sysblocktraced = true
3929 gp.m.p.ptr().syscalltick++
3931 // Leave SP around for GC and traceback.
3935 gp.syscallsp = gp.sched.sp
3936 gp.syscallpc = gp.sched.pc
3937 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3941 systemstack(func() {
3942 print("entersyscallblock inconsistent ", hex(sp1), " ", hex(sp2), " ", hex(sp3), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3943 throw("entersyscallblock")
3946 casgstatus(gp, _Grunning, _Gsyscall)
3947 if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
3948 systemstack(func() {
3949 print("entersyscallblock inconsistent ", hex(sp), " ", hex(gp.sched.sp), " ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
3950 throw("entersyscallblock")
3954 systemstack(entersyscallblock_handoff)
3956 // Resave for traceback during blocked call.
3957 save(getcallerpc(), getcallersp())
3962 func entersyscallblock_handoff() {
3965 traceGoSysBlock(getg().m.p.ptr())
3967 handoffp(releasep())
3970 // The goroutine g exited its system call.
3971 // Arrange for it to run on a cpu again.
3972 // This is called only from the go syscall library, not
3973 // from the low-level system calls used by the runtime.
3975 // Write barriers are not allowed because our P may have been stolen.
3977 // This is exported via linkname to assembly in the syscall package.
3980 //go:nowritebarrierrec
3981 //go:linkname exitsyscall
3982 func exitsyscall() {
3985 gp.m.locks++ // see comment in entersyscall
3986 if getcallersp() > gp.syscallsp {
3987 throw("exitsyscall: syscall frame is no longer valid")
3991 oldp := gp.m.oldp.ptr()
3993 if exitsyscallfast(oldp) {
3994 // When exitsyscallfast returns success, we have a P so can now use
3996 if goroutineProfile.active {
3997 // Make sure that gp has had its stack written out to the goroutine
3998 // profile, exactly as it was when the goroutine profiler first
3999 // stopped the world.
4000 systemstack(func() {
4001 tryRecordGoroutineProfileWB(gp)
4005 if oldp != gp.m.p.ptr() || gp.m.syscalltick != gp.m.p.ptr().syscalltick {
4006 systemstack(traceGoStart)
4009 // There's a cpu for us, so we can run.
4010 gp.m.p.ptr().syscalltick++
4011 // We need to cas the status and scan before resuming...
4012 casgstatus(gp, _Gsyscall, _Grunning)
4014 // Garbage collector isn't running (since we are),
4015 // so okay to clear syscallsp.
4019 // restore the preemption request in case we've cleared it in newstack
4020 gp.stackguard0 = stackPreempt
4022 // otherwise restore the real stackGuard, we've spoiled it in entersyscall/entersyscallblock
4023 gp.stackguard0 = gp.stack.lo + stackGuard
4025 gp.throwsplit = false
4027 if sched.disable.user && !schedEnabled(gp) {
4028 // Scheduling of this goroutine is disabled.
4037 // Wait till traceGoSysBlock event is emitted.
4038 // This ensures consistency of the trace (the goroutine is started after it is blocked).
4039 for oldp != nil && oldp.syscalltick == gp.m.syscalltick {
4042 // We can't trace syscall exit right now because we don't have a P.
4043 // Tracing code can invoke write barriers that cannot run without a P.
4044 // So instead we remember the syscall exit time and emit the event
4045 // in execute when we have a P.
4046 gp.sysexitticks = cputicks()
4051 // Call the scheduler.
4054 // Scheduler returned, so we're allowed to run now.
4055 // Delete the syscallsp information that we left for
4056 // the garbage collector during the system call.
4057 // Must wait until now because until gosched returns
4058 // we don't know for sure that the garbage collector
4061 gp.m.p.ptr().syscalltick++
4062 gp.throwsplit = false
4066 func exitsyscallfast(oldp *p) bool {
4069 // Freezetheworld sets stopwait but does not retake P's.
4070 if sched.stopwait == freezeStopWait {
4074 // Try to re-acquire the last P.
4075 if oldp != nil && oldp.status == _Psyscall && atomic.Cas(&oldp.status, _Psyscall, _Pidle) {
4076 // There's a cpu for us, so we can run.
4078 exitsyscallfast_reacquired()
4082 // Try to get any other idle P.
4083 if sched.pidle != 0 {
4085 systemstack(func() {
4086 ok = exitsyscallfast_pidle()
4087 if ok && trace.enabled {
4089 // Wait till traceGoSysBlock event is emitted.
4090 // This ensures consistency of the trace (the goroutine is started after it is blocked).
4091 for oldp.syscalltick == gp.m.syscalltick {
4105 // exitsyscallfast_reacquired is the exitsyscall path on which this G
4106 // has successfully reacquired the P it was running on before the
4110 func exitsyscallfast_reacquired() {
4112 if gp.m.syscalltick != gp.m.p.ptr().syscalltick {
4114 // The p was retaken and then enter into syscall again (since gp.m.syscalltick has changed).
4115 // traceGoSysBlock for this syscall was already emitted,
4116 // but here we effectively retake the p from the new syscall running on the same p.
4117 systemstack(func() {
4118 // Denote blocking of the new syscall.
4119 traceGoSysBlock(gp.m.p.ptr())
4120 // Denote completion of the current syscall.
4124 gp.m.p.ptr().syscalltick++
4128 func exitsyscallfast_pidle() bool {
4130 pp, _ := pidleget(0)
4131 if pp != nil && sched.sysmonwait.Load() {
4132 sched.sysmonwait.Store(false)
4133 notewakeup(&sched.sysmonnote)
4143 // exitsyscall slow path on g0.
4144 // Failed to acquire P, enqueue gp as runnable.
4146 // Called via mcall, so gp is the calling g from this M.
4148 //go:nowritebarrierrec
4149 func exitsyscall0(gp *g) {
4150 casgstatus(gp, _Gsyscall, _Grunnable)
4154 if schedEnabled(gp) {
4161 // Below, we stoplockedm if gp is locked. globrunqput releases
4162 // ownership of gp, so we must check if gp is locked prior to
4163 // committing the release by unlocking sched.lock, otherwise we
4164 // could race with another M transitioning gp from unlocked to
4166 locked = gp.lockedm != 0
4167 } else if sched.sysmonwait.Load() {
4168 sched.sysmonwait.Store(false)
4169 notewakeup(&sched.sysmonnote)
4174 execute(gp, false) // Never returns.
4177 // Wait until another thread schedules gp and so m again.
4179 // N.B. lockedm must be this M, as this g was running on this M
4180 // before entersyscall.
4182 execute(gp, false) // Never returns.
4185 schedule() // Never returns.
4188 // Called from syscall package before fork.
4190 //go:linkname syscall_runtime_BeforeFork syscall.runtime_BeforeFork
4192 func syscall_runtime_BeforeFork() {
4195 // Block signals during a fork, so that the child does not run
4196 // a signal handler before exec if a signal is sent to the process
4197 // group. See issue #18600.
4199 sigsave(&gp.m.sigmask)
4202 // This function is called before fork in syscall package.
4203 // Code between fork and exec must not allocate memory nor even try to grow stack.
4204 // Here we spoil g.stackguard0 to reliably detect any attempts to grow stack.
4205 // runtime_AfterFork will undo this in parent process, but not in child.
4206 gp.stackguard0 = stackFork
4209 // Called from syscall package after fork in parent.
4211 //go:linkname syscall_runtime_AfterFork syscall.runtime_AfterFork
4213 func syscall_runtime_AfterFork() {
4216 // See the comments in beforefork.
4217 gp.stackguard0 = gp.stack.lo + stackGuard
4219 msigrestore(gp.m.sigmask)
4224 // inForkedChild is true while manipulating signals in the child process.
4225 // This is used to avoid calling libc functions in case we are using vfork.
4226 var inForkedChild bool
4228 // Called from syscall package after fork in child.
4229 // It resets non-sigignored signals to the default handler, and
4230 // restores the signal mask in preparation for the exec.
4232 // Because this might be called during a vfork, and therefore may be
4233 // temporarily sharing address space with the parent process, this must
4234 // not change any global variables or calling into C code that may do so.
4236 //go:linkname syscall_runtime_AfterForkInChild syscall.runtime_AfterForkInChild
4238 //go:nowritebarrierrec
4239 func syscall_runtime_AfterForkInChild() {
4240 // It's OK to change the global variable inForkedChild here
4241 // because we are going to change it back. There is no race here,
4242 // because if we are sharing address space with the parent process,
4243 // then the parent process can not be running concurrently.
4244 inForkedChild = true
4246 clearSignalHandlers()
4248 // When we are the child we are the only thread running,
4249 // so we know that nothing else has changed gp.m.sigmask.
4250 msigrestore(getg().m.sigmask)
4252 inForkedChild = false
4255 // pendingPreemptSignals is the number of preemption signals
4256 // that have been sent but not received. This is only used on Darwin.
4258 var pendingPreemptSignals atomic.Int32
4260 // Called from syscall package before Exec.
4262 //go:linkname syscall_runtime_BeforeExec syscall.runtime_BeforeExec
4263 func syscall_runtime_BeforeExec() {
4264 // Prevent thread creation during exec.
4267 // On Darwin, wait for all pending preemption signals to
4268 // be received. See issue #41702.
4269 if GOOS == "darwin" || GOOS == "ios" {
4270 for pendingPreemptSignals.Load() > 0 {
4276 // Called from syscall package after Exec.
4278 //go:linkname syscall_runtime_AfterExec syscall.runtime_AfterExec
4279 func syscall_runtime_AfterExec() {
4283 // Allocate a new g, with a stack big enough for stacksize bytes.
4284 func malg(stacksize int32) *g {
4287 stacksize = round2(stackSystem + stacksize)
4288 systemstack(func() {
4289 newg.stack = stackalloc(uint32(stacksize))
4291 newg.stackguard0 = newg.stack.lo + stackGuard
4292 newg.stackguard1 = ^uintptr(0)
4293 // Clear the bottom word of the stack. We record g
4294 // there on gsignal stack during VDSO on ARM and ARM64.
4295 *(*uintptr)(unsafe.Pointer(newg.stack.lo)) = 0
4300 // Create a new g running fn.
4301 // Put it on the queue of g's waiting to run.
4302 // The compiler turns a go statement into a call to this.
4303 func newproc(fn *funcval) {
4306 systemstack(func() {
4307 newg := newproc1(fn, gp, pc)
4309 pp := getg().m.p.ptr()
4310 runqput(pp, newg, true)
4318 // Create a new g in state _Grunnable, starting at fn. callerpc is the
4319 // address of the go statement that created this. The caller is responsible
4320 // for adding the new g to the scheduler.
4321 func newproc1(fn *funcval, callergp *g, callerpc uintptr) *g {
4323 fatal("go of nil func value")
4326 mp := acquirem() // disable preemption because we hold M and P in local vars.
4330 newg = malg(stackMin)
4331 casgstatus(newg, _Gidle, _Gdead)
4332 allgadd(newg) // publishes with a g->status of Gdead so GC scanner doesn't look at uninitialized stack.
4334 if newg.stack.hi == 0 {
4335 throw("newproc1: newg missing stack")
4338 if readgstatus(newg) != _Gdead {
4339 throw("newproc1: new g is not Gdead")
4342 totalSize := uintptr(4*goarch.PtrSize + sys.MinFrameSize) // extra space in case of reads slightly beyond frame
4343 totalSize = alignUp(totalSize, sys.StackAlign)
4344 sp := newg.stack.hi - totalSize
4348 *(*uintptr)(unsafe.Pointer(sp)) = 0
4350 spArg += sys.MinFrameSize
4353 memclrNoHeapPointers(unsafe.Pointer(&newg.sched), unsafe.Sizeof(newg.sched))
4356 newg.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum // +PCQuantum so that previous instruction is in same function
4357 newg.sched.g = guintptr(unsafe.Pointer(newg))
4358 gostartcallfn(&newg.sched, fn)
4359 newg.parentGoid = callergp.goid
4360 newg.gopc = callerpc
4361 newg.ancestors = saveAncestors(callergp)
4362 newg.startpc = fn.fn
4363 if isSystemGoroutine(newg, false) {
4366 // Only user goroutines inherit pprof labels.
4368 newg.labels = mp.curg.labels
4370 if goroutineProfile.active {
4371 // A concurrent goroutine profile is running. It should include
4372 // exactly the set of goroutines that were alive when the goroutine
4373 // profiler first stopped the world. That does not include newg, so
4374 // mark it as not needing a profile before transitioning it from
4376 newg.goroutineProfiled.Store(goroutineProfileSatisfied)
4379 // Track initial transition?
4380 newg.trackingSeq = uint8(fastrand())
4381 if newg.trackingSeq%gTrackingPeriod == 0 {
4382 newg.tracking = true
4384 casgstatus(newg, _Gdead, _Grunnable)
4385 gcController.addScannableStack(pp, int64(newg.stack.hi-newg.stack.lo))
4387 if pp.goidcache == pp.goidcacheend {
4388 // Sched.goidgen is the last allocated id,
4389 // this batch must be [sched.goidgen+1, sched.goidgen+GoidCacheBatch].
4390 // At startup sched.goidgen=0, so main goroutine receives goid=1.
4391 pp.goidcache = sched.goidgen.Add(_GoidCacheBatch)
4392 pp.goidcache -= _GoidCacheBatch - 1
4393 pp.goidcacheend = pp.goidcache + _GoidCacheBatch
4395 newg.goid = pp.goidcache
4398 newg.racectx = racegostart(callerpc)
4399 if newg.labels != nil {
4400 // See note in proflabel.go on labelSync's role in synchronizing
4401 // with the reads in the signal handler.
4402 racereleasemergeg(newg, unsafe.Pointer(&labelSync))
4406 traceGoCreate(newg, newg.startpc)
4413 // saveAncestors copies previous ancestors of the given caller g and
4414 // includes info for the current caller into a new set of tracebacks for
4415 // a g being created.
4416 func saveAncestors(callergp *g) *[]ancestorInfo {
4417 // Copy all prior info, except for the root goroutine (goid 0).
4418 if debug.tracebackancestors <= 0 || callergp.goid == 0 {
4421 var callerAncestors []ancestorInfo
4422 if callergp.ancestors != nil {
4423 callerAncestors = *callergp.ancestors
4425 n := int32(len(callerAncestors)) + 1
4426 if n > debug.tracebackancestors {
4427 n = debug.tracebackancestors
4429 ancestors := make([]ancestorInfo, n)
4430 copy(ancestors[1:], callerAncestors)
4432 var pcs [tracebackInnerFrames]uintptr
4433 npcs := gcallers(callergp, 0, pcs[:])
4434 ipcs := make([]uintptr, npcs)
4436 ancestors[0] = ancestorInfo{
4438 goid: callergp.goid,
4439 gopc: callergp.gopc,
4442 ancestorsp := new([]ancestorInfo)
4443 *ancestorsp = ancestors
4447 // Put on gfree list.
4448 // If local list is too long, transfer a batch to the global list.
4449 func gfput(pp *p, gp *g) {
4450 if readgstatus(gp) != _Gdead {
4451 throw("gfput: bad status (not Gdead)")
4454 stksize := gp.stack.hi - gp.stack.lo
4456 if stksize != uintptr(startingStackSize) {
4457 // non-standard stack size - free it.
4466 if pp.gFree.n >= 64 {
4472 for pp.gFree.n >= 32 {
4473 gp := pp.gFree.pop()
4475 if gp.stack.lo == 0 {
4482 lock(&sched.gFree.lock)
4483 sched.gFree.noStack.pushAll(noStackQ)
4484 sched.gFree.stack.pushAll(stackQ)
4485 sched.gFree.n += inc
4486 unlock(&sched.gFree.lock)
4490 // Get from gfree list.
4491 // If local list is empty, grab a batch from global list.
4492 func gfget(pp *p) *g {
4494 if pp.gFree.empty() && (!sched.gFree.stack.empty() || !sched.gFree.noStack.empty()) {
4495 lock(&sched.gFree.lock)
4496 // Move a batch of free Gs to the P.
4497 for pp.gFree.n < 32 {
4498 // Prefer Gs with stacks.
4499 gp := sched.gFree.stack.pop()
4501 gp = sched.gFree.noStack.pop()
4510 unlock(&sched.gFree.lock)
4513 gp := pp.gFree.pop()
4518 if gp.stack.lo != 0 && gp.stack.hi-gp.stack.lo != uintptr(startingStackSize) {
4519 // Deallocate old stack. We kept it in gfput because it was the
4520 // right size when the goroutine was put on the free list, but
4521 // the right size has changed since then.
4522 systemstack(func() {
4529 if gp.stack.lo == 0 {
4530 // Stack was deallocated in gfput or just above. Allocate a new one.
4531 systemstack(func() {
4532 gp.stack = stackalloc(startingStackSize)
4534 gp.stackguard0 = gp.stack.lo + stackGuard
4537 racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4540 msanmalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4543 asanunpoison(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
4549 // Purge all cached G's from gfree list to the global list.
4550 func gfpurge(pp *p) {
4556 for !pp.gFree.empty() {
4557 gp := pp.gFree.pop()
4559 if gp.stack.lo == 0 {
4566 lock(&sched.gFree.lock)
4567 sched.gFree.noStack.pushAll(noStackQ)
4568 sched.gFree.stack.pushAll(stackQ)
4569 sched.gFree.n += inc
4570 unlock(&sched.gFree.lock)
4573 // Breakpoint executes a breakpoint trap.
4578 // dolockOSThread is called by LockOSThread and lockOSThread below
4579 // after they modify m.locked. Do not allow preemption during this call,
4580 // or else the m might be different in this function than in the caller.
4583 func dolockOSThread() {
4584 if GOARCH == "wasm" {
4585 return // no threads on wasm yet
4588 gp.m.lockedg.set(gp)
4589 gp.lockedm.set(gp.m)
4592 // LockOSThread wires the calling goroutine to its current operating system thread.
4593 // The calling goroutine will always execute in that thread,
4594 // and no other goroutine will execute in it,
4595 // until the calling goroutine has made as many calls to
4596 // UnlockOSThread as to LockOSThread.
4597 // If the calling goroutine exits without unlocking the thread,
4598 // the thread will be terminated.
4600 // All init functions are run on the startup thread. Calling LockOSThread
4601 // from an init function will cause the main function to be invoked on
4604 // A goroutine should call LockOSThread before calling OS services or
4605 // non-Go library functions that depend on per-thread state.
4608 func LockOSThread() {
4609 if atomic.Load(&newmHandoff.haveTemplateThread) == 0 && GOOS != "plan9" {
4610 // If we need to start a new thread from the locked
4611 // thread, we need the template thread. Start it now
4612 // while we're in a known-good state.
4613 startTemplateThread()
4617 if gp.m.lockedExt == 0 {
4619 panic("LockOSThread nesting overflow")
4625 func lockOSThread() {
4626 getg().m.lockedInt++
4630 // dounlockOSThread is called by UnlockOSThread and unlockOSThread below
4631 // after they update m->locked. Do not allow preemption during this call,
4632 // or else the m might be in different in this function than in the caller.
4635 func dounlockOSThread() {
4636 if GOARCH == "wasm" {
4637 return // no threads on wasm yet
4640 if gp.m.lockedInt != 0 || gp.m.lockedExt != 0 {
4647 // UnlockOSThread undoes an earlier call to LockOSThread.
4648 // If this drops the number of active LockOSThread calls on the
4649 // calling goroutine to zero, it unwires the calling goroutine from
4650 // its fixed operating system thread.
4651 // If there are no active LockOSThread calls, this is a no-op.
4653 // Before calling UnlockOSThread, the caller must ensure that the OS
4654 // thread is suitable for running other goroutines. If the caller made
4655 // any permanent changes to the state of the thread that would affect
4656 // other goroutines, it should not call this function and thus leave
4657 // the goroutine locked to the OS thread until the goroutine (and
4658 // hence the thread) exits.
4661 func UnlockOSThread() {
4663 if gp.m.lockedExt == 0 {
4671 func unlockOSThread() {
4673 if gp.m.lockedInt == 0 {
4674 systemstack(badunlockosthread)
4680 func badunlockosthread() {
4681 throw("runtime: internal error: misuse of lockOSThread/unlockOSThread")
4684 func gcount() int32 {
4685 n := int32(atomic.Loaduintptr(&allglen)) - sched.gFree.n - sched.ngsys.Load()
4686 for _, pp := range allp {
4690 // All these variables can be changed concurrently, so the result can be inconsistent.
4691 // But at least the current goroutine is running.
4698 func mcount() int32 {
4699 return int32(sched.mnext - sched.nmfreed)
4703 signalLock atomic.Uint32
4705 // Must hold signalLock to write. Reads may be lock-free, but
4706 // signalLock should be taken to synchronize with changes.
4710 func _System() { _System() }
4711 func _ExternalCode() { _ExternalCode() }
4712 func _LostExternalCode() { _LostExternalCode() }
4713 func _GC() { _GC() }
4714 func _LostSIGPROFDuringAtomic64() { _LostSIGPROFDuringAtomic64() }
4715 func _VDSO() { _VDSO() }
4717 // Called if we receive a SIGPROF signal.
4718 // Called by the signal handler, may run during STW.
4720 //go:nowritebarrierrec
4721 func sigprof(pc, sp, lr uintptr, gp *g, mp *m) {
4722 if prof.hz.Load() == 0 {
4726 // If mp.profilehz is 0, then profiling is not enabled for this thread.
4727 // We must check this to avoid a deadlock between setcpuprofilerate
4728 // and the call to cpuprof.add, below.
4729 if mp != nil && mp.profilehz == 0 {
4733 // On mips{,le}/arm, 64bit atomics are emulated with spinlocks, in
4734 // runtime/internal/atomic. If SIGPROF arrives while the program is inside
4735 // the critical section, it creates a deadlock (when writing the sample).
4736 // As a workaround, create a counter of SIGPROFs while in critical section
4737 // to store the count, and pass it to sigprof.add() later when SIGPROF is
4738 // received from somewhere else (with _LostSIGPROFDuringAtomic64 as pc).
4739 if GOARCH == "mips" || GOARCH == "mipsle" || GOARCH == "arm" {
4740 if f := findfunc(pc); f.valid() {
4741 if hasPrefix(funcname(f), "runtime/internal/atomic") {
4742 cpuprof.lostAtomic++
4746 if GOARCH == "arm" && goarm < 7 && GOOS == "linux" && pc&0xffff0000 == 0xffff0000 {
4747 // runtime/internal/atomic functions call into kernel
4748 // helpers on arm < 7. See
4749 // runtime/internal/atomic/sys_linux_arm.s.
4750 cpuprof.lostAtomic++
4755 // Profiling runs concurrently with GC, so it must not allocate.
4756 // Set a trap in case the code does allocate.
4757 // Note that on windows, one thread takes profiles of all the
4758 // other threads, so mp is usually not getg().m.
4759 // In fact mp may not even be stopped.
4760 // See golang.org/issue/17165.
4761 getg().m.mallocing++
4764 var stk [maxCPUProfStack]uintptr
4766 if mp.ncgo > 0 && mp.curg != nil && mp.curg.syscallpc != 0 && mp.curg.syscallsp != 0 {
4768 // Check cgoCallersUse to make sure that we are not
4769 // interrupting other code that is fiddling with
4770 // cgoCallers. We are running in a signal handler
4771 // with all signals blocked, so we don't have to worry
4772 // about any other code interrupting us.
4773 if mp.cgoCallersUse.Load() == 0 && mp.cgoCallers != nil && mp.cgoCallers[0] != 0 {
4774 for cgoOff < len(mp.cgoCallers) && mp.cgoCallers[cgoOff] != 0 {
4777 n += copy(stk[:], mp.cgoCallers[:cgoOff])
4778 mp.cgoCallers[0] = 0
4781 // Collect Go stack that leads to the cgo call.
4782 u.initAt(mp.curg.syscallpc, mp.curg.syscallsp, 0, mp.curg, unwindSilentErrors)
4783 } else if usesLibcall() && mp.libcallg != 0 && mp.libcallpc != 0 && mp.libcallsp != 0 {
4784 // Libcall, i.e. runtime syscall on windows.
4785 // Collect Go stack that leads to the call.
4786 u.initAt(mp.libcallpc, mp.libcallsp, 0, mp.libcallg.ptr(), unwindSilentErrors)
4787 } else if mp != nil && mp.vdsoSP != 0 {
4788 // VDSO call, e.g. nanotime1 on Linux.
4789 // Collect Go stack that leads to the call.
4790 u.initAt(mp.vdsoPC, mp.vdsoSP, 0, gp, unwindSilentErrors|unwindJumpStack)
4792 u.initAt(pc, sp, lr, gp, unwindSilentErrors|unwindTrap|unwindJumpStack)
4794 n += tracebackPCs(&u, 0, stk[n:])
4797 // Normal traceback is impossible or has failed.
4798 // Account it against abstract "System" or "GC".
4801 pc = abi.FuncPCABIInternal(_VDSO) + sys.PCQuantum
4802 } else if pc > firstmoduledata.etext {
4803 // "ExternalCode" is better than "etext".
4804 pc = abi.FuncPCABIInternal(_ExternalCode) + sys.PCQuantum
4807 if mp.preemptoff != "" {
4808 stk[1] = abi.FuncPCABIInternal(_GC) + sys.PCQuantum
4810 stk[1] = abi.FuncPCABIInternal(_System) + sys.PCQuantum
4814 if prof.hz.Load() != 0 {
4815 // Note: it can happen on Windows that we interrupted a system thread
4816 // with no g, so gp could nil. The other nil checks are done out of
4817 // caution, but not expected to be nil in practice.
4818 var tagPtr *unsafe.Pointer
4819 if gp != nil && gp.m != nil && gp.m.curg != nil {
4820 tagPtr = &gp.m.curg.labels
4822 cpuprof.add(tagPtr, stk[:n])
4826 if gp != nil && gp.m != nil {
4827 if gp.m.curg != nil {
4832 traceCPUSample(gprof, pp, stk[:n])
4834 getg().m.mallocing--
4837 // setcpuprofilerate sets the CPU profiling rate to hz times per second.
4838 // If hz <= 0, setcpuprofilerate turns off CPU profiling.
4839 func setcpuprofilerate(hz int32) {
4840 // Force sane arguments.
4845 // Disable preemption, otherwise we can be rescheduled to another thread
4846 // that has profiling enabled.
4850 // Stop profiler on this thread so that it is safe to lock prof.
4851 // if a profiling signal came in while we had prof locked,
4852 // it would deadlock.
4853 setThreadCPUProfiler(0)
4855 for !prof.signalLock.CompareAndSwap(0, 1) {
4858 if prof.hz.Load() != hz {
4859 setProcessCPUProfiler(hz)
4862 prof.signalLock.Store(0)
4865 sched.profilehz = hz
4869 setThreadCPUProfiler(hz)
4875 // init initializes pp, which may be a freshly allocated p or a
4876 // previously destroyed p, and transitions it to status _Pgcstop.
4877 func (pp *p) init(id int32) {
4879 pp.status = _Pgcstop
4880 pp.sudogcache = pp.sudogbuf[:0]
4881 pp.deferpool = pp.deferpoolbuf[:0]
4883 if pp.mcache == nil {
4886 throw("missing mcache?")
4888 // Use the bootstrap mcache0. Only one P will get
4889 // mcache0: the one with ID 0.
4892 pp.mcache = allocmcache()
4895 if raceenabled && pp.raceprocctx == 0 {
4897 pp.raceprocctx = raceprocctx0
4898 raceprocctx0 = 0 // bootstrap
4900 pp.raceprocctx = raceproccreate()
4903 lockInit(&pp.timersLock, lockRankTimers)
4905 // This P may get timers when it starts running. Set the mask here
4906 // since the P may not go through pidleget (notably P 0 on startup).
4908 // Similarly, we may not go through pidleget before this P starts
4909 // running if it is P 0 on startup.
4913 // destroy releases all of the resources associated with pp and
4914 // transitions it to status _Pdead.
4916 // sched.lock must be held and the world must be stopped.
4917 func (pp *p) destroy() {
4918 assertLockHeld(&sched.lock)
4919 assertWorldStopped()
4921 // Move all runnable goroutines to the global queue
4922 for pp.runqhead != pp.runqtail {
4923 // Pop from tail of local queue
4925 gp := pp.runq[pp.runqtail%uint32(len(pp.runq))].ptr()
4926 // Push onto head of global queue
4929 if pp.runnext != 0 {
4930 globrunqputhead(pp.runnext.ptr())
4933 if len(pp.timers) > 0 {
4934 plocal := getg().m.p.ptr()
4935 // The world is stopped, but we acquire timersLock to
4936 // protect against sysmon calling timeSleepUntil.
4937 // This is the only case where we hold the timersLock of
4938 // more than one P, so there are no deadlock concerns.
4939 lock(&plocal.timersLock)
4940 lock(&pp.timersLock)
4941 moveTimers(plocal, pp.timers)
4943 pp.numTimers.Store(0)
4944 pp.deletedTimers.Store(0)
4945 pp.timer0When.Store(0)
4946 unlock(&pp.timersLock)
4947 unlock(&plocal.timersLock)
4949 // Flush p's write barrier buffer.
4950 if gcphase != _GCoff {
4954 for i := range pp.sudogbuf {
4955 pp.sudogbuf[i] = nil
4957 pp.sudogcache = pp.sudogbuf[:0]
4958 for j := range pp.deferpoolbuf {
4959 pp.deferpoolbuf[j] = nil
4961 pp.deferpool = pp.deferpoolbuf[:0]
4962 systemstack(func() {
4963 for i := 0; i < pp.mspancache.len; i++ {
4964 // Safe to call since the world is stopped.
4965 mheap_.spanalloc.free(unsafe.Pointer(pp.mspancache.buf[i]))
4967 pp.mspancache.len = 0
4969 pp.pcache.flush(&mheap_.pages)
4970 unlock(&mheap_.lock)
4972 freemcache(pp.mcache)
4977 if pp.timerRaceCtx != 0 {
4978 // The race detector code uses a callback to fetch
4979 // the proc context, so arrange for that callback
4980 // to see the right thing.
4981 // This hack only works because we are the only
4987 racectxend(pp.timerRaceCtx)
4992 raceprocdestroy(pp.raceprocctx)
4999 // Change number of processors.
5001 // sched.lock must be held, and the world must be stopped.
5003 // gcworkbufs must not be being modified by either the GC or the write barrier
5004 // code, so the GC must not be running if the number of Ps actually changes.
5006 // Returns list of Ps with local work, they need to be scheduled by the caller.
5007 func procresize(nprocs int32) *p {
5008 assertLockHeld(&sched.lock)
5009 assertWorldStopped()
5012 if old < 0 || nprocs <= 0 {
5013 throw("procresize: invalid arg")
5016 traceGomaxprocs(nprocs)
5019 // update statistics
5021 if sched.procresizetime != 0 {
5022 sched.totaltime += int64(old) * (now - sched.procresizetime)
5024 sched.procresizetime = now
5026 maskWords := (nprocs + 31) / 32
5028 // Grow allp if necessary.
5029 if nprocs > int32(len(allp)) {
5030 // Synchronize with retake, which could be running
5031 // concurrently since it doesn't run on a P.
5033 if nprocs <= int32(cap(allp)) {
5034 allp = allp[:nprocs]
5036 nallp := make([]*p, nprocs)
5037 // Copy everything up to allp's cap so we
5038 // never lose old allocated Ps.
5039 copy(nallp, allp[:cap(allp)])
5043 if maskWords <= int32(cap(idlepMask)) {
5044 idlepMask = idlepMask[:maskWords]
5045 timerpMask = timerpMask[:maskWords]
5047 nidlepMask := make([]uint32, maskWords)
5048 // No need to copy beyond len, old Ps are irrelevant.
5049 copy(nidlepMask, idlepMask)
5050 idlepMask = nidlepMask
5052 ntimerpMask := make([]uint32, maskWords)
5053 copy(ntimerpMask, timerpMask)
5054 timerpMask = ntimerpMask
5059 // initialize new P's
5060 for i := old; i < nprocs; i++ {
5066 atomicstorep(unsafe.Pointer(&allp[i]), unsafe.Pointer(pp))
5070 if gp.m.p != 0 && gp.m.p.ptr().id < nprocs {
5071 // continue to use the current P
5072 gp.m.p.ptr().status = _Prunning
5073 gp.m.p.ptr().mcache.prepareForSweep()
5075 // release the current P and acquire allp[0].
5077 // We must do this before destroying our current P
5078 // because p.destroy itself has write barriers, so we
5079 // need to do that from a valid P.
5082 // Pretend that we were descheduled
5083 // and then scheduled again to keep
5086 traceProcStop(gp.m.p.ptr())
5100 // g.m.p is now set, so we no longer need mcache0 for bootstrapping.
5103 // release resources from unused P's
5104 for i := nprocs; i < old; i++ {
5107 // can't free P itself because it can be referenced by an M in syscall
5111 if int32(len(allp)) != nprocs {
5113 allp = allp[:nprocs]
5114 idlepMask = idlepMask[:maskWords]
5115 timerpMask = timerpMask[:maskWords]
5120 for i := nprocs - 1; i >= 0; i-- {
5122 if gp.m.p.ptr() == pp {
5130 pp.link.set(runnablePs)
5134 stealOrder.reset(uint32(nprocs))
5135 var int32p *int32 = &gomaxprocs // make compiler check that gomaxprocs is an int32
5136 atomic.Store((*uint32)(unsafe.Pointer(int32p)), uint32(nprocs))
5138 // Notify the limiter that the amount of procs has changed.
5139 gcCPULimiter.resetCapacity(now, nprocs)
5144 // Associate p and the current m.
5146 // This function is allowed to have write barriers even if the caller
5147 // isn't because it immediately acquires pp.
5149 //go:yeswritebarrierrec
5150 func acquirep(pp *p) {
5151 // Do the part that isn't allowed to have write barriers.
5154 // Have p; write barriers now allowed.
5156 // Perform deferred mcache flush before this P can allocate
5157 // from a potentially stale mcache.
5158 pp.mcache.prepareForSweep()
5165 // wirep is the first step of acquirep, which actually associates the
5166 // current M to pp. This is broken out so we can disallow write
5167 // barriers for this part, since we don't yet have a P.
5169 //go:nowritebarrierrec
5175 throw("wirep: already in go")
5177 if pp.m != 0 || pp.status != _Pidle {
5182 print("wirep: p->m=", pp.m, "(", id, ") p->status=", pp.status, "\n")
5183 throw("wirep: invalid p state")
5187 pp.status = _Prunning
5190 // Disassociate p and the current m.
5191 func releasep() *p {
5195 throw("releasep: invalid arg")
5198 if pp.m.ptr() != gp.m || pp.status != _Prunning {
5199 print("releasep: m=", gp.m, " m->p=", gp.m.p.ptr(), " p->m=", hex(pp.m), " p->status=", pp.status, "\n")
5200 throw("releasep: invalid p state")
5203 traceProcStop(gp.m.p.ptr())
5211 func incidlelocked(v int32) {
5213 sched.nmidlelocked += v
5220 // Check for deadlock situation.
5221 // The check is based on number of running M's, if 0 -> deadlock.
5222 // sched.lock must be held.
5224 assertLockHeld(&sched.lock)
5226 // For -buildmode=c-shared or -buildmode=c-archive it's OK if
5227 // there are no running goroutines. The calling program is
5228 // assumed to be running.
5229 if islibrary || isarchive {
5233 // If we are dying because of a signal caught on an already idle thread,
5234 // freezetheworld will cause all running threads to block.
5235 // And runtime will essentially enter into deadlock state,
5236 // except that there is a thread that will call exit soon.
5237 if panicking.Load() > 0 {
5241 // If we are not running under cgo, but we have an extra M then account
5242 // for it. (It is possible to have an extra M on Windows without cgo to
5243 // accommodate callbacks created by syscall.NewCallback. See issue #6751
5246 if !iscgo && cgoHasExtraM && extraMLength.Load() > 0 {
5250 run := mcount() - sched.nmidle - sched.nmidlelocked - sched.nmsys
5255 print("runtime: checkdead: nmidle=", sched.nmidle, " nmidlelocked=", sched.nmidlelocked, " mcount=", mcount(), " nmsys=", sched.nmsys, "\n")
5257 throw("checkdead: inconsistent counts")
5261 forEachG(func(gp *g) {
5262 if isSystemGoroutine(gp, false) {
5265 s := readgstatus(gp)
5266 switch s &^ _Gscan {
5273 print("runtime: checkdead: find g ", gp.goid, " in status ", s, "\n")
5275 throw("checkdead: runnable g")
5278 if grunning == 0 { // possible if main goroutine calls runtime·Goexit()
5279 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5280 fatal("no goroutines (main called runtime.Goexit) - deadlock!")
5283 // Maybe jump time forward for playground.
5285 if when := timeSleepUntil(); when < maxWhen {
5288 // Start an M to steal the timer.
5289 pp, _ := pidleget(faketime)
5291 // There should always be a free P since
5292 // nothing is running.
5294 throw("checkdead: no p for timer")
5298 // There should always be a free M since
5299 // nothing is running.
5301 throw("checkdead: no m for timer")
5303 // M must be spinning to steal. We set this to be
5304 // explicit, but since this is the only M it would
5305 // become spinning on its own anyways.
5306 sched.nmspinning.Add(1)
5309 notewakeup(&mp.park)
5314 // There are no goroutines running, so we can look at the P's.
5315 for _, pp := range allp {
5316 if len(pp.timers) > 0 {
5321 unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
5322 fatal("all goroutines are asleep - deadlock!")
5325 // forcegcperiod is the maximum time in nanoseconds between garbage
5326 // collections. If we go this long without a garbage collection, one
5327 // is forced to run.
5329 // This is a variable for testing purposes. It normally doesn't change.
5330 var forcegcperiod int64 = 2 * 60 * 1e9
5332 // needSysmonWorkaround is true if the workaround for
5333 // golang.org/issue/42515 is needed on NetBSD.
5334 var needSysmonWorkaround bool = false
5336 // Always runs without a P, so write barriers are not allowed.
5338 //go:nowritebarrierrec
5345 lasttrace := int64(0)
5346 idle := 0 // how many cycles in succession we had not wokeup somebody
5350 if idle == 0 { // start with 20us sleep...
5352 } else if idle > 50 { // start doubling the sleep after 1ms...
5355 if delay > 10*1000 { // up to 10ms
5360 // sysmon should not enter deep sleep if schedtrace is enabled so that
5361 // it can print that information at the right time.
5363 // It should also not enter deep sleep if there are any active P's so
5364 // that it can retake P's from syscalls, preempt long running G's, and
5365 // poll the network if all P's are busy for long stretches.
5367 // It should wakeup from deep sleep if any P's become active either due
5368 // to exiting a syscall or waking up due to a timer expiring so that it
5369 // can resume performing those duties. If it wakes from a syscall it
5370 // resets idle and delay as a bet that since it had retaken a P from a
5371 // syscall before, it may need to do it again shortly after the
5372 // application starts work again. It does not reset idle when waking
5373 // from a timer to avoid adding system load to applications that spend
5374 // most of their time sleeping.
5376 if debug.schedtrace <= 0 && (sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs) {
5378 if sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs {
5379 syscallWake := false
5380 next := timeSleepUntil()
5382 sched.sysmonwait.Store(true)
5384 // Make wake-up period small enough
5385 // for the sampling to be correct.
5386 sleep := forcegcperiod / 2
5387 if next-now < sleep {
5390 shouldRelax := sleep >= osRelaxMinNS
5394 syscallWake = notetsleep(&sched.sysmonnote, sleep)
5399 sched.sysmonwait.Store(false)
5400 noteclear(&sched.sysmonnote)
5410 lock(&sched.sysmonlock)
5411 // Update now in case we blocked on sysmonnote or spent a long time
5412 // blocked on schedlock or sysmonlock above.
5415 // trigger libc interceptors if needed
5416 if *cgo_yield != nil {
5417 asmcgocall(*cgo_yield, nil)
5419 // poll network if not polled for more than 10ms
5420 lastpoll := sched.lastpoll.Load()
5421 if netpollinited() && lastpoll != 0 && lastpoll+10*1000*1000 < now {
5422 sched.lastpoll.CompareAndSwap(lastpoll, now)
5423 list := netpoll(0) // non-blocking - returns list of goroutines
5425 // Need to decrement number of idle locked M's
5426 // (pretending that one more is running) before injectglist.
5427 // Otherwise it can lead to the following situation:
5428 // injectglist grabs all P's but before it starts M's to run the P's,
5429 // another M returns from syscall, finishes running its G,
5430 // observes that there is no work to do and no other running M's
5431 // and reports deadlock.
5437 if GOOS == "netbsd" && needSysmonWorkaround {
5438 // netpoll is responsible for waiting for timer
5439 // expiration, so we typically don't have to worry
5440 // about starting an M to service timers. (Note that
5441 // sleep for timeSleepUntil above simply ensures sysmon
5442 // starts running again when that timer expiration may
5443 // cause Go code to run again).
5445 // However, netbsd has a kernel bug that sometimes
5446 // misses netpollBreak wake-ups, which can lead to
5447 // unbounded delays servicing timers. If we detect this
5448 // overrun, then startm to get something to handle the
5451 // See issue 42515 and
5452 // https://gnats.netbsd.org/cgi-bin/query-pr-single.pl?number=50094.
5453 if next := timeSleepUntil(); next < now {
5454 startm(nil, false, false)
5457 if scavenger.sysmonWake.Load() != 0 {
5458 // Kick the scavenger awake if someone requested it.
5461 // retake P's blocked in syscalls
5462 // and preempt long running G's
5463 if retake(now) != 0 {
5468 // check if we need to force a GC
5469 if t := (gcTrigger{kind: gcTriggerTime, now: now}); t.test() && forcegc.idle.Load() {
5471 forcegc.idle.Store(false)
5473 list.push(forcegc.g)
5475 unlock(&forcegc.lock)
5477 if debug.schedtrace > 0 && lasttrace+int64(debug.schedtrace)*1000000 <= now {
5479 schedtrace(debug.scheddetail > 0)
5481 unlock(&sched.sysmonlock)
5485 type sysmontick struct {
5492 // forcePreemptNS is the time slice given to a G before it is
5494 const forcePreemptNS = 10 * 1000 * 1000 // 10ms
5496 func retake(now int64) uint32 {
5498 // Prevent allp slice changes. This lock will be completely
5499 // uncontended unless we're already stopping the world.
5501 // We can't use a range loop over allp because we may
5502 // temporarily drop the allpLock. Hence, we need to re-fetch
5503 // allp each time around the loop.
5504 for i := 0; i < len(allp); i++ {
5507 // This can happen if procresize has grown
5508 // allp but not yet created new Ps.
5511 pd := &pp.sysmontick
5514 if s == _Prunning || s == _Psyscall {
5515 // Preempt G if it's running for too long.
5516 t := int64(pp.schedtick)
5517 if int64(pd.schedtick) != t {
5518 pd.schedtick = uint32(t)
5520 } else if pd.schedwhen+forcePreemptNS <= now {
5522 // In case of syscall, preemptone() doesn't
5523 // work, because there is no M wired to P.
5528 // Retake P from syscall if it's there for more than 1 sysmon tick (at least 20us).
5529 t := int64(pp.syscalltick)
5530 if !sysretake && int64(pd.syscalltick) != t {
5531 pd.syscalltick = uint32(t)
5532 pd.syscallwhen = now
5535 // On the one hand we don't want to retake Ps if there is no other work to do,
5536 // but on the other hand we want to retake them eventually
5537 // because they can prevent the sysmon thread from deep sleep.
5538 if runqempty(pp) && sched.nmspinning.Load()+sched.npidle.Load() > 0 && pd.syscallwhen+10*1000*1000 > now {
5541 // Drop allpLock so we can take sched.lock.
5543 // Need to decrement number of idle locked M's
5544 // (pretending that one more is running) before the CAS.
5545 // Otherwise the M from which we retake can exit the syscall,
5546 // increment nmidle and report deadlock.
5548 if atomic.Cas(&pp.status, s, _Pidle) {
5565 // Tell all goroutines that they have been preempted and they should stop.
5566 // This function is purely best-effort. It can fail to inform a goroutine if a
5567 // processor just started running it.
5568 // No locks need to be held.
5569 // Returns true if preemption request was issued to at least one goroutine.
5570 func preemptall() bool {
5572 for _, pp := range allp {
5573 if pp.status != _Prunning {
5583 // Tell the goroutine running on processor P to stop.
5584 // This function is purely best-effort. It can incorrectly fail to inform the
5585 // goroutine. It can inform the wrong goroutine. Even if it informs the
5586 // correct goroutine, that goroutine might ignore the request if it is
5587 // simultaneously executing newstack.
5588 // No lock needs to be held.
5589 // Returns true if preemption request was issued.
5590 // The actual preemption will happen at some point in the future
5591 // and will be indicated by the gp->status no longer being
5593 func preemptone(pp *p) bool {
5595 if mp == nil || mp == getg().m {
5599 if gp == nil || gp == mp.g0 {
5605 // Every call in a goroutine checks for stack overflow by
5606 // comparing the current stack pointer to gp->stackguard0.
5607 // Setting gp->stackguard0 to StackPreempt folds
5608 // preemption into the normal stack overflow check.
5609 gp.stackguard0 = stackPreempt
5611 // Request an async preemption of this P.
5612 if preemptMSupported && debug.asyncpreemptoff == 0 {
5622 func schedtrace(detailed bool) {
5629 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)
5631 print(" gcwaiting=", sched.gcwaiting.Load(), " nmidlelocked=", sched.nmidlelocked, " stopwait=", sched.stopwait, " sysmonwait=", sched.sysmonwait.Load(), "\n")
5633 // We must be careful while reading data from P's, M's and G's.
5634 // Even if we hold schedlock, most data can be changed concurrently.
5635 // E.g. (p->m ? p->m->id : -1) can crash if p->m changes from non-nil to nil.
5636 for i, pp := range allp {
5638 h := atomic.Load(&pp.runqhead)
5639 t := atomic.Load(&pp.runqtail)
5641 print(" P", i, ": status=", pp.status, " schedtick=", pp.schedtick, " syscalltick=", pp.syscalltick, " m=")
5647 print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers), "\n")
5649 // In non-detailed mode format lengths of per-P run queues as:
5650 // [len1 len2 len3 len4]
5656 if i == len(allp)-1 {
5667 for mp := allm; mp != nil; mp = mp.alllink {
5669 print(" M", mp.id, ": p=")
5681 print(" mallocing=", mp.mallocing, " throwing=", mp.throwing, " preemptoff=", mp.preemptoff, " locks=", mp.locks, " dying=", mp.dying, " spinning=", mp.spinning, " blocked=", mp.blocked, " lockedg=")
5682 if lockedg := mp.lockedg.ptr(); lockedg != nil {
5690 forEachG(func(gp *g) {
5691 print(" G", gp.goid, ": status=", readgstatus(gp), "(", gp.waitreason.String(), ") m=")
5698 if lockedm := gp.lockedm.ptr(); lockedm != nil {
5708 // schedEnableUser enables or disables the scheduling of user
5711 // This does not stop already running user goroutines, so the caller
5712 // should first stop the world when disabling user goroutines.
5713 func schedEnableUser(enable bool) {
5715 if sched.disable.user == !enable {
5719 sched.disable.user = !enable
5721 n := sched.disable.n
5723 globrunqputbatch(&sched.disable.runnable, n)
5725 for ; n != 0 && sched.npidle.Load() != 0; n-- {
5726 startm(nil, false, false)
5733 // schedEnabled reports whether gp should be scheduled. It returns
5734 // false is scheduling of gp is disabled.
5736 // sched.lock must be held.
5737 func schedEnabled(gp *g) bool {
5738 assertLockHeld(&sched.lock)
5740 if sched.disable.user {
5741 return isSystemGoroutine(gp, true)
5746 // Put mp on midle list.
5747 // sched.lock must be held.
5748 // May run during STW, so write barriers are not allowed.
5750 //go:nowritebarrierrec
5752 assertLockHeld(&sched.lock)
5754 mp.schedlink = sched.midle
5760 // Try to get an m from midle list.
5761 // sched.lock must be held.
5762 // May run during STW, so write barriers are not allowed.
5764 //go:nowritebarrierrec
5766 assertLockHeld(&sched.lock)
5768 mp := sched.midle.ptr()
5770 sched.midle = mp.schedlink
5776 // Put gp on the global runnable queue.
5777 // sched.lock must be held.
5778 // May run during STW, so write barriers are not allowed.
5780 //go:nowritebarrierrec
5781 func globrunqput(gp *g) {
5782 assertLockHeld(&sched.lock)
5784 sched.runq.pushBack(gp)
5788 // Put gp at the head of the global runnable queue.
5789 // sched.lock must be held.
5790 // May run during STW, so write barriers are not allowed.
5792 //go:nowritebarrierrec
5793 func globrunqputhead(gp *g) {
5794 assertLockHeld(&sched.lock)
5800 // Put a batch of runnable goroutines on the global runnable queue.
5801 // This clears *batch.
5802 // sched.lock must be held.
5803 // May run during STW, so write barriers are not allowed.
5805 //go:nowritebarrierrec
5806 func globrunqputbatch(batch *gQueue, n int32) {
5807 assertLockHeld(&sched.lock)
5809 sched.runq.pushBackAll(*batch)
5814 // Try get a batch of G's from the global runnable queue.
5815 // sched.lock must be held.
5816 func globrunqget(pp *p, max int32) *g {
5817 assertLockHeld(&sched.lock)
5819 if sched.runqsize == 0 {
5823 n := sched.runqsize/gomaxprocs + 1
5824 if n > sched.runqsize {
5827 if max > 0 && n > max {
5830 if n > int32(len(pp.runq))/2 {
5831 n = int32(len(pp.runq)) / 2
5836 gp := sched.runq.pop()
5839 gp1 := sched.runq.pop()
5840 runqput(pp, gp1, false)
5845 // pMask is an atomic bitstring with one bit per P.
5848 // read returns true if P id's bit is set.
5849 func (p pMask) read(id uint32) bool {
5851 mask := uint32(1) << (id % 32)
5852 return (atomic.Load(&p[word]) & mask) != 0
5855 // set sets P id's bit.
5856 func (p pMask) set(id int32) {
5858 mask := uint32(1) << (id % 32)
5859 atomic.Or(&p[word], mask)
5862 // clear clears P id's bit.
5863 func (p pMask) clear(id int32) {
5865 mask := uint32(1) << (id % 32)
5866 atomic.And(&p[word], ^mask)
5869 // updateTimerPMask clears pp's timer mask if it has no timers on its heap.
5871 // Ideally, the timer mask would be kept immediately consistent on any timer
5872 // operations. Unfortunately, updating a shared global data structure in the
5873 // timer hot path adds too much overhead in applications frequently switching
5874 // between no timers and some timers.
5876 // As a compromise, the timer mask is updated only on pidleget / pidleput. A
5877 // running P (returned by pidleget) may add a timer at any time, so its mask
5878 // must be set. An idle P (passed to pidleput) cannot add new timers while
5879 // idle, so if it has no timers at that time, its mask may be cleared.
5881 // Thus, we get the following effects on timer-stealing in findrunnable:
5883 // - Idle Ps with no timers when they go idle are never checked in findrunnable
5884 // (for work- or timer-stealing; this is the ideal case).
5885 // - Running Ps must always be checked.
5886 // - Idle Ps whose timers are stolen must continue to be checked until they run
5887 // again, even after timer expiration.
5889 // When the P starts running again, the mask should be set, as a timer may be
5890 // added at any time.
5892 // TODO(prattmic): Additional targeted updates may improve the above cases.
5893 // e.g., updating the mask when stealing a timer.
5894 func updateTimerPMask(pp *p) {
5895 if pp.numTimers.Load() > 0 {
5899 // Looks like there are no timers, however another P may transiently
5900 // decrement numTimers when handling a timerModified timer in
5901 // checkTimers. We must take timersLock to serialize with these changes.
5902 lock(&pp.timersLock)
5903 if pp.numTimers.Load() == 0 {
5904 timerpMask.clear(pp.id)
5906 unlock(&pp.timersLock)
5909 // pidleput puts p on the _Pidle list. now must be a relatively recent call
5910 // to nanotime or zero. Returns now or the current time if now was zero.
5912 // This releases ownership of p. Once sched.lock is released it is no longer
5915 // sched.lock must be held.
5917 // May run during STW, so write barriers are not allowed.
5919 //go:nowritebarrierrec
5920 func pidleput(pp *p, now int64) int64 {
5921 assertLockHeld(&sched.lock)
5924 throw("pidleput: P has non-empty run queue")
5929 updateTimerPMask(pp) // clear if there are no timers.
5930 idlepMask.set(pp.id)
5931 pp.link = sched.pidle
5934 if !pp.limiterEvent.start(limiterEventIdle, now) {
5935 throw("must be able to track idle limiter event")
5940 // pidleget tries to get a p from the _Pidle list, acquiring ownership.
5942 // sched.lock must be held.
5944 // May run during STW, so write barriers are not allowed.
5946 //go:nowritebarrierrec
5947 func pidleget(now int64) (*p, int64) {
5948 assertLockHeld(&sched.lock)
5950 pp := sched.pidle.ptr()
5952 // Timer may get added at any time now.
5956 timerpMask.set(pp.id)
5957 idlepMask.clear(pp.id)
5958 sched.pidle = pp.link
5959 sched.npidle.Add(-1)
5960 pp.limiterEvent.stop(limiterEventIdle, now)
5965 // pidlegetSpinning tries to get a p from the _Pidle list, acquiring ownership.
5966 // This is called by spinning Ms (or callers than need a spinning M) that have
5967 // found work. If no P is available, this must synchronized with non-spinning
5968 // Ms that may be preparing to drop their P without discovering this work.
5970 // sched.lock must be held.
5972 // May run during STW, so write barriers are not allowed.
5974 //go:nowritebarrierrec
5975 func pidlegetSpinning(now int64) (*p, int64) {
5976 assertLockHeld(&sched.lock)
5978 pp, now := pidleget(now)
5980 // See "Delicate dance" comment in findrunnable. We found work
5981 // that we cannot take, we must synchronize with non-spinning
5982 // Ms that may be preparing to drop their P.
5983 sched.needspinning.Store(1)
5990 // runqempty reports whether pp has no Gs on its local run queue.
5991 // It never returns true spuriously.
5992 func runqempty(pp *p) bool {
5993 // Defend against a race where 1) pp has G1 in runqnext but runqhead == runqtail,
5994 // 2) runqput on pp kicks G1 to the runq, 3) runqget on pp empties runqnext.
5995 // Simply observing that runqhead == runqtail and then observing that runqnext == nil
5996 // does not mean the queue is empty.
5998 head := atomic.Load(&pp.runqhead)
5999 tail := atomic.Load(&pp.runqtail)
6000 runnext := atomic.Loaduintptr((*uintptr)(unsafe.Pointer(&pp.runnext)))
6001 if tail == atomic.Load(&pp.runqtail) {
6002 return head == tail && runnext == 0
6007 // To shake out latent assumptions about scheduling order,
6008 // we introduce some randomness into scheduling decisions
6009 // when running with the race detector.
6010 // The need for this was made obvious by changing the
6011 // (deterministic) scheduling order in Go 1.5 and breaking
6012 // many poorly-written tests.
6013 // With the randomness here, as long as the tests pass
6014 // consistently with -race, they shouldn't have latent scheduling
6016 const randomizeScheduler = raceenabled
6018 // runqput tries to put g on the local runnable queue.
6019 // If next is false, runqput adds g to the tail of the runnable queue.
6020 // If next is true, runqput puts g in the pp.runnext slot.
6021 // If the run queue is full, runnext puts g on the global queue.
6022 // Executed only by the owner P.
6023 func runqput(pp *p, gp *g, next bool) {
6024 if randomizeScheduler && next && fastrandn(2) == 0 {
6030 oldnext := pp.runnext
6031 if !pp.runnext.cas(oldnext, guintptr(unsafe.Pointer(gp))) {
6037 // Kick the old runnext out to the regular run queue.
6042 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
6044 if t-h < uint32(len(pp.runq)) {
6045 pp.runq[t%uint32(len(pp.runq))].set(gp)
6046 atomic.StoreRel(&pp.runqtail, t+1) // store-release, makes the item available for consumption
6049 if runqputslow(pp, gp, h, t) {
6052 // the queue is not full, now the put above must succeed
6056 // Put g and a batch of work from local runnable queue on global queue.
6057 // Executed only by the owner P.
6058 func runqputslow(pp *p, gp *g, h, t uint32) bool {
6059 var batch [len(pp.runq)/2 + 1]*g
6061 // First, grab a batch from local queue.
6064 if n != uint32(len(pp.runq)/2) {
6065 throw("runqputslow: queue is not full")
6067 for i := uint32(0); i < n; i++ {
6068 batch[i] = pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
6070 if !atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
6075 if randomizeScheduler {
6076 for i := uint32(1); i <= n; i++ {
6077 j := fastrandn(i + 1)
6078 batch[i], batch[j] = batch[j], batch[i]
6082 // Link the goroutines.
6083 for i := uint32(0); i < n; i++ {
6084 batch[i].schedlink.set(batch[i+1])
6087 q.head.set(batch[0])
6088 q.tail.set(batch[n])
6090 // Now put the batch on global queue.
6092 globrunqputbatch(&q, int32(n+1))
6097 // runqputbatch tries to put all the G's on q on the local runnable queue.
6098 // If the queue is full, they are put on the global queue; in that case
6099 // this will temporarily acquire the scheduler lock.
6100 // Executed only by the owner P.
6101 func runqputbatch(pp *p, q *gQueue, qsize int) {
6102 h := atomic.LoadAcq(&pp.runqhead)
6105 for !q.empty() && t-h < uint32(len(pp.runq)) {
6107 pp.runq[t%uint32(len(pp.runq))].set(gp)
6113 if randomizeScheduler {
6114 off := func(o uint32) uint32 {
6115 return (pp.runqtail + o) % uint32(len(pp.runq))
6117 for i := uint32(1); i < n; i++ {
6118 j := fastrandn(i + 1)
6119 pp.runq[off(i)], pp.runq[off(j)] = pp.runq[off(j)], pp.runq[off(i)]
6123 atomic.StoreRel(&pp.runqtail, t)
6126 globrunqputbatch(q, int32(qsize))
6131 // Get g from local runnable queue.
6132 // If inheritTime is true, gp should inherit the remaining time in the
6133 // current time slice. Otherwise, it should start a new time slice.
6134 // Executed only by the owner P.
6135 func runqget(pp *p) (gp *g, inheritTime bool) {
6136 // If there's a runnext, it's the next G to run.
6138 // If the runnext is non-0 and the CAS fails, it could only have been stolen by another P,
6139 // because other Ps can race to set runnext to 0, but only the current P can set it to non-0.
6140 // Hence, there's no need to retry this CAS if it fails.
6141 if next != 0 && pp.runnext.cas(next, 0) {
6142 return next.ptr(), true
6146 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6151 gp := pp.runq[h%uint32(len(pp.runq))].ptr()
6152 if atomic.CasRel(&pp.runqhead, h, h+1) { // cas-release, commits consume
6158 // runqdrain drains the local runnable queue of pp and returns all goroutines in it.
6159 // Executed only by the owner P.
6160 func runqdrain(pp *p) (drainQ gQueue, n uint32) {
6161 oldNext := pp.runnext
6162 if oldNext != 0 && pp.runnext.cas(oldNext, 0) {
6163 drainQ.pushBack(oldNext.ptr())
6168 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6174 if qn > uint32(len(pp.runq)) { // read inconsistent h and t
6178 if !atomic.CasRel(&pp.runqhead, h, h+qn) { // cas-release, commits consume
6182 // We've inverted the order in which it gets G's from the local P's runnable queue
6183 // and then advances the head pointer because we don't want to mess up the statuses of G's
6184 // while runqdrain() and runqsteal() are running in parallel.
6185 // Thus we should advance the head pointer before draining the local P into a gQueue,
6186 // so that we can update any gp.schedlink only after we take the full ownership of G,
6187 // meanwhile, other P's can't access to all G's in local P's runnable queue and steal them.
6188 // See https://groups.google.com/g/golang-dev/c/0pTKxEKhHSc/m/6Q85QjdVBQAJ for more details.
6189 for i := uint32(0); i < qn; i++ {
6190 gp := pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
6197 // Grabs a batch of goroutines from pp's runnable queue into batch.
6198 // Batch is a ring buffer starting at batchHead.
6199 // Returns number of grabbed goroutines.
6200 // Can be executed by any P.
6201 func runqgrab(pp *p, batch *[256]guintptr, batchHead uint32, stealRunNextG bool) uint32 {
6203 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
6204 t := atomic.LoadAcq(&pp.runqtail) // load-acquire, synchronize with the producer
6209 // Try to steal from pp.runnext.
6210 if next := pp.runnext; next != 0 {
6211 if pp.status == _Prunning {
6212 // Sleep to ensure that pp isn't about to run the g
6213 // we are about to steal.
6214 // The important use case here is when the g running
6215 // on pp ready()s another g and then almost
6216 // immediately blocks. Instead of stealing runnext
6217 // in this window, back off to give pp a chance to
6218 // schedule runnext. This will avoid thrashing gs
6219 // between different Ps.
6220 // A sync chan send/recv takes ~50ns as of time of
6221 // writing, so 3us gives ~50x overshoot.
6222 if GOOS != "windows" && GOOS != "openbsd" && GOOS != "netbsd" {
6225 // On some platforms system timer granularity is
6226 // 1-15ms, which is way too much for this
6227 // optimization. So just yield.
6231 if !pp.runnext.cas(next, 0) {
6234 batch[batchHead%uint32(len(batch))] = next
6240 if n > uint32(len(pp.runq)/2) { // read inconsistent h and t
6243 for i := uint32(0); i < n; i++ {
6244 g := pp.runq[(h+i)%uint32(len(pp.runq))]
6245 batch[(batchHead+i)%uint32(len(batch))] = g
6247 if atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
6253 // Steal half of elements from local runnable queue of p2
6254 // and put onto local runnable queue of p.
6255 // Returns one of the stolen elements (or nil if failed).
6256 func runqsteal(pp, p2 *p, stealRunNextG bool) *g {
6258 n := runqgrab(p2, &pp.runq, t, stealRunNextG)
6263 gp := pp.runq[(t+n)%uint32(len(pp.runq))].ptr()
6267 h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
6268 if t-h+n >= uint32(len(pp.runq)) {
6269 throw("runqsteal: runq overflow")
6271 atomic.StoreRel(&pp.runqtail, t+n) // store-release, makes the item available for consumption
6275 // A gQueue is a dequeue of Gs linked through g.schedlink. A G can only
6276 // be on one gQueue or gList at a time.
6277 type gQueue struct {
6282 // empty reports whether q is empty.
6283 func (q *gQueue) empty() bool {
6287 // push adds gp to the head of q.
6288 func (q *gQueue) push(gp *g) {
6289 gp.schedlink = q.head
6296 // pushBack adds gp to the tail of q.
6297 func (q *gQueue) pushBack(gp *g) {
6300 q.tail.ptr().schedlink.set(gp)
6307 // pushBackAll adds all Gs in q2 to the tail of q. After this q2 must
6309 func (q *gQueue) pushBackAll(q2 gQueue) {
6313 q2.tail.ptr().schedlink = 0
6315 q.tail.ptr().schedlink = q2.head
6322 // pop removes and returns the head of queue q. It returns nil if
6324 func (q *gQueue) pop() *g {
6327 q.head = gp.schedlink
6335 // popList takes all Gs in q and returns them as a gList.
6336 func (q *gQueue) popList() gList {
6337 stack := gList{q.head}
6342 // A gList is a list of Gs linked through g.schedlink. A G can only be
6343 // on one gQueue or gList at a time.
6348 // empty reports whether l is empty.
6349 func (l *gList) empty() bool {
6353 // push adds gp to the head of l.
6354 func (l *gList) push(gp *g) {
6355 gp.schedlink = l.head
6359 // pushAll prepends all Gs in q to l.
6360 func (l *gList) pushAll(q gQueue) {
6362 q.tail.ptr().schedlink = l.head
6367 // pop removes and returns the head of l. If l is empty, it returns nil.
6368 func (l *gList) pop() *g {
6371 l.head = gp.schedlink
6376 //go:linkname setMaxThreads runtime/debug.setMaxThreads
6377 func setMaxThreads(in int) (out int) {
6379 out = int(sched.maxmcount)
6380 if in > 0x7fffffff { // MaxInt32
6381 sched.maxmcount = 0x7fffffff
6383 sched.maxmcount = int32(in)
6391 func procPin() int {
6396 return int(mp.p.ptr().id)
6405 //go:linkname sync_runtime_procPin sync.runtime_procPin
6407 func sync_runtime_procPin() int {
6411 //go:linkname sync_runtime_procUnpin sync.runtime_procUnpin
6413 func sync_runtime_procUnpin() {
6417 //go:linkname sync_atomic_runtime_procPin sync/atomic.runtime_procPin
6419 func sync_atomic_runtime_procPin() int {
6423 //go:linkname sync_atomic_runtime_procUnpin sync/atomic.runtime_procUnpin
6425 func sync_atomic_runtime_procUnpin() {
6429 // Active spinning for sync.Mutex.
6431 //go:linkname sync_runtime_canSpin sync.runtime_canSpin
6433 func sync_runtime_canSpin(i int) bool {
6434 // sync.Mutex is cooperative, so we are conservative with spinning.
6435 // Spin only few times and only if running on a multicore machine and
6436 // GOMAXPROCS>1 and there is at least one other running P and local runq is empty.
6437 // As opposed to runtime mutex we don't do passive spinning here,
6438 // because there can be work on global runq or on other Ps.
6439 if i >= active_spin || ncpu <= 1 || gomaxprocs <= sched.npidle.Load()+sched.nmspinning.Load()+1 {
6442 if p := getg().m.p.ptr(); !runqempty(p) {
6448 //go:linkname sync_runtime_doSpin sync.runtime_doSpin
6450 func sync_runtime_doSpin() {
6451 procyield(active_spin_cnt)
6454 var stealOrder randomOrder
6456 // randomOrder/randomEnum are helper types for randomized work stealing.
6457 // They allow to enumerate all Ps in different pseudo-random orders without repetitions.
6458 // The algorithm is based on the fact that if we have X such that X and GOMAXPROCS
6459 // are coprime, then a sequences of (i + X) % GOMAXPROCS gives the required enumeration.
6460 type randomOrder struct {
6465 type randomEnum struct {
6472 func (ord *randomOrder) reset(count uint32) {
6474 ord.coprimes = ord.coprimes[:0]
6475 for i := uint32(1); i <= count; i++ {
6476 if gcd(i, count) == 1 {
6477 ord.coprimes = append(ord.coprimes, i)
6482 func (ord *randomOrder) start(i uint32) randomEnum {
6486 inc: ord.coprimes[i/ord.count%uint32(len(ord.coprimes))],
6490 func (enum *randomEnum) done() bool {
6491 return enum.i == enum.count
6494 func (enum *randomEnum) next() {
6496 enum.pos = (enum.pos + enum.inc) % enum.count
6499 func (enum *randomEnum) position() uint32 {
6503 func gcd(a, b uint32) uint32 {
6510 // An initTask represents the set of initializations that need to be done for a package.
6511 // Keep in sync with ../../test/noinit.go:initTask
6512 type initTask struct {
6513 state uint32 // 0 = uninitialized, 1 = in progress, 2 = done
6515 // followed by nfns pcs, uintptr sized, one per init function to run
6518 // inittrace stores statistics for init functions which are
6519 // updated by malloc and newproc when active is true.
6520 var inittrace tracestat
6522 type tracestat struct {
6523 active bool // init tracing activation status
6524 id uint64 // init goroutine id
6525 allocs uint64 // heap allocations
6526 bytes uint64 // heap allocated bytes
6529 func doInit(ts []*initTask) {
6530 for _, t := range ts {
6535 func doInit1(t *initTask) {
6537 case 2: // fully initialized
6539 case 1: // initialization in progress
6540 throw("recursive call during initialization - linker skew")
6541 default: // not initialized yet
6542 t.state = 1 // initialization in progress
6549 if inittrace.active {
6551 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6556 // We should have pruned all of these in the linker.
6557 throw("inittask with no functions")
6560 firstFunc := add(unsafe.Pointer(t), 8)
6561 for i := uint32(0); i < t.nfns; i++ {
6562 p := add(firstFunc, uintptr(i)*goarch.PtrSize)
6563 f := *(*func())(unsafe.Pointer(&p))
6567 if inittrace.active {
6569 // Load stats non-atomically since tracinit is updated only by this init goroutine.
6572 f := *(*func())(unsafe.Pointer(&firstFunc))
6573 pkg := funcpkgpath(findfunc(abi.FuncPCABIInternal(f)))
6576 print("init ", pkg, " @")
6577 print(string(fmtNSAsMS(sbuf[:], uint64(start-runtimeInitTime))), " ms, ")
6578 print(string(fmtNSAsMS(sbuf[:], uint64(end-start))), " ms clock, ")
6579 print(string(itoa(sbuf[:], after.bytes-before.bytes)), " bytes, ")
6580 print(string(itoa(sbuf[:], after.allocs-before.allocs)), " allocs")
6584 t.state = 2 // initialization done