Source file src/runtime/proc.go

     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.
     4  
     5  package runtime
     6  
     7  import (
     8  	"internal/abi"
     9  	"internal/cpu"
    10  	"internal/goarch"
    11  	"internal/goos"
    12  	"internal/runtime/atomic"
    13  	"internal/runtime/exithook"
    14  	"internal/runtime/sys"
    15  	"internal/stringslite"
    16  	"unsafe"
    17  )
    18  
    19  // set using cmd/go/internal/modload.ModInfoProg
    20  var modinfo string
    21  
    22  // Goroutine scheduler
    23  // The scheduler's job is to distribute ready-to-run goroutines over worker threads.
    24  //
    25  // The main concepts are:
    26  // G - goroutine.
    27  // M - worker thread, or machine.
    28  // P - processor, a resource that is required to execute Go code.
    29  //     M must have an associated P to execute Go code, however it can be
    30  //     blocked or in a syscall w/o an associated P.
    31  //
    32  // Design doc at https://golang.org/s/go11sched.
    33  
    34  // Worker thread parking/unparking.
    35  // We need to balance between keeping enough running worker threads to utilize
    36  // available hardware parallelism and parking excessive running worker threads
    37  // to conserve CPU resources and power. This is not simple for two reasons:
    38  // (1) scheduler state is intentionally distributed (in particular, per-P work
    39  // queues), so it is not possible to compute global predicates on fast paths;
    40  // (2) for optimal thread management we would need to know the future (don't park
    41  // a worker thread when a new goroutine will be readied in near future).
    42  //
    43  // Three rejected approaches that would work badly:
    44  // 1. Centralize all scheduler state (would inhibit scalability).
    45  // 2. Direct goroutine handoff. That is, when we ready a new goroutine and there
    46  //    is a spare P, unpark a thread and handoff it the thread and the goroutine.
    47  //    This would lead to thread state thrashing, as the thread that readied the
    48  //    goroutine can be out of work the very next moment, we will need to park it.
    49  //    Also, it would destroy locality of computation as we want to preserve
    50  //    dependent goroutines on the same thread; and introduce additional latency.
    51  // 3. Unpark an additional thread whenever we ready a goroutine and there is an
    52  //    idle P, but don't do handoff. This would lead to excessive thread parking/
    53  //    unparking as the additional threads will instantly park without discovering
    54  //    any work to do.
    55  //
    56  // The current approach:
    57  //
    58  // This approach applies to three primary sources of potential work: readying a
    59  // goroutine, new/modified-earlier timers, and idle-priority GC. See below for
    60  // additional details.
    61  //
    62  // We unpark an additional thread when we submit work if (this is wakep()):
    63  // 1. There is an idle P, and
    64  // 2. There are no "spinning" worker threads.
    65  //
    66  // A worker thread is considered spinning if it is out of local work and did
    67  // not find work in the global run queue or netpoller; the spinning state is
    68  // denoted in m.spinning and in sched.nmspinning. Threads unparked this way are
    69  // also considered spinning; we don't do goroutine handoff so such threads are
    70  // out of work initially. Spinning threads spin on looking for work in per-P
    71  // run queues and timer heaps or from the GC before parking. If a spinning
    72  // thread finds work it takes itself out of the spinning state and proceeds to
    73  // execution. If it does not find work it takes itself out of the spinning
    74  // state and then parks.
    75  //
    76  // If there is at least one spinning thread (sched.nmspinning>1), we don't
    77  // unpark new threads when submitting work. To compensate for that, if the last
    78  // spinning thread finds work and stops spinning, it must unpark a new spinning
    79  // thread. This approach smooths out unjustified spikes of thread unparking,
    80  // but at the same time guarantees eventual maximal CPU parallelism
    81  // utilization.
    82  //
    83  // The main implementation complication is that we need to be very careful
    84  // during spinning->non-spinning thread transition. This transition can race
    85  // with submission of new work, and either one part or another needs to unpark
    86  // another worker thread. If they both fail to do that, we can end up with
    87  // semi-persistent CPU underutilization.
    88  //
    89  // The general pattern for submission is:
    90  // 1. Submit work to the local or global run queue, timer heap, or GC state.
    91  // 2. #StoreLoad-style memory barrier.
    92  // 3. Check sched.nmspinning.
    93  //
    94  // The general pattern for spinning->non-spinning transition is:
    95  // 1. Decrement nmspinning.
    96  // 2. #StoreLoad-style memory barrier.
    97  // 3. Check all per-P work queues and GC for new work.
    98  //
    99  // Note that all this complexity does not apply to global run queue as we are
   100  // not sloppy about thread unparking when submitting to global queue. Also see
   101  // comments for nmspinning manipulation.
   102  //
   103  // How these different sources of work behave varies, though it doesn't affect
   104  // the synchronization approach:
   105  // * Ready goroutine: this is an obvious source of work; the goroutine is
   106  //   immediately ready and must run on some thread eventually.
   107  // * New/modified-earlier timer: The current timer implementation (see time.go)
   108  //   uses netpoll in a thread with no work available to wait for the soonest
   109  //   timer. If there is no thread waiting, we want a new spinning thread to go
   110  //   wait.
   111  // * Idle-priority GC: The GC wakes a stopped idle thread to contribute to
   112  //   background GC work (note: currently disabled per golang.org/issue/19112).
   113  //   Also see golang.org/issue/44313, as this should be extended to all GC
   114  //   workers.
   115  
   116  var (
   117  	m0           m
   118  	g0           g
   119  	mcache0      *mcache
   120  	raceprocctx0 uintptr
   121  	raceFiniLock mutex
   122  )
   123  
   124  // This slice records the initializing tasks that need to be
   125  // done to start up the runtime. It is built by the linker.
   126  var runtime_inittasks []*initTask
   127  
   128  // main_init_done is a signal used by cgocallbackg that initialization
   129  // has been completed. It is made before _cgo_notify_runtime_init_done,
   130  // so all cgo calls can rely on it existing. When main_init is complete,
   131  // it is closed, meaning cgocallbackg can reliably receive from it.
   132  var main_init_done chan bool
   133  
   134  //go:linkname main_main main.main
   135  func main_main()
   136  
   137  // mainStarted indicates that the main M has started.
   138  var mainStarted bool
   139  
   140  // runtimeInitTime is the nanotime() at which the runtime started.
   141  var runtimeInitTime int64
   142  
   143  // Value to use for signal mask for newly created M's.
   144  var initSigmask sigset
   145  
   146  // The main goroutine.
   147  func main() {
   148  	mp := getg().m
   149  
   150  	// Racectx of m0->g0 is used only as the parent of the main goroutine.
   151  	// It must not be used for anything else.
   152  	mp.g0.racectx = 0
   153  
   154  	// Max stack size is 1 GB on 64-bit, 250 MB on 32-bit.
   155  	// Using decimal instead of binary GB and MB because
   156  	// they look nicer in the stack overflow failure message.
   157  	if goarch.PtrSize == 8 {
   158  		maxstacksize = 1000000000
   159  	} else {
   160  		maxstacksize = 250000000
   161  	}
   162  
   163  	// An upper limit for max stack size. Used to avoid random crashes
   164  	// after calling SetMaxStack and trying to allocate a stack that is too big,
   165  	// since stackalloc works with 32-bit sizes.
   166  	maxstackceiling = 2 * maxstacksize
   167  
   168  	// Allow newproc to start new Ms.
   169  	mainStarted = true
   170  
   171  	if haveSysmon {
   172  		systemstack(func() {
   173  			newm(sysmon, nil, -1)
   174  		})
   175  	}
   176  
   177  	// Lock the main goroutine onto this, the main OS thread,
   178  	// during initialization. Most programs won't care, but a few
   179  	// do require certain calls to be made by the main thread.
   180  	// Those can arrange for main.main to run in the main thread
   181  	// by calling runtime.LockOSThread during initialization
   182  	// to preserve the lock.
   183  	lockOSThread()
   184  
   185  	if mp != &m0 {
   186  		throw("runtime.main not on m0")
   187  	}
   188  
   189  	// Record when the world started.
   190  	// Must be before doInit for tracing init.
   191  	runtimeInitTime = nanotime()
   192  	if runtimeInitTime == 0 {
   193  		throw("nanotime returning zero")
   194  	}
   195  
   196  	if debug.inittrace != 0 {
   197  		inittrace.id = getg().goid
   198  		inittrace.active = true
   199  	}
   200  
   201  	doInit(runtime_inittasks) // Must be before defer.
   202  
   203  	// Defer unlock so that runtime.Goexit during init does the unlock too.
   204  	needUnlock := true
   205  	defer func() {
   206  		if needUnlock {
   207  			unlockOSThread()
   208  		}
   209  	}()
   210  
   211  	gcenable()
   212  
   213  	main_init_done = make(chan bool)
   214  	if iscgo {
   215  		if _cgo_pthread_key_created == nil {
   216  			throw("_cgo_pthread_key_created missing")
   217  		}
   218  
   219  		if _cgo_thread_start == nil {
   220  			throw("_cgo_thread_start missing")
   221  		}
   222  		if GOOS != "windows" {
   223  			if _cgo_setenv == nil {
   224  				throw("_cgo_setenv missing")
   225  			}
   226  			if _cgo_unsetenv == nil {
   227  				throw("_cgo_unsetenv missing")
   228  			}
   229  		}
   230  		if _cgo_notify_runtime_init_done == nil {
   231  			throw("_cgo_notify_runtime_init_done missing")
   232  		}
   233  
   234  		// Set the x_crosscall2_ptr C function pointer variable point to crosscall2.
   235  		if set_crosscall2 == nil {
   236  			throw("set_crosscall2 missing")
   237  		}
   238  		set_crosscall2()
   239  
   240  		// Start the template thread in case we enter Go from
   241  		// a C-created thread and need to create a new thread.
   242  		startTemplateThread()
   243  		cgocall(_cgo_notify_runtime_init_done, nil)
   244  	}
   245  
   246  	// Run the initializing tasks. Depending on build mode this
   247  	// list can arrive a few different ways, but it will always
   248  	// contain the init tasks computed by the linker for all the
   249  	// packages in the program (excluding those added at runtime
   250  	// by package plugin). Run through the modules in dependency
   251  	// order (the order they are initialized by the dynamic
   252  	// loader, i.e. they are added to the moduledata linked list).
   253  	for m := &firstmoduledata; m != nil; m = m.next {
   254  		doInit(m.inittasks)
   255  	}
   256  
   257  	// Disable init tracing after main init done to avoid overhead
   258  	// of collecting statistics in malloc and newproc
   259  	inittrace.active = false
   260  
   261  	close(main_init_done)
   262  
   263  	needUnlock = false
   264  	unlockOSThread()
   265  
   266  	if isarchive || islibrary {
   267  		// A program compiled with -buildmode=c-archive or c-shared
   268  		// has a main, but it is not executed.
   269  		if GOARCH == "wasm" {
   270  			// On Wasm, pause makes it return to the host.
   271  			// Unlike cgo callbacks where Ms are created on demand,
   272  			// on Wasm we have only one M. So we keep this M (and this
   273  			// G) for callbacks.
   274  			// Using the caller's SP unwinds this frame and backs to
   275  			// goexit. The -16 is: 8 for goexit's (fake) return PC,
   276  			// and pause's epilogue pops 8.
   277  			pause(sys.GetCallerSP() - 16) // should not return
   278  			panic("unreachable")
   279  		}
   280  		return
   281  	}
   282  	fn := main_main // make an indirect call, as the linker doesn't know the address of the main package when laying down the runtime
   283  	fn()
   284  
   285  	exitHooksRun := false
   286  	if raceenabled {
   287  		runExitHooks(0) // run hooks now, since racefini does not return
   288  		exitHooksRun = true
   289  		racefini()
   290  	}
   291  
   292  	// Check for C memory leaks if using ASAN and we've made cgo calls,
   293  	// or if we are running as a library in a C program.
   294  	// We always make one cgo call, above, to notify_runtime_init_done,
   295  	// so we ignore that one.
   296  	// No point in leak checking if no cgo calls, since leak checking
   297  	// just looks for objects allocated using malloc and friends.
   298  	// Just checking iscgo doesn't help because asan implies iscgo.
   299  	if asanenabled && (isarchive || islibrary || NumCgoCall() > 1) {
   300  		runExitHooks(0) // lsandoleakcheck may not return
   301  		exitHooksRun = true
   302  		lsandoleakcheck()
   303  	}
   304  
   305  	// Make racy client program work: if panicking on
   306  	// another goroutine at the same time as main returns,
   307  	// let the other goroutine finish printing the panic trace.
   308  	// Once it does, it will exit. See issues 3934 and 20018.
   309  	if runningPanicDefers.Load() != 0 {
   310  		// Running deferred functions should not take long.
   311  		for c := 0; c < 1000; c++ {
   312  			if runningPanicDefers.Load() == 0 {
   313  				break
   314  			}
   315  			Gosched()
   316  		}
   317  	}
   318  	if panicking.Load() != 0 {
   319  		gopark(nil, nil, waitReasonPanicWait, traceBlockForever, 1)
   320  	}
   321  	if !exitHooksRun {
   322  		runExitHooks(0)
   323  	}
   324  
   325  	exit(0)
   326  	for {
   327  		var x *int32
   328  		*x = 0
   329  	}
   330  }
   331  
   332  // os_beforeExit is called from os.Exit(0).
   333  //
   334  //go:linkname os_beforeExit os.runtime_beforeExit
   335  func os_beforeExit(exitCode int) {
   336  	runExitHooks(exitCode)
   337  	if exitCode == 0 && raceenabled {
   338  		racefini()
   339  	}
   340  
   341  	// See comment in main, above.
   342  	if exitCode == 0 && asanenabled && (isarchive || islibrary || NumCgoCall() > 1) {
   343  		lsandoleakcheck()
   344  	}
   345  }
   346  
   347  func init() {
   348  	exithook.Gosched = Gosched
   349  	exithook.Goid = func() uint64 { return getg().goid }
   350  	exithook.Throw = throw
   351  }
   352  
   353  func runExitHooks(code int) {
   354  	exithook.Run(code)
   355  }
   356  
   357  // start forcegc helper goroutine
   358  func init() {
   359  	go forcegchelper()
   360  }
   361  
   362  func forcegchelper() {
   363  	forcegc.g = getg()
   364  	lockInit(&forcegc.lock, lockRankForcegc)
   365  	for {
   366  		lock(&forcegc.lock)
   367  		if forcegc.idle.Load() {
   368  			throw("forcegc: phase error")
   369  		}
   370  		forcegc.idle.Store(true)
   371  		goparkunlock(&forcegc.lock, waitReasonForceGCIdle, traceBlockSystemGoroutine, 1)
   372  		// this goroutine is explicitly resumed by sysmon
   373  		if debug.gctrace > 0 {
   374  			println("GC forced")
   375  		}
   376  		// Time-triggered, fully concurrent.
   377  		gcStart(gcTrigger{kind: gcTriggerTime, now: nanotime()})
   378  	}
   379  }
   380  
   381  // Gosched yields the processor, allowing other goroutines to run. It does not
   382  // suspend the current goroutine, so execution resumes automatically.
   383  //
   384  //go:nosplit
   385  func Gosched() {
   386  	checkTimeouts()
   387  	mcall(gosched_m)
   388  }
   389  
   390  // goschedguarded yields the processor like gosched, but also checks
   391  // for forbidden states and opts out of the yield in those cases.
   392  //
   393  //go:nosplit
   394  func goschedguarded() {
   395  	mcall(goschedguarded_m)
   396  }
   397  
   398  // goschedIfBusy yields the processor like gosched, but only does so if
   399  // there are no idle Ps or if we're on the only P and there's nothing in
   400  // the run queue. In both cases, there is freely available idle time.
   401  //
   402  //go:nosplit
   403  func goschedIfBusy() {
   404  	gp := getg()
   405  	// Call gosched if gp.preempt is set; we may be in a tight loop that
   406  	// doesn't otherwise yield.
   407  	if !gp.preempt && sched.npidle.Load() > 0 {
   408  		return
   409  	}
   410  	mcall(gosched_m)
   411  }
   412  
   413  // Puts the current goroutine into a waiting state and calls unlockf on the
   414  // system stack.
   415  //
   416  // If unlockf returns false, the goroutine is resumed.
   417  //
   418  // unlockf must not access this G's stack, as it may be moved between
   419  // the call to gopark and the call to unlockf.
   420  //
   421  // Note that because unlockf is called after putting the G into a waiting
   422  // state, the G may have already been readied by the time unlockf is called
   423  // unless there is external synchronization preventing the G from being
   424  // readied. If unlockf returns false, it must guarantee that the G cannot be
   425  // externally readied.
   426  //
   427  // Reason explains why the goroutine has been parked. It is displayed in stack
   428  // traces and heap dumps. Reasons should be unique and descriptive. Do not
   429  // re-use reasons, add new ones.
   430  //
   431  // gopark should be an internal detail,
   432  // but widely used packages access it using linkname.
   433  // Notable members of the hall of shame include:
   434  //   - gvisor.dev/gvisor
   435  //   - github.com/sagernet/gvisor
   436  //
   437  // Do not remove or change the type signature.
   438  // See go.dev/issue/67401.
   439  //
   440  //go:linkname gopark
   441  func gopark(unlockf func(*g, unsafe.Pointer) bool, lock unsafe.Pointer, reason waitReason, traceReason traceBlockReason, traceskip int) {
   442  	if reason != waitReasonSleep {
   443  		checkTimeouts() // timeouts may expire while two goroutines keep the scheduler busy
   444  	}
   445  	mp := acquirem()
   446  	gp := mp.curg
   447  	status := readgstatus(gp)
   448  	if status != _Grunning && status != _Gscanrunning {
   449  		throw("gopark: bad g status")
   450  	}
   451  	mp.waitlock = lock
   452  	mp.waitunlockf = unlockf
   453  	gp.waitreason = reason
   454  	mp.waitTraceBlockReason = traceReason
   455  	mp.waitTraceSkip = traceskip
   456  	releasem(mp)
   457  	// can't do anything that might move the G between Ms here.
   458  	mcall(park_m)
   459  }
   460  
   461  // Puts the current goroutine into a waiting state and unlocks the lock.
   462  // The goroutine can be made runnable again by calling goready(gp).
   463  func goparkunlock(lock *mutex, reason waitReason, traceReason traceBlockReason, traceskip int) {
   464  	gopark(parkunlock_c, unsafe.Pointer(lock), reason, traceReason, traceskip)
   465  }
   466  
   467  // goready should be an internal detail,
   468  // but widely used packages access it using linkname.
   469  // Notable members of the hall of shame include:
   470  //   - gvisor.dev/gvisor
   471  //   - github.com/sagernet/gvisor
   472  //
   473  // Do not remove or change the type signature.
   474  // See go.dev/issue/67401.
   475  //
   476  //go:linkname goready
   477  func goready(gp *g, traceskip int) {
   478  	systemstack(func() {
   479  		ready(gp, traceskip, true)
   480  	})
   481  }
   482  
   483  //go:nosplit
   484  func acquireSudog() *sudog {
   485  	// Delicate dance: the semaphore implementation calls
   486  	// acquireSudog, acquireSudog calls new(sudog),
   487  	// new calls malloc, malloc can call the garbage collector,
   488  	// and the garbage collector calls the semaphore implementation
   489  	// in stopTheWorld.
   490  	// Break the cycle by doing acquirem/releasem around new(sudog).
   491  	// The acquirem/releasem increments m.locks during new(sudog),
   492  	// which keeps the garbage collector from being invoked.
   493  	mp := acquirem()
   494  	pp := mp.p.ptr()
   495  	if len(pp.sudogcache) == 0 {
   496  		lock(&sched.sudoglock)
   497  		// First, try to grab a batch from central cache.
   498  		for len(pp.sudogcache) < cap(pp.sudogcache)/2 && sched.sudogcache != nil {
   499  			s := sched.sudogcache
   500  			sched.sudogcache = s.next
   501  			s.next = nil
   502  			pp.sudogcache = append(pp.sudogcache, s)
   503  		}
   504  		unlock(&sched.sudoglock)
   505  		// If the central cache is empty, allocate a new one.
   506  		if len(pp.sudogcache) == 0 {
   507  			pp.sudogcache = append(pp.sudogcache, new(sudog))
   508  		}
   509  	}
   510  	n := len(pp.sudogcache)
   511  	s := pp.sudogcache[n-1]
   512  	pp.sudogcache[n-1] = nil
   513  	pp.sudogcache = pp.sudogcache[:n-1]
   514  	if s.elem != nil {
   515  		throw("acquireSudog: found s.elem != nil in cache")
   516  	}
   517  	releasem(mp)
   518  	return s
   519  }
   520  
   521  //go:nosplit
   522  func releaseSudog(s *sudog) {
   523  	if s.elem != nil {
   524  		throw("runtime: sudog with non-nil elem")
   525  	}
   526  	if s.isSelect {
   527  		throw("runtime: sudog with non-false isSelect")
   528  	}
   529  	if s.next != nil {
   530  		throw("runtime: sudog with non-nil next")
   531  	}
   532  	if s.prev != nil {
   533  		throw("runtime: sudog with non-nil prev")
   534  	}
   535  	if s.waitlink != nil {
   536  		throw("runtime: sudog with non-nil waitlink")
   537  	}
   538  	if s.c != nil {
   539  		throw("runtime: sudog with non-nil c")
   540  	}
   541  	gp := getg()
   542  	if gp.param != nil {
   543  		throw("runtime: releaseSudog with non-nil gp.param")
   544  	}
   545  	mp := acquirem() // avoid rescheduling to another P
   546  	pp := mp.p.ptr()
   547  	if len(pp.sudogcache) == cap(pp.sudogcache) {
   548  		// Transfer half of local cache to the central cache.
   549  		var first, last *sudog
   550  		for len(pp.sudogcache) > cap(pp.sudogcache)/2 {
   551  			n := len(pp.sudogcache)
   552  			p := pp.sudogcache[n-1]
   553  			pp.sudogcache[n-1] = nil
   554  			pp.sudogcache = pp.sudogcache[:n-1]
   555  			if first == nil {
   556  				first = p
   557  			} else {
   558  				last.next = p
   559  			}
   560  			last = p
   561  		}
   562  		lock(&sched.sudoglock)
   563  		last.next = sched.sudogcache
   564  		sched.sudogcache = first
   565  		unlock(&sched.sudoglock)
   566  	}
   567  	pp.sudogcache = append(pp.sudogcache, s)
   568  	releasem(mp)
   569  }
   570  
   571  // called from assembly.
   572  func badmcall(fn func(*g)) {
   573  	throw("runtime: mcall called on m->g0 stack")
   574  }
   575  
   576  func badmcall2(fn func(*g)) {
   577  	throw("runtime: mcall function returned")
   578  }
   579  
   580  func badreflectcall() {
   581  	panic(plainError("arg size to reflect.call more than 1GB"))
   582  }
   583  
   584  //go:nosplit
   585  //go:nowritebarrierrec
   586  func badmorestackg0() {
   587  	if !crashStackImplemented {
   588  		writeErrStr("fatal: morestack on g0\n")
   589  		return
   590  	}
   591  
   592  	g := getg()
   593  	switchToCrashStack(func() {
   594  		print("runtime: morestack on g0, stack [", hex(g.stack.lo), " ", hex(g.stack.hi), "], sp=", hex(g.sched.sp), ", called from\n")
   595  		g.m.traceback = 2 // include pc and sp in stack trace
   596  		traceback1(g.sched.pc, g.sched.sp, g.sched.lr, g, 0)
   597  		print("\n")
   598  
   599  		throw("morestack on g0")
   600  	})
   601  }
   602  
   603  //go:nosplit
   604  //go:nowritebarrierrec
   605  func badmorestackgsignal() {
   606  	writeErrStr("fatal: morestack on gsignal\n")
   607  }
   608  
   609  //go:nosplit
   610  func badctxt() {
   611  	throw("ctxt != 0")
   612  }
   613  
   614  // gcrash is a fake g that can be used when crashing due to bad
   615  // stack conditions.
   616  var gcrash g
   617  
   618  var crashingG atomic.Pointer[g]
   619  
   620  // Switch to crashstack and call fn, with special handling of
   621  // concurrent and recursive cases.
   622  //
   623  // Nosplit as it is called in a bad stack condition (we know
   624  // morestack would fail).
   625  //
   626  //go:nosplit
   627  //go:nowritebarrierrec
   628  func switchToCrashStack(fn func()) {
   629  	me := getg()
   630  	if crashingG.CompareAndSwapNoWB(nil, me) {
   631  		switchToCrashStack0(fn) // should never return
   632  		abort()
   633  	}
   634  	if crashingG.Load() == me {
   635  		// recursive crashing. too bad.
   636  		writeErrStr("fatal: recursive switchToCrashStack\n")
   637  		abort()
   638  	}
   639  	// Another g is crashing. Give it some time, hopefully it will finish traceback.
   640  	usleep_no_g(100)
   641  	writeErrStr("fatal: concurrent switchToCrashStack\n")
   642  	abort()
   643  }
   644  
   645  // Disable crash stack on Windows for now. Apparently, throwing an exception
   646  // on a non-system-allocated crash stack causes EXCEPTION_STACK_OVERFLOW and
   647  // hangs the process (see issue 63938).
   648  const crashStackImplemented = GOOS != "windows"
   649  
   650  //go:noescape
   651  func switchToCrashStack0(fn func()) // in assembly
   652  
   653  func lockedOSThread() bool {
   654  	gp := getg()
   655  	return gp.lockedm != 0 && gp.m.lockedg != 0
   656  }
   657  
   658  var (
   659  	// allgs contains all Gs ever created (including dead Gs), and thus
   660  	// never shrinks.
   661  	//
   662  	// Access via the slice is protected by allglock or stop-the-world.
   663  	// Readers that cannot take the lock may (carefully!) use the atomic
   664  	// variables below.
   665  	allglock mutex
   666  	allgs    []*g
   667  
   668  	// allglen and allgptr are atomic variables that contain len(allgs) and
   669  	// &allgs[0] respectively. Proper ordering depends on totally-ordered
   670  	// loads and stores. Writes are protected by allglock.
   671  	//
   672  	// allgptr is updated before allglen. Readers should read allglen
   673  	// before allgptr to ensure that allglen is always <= len(allgptr). New
   674  	// Gs appended during the race can be missed. For a consistent view of
   675  	// all Gs, allglock must be held.
   676  	//
   677  	// allgptr copies should always be stored as a concrete type or
   678  	// unsafe.Pointer, not uintptr, to ensure that GC can still reach it
   679  	// even if it points to a stale array.
   680  	allglen uintptr
   681  	allgptr **g
   682  )
   683  
   684  func allgadd(gp *g) {
   685  	if readgstatus(gp) == _Gidle {
   686  		throw("allgadd: bad status Gidle")
   687  	}
   688  
   689  	lock(&allglock)
   690  	allgs = append(allgs, gp)
   691  	if &allgs[0] != allgptr {
   692  		atomicstorep(unsafe.Pointer(&allgptr), unsafe.Pointer(&allgs[0]))
   693  	}
   694  	atomic.Storeuintptr(&allglen, uintptr(len(allgs)))
   695  	unlock(&allglock)
   696  }
   697  
   698  // allGsSnapshot returns a snapshot of the slice of all Gs.
   699  //
   700  // The world must be stopped or allglock must be held.
   701  func allGsSnapshot() []*g {
   702  	assertWorldStoppedOrLockHeld(&allglock)
   703  
   704  	// Because the world is stopped or allglock is held, allgadd
   705  	// cannot happen concurrently with this. allgs grows
   706  	// monotonically and existing entries never change, so we can
   707  	// simply return a copy of the slice header. For added safety,
   708  	// we trim everything past len because that can still change.
   709  	return allgs[:len(allgs):len(allgs)]
   710  }
   711  
   712  // atomicAllG returns &allgs[0] and len(allgs) for use with atomicAllGIndex.
   713  func atomicAllG() (**g, uintptr) {
   714  	length := atomic.Loaduintptr(&allglen)
   715  	ptr := (**g)(atomic.Loadp(unsafe.Pointer(&allgptr)))
   716  	return ptr, length
   717  }
   718  
   719  // atomicAllGIndex returns ptr[i] with the allgptr returned from atomicAllG.
   720  func atomicAllGIndex(ptr **g, i uintptr) *g {
   721  	return *(**g)(add(unsafe.Pointer(ptr), i*goarch.PtrSize))
   722  }
   723  
   724  // forEachG calls fn on every G from allgs.
   725  //
   726  // forEachG takes a lock to exclude concurrent addition of new Gs.
   727  func forEachG(fn func(gp *g)) {
   728  	lock(&allglock)
   729  	for _, gp := range allgs {
   730  		fn(gp)
   731  	}
   732  	unlock(&allglock)
   733  }
   734  
   735  // forEachGRace calls fn on every G from allgs.
   736  //
   737  // forEachGRace avoids locking, but does not exclude addition of new Gs during
   738  // execution, which may be missed.
   739  func forEachGRace(fn func(gp *g)) {
   740  	ptr, length := atomicAllG()
   741  	for i := uintptr(0); i < length; i++ {
   742  		gp := atomicAllGIndex(ptr, i)
   743  		fn(gp)
   744  	}
   745  	return
   746  }
   747  
   748  const (
   749  	// Number of goroutine ids to grab from sched.goidgen to local per-P cache at once.
   750  	// 16 seems to provide enough amortization, but other than that it's mostly arbitrary number.
   751  	_GoidCacheBatch = 16
   752  )
   753  
   754  // cpuinit sets up CPU feature flags and calls internal/cpu.Initialize. env should be the complete
   755  // value of the GODEBUG environment variable.
   756  func cpuinit(env string) {
   757  	switch GOOS {
   758  	case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
   759  		cpu.DebugOptions = true
   760  	}
   761  	cpu.Initialize(env)
   762  
   763  	// Support cpu feature variables are used in code generated by the compiler
   764  	// to guard execution of instructions that can not be assumed to be always supported.
   765  	switch GOARCH {
   766  	case "386", "amd64":
   767  		x86HasPOPCNT = cpu.X86.HasPOPCNT
   768  		x86HasSSE41 = cpu.X86.HasSSE41
   769  		x86HasFMA = cpu.X86.HasFMA
   770  
   771  	case "arm":
   772  		armHasVFPv4 = cpu.ARM.HasVFPv4
   773  
   774  	case "arm64":
   775  		arm64HasATOMICS = cpu.ARM64.HasATOMICS
   776  
   777  	case "loong64":
   778  		loong64HasLAMCAS = cpu.Loong64.HasLAMCAS
   779  		loong64HasLAM_BH = cpu.Loong64.HasLAM_BH
   780  		loong64HasLSX = cpu.Loong64.HasLSX
   781  	}
   782  }
   783  
   784  // getGodebugEarly extracts the environment variable GODEBUG from the environment on
   785  // Unix-like operating systems and returns it. This function exists to extract GODEBUG
   786  // early before much of the runtime is initialized.
   787  func getGodebugEarly() string {
   788  	const prefix = "GODEBUG="
   789  	var env string
   790  	switch GOOS {
   791  	case "aix", "darwin", "ios", "dragonfly", "freebsd", "netbsd", "openbsd", "illumos", "solaris", "linux":
   792  		// Similar to goenv_unix but extracts the environment value for
   793  		// GODEBUG directly.
   794  		// TODO(moehrmann): remove when general goenvs() can be called before cpuinit()
   795  		n := int32(0)
   796  		for argv_index(argv, argc+1+n) != nil {
   797  			n++
   798  		}
   799  
   800  		for i := int32(0); i < n; i++ {
   801  			p := argv_index(argv, argc+1+i)
   802  			s := unsafe.String(p, findnull(p))
   803  
   804  			if stringslite.HasPrefix(s, prefix) {
   805  				env = gostring(p)[len(prefix):]
   806  				break
   807  			}
   808  		}
   809  	}
   810  	return env
   811  }
   812  
   813  // The bootstrap sequence is:
   814  //
   815  //	call osinit
   816  //	call schedinit
   817  //	make & queue new G
   818  //	call runtime·mstart
   819  //
   820  // The new G calls runtime·main.
   821  func schedinit() {
   822  	lockInit(&sched.lock, lockRankSched)
   823  	lockInit(&sched.sysmonlock, lockRankSysmon)
   824  	lockInit(&sched.deferlock, lockRankDefer)
   825  	lockInit(&sched.sudoglock, lockRankSudog)
   826  	lockInit(&deadlock, lockRankDeadlock)
   827  	lockInit(&paniclk, lockRankPanic)
   828  	lockInit(&allglock, lockRankAllg)
   829  	lockInit(&allpLock, lockRankAllp)
   830  	lockInit(&reflectOffs.lock, lockRankReflectOffs)
   831  	lockInit(&finlock, lockRankFin)
   832  	lockInit(&cpuprof.lock, lockRankCpuprof)
   833  	allocmLock.init(lockRankAllocmR, lockRankAllocmRInternal, lockRankAllocmW)
   834  	execLock.init(lockRankExecR, lockRankExecRInternal, lockRankExecW)
   835  	traceLockInit()
   836  	// Enforce that this lock is always a leaf lock.
   837  	// All of this lock's critical sections should be
   838  	// extremely short.
   839  	lockInit(&memstats.heapStats.noPLock, lockRankLeafRank)
   840  
   841  	lockVerifyMSize()
   842  
   843  	// raceinit must be the first call to race detector.
   844  	// In particular, it must be done before mallocinit below calls racemapshadow.
   845  	gp := getg()
   846  	if raceenabled {
   847  		gp.racectx, raceprocctx0 = raceinit()
   848  	}
   849  
   850  	sched.maxmcount = 10000
   851  	crashFD.Store(^uintptr(0))
   852  
   853  	// The world starts stopped.
   854  	worldStopped()
   855  
   856  	ticks.init() // run as early as possible
   857  	moduledataverify()
   858  	stackinit()
   859  	mallocinit()
   860  	godebug := getGodebugEarly()
   861  	cpuinit(godebug) // must run before alginit
   862  	randinit()       // must run before alginit, mcommoninit
   863  	alginit()        // maps, hash, rand must not be used before this call
   864  	mcommoninit(gp.m, -1)
   865  	modulesinit()   // provides activeModules
   866  	typelinksinit() // uses maps, activeModules
   867  	itabsinit()     // uses activeModules
   868  	stkobjinit()    // must run before GC starts
   869  
   870  	sigsave(&gp.m.sigmask)
   871  	initSigmask = gp.m.sigmask
   872  
   873  	goargs()
   874  	goenvs()
   875  	secure()
   876  	checkfds()
   877  	parsedebugvars()
   878  	gcinit()
   879  
   880  	// Allocate stack space that can be used when crashing due to bad stack
   881  	// conditions, e.g. morestack on g0.
   882  	gcrash.stack = stackalloc(16384)
   883  	gcrash.stackguard0 = gcrash.stack.lo + 1000
   884  	gcrash.stackguard1 = gcrash.stack.lo + 1000
   885  
   886  	// if disableMemoryProfiling is set, update MemProfileRate to 0 to turn off memprofile.
   887  	// Note: parsedebugvars may update MemProfileRate, but when disableMemoryProfiling is
   888  	// set to true by the linker, it means that nothing is consuming the profile, it is
   889  	// safe to set MemProfileRate to 0.
   890  	if disableMemoryProfiling {
   891  		MemProfileRate = 0
   892  	}
   893  
   894  	// mcommoninit runs before parsedebugvars, so init profstacks again.
   895  	mProfStackInit(gp.m)
   896  
   897  	lock(&sched.lock)
   898  	sched.lastpoll.Store(nanotime())
   899  	procs := ncpu
   900  	if n, ok := atoi32(gogetenv("GOMAXPROCS")); ok && n > 0 {
   901  		procs = n
   902  	}
   903  	if procresize(procs) != nil {
   904  		throw("unknown runnable goroutine during bootstrap")
   905  	}
   906  	unlock(&sched.lock)
   907  
   908  	// World is effectively started now, as P's can run.
   909  	worldStarted()
   910  
   911  	if buildVersion == "" {
   912  		// Condition should never trigger. This code just serves
   913  		// to ensure runtime·buildVersion is kept in the resulting binary.
   914  		buildVersion = "unknown"
   915  	}
   916  	if len(modinfo) == 1 {
   917  		// Condition should never trigger. This code just serves
   918  		// to ensure runtime·modinfo is kept in the resulting binary.
   919  		modinfo = ""
   920  	}
   921  }
   922  
   923  func dumpgstatus(gp *g) {
   924  	thisg := getg()
   925  	print("runtime:   gp: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
   926  	print("runtime: getg:  g=", thisg, ", goid=", thisg.goid, ",  g->atomicstatus=", readgstatus(thisg), "\n")
   927  }
   928  
   929  // sched.lock must be held.
   930  func checkmcount() {
   931  	assertLockHeld(&sched.lock)
   932  
   933  	// Exclude extra M's, which are used for cgocallback from threads
   934  	// created in C.
   935  	//
   936  	// The purpose of the SetMaxThreads limit is to avoid accidental fork
   937  	// bomb from something like millions of goroutines blocking on system
   938  	// calls, causing the runtime to create millions of threads. By
   939  	// definition, this isn't a problem for threads created in C, so we
   940  	// exclude them from the limit. See https://go.dev/issue/60004.
   941  	count := mcount() - int32(extraMInUse.Load()) - int32(extraMLength.Load())
   942  	if count > sched.maxmcount {
   943  		print("runtime: program exceeds ", sched.maxmcount, "-thread limit\n")
   944  		throw("thread exhaustion")
   945  	}
   946  }
   947  
   948  // mReserveID returns the next ID to use for a new m. This new m is immediately
   949  // considered 'running' by checkdead.
   950  //
   951  // sched.lock must be held.
   952  func mReserveID() int64 {
   953  	assertLockHeld(&sched.lock)
   954  
   955  	if sched.mnext+1 < sched.mnext {
   956  		throw("runtime: thread ID overflow")
   957  	}
   958  	id := sched.mnext
   959  	sched.mnext++
   960  	checkmcount()
   961  	return id
   962  }
   963  
   964  // Pre-allocated ID may be passed as 'id', or omitted by passing -1.
   965  func mcommoninit(mp *m, id int64) {
   966  	gp := getg()
   967  
   968  	// g0 stack won't make sense for user (and is not necessary unwindable).
   969  	if gp != gp.m.g0 {
   970  		callers(1, mp.createstack[:])
   971  	}
   972  
   973  	lock(&sched.lock)
   974  
   975  	if id >= 0 {
   976  		mp.id = id
   977  	} else {
   978  		mp.id = mReserveID()
   979  	}
   980  
   981  	mrandinit(mp)
   982  
   983  	mpreinit(mp)
   984  	if mp.gsignal != nil {
   985  		mp.gsignal.stackguard1 = mp.gsignal.stack.lo + stackGuard
   986  	}
   987  
   988  	// Add to allm so garbage collector doesn't free g->m
   989  	// when it is just in a register or thread-local storage.
   990  	mp.alllink = allm
   991  
   992  	// NumCgoCall() and others iterate over allm w/o schedlock,
   993  	// so we need to publish it safely.
   994  	atomicstorep(unsafe.Pointer(&allm), unsafe.Pointer(mp))
   995  	unlock(&sched.lock)
   996  
   997  	// Allocate memory to hold a cgo traceback if the cgo call crashes.
   998  	if iscgo || GOOS == "solaris" || GOOS == "illumos" || GOOS == "windows" {
   999  		mp.cgoCallers = new(cgoCallers)
  1000  	}
  1001  	mProfStackInit(mp)
  1002  }
  1003  
  1004  // mProfStackInit is used to eagerly initialize stack trace buffers for
  1005  // profiling. Lazy allocation would have to deal with reentrancy issues in
  1006  // malloc and runtime locks for mLockProfile.
  1007  // TODO(mknyszek): Implement lazy allocation if this becomes a problem.
  1008  func mProfStackInit(mp *m) {
  1009  	if debug.profstackdepth == 0 {
  1010  		// debug.profstack is set to 0 by the user, or we're being called from
  1011  		// schedinit before parsedebugvars.
  1012  		return
  1013  	}
  1014  	mp.profStack = makeProfStackFP()
  1015  	mp.mLockProfile.stack = makeProfStackFP()
  1016  }
  1017  
  1018  // makeProfStackFP creates a buffer large enough to hold a maximum-sized stack
  1019  // trace as well as any additional frames needed for frame pointer unwinding
  1020  // with delayed inline expansion.
  1021  func makeProfStackFP() []uintptr {
  1022  	// The "1" term is to account for the first stack entry being
  1023  	// taken up by a "skip" sentinel value for profilers which
  1024  	// defer inline frame expansion until the profile is reported.
  1025  	// The "maxSkip" term is for frame pointer unwinding, where we
  1026  	// want to end up with debug.profstackdebth frames but will discard
  1027  	// some "physical" frames to account for skipping.
  1028  	return make([]uintptr, 1+maxSkip+debug.profstackdepth)
  1029  }
  1030  
  1031  // makeProfStack returns a buffer large enough to hold a maximum-sized stack
  1032  // trace.
  1033  func makeProfStack() []uintptr { return make([]uintptr, debug.profstackdepth) }
  1034  
  1035  //go:linkname pprof_makeProfStack
  1036  func pprof_makeProfStack() []uintptr { return makeProfStack() }
  1037  
  1038  func (mp *m) becomeSpinning() {
  1039  	mp.spinning = true
  1040  	sched.nmspinning.Add(1)
  1041  	sched.needspinning.Store(0)
  1042  }
  1043  
  1044  func (mp *m) hasCgoOnStack() bool {
  1045  	return mp.ncgo > 0 || mp.isextra
  1046  }
  1047  
  1048  const (
  1049  	// osHasLowResTimer indicates that the platform's internal timer system has a low resolution,
  1050  	// typically on the order of 1 ms or more.
  1051  	osHasLowResTimer = GOOS == "windows" || GOOS == "openbsd" || GOOS == "netbsd"
  1052  
  1053  	// osHasLowResClockInt is osHasLowResClock but in integer form, so it can be used to create
  1054  	// constants conditionally.
  1055  	osHasLowResClockInt = goos.IsWindows
  1056  
  1057  	// osHasLowResClock indicates that timestamps produced by nanotime on the platform have a
  1058  	// low resolution, typically on the order of 1 ms or more.
  1059  	osHasLowResClock = osHasLowResClockInt > 0
  1060  )
  1061  
  1062  // Mark gp ready to run.
  1063  func ready(gp *g, traceskip int, next bool) {
  1064  	status := readgstatus(gp)
  1065  
  1066  	// Mark runnable.
  1067  	mp := acquirem() // disable preemption because it can be holding p in a local var
  1068  	if status&^_Gscan != _Gwaiting {
  1069  		dumpgstatus(gp)
  1070  		throw("bad g->status in ready")
  1071  	}
  1072  
  1073  	// status is Gwaiting or Gscanwaiting, make Grunnable and put on runq
  1074  	trace := traceAcquire()
  1075  	casgstatus(gp, _Gwaiting, _Grunnable)
  1076  	if trace.ok() {
  1077  		trace.GoUnpark(gp, traceskip)
  1078  		traceRelease(trace)
  1079  	}
  1080  	runqput(mp.p.ptr(), gp, next)
  1081  	wakep()
  1082  	releasem(mp)
  1083  }
  1084  
  1085  // freezeStopWait is a large value that freezetheworld sets
  1086  // sched.stopwait to in order to request that all Gs permanently stop.
  1087  const freezeStopWait = 0x7fffffff
  1088  
  1089  // freezing is set to non-zero if the runtime is trying to freeze the
  1090  // world.
  1091  var freezing atomic.Bool
  1092  
  1093  // Similar to stopTheWorld but best-effort and can be called several times.
  1094  // There is no reverse operation, used during crashing.
  1095  // This function must not lock any mutexes.
  1096  func freezetheworld() {
  1097  	freezing.Store(true)
  1098  	if debug.dontfreezetheworld > 0 {
  1099  		// Don't prempt Ps to stop goroutines. That will perturb
  1100  		// scheduler state, making debugging more difficult. Instead,
  1101  		// allow goroutines to continue execution.
  1102  		//
  1103  		// fatalpanic will tracebackothers to trace all goroutines. It
  1104  		// is unsafe to trace a running goroutine, so tracebackothers
  1105  		// will skip running goroutines. That is OK and expected, we
  1106  		// expect users of dontfreezetheworld to use core files anyway.
  1107  		//
  1108  		// However, allowing the scheduler to continue running free
  1109  		// introduces a race: a goroutine may be stopped when
  1110  		// tracebackothers checks its status, and then start running
  1111  		// later when we are in the middle of traceback, potentially
  1112  		// causing a crash.
  1113  		//
  1114  		// To mitigate this, when an M naturally enters the scheduler,
  1115  		// schedule checks if freezing is set and if so stops
  1116  		// execution. This guarantees that while Gs can transition from
  1117  		// running to stopped, they can never transition from stopped
  1118  		// to running.
  1119  		//
  1120  		// The sleep here allows racing Ms that missed freezing and are
  1121  		// about to run a G to complete the transition to running
  1122  		// before we start traceback.
  1123  		usleep(1000)
  1124  		return
  1125  	}
  1126  
  1127  	// stopwait and preemption requests can be lost
  1128  	// due to races with concurrently executing threads,
  1129  	// so try several times
  1130  	for i := 0; i < 5; i++ {
  1131  		// this should tell the scheduler to not start any new goroutines
  1132  		sched.stopwait = freezeStopWait
  1133  		sched.gcwaiting.Store(true)
  1134  		// this should stop running goroutines
  1135  		if !preemptall() {
  1136  			break // no running goroutines
  1137  		}
  1138  		usleep(1000)
  1139  	}
  1140  	// to be sure
  1141  	usleep(1000)
  1142  	preemptall()
  1143  	usleep(1000)
  1144  }
  1145  
  1146  // All reads and writes of g's status go through readgstatus, casgstatus
  1147  // castogscanstatus, casfrom_Gscanstatus.
  1148  //
  1149  //go:nosplit
  1150  func readgstatus(gp *g) uint32 {
  1151  	return gp.atomicstatus.Load()
  1152  }
  1153  
  1154  // The Gscanstatuses are acting like locks and this releases them.
  1155  // If it proves to be a performance hit we should be able to make these
  1156  // simple atomic stores but for now we are going to throw if
  1157  // we see an inconsistent state.
  1158  func casfrom_Gscanstatus(gp *g, oldval, newval uint32) {
  1159  	success := false
  1160  
  1161  	// Check that transition is valid.
  1162  	switch oldval {
  1163  	default:
  1164  		print("runtime: casfrom_Gscanstatus bad oldval gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
  1165  		dumpgstatus(gp)
  1166  		throw("casfrom_Gscanstatus:top gp->status is not in scan state")
  1167  	case _Gscanrunnable,
  1168  		_Gscanwaiting,
  1169  		_Gscanrunning,
  1170  		_Gscansyscall,
  1171  		_Gscanpreempted:
  1172  		if newval == oldval&^_Gscan {
  1173  			success = gp.atomicstatus.CompareAndSwap(oldval, newval)
  1174  		}
  1175  	}
  1176  	if !success {
  1177  		print("runtime: casfrom_Gscanstatus failed gp=", gp, ", oldval=", hex(oldval), ", newval=", hex(newval), "\n")
  1178  		dumpgstatus(gp)
  1179  		throw("casfrom_Gscanstatus: gp->status is not in scan state")
  1180  	}
  1181  	releaseLockRankAndM(lockRankGscan)
  1182  }
  1183  
  1184  // This will return false if the gp is not in the expected status and the cas fails.
  1185  // This acts like a lock acquire while the casfromgstatus acts like a lock release.
  1186  func castogscanstatus(gp *g, oldval, newval uint32) bool {
  1187  	switch oldval {
  1188  	case _Grunnable,
  1189  		_Grunning,
  1190  		_Gwaiting,
  1191  		_Gsyscall:
  1192  		if newval == oldval|_Gscan {
  1193  			r := gp.atomicstatus.CompareAndSwap(oldval, newval)
  1194  			if r {
  1195  				acquireLockRankAndM(lockRankGscan)
  1196  			}
  1197  			return r
  1198  
  1199  		}
  1200  	}
  1201  	print("runtime: castogscanstatus oldval=", hex(oldval), " newval=", hex(newval), "\n")
  1202  	throw("castogscanstatus")
  1203  	panic("not reached")
  1204  }
  1205  
  1206  // casgstatusAlwaysTrack is a debug flag that causes casgstatus to always track
  1207  // various latencies on every transition instead of sampling them.
  1208  var casgstatusAlwaysTrack = false
  1209  
  1210  // If asked to move to or from a Gscanstatus this will throw. Use the castogscanstatus
  1211  // and casfrom_Gscanstatus instead.
  1212  // casgstatus will loop if the g->atomicstatus is in a Gscan status until the routine that
  1213  // put it in the Gscan state is finished.
  1214  //
  1215  //go:nosplit
  1216  func casgstatus(gp *g, oldval, newval uint32) {
  1217  	if (oldval&_Gscan != 0) || (newval&_Gscan != 0) || oldval == newval {
  1218  		systemstack(func() {
  1219  			// Call on the systemstack to prevent print and throw from counting
  1220  			// against the nosplit stack reservation.
  1221  			print("runtime: casgstatus: oldval=", hex(oldval), " newval=", hex(newval), "\n")
  1222  			throw("casgstatus: bad incoming values")
  1223  		})
  1224  	}
  1225  
  1226  	lockWithRankMayAcquire(nil, lockRankGscan)
  1227  
  1228  	// See https://golang.org/cl/21503 for justification of the yield delay.
  1229  	const yieldDelay = 5 * 1000
  1230  	var nextYield int64
  1231  
  1232  	// loop if gp->atomicstatus is in a scan state giving
  1233  	// GC time to finish and change the state to oldval.
  1234  	for i := 0; !gp.atomicstatus.CompareAndSwap(oldval, newval); i++ {
  1235  		if oldval == _Gwaiting && gp.atomicstatus.Load() == _Grunnable {
  1236  			systemstack(func() {
  1237  				// Call on the systemstack to prevent throw from counting
  1238  				// against the nosplit stack reservation.
  1239  				throw("casgstatus: waiting for Gwaiting but is Grunnable")
  1240  			})
  1241  		}
  1242  		if i == 0 {
  1243  			nextYield = nanotime() + yieldDelay
  1244  		}
  1245  		if nanotime() < nextYield {
  1246  			for x := 0; x < 10 && gp.atomicstatus.Load() != oldval; x++ {
  1247  				procyield(1)
  1248  			}
  1249  		} else {
  1250  			osyield()
  1251  			nextYield = nanotime() + yieldDelay/2
  1252  		}
  1253  	}
  1254  
  1255  	if gp.syncGroup != nil {
  1256  		systemstack(func() {
  1257  			gp.syncGroup.changegstatus(gp, oldval, newval)
  1258  		})
  1259  	}
  1260  
  1261  	if oldval == _Grunning {
  1262  		// Track every gTrackingPeriod time a goroutine transitions out of running.
  1263  		if casgstatusAlwaysTrack || gp.trackingSeq%gTrackingPeriod == 0 {
  1264  			gp.tracking = true
  1265  		}
  1266  		gp.trackingSeq++
  1267  	}
  1268  	if !gp.tracking {
  1269  		return
  1270  	}
  1271  
  1272  	// Handle various kinds of tracking.
  1273  	//
  1274  	// Currently:
  1275  	// - Time spent in runnable.
  1276  	// - Time spent blocked on a sync.Mutex or sync.RWMutex.
  1277  	switch oldval {
  1278  	case _Grunnable:
  1279  		// We transitioned out of runnable, so measure how much
  1280  		// time we spent in this state and add it to
  1281  		// runnableTime.
  1282  		now := nanotime()
  1283  		gp.runnableTime += now - gp.trackingStamp
  1284  		gp.trackingStamp = 0
  1285  	case _Gwaiting:
  1286  		if !gp.waitreason.isMutexWait() {
  1287  			// Not blocking on a lock.
  1288  			break
  1289  		}
  1290  		// Blocking on a lock, measure it. Note that because we're
  1291  		// sampling, we have to multiply by our sampling period to get
  1292  		// a more representative estimate of the absolute value.
  1293  		// gTrackingPeriod also represents an accurate sampling period
  1294  		// because we can only enter this state from _Grunning.
  1295  		now := nanotime()
  1296  		sched.totalMutexWaitTime.Add((now - gp.trackingStamp) * gTrackingPeriod)
  1297  		gp.trackingStamp = 0
  1298  	}
  1299  	switch newval {
  1300  	case _Gwaiting:
  1301  		if !gp.waitreason.isMutexWait() {
  1302  			// Not blocking on a lock.
  1303  			break
  1304  		}
  1305  		// Blocking on a lock. Write down the timestamp.
  1306  		now := nanotime()
  1307  		gp.trackingStamp = now
  1308  	case _Grunnable:
  1309  		// We just transitioned into runnable, so record what
  1310  		// time that happened.
  1311  		now := nanotime()
  1312  		gp.trackingStamp = now
  1313  	case _Grunning:
  1314  		// We're transitioning into running, so turn off
  1315  		// tracking and record how much time we spent in
  1316  		// runnable.
  1317  		gp.tracking = false
  1318  		sched.timeToRun.record(gp.runnableTime)
  1319  		gp.runnableTime = 0
  1320  	}
  1321  }
  1322  
  1323  // casGToWaiting transitions gp from old to _Gwaiting, and sets the wait reason.
  1324  //
  1325  // Use this over casgstatus when possible to ensure that a waitreason is set.
  1326  func casGToWaiting(gp *g, old uint32, reason waitReason) {
  1327  	// Set the wait reason before calling casgstatus, because casgstatus will use it.
  1328  	gp.waitreason = reason
  1329  	casgstatus(gp, old, _Gwaiting)
  1330  }
  1331  
  1332  // casGToWaitingForGC transitions gp from old to _Gwaiting, and sets the wait reason.
  1333  // The wait reason must be a valid isWaitingForGC wait reason.
  1334  //
  1335  // Use this over casgstatus when possible to ensure that a waitreason is set.
  1336  func casGToWaitingForGC(gp *g, old uint32, reason waitReason) {
  1337  	if !reason.isWaitingForGC() {
  1338  		throw("casGToWaitingForGC with non-isWaitingForGC wait reason")
  1339  	}
  1340  	casGToWaiting(gp, old, reason)
  1341  }
  1342  
  1343  // casGToPreemptScan transitions gp from _Grunning to _Gscan|_Gpreempted.
  1344  //
  1345  // TODO(austin): This is the only status operation that both changes
  1346  // the status and locks the _Gscan bit. Rethink this.
  1347  func casGToPreemptScan(gp *g, old, new uint32) {
  1348  	if old != _Grunning || new != _Gscan|_Gpreempted {
  1349  		throw("bad g transition")
  1350  	}
  1351  	acquireLockRankAndM(lockRankGscan)
  1352  	for !gp.atomicstatus.CompareAndSwap(_Grunning, _Gscan|_Gpreempted) {
  1353  	}
  1354  	// We never notify gp.syncGroup that the goroutine state has moved
  1355  	// from _Grunning to _Gpreempted. We call syncGroup.changegstatus
  1356  	// after status changes happen, but doing so here would violate the
  1357  	// ordering between the gscan and synctest locks. syncGroup doesn't
  1358  	// distinguish between _Grunning and _Gpreempted anyway, so not
  1359  	// notifying it is fine.
  1360  }
  1361  
  1362  // casGFromPreempted attempts to transition gp from _Gpreempted to
  1363  // _Gwaiting. If successful, the caller is responsible for
  1364  // re-scheduling gp.
  1365  func casGFromPreempted(gp *g, old, new uint32) bool {
  1366  	if old != _Gpreempted || new != _Gwaiting {
  1367  		throw("bad g transition")
  1368  	}
  1369  	gp.waitreason = waitReasonPreempted
  1370  	if !gp.atomicstatus.CompareAndSwap(_Gpreempted, _Gwaiting) {
  1371  		return false
  1372  	}
  1373  	if sg := gp.syncGroup; sg != nil {
  1374  		sg.changegstatus(gp, _Gpreempted, _Gwaiting)
  1375  	}
  1376  	return true
  1377  }
  1378  
  1379  // stwReason is an enumeration of reasons the world is stopping.
  1380  type stwReason uint8
  1381  
  1382  // Reasons to stop-the-world.
  1383  //
  1384  // Avoid reusing reasons and add new ones instead.
  1385  const (
  1386  	stwUnknown                     stwReason = iota // "unknown"
  1387  	stwGCMarkTerm                                   // "GC mark termination"
  1388  	stwGCSweepTerm                                  // "GC sweep termination"
  1389  	stwWriteHeapDump                                // "write heap dump"
  1390  	stwGoroutineProfile                             // "goroutine profile"
  1391  	stwGoroutineProfileCleanup                      // "goroutine profile cleanup"
  1392  	stwAllGoroutinesStack                           // "all goroutines stack trace"
  1393  	stwReadMemStats                                 // "read mem stats"
  1394  	stwAllThreadsSyscall                            // "AllThreadsSyscall"
  1395  	stwGOMAXPROCS                                   // "GOMAXPROCS"
  1396  	stwStartTrace                                   // "start trace"
  1397  	stwStopTrace                                    // "stop trace"
  1398  	stwForTestCountPagesInUse                       // "CountPagesInUse (test)"
  1399  	stwForTestReadMetricsSlow                       // "ReadMetricsSlow (test)"
  1400  	stwForTestReadMemStatsSlow                      // "ReadMemStatsSlow (test)"
  1401  	stwForTestPageCachePagesLeaked                  // "PageCachePagesLeaked (test)"
  1402  	stwForTestResetDebugLog                         // "ResetDebugLog (test)"
  1403  )
  1404  
  1405  func (r stwReason) String() string {
  1406  	return stwReasonStrings[r]
  1407  }
  1408  
  1409  func (r stwReason) isGC() bool {
  1410  	return r == stwGCMarkTerm || r == stwGCSweepTerm
  1411  }
  1412  
  1413  // If you add to this list, also add it to src/internal/trace/parser.go.
  1414  // If you change the values of any of the stw* constants, bump the trace
  1415  // version number and make a copy of this.
  1416  var stwReasonStrings = [...]string{
  1417  	stwUnknown:                     "unknown",
  1418  	stwGCMarkTerm:                  "GC mark termination",
  1419  	stwGCSweepTerm:                 "GC sweep termination",
  1420  	stwWriteHeapDump:               "write heap dump",
  1421  	stwGoroutineProfile:            "goroutine profile",
  1422  	stwGoroutineProfileCleanup:     "goroutine profile cleanup",
  1423  	stwAllGoroutinesStack:          "all goroutines stack trace",
  1424  	stwReadMemStats:                "read mem stats",
  1425  	stwAllThreadsSyscall:           "AllThreadsSyscall",
  1426  	stwGOMAXPROCS:                  "GOMAXPROCS",
  1427  	stwStartTrace:                  "start trace",
  1428  	stwStopTrace:                   "stop trace",
  1429  	stwForTestCountPagesInUse:      "CountPagesInUse (test)",
  1430  	stwForTestReadMetricsSlow:      "ReadMetricsSlow (test)",
  1431  	stwForTestReadMemStatsSlow:     "ReadMemStatsSlow (test)",
  1432  	stwForTestPageCachePagesLeaked: "PageCachePagesLeaked (test)",
  1433  	stwForTestResetDebugLog:        "ResetDebugLog (test)",
  1434  }
  1435  
  1436  // worldStop provides context from the stop-the-world required by the
  1437  // start-the-world.
  1438  type worldStop struct {
  1439  	reason           stwReason
  1440  	startedStopping  int64
  1441  	finishedStopping int64
  1442  	stoppingCPUTime  int64
  1443  }
  1444  
  1445  // Temporary variable for stopTheWorld, when it can't write to the stack.
  1446  //
  1447  // Protected by worldsema.
  1448  var stopTheWorldContext worldStop
  1449  
  1450  // stopTheWorld stops all P's from executing goroutines, interrupting
  1451  // all goroutines at GC safe points and records reason as the reason
  1452  // for the stop. On return, only the current goroutine's P is running.
  1453  // stopTheWorld must not be called from a system stack and the caller
  1454  // must not hold worldsema. The caller must call startTheWorld when
  1455  // other P's should resume execution.
  1456  //
  1457  // stopTheWorld is safe for multiple goroutines to call at the
  1458  // same time. Each will execute its own stop, and the stops will
  1459  // be serialized.
  1460  //
  1461  // This is also used by routines that do stack dumps. If the system is
  1462  // in panic or being exited, this may not reliably stop all
  1463  // goroutines.
  1464  //
  1465  // Returns the STW context. When starting the world, this context must be
  1466  // passed to startTheWorld.
  1467  func stopTheWorld(reason stwReason) worldStop {
  1468  	semacquire(&worldsema)
  1469  	gp := getg()
  1470  	gp.m.preemptoff = reason.String()
  1471  	systemstack(func() {
  1472  		// Mark the goroutine which called stopTheWorld preemptible so its
  1473  		// stack may be scanned.
  1474  		// This lets a mark worker scan us while we try to stop the world
  1475  		// since otherwise we could get in a mutual preemption deadlock.
  1476  		// We must not modify anything on the G stack because a stack shrink
  1477  		// may occur. A stack shrink is otherwise OK though because in order
  1478  		// to return from this function (and to leave the system stack) we
  1479  		// must have preempted all goroutines, including any attempting
  1480  		// to scan our stack, in which case, any stack shrinking will
  1481  		// have already completed by the time we exit.
  1482  		//
  1483  		// N.B. The execution tracer is not aware of this status
  1484  		// transition and handles it specially based on the
  1485  		// wait reason.
  1486  		casGToWaitingForGC(gp, _Grunning, waitReasonStoppingTheWorld)
  1487  		stopTheWorldContext = stopTheWorldWithSema(reason) // avoid write to stack
  1488  		casgstatus(gp, _Gwaiting, _Grunning)
  1489  	})
  1490  	return stopTheWorldContext
  1491  }
  1492  
  1493  // startTheWorld undoes the effects of stopTheWorld.
  1494  //
  1495  // w must be the worldStop returned by stopTheWorld.
  1496  func startTheWorld(w worldStop) {
  1497  	systemstack(func() { startTheWorldWithSema(0, w) })
  1498  
  1499  	// worldsema must be held over startTheWorldWithSema to ensure
  1500  	// gomaxprocs cannot change while worldsema is held.
  1501  	//
  1502  	// Release worldsema with direct handoff to the next waiter, but
  1503  	// acquirem so that semrelease1 doesn't try to yield our time.
  1504  	//
  1505  	// Otherwise if e.g. ReadMemStats is being called in a loop,
  1506  	// it might stomp on other attempts to stop the world, such as
  1507  	// for starting or ending GC. The operation this blocks is
  1508  	// so heavy-weight that we should just try to be as fair as
  1509  	// possible here.
  1510  	//
  1511  	// We don't want to just allow us to get preempted between now
  1512  	// and releasing the semaphore because then we keep everyone
  1513  	// (including, for example, GCs) waiting longer.
  1514  	mp := acquirem()
  1515  	mp.preemptoff = ""
  1516  	semrelease1(&worldsema, true, 0)
  1517  	releasem(mp)
  1518  }
  1519  
  1520  // stopTheWorldGC has the same effect as stopTheWorld, but blocks
  1521  // until the GC is not running. It also blocks a GC from starting
  1522  // until startTheWorldGC is called.
  1523  func stopTheWorldGC(reason stwReason) worldStop {
  1524  	semacquire(&gcsema)
  1525  	return stopTheWorld(reason)
  1526  }
  1527  
  1528  // startTheWorldGC undoes the effects of stopTheWorldGC.
  1529  //
  1530  // w must be the worldStop returned by stopTheWorld.
  1531  func startTheWorldGC(w worldStop) {
  1532  	startTheWorld(w)
  1533  	semrelease(&gcsema)
  1534  }
  1535  
  1536  // Holding worldsema grants an M the right to try to stop the world.
  1537  var worldsema uint32 = 1
  1538  
  1539  // Holding gcsema grants the M the right to block a GC, and blocks
  1540  // until the current GC is done. In particular, it prevents gomaxprocs
  1541  // from changing concurrently.
  1542  //
  1543  // TODO(mknyszek): Once gomaxprocs and the execution tracer can handle
  1544  // being changed/enabled during a GC, remove this.
  1545  var gcsema uint32 = 1
  1546  
  1547  // stopTheWorldWithSema is the core implementation of stopTheWorld.
  1548  // The caller is responsible for acquiring worldsema and disabling
  1549  // preemption first and then should stopTheWorldWithSema on the system
  1550  // stack:
  1551  //
  1552  //	semacquire(&worldsema, 0)
  1553  //	m.preemptoff = "reason"
  1554  //	var stw worldStop
  1555  //	systemstack(func() {
  1556  //		stw = stopTheWorldWithSema(reason)
  1557  //	})
  1558  //
  1559  // When finished, the caller must either call startTheWorld or undo
  1560  // these three operations separately:
  1561  //
  1562  //	m.preemptoff = ""
  1563  //	systemstack(func() {
  1564  //		now = startTheWorldWithSema(stw)
  1565  //	})
  1566  //	semrelease(&worldsema)
  1567  //
  1568  // It is allowed to acquire worldsema once and then execute multiple
  1569  // startTheWorldWithSema/stopTheWorldWithSema pairs.
  1570  // Other P's are able to execute between successive calls to
  1571  // startTheWorldWithSema and stopTheWorldWithSema.
  1572  // Holding worldsema causes any other goroutines invoking
  1573  // stopTheWorld to block.
  1574  //
  1575  // Returns the STW context. When starting the world, this context must be
  1576  // passed to startTheWorldWithSema.
  1577  func stopTheWorldWithSema(reason stwReason) worldStop {
  1578  	trace := traceAcquire()
  1579  	if trace.ok() {
  1580  		trace.STWStart(reason)
  1581  		traceRelease(trace)
  1582  	}
  1583  	gp := getg()
  1584  
  1585  	// If we hold a lock, then we won't be able to stop another M
  1586  	// that is blocked trying to acquire the lock.
  1587  	if gp.m.locks > 0 {
  1588  		throw("stopTheWorld: holding locks")
  1589  	}
  1590  
  1591  	lock(&sched.lock)
  1592  	start := nanotime() // exclude time waiting for sched.lock from start and total time metrics.
  1593  	sched.stopwait = gomaxprocs
  1594  	sched.gcwaiting.Store(true)
  1595  	preemptall()
  1596  	// stop current P
  1597  	gp.m.p.ptr().status = _Pgcstop // Pgcstop is only diagnostic.
  1598  	gp.m.p.ptr().gcStopTime = start
  1599  	sched.stopwait--
  1600  	// try to retake all P's in Psyscall status
  1601  	trace = traceAcquire()
  1602  	for _, pp := range allp {
  1603  		s := pp.status
  1604  		if s == _Psyscall && atomic.Cas(&pp.status, s, _Pgcstop) {
  1605  			if trace.ok() {
  1606  				trace.ProcSteal(pp, false)
  1607  			}
  1608  			pp.syscalltick++
  1609  			pp.gcStopTime = nanotime()
  1610  			sched.stopwait--
  1611  		}
  1612  	}
  1613  	if trace.ok() {
  1614  		traceRelease(trace)
  1615  	}
  1616  
  1617  	// stop idle P's
  1618  	now := nanotime()
  1619  	for {
  1620  		pp, _ := pidleget(now)
  1621  		if pp == nil {
  1622  			break
  1623  		}
  1624  		pp.status = _Pgcstop
  1625  		pp.gcStopTime = nanotime()
  1626  		sched.stopwait--
  1627  	}
  1628  	wait := sched.stopwait > 0
  1629  	unlock(&sched.lock)
  1630  
  1631  	// wait for remaining P's to stop voluntarily
  1632  	if wait {
  1633  		for {
  1634  			// wait for 100us, then try to re-preempt in case of any races
  1635  			if notetsleep(&sched.stopnote, 100*1000) {
  1636  				noteclear(&sched.stopnote)
  1637  				break
  1638  			}
  1639  			preemptall()
  1640  		}
  1641  	}
  1642  
  1643  	finish := nanotime()
  1644  	startTime := finish - start
  1645  	if reason.isGC() {
  1646  		sched.stwStoppingTimeGC.record(startTime)
  1647  	} else {
  1648  		sched.stwStoppingTimeOther.record(startTime)
  1649  	}
  1650  
  1651  	// Double-check we actually stopped everything, and all the invariants hold.
  1652  	// Also accumulate all the time spent by each P in _Pgcstop up to the point
  1653  	// where everything was stopped. This will be accumulated into the total pause
  1654  	// CPU time by the caller.
  1655  	stoppingCPUTime := int64(0)
  1656  	bad := ""
  1657  	if sched.stopwait != 0 {
  1658  		bad = "stopTheWorld: not stopped (stopwait != 0)"
  1659  	} else {
  1660  		for _, pp := range allp {
  1661  			if pp.status != _Pgcstop {
  1662  				bad = "stopTheWorld: not stopped (status != _Pgcstop)"
  1663  			}
  1664  			if pp.gcStopTime == 0 && bad == "" {
  1665  				bad = "stopTheWorld: broken CPU time accounting"
  1666  			}
  1667  			stoppingCPUTime += finish - pp.gcStopTime
  1668  			pp.gcStopTime = 0
  1669  		}
  1670  	}
  1671  	if freezing.Load() {
  1672  		// Some other thread is panicking. This can cause the
  1673  		// sanity checks above to fail if the panic happens in
  1674  		// the signal handler on a stopped thread. Either way,
  1675  		// we should halt this thread.
  1676  		lock(&deadlock)
  1677  		lock(&deadlock)
  1678  	}
  1679  	if bad != "" {
  1680  		throw(bad)
  1681  	}
  1682  
  1683  	worldStopped()
  1684  
  1685  	return worldStop{
  1686  		reason:           reason,
  1687  		startedStopping:  start,
  1688  		finishedStopping: finish,
  1689  		stoppingCPUTime:  stoppingCPUTime,
  1690  	}
  1691  }
  1692  
  1693  // reason is the same STW reason passed to stopTheWorld. start is the start
  1694  // time returned by stopTheWorld.
  1695  //
  1696  // now is the current time; prefer to pass 0 to capture a fresh timestamp.
  1697  //
  1698  // stattTheWorldWithSema returns now.
  1699  func startTheWorldWithSema(now int64, w worldStop) int64 {
  1700  	assertWorldStopped()
  1701  
  1702  	mp := acquirem() // disable preemption because it can be holding p in a local var
  1703  	if netpollinited() {
  1704  		list, delta := netpoll(0) // non-blocking
  1705  		injectglist(&list)
  1706  		netpollAdjustWaiters(delta)
  1707  	}
  1708  	lock(&sched.lock)
  1709  
  1710  	procs := gomaxprocs
  1711  	if newprocs != 0 {
  1712  		procs = newprocs
  1713  		newprocs = 0
  1714  	}
  1715  	p1 := procresize(procs)
  1716  	sched.gcwaiting.Store(false)
  1717  	if sched.sysmonwait.Load() {
  1718  		sched.sysmonwait.Store(false)
  1719  		notewakeup(&sched.sysmonnote)
  1720  	}
  1721  	unlock(&sched.lock)
  1722  
  1723  	worldStarted()
  1724  
  1725  	for p1 != nil {
  1726  		p := p1
  1727  		p1 = p1.link.ptr()
  1728  		if p.m != 0 {
  1729  			mp := p.m.ptr()
  1730  			p.m = 0
  1731  			if mp.nextp != 0 {
  1732  				throw("startTheWorld: inconsistent mp->nextp")
  1733  			}
  1734  			mp.nextp.set(p)
  1735  			notewakeup(&mp.park)
  1736  		} else {
  1737  			// Start M to run P.  Do not start another M below.
  1738  			newm(nil, p, -1)
  1739  		}
  1740  	}
  1741  
  1742  	// Capture start-the-world time before doing clean-up tasks.
  1743  	if now == 0 {
  1744  		now = nanotime()
  1745  	}
  1746  	totalTime := now - w.startedStopping
  1747  	if w.reason.isGC() {
  1748  		sched.stwTotalTimeGC.record(totalTime)
  1749  	} else {
  1750  		sched.stwTotalTimeOther.record(totalTime)
  1751  	}
  1752  	trace := traceAcquire()
  1753  	if trace.ok() {
  1754  		trace.STWDone()
  1755  		traceRelease(trace)
  1756  	}
  1757  
  1758  	// Wakeup an additional proc in case we have excessive runnable goroutines
  1759  	// in local queues or in the global queue. If we don't, the proc will park itself.
  1760  	// If we have lots of excessive work, resetspinning will unpark additional procs as necessary.
  1761  	wakep()
  1762  
  1763  	releasem(mp)
  1764  
  1765  	return now
  1766  }
  1767  
  1768  // usesLibcall indicates whether this runtime performs system calls
  1769  // via libcall.
  1770  func usesLibcall() bool {
  1771  	switch GOOS {
  1772  	case "aix", "darwin", "illumos", "ios", "solaris", "windows":
  1773  		return true
  1774  	case "openbsd":
  1775  		return GOARCH != "mips64"
  1776  	}
  1777  	return false
  1778  }
  1779  
  1780  // mStackIsSystemAllocated indicates whether this runtime starts on a
  1781  // system-allocated stack.
  1782  func mStackIsSystemAllocated() bool {
  1783  	switch GOOS {
  1784  	case "aix", "darwin", "plan9", "illumos", "ios", "solaris", "windows":
  1785  		return true
  1786  	case "openbsd":
  1787  		return GOARCH != "mips64"
  1788  	}
  1789  	return false
  1790  }
  1791  
  1792  // mstart is the entry-point for new Ms.
  1793  // It is written in assembly, uses ABI0, is marked TOPFRAME, and calls mstart0.
  1794  func mstart()
  1795  
  1796  // mstart0 is the Go entry-point for new Ms.
  1797  // This must not split the stack because we may not even have stack
  1798  // bounds set up yet.
  1799  //
  1800  // May run during STW (because it doesn't have a P yet), so write
  1801  // barriers are not allowed.
  1802  //
  1803  //go:nosplit
  1804  //go:nowritebarrierrec
  1805  func mstart0() {
  1806  	gp := getg()
  1807  
  1808  	osStack := gp.stack.lo == 0
  1809  	if osStack {
  1810  		// Initialize stack bounds from system stack.
  1811  		// Cgo may have left stack size in stack.hi.
  1812  		// minit may update the stack bounds.
  1813  		//
  1814  		// Note: these bounds may not be very accurate.
  1815  		// We set hi to &size, but there are things above
  1816  		// it. The 1024 is supposed to compensate this,
  1817  		// but is somewhat arbitrary.
  1818  		size := gp.stack.hi
  1819  		if size == 0 {
  1820  			size = 16384 * sys.StackGuardMultiplier
  1821  		}
  1822  		gp.stack.hi = uintptr(noescape(unsafe.Pointer(&size)))
  1823  		gp.stack.lo = gp.stack.hi - size + 1024
  1824  	}
  1825  	// Initialize stack guard so that we can start calling regular
  1826  	// Go code.
  1827  	gp.stackguard0 = gp.stack.lo + stackGuard
  1828  	// This is the g0, so we can also call go:systemstack
  1829  	// functions, which check stackguard1.
  1830  	gp.stackguard1 = gp.stackguard0
  1831  	mstart1()
  1832  
  1833  	// Exit this thread.
  1834  	if mStackIsSystemAllocated() {
  1835  		// Windows, Solaris, illumos, Darwin, AIX and Plan 9 always system-allocate
  1836  		// the stack, but put it in gp.stack before mstart,
  1837  		// so the logic above hasn't set osStack yet.
  1838  		osStack = true
  1839  	}
  1840  	mexit(osStack)
  1841  }
  1842  
  1843  // The go:noinline is to guarantee the sys.GetCallerPC/sys.GetCallerSP below are safe,
  1844  // so that we can set up g0.sched to return to the call of mstart1 above.
  1845  //
  1846  //go:noinline
  1847  func mstart1() {
  1848  	gp := getg()
  1849  
  1850  	if gp != gp.m.g0 {
  1851  		throw("bad runtime·mstart")
  1852  	}
  1853  
  1854  	// Set up m.g0.sched as a label returning to just
  1855  	// after the mstart1 call in mstart0 above, for use by goexit0 and mcall.
  1856  	// We're never coming back to mstart1 after we call schedule,
  1857  	// so other calls can reuse the current frame.
  1858  	// And goexit0 does a gogo that needs to return from mstart1
  1859  	// and let mstart0 exit the thread.
  1860  	gp.sched.g = guintptr(unsafe.Pointer(gp))
  1861  	gp.sched.pc = sys.GetCallerPC()
  1862  	gp.sched.sp = sys.GetCallerSP()
  1863  
  1864  	asminit()
  1865  	minit()
  1866  
  1867  	// Install signal handlers; after minit so that minit can
  1868  	// prepare the thread to be able to handle the signals.
  1869  	if gp.m == &m0 {
  1870  		mstartm0()
  1871  	}
  1872  
  1873  	if debug.dataindependenttiming == 1 {
  1874  		sys.EnableDIT()
  1875  	}
  1876  
  1877  	if fn := gp.m.mstartfn; fn != nil {
  1878  		fn()
  1879  	}
  1880  
  1881  	if gp.m != &m0 {
  1882  		acquirep(gp.m.nextp.ptr())
  1883  		gp.m.nextp = 0
  1884  	}
  1885  	schedule()
  1886  }
  1887  
  1888  // mstartm0 implements part of mstart1 that only runs on the m0.
  1889  //
  1890  // Write barriers are allowed here because we know the GC can't be
  1891  // running yet, so they'll be no-ops.
  1892  //
  1893  //go:yeswritebarrierrec
  1894  func mstartm0() {
  1895  	// Create an extra M for callbacks on threads not created by Go.
  1896  	// An extra M is also needed on Windows for callbacks created by
  1897  	// syscall.NewCallback. See issue #6751 for details.
  1898  	if (iscgo || GOOS == "windows") && !cgoHasExtraM {
  1899  		cgoHasExtraM = true
  1900  		newextram()
  1901  	}
  1902  	initsig(false)
  1903  }
  1904  
  1905  // mPark causes a thread to park itself, returning once woken.
  1906  //
  1907  //go:nosplit
  1908  func mPark() {
  1909  	gp := getg()
  1910  	notesleep(&gp.m.park)
  1911  	noteclear(&gp.m.park)
  1912  }
  1913  
  1914  // mexit tears down and exits the current thread.
  1915  //
  1916  // Don't call this directly to exit the thread, since it must run at
  1917  // the top of the thread stack. Instead, use gogo(&gp.m.g0.sched) to
  1918  // unwind the stack to the point that exits the thread.
  1919  //
  1920  // It is entered with m.p != nil, so write barriers are allowed. It
  1921  // will release the P before exiting.
  1922  //
  1923  //go:yeswritebarrierrec
  1924  func mexit(osStack bool) {
  1925  	mp := getg().m
  1926  
  1927  	if mp == &m0 {
  1928  		// This is the main thread. Just wedge it.
  1929  		//
  1930  		// On Linux, exiting the main thread puts the process
  1931  		// into a non-waitable zombie state. On Plan 9,
  1932  		// exiting the main thread unblocks wait even though
  1933  		// other threads are still running. On Solaris we can
  1934  		// neither exitThread nor return from mstart. Other
  1935  		// bad things probably happen on other platforms.
  1936  		//
  1937  		// We could try to clean up this M more before wedging
  1938  		// it, but that complicates signal handling.
  1939  		handoffp(releasep())
  1940  		lock(&sched.lock)
  1941  		sched.nmfreed++
  1942  		checkdead()
  1943  		unlock(&sched.lock)
  1944  		mPark()
  1945  		throw("locked m0 woke up")
  1946  	}
  1947  
  1948  	sigblock(true)
  1949  	unminit()
  1950  
  1951  	// Free the gsignal stack.
  1952  	if mp.gsignal != nil {
  1953  		stackfree(mp.gsignal.stack)
  1954  		// On some platforms, when calling into VDSO (e.g. nanotime)
  1955  		// we store our g on the gsignal stack, if there is one.
  1956  		// Now the stack is freed, unlink it from the m, so we
  1957  		// won't write to it when calling VDSO code.
  1958  		mp.gsignal = nil
  1959  	}
  1960  
  1961  	// Free vgetrandom state.
  1962  	vgetrandomDestroy(mp)
  1963  
  1964  	// Remove m from allm.
  1965  	lock(&sched.lock)
  1966  	for pprev := &allm; *pprev != nil; pprev = &(*pprev).alllink {
  1967  		if *pprev == mp {
  1968  			*pprev = mp.alllink
  1969  			goto found
  1970  		}
  1971  	}
  1972  	throw("m not found in allm")
  1973  found:
  1974  	// Events must not be traced after this point.
  1975  
  1976  	// Delay reaping m until it's done with the stack.
  1977  	//
  1978  	// Put mp on the free list, though it will not be reaped while freeWait
  1979  	// is freeMWait. mp is no longer reachable via allm, so even if it is
  1980  	// on an OS stack, we must keep a reference to mp alive so that the GC
  1981  	// doesn't free mp while we are still using it.
  1982  	//
  1983  	// Note that the free list must not be linked through alllink because
  1984  	// some functions walk allm without locking, so may be using alllink.
  1985  	//
  1986  	// N.B. It's important that the M appears on the free list simultaneously
  1987  	// with it being removed so that the tracer can find it.
  1988  	mp.freeWait.Store(freeMWait)
  1989  	mp.freelink = sched.freem
  1990  	sched.freem = mp
  1991  	unlock(&sched.lock)
  1992  
  1993  	atomic.Xadd64(&ncgocall, int64(mp.ncgocall))
  1994  	sched.totalRuntimeLockWaitTime.Add(mp.mLockProfile.waitTime.Load())
  1995  
  1996  	// Release the P.
  1997  	handoffp(releasep())
  1998  	// After this point we must not have write barriers.
  1999  
  2000  	// Invoke the deadlock detector. This must happen after
  2001  	// handoffp because it may have started a new M to take our
  2002  	// P's work.
  2003  	lock(&sched.lock)
  2004  	sched.nmfreed++
  2005  	checkdead()
  2006  	unlock(&sched.lock)
  2007  
  2008  	if GOOS == "darwin" || GOOS == "ios" {
  2009  		// Make sure pendingPreemptSignals is correct when an M exits.
  2010  		// For #41702.
  2011  		if mp.signalPending.Load() != 0 {
  2012  			pendingPreemptSignals.Add(-1)
  2013  		}
  2014  	}
  2015  
  2016  	// Destroy all allocated resources. After this is called, we may no
  2017  	// longer take any locks.
  2018  	mdestroy(mp)
  2019  
  2020  	if osStack {
  2021  		// No more uses of mp, so it is safe to drop the reference.
  2022  		mp.freeWait.Store(freeMRef)
  2023  
  2024  		// Return from mstart and let the system thread
  2025  		// library free the g0 stack and terminate the thread.
  2026  		return
  2027  	}
  2028  
  2029  	// mstart is the thread's entry point, so there's nothing to
  2030  	// return to. Exit the thread directly. exitThread will clear
  2031  	// m.freeWait when it's done with the stack and the m can be
  2032  	// reaped.
  2033  	exitThread(&mp.freeWait)
  2034  }
  2035  
  2036  // forEachP calls fn(p) for every P p when p reaches a GC safe point.
  2037  // If a P is currently executing code, this will bring the P to a GC
  2038  // safe point and execute fn on that P. If the P is not executing code
  2039  // (it is idle or in a syscall), this will call fn(p) directly while
  2040  // preventing the P from exiting its state. This does not ensure that
  2041  // fn will run on every CPU executing Go code, but it acts as a global
  2042  // memory barrier. GC uses this as a "ragged barrier."
  2043  //
  2044  // The caller must hold worldsema. fn must not refer to any
  2045  // part of the current goroutine's stack, since the GC may move it.
  2046  func forEachP(reason waitReason, fn func(*p)) {
  2047  	systemstack(func() {
  2048  		gp := getg().m.curg
  2049  		// Mark the user stack as preemptible so that it may be scanned.
  2050  		// Otherwise, our attempt to force all P's to a safepoint could
  2051  		// result in a deadlock as we attempt to preempt a worker that's
  2052  		// trying to preempt us (e.g. for a stack scan).
  2053  		//
  2054  		// N.B. The execution tracer is not aware of this status
  2055  		// transition and handles it specially based on the
  2056  		// wait reason.
  2057  		casGToWaitingForGC(gp, _Grunning, reason)
  2058  		forEachPInternal(fn)
  2059  		casgstatus(gp, _Gwaiting, _Grunning)
  2060  	})
  2061  }
  2062  
  2063  // forEachPInternal calls fn(p) for every P p when p reaches a GC safe point.
  2064  // It is the internal implementation of forEachP.
  2065  //
  2066  // The caller must hold worldsema and either must ensure that a GC is not
  2067  // running (otherwise this may deadlock with the GC trying to preempt this P)
  2068  // or it must leave its goroutine in a preemptible state before it switches
  2069  // to the systemstack. Due to these restrictions, prefer forEachP when possible.
  2070  //
  2071  //go:systemstack
  2072  func forEachPInternal(fn func(*p)) {
  2073  	mp := acquirem()
  2074  	pp := getg().m.p.ptr()
  2075  
  2076  	lock(&sched.lock)
  2077  	if sched.safePointWait != 0 {
  2078  		throw("forEachP: sched.safePointWait != 0")
  2079  	}
  2080  	sched.safePointWait = gomaxprocs - 1
  2081  	sched.safePointFn = fn
  2082  
  2083  	// Ask all Ps to run the safe point function.
  2084  	for _, p2 := range allp {
  2085  		if p2 != pp {
  2086  			atomic.Store(&p2.runSafePointFn, 1)
  2087  		}
  2088  	}
  2089  	preemptall()
  2090  
  2091  	// Any P entering _Pidle or _Psyscall from now on will observe
  2092  	// p.runSafePointFn == 1 and will call runSafePointFn when
  2093  	// changing its status to _Pidle/_Psyscall.
  2094  
  2095  	// Run safe point function for all idle Ps. sched.pidle will
  2096  	// not change because we hold sched.lock.
  2097  	for p := sched.pidle.ptr(); p != nil; p = p.link.ptr() {
  2098  		if atomic.Cas(&p.runSafePointFn, 1, 0) {
  2099  			fn(p)
  2100  			sched.safePointWait--
  2101  		}
  2102  	}
  2103  
  2104  	wait := sched.safePointWait > 0
  2105  	unlock(&sched.lock)
  2106  
  2107  	// Run fn for the current P.
  2108  	fn(pp)
  2109  
  2110  	// Force Ps currently in _Psyscall into _Pidle and hand them
  2111  	// off to induce safe point function execution.
  2112  	for _, p2 := range allp {
  2113  		s := p2.status
  2114  
  2115  		// We need to be fine-grained about tracing here, since handoffp
  2116  		// might call into the tracer, and the tracer is non-reentrant.
  2117  		trace := traceAcquire()
  2118  		if s == _Psyscall && p2.runSafePointFn == 1 && atomic.Cas(&p2.status, s, _Pidle) {
  2119  			if trace.ok() {
  2120  				// It's important that we traceRelease before we call handoffp, which may also traceAcquire.
  2121  				trace.ProcSteal(p2, false)
  2122  				traceRelease(trace)
  2123  			}
  2124  			p2.syscalltick++
  2125  			handoffp(p2)
  2126  		} else if trace.ok() {
  2127  			traceRelease(trace)
  2128  		}
  2129  	}
  2130  
  2131  	// Wait for remaining Ps to run fn.
  2132  	if wait {
  2133  		for {
  2134  			// Wait for 100us, then try to re-preempt in
  2135  			// case of any races.
  2136  			//
  2137  			// Requires system stack.
  2138  			if notetsleep(&sched.safePointNote, 100*1000) {
  2139  				noteclear(&sched.safePointNote)
  2140  				break
  2141  			}
  2142  			preemptall()
  2143  		}
  2144  	}
  2145  	if sched.safePointWait != 0 {
  2146  		throw("forEachP: not done")
  2147  	}
  2148  	for _, p2 := range allp {
  2149  		if p2.runSafePointFn != 0 {
  2150  			throw("forEachP: P did not run fn")
  2151  		}
  2152  	}
  2153  
  2154  	lock(&sched.lock)
  2155  	sched.safePointFn = nil
  2156  	unlock(&sched.lock)
  2157  	releasem(mp)
  2158  }
  2159  
  2160  // runSafePointFn runs the safe point function, if any, for this P.
  2161  // This should be called like
  2162  //
  2163  //	if getg().m.p.runSafePointFn != 0 {
  2164  //	    runSafePointFn()
  2165  //	}
  2166  //
  2167  // runSafePointFn must be checked on any transition in to _Pidle or
  2168  // _Psyscall to avoid a race where forEachP sees that the P is running
  2169  // just before the P goes into _Pidle/_Psyscall and neither forEachP
  2170  // nor the P run the safe-point function.
  2171  func runSafePointFn() {
  2172  	p := getg().m.p.ptr()
  2173  	// Resolve the race between forEachP running the safe-point
  2174  	// function on this P's behalf and this P running the
  2175  	// safe-point function directly.
  2176  	if !atomic.Cas(&p.runSafePointFn, 1, 0) {
  2177  		return
  2178  	}
  2179  	sched.safePointFn(p)
  2180  	lock(&sched.lock)
  2181  	sched.safePointWait--
  2182  	if sched.safePointWait == 0 {
  2183  		notewakeup(&sched.safePointNote)
  2184  	}
  2185  	unlock(&sched.lock)
  2186  }
  2187  
  2188  // When running with cgo, we call _cgo_thread_start
  2189  // to start threads for us so that we can play nicely with
  2190  // foreign code.
  2191  var cgoThreadStart unsafe.Pointer
  2192  
  2193  type cgothreadstart struct {
  2194  	g   guintptr
  2195  	tls *uint64
  2196  	fn  unsafe.Pointer
  2197  }
  2198  
  2199  // Allocate a new m unassociated with any thread.
  2200  // Can use p for allocation context if needed.
  2201  // fn is recorded as the new m's m.mstartfn.
  2202  // id is optional pre-allocated m ID. Omit by passing -1.
  2203  //
  2204  // This function is allowed to have write barriers even if the caller
  2205  // isn't because it borrows pp.
  2206  //
  2207  //go:yeswritebarrierrec
  2208  func allocm(pp *p, fn func(), id int64) *m {
  2209  	allocmLock.rlock()
  2210  
  2211  	// The caller owns pp, but we may borrow (i.e., acquirep) it. We must
  2212  	// disable preemption to ensure it is not stolen, which would make the
  2213  	// caller lose ownership.
  2214  	acquirem()
  2215  
  2216  	gp := getg()
  2217  	if gp.m.p == 0 {
  2218  		acquirep(pp) // temporarily borrow p for mallocs in this function
  2219  	}
  2220  
  2221  	// Release the free M list. We need to do this somewhere and
  2222  	// this may free up a stack we can use.
  2223  	if sched.freem != nil {
  2224  		lock(&sched.lock)
  2225  		var newList *m
  2226  		for freem := sched.freem; freem != nil; {
  2227  			// Wait for freeWait to indicate that freem's stack is unused.
  2228  			wait := freem.freeWait.Load()
  2229  			if wait == freeMWait {
  2230  				next := freem.freelink
  2231  				freem.freelink = newList
  2232  				newList = freem
  2233  				freem = next
  2234  				continue
  2235  			}
  2236  			// Drop any remaining trace resources.
  2237  			// Ms can continue to emit events all the way until wait != freeMWait,
  2238  			// so it's only safe to call traceThreadDestroy at this point.
  2239  			if traceEnabled() || traceShuttingDown() {
  2240  				traceThreadDestroy(freem)
  2241  			}
  2242  			// Free the stack if needed. For freeMRef, there is
  2243  			// nothing to do except drop freem from the sched.freem
  2244  			// list.
  2245  			if wait == freeMStack {
  2246  				// stackfree must be on the system stack, but allocm is
  2247  				// reachable off the system stack transitively from
  2248  				// startm.
  2249  				systemstack(func() {
  2250  					stackfree(freem.g0.stack)
  2251  				})
  2252  			}
  2253  			freem = freem.freelink
  2254  		}
  2255  		sched.freem = newList
  2256  		unlock(&sched.lock)
  2257  	}
  2258  
  2259  	mp := new(m)
  2260  	mp.mstartfn = fn
  2261  	mcommoninit(mp, id)
  2262  
  2263  	// In case of cgo or Solaris or illumos or Darwin, pthread_create will make us a stack.
  2264  	// Windows and Plan 9 will layout sched stack on OS stack.
  2265  	if iscgo || mStackIsSystemAllocated() {
  2266  		mp.g0 = malg(-1)
  2267  	} else {
  2268  		mp.g0 = malg(16384 * sys.StackGuardMultiplier)
  2269  	}
  2270  	mp.g0.m = mp
  2271  
  2272  	if pp == gp.m.p.ptr() {
  2273  		releasep()
  2274  	}
  2275  
  2276  	releasem(gp.m)
  2277  	allocmLock.runlock()
  2278  	return mp
  2279  }
  2280  
  2281  // needm is called when a cgo callback happens on a
  2282  // thread without an m (a thread not created by Go).
  2283  // In this case, needm is expected to find an m to use
  2284  // and return with m, g initialized correctly.
  2285  // Since m and g are not set now (likely nil, but see below)
  2286  // needm is limited in what routines it can call. In particular
  2287  // it can only call nosplit functions (textflag 7) and cannot
  2288  // do any scheduling that requires an m.
  2289  //
  2290  // In order to avoid needing heavy lifting here, we adopt
  2291  // the following strategy: there is a stack of available m's
  2292  // that can be stolen. Using compare-and-swap
  2293  // to pop from the stack has ABA races, so we simulate
  2294  // a lock by doing an exchange (via Casuintptr) to steal the stack
  2295  // head and replace the top pointer with MLOCKED (1).
  2296  // This serves as a simple spin lock that we can use even
  2297  // without an m. The thread that locks the stack in this way
  2298  // unlocks the stack by storing a valid stack head pointer.
  2299  //
  2300  // In order to make sure that there is always an m structure
  2301  // available to be stolen, we maintain the invariant that there
  2302  // is always one more than needed. At the beginning of the
  2303  // program (if cgo is in use) the list is seeded with a single m.
  2304  // If needm finds that it has taken the last m off the list, its job
  2305  // is - once it has installed its own m so that it can do things like
  2306  // allocate memory - to create a spare m and put it on the list.
  2307  //
  2308  // Each of these extra m's also has a g0 and a curg that are
  2309  // pressed into service as the scheduling stack and current
  2310  // goroutine for the duration of the cgo callback.
  2311  //
  2312  // It calls dropm to put the m back on the list,
  2313  // 1. when the callback is done with the m in non-pthread platforms,
  2314  // 2. or when the C thread exiting on pthread platforms.
  2315  //
  2316  // The signal argument indicates whether we're called from a signal
  2317  // handler.
  2318  //
  2319  //go:nosplit
  2320  func needm(signal bool) {
  2321  	if (iscgo || GOOS == "windows") && !cgoHasExtraM {
  2322  		// Can happen if C/C++ code calls Go from a global ctor.
  2323  		// Can also happen on Windows if a global ctor uses a
  2324  		// callback created by syscall.NewCallback. See issue #6751
  2325  		// for details.
  2326  		//
  2327  		// Can not throw, because scheduler is not initialized yet.
  2328  		writeErrStr("fatal error: cgo callback before cgo call\n")
  2329  		exit(1)
  2330  	}
  2331  
  2332  	// Save and block signals before getting an M.
  2333  	// The signal handler may call needm itself,
  2334  	// and we must avoid a deadlock. Also, once g is installed,
  2335  	// any incoming signals will try to execute,
  2336  	// but we won't have the sigaltstack settings and other data
  2337  	// set up appropriately until the end of minit, which will
  2338  	// unblock the signals. This is the same dance as when
  2339  	// starting a new m to run Go code via newosproc.
  2340  	var sigmask sigset
  2341  	sigsave(&sigmask)
  2342  	sigblock(false)
  2343  
  2344  	// getExtraM is safe here because of the invariant above,
  2345  	// that the extra list always contains or will soon contain
  2346  	// at least one m.
  2347  	mp, last := getExtraM()
  2348  
  2349  	// Set needextram when we've just emptied the list,
  2350  	// so that the eventual call into cgocallbackg will
  2351  	// allocate a new m for the extra list. We delay the
  2352  	// allocation until then so that it can be done
  2353  	// after exitsyscall makes sure it is okay to be
  2354  	// running at all (that is, there's no garbage collection
  2355  	// running right now).
  2356  	mp.needextram = last
  2357  
  2358  	// Store the original signal mask for use by minit.
  2359  	mp.sigmask = sigmask
  2360  
  2361  	// Install TLS on some platforms (previously setg
  2362  	// would do this if necessary).
  2363  	osSetupTLS(mp)
  2364  
  2365  	// Install g (= m->g0) and set the stack bounds
  2366  	// to match the current stack.
  2367  	setg(mp.g0)
  2368  	sp := sys.GetCallerSP()
  2369  	callbackUpdateSystemStack(mp, sp, signal)
  2370  
  2371  	// Should mark we are already in Go now.
  2372  	// Otherwise, we may call needm again when we get a signal, before cgocallbackg1,
  2373  	// which means the extram list may be empty, that will cause a deadlock.
  2374  	mp.isExtraInC = false
  2375  
  2376  	// Initialize this thread to use the m.
  2377  	asminit()
  2378  	minit()
  2379  
  2380  	// Emit a trace event for this dead -> syscall transition,
  2381  	// but only if we're not in a signal handler.
  2382  	//
  2383  	// N.B. the tracer can run on a bare M just fine, we just have
  2384  	// to make sure to do this before setg(nil) and unminit.
  2385  	var trace traceLocker
  2386  	if !signal {
  2387  		trace = traceAcquire()
  2388  	}
  2389  
  2390  	// mp.curg is now a real goroutine.
  2391  	casgstatus(mp.curg, _Gdead, _Gsyscall)
  2392  	sched.ngsys.Add(-1)
  2393  
  2394  	if !signal {
  2395  		if trace.ok() {
  2396  			trace.GoCreateSyscall(mp.curg)
  2397  			traceRelease(trace)
  2398  		}
  2399  	}
  2400  	mp.isExtraInSig = signal
  2401  }
  2402  
  2403  // Acquire an extra m and bind it to the C thread when a pthread key has been created.
  2404  //
  2405  //go:nosplit
  2406  func needAndBindM() {
  2407  	needm(false)
  2408  
  2409  	if _cgo_pthread_key_created != nil && *(*uintptr)(_cgo_pthread_key_created) != 0 {
  2410  		cgoBindM()
  2411  	}
  2412  }
  2413  
  2414  // newextram allocates m's and puts them on the extra list.
  2415  // It is called with a working local m, so that it can do things
  2416  // like call schedlock and allocate.
  2417  func newextram() {
  2418  	c := extraMWaiters.Swap(0)
  2419  	if c > 0 {
  2420  		for i := uint32(0); i < c; i++ {
  2421  			oneNewExtraM()
  2422  		}
  2423  	} else if extraMLength.Load() == 0 {
  2424  		// Make sure there is at least one extra M.
  2425  		oneNewExtraM()
  2426  	}
  2427  }
  2428  
  2429  // oneNewExtraM allocates an m and puts it on the extra list.
  2430  func oneNewExtraM() {
  2431  	// Create extra goroutine locked to extra m.
  2432  	// The goroutine is the context in which the cgo callback will run.
  2433  	// The sched.pc will never be returned to, but setting it to
  2434  	// goexit makes clear to the traceback routines where
  2435  	// the goroutine stack ends.
  2436  	mp := allocm(nil, nil, -1)
  2437  	gp := malg(4096)
  2438  	gp.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum
  2439  	gp.sched.sp = gp.stack.hi
  2440  	gp.sched.sp -= 4 * goarch.PtrSize // extra space in case of reads slightly beyond frame
  2441  	gp.sched.lr = 0
  2442  	gp.sched.g = guintptr(unsafe.Pointer(gp))
  2443  	gp.syscallpc = gp.sched.pc
  2444  	gp.syscallsp = gp.sched.sp
  2445  	gp.stktopsp = gp.sched.sp
  2446  	// malg returns status as _Gidle. Change to _Gdead before
  2447  	// adding to allg where GC can see it. We use _Gdead to hide
  2448  	// this from tracebacks and stack scans since it isn't a
  2449  	// "real" goroutine until needm grabs it.
  2450  	casgstatus(gp, _Gidle, _Gdead)
  2451  	gp.m = mp
  2452  	mp.curg = gp
  2453  	mp.isextra = true
  2454  	// mark we are in C by default.
  2455  	mp.isExtraInC = true
  2456  	mp.lockedInt++
  2457  	mp.lockedg.set(gp)
  2458  	gp.lockedm.set(mp)
  2459  	gp.goid = sched.goidgen.Add(1)
  2460  	if raceenabled {
  2461  		gp.racectx = racegostart(abi.FuncPCABIInternal(newextram) + sys.PCQuantum)
  2462  	}
  2463  	// put on allg for garbage collector
  2464  	allgadd(gp)
  2465  
  2466  	// gp is now on the allg list, but we don't want it to be
  2467  	// counted by gcount. It would be more "proper" to increment
  2468  	// sched.ngfree, but that requires locking. Incrementing ngsys
  2469  	// has the same effect.
  2470  	sched.ngsys.Add(1)
  2471  
  2472  	// Add m to the extra list.
  2473  	addExtraM(mp)
  2474  }
  2475  
  2476  // dropm puts the current m back onto the extra list.
  2477  //
  2478  // 1. On systems without pthreads, like Windows
  2479  // dropm is called when a cgo callback has called needm but is now
  2480  // done with the callback and returning back into the non-Go thread.
  2481  //
  2482  // The main expense here is the call to signalstack to release the
  2483  // m's signal stack, and then the call to needm on the next callback
  2484  // from this thread. It is tempting to try to save the m for next time,
  2485  // which would eliminate both these costs, but there might not be
  2486  // a next time: the current thread (which Go does not control) might exit.
  2487  // If we saved the m for that thread, there would be an m leak each time
  2488  // such a thread exited. Instead, we acquire and release an m on each
  2489  // call. These should typically not be scheduling operations, just a few
  2490  // atomics, so the cost should be small.
  2491  //
  2492  // 2. On systems with pthreads
  2493  // dropm is called while a non-Go thread is exiting.
  2494  // We allocate a pthread per-thread variable using pthread_key_create,
  2495  // to register a thread-exit-time destructor.
  2496  // And store the g into a thread-specific value associated with the pthread key,
  2497  // when first return back to C.
  2498  // So that the destructor would invoke dropm while the non-Go thread is exiting.
  2499  // This is much faster since it avoids expensive signal-related syscalls.
  2500  //
  2501  // This always runs without a P, so //go:nowritebarrierrec is required.
  2502  //
  2503  // This may run with a different stack than was recorded in g0 (there is no
  2504  // call to callbackUpdateSystemStack prior to dropm), so this must be
  2505  // //go:nosplit to avoid the stack bounds check.
  2506  //
  2507  //go:nowritebarrierrec
  2508  //go:nosplit
  2509  func dropm() {
  2510  	// Clear m and g, and return m to the extra list.
  2511  	// After the call to setg we can only call nosplit functions
  2512  	// with no pointer manipulation.
  2513  	mp := getg().m
  2514  
  2515  	// Emit a trace event for this syscall -> dead transition.
  2516  	//
  2517  	// N.B. the tracer can run on a bare M just fine, we just have
  2518  	// to make sure to do this before setg(nil) and unminit.
  2519  	var trace traceLocker
  2520  	if !mp.isExtraInSig {
  2521  		trace = traceAcquire()
  2522  	}
  2523  
  2524  	// Return mp.curg to dead state.
  2525  	casgstatus(mp.curg, _Gsyscall, _Gdead)
  2526  	mp.curg.preemptStop = false
  2527  	sched.ngsys.Add(1)
  2528  
  2529  	if !mp.isExtraInSig {
  2530  		if trace.ok() {
  2531  			trace.GoDestroySyscall()
  2532  			traceRelease(trace)
  2533  		}
  2534  	}
  2535  
  2536  	// Trash syscalltick so that it doesn't line up with mp.old.syscalltick anymore.
  2537  	//
  2538  	// In the new tracer, we model needm and dropm and a goroutine being created and
  2539  	// destroyed respectively. The m then might get reused with a different procid but
  2540  	// still with a reference to oldp, and still with the same syscalltick. The next
  2541  	// time a G is "created" in needm, it'll return and quietly reacquire its P from a
  2542  	// different m with a different procid, which will confuse the trace parser. By
  2543  	// trashing syscalltick, we ensure that it'll appear as if we lost the P to the
  2544  	// tracer parser and that we just reacquired it.
  2545  	//
  2546  	// Trash the value by decrementing because that gets us as far away from the value
  2547  	// the syscall exit code expects as possible. Setting to zero is risky because
  2548  	// syscalltick could already be zero (and in fact, is initialized to zero).
  2549  	mp.syscalltick--
  2550  
  2551  	// Reset trace state unconditionally. This goroutine is being 'destroyed'
  2552  	// from the perspective of the tracer.
  2553  	mp.curg.trace.reset()
  2554  
  2555  	// Flush all the M's buffers. This is necessary because the M might
  2556  	// be used on a different thread with a different procid, so we have
  2557  	// to make sure we don't write into the same buffer.
  2558  	if traceEnabled() || traceShuttingDown() {
  2559  		// Acquire sched.lock across thread destruction. One of the invariants of the tracer
  2560  		// is that a thread cannot disappear from the tracer's view (allm or freem) without
  2561  		// it noticing, so it requires that sched.lock be held over traceThreadDestroy.
  2562  		//
  2563  		// This isn't strictly necessary in this case, because this thread never leaves allm,
  2564  		// but the critical section is short and dropm is rare on pthread platforms, so just
  2565  		// take the lock and play it safe. traceThreadDestroy also asserts that the lock is held.
  2566  		lock(&sched.lock)
  2567  		traceThreadDestroy(mp)
  2568  		unlock(&sched.lock)
  2569  	}
  2570  	mp.isExtraInSig = false
  2571  
  2572  	// Block signals before unminit.
  2573  	// Unminit unregisters the signal handling stack (but needs g on some systems).
  2574  	// Setg(nil) clears g, which is the signal handler's cue not to run Go handlers.
  2575  	// It's important not to try to handle a signal between those two steps.
  2576  	sigmask := mp.sigmask
  2577  	sigblock(false)
  2578  	unminit()
  2579  
  2580  	setg(nil)
  2581  
  2582  	// Clear g0 stack bounds to ensure that needm always refreshes the
  2583  	// bounds when reusing this M.
  2584  	g0 := mp.g0
  2585  	g0.stack.hi = 0
  2586  	g0.stack.lo = 0
  2587  	g0.stackguard0 = 0
  2588  	g0.stackguard1 = 0
  2589  	mp.g0StackAccurate = false
  2590  
  2591  	putExtraM(mp)
  2592  
  2593  	msigrestore(sigmask)
  2594  }
  2595  
  2596  // bindm store the g0 of the current m into a thread-specific value.
  2597  //
  2598  // We allocate a pthread per-thread variable using pthread_key_create,
  2599  // to register a thread-exit-time destructor.
  2600  // We are here setting the thread-specific value of the pthread key, to enable the destructor.
  2601  // So that the pthread_key_destructor would dropm while the C thread is exiting.
  2602  //
  2603  // And the saved g will be used in pthread_key_destructor,
  2604  // since the g stored in the TLS by Go might be cleared in some platforms,
  2605  // before the destructor invoked, so, we restore g by the stored g, before dropm.
  2606  //
  2607  // We store g0 instead of m, to make the assembly code simpler,
  2608  // since we need to restore g0 in runtime.cgocallback.
  2609  //
  2610  // On systems without pthreads, like Windows, bindm shouldn't be used.
  2611  //
  2612  // NOTE: this always runs without a P, so, nowritebarrierrec required.
  2613  //
  2614  //go:nosplit
  2615  //go:nowritebarrierrec
  2616  func cgoBindM() {
  2617  	if GOOS == "windows" || GOOS == "plan9" {
  2618  		fatal("bindm in unexpected GOOS")
  2619  	}
  2620  	g := getg()
  2621  	if g.m.g0 != g {
  2622  		fatal("the current g is not g0")
  2623  	}
  2624  	if _cgo_bindm != nil {
  2625  		asmcgocall(_cgo_bindm, unsafe.Pointer(g))
  2626  	}
  2627  }
  2628  
  2629  // A helper function for EnsureDropM.
  2630  //
  2631  // getm should be an internal detail,
  2632  // but widely used packages access it using linkname.
  2633  // Notable members of the hall of shame include:
  2634  //   - fortio.org/log
  2635  //
  2636  // Do not remove or change the type signature.
  2637  // See go.dev/issue/67401.
  2638  //
  2639  //go:linkname getm
  2640  func getm() uintptr {
  2641  	return uintptr(unsafe.Pointer(getg().m))
  2642  }
  2643  
  2644  var (
  2645  	// Locking linked list of extra M's, via mp.schedlink. Must be accessed
  2646  	// only via lockextra/unlockextra.
  2647  	//
  2648  	// Can't be atomic.Pointer[m] because we use an invalid pointer as a
  2649  	// "locked" sentinel value. M's on this list remain visible to the GC
  2650  	// because their mp.curg is on allgs.
  2651  	extraM atomic.Uintptr
  2652  	// Number of M's in the extraM list.
  2653  	extraMLength atomic.Uint32
  2654  	// Number of waiters in lockextra.
  2655  	extraMWaiters atomic.Uint32
  2656  
  2657  	// Number of extra M's in use by threads.
  2658  	extraMInUse atomic.Uint32
  2659  )
  2660  
  2661  // lockextra locks the extra list and returns the list head.
  2662  // The caller must unlock the list by storing a new list head
  2663  // to extram. If nilokay is true, then lockextra will
  2664  // return a nil list head if that's what it finds. If nilokay is false,
  2665  // lockextra will keep waiting until the list head is no longer nil.
  2666  //
  2667  //go:nosplit
  2668  func lockextra(nilokay bool) *m {
  2669  	const locked = 1
  2670  
  2671  	incr := false
  2672  	for {
  2673  		old := extraM.Load()
  2674  		if old == locked {
  2675  			osyield_no_g()
  2676  			continue
  2677  		}
  2678  		if old == 0 && !nilokay {
  2679  			if !incr {
  2680  				// Add 1 to the number of threads
  2681  				// waiting for an M.
  2682  				// This is cleared by newextram.
  2683  				extraMWaiters.Add(1)
  2684  				incr = true
  2685  			}
  2686  			usleep_no_g(1)
  2687  			continue
  2688  		}
  2689  		if extraM.CompareAndSwap(old, locked) {
  2690  			return (*m)(unsafe.Pointer(old))
  2691  		}
  2692  		osyield_no_g()
  2693  		continue
  2694  	}
  2695  }
  2696  
  2697  //go:nosplit
  2698  func unlockextra(mp *m, delta int32) {
  2699  	extraMLength.Add(delta)
  2700  	extraM.Store(uintptr(unsafe.Pointer(mp)))
  2701  }
  2702  
  2703  // Return an M from the extra M list. Returns last == true if the list becomes
  2704  // empty because of this call.
  2705  //
  2706  // Spins waiting for an extra M, so caller must ensure that the list always
  2707  // contains or will soon contain at least one M.
  2708  //
  2709  //go:nosplit
  2710  func getExtraM() (mp *m, last bool) {
  2711  	mp = lockextra(false)
  2712  	extraMInUse.Add(1)
  2713  	unlockextra(mp.schedlink.ptr(), -1)
  2714  	return mp, mp.schedlink.ptr() == nil
  2715  }
  2716  
  2717  // Returns an extra M back to the list. mp must be from getExtraM. Newly
  2718  // allocated M's should use addExtraM.
  2719  //
  2720  //go:nosplit
  2721  func putExtraM(mp *m) {
  2722  	extraMInUse.Add(-1)
  2723  	addExtraM(mp)
  2724  }
  2725  
  2726  // Adds a newly allocated M to the extra M list.
  2727  //
  2728  //go:nosplit
  2729  func addExtraM(mp *m) {
  2730  	mnext := lockextra(true)
  2731  	mp.schedlink.set(mnext)
  2732  	unlockextra(mp, 1)
  2733  }
  2734  
  2735  var (
  2736  	// allocmLock is locked for read when creating new Ms in allocm and their
  2737  	// addition to allm. Thus acquiring this lock for write blocks the
  2738  	// creation of new Ms.
  2739  	allocmLock rwmutex
  2740  
  2741  	// execLock serializes exec and clone to avoid bugs or unspecified
  2742  	// behaviour around exec'ing while creating/destroying threads. See
  2743  	// issue #19546.
  2744  	execLock rwmutex
  2745  )
  2746  
  2747  // These errors are reported (via writeErrStr) by some OS-specific
  2748  // versions of newosproc and newosproc0.
  2749  const (
  2750  	failthreadcreate  = "runtime: failed to create new OS thread\n"
  2751  	failallocatestack = "runtime: failed to allocate stack for the new OS thread\n"
  2752  )
  2753  
  2754  // newmHandoff contains a list of m structures that need new OS threads.
  2755  // This is used by newm in situations where newm itself can't safely
  2756  // start an OS thread.
  2757  var newmHandoff struct {
  2758  	lock mutex
  2759  
  2760  	// newm points to a list of M structures that need new OS
  2761  	// threads. The list is linked through m.schedlink.
  2762  	newm muintptr
  2763  
  2764  	// waiting indicates that wake needs to be notified when an m
  2765  	// is put on the list.
  2766  	waiting bool
  2767  	wake    note
  2768  
  2769  	// haveTemplateThread indicates that the templateThread has
  2770  	// been started. This is not protected by lock. Use cas to set
  2771  	// to 1.
  2772  	haveTemplateThread uint32
  2773  }
  2774  
  2775  // Create a new m. It will start off with a call to fn, or else the scheduler.
  2776  // fn needs to be static and not a heap allocated closure.
  2777  // May run with m.p==nil, so write barriers are not allowed.
  2778  //
  2779  // id is optional pre-allocated m ID. Omit by passing -1.
  2780  //
  2781  //go:nowritebarrierrec
  2782  func newm(fn func(), pp *p, id int64) {
  2783  	// allocm adds a new M to allm, but they do not start until created by
  2784  	// the OS in newm1 or the template thread.
  2785  	//
  2786  	// doAllThreadsSyscall requires that every M in allm will eventually
  2787  	// start and be signal-able, even with a STW.
  2788  	//
  2789  	// Disable preemption here until we start the thread to ensure that
  2790  	// newm is not preempted between allocm and starting the new thread,
  2791  	// ensuring that anything added to allm is guaranteed to eventually
  2792  	// start.
  2793  	acquirem()
  2794  
  2795  	mp := allocm(pp, fn, id)
  2796  	mp.nextp.set(pp)
  2797  	mp.sigmask = initSigmask
  2798  	if gp := getg(); gp != nil && gp.m != nil && (gp.m.lockedExt != 0 || gp.m.incgo) && GOOS != "plan9" {
  2799  		// We're on a locked M or a thread that may have been
  2800  		// started by C. The kernel state of this thread may
  2801  		// be strange (the user may have locked it for that
  2802  		// purpose). We don't want to clone that into another
  2803  		// thread. Instead, ask a known-good thread to create
  2804  		// the thread for us.
  2805  		//
  2806  		// This is disabled on Plan 9. See golang.org/issue/22227.
  2807  		//
  2808  		// TODO: This may be unnecessary on Windows, which
  2809  		// doesn't model thread creation off fork.
  2810  		lock(&newmHandoff.lock)
  2811  		if newmHandoff.haveTemplateThread == 0 {
  2812  			throw("on a locked thread with no template thread")
  2813  		}
  2814  		mp.schedlink = newmHandoff.newm
  2815  		newmHandoff.newm.set(mp)
  2816  		if newmHandoff.waiting {
  2817  			newmHandoff.waiting = false
  2818  			notewakeup(&newmHandoff.wake)
  2819  		}
  2820  		unlock(&newmHandoff.lock)
  2821  		// The M has not started yet, but the template thread does not
  2822  		// participate in STW, so it will always process queued Ms and
  2823  		// it is safe to releasem.
  2824  		releasem(getg().m)
  2825  		return
  2826  	}
  2827  	newm1(mp)
  2828  	releasem(getg().m)
  2829  }
  2830  
  2831  func newm1(mp *m) {
  2832  	if iscgo {
  2833  		var ts cgothreadstart
  2834  		if _cgo_thread_start == nil {
  2835  			throw("_cgo_thread_start missing")
  2836  		}
  2837  		ts.g.set(mp.g0)
  2838  		ts.tls = (*uint64)(unsafe.Pointer(&mp.tls[0]))
  2839  		ts.fn = unsafe.Pointer(abi.FuncPCABI0(mstart))
  2840  		if msanenabled {
  2841  			msanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
  2842  		}
  2843  		if asanenabled {
  2844  			asanwrite(unsafe.Pointer(&ts), unsafe.Sizeof(ts))
  2845  		}
  2846  		execLock.rlock() // Prevent process clone.
  2847  		asmcgocall(_cgo_thread_start, unsafe.Pointer(&ts))
  2848  		execLock.runlock()
  2849  		return
  2850  	}
  2851  	execLock.rlock() // Prevent process clone.
  2852  	newosproc(mp)
  2853  	execLock.runlock()
  2854  }
  2855  
  2856  // startTemplateThread starts the template thread if it is not already
  2857  // running.
  2858  //
  2859  // The calling thread must itself be in a known-good state.
  2860  func startTemplateThread() {
  2861  	if GOARCH == "wasm" { // no threads on wasm yet
  2862  		return
  2863  	}
  2864  
  2865  	// Disable preemption to guarantee that the template thread will be
  2866  	// created before a park once haveTemplateThread is set.
  2867  	mp := acquirem()
  2868  	if !atomic.Cas(&newmHandoff.haveTemplateThread, 0, 1) {
  2869  		releasem(mp)
  2870  		return
  2871  	}
  2872  	newm(templateThread, nil, -1)
  2873  	releasem(mp)
  2874  }
  2875  
  2876  // templateThread is a thread in a known-good state that exists solely
  2877  // to start new threads in known-good states when the calling thread
  2878  // may not be in a good state.
  2879  //
  2880  // Many programs never need this, so templateThread is started lazily
  2881  // when we first enter a state that might lead to running on a thread
  2882  // in an unknown state.
  2883  //
  2884  // templateThread runs on an M without a P, so it must not have write
  2885  // barriers.
  2886  //
  2887  //go:nowritebarrierrec
  2888  func templateThread() {
  2889  	lock(&sched.lock)
  2890  	sched.nmsys++
  2891  	checkdead()
  2892  	unlock(&sched.lock)
  2893  
  2894  	for {
  2895  		lock(&newmHandoff.lock)
  2896  		for newmHandoff.newm != 0 {
  2897  			newm := newmHandoff.newm.ptr()
  2898  			newmHandoff.newm = 0
  2899  			unlock(&newmHandoff.lock)
  2900  			for newm != nil {
  2901  				next := newm.schedlink.ptr()
  2902  				newm.schedlink = 0
  2903  				newm1(newm)
  2904  				newm = next
  2905  			}
  2906  			lock(&newmHandoff.lock)
  2907  		}
  2908  		newmHandoff.waiting = true
  2909  		noteclear(&newmHandoff.wake)
  2910  		unlock(&newmHandoff.lock)
  2911  		notesleep(&newmHandoff.wake)
  2912  	}
  2913  }
  2914  
  2915  // Stops execution of the current m until new work is available.
  2916  // Returns with acquired P.
  2917  func stopm() {
  2918  	gp := getg()
  2919  
  2920  	if gp.m.locks != 0 {
  2921  		throw("stopm holding locks")
  2922  	}
  2923  	if gp.m.p != 0 {
  2924  		throw("stopm holding p")
  2925  	}
  2926  	if gp.m.spinning {
  2927  		throw("stopm spinning")
  2928  	}
  2929  
  2930  	lock(&sched.lock)
  2931  	mput(gp.m)
  2932  	unlock(&sched.lock)
  2933  	mPark()
  2934  	acquirep(gp.m.nextp.ptr())
  2935  	gp.m.nextp = 0
  2936  }
  2937  
  2938  func mspinning() {
  2939  	// startm's caller incremented nmspinning. Set the new M's spinning.
  2940  	getg().m.spinning = true
  2941  }
  2942  
  2943  // Schedules some M to run the p (creates an M if necessary).
  2944  // If p==nil, tries to get an idle P, if no idle P's does nothing.
  2945  // May run with m.p==nil, so write barriers are not allowed.
  2946  // If spinning is set, the caller has incremented nmspinning and must provide a
  2947  // P. startm will set m.spinning in the newly started M.
  2948  //
  2949  // Callers passing a non-nil P must call from a non-preemptible context. See
  2950  // comment on acquirem below.
  2951  //
  2952  // Argument lockheld indicates whether the caller already acquired the
  2953  // scheduler lock. Callers holding the lock when making the call must pass
  2954  // true. The lock might be temporarily dropped, but will be reacquired before
  2955  // returning.
  2956  //
  2957  // Must not have write barriers because this may be called without a P.
  2958  //
  2959  //go:nowritebarrierrec
  2960  func startm(pp *p, spinning, lockheld bool) {
  2961  	// Disable preemption.
  2962  	//
  2963  	// Every owned P must have an owner that will eventually stop it in the
  2964  	// event of a GC stop request. startm takes transient ownership of a P
  2965  	// (either from argument or pidleget below) and transfers ownership to
  2966  	// a started M, which will be responsible for performing the stop.
  2967  	//
  2968  	// Preemption must be disabled during this transient ownership,
  2969  	// otherwise the P this is running on may enter GC stop while still
  2970  	// holding the transient P, leaving that P in limbo and deadlocking the
  2971  	// STW.
  2972  	//
  2973  	// Callers passing a non-nil P must already be in non-preemptible
  2974  	// context, otherwise such preemption could occur on function entry to
  2975  	// startm. Callers passing a nil P may be preemptible, so we must
  2976  	// disable preemption before acquiring a P from pidleget below.
  2977  	mp := acquirem()
  2978  	if !lockheld {
  2979  		lock(&sched.lock)
  2980  	}
  2981  	if pp == nil {
  2982  		if spinning {
  2983  			// TODO(prattmic): All remaining calls to this function
  2984  			// with _p_ == nil could be cleaned up to find a P
  2985  			// before calling startm.
  2986  			throw("startm: P required for spinning=true")
  2987  		}
  2988  		pp, _ = pidleget(0)
  2989  		if pp == nil {
  2990  			if !lockheld {
  2991  				unlock(&sched.lock)
  2992  			}
  2993  			releasem(mp)
  2994  			return
  2995  		}
  2996  	}
  2997  	nmp := mget()
  2998  	if nmp == nil {
  2999  		// No M is available, we must drop sched.lock and call newm.
  3000  		// However, we already own a P to assign to the M.
  3001  		//
  3002  		// Once sched.lock is released, another G (e.g., in a syscall),
  3003  		// could find no idle P while checkdead finds a runnable G but
  3004  		// no running M's because this new M hasn't started yet, thus
  3005  		// throwing in an apparent deadlock.
  3006  		// This apparent deadlock is possible when startm is called
  3007  		// from sysmon, which doesn't count as a running M.
  3008  		//
  3009  		// Avoid this situation by pre-allocating the ID for the new M,
  3010  		// thus marking it as 'running' before we drop sched.lock. This
  3011  		// new M will eventually run the scheduler to execute any
  3012  		// queued G's.
  3013  		id := mReserveID()
  3014  		unlock(&sched.lock)
  3015  
  3016  		var fn func()
  3017  		if spinning {
  3018  			// The caller incremented nmspinning, so set m.spinning in the new M.
  3019  			fn = mspinning
  3020  		}
  3021  		newm(fn, pp, id)
  3022  
  3023  		if lockheld {
  3024  			lock(&sched.lock)
  3025  		}
  3026  		// Ownership transfer of pp committed by start in newm.
  3027  		// Preemption is now safe.
  3028  		releasem(mp)
  3029  		return
  3030  	}
  3031  	if !lockheld {
  3032  		unlock(&sched.lock)
  3033  	}
  3034  	if nmp.spinning {
  3035  		throw("startm: m is spinning")
  3036  	}
  3037  	if nmp.nextp != 0 {
  3038  		throw("startm: m has p")
  3039  	}
  3040  	if spinning && !runqempty(pp) {
  3041  		throw("startm: p has runnable gs")
  3042  	}
  3043  	// The caller incremented nmspinning, so set m.spinning in the new M.
  3044  	nmp.spinning = spinning
  3045  	nmp.nextp.set(pp)
  3046  	notewakeup(&nmp.park)
  3047  	// Ownership transfer of pp committed by wakeup. Preemption is now
  3048  	// safe.
  3049  	releasem(mp)
  3050  }
  3051  
  3052  // Hands off P from syscall or locked M.
  3053  // Always runs without a P, so write barriers are not allowed.
  3054  //
  3055  //go:nowritebarrierrec
  3056  func handoffp(pp *p) {
  3057  	// handoffp must start an M in any situation where
  3058  	// findrunnable would return a G to run on pp.
  3059  
  3060  	// if it has local work, start it straight away
  3061  	if !runqempty(pp) || sched.runqsize != 0 {
  3062  		startm(pp, false, false)
  3063  		return
  3064  	}
  3065  	// if there's trace work to do, start it straight away
  3066  	if (traceEnabled() || traceShuttingDown()) && traceReaderAvailable() != nil {
  3067  		startm(pp, false, false)
  3068  		return
  3069  	}
  3070  	// if it has GC work, start it straight away
  3071  	if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) {
  3072  		startm(pp, false, false)
  3073  		return
  3074  	}
  3075  	// no local work, check that there are no spinning/idle M's,
  3076  	// otherwise our help is not required
  3077  	if sched.nmspinning.Load()+sched.npidle.Load() == 0 && sched.nmspinning.CompareAndSwap(0, 1) { // TODO: fast atomic
  3078  		sched.needspinning.Store(0)
  3079  		startm(pp, true, false)
  3080  		return
  3081  	}
  3082  	lock(&sched.lock)
  3083  	if sched.gcwaiting.Load() {
  3084  		pp.status = _Pgcstop
  3085  		pp.gcStopTime = nanotime()
  3086  		sched.stopwait--
  3087  		if sched.stopwait == 0 {
  3088  			notewakeup(&sched.stopnote)
  3089  		}
  3090  		unlock(&sched.lock)
  3091  		return
  3092  	}
  3093  	if pp.runSafePointFn != 0 && atomic.Cas(&pp.runSafePointFn, 1, 0) {
  3094  		sched.safePointFn(pp)
  3095  		sched.safePointWait--
  3096  		if sched.safePointWait == 0 {
  3097  			notewakeup(&sched.safePointNote)
  3098  		}
  3099  	}
  3100  	if sched.runqsize != 0 {
  3101  		unlock(&sched.lock)
  3102  		startm(pp, false, false)
  3103  		return
  3104  	}
  3105  	// If this is the last running P and nobody is polling network,
  3106  	// need to wakeup another M to poll network.
  3107  	if sched.npidle.Load() == gomaxprocs-1 && sched.lastpoll.Load() != 0 {
  3108  		unlock(&sched.lock)
  3109  		startm(pp, false, false)
  3110  		return
  3111  	}
  3112  
  3113  	// The scheduler lock cannot be held when calling wakeNetPoller below
  3114  	// because wakeNetPoller may call wakep which may call startm.
  3115  	when := pp.timers.wakeTime()
  3116  	pidleput(pp, 0)
  3117  	unlock(&sched.lock)
  3118  
  3119  	if when != 0 {
  3120  		wakeNetPoller(when)
  3121  	}
  3122  }
  3123  
  3124  // Tries to add one more P to execute G's.
  3125  // Called when a G is made runnable (newproc, ready).
  3126  // Must be called with a P.
  3127  //
  3128  // wakep should be an internal detail,
  3129  // but widely used packages access it using linkname.
  3130  // Notable members of the hall of shame include:
  3131  //   - gvisor.dev/gvisor
  3132  //
  3133  // Do not remove or change the type signature.
  3134  // See go.dev/issue/67401.
  3135  //
  3136  //go:linkname wakep
  3137  func wakep() {
  3138  	// Be conservative about spinning threads, only start one if none exist
  3139  	// already.
  3140  	if sched.nmspinning.Load() != 0 || !sched.nmspinning.CompareAndSwap(0, 1) {
  3141  		return
  3142  	}
  3143  
  3144  	// Disable preemption until ownership of pp transfers to the next M in
  3145  	// startm. Otherwise preemption here would leave pp stuck waiting to
  3146  	// enter _Pgcstop.
  3147  	//
  3148  	// See preemption comment on acquirem in startm for more details.
  3149  	mp := acquirem()
  3150  
  3151  	var pp *p
  3152  	lock(&sched.lock)
  3153  	pp, _ = pidlegetSpinning(0)
  3154  	if pp == nil {
  3155  		if sched.nmspinning.Add(-1) < 0 {
  3156  			throw("wakep: negative nmspinning")
  3157  		}
  3158  		unlock(&sched.lock)
  3159  		releasem(mp)
  3160  		return
  3161  	}
  3162  	// Since we always have a P, the race in the "No M is available"
  3163  	// comment in startm doesn't apply during the small window between the
  3164  	// unlock here and lock in startm. A checkdead in between will always
  3165  	// see at least one running M (ours).
  3166  	unlock(&sched.lock)
  3167  
  3168  	startm(pp, true, false)
  3169  
  3170  	releasem(mp)
  3171  }
  3172  
  3173  // Stops execution of the current m that is locked to a g until the g is runnable again.
  3174  // Returns with acquired P.
  3175  func stoplockedm() {
  3176  	gp := getg()
  3177  
  3178  	if gp.m.lockedg == 0 || gp.m.lockedg.ptr().lockedm.ptr() != gp.m {
  3179  		throw("stoplockedm: inconsistent locking")
  3180  	}
  3181  	if gp.m.p != 0 {
  3182  		// Schedule another M to run this p.
  3183  		pp := releasep()
  3184  		handoffp(pp)
  3185  	}
  3186  	incidlelocked(1)
  3187  	// Wait until another thread schedules lockedg again.
  3188  	mPark()
  3189  	status := readgstatus(gp.m.lockedg.ptr())
  3190  	if status&^_Gscan != _Grunnable {
  3191  		print("runtime:stoplockedm: lockedg (atomicstatus=", status, ") is not Grunnable or Gscanrunnable\n")
  3192  		dumpgstatus(gp.m.lockedg.ptr())
  3193  		throw("stoplockedm: not runnable")
  3194  	}
  3195  	acquirep(gp.m.nextp.ptr())
  3196  	gp.m.nextp = 0
  3197  }
  3198  
  3199  // Schedules the locked m to run the locked gp.
  3200  // May run during STW, so write barriers are not allowed.
  3201  //
  3202  //go:nowritebarrierrec
  3203  func startlockedm(gp *g) {
  3204  	mp := gp.lockedm.ptr()
  3205  	if mp == getg().m {
  3206  		throw("startlockedm: locked to me")
  3207  	}
  3208  	if mp.nextp != 0 {
  3209  		throw("startlockedm: m has p")
  3210  	}
  3211  	// directly handoff current P to the locked m
  3212  	incidlelocked(-1)
  3213  	pp := releasep()
  3214  	mp.nextp.set(pp)
  3215  	notewakeup(&mp.park)
  3216  	stopm()
  3217  }
  3218  
  3219  // Stops the current m for stopTheWorld.
  3220  // Returns when the world is restarted.
  3221  func gcstopm() {
  3222  	gp := getg()
  3223  
  3224  	if !sched.gcwaiting.Load() {
  3225  		throw("gcstopm: not waiting for gc")
  3226  	}
  3227  	if gp.m.spinning {
  3228  		gp.m.spinning = false
  3229  		// OK to just drop nmspinning here,
  3230  		// startTheWorld will unpark threads as necessary.
  3231  		if sched.nmspinning.Add(-1) < 0 {
  3232  			throw("gcstopm: negative nmspinning")
  3233  		}
  3234  	}
  3235  	pp := releasep()
  3236  	lock(&sched.lock)
  3237  	pp.status = _Pgcstop
  3238  	pp.gcStopTime = nanotime()
  3239  	sched.stopwait--
  3240  	if sched.stopwait == 0 {
  3241  		notewakeup(&sched.stopnote)
  3242  	}
  3243  	unlock(&sched.lock)
  3244  	stopm()
  3245  }
  3246  
  3247  // Schedules gp to run on the current M.
  3248  // If inheritTime is true, gp inherits the remaining time in the
  3249  // current time slice. Otherwise, it starts a new time slice.
  3250  // Never returns.
  3251  //
  3252  // Write barriers are allowed because this is called immediately after
  3253  // acquiring a P in several places.
  3254  //
  3255  //go:yeswritebarrierrec
  3256  func execute(gp *g, inheritTime bool) {
  3257  	mp := getg().m
  3258  
  3259  	if goroutineProfile.active {
  3260  		// Make sure that gp has had its stack written out to the goroutine
  3261  		// profile, exactly as it was when the goroutine profiler first stopped
  3262  		// the world.
  3263  		tryRecordGoroutineProfile(gp, nil, osyield)
  3264  	}
  3265  
  3266  	// Assign gp.m before entering _Grunning so running Gs have an
  3267  	// M.
  3268  	mp.curg = gp
  3269  	gp.m = mp
  3270  	casgstatus(gp, _Grunnable, _Grunning)
  3271  	gp.waitsince = 0
  3272  	gp.preempt = false
  3273  	gp.stackguard0 = gp.stack.lo + stackGuard
  3274  	if !inheritTime {
  3275  		mp.p.ptr().schedtick++
  3276  	}
  3277  
  3278  	// Check whether the profiler needs to be turned on or off.
  3279  	hz := sched.profilehz
  3280  	if mp.profilehz != hz {
  3281  		setThreadCPUProfiler(hz)
  3282  	}
  3283  
  3284  	trace := traceAcquire()
  3285  	if trace.ok() {
  3286  		trace.GoStart()
  3287  		traceRelease(trace)
  3288  	}
  3289  
  3290  	gogo(&gp.sched)
  3291  }
  3292  
  3293  // Finds a runnable goroutine to execute.
  3294  // Tries to steal from other P's, get g from local or global queue, poll network.
  3295  // tryWakeP indicates that the returned goroutine is not normal (GC worker, trace
  3296  // reader) so the caller should try to wake a P.
  3297  func findRunnable() (gp *g, inheritTime, tryWakeP bool) {
  3298  	mp := getg().m
  3299  
  3300  	// The conditions here and in handoffp must agree: if
  3301  	// findrunnable would return a G to run, handoffp must start
  3302  	// an M.
  3303  
  3304  top:
  3305  	pp := mp.p.ptr()
  3306  	if sched.gcwaiting.Load() {
  3307  		gcstopm()
  3308  		goto top
  3309  	}
  3310  	if pp.runSafePointFn != 0 {
  3311  		runSafePointFn()
  3312  	}
  3313  
  3314  	// now and pollUntil are saved for work stealing later,
  3315  	// which may steal timers. It's important that between now
  3316  	// and then, nothing blocks, so these numbers remain mostly
  3317  	// relevant.
  3318  	now, pollUntil, _ := pp.timers.check(0)
  3319  
  3320  	// Try to schedule the trace reader.
  3321  	if traceEnabled() || traceShuttingDown() {
  3322  		gp := traceReader()
  3323  		if gp != nil {
  3324  			trace := traceAcquire()
  3325  			casgstatus(gp, _Gwaiting, _Grunnable)
  3326  			if trace.ok() {
  3327  				trace.GoUnpark(gp, 0)
  3328  				traceRelease(trace)
  3329  			}
  3330  			return gp, false, true
  3331  		}
  3332  	}
  3333  
  3334  	// Try to schedule a GC worker.
  3335  	if gcBlackenEnabled != 0 {
  3336  		gp, tnow := gcController.findRunnableGCWorker(pp, now)
  3337  		if gp != nil {
  3338  			return gp, false, true
  3339  		}
  3340  		now = tnow
  3341  	}
  3342  
  3343  	// Check the global runnable queue once in a while to ensure fairness.
  3344  	// Otherwise two goroutines can completely occupy the local runqueue
  3345  	// by constantly respawning each other.
  3346  	if pp.schedtick%61 == 0 && sched.runqsize > 0 {
  3347  		lock(&sched.lock)
  3348  		gp := globrunqget(pp, 1)
  3349  		unlock(&sched.lock)
  3350  		if gp != nil {
  3351  			return gp, false, false
  3352  		}
  3353  	}
  3354  
  3355  	// Wake up the finalizer G.
  3356  	if fingStatus.Load()&(fingWait|fingWake) == fingWait|fingWake {
  3357  		if gp := wakefing(); gp != nil {
  3358  			ready(gp, 0, true)
  3359  		}
  3360  	}
  3361  	if *cgo_yield != nil {
  3362  		asmcgocall(*cgo_yield, nil)
  3363  	}
  3364  
  3365  	// local runq
  3366  	if gp, inheritTime := runqget(pp); gp != nil {
  3367  		return gp, inheritTime, false
  3368  	}
  3369  
  3370  	// global runq
  3371  	if sched.runqsize != 0 {
  3372  		lock(&sched.lock)
  3373  		gp := globrunqget(pp, 0)
  3374  		unlock(&sched.lock)
  3375  		if gp != nil {
  3376  			return gp, false, false
  3377  		}
  3378  	}
  3379  
  3380  	// Poll network.
  3381  	// This netpoll is only an optimization before we resort to stealing.
  3382  	// We can safely skip it if there are no waiters or a thread is blocked
  3383  	// in netpoll already. If there is any kind of logical race with that
  3384  	// blocked thread (e.g. it has already returned from netpoll, but does
  3385  	// not set lastpoll yet), this thread will do blocking netpoll below
  3386  	// anyway.
  3387  	if netpollinited() && netpollAnyWaiters() && sched.lastpoll.Load() != 0 {
  3388  		if list, delta := netpoll(0); !list.empty() { // non-blocking
  3389  			gp := list.pop()
  3390  			injectglist(&list)
  3391  			netpollAdjustWaiters(delta)
  3392  			trace := traceAcquire()
  3393  			casgstatus(gp, _Gwaiting, _Grunnable)
  3394  			if trace.ok() {
  3395  				trace.GoUnpark(gp, 0)
  3396  				traceRelease(trace)
  3397  			}
  3398  			return gp, false, false
  3399  		}
  3400  	}
  3401  
  3402  	// Spinning Ms: steal work from other Ps.
  3403  	//
  3404  	// Limit the number of spinning Ms to half the number of busy Ps.
  3405  	// This is necessary to prevent excessive CPU consumption when
  3406  	// GOMAXPROCS>>1 but the program parallelism is low.
  3407  	if mp.spinning || 2*sched.nmspinning.Load() < gomaxprocs-sched.npidle.Load() {
  3408  		if !mp.spinning {
  3409  			mp.becomeSpinning()
  3410  		}
  3411  
  3412  		gp, inheritTime, tnow, w, newWork := stealWork(now)
  3413  		if gp != nil {
  3414  			// Successfully stole.
  3415  			return gp, inheritTime, false
  3416  		}
  3417  		if newWork {
  3418  			// There may be new timer or GC work; restart to
  3419  			// discover.
  3420  			goto top
  3421  		}
  3422  
  3423  		now = tnow
  3424  		if w != 0 && (pollUntil == 0 || w < pollUntil) {
  3425  			// Earlier timer to wait for.
  3426  			pollUntil = w
  3427  		}
  3428  	}
  3429  
  3430  	// We have nothing to do.
  3431  	//
  3432  	// If we're in the GC mark phase, can safely scan and blacken objects,
  3433  	// and have work to do, run idle-time marking rather than give up the P.
  3434  	if gcBlackenEnabled != 0 && gcMarkWorkAvailable(pp) && gcController.addIdleMarkWorker() {
  3435  		node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
  3436  		if node != nil {
  3437  			pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
  3438  			gp := node.gp.ptr()
  3439  
  3440  			trace := traceAcquire()
  3441  			casgstatus(gp, _Gwaiting, _Grunnable)
  3442  			if trace.ok() {
  3443  				trace.GoUnpark(gp, 0)
  3444  				traceRelease(trace)
  3445  			}
  3446  			return gp, false, false
  3447  		}
  3448  		gcController.removeIdleMarkWorker()
  3449  	}
  3450  
  3451  	// wasm only:
  3452  	// If a callback returned and no other goroutine is awake,
  3453  	// then wake event handler goroutine which pauses execution
  3454  	// until a callback was triggered.
  3455  	gp, otherReady := beforeIdle(now, pollUntil)
  3456  	if gp != nil {
  3457  		trace := traceAcquire()
  3458  		casgstatus(gp, _Gwaiting, _Grunnable)
  3459  		if trace.ok() {
  3460  			trace.GoUnpark(gp, 0)
  3461  			traceRelease(trace)
  3462  		}
  3463  		return gp, false, false
  3464  	}
  3465  	if otherReady {
  3466  		goto top
  3467  	}
  3468  
  3469  	// Before we drop our P, make a snapshot of the allp slice,
  3470  	// which can change underfoot once we no longer block
  3471  	// safe-points. We don't need to snapshot the contents because
  3472  	// everything up to cap(allp) is immutable.
  3473  	allpSnapshot := allp
  3474  	// Also snapshot masks. Value changes are OK, but we can't allow
  3475  	// len to change out from under us.
  3476  	idlepMaskSnapshot := idlepMask
  3477  	timerpMaskSnapshot := timerpMask
  3478  
  3479  	// return P and block
  3480  	lock(&sched.lock)
  3481  	if sched.gcwaiting.Load() || pp.runSafePointFn != 0 {
  3482  		unlock(&sched.lock)
  3483  		goto top
  3484  	}
  3485  	if sched.runqsize != 0 {
  3486  		gp := globrunqget(pp, 0)
  3487  		unlock(&sched.lock)
  3488  		return gp, false, false
  3489  	}
  3490  	if !mp.spinning && sched.needspinning.Load() == 1 {
  3491  		// See "Delicate dance" comment below.
  3492  		mp.becomeSpinning()
  3493  		unlock(&sched.lock)
  3494  		goto top
  3495  	}
  3496  	if releasep() != pp {
  3497  		throw("findrunnable: wrong p")
  3498  	}
  3499  	now = pidleput(pp, now)
  3500  	unlock(&sched.lock)
  3501  
  3502  	// Delicate dance: thread transitions from spinning to non-spinning
  3503  	// state, potentially concurrently with submission of new work. We must
  3504  	// drop nmspinning first and then check all sources again (with
  3505  	// #StoreLoad memory barrier in between). If we do it the other way
  3506  	// around, another thread can submit work after we've checked all
  3507  	// sources but before we drop nmspinning; as a result nobody will
  3508  	// unpark a thread to run the work.
  3509  	//
  3510  	// This applies to the following sources of work:
  3511  	//
  3512  	// * Goroutines added to the global or a per-P run queue.
  3513  	// * New/modified-earlier timers on a per-P timer heap.
  3514  	// * Idle-priority GC work (barring golang.org/issue/19112).
  3515  	//
  3516  	// If we discover new work below, we need to restore m.spinning as a
  3517  	// signal for resetspinning to unpark a new worker thread (because
  3518  	// there can be more than one starving goroutine).
  3519  	//
  3520  	// However, if after discovering new work we also observe no idle Ps
  3521  	// (either here or in resetspinning), we have a problem. We may be
  3522  	// racing with a non-spinning M in the block above, having found no
  3523  	// work and preparing to release its P and park. Allowing that P to go
  3524  	// idle will result in loss of work conservation (idle P while there is
  3525  	// runnable work). This could result in complete deadlock in the
  3526  	// unlikely event that we discover new work (from netpoll) right as we
  3527  	// are racing with _all_ other Ps going idle.
  3528  	//
  3529  	// We use sched.needspinning to synchronize with non-spinning Ms going
  3530  	// idle. If needspinning is set when they are about to drop their P,
  3531  	// they abort the drop and instead become a new spinning M on our
  3532  	// behalf. If we are not racing and the system is truly fully loaded
  3533  	// then no spinning threads are required, and the next thread to
  3534  	// naturally become spinning will clear the flag.
  3535  	//
  3536  	// Also see "Worker thread parking/unparking" comment at the top of the
  3537  	// file.
  3538  	wasSpinning := mp.spinning
  3539  	if mp.spinning {
  3540  		mp.spinning = false
  3541  		if sched.nmspinning.Add(-1) < 0 {
  3542  			throw("findrunnable: negative nmspinning")
  3543  		}
  3544  
  3545  		// Note the for correctness, only the last M transitioning from
  3546  		// spinning to non-spinning must perform these rechecks to
  3547  		// ensure no missed work. However, the runtime has some cases
  3548  		// of transient increments of nmspinning that are decremented
  3549  		// without going through this path, so we must be conservative
  3550  		// and perform the check on all spinning Ms.
  3551  		//
  3552  		// See https://go.dev/issue/43997.
  3553  
  3554  		// Check global and P runqueues again.
  3555  
  3556  		lock(&sched.lock)
  3557  		if sched.runqsize != 0 {
  3558  			pp, _ := pidlegetSpinning(0)
  3559  			if pp != nil {
  3560  				gp := globrunqget(pp, 0)
  3561  				if gp == nil {
  3562  					throw("global runq empty with non-zero runqsize")
  3563  				}
  3564  				unlock(&sched.lock)
  3565  				acquirep(pp)
  3566  				mp.becomeSpinning()
  3567  				return gp, false, false
  3568  			}
  3569  		}
  3570  		unlock(&sched.lock)
  3571  
  3572  		pp := checkRunqsNoP(allpSnapshot, idlepMaskSnapshot)
  3573  		if pp != nil {
  3574  			acquirep(pp)
  3575  			mp.becomeSpinning()
  3576  			goto top
  3577  		}
  3578  
  3579  		// Check for idle-priority GC work again.
  3580  		pp, gp := checkIdleGCNoP()
  3581  		if pp != nil {
  3582  			acquirep(pp)
  3583  			mp.becomeSpinning()
  3584  
  3585  			// Run the idle worker.
  3586  			pp.gcMarkWorkerMode = gcMarkWorkerIdleMode
  3587  			trace := traceAcquire()
  3588  			casgstatus(gp, _Gwaiting, _Grunnable)
  3589  			if trace.ok() {
  3590  				trace.GoUnpark(gp, 0)
  3591  				traceRelease(trace)
  3592  			}
  3593  			return gp, false, false
  3594  		}
  3595  
  3596  		// Finally, check for timer creation or expiry concurrently with
  3597  		// transitioning from spinning to non-spinning.
  3598  		//
  3599  		// Note that we cannot use checkTimers here because it calls
  3600  		// adjusttimers which may need to allocate memory, and that isn't
  3601  		// allowed when we don't have an active P.
  3602  		pollUntil = checkTimersNoP(allpSnapshot, timerpMaskSnapshot, pollUntil)
  3603  	}
  3604  
  3605  	// Poll network until next timer.
  3606  	if netpollinited() && (netpollAnyWaiters() || pollUntil != 0) && sched.lastpoll.Swap(0) != 0 {
  3607  		sched.pollUntil.Store(pollUntil)
  3608  		if mp.p != 0 {
  3609  			throw("findrunnable: netpoll with p")
  3610  		}
  3611  		if mp.spinning {
  3612  			throw("findrunnable: netpoll with spinning")
  3613  		}
  3614  		delay := int64(-1)
  3615  		if pollUntil != 0 {
  3616  			if now == 0 {
  3617  				now = nanotime()
  3618  			}
  3619  			delay = pollUntil - now
  3620  			if delay < 0 {
  3621  				delay = 0
  3622  			}
  3623  		}
  3624  		if faketime != 0 {
  3625  			// When using fake time, just poll.
  3626  			delay = 0
  3627  		}
  3628  		list, delta := netpoll(delay) // block until new work is available
  3629  		// Refresh now again, after potentially blocking.
  3630  		now = nanotime()
  3631  		sched.pollUntil.Store(0)
  3632  		sched.lastpoll.Store(now)
  3633  		if faketime != 0 && list.empty() {
  3634  			// Using fake time and nothing is ready; stop M.
  3635  			// When all M's stop, checkdead will call timejump.
  3636  			stopm()
  3637  			goto top
  3638  		}
  3639  		lock(&sched.lock)
  3640  		pp, _ := pidleget(now)
  3641  		unlock(&sched.lock)
  3642  		if pp == nil {
  3643  			injectglist(&list)
  3644  			netpollAdjustWaiters(delta)
  3645  		} else {
  3646  			acquirep(pp)
  3647  			if !list.empty() {
  3648  				gp := list.pop()
  3649  				injectglist(&list)
  3650  				netpollAdjustWaiters(delta)
  3651  				trace := traceAcquire()
  3652  				casgstatus(gp, _Gwaiting, _Grunnable)
  3653  				if trace.ok() {
  3654  					trace.GoUnpark(gp, 0)
  3655  					traceRelease(trace)
  3656  				}
  3657  				return gp, false, false
  3658  			}
  3659  			if wasSpinning {
  3660  				mp.becomeSpinning()
  3661  			}
  3662  			goto top
  3663  		}
  3664  	} else if pollUntil != 0 && netpollinited() {
  3665  		pollerPollUntil := sched.pollUntil.Load()
  3666  		if pollerPollUntil == 0 || pollerPollUntil > pollUntil {
  3667  			netpollBreak()
  3668  		}
  3669  	}
  3670  	stopm()
  3671  	goto top
  3672  }
  3673  
  3674  // pollWork reports whether there is non-background work this P could
  3675  // be doing. This is a fairly lightweight check to be used for
  3676  // background work loops, like idle GC. It checks a subset of the
  3677  // conditions checked by the actual scheduler.
  3678  func pollWork() bool {
  3679  	if sched.runqsize != 0 {
  3680  		return true
  3681  	}
  3682  	p := getg().m.p.ptr()
  3683  	if !runqempty(p) {
  3684  		return true
  3685  	}
  3686  	if netpollinited() && netpollAnyWaiters() && sched.lastpoll.Load() != 0 {
  3687  		if list, delta := netpoll(0); !list.empty() {
  3688  			injectglist(&list)
  3689  			netpollAdjustWaiters(delta)
  3690  			return true
  3691  		}
  3692  	}
  3693  	return false
  3694  }
  3695  
  3696  // stealWork attempts to steal a runnable goroutine or timer from any P.
  3697  //
  3698  // If newWork is true, new work may have been readied.
  3699  //
  3700  // If now is not 0 it is the current time. stealWork returns the passed time or
  3701  // the current time if now was passed as 0.
  3702  func stealWork(now int64) (gp *g, inheritTime bool, rnow, pollUntil int64, newWork bool) {
  3703  	pp := getg().m.p.ptr()
  3704  
  3705  	ranTimer := false
  3706  
  3707  	const stealTries = 4
  3708  	for i := 0; i < stealTries; i++ {
  3709  		stealTimersOrRunNextG := i == stealTries-1
  3710  
  3711  		for enum := stealOrder.start(cheaprand()); !enum.done(); enum.next() {
  3712  			if sched.gcwaiting.Load() {
  3713  				// GC work may be available.
  3714  				return nil, false, now, pollUntil, true
  3715  			}
  3716  			p2 := allp[enum.position()]
  3717  			if pp == p2 {
  3718  				continue
  3719  			}
  3720  
  3721  			// Steal timers from p2. This call to checkTimers is the only place
  3722  			// where we might hold a lock on a different P's timers. We do this
  3723  			// once on the last pass before checking runnext because stealing
  3724  			// from the other P's runnext should be the last resort, so if there
  3725  			// are timers to steal do that first.
  3726  			//
  3727  			// We only check timers on one of the stealing iterations because
  3728  			// the time stored in now doesn't change in this loop and checking
  3729  			// the timers for each P more than once with the same value of now
  3730  			// is probably a waste of time.
  3731  			//
  3732  			// timerpMask tells us whether the P may have timers at all. If it
  3733  			// can't, no need to check at all.
  3734  			if stealTimersOrRunNextG && timerpMask.read(enum.position()) {
  3735  				tnow, w, ran := p2.timers.check(now)
  3736  				now = tnow
  3737  				if w != 0 && (pollUntil == 0 || w < pollUntil) {
  3738  					pollUntil = w
  3739  				}
  3740  				if ran {
  3741  					// Running the timers may have
  3742  					// made an arbitrary number of G's
  3743  					// ready and added them to this P's
  3744  					// local run queue. That invalidates
  3745  					// the assumption of runqsteal
  3746  					// that it always has room to add
  3747  					// stolen G's. So check now if there
  3748  					// is a local G to run.
  3749  					if gp, inheritTime := runqget(pp); gp != nil {
  3750  						return gp, inheritTime, now, pollUntil, ranTimer
  3751  					}
  3752  					ranTimer = true
  3753  				}
  3754  			}
  3755  
  3756  			// Don't bother to attempt to steal if p2 is idle.
  3757  			if !idlepMask.read(enum.position()) {
  3758  				if gp := runqsteal(pp, p2, stealTimersOrRunNextG); gp != nil {
  3759  					return gp, false, now, pollUntil, ranTimer
  3760  				}
  3761  			}
  3762  		}
  3763  	}
  3764  
  3765  	// No goroutines found to steal. Regardless, running a timer may have
  3766  	// made some goroutine ready that we missed. Indicate the next timer to
  3767  	// wait for.
  3768  	return nil, false, now, pollUntil, ranTimer
  3769  }
  3770  
  3771  // Check all Ps for a runnable G to steal.
  3772  //
  3773  // On entry we have no P. If a G is available to steal and a P is available,
  3774  // the P is returned which the caller should acquire and attempt to steal the
  3775  // work to.
  3776  func checkRunqsNoP(allpSnapshot []*p, idlepMaskSnapshot pMask) *p {
  3777  	for id, p2 := range allpSnapshot {
  3778  		if !idlepMaskSnapshot.read(uint32(id)) && !runqempty(p2) {
  3779  			lock(&sched.lock)
  3780  			pp, _ := pidlegetSpinning(0)
  3781  			if pp == nil {
  3782  				// Can't get a P, don't bother checking remaining Ps.
  3783  				unlock(&sched.lock)
  3784  				return nil
  3785  			}
  3786  			unlock(&sched.lock)
  3787  			return pp
  3788  		}
  3789  	}
  3790  
  3791  	// No work available.
  3792  	return nil
  3793  }
  3794  
  3795  // Check all Ps for a timer expiring sooner than pollUntil.
  3796  //
  3797  // Returns updated pollUntil value.
  3798  func checkTimersNoP(allpSnapshot []*p, timerpMaskSnapshot pMask, pollUntil int64) int64 {
  3799  	for id, p2 := range allpSnapshot {
  3800  		if timerpMaskSnapshot.read(uint32(id)) {
  3801  			w := p2.timers.wakeTime()
  3802  			if w != 0 && (pollUntil == 0 || w < pollUntil) {
  3803  				pollUntil = w
  3804  			}
  3805  		}
  3806  	}
  3807  
  3808  	return pollUntil
  3809  }
  3810  
  3811  // Check for idle-priority GC, without a P on entry.
  3812  //
  3813  // If some GC work, a P, and a worker G are all available, the P and G will be
  3814  // returned. The returned P has not been wired yet.
  3815  func checkIdleGCNoP() (*p, *g) {
  3816  	// N.B. Since we have no P, gcBlackenEnabled may change at any time; we
  3817  	// must check again after acquiring a P. As an optimization, we also check
  3818  	// if an idle mark worker is needed at all. This is OK here, because if we
  3819  	// observe that one isn't needed, at least one is currently running. Even if
  3820  	// it stops running, its own journey into the scheduler should schedule it
  3821  	// again, if need be (at which point, this check will pass, if relevant).
  3822  	if atomic.Load(&gcBlackenEnabled) == 0 || !gcController.needIdleMarkWorker() {
  3823  		return nil, nil
  3824  	}
  3825  	if !gcMarkWorkAvailable(nil) {
  3826  		return nil, nil
  3827  	}
  3828  
  3829  	// Work is available; we can start an idle GC worker only if there is
  3830  	// an available P and available worker G.
  3831  	//
  3832  	// We can attempt to acquire these in either order, though both have
  3833  	// synchronization concerns (see below). Workers are almost always
  3834  	// available (see comment in findRunnableGCWorker for the one case
  3835  	// there may be none). Since we're slightly less likely to find a P,
  3836  	// check for that first.
  3837  	//
  3838  	// Synchronization: note that we must hold sched.lock until we are
  3839  	// committed to keeping it. Otherwise we cannot put the unnecessary P
  3840  	// back in sched.pidle without performing the full set of idle
  3841  	// transition checks.
  3842  	//
  3843  	// If we were to check gcBgMarkWorkerPool first, we must somehow handle
  3844  	// the assumption in gcControllerState.findRunnableGCWorker that an
  3845  	// empty gcBgMarkWorkerPool is only possible if gcMarkDone is running.
  3846  	lock(&sched.lock)
  3847  	pp, now := pidlegetSpinning(0)
  3848  	if pp == nil {
  3849  		unlock(&sched.lock)
  3850  		return nil, nil
  3851  	}
  3852  
  3853  	// Now that we own a P, gcBlackenEnabled can't change (as it requires STW).
  3854  	if gcBlackenEnabled == 0 || !gcController.addIdleMarkWorker() {
  3855  		pidleput(pp, now)
  3856  		unlock(&sched.lock)
  3857  		return nil, nil
  3858  	}
  3859  
  3860  	node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
  3861  	if node == nil {
  3862  		pidleput(pp, now)
  3863  		unlock(&sched.lock)
  3864  		gcController.removeIdleMarkWorker()
  3865  		return nil, nil
  3866  	}
  3867  
  3868  	unlock(&sched.lock)
  3869  
  3870  	return pp, node.gp.ptr()
  3871  }
  3872  
  3873  // wakeNetPoller wakes up the thread sleeping in the network poller if it isn't
  3874  // going to wake up before the when argument; or it wakes an idle P to service
  3875  // timers and the network poller if there isn't one already.
  3876  func wakeNetPoller(when int64) {
  3877  	if sched.lastpoll.Load() == 0 {
  3878  		// In findrunnable we ensure that when polling the pollUntil
  3879  		// field is either zero or the time to which the current
  3880  		// poll is expected to run. This can have a spurious wakeup
  3881  		// but should never miss a wakeup.
  3882  		pollerPollUntil := sched.pollUntil.Load()
  3883  		if pollerPollUntil == 0 || pollerPollUntil > when {
  3884  			netpollBreak()
  3885  		}
  3886  	} else {
  3887  		// There are no threads in the network poller, try to get
  3888  		// one there so it can handle new timers.
  3889  		if GOOS != "plan9" { // Temporary workaround - see issue #42303.
  3890  			wakep()
  3891  		}
  3892  	}
  3893  }
  3894  
  3895  func resetspinning() {
  3896  	gp := getg()
  3897  	if !gp.m.spinning {
  3898  		throw("resetspinning: not a spinning m")
  3899  	}
  3900  	gp.m.spinning = false
  3901  	nmspinning := sched.nmspinning.Add(-1)
  3902  	if nmspinning < 0 {
  3903  		throw("findrunnable: negative nmspinning")
  3904  	}
  3905  	// M wakeup policy is deliberately somewhat conservative, so check if we
  3906  	// need to wakeup another P here. See "Worker thread parking/unparking"
  3907  	// comment at the top of the file for details.
  3908  	wakep()
  3909  }
  3910  
  3911  // injectglist adds each runnable G on the list to some run queue,
  3912  // and clears glist. If there is no current P, they are added to the
  3913  // global queue, and up to npidle M's are started to run them.
  3914  // Otherwise, for each idle P, this adds a G to the global queue
  3915  // and starts an M. Any remaining G's are added to the current P's
  3916  // local run queue.
  3917  // This may temporarily acquire sched.lock.
  3918  // Can run concurrently with GC.
  3919  func injectglist(glist *gList) {
  3920  	if glist.empty() {
  3921  		return
  3922  	}
  3923  
  3924  	// Mark all the goroutines as runnable before we put them
  3925  	// on the run queues.
  3926  	head := glist.head.ptr()
  3927  	var tail *g
  3928  	qsize := 0
  3929  	trace := traceAcquire()
  3930  	for gp := head; gp != nil; gp = gp.schedlink.ptr() {
  3931  		tail = gp
  3932  		qsize++
  3933  		casgstatus(gp, _Gwaiting, _Grunnable)
  3934  		if trace.ok() {
  3935  			trace.GoUnpark(gp, 0)
  3936  		}
  3937  	}
  3938  	if trace.ok() {
  3939  		traceRelease(trace)
  3940  	}
  3941  
  3942  	// Turn the gList into a gQueue.
  3943  	var q gQueue
  3944  	q.head.set(head)
  3945  	q.tail.set(tail)
  3946  	*glist = gList{}
  3947  
  3948  	startIdle := func(n int) {
  3949  		for i := 0; i < n; i++ {
  3950  			mp := acquirem() // See comment in startm.
  3951  			lock(&sched.lock)
  3952  
  3953  			pp, _ := pidlegetSpinning(0)
  3954  			if pp == nil {
  3955  				unlock(&sched.lock)
  3956  				releasem(mp)
  3957  				break
  3958  			}
  3959  
  3960  			startm(pp, false, true)
  3961  			unlock(&sched.lock)
  3962  			releasem(mp)
  3963  		}
  3964  	}
  3965  
  3966  	pp := getg().m.p.ptr()
  3967  	if pp == nil {
  3968  		lock(&sched.lock)
  3969  		globrunqputbatch(&q, int32(qsize))
  3970  		unlock(&sched.lock)
  3971  		startIdle(qsize)
  3972  		return
  3973  	}
  3974  
  3975  	npidle := int(sched.npidle.Load())
  3976  	var (
  3977  		globq gQueue
  3978  		n     int
  3979  	)
  3980  	for n = 0; n < npidle && !q.empty(); n++ {
  3981  		g := q.pop()
  3982  		globq.pushBack(g)
  3983  	}
  3984  	if n > 0 {
  3985  		lock(&sched.lock)
  3986  		globrunqputbatch(&globq, int32(n))
  3987  		unlock(&sched.lock)
  3988  		startIdle(n)
  3989  		qsize -= n
  3990  	}
  3991  
  3992  	if !q.empty() {
  3993  		runqputbatch(pp, &q, qsize)
  3994  	}
  3995  
  3996  	// Some P's might have become idle after we loaded `sched.npidle`
  3997  	// but before any goroutines were added to the queue, which could
  3998  	// lead to idle P's when there is work available in the global queue.
  3999  	// That could potentially last until other goroutines become ready
  4000  	// to run. That said, we need to find a way to hedge
  4001  	//
  4002  	// Calling wakep() here is the best bet, it will do nothing in the
  4003  	// common case (no racing on `sched.npidle`), while it could wake one
  4004  	// more P to execute G's, which might end up with >1 P's: the first one
  4005  	// wakes another P and so forth until there is no more work, but this
  4006  	// ought to be an extremely rare case.
  4007  	//
  4008  	// Also see "Worker thread parking/unparking" comment at the top of the file for details.
  4009  	wakep()
  4010  }
  4011  
  4012  // One round of scheduler: find a runnable goroutine and execute it.
  4013  // Never returns.
  4014  func schedule() {
  4015  	mp := getg().m
  4016  
  4017  	if mp.locks != 0 {
  4018  		throw("schedule: holding locks")
  4019  	}
  4020  
  4021  	if mp.lockedg != 0 {
  4022  		stoplockedm()
  4023  		execute(mp.lockedg.ptr(), false) // Never returns.
  4024  	}
  4025  
  4026  	// We should not schedule away from a g that is executing a cgo call,
  4027  	// since the cgo call is using the m's g0 stack.
  4028  	if mp.incgo {
  4029  		throw("schedule: in cgo")
  4030  	}
  4031  
  4032  top:
  4033  	pp := mp.p.ptr()
  4034  	pp.preempt = false
  4035  
  4036  	// Safety check: if we are spinning, the run queue should be empty.
  4037  	// Check this before calling checkTimers, as that might call
  4038  	// goready to put a ready goroutine on the local run queue.
  4039  	if mp.spinning && (pp.runnext != 0 || pp.runqhead != pp.runqtail) {
  4040  		throw("schedule: spinning with local work")
  4041  	}
  4042  
  4043  	gp, inheritTime, tryWakeP := findRunnable() // blocks until work is available
  4044  
  4045  	if debug.dontfreezetheworld > 0 && freezing.Load() {
  4046  		// See comment in freezetheworld. We don't want to perturb
  4047  		// scheduler state, so we didn't gcstopm in findRunnable, but
  4048  		// also don't want to allow new goroutines to run.
  4049  		//
  4050  		// Deadlock here rather than in the findRunnable loop so if
  4051  		// findRunnable is stuck in a loop we don't perturb that
  4052  		// either.
  4053  		lock(&deadlock)
  4054  		lock(&deadlock)
  4055  	}
  4056  
  4057  	// This thread is going to run a goroutine and is not spinning anymore,
  4058  	// so if it was marked as spinning we need to reset it now and potentially
  4059  	// start a new spinning M.
  4060  	if mp.spinning {
  4061  		resetspinning()
  4062  	}
  4063  
  4064  	if sched.disable.user && !schedEnabled(gp) {
  4065  		// Scheduling of this goroutine is disabled. Put it on
  4066  		// the list of pending runnable goroutines for when we
  4067  		// re-enable user scheduling and look again.
  4068  		lock(&sched.lock)
  4069  		if schedEnabled(gp) {
  4070  			// Something re-enabled scheduling while we
  4071  			// were acquiring the lock.
  4072  			unlock(&sched.lock)
  4073  		} else {
  4074  			sched.disable.runnable.pushBack(gp)
  4075  			sched.disable.n++
  4076  			unlock(&sched.lock)
  4077  			goto top
  4078  		}
  4079  	}
  4080  
  4081  	// If about to schedule a not-normal goroutine (a GCworker or tracereader),
  4082  	// wake a P if there is one.
  4083  	if tryWakeP {
  4084  		wakep()
  4085  	}
  4086  	if gp.lockedm != 0 {
  4087  		// Hands off own p to the locked m,
  4088  		// then blocks waiting for a new p.
  4089  		startlockedm(gp)
  4090  		goto top
  4091  	}
  4092  
  4093  	execute(gp, inheritTime)
  4094  }
  4095  
  4096  // dropg removes the association between m and the current goroutine m->curg (gp for short).
  4097  // Typically a caller sets gp's status away from Grunning and then
  4098  // immediately calls dropg to finish the job. The caller is also responsible
  4099  // for arranging that gp will be restarted using ready at an
  4100  // appropriate time. After calling dropg and arranging for gp to be
  4101  // readied later, the caller can do other work but eventually should
  4102  // call schedule to restart the scheduling of goroutines on this m.
  4103  func dropg() {
  4104  	gp := getg()
  4105  
  4106  	setMNoWB(&gp.m.curg.m, nil)
  4107  	setGNoWB(&gp.m.curg, nil)
  4108  }
  4109  
  4110  func parkunlock_c(gp *g, lock unsafe.Pointer) bool {
  4111  	unlock((*mutex)(lock))
  4112  	return true
  4113  }
  4114  
  4115  // park continuation on g0.
  4116  func park_m(gp *g) {
  4117  	mp := getg().m
  4118  
  4119  	trace := traceAcquire()
  4120  
  4121  	// If g is in a synctest group, we don't want to let the group
  4122  	// become idle until after the waitunlockf (if any) has confirmed
  4123  	// that the park is happening.
  4124  	// We need to record gp.syncGroup here, since waitunlockf can change it.
  4125  	sg := gp.syncGroup
  4126  	if sg != nil {
  4127  		sg.incActive()
  4128  	}
  4129  
  4130  	if trace.ok() {
  4131  		// Trace the event before the transition. It may take a
  4132  		// stack trace, but we won't own the stack after the
  4133  		// transition anymore.
  4134  		trace.GoPark(mp.waitTraceBlockReason, mp.waitTraceSkip)
  4135  	}
  4136  	// N.B. Not using casGToWaiting here because the waitreason is
  4137  	// set by park_m's caller.
  4138  	casgstatus(gp, _Grunning, _Gwaiting)
  4139  	if trace.ok() {
  4140  		traceRelease(trace)
  4141  	}
  4142  
  4143  	dropg()
  4144  
  4145  	if fn := mp.waitunlockf; fn != nil {
  4146  		ok := fn(gp, mp.waitlock)
  4147  		mp.waitunlockf = nil
  4148  		mp.waitlock = nil
  4149  		if !ok {
  4150  			trace := traceAcquire()
  4151  			casgstatus(gp, _Gwaiting, _Grunnable)
  4152  			if sg != nil {
  4153  				sg.decActive()
  4154  			}
  4155  			if trace.ok() {
  4156  				trace.GoUnpark(gp, 2)
  4157  				traceRelease(trace)
  4158  			}
  4159  			execute(gp, true) // Schedule it back, never returns.
  4160  		}
  4161  	}
  4162  
  4163  	if sg != nil {
  4164  		sg.decActive()
  4165  	}
  4166  
  4167  	schedule()
  4168  }
  4169  
  4170  func goschedImpl(gp *g, preempted bool) {
  4171  	trace := traceAcquire()
  4172  	status := readgstatus(gp)
  4173  	if status&^_Gscan != _Grunning {
  4174  		dumpgstatus(gp)
  4175  		throw("bad g status")
  4176  	}
  4177  	if trace.ok() {
  4178  		// Trace the event before the transition. It may take a
  4179  		// stack trace, but we won't own the stack after the
  4180  		// transition anymore.
  4181  		if preempted {
  4182  			trace.GoPreempt()
  4183  		} else {
  4184  			trace.GoSched()
  4185  		}
  4186  	}
  4187  	casgstatus(gp, _Grunning, _Grunnable)
  4188  	if trace.ok() {
  4189  		traceRelease(trace)
  4190  	}
  4191  
  4192  	dropg()
  4193  	lock(&sched.lock)
  4194  	globrunqput(gp)
  4195  	unlock(&sched.lock)
  4196  
  4197  	if mainStarted {
  4198  		wakep()
  4199  	}
  4200  
  4201  	schedule()
  4202  }
  4203  
  4204  // Gosched continuation on g0.
  4205  func gosched_m(gp *g) {
  4206  	goschedImpl(gp, false)
  4207  }
  4208  
  4209  // goschedguarded is a forbidden-states-avoided version of gosched_m.
  4210  func goschedguarded_m(gp *g) {
  4211  	if !canPreemptM(gp.m) {
  4212  		gogo(&gp.sched) // never return
  4213  	}
  4214  	goschedImpl(gp, false)
  4215  }
  4216  
  4217  func gopreempt_m(gp *g) {
  4218  	goschedImpl(gp, true)
  4219  }
  4220  
  4221  // preemptPark parks gp and puts it in _Gpreempted.
  4222  //
  4223  //go:systemstack
  4224  func preemptPark(gp *g) {
  4225  	status := readgstatus(gp)
  4226  	if status&^_Gscan != _Grunning {
  4227  		dumpgstatus(gp)
  4228  		throw("bad g status")
  4229  	}
  4230  
  4231  	if gp.asyncSafePoint {
  4232  		// Double-check that async preemption does not
  4233  		// happen in SPWRITE assembly functions.
  4234  		// isAsyncSafePoint must exclude this case.
  4235  		f := findfunc(gp.sched.pc)
  4236  		if !f.valid() {
  4237  			throw("preempt at unknown pc")
  4238  		}
  4239  		if f.flag&abi.FuncFlagSPWrite != 0 {
  4240  			println("runtime: unexpected SPWRITE function", funcname(f), "in async preempt")
  4241  			throw("preempt SPWRITE")
  4242  		}
  4243  	}
  4244  
  4245  	// Transition from _Grunning to _Gscan|_Gpreempted. We can't
  4246  	// be in _Grunning when we dropg because then we'd be running
  4247  	// without an M, but the moment we're in _Gpreempted,
  4248  	// something could claim this G before we've fully cleaned it
  4249  	// up. Hence, we set the scan bit to lock down further
  4250  	// transitions until we can dropg.
  4251  	casGToPreemptScan(gp, _Grunning, _Gscan|_Gpreempted)
  4252  	dropg()
  4253  
  4254  	// Be careful about how we trace this next event. The ordering
  4255  	// is subtle.
  4256  	//
  4257  	// The moment we CAS into _Gpreempted, suspendG could CAS to
  4258  	// _Gwaiting, do its work, and ready the goroutine. All of
  4259  	// this could happen before we even get the chance to emit
  4260  	// an event. The end result is that the events could appear
  4261  	// out of order, and the tracer generally assumes the scheduler
  4262  	// takes care of the ordering between GoPark and GoUnpark.
  4263  	//
  4264  	// The answer here is simple: emit the event while we still hold
  4265  	// the _Gscan bit on the goroutine. We still need to traceAcquire
  4266  	// and traceRelease across the CAS because the tracer could be
  4267  	// what's calling suspendG in the first place, and we want the
  4268  	// CAS and event emission to appear atomic to the tracer.
  4269  	trace := traceAcquire()
  4270  	if trace.ok() {
  4271  		trace.GoPark(traceBlockPreempted, 0)
  4272  	}
  4273  	casfrom_Gscanstatus(gp, _Gscan|_Gpreempted, _Gpreempted)
  4274  	if trace.ok() {
  4275  		traceRelease(trace)
  4276  	}
  4277  	schedule()
  4278  }
  4279  
  4280  // goyield is like Gosched, but it:
  4281  // - emits a GoPreempt trace event instead of a GoSched trace event
  4282  // - puts the current G on the runq of the current P instead of the globrunq
  4283  //
  4284  // goyield should be an internal detail,
  4285  // but widely used packages access it using linkname.
  4286  // Notable members of the hall of shame include:
  4287  //   - gvisor.dev/gvisor
  4288  //   - github.com/sagernet/gvisor
  4289  //
  4290  // Do not remove or change the type signature.
  4291  // See go.dev/issue/67401.
  4292  //
  4293  //go:linkname goyield
  4294  func goyield() {
  4295  	checkTimeouts()
  4296  	mcall(goyield_m)
  4297  }
  4298  
  4299  func goyield_m(gp *g) {
  4300  	trace := traceAcquire()
  4301  	pp := gp.m.p.ptr()
  4302  	if trace.ok() {
  4303  		// Trace the event before the transition. It may take a
  4304  		// stack trace, but we won't own the stack after the
  4305  		// transition anymore.
  4306  		trace.GoPreempt()
  4307  	}
  4308  	casgstatus(gp, _Grunning, _Grunnable)
  4309  	if trace.ok() {
  4310  		traceRelease(trace)
  4311  	}
  4312  	dropg()
  4313  	runqput(pp, gp, false)
  4314  	schedule()
  4315  }
  4316  
  4317  // Finishes execution of the current goroutine.
  4318  func goexit1() {
  4319  	if raceenabled {
  4320  		if gp := getg(); gp.syncGroup != nil {
  4321  			racereleasemergeg(gp, gp.syncGroup.raceaddr())
  4322  		}
  4323  		racegoend()
  4324  	}
  4325  	trace := traceAcquire()
  4326  	if trace.ok() {
  4327  		trace.GoEnd()
  4328  		traceRelease(trace)
  4329  	}
  4330  	mcall(goexit0)
  4331  }
  4332  
  4333  // goexit continuation on g0.
  4334  func goexit0(gp *g) {
  4335  	gdestroy(gp)
  4336  	schedule()
  4337  }
  4338  
  4339  func gdestroy(gp *g) {
  4340  	mp := getg().m
  4341  	pp := mp.p.ptr()
  4342  
  4343  	casgstatus(gp, _Grunning, _Gdead)
  4344  	gcController.addScannableStack(pp, -int64(gp.stack.hi-gp.stack.lo))
  4345  	if isSystemGoroutine(gp, false) {
  4346  		sched.ngsys.Add(-1)
  4347  	}
  4348  	gp.m = nil
  4349  	locked := gp.lockedm != 0
  4350  	gp.lockedm = 0
  4351  	mp.lockedg = 0
  4352  	gp.preemptStop = false
  4353  	gp.paniconfault = false
  4354  	gp._defer = nil // should be true already but just in case.
  4355  	gp._panic = nil // non-nil for Goexit during panic. points at stack-allocated data.
  4356  	gp.writebuf = nil
  4357  	gp.waitreason = waitReasonZero
  4358  	gp.param = nil
  4359  	gp.labels = nil
  4360  	gp.timer = nil
  4361  	gp.syncGroup = nil
  4362  
  4363  	if gcBlackenEnabled != 0 && gp.gcAssistBytes > 0 {
  4364  		// Flush assist credit to the global pool. This gives
  4365  		// better information to pacing if the application is
  4366  		// rapidly creating an exiting goroutines.
  4367  		assistWorkPerByte := gcController.assistWorkPerByte.Load()
  4368  		scanCredit := int64(assistWorkPerByte * float64(gp.gcAssistBytes))
  4369  		gcController.bgScanCredit.Add(scanCredit)
  4370  		gp.gcAssistBytes = 0
  4371  	}
  4372  
  4373  	dropg()
  4374  
  4375  	if GOARCH == "wasm" { // no threads yet on wasm
  4376  		gfput(pp, gp)
  4377  		return
  4378  	}
  4379  
  4380  	if locked && mp.lockedInt != 0 {
  4381  		print("runtime: mp.lockedInt = ", mp.lockedInt, "\n")
  4382  		if mp.isextra {
  4383  			throw("runtime.Goexit called in a thread that was not created by the Go runtime")
  4384  		}
  4385  		throw("exited a goroutine internally locked to the OS thread")
  4386  	}
  4387  	gfput(pp, gp)
  4388  	if locked {
  4389  		// The goroutine may have locked this thread because
  4390  		// it put it in an unusual kernel state. Kill it
  4391  		// rather than returning it to the thread pool.
  4392  
  4393  		// Return to mstart, which will release the P and exit
  4394  		// the thread.
  4395  		if GOOS != "plan9" { // See golang.org/issue/22227.
  4396  			gogo(&mp.g0.sched)
  4397  		} else {
  4398  			// Clear lockedExt on plan9 since we may end up re-using
  4399  			// this thread.
  4400  			mp.lockedExt = 0
  4401  		}
  4402  	}
  4403  }
  4404  
  4405  // save updates getg().sched to refer to pc and sp so that a following
  4406  // gogo will restore pc and sp.
  4407  //
  4408  // save must not have write barriers because invoking a write barrier
  4409  // can clobber getg().sched.
  4410  //
  4411  //go:nosplit
  4412  //go:nowritebarrierrec
  4413  func save(pc, sp, bp uintptr) {
  4414  	gp := getg()
  4415  
  4416  	if gp == gp.m.g0 || gp == gp.m.gsignal {
  4417  		// m.g0.sched is special and must describe the context
  4418  		// for exiting the thread. mstart1 writes to it directly.
  4419  		// m.gsignal.sched should not be used at all.
  4420  		// This check makes sure save calls do not accidentally
  4421  		// run in contexts where they'd write to system g's.
  4422  		throw("save on system g not allowed")
  4423  	}
  4424  
  4425  	gp.sched.pc = pc
  4426  	gp.sched.sp = sp
  4427  	gp.sched.lr = 0
  4428  	gp.sched.bp = bp
  4429  	// We need to ensure ctxt is zero, but can't have a write
  4430  	// barrier here. However, it should always already be zero.
  4431  	// Assert that.
  4432  	if gp.sched.ctxt != nil {
  4433  		badctxt()
  4434  	}
  4435  }
  4436  
  4437  // The goroutine g is about to enter a system call.
  4438  // Record that it's not using the cpu anymore.
  4439  // This is called only from the go syscall library and cgocall,
  4440  // not from the low-level system calls used by the runtime.
  4441  //
  4442  // Entersyscall cannot split the stack: the save must
  4443  // make g->sched refer to the caller's stack segment, because
  4444  // entersyscall is going to return immediately after.
  4445  //
  4446  // Nothing entersyscall calls can split the stack either.
  4447  // We cannot safely move the stack during an active call to syscall,
  4448  // because we do not know which of the uintptr arguments are
  4449  // really pointers (back into the stack).
  4450  // In practice, this means that we make the fast path run through
  4451  // entersyscall doing no-split things, and the slow path has to use systemstack
  4452  // to run bigger things on the system stack.
  4453  //
  4454  // reentersyscall is the entry point used by cgo callbacks, where explicitly
  4455  // saved SP and PC are restored. This is needed when exitsyscall will be called
  4456  // from a function further up in the call stack than the parent, as g->syscallsp
  4457  // must always point to a valid stack frame. entersyscall below is the normal
  4458  // entry point for syscalls, which obtains the SP and PC from the caller.
  4459  //
  4460  //go:nosplit
  4461  func reentersyscall(pc, sp, bp uintptr) {
  4462  	trace := traceAcquire()
  4463  	gp := getg()
  4464  
  4465  	// Disable preemption because during this function g is in Gsyscall status,
  4466  	// but can have inconsistent g->sched, do not let GC observe it.
  4467  	gp.m.locks++
  4468  
  4469  	// Entersyscall must not call any function that might split/grow the stack.
  4470  	// (See details in comment above.)
  4471  	// Catch calls that might, by replacing the stack guard with something that
  4472  	// will trip any stack check and leaving a flag to tell newstack to die.
  4473  	gp.stackguard0 = stackPreempt
  4474  	gp.throwsplit = true
  4475  
  4476  	// Leave SP around for GC and traceback.
  4477  	save(pc, sp, bp)
  4478  	gp.syscallsp = sp
  4479  	gp.syscallpc = pc
  4480  	gp.syscallbp = bp
  4481  	casgstatus(gp, _Grunning, _Gsyscall)
  4482  	if staticLockRanking {
  4483  		// When doing static lock ranking casgstatus can call
  4484  		// systemstack which clobbers g.sched.
  4485  		save(pc, sp, bp)
  4486  	}
  4487  	if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
  4488  		systemstack(func() {
  4489  			print("entersyscall inconsistent sp ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
  4490  			throw("entersyscall")
  4491  		})
  4492  	}
  4493  	if gp.syscallbp != 0 && gp.syscallbp < gp.stack.lo || gp.stack.hi < gp.syscallbp {
  4494  		systemstack(func() {
  4495  			print("entersyscall inconsistent bp ", hex(gp.syscallbp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
  4496  			throw("entersyscall")
  4497  		})
  4498  	}
  4499  
  4500  	if trace.ok() {
  4501  		systemstack(func() {
  4502  			trace.GoSysCall()
  4503  			traceRelease(trace)
  4504  		})
  4505  		// systemstack itself clobbers g.sched.{pc,sp} and we might
  4506  		// need them later when the G is genuinely blocked in a
  4507  		// syscall
  4508  		save(pc, sp, bp)
  4509  	}
  4510  
  4511  	if sched.sysmonwait.Load() {
  4512  		systemstack(entersyscall_sysmon)
  4513  		save(pc, sp, bp)
  4514  	}
  4515  
  4516  	if gp.m.p.ptr().runSafePointFn != 0 {
  4517  		// runSafePointFn may stack split if run on this stack
  4518  		systemstack(runSafePointFn)
  4519  		save(pc, sp, bp)
  4520  	}
  4521  
  4522  	gp.m.syscalltick = gp.m.p.ptr().syscalltick
  4523  	pp := gp.m.p.ptr()
  4524  	pp.m = 0
  4525  	gp.m.oldp.set(pp)
  4526  	gp.m.p = 0
  4527  	atomic.Store(&pp.status, _Psyscall)
  4528  	if sched.gcwaiting.Load() {
  4529  		systemstack(entersyscall_gcwait)
  4530  		save(pc, sp, bp)
  4531  	}
  4532  
  4533  	gp.m.locks--
  4534  }
  4535  
  4536  // Standard syscall entry used by the go syscall library and normal cgo calls.
  4537  //
  4538  // This is exported via linkname to assembly in the syscall package and x/sys.
  4539  //
  4540  // Other packages should not be accessing entersyscall directly,
  4541  // but widely used packages access it using linkname.
  4542  // Notable members of the hall of shame include:
  4543  //   - gvisor.dev/gvisor
  4544  //
  4545  // Do not remove or change the type signature.
  4546  // See go.dev/issue/67401.
  4547  //
  4548  //go:nosplit
  4549  //go:linkname entersyscall
  4550  func entersyscall() {
  4551  	// N.B. getcallerfp cannot be written directly as argument in the call
  4552  	// to reentersyscall because it forces spilling the other arguments to
  4553  	// the stack. This results in exceeding the nosplit stack requirements
  4554  	// on some platforms.
  4555  	fp := getcallerfp()
  4556  	reentersyscall(sys.GetCallerPC(), sys.GetCallerSP(), fp)
  4557  }
  4558  
  4559  func entersyscall_sysmon() {
  4560  	lock(&sched.lock)
  4561  	if sched.sysmonwait.Load() {
  4562  		sched.sysmonwait.Store(false)
  4563  		notewakeup(&sched.sysmonnote)
  4564  	}
  4565  	unlock(&sched.lock)
  4566  }
  4567  
  4568  func entersyscall_gcwait() {
  4569  	gp := getg()
  4570  	pp := gp.m.oldp.ptr()
  4571  
  4572  	lock(&sched.lock)
  4573  	trace := traceAcquire()
  4574  	if sched.stopwait > 0 && atomic.Cas(&pp.status, _Psyscall, _Pgcstop) {
  4575  		if trace.ok() {
  4576  			// This is a steal in the new tracer. While it's very likely
  4577  			// that we were the ones to put this P into _Psyscall, between
  4578  			// then and now it's totally possible it had been stolen and
  4579  			// then put back into _Psyscall for us to acquire here. In such
  4580  			// case ProcStop would be incorrect.
  4581  			//
  4582  			// TODO(mknyszek): Consider emitting a ProcStop instead when
  4583  			// gp.m.syscalltick == pp.syscalltick, since then we know we never
  4584  			// lost the P.
  4585  			trace.ProcSteal(pp, true)
  4586  			traceRelease(trace)
  4587  		}
  4588  		pp.gcStopTime = nanotime()
  4589  		pp.syscalltick++
  4590  		if sched.stopwait--; sched.stopwait == 0 {
  4591  			notewakeup(&sched.stopnote)
  4592  		}
  4593  	} else if trace.ok() {
  4594  		traceRelease(trace)
  4595  	}
  4596  	unlock(&sched.lock)
  4597  }
  4598  
  4599  // The same as entersyscall(), but with a hint that the syscall is blocking.
  4600  
  4601  // entersyscallblock should be an internal detail,
  4602  // but widely used packages access it using linkname.
  4603  // Notable members of the hall of shame include:
  4604  //   - gvisor.dev/gvisor
  4605  //
  4606  // Do not remove or change the type signature.
  4607  // See go.dev/issue/67401.
  4608  //
  4609  //go:linkname entersyscallblock
  4610  //go:nosplit
  4611  func entersyscallblock() {
  4612  	gp := getg()
  4613  
  4614  	gp.m.locks++ // see comment in entersyscall
  4615  	gp.throwsplit = true
  4616  	gp.stackguard0 = stackPreempt // see comment in entersyscall
  4617  	gp.m.syscalltick = gp.m.p.ptr().syscalltick
  4618  	gp.m.p.ptr().syscalltick++
  4619  
  4620  	// Leave SP around for GC and traceback.
  4621  	pc := sys.GetCallerPC()
  4622  	sp := sys.GetCallerSP()
  4623  	bp := getcallerfp()
  4624  	save(pc, sp, bp)
  4625  	gp.syscallsp = gp.sched.sp
  4626  	gp.syscallpc = gp.sched.pc
  4627  	gp.syscallbp = gp.sched.bp
  4628  	if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
  4629  		sp1 := sp
  4630  		sp2 := gp.sched.sp
  4631  		sp3 := gp.syscallsp
  4632  		systemstack(func() {
  4633  			print("entersyscallblock inconsistent sp ", hex(sp1), " ", hex(sp2), " ", hex(sp3), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
  4634  			throw("entersyscallblock")
  4635  		})
  4636  	}
  4637  	casgstatus(gp, _Grunning, _Gsyscall)
  4638  	if gp.syscallsp < gp.stack.lo || gp.stack.hi < gp.syscallsp {
  4639  		systemstack(func() {
  4640  			print("entersyscallblock inconsistent sp ", hex(sp), " ", hex(gp.sched.sp), " ", hex(gp.syscallsp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
  4641  			throw("entersyscallblock")
  4642  		})
  4643  	}
  4644  	if gp.syscallbp != 0 && gp.syscallbp < gp.stack.lo || gp.stack.hi < gp.syscallbp {
  4645  		systemstack(func() {
  4646  			print("entersyscallblock inconsistent bp ", hex(bp), " ", hex(gp.sched.bp), " ", hex(gp.syscallbp), " [", hex(gp.stack.lo), ",", hex(gp.stack.hi), "]\n")
  4647  			throw("entersyscallblock")
  4648  		})
  4649  	}
  4650  
  4651  	systemstack(entersyscallblock_handoff)
  4652  
  4653  	// Resave for traceback during blocked call.
  4654  	save(sys.GetCallerPC(), sys.GetCallerSP(), getcallerfp())
  4655  
  4656  	gp.m.locks--
  4657  }
  4658  
  4659  func entersyscallblock_handoff() {
  4660  	trace := traceAcquire()
  4661  	if trace.ok() {
  4662  		trace.GoSysCall()
  4663  		traceRelease(trace)
  4664  	}
  4665  	handoffp(releasep())
  4666  }
  4667  
  4668  // The goroutine g exited its system call.
  4669  // Arrange for it to run on a cpu again.
  4670  // This is called only from the go syscall library, not
  4671  // from the low-level system calls used by the runtime.
  4672  //
  4673  // Write barriers are not allowed because our P may have been stolen.
  4674  //
  4675  // This is exported via linkname to assembly in the syscall package.
  4676  //
  4677  // exitsyscall should be an internal detail,
  4678  // but widely used packages access it using linkname.
  4679  // Notable members of the hall of shame include:
  4680  //   - gvisor.dev/gvisor
  4681  //
  4682  // Do not remove or change the type signature.
  4683  // See go.dev/issue/67401.
  4684  //
  4685  //go:nosplit
  4686  //go:nowritebarrierrec
  4687  //go:linkname exitsyscall
  4688  func exitsyscall() {
  4689  	gp := getg()
  4690  
  4691  	gp.m.locks++ // see comment in entersyscall
  4692  	if sys.GetCallerSP() > gp.syscallsp {
  4693  		throw("exitsyscall: syscall frame is no longer valid")
  4694  	}
  4695  
  4696  	gp.waitsince = 0
  4697  	oldp := gp.m.oldp.ptr()
  4698  	gp.m.oldp = 0
  4699  	if exitsyscallfast(oldp) {
  4700  		// When exitsyscallfast returns success, we have a P so can now use
  4701  		// write barriers
  4702  		if goroutineProfile.active {
  4703  			// Make sure that gp has had its stack written out to the goroutine
  4704  			// profile, exactly as it was when the goroutine profiler first
  4705  			// stopped the world.
  4706  			systemstack(func() {
  4707  				tryRecordGoroutineProfileWB(gp)
  4708  			})
  4709  		}
  4710  		trace := traceAcquire()
  4711  		if trace.ok() {
  4712  			lostP := oldp != gp.m.p.ptr() || gp.m.syscalltick != gp.m.p.ptr().syscalltick
  4713  			systemstack(func() {
  4714  				// Write out syscall exit eagerly.
  4715  				//
  4716  				// It's important that we write this *after* we know whether we
  4717  				// lost our P or not (determined by exitsyscallfast).
  4718  				trace.GoSysExit(lostP)
  4719  				if lostP {
  4720  					// We lost the P at some point, even though we got it back here.
  4721  					// Trace that we're starting again, because there was a tracev2.GoSysBlock
  4722  					// call somewhere in exitsyscallfast (indicating that this goroutine
  4723  					// had blocked) and we're about to start running again.
  4724  					trace.GoStart()
  4725  				}
  4726  			})
  4727  		}
  4728  		// There's a cpu for us, so we can run.
  4729  		gp.m.p.ptr().syscalltick++
  4730  		// We need to cas the status and scan before resuming...
  4731  		casgstatus(gp, _Gsyscall, _Grunning)
  4732  		if trace.ok() {
  4733  			traceRelease(trace)
  4734  		}
  4735  
  4736  		// Garbage collector isn't running (since we are),
  4737  		// so okay to clear syscallsp.
  4738  		gp.syscallsp = 0
  4739  		gp.m.locks--
  4740  		if gp.preempt {
  4741  			// restore the preemption request in case we've cleared it in newstack
  4742  			gp.stackguard0 = stackPreempt
  4743  		} else {
  4744  			// otherwise restore the real stackGuard, we've spoiled it in entersyscall/entersyscallblock
  4745  			gp.stackguard0 = gp.stack.lo + stackGuard
  4746  		}
  4747  		gp.throwsplit = false
  4748  
  4749  		if sched.disable.user && !schedEnabled(gp) {
  4750  			// Scheduling of this goroutine is disabled.
  4751  			Gosched()
  4752  		}
  4753  
  4754  		return
  4755  	}
  4756  
  4757  	gp.m.locks--
  4758  
  4759  	// Call the scheduler.
  4760  	mcall(exitsyscall0)
  4761  
  4762  	// Scheduler returned, so we're allowed to run now.
  4763  	// Delete the syscallsp information that we left for
  4764  	// the garbage collector during the system call.
  4765  	// Must wait until now because until gosched returns
  4766  	// we don't know for sure that the garbage collector
  4767  	// is not running.
  4768  	gp.syscallsp = 0
  4769  	gp.m.p.ptr().syscalltick++
  4770  	gp.throwsplit = false
  4771  }
  4772  
  4773  //go:nosplit
  4774  func exitsyscallfast(oldp *p) bool {
  4775  	// Freezetheworld sets stopwait but does not retake P's.
  4776  	if sched.stopwait == freezeStopWait {
  4777  		return false
  4778  	}
  4779  
  4780  	// Try to re-acquire the last P.
  4781  	trace := traceAcquire()
  4782  	if oldp != nil && oldp.status == _Psyscall && atomic.Cas(&oldp.status, _Psyscall, _Pidle) {
  4783  		// There's a cpu for us, so we can run.
  4784  		wirep(oldp)
  4785  		exitsyscallfast_reacquired(trace)
  4786  		if trace.ok() {
  4787  			traceRelease(trace)
  4788  		}
  4789  		return true
  4790  	}
  4791  	if trace.ok() {
  4792  		traceRelease(trace)
  4793  	}
  4794  
  4795  	// Try to get any other idle P.
  4796  	if sched.pidle != 0 {
  4797  		var ok bool
  4798  		systemstack(func() {
  4799  			ok = exitsyscallfast_pidle()
  4800  		})
  4801  		if ok {
  4802  			return true
  4803  		}
  4804  	}
  4805  	return false
  4806  }
  4807  
  4808  // exitsyscallfast_reacquired is the exitsyscall path on which this G
  4809  // has successfully reacquired the P it was running on before the
  4810  // syscall.
  4811  //
  4812  //go:nosplit
  4813  func exitsyscallfast_reacquired(trace traceLocker) {
  4814  	gp := getg()
  4815  	if gp.m.syscalltick != gp.m.p.ptr().syscalltick {
  4816  		if trace.ok() {
  4817  			// The p was retaken and then enter into syscall again (since gp.m.syscalltick has changed).
  4818  			// tracev2.GoSysBlock for this syscall was already emitted,
  4819  			// but here we effectively retake the p from the new syscall running on the same p.
  4820  			systemstack(func() {
  4821  				// We're stealing the P. It's treated
  4822  				// as if it temporarily stopped running. Then, start running.
  4823  				trace.ProcSteal(gp.m.p.ptr(), true)
  4824  				trace.ProcStart()
  4825  			})
  4826  		}
  4827  		gp.m.p.ptr().syscalltick++
  4828  	}
  4829  }
  4830  
  4831  func exitsyscallfast_pidle() bool {
  4832  	lock(&sched.lock)
  4833  	pp, _ := pidleget(0)
  4834  	if pp != nil && sched.sysmonwait.Load() {
  4835  		sched.sysmonwait.Store(false)
  4836  		notewakeup(&sched.sysmonnote)
  4837  	}
  4838  	unlock(&sched.lock)
  4839  	if pp != nil {
  4840  		acquirep(pp)
  4841  		return true
  4842  	}
  4843  	return false
  4844  }
  4845  
  4846  // exitsyscall slow path on g0.
  4847  // Failed to acquire P, enqueue gp as runnable.
  4848  //
  4849  // Called via mcall, so gp is the calling g from this M.
  4850  //
  4851  //go:nowritebarrierrec
  4852  func exitsyscall0(gp *g) {
  4853  	var trace traceLocker
  4854  	traceExitingSyscall()
  4855  	trace = traceAcquire()
  4856  	casgstatus(gp, _Gsyscall, _Grunnable)
  4857  	traceExitedSyscall()
  4858  	if trace.ok() {
  4859  		// Write out syscall exit eagerly.
  4860  		//
  4861  		// It's important that we write this *after* we know whether we
  4862  		// lost our P or not (determined by exitsyscallfast).
  4863  		trace.GoSysExit(true)
  4864  		traceRelease(trace)
  4865  	}
  4866  	dropg()
  4867  	lock(&sched.lock)
  4868  	var pp *p
  4869  	if schedEnabled(gp) {
  4870  		pp, _ = pidleget(0)
  4871  	}
  4872  	var locked bool
  4873  	if pp == nil {
  4874  		globrunqput(gp)
  4875  
  4876  		// Below, we stoplockedm if gp is locked. globrunqput releases
  4877  		// ownership of gp, so we must check if gp is locked prior to
  4878  		// committing the release by unlocking sched.lock, otherwise we
  4879  		// could race with another M transitioning gp from unlocked to
  4880  		// locked.
  4881  		locked = gp.lockedm != 0
  4882  	} else if sched.sysmonwait.Load() {
  4883  		sched.sysmonwait.Store(false)
  4884  		notewakeup(&sched.sysmonnote)
  4885  	}
  4886  	unlock(&sched.lock)
  4887  	if pp != nil {
  4888  		acquirep(pp)
  4889  		execute(gp, false) // Never returns.
  4890  	}
  4891  	if locked {
  4892  		// Wait until another thread schedules gp and so m again.
  4893  		//
  4894  		// N.B. lockedm must be this M, as this g was running on this M
  4895  		// before entersyscall.
  4896  		stoplockedm()
  4897  		execute(gp, false) // Never returns.
  4898  	}
  4899  	stopm()
  4900  	schedule() // Never returns.
  4901  }
  4902  
  4903  // Called from syscall package before fork.
  4904  //
  4905  // syscall_runtime_BeforeFork is for package syscall,
  4906  // but widely used packages access it using linkname.
  4907  // Notable members of the hall of shame include:
  4908  //   - gvisor.dev/gvisor
  4909  //
  4910  // Do not remove or change the type signature.
  4911  // See go.dev/issue/67401.
  4912  //
  4913  //go:linkname syscall_runtime_BeforeFork syscall.runtime_BeforeFork
  4914  //go:nosplit
  4915  func syscall_runtime_BeforeFork() {
  4916  	gp := getg().m.curg
  4917  
  4918  	// Block signals during a fork, so that the child does not run
  4919  	// a signal handler before exec if a signal is sent to the process
  4920  	// group. See issue #18600.
  4921  	gp.m.locks++
  4922  	sigsave(&gp.m.sigmask)
  4923  	sigblock(false)
  4924  
  4925  	// This function is called before fork in syscall package.
  4926  	// Code between fork and exec must not allocate memory nor even try to grow stack.
  4927  	// Here we spoil g.stackguard0 to reliably detect any attempts to grow stack.
  4928  	// runtime_AfterFork will undo this in parent process, but not in child.
  4929  	gp.stackguard0 = stackFork
  4930  }
  4931  
  4932  // Called from syscall package after fork in parent.
  4933  //
  4934  // syscall_runtime_AfterFork is for package syscall,
  4935  // but widely used packages access it using linkname.
  4936  // Notable members of the hall of shame include:
  4937  //   - gvisor.dev/gvisor
  4938  //
  4939  // Do not remove or change the type signature.
  4940  // See go.dev/issue/67401.
  4941  //
  4942  //go:linkname syscall_runtime_AfterFork syscall.runtime_AfterFork
  4943  //go:nosplit
  4944  func syscall_runtime_AfterFork() {
  4945  	gp := getg().m.curg
  4946  
  4947  	// See the comments in beforefork.
  4948  	gp.stackguard0 = gp.stack.lo + stackGuard
  4949  
  4950  	msigrestore(gp.m.sigmask)
  4951  
  4952  	gp.m.locks--
  4953  }
  4954  
  4955  // inForkedChild is true while manipulating signals in the child process.
  4956  // This is used to avoid calling libc functions in case we are using vfork.
  4957  var inForkedChild bool
  4958  
  4959  // Called from syscall package after fork in child.
  4960  // It resets non-sigignored signals to the default handler, and
  4961  // restores the signal mask in preparation for the exec.
  4962  //
  4963  // Because this might be called during a vfork, and therefore may be
  4964  // temporarily sharing address space with the parent process, this must
  4965  // not change any global variables or calling into C code that may do so.
  4966  //
  4967  // syscall_runtime_AfterForkInChild is for package syscall,
  4968  // but widely used packages access it using linkname.
  4969  // Notable members of the hall of shame include:
  4970  //   - gvisor.dev/gvisor
  4971  //
  4972  // Do not remove or change the type signature.
  4973  // See go.dev/issue/67401.
  4974  //
  4975  //go:linkname syscall_runtime_AfterForkInChild syscall.runtime_AfterForkInChild
  4976  //go:nosplit
  4977  //go:nowritebarrierrec
  4978  func syscall_runtime_AfterForkInChild() {
  4979  	// It's OK to change the global variable inForkedChild here
  4980  	// because we are going to change it back. There is no race here,
  4981  	// because if we are sharing address space with the parent process,
  4982  	// then the parent process can not be running concurrently.
  4983  	inForkedChild = true
  4984  
  4985  	clearSignalHandlers()
  4986  
  4987  	// When we are the child we are the only thread running,
  4988  	// so we know that nothing else has changed gp.m.sigmask.
  4989  	msigrestore(getg().m.sigmask)
  4990  
  4991  	inForkedChild = false
  4992  }
  4993  
  4994  // pendingPreemptSignals is the number of preemption signals
  4995  // that have been sent but not received. This is only used on Darwin.
  4996  // For #41702.
  4997  var pendingPreemptSignals atomic.Int32
  4998  
  4999  // Called from syscall package before Exec.
  5000  //
  5001  //go:linkname syscall_runtime_BeforeExec syscall.runtime_BeforeExec
  5002  func syscall_runtime_BeforeExec() {
  5003  	// Prevent thread creation during exec.
  5004  	execLock.lock()
  5005  
  5006  	// On Darwin, wait for all pending preemption signals to
  5007  	// be received. See issue #41702.
  5008  	if GOOS == "darwin" || GOOS == "ios" {
  5009  		for pendingPreemptSignals.Load() > 0 {
  5010  			osyield()
  5011  		}
  5012  	}
  5013  }
  5014  
  5015  // Called from syscall package after Exec.
  5016  //
  5017  //go:linkname syscall_runtime_AfterExec syscall.runtime_AfterExec
  5018  func syscall_runtime_AfterExec() {
  5019  	execLock.unlock()
  5020  }
  5021  
  5022  // Allocate a new g, with a stack big enough for stacksize bytes.
  5023  func malg(stacksize int32) *g {
  5024  	newg := new(g)
  5025  	if stacksize >= 0 {
  5026  		stacksize = round2(stackSystem + stacksize)
  5027  		systemstack(func() {
  5028  			newg.stack = stackalloc(uint32(stacksize))
  5029  		})
  5030  		newg.stackguard0 = newg.stack.lo + stackGuard
  5031  		newg.stackguard1 = ^uintptr(0)
  5032  		// Clear the bottom word of the stack. We record g
  5033  		// there on gsignal stack during VDSO on ARM and ARM64.
  5034  		*(*uintptr)(unsafe.Pointer(newg.stack.lo)) = 0
  5035  	}
  5036  	return newg
  5037  }
  5038  
  5039  // Create a new g running fn.
  5040  // Put it on the queue of g's waiting to run.
  5041  // The compiler turns a go statement into a call to this.
  5042  func newproc(fn *funcval) {
  5043  	gp := getg()
  5044  	pc := sys.GetCallerPC()
  5045  	systemstack(func() {
  5046  		newg := newproc1(fn, gp, pc, false, waitReasonZero)
  5047  
  5048  		pp := getg().m.p.ptr()
  5049  		runqput(pp, newg, true)
  5050  
  5051  		if mainStarted {
  5052  			wakep()
  5053  		}
  5054  	})
  5055  }
  5056  
  5057  // Create a new g in state _Grunnable (or _Gwaiting if parked is true), starting at fn.
  5058  // callerpc is the address of the go statement that created this. The caller is responsible
  5059  // for adding the new g to the scheduler. If parked is true, waitreason must be non-zero.
  5060  func newproc1(fn *funcval, callergp *g, callerpc uintptr, parked bool, waitreason waitReason) *g {
  5061  	if fn == nil {
  5062  		fatal("go of nil func value")
  5063  	}
  5064  
  5065  	mp := acquirem() // disable preemption because we hold M and P in local vars.
  5066  	pp := mp.p.ptr()
  5067  	newg := gfget(pp)
  5068  	if newg == nil {
  5069  		newg = malg(stackMin)
  5070  		casgstatus(newg, _Gidle, _Gdead)
  5071  		allgadd(newg) // publishes with a g->status of Gdead so GC scanner doesn't look at uninitialized stack.
  5072  	}
  5073  	if newg.stack.hi == 0 {
  5074  		throw("newproc1: newg missing stack")
  5075  	}
  5076  
  5077  	if readgstatus(newg) != _Gdead {
  5078  		throw("newproc1: new g is not Gdead")
  5079  	}
  5080  
  5081  	totalSize := uintptr(4*goarch.PtrSize + sys.MinFrameSize) // extra space in case of reads slightly beyond frame
  5082  	totalSize = alignUp(totalSize, sys.StackAlign)
  5083  	sp := newg.stack.hi - totalSize
  5084  	if usesLR {
  5085  		// caller's LR
  5086  		*(*uintptr)(unsafe.Pointer(sp)) = 0
  5087  		prepGoExitFrame(sp)
  5088  	}
  5089  	if GOARCH == "arm64" {
  5090  		// caller's FP
  5091  		*(*uintptr)(unsafe.Pointer(sp - goarch.PtrSize)) = 0
  5092  	}
  5093  
  5094  	memclrNoHeapPointers(unsafe.Pointer(&newg.sched), unsafe.Sizeof(newg.sched))
  5095  	newg.sched.sp = sp
  5096  	newg.stktopsp = sp
  5097  	newg.sched.pc = abi.FuncPCABI0(goexit) + sys.PCQuantum // +PCQuantum so that previous instruction is in same function
  5098  	newg.sched.g = guintptr(unsafe.Pointer(newg))
  5099  	gostartcallfn(&newg.sched, fn)
  5100  	newg.parentGoid = callergp.goid
  5101  	newg.gopc = callerpc
  5102  	newg.ancestors = saveAncestors(callergp)
  5103  	newg.startpc = fn.fn
  5104  	if isSystemGoroutine(newg, false) {
  5105  		sched.ngsys.Add(1)
  5106  	} else {
  5107  		// Only user goroutines inherit synctest groups and pprof labels.
  5108  		newg.syncGroup = callergp.syncGroup
  5109  		if mp.curg != nil {
  5110  			newg.labels = mp.curg.labels
  5111  		}
  5112  		if goroutineProfile.active {
  5113  			// A concurrent goroutine profile is running. It should include
  5114  			// exactly the set of goroutines that were alive when the goroutine
  5115  			// profiler first stopped the world. That does not include newg, so
  5116  			// mark it as not needing a profile before transitioning it from
  5117  			// _Gdead.
  5118  			newg.goroutineProfiled.Store(goroutineProfileSatisfied)
  5119  		}
  5120  	}
  5121  	// Track initial transition?
  5122  	newg.trackingSeq = uint8(cheaprand())
  5123  	if newg.trackingSeq%gTrackingPeriod == 0 {
  5124  		newg.tracking = true
  5125  	}
  5126  	gcController.addScannableStack(pp, int64(newg.stack.hi-newg.stack.lo))
  5127  
  5128  	// Get a goid and switch to runnable. Make all this atomic to the tracer.
  5129  	trace := traceAcquire()
  5130  	var status uint32 = _Grunnable
  5131  	if parked {
  5132  		status = _Gwaiting
  5133  		newg.waitreason = waitreason
  5134  	}
  5135  	if pp.goidcache == pp.goidcacheend {
  5136  		// Sched.goidgen is the last allocated id,
  5137  		// this batch must be [sched.goidgen+1, sched.goidgen+GoidCacheBatch].
  5138  		// At startup sched.goidgen=0, so main goroutine receives goid=1.
  5139  		pp.goidcache = sched.goidgen.Add(_GoidCacheBatch)
  5140  		pp.goidcache -= _GoidCacheBatch - 1
  5141  		pp.goidcacheend = pp.goidcache + _GoidCacheBatch
  5142  	}
  5143  	newg.goid = pp.goidcache
  5144  	casgstatus(newg, _Gdead, status)
  5145  	pp.goidcache++
  5146  	newg.trace.reset()
  5147  	if trace.ok() {
  5148  		trace.GoCreate(newg, newg.startpc, parked)
  5149  		traceRelease(trace)
  5150  	}
  5151  
  5152  	// Set up race context.
  5153  	if raceenabled {
  5154  		newg.racectx = racegostart(callerpc)
  5155  		newg.raceignore = 0
  5156  		if newg.labels != nil {
  5157  			// See note in proflabel.go on labelSync's role in synchronizing
  5158  			// with the reads in the signal handler.
  5159  			racereleasemergeg(newg, unsafe.Pointer(&labelSync))
  5160  		}
  5161  	}
  5162  	releasem(mp)
  5163  
  5164  	return newg
  5165  }
  5166  
  5167  // saveAncestors copies previous ancestors of the given caller g and
  5168  // includes info for the current caller into a new set of tracebacks for
  5169  // a g being created.
  5170  func saveAncestors(callergp *g) *[]ancestorInfo {
  5171  	// Copy all prior info, except for the root goroutine (goid 0).
  5172  	if debug.tracebackancestors <= 0 || callergp.goid == 0 {
  5173  		return nil
  5174  	}
  5175  	var callerAncestors []ancestorInfo
  5176  	if callergp.ancestors != nil {
  5177  		callerAncestors = *callergp.ancestors
  5178  	}
  5179  	n := int32(len(callerAncestors)) + 1
  5180  	if n > debug.tracebackancestors {
  5181  		n = debug.tracebackancestors
  5182  	}
  5183  	ancestors := make([]ancestorInfo, n)
  5184  	copy(ancestors[1:], callerAncestors)
  5185  
  5186  	var pcs [tracebackInnerFrames]uintptr
  5187  	npcs := gcallers(callergp, 0, pcs[:])
  5188  	ipcs := make([]uintptr, npcs)
  5189  	copy(ipcs, pcs[:])
  5190  	ancestors[0] = ancestorInfo{
  5191  		pcs:  ipcs,
  5192  		goid: callergp.goid,
  5193  		gopc: callergp.gopc,
  5194  	}
  5195  
  5196  	ancestorsp := new([]ancestorInfo)
  5197  	*ancestorsp = ancestors
  5198  	return ancestorsp
  5199  }
  5200  
  5201  // Put on gfree list.
  5202  // If local list is too long, transfer a batch to the global list.
  5203  func gfput(pp *p, gp *g) {
  5204  	if readgstatus(gp) != _Gdead {
  5205  		throw("gfput: bad status (not Gdead)")
  5206  	}
  5207  
  5208  	stksize := gp.stack.hi - gp.stack.lo
  5209  
  5210  	if stksize != uintptr(startingStackSize) {
  5211  		// non-standard stack size - free it.
  5212  		stackfree(gp.stack)
  5213  		gp.stack.lo = 0
  5214  		gp.stack.hi = 0
  5215  		gp.stackguard0 = 0
  5216  	}
  5217  
  5218  	pp.gFree.push(gp)
  5219  	pp.gFree.n++
  5220  	if pp.gFree.n >= 64 {
  5221  		var (
  5222  			inc      int32
  5223  			stackQ   gQueue
  5224  			noStackQ gQueue
  5225  		)
  5226  		for pp.gFree.n >= 32 {
  5227  			gp := pp.gFree.pop()
  5228  			pp.gFree.n--
  5229  			if gp.stack.lo == 0 {
  5230  				noStackQ.push(gp)
  5231  			} else {
  5232  				stackQ.push(gp)
  5233  			}
  5234  			inc++
  5235  		}
  5236  		lock(&sched.gFree.lock)
  5237  		sched.gFree.noStack.pushAll(noStackQ)
  5238  		sched.gFree.stack.pushAll(stackQ)
  5239  		sched.gFree.n += inc
  5240  		unlock(&sched.gFree.lock)
  5241  	}
  5242  }
  5243  
  5244  // Get from gfree list.
  5245  // If local list is empty, grab a batch from global list.
  5246  func gfget(pp *p) *g {
  5247  retry:
  5248  	if pp.gFree.empty() && (!sched.gFree.stack.empty() || !sched.gFree.noStack.empty()) {
  5249  		lock(&sched.gFree.lock)
  5250  		// Move a batch of free Gs to the P.
  5251  		for pp.gFree.n < 32 {
  5252  			// Prefer Gs with stacks.
  5253  			gp := sched.gFree.stack.pop()
  5254  			if gp == nil {
  5255  				gp = sched.gFree.noStack.pop()
  5256  				if gp == nil {
  5257  					break
  5258  				}
  5259  			}
  5260  			sched.gFree.n--
  5261  			pp.gFree.push(gp)
  5262  			pp.gFree.n++
  5263  		}
  5264  		unlock(&sched.gFree.lock)
  5265  		goto retry
  5266  	}
  5267  	gp := pp.gFree.pop()
  5268  	if gp == nil {
  5269  		return nil
  5270  	}
  5271  	pp.gFree.n--
  5272  	if gp.stack.lo != 0 && gp.stack.hi-gp.stack.lo != uintptr(startingStackSize) {
  5273  		// Deallocate old stack. We kept it in gfput because it was the
  5274  		// right size when the goroutine was put on the free list, but
  5275  		// the right size has changed since then.
  5276  		systemstack(func() {
  5277  			stackfree(gp.stack)
  5278  			gp.stack.lo = 0
  5279  			gp.stack.hi = 0
  5280  			gp.stackguard0 = 0
  5281  		})
  5282  	}
  5283  	if gp.stack.lo == 0 {
  5284  		// Stack was deallocated in gfput or just above. Allocate a new one.
  5285  		systemstack(func() {
  5286  			gp.stack = stackalloc(startingStackSize)
  5287  		})
  5288  		gp.stackguard0 = gp.stack.lo + stackGuard
  5289  	} else {
  5290  		if raceenabled {
  5291  			racemalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
  5292  		}
  5293  		if msanenabled {
  5294  			msanmalloc(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
  5295  		}
  5296  		if asanenabled {
  5297  			asanunpoison(unsafe.Pointer(gp.stack.lo), gp.stack.hi-gp.stack.lo)
  5298  		}
  5299  	}
  5300  	return gp
  5301  }
  5302  
  5303  // Purge all cached G's from gfree list to the global list.
  5304  func gfpurge(pp *p) {
  5305  	var (
  5306  		inc      int32
  5307  		stackQ   gQueue
  5308  		noStackQ gQueue
  5309  	)
  5310  	for !pp.gFree.empty() {
  5311  		gp := pp.gFree.pop()
  5312  		pp.gFree.n--
  5313  		if gp.stack.lo == 0 {
  5314  			noStackQ.push(gp)
  5315  		} else {
  5316  			stackQ.push(gp)
  5317  		}
  5318  		inc++
  5319  	}
  5320  	lock(&sched.gFree.lock)
  5321  	sched.gFree.noStack.pushAll(noStackQ)
  5322  	sched.gFree.stack.pushAll(stackQ)
  5323  	sched.gFree.n += inc
  5324  	unlock(&sched.gFree.lock)
  5325  }
  5326  
  5327  // Breakpoint executes a breakpoint trap.
  5328  func Breakpoint() {
  5329  	breakpoint()
  5330  }
  5331  
  5332  // dolockOSThread is called by LockOSThread and lockOSThread below
  5333  // after they modify m.locked. Do not allow preemption during this call,
  5334  // or else the m might be different in this function than in the caller.
  5335  //
  5336  //go:nosplit
  5337  func dolockOSThread() {
  5338  	if GOARCH == "wasm" {
  5339  		return // no threads on wasm yet
  5340  	}
  5341  	gp := getg()
  5342  	gp.m.lockedg.set(gp)
  5343  	gp.lockedm.set(gp.m)
  5344  }
  5345  
  5346  // LockOSThread wires the calling goroutine to its current operating system thread.
  5347  // The calling goroutine will always execute in that thread,
  5348  // and no other goroutine will execute in it,
  5349  // until the calling goroutine has made as many calls to
  5350  // [UnlockOSThread] as to LockOSThread.
  5351  // If the calling goroutine exits without unlocking the thread,
  5352  // the thread will be terminated.
  5353  //
  5354  // All init functions are run on the startup thread. Calling LockOSThread
  5355  // from an init function will cause the main function to be invoked on
  5356  // that thread.
  5357  //
  5358  // A goroutine should call LockOSThread before calling OS services or
  5359  // non-Go library functions that depend on per-thread state.
  5360  //
  5361  //go:nosplit
  5362  func LockOSThread() {
  5363  	if atomic.Load(&newmHandoff.haveTemplateThread) == 0 && GOOS != "plan9" {
  5364  		// If we need to start a new thread from the locked
  5365  		// thread, we need the template thread. Start it now
  5366  		// while we're in a known-good state.
  5367  		startTemplateThread()
  5368  	}
  5369  	gp := getg()
  5370  	gp.m.lockedExt++
  5371  	if gp.m.lockedExt == 0 {
  5372  		gp.m.lockedExt--
  5373  		panic("LockOSThread nesting overflow")
  5374  	}
  5375  	dolockOSThread()
  5376  }
  5377  
  5378  //go:nosplit
  5379  func lockOSThread() {
  5380  	getg().m.lockedInt++
  5381  	dolockOSThread()
  5382  }
  5383  
  5384  // dounlockOSThread is called by UnlockOSThread and unlockOSThread below
  5385  // after they update m->locked. Do not allow preemption during this call,
  5386  // or else the m might be in different in this function than in the caller.
  5387  //
  5388  //go:nosplit
  5389  func dounlockOSThread() {
  5390  	if GOARCH == "wasm" {
  5391  		return // no threads on wasm yet
  5392  	}
  5393  	gp := getg()
  5394  	if gp.m.lockedInt != 0 || gp.m.lockedExt != 0 {
  5395  		return
  5396  	}
  5397  	gp.m.lockedg = 0
  5398  	gp.lockedm = 0
  5399  }
  5400  
  5401  // UnlockOSThread undoes an earlier call to LockOSThread.
  5402  // If this drops the number of active LockOSThread calls on the
  5403  // calling goroutine to zero, it unwires the calling goroutine from
  5404  // its fixed operating system thread.
  5405  // If there are no active LockOSThread calls, this is a no-op.
  5406  //
  5407  // Before calling UnlockOSThread, the caller must ensure that the OS
  5408  // thread is suitable for running other goroutines. If the caller made
  5409  // any permanent changes to the state of the thread that would affect
  5410  // other goroutines, it should not call this function and thus leave
  5411  // the goroutine locked to the OS thread until the goroutine (and
  5412  // hence the thread) exits.
  5413  //
  5414  //go:nosplit
  5415  func UnlockOSThread() {
  5416  	gp := getg()
  5417  	if gp.m.lockedExt == 0 {
  5418  		return
  5419  	}
  5420  	gp.m.lockedExt--
  5421  	dounlockOSThread()
  5422  }
  5423  
  5424  //go:nosplit
  5425  func unlockOSThread() {
  5426  	gp := getg()
  5427  	if gp.m.lockedInt == 0 {
  5428  		systemstack(badunlockosthread)
  5429  	}
  5430  	gp.m.lockedInt--
  5431  	dounlockOSThread()
  5432  }
  5433  
  5434  func badunlockosthread() {
  5435  	throw("runtime: internal error: misuse of lockOSThread/unlockOSThread")
  5436  }
  5437  
  5438  func gcount() int32 {
  5439  	n := int32(atomic.Loaduintptr(&allglen)) - sched.gFree.n - sched.ngsys.Load()
  5440  	for _, pp := range allp {
  5441  		n -= pp.gFree.n
  5442  	}
  5443  
  5444  	// All these variables can be changed concurrently, so the result can be inconsistent.
  5445  	// But at least the current goroutine is running.
  5446  	if n < 1 {
  5447  		n = 1
  5448  	}
  5449  	return n
  5450  }
  5451  
  5452  func mcount() int32 {
  5453  	return int32(sched.mnext - sched.nmfreed)
  5454  }
  5455  
  5456  var prof struct {
  5457  	signalLock atomic.Uint32
  5458  
  5459  	// Must hold signalLock to write. Reads may be lock-free, but
  5460  	// signalLock should be taken to synchronize with changes.
  5461  	hz atomic.Int32
  5462  }
  5463  
  5464  func _System()                    { _System() }
  5465  func _ExternalCode()              { _ExternalCode() }
  5466  func _LostExternalCode()          { _LostExternalCode() }
  5467  func _GC()                        { _GC() }
  5468  func _LostSIGPROFDuringAtomic64() { _LostSIGPROFDuringAtomic64() }
  5469  func _LostContendedRuntimeLock()  { _LostContendedRuntimeLock() }
  5470  func _VDSO()                      { _VDSO() }
  5471  
  5472  // Called if we receive a SIGPROF signal.
  5473  // Called by the signal handler, may run during STW.
  5474  //
  5475  //go:nowritebarrierrec
  5476  func sigprof(pc, sp, lr uintptr, gp *g, mp *m) {
  5477  	if prof.hz.Load() == 0 {
  5478  		return
  5479  	}
  5480  
  5481  	// If mp.profilehz is 0, then profiling is not enabled for this thread.
  5482  	// We must check this to avoid a deadlock between setcpuprofilerate
  5483  	// and the call to cpuprof.add, below.
  5484  	if mp != nil && mp.profilehz == 0 {
  5485  		return
  5486  	}
  5487  
  5488  	// On mips{,le}/arm, 64bit atomics are emulated with spinlocks, in
  5489  	// internal/runtime/atomic. If SIGPROF arrives while the program is inside
  5490  	// the critical section, it creates a deadlock (when writing the sample).
  5491  	// As a workaround, create a counter of SIGPROFs while in critical section
  5492  	// to store the count, and pass it to sigprof.add() later when SIGPROF is
  5493  	// received from somewhere else (with _LostSIGPROFDuringAtomic64 as pc).
  5494  	if GOARCH == "mips" || GOARCH == "mipsle" || GOARCH == "arm" {
  5495  		if f := findfunc(pc); f.valid() {
  5496  			if stringslite.HasPrefix(funcname(f), "internal/runtime/atomic") {
  5497  				cpuprof.lostAtomic++
  5498  				return
  5499  			}
  5500  		}
  5501  		if GOARCH == "arm" && goarm < 7 && GOOS == "linux" && pc&0xffff0000 == 0xffff0000 {
  5502  			// internal/runtime/atomic functions call into kernel
  5503  			// helpers on arm < 7. See
  5504  			// internal/runtime/atomic/sys_linux_arm.s.
  5505  			cpuprof.lostAtomic++
  5506  			return
  5507  		}
  5508  	}
  5509  
  5510  	// Profiling runs concurrently with GC, so it must not allocate.
  5511  	// Set a trap in case the code does allocate.
  5512  	// Note that on windows, one thread takes profiles of all the
  5513  	// other threads, so mp is usually not getg().m.
  5514  	// In fact mp may not even be stopped.
  5515  	// See golang.org/issue/17165.
  5516  	getg().m.mallocing++
  5517  
  5518  	var u unwinder
  5519  	var stk [maxCPUProfStack]uintptr
  5520  	n := 0
  5521  	if mp.ncgo > 0 && mp.curg != nil && mp.curg.syscallpc != 0 && mp.curg.syscallsp != 0 {
  5522  		cgoOff := 0
  5523  		// Check cgoCallersUse to make sure that we are not
  5524  		// interrupting other code that is fiddling with
  5525  		// cgoCallers.  We are running in a signal handler
  5526  		// with all signals blocked, so we don't have to worry
  5527  		// about any other code interrupting us.
  5528  		if mp.cgoCallersUse.Load() == 0 && mp.cgoCallers != nil && mp.cgoCallers[0] != 0 {
  5529  			for cgoOff < len(mp.cgoCallers) && mp.cgoCallers[cgoOff] != 0 {
  5530  				cgoOff++
  5531  			}
  5532  			n += copy(stk[:], mp.cgoCallers[:cgoOff])
  5533  			mp.cgoCallers[0] = 0
  5534  		}
  5535  
  5536  		// Collect Go stack that leads to the cgo call.
  5537  		u.initAt(mp.curg.syscallpc, mp.curg.syscallsp, 0, mp.curg, unwindSilentErrors)
  5538  	} else if usesLibcall() && mp.libcallg != 0 && mp.libcallpc != 0 && mp.libcallsp != 0 {
  5539  		// Libcall, i.e. runtime syscall on windows.
  5540  		// Collect Go stack that leads to the call.
  5541  		u.initAt(mp.libcallpc, mp.libcallsp, 0, mp.libcallg.ptr(), unwindSilentErrors)
  5542  	} else if mp != nil && mp.vdsoSP != 0 {
  5543  		// VDSO call, e.g. nanotime1 on Linux.
  5544  		// Collect Go stack that leads to the call.
  5545  		u.initAt(mp.vdsoPC, mp.vdsoSP, 0, gp, unwindSilentErrors|unwindJumpStack)
  5546  	} else {
  5547  		u.initAt(pc, sp, lr, gp, unwindSilentErrors|unwindTrap|unwindJumpStack)
  5548  	}
  5549  	n += tracebackPCs(&u, 0, stk[n:])
  5550  
  5551  	if n <= 0 {
  5552  		// Normal traceback is impossible or has failed.
  5553  		// Account it against abstract "System" or "GC".
  5554  		n = 2
  5555  		if inVDSOPage(pc) {
  5556  			pc = abi.FuncPCABIInternal(_VDSO) + sys.PCQuantum
  5557  		} else if pc > firstmoduledata.etext {
  5558  			// "ExternalCode" is better than "etext".
  5559  			pc = abi.FuncPCABIInternal(_ExternalCode) + sys.PCQuantum
  5560  		}
  5561  		stk[0] = pc
  5562  		if mp.preemptoff != "" {
  5563  			stk[1] = abi.FuncPCABIInternal(_GC) + sys.PCQuantum
  5564  		} else {
  5565  			stk[1] = abi.FuncPCABIInternal(_System) + sys.PCQuantum
  5566  		}
  5567  	}
  5568  
  5569  	if prof.hz.Load() != 0 {
  5570  		// Note: it can happen on Windows that we interrupted a system thread
  5571  		// with no g, so gp could nil. The other nil checks are done out of
  5572  		// caution, but not expected to be nil in practice.
  5573  		var tagPtr *unsafe.Pointer
  5574  		if gp != nil && gp.m != nil && gp.m.curg != nil {
  5575  			tagPtr = &gp.m.curg.labels
  5576  		}
  5577  		cpuprof.add(tagPtr, stk[:n])
  5578  
  5579  		gprof := gp
  5580  		var mp *m
  5581  		var pp *p
  5582  		if gp != nil && gp.m != nil {
  5583  			if gp.m.curg != nil {
  5584  				gprof = gp.m.curg
  5585  			}
  5586  			mp = gp.m
  5587  			pp = gp.m.p.ptr()
  5588  		}
  5589  		traceCPUSample(gprof, mp, pp, stk[:n])
  5590  	}
  5591  	getg().m.mallocing--
  5592  }
  5593  
  5594  // setcpuprofilerate sets the CPU profiling rate to hz times per second.
  5595  // If hz <= 0, setcpuprofilerate turns off CPU profiling.
  5596  func setcpuprofilerate(hz int32) {
  5597  	// Force sane arguments.
  5598  	if hz < 0 {
  5599  		hz = 0
  5600  	}
  5601  
  5602  	// Disable preemption, otherwise we can be rescheduled to another thread
  5603  	// that has profiling enabled.
  5604  	gp := getg()
  5605  	gp.m.locks++
  5606  
  5607  	// Stop profiler on this thread so that it is safe to lock prof.
  5608  	// if a profiling signal came in while we had prof locked,
  5609  	// it would deadlock.
  5610  	setThreadCPUProfiler(0)
  5611  
  5612  	for !prof.signalLock.CompareAndSwap(0, 1) {
  5613  		osyield()
  5614  	}
  5615  	if prof.hz.Load() != hz {
  5616  		setProcessCPUProfiler(hz)
  5617  		prof.hz.Store(hz)
  5618  	}
  5619  	prof.signalLock.Store(0)
  5620  
  5621  	lock(&sched.lock)
  5622  	sched.profilehz = hz
  5623  	unlock(&sched.lock)
  5624  
  5625  	if hz != 0 {
  5626  		setThreadCPUProfiler(hz)
  5627  	}
  5628  
  5629  	gp.m.locks--
  5630  }
  5631  
  5632  // init initializes pp, which may be a freshly allocated p or a
  5633  // previously destroyed p, and transitions it to status _Pgcstop.
  5634  func (pp *p) init(id int32) {
  5635  	pp.id = id
  5636  	pp.status = _Pgcstop
  5637  	pp.sudogcache = pp.sudogbuf[:0]
  5638  	pp.deferpool = pp.deferpoolbuf[:0]
  5639  	pp.wbBuf.reset()
  5640  	if pp.mcache == nil {
  5641  		if id == 0 {
  5642  			if mcache0 == nil {
  5643  				throw("missing mcache?")
  5644  			}
  5645  			// Use the bootstrap mcache0. Only one P will get
  5646  			// mcache0: the one with ID 0.
  5647  			pp.mcache = mcache0
  5648  		} else {
  5649  			pp.mcache = allocmcache()
  5650  		}
  5651  	}
  5652  	if raceenabled && pp.raceprocctx == 0 {
  5653  		if id == 0 {
  5654  			pp.raceprocctx = raceprocctx0
  5655  			raceprocctx0 = 0 // bootstrap
  5656  		} else {
  5657  			pp.raceprocctx = raceproccreate()
  5658  		}
  5659  	}
  5660  	lockInit(&pp.timers.mu, lockRankTimers)
  5661  
  5662  	// This P may get timers when it starts running. Set the mask here
  5663  	// since the P may not go through pidleget (notably P 0 on startup).
  5664  	timerpMask.set(id)
  5665  	// Similarly, we may not go through pidleget before this P starts
  5666  	// running if it is P 0 on startup.
  5667  	idlepMask.clear(id)
  5668  }
  5669  
  5670  // destroy releases all of the resources associated with pp and
  5671  // transitions it to status _Pdead.
  5672  //
  5673  // sched.lock must be held and the world must be stopped.
  5674  func (pp *p) destroy() {
  5675  	assertLockHeld(&sched.lock)
  5676  	assertWorldStopped()
  5677  
  5678  	// Move all runnable goroutines to the global queue
  5679  	for pp.runqhead != pp.runqtail {
  5680  		// Pop from tail of local queue
  5681  		pp.runqtail--
  5682  		gp := pp.runq[pp.runqtail%uint32(len(pp.runq))].ptr()
  5683  		// Push onto head of global queue
  5684  		globrunqputhead(gp)
  5685  	}
  5686  	if pp.runnext != 0 {
  5687  		globrunqputhead(pp.runnext.ptr())
  5688  		pp.runnext = 0
  5689  	}
  5690  
  5691  	// Move all timers to the local P.
  5692  	getg().m.p.ptr().timers.take(&pp.timers)
  5693  
  5694  	// Flush p's write barrier buffer.
  5695  	if gcphase != _GCoff {
  5696  		wbBufFlush1(pp)
  5697  		pp.gcw.dispose()
  5698  	}
  5699  	for i := range pp.sudogbuf {
  5700  		pp.sudogbuf[i] = nil
  5701  	}
  5702  	pp.sudogcache = pp.sudogbuf[:0]
  5703  	pp.pinnerCache = nil
  5704  	for j := range pp.deferpoolbuf {
  5705  		pp.deferpoolbuf[j] = nil
  5706  	}
  5707  	pp.deferpool = pp.deferpoolbuf[:0]
  5708  	systemstack(func() {
  5709  		for i := 0; i < pp.mspancache.len; i++ {
  5710  			// Safe to call since the world is stopped.
  5711  			mheap_.spanalloc.free(unsafe.Pointer(pp.mspancache.buf[i]))
  5712  		}
  5713  		pp.mspancache.len = 0
  5714  		lock(&mheap_.lock)
  5715  		pp.pcache.flush(&mheap_.pages)
  5716  		unlock(&mheap_.lock)
  5717  	})
  5718  	freemcache(pp.mcache)
  5719  	pp.mcache = nil
  5720  	gfpurge(pp)
  5721  	if raceenabled {
  5722  		if pp.timers.raceCtx != 0 {
  5723  			// The race detector code uses a callback to fetch
  5724  			// the proc context, so arrange for that callback
  5725  			// to see the right thing.
  5726  			// This hack only works because we are the only
  5727  			// thread running.
  5728  			mp := getg().m
  5729  			phold := mp.p.ptr()
  5730  			mp.p.set(pp)
  5731  
  5732  			racectxend(pp.timers.raceCtx)
  5733  			pp.timers.raceCtx = 0
  5734  
  5735  			mp.p.set(phold)
  5736  		}
  5737  		raceprocdestroy(pp.raceprocctx)
  5738  		pp.raceprocctx = 0
  5739  	}
  5740  	pp.gcAssistTime = 0
  5741  	pp.status = _Pdead
  5742  }
  5743  
  5744  // Change number of processors.
  5745  //
  5746  // sched.lock must be held, and the world must be stopped.
  5747  //
  5748  // gcworkbufs must not be being modified by either the GC or the write barrier
  5749  // code, so the GC must not be running if the number of Ps actually changes.
  5750  //
  5751  // Returns list of Ps with local work, they need to be scheduled by the caller.
  5752  func procresize(nprocs int32) *p {
  5753  	assertLockHeld(&sched.lock)
  5754  	assertWorldStopped()
  5755  
  5756  	old := gomaxprocs
  5757  	if old < 0 || nprocs <= 0 {
  5758  		throw("procresize: invalid arg")
  5759  	}
  5760  	trace := traceAcquire()
  5761  	if trace.ok() {
  5762  		trace.Gomaxprocs(nprocs)
  5763  		traceRelease(trace)
  5764  	}
  5765  
  5766  	// update statistics
  5767  	now := nanotime()
  5768  	if sched.procresizetime != 0 {
  5769  		sched.totaltime += int64(old) * (now - sched.procresizetime)
  5770  	}
  5771  	sched.procresizetime = now
  5772  
  5773  	maskWords := (nprocs + 31) / 32
  5774  
  5775  	// Grow allp if necessary.
  5776  	if nprocs > int32(len(allp)) {
  5777  		// Synchronize with retake, which could be running
  5778  		// concurrently since it doesn't run on a P.
  5779  		lock(&allpLock)
  5780  		if nprocs <= int32(cap(allp)) {
  5781  			allp = allp[:nprocs]
  5782  		} else {
  5783  			nallp := make([]*p, nprocs)
  5784  			// Copy everything up to allp's cap so we
  5785  			// never lose old allocated Ps.
  5786  			copy(nallp, allp[:cap(allp)])
  5787  			allp = nallp
  5788  		}
  5789  
  5790  		if maskWords <= int32(cap(idlepMask)) {
  5791  			idlepMask = idlepMask[:maskWords]
  5792  			timerpMask = timerpMask[:maskWords]
  5793  		} else {
  5794  			nidlepMask := make([]uint32, maskWords)
  5795  			// No need to copy beyond len, old Ps are irrelevant.
  5796  			copy(nidlepMask, idlepMask)
  5797  			idlepMask = nidlepMask
  5798  
  5799  			ntimerpMask := make([]uint32, maskWords)
  5800  			copy(ntimerpMask, timerpMask)
  5801  			timerpMask = ntimerpMask
  5802  		}
  5803  		unlock(&allpLock)
  5804  	}
  5805  
  5806  	// initialize new P's
  5807  	for i := old; i < nprocs; i++ {
  5808  		pp := allp[i]
  5809  		if pp == nil {
  5810  			pp = new(p)
  5811  		}
  5812  		pp.init(i)
  5813  		atomicstorep(unsafe.Pointer(&allp[i]), unsafe.Pointer(pp))
  5814  	}
  5815  
  5816  	gp := getg()
  5817  	if gp.m.p != 0 && gp.m.p.ptr().id < nprocs {
  5818  		// continue to use the current P
  5819  		gp.m.p.ptr().status = _Prunning
  5820  		gp.m.p.ptr().mcache.prepareForSweep()
  5821  	} else {
  5822  		// release the current P and acquire allp[0].
  5823  		//
  5824  		// We must do this before destroying our current P
  5825  		// because p.destroy itself has write barriers, so we
  5826  		// need to do that from a valid P.
  5827  		if gp.m.p != 0 {
  5828  			trace := traceAcquire()
  5829  			if trace.ok() {
  5830  				// Pretend that we were descheduled
  5831  				// and then scheduled again to keep
  5832  				// the trace consistent.
  5833  				trace.GoSched()
  5834  				trace.ProcStop(gp.m.p.ptr())
  5835  				traceRelease(trace)
  5836  			}
  5837  			gp.m.p.ptr().m = 0
  5838  		}
  5839  		gp.m.p = 0
  5840  		pp := allp[0]
  5841  		pp.m = 0
  5842  		pp.status = _Pidle
  5843  		acquirep(pp)
  5844  		trace := traceAcquire()
  5845  		if trace.ok() {
  5846  			trace.GoStart()
  5847  			traceRelease(trace)
  5848  		}
  5849  	}
  5850  
  5851  	// g.m.p is now set, so we no longer need mcache0 for bootstrapping.
  5852  	mcache0 = nil
  5853  
  5854  	// release resources from unused P's
  5855  	for i := nprocs; i < old; i++ {
  5856  		pp := allp[i]
  5857  		pp.destroy()
  5858  		// can't free P itself because it can be referenced by an M in syscall
  5859  	}
  5860  
  5861  	// Trim allp.
  5862  	if int32(len(allp)) != nprocs {
  5863  		lock(&allpLock)
  5864  		allp = allp[:nprocs]
  5865  		idlepMask = idlepMask[:maskWords]
  5866  		timerpMask = timerpMask[:maskWords]
  5867  		unlock(&allpLock)
  5868  	}
  5869  
  5870  	var runnablePs *p
  5871  	for i := nprocs - 1; i >= 0; i-- {
  5872  		pp := allp[i]
  5873  		if gp.m.p.ptr() == pp {
  5874  			continue
  5875  		}
  5876  		pp.status = _Pidle
  5877  		if runqempty(pp) {
  5878  			pidleput(pp, now)
  5879  		} else {
  5880  			pp.m.set(mget())
  5881  			pp.link.set(runnablePs)
  5882  			runnablePs = pp
  5883  		}
  5884  	}
  5885  	stealOrder.reset(uint32(nprocs))
  5886  	var int32p *int32 = &gomaxprocs // make compiler check that gomaxprocs is an int32
  5887  	atomic.Store((*uint32)(unsafe.Pointer(int32p)), uint32(nprocs))
  5888  	if old != nprocs {
  5889  		// Notify the limiter that the amount of procs has changed.
  5890  		gcCPULimiter.resetCapacity(now, nprocs)
  5891  	}
  5892  	return runnablePs
  5893  }
  5894  
  5895  // Associate p and the current m.
  5896  //
  5897  // This function is allowed to have write barriers even if the caller
  5898  // isn't because it immediately acquires pp.
  5899  //
  5900  //go:yeswritebarrierrec
  5901  func acquirep(pp *p) {
  5902  	// Do the part that isn't allowed to have write barriers.
  5903  	wirep(pp)
  5904  
  5905  	// Have p; write barriers now allowed.
  5906  
  5907  	// Perform deferred mcache flush before this P can allocate
  5908  	// from a potentially stale mcache.
  5909  	pp.mcache.prepareForSweep()
  5910  
  5911  	trace := traceAcquire()
  5912  	if trace.ok() {
  5913  		trace.ProcStart()
  5914  		traceRelease(trace)
  5915  	}
  5916  }
  5917  
  5918  // wirep is the first step of acquirep, which actually associates the
  5919  // current M to pp. This is broken out so we can disallow write
  5920  // barriers for this part, since we don't yet have a P.
  5921  //
  5922  //go:nowritebarrierrec
  5923  //go:nosplit
  5924  func wirep(pp *p) {
  5925  	gp := getg()
  5926  
  5927  	if gp.m.p != 0 {
  5928  		// Call on the systemstack to avoid a nosplit overflow build failure
  5929  		// on some platforms when built with -N -l. See #64113.
  5930  		systemstack(func() {
  5931  			throw("wirep: already in go")
  5932  		})
  5933  	}
  5934  	if pp.m != 0 || pp.status != _Pidle {
  5935  		// Call on the systemstack to avoid a nosplit overflow build failure
  5936  		// on some platforms when built with -N -l. See #64113.
  5937  		systemstack(func() {
  5938  			id := int64(0)
  5939  			if pp.m != 0 {
  5940  				id = pp.m.ptr().id
  5941  			}
  5942  			print("wirep: p->m=", pp.m, "(", id, ") p->status=", pp.status, "\n")
  5943  			throw("wirep: invalid p state")
  5944  		})
  5945  	}
  5946  	gp.m.p.set(pp)
  5947  	pp.m.set(gp.m)
  5948  	pp.status = _Prunning
  5949  }
  5950  
  5951  // Disassociate p and the current m.
  5952  func releasep() *p {
  5953  	trace := traceAcquire()
  5954  	if trace.ok() {
  5955  		trace.ProcStop(getg().m.p.ptr())
  5956  		traceRelease(trace)
  5957  	}
  5958  	return releasepNoTrace()
  5959  }
  5960  
  5961  // Disassociate p and the current m without tracing an event.
  5962  func releasepNoTrace() *p {
  5963  	gp := getg()
  5964  
  5965  	if gp.m.p == 0 {
  5966  		throw("releasep: invalid arg")
  5967  	}
  5968  	pp := gp.m.p.ptr()
  5969  	if pp.m.ptr() != gp.m || pp.status != _Prunning {
  5970  		print("releasep: m=", gp.m, " m->p=", gp.m.p.ptr(), " p->m=", hex(pp.m), " p->status=", pp.status, "\n")
  5971  		throw("releasep: invalid p state")
  5972  	}
  5973  	gp.m.p = 0
  5974  	pp.m = 0
  5975  	pp.status = _Pidle
  5976  	return pp
  5977  }
  5978  
  5979  func incidlelocked(v int32) {
  5980  	lock(&sched.lock)
  5981  	sched.nmidlelocked += v
  5982  	if v > 0 {
  5983  		checkdead()
  5984  	}
  5985  	unlock(&sched.lock)
  5986  }
  5987  
  5988  // Check for deadlock situation.
  5989  // The check is based on number of running M's, if 0 -> deadlock.
  5990  // sched.lock must be held.
  5991  func checkdead() {
  5992  	assertLockHeld(&sched.lock)
  5993  
  5994  	// For -buildmode=c-shared or -buildmode=c-archive it's OK if
  5995  	// there are no running goroutines. The calling program is
  5996  	// assumed to be running.
  5997  	// One exception is Wasm, which is single-threaded. If we are
  5998  	// in Go and all goroutines are blocked, it deadlocks.
  5999  	if (islibrary || isarchive) && GOARCH != "wasm" {
  6000  		return
  6001  	}
  6002  
  6003  	// If we are dying because of a signal caught on an already idle thread,
  6004  	// freezetheworld will cause all running threads to block.
  6005  	// And runtime will essentially enter into deadlock state,
  6006  	// except that there is a thread that will call exit soon.
  6007  	if panicking.Load() > 0 {
  6008  		return
  6009  	}
  6010  
  6011  	// If we are not running under cgo, but we have an extra M then account
  6012  	// for it. (It is possible to have an extra M on Windows without cgo to
  6013  	// accommodate callbacks created by syscall.NewCallback. See issue #6751
  6014  	// for details.)
  6015  	var run0 int32
  6016  	if !iscgo && cgoHasExtraM && extraMLength.Load() > 0 {
  6017  		run0 = 1
  6018  	}
  6019  
  6020  	run := mcount() - sched.nmidle - sched.nmidlelocked - sched.nmsys
  6021  	if run > run0 {
  6022  		return
  6023  	}
  6024  	if run < 0 {
  6025  		print("runtime: checkdead: nmidle=", sched.nmidle, " nmidlelocked=", sched.nmidlelocked, " mcount=", mcount(), " nmsys=", sched.nmsys, "\n")
  6026  		unlock(&sched.lock)
  6027  		throw("checkdead: inconsistent counts")
  6028  	}
  6029  
  6030  	grunning := 0
  6031  	forEachG(func(gp *g) {
  6032  		if isSystemGoroutine(gp, false) {
  6033  			return
  6034  		}
  6035  		s := readgstatus(gp)
  6036  		switch s &^ _Gscan {
  6037  		case _Gwaiting,
  6038  			_Gpreempted:
  6039  			grunning++
  6040  		case _Grunnable,
  6041  			_Grunning,
  6042  			_Gsyscall:
  6043  			print("runtime: checkdead: find g ", gp.goid, " in status ", s, "\n")
  6044  			unlock(&sched.lock)
  6045  			throw("checkdead: runnable g")
  6046  		}
  6047  	})
  6048  	if grunning == 0 { // possible if main goroutine calls runtime·Goexit()
  6049  		unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
  6050  		fatal("no goroutines (main called runtime.Goexit) - deadlock!")
  6051  	}
  6052  
  6053  	// Maybe jump time forward for playground.
  6054  	if faketime != 0 {
  6055  		if when := timeSleepUntil(); when < maxWhen {
  6056  			faketime = when
  6057  
  6058  			// Start an M to steal the timer.
  6059  			pp, _ := pidleget(faketime)
  6060  			if pp == nil {
  6061  				// There should always be a free P since
  6062  				// nothing is running.
  6063  				unlock(&sched.lock)
  6064  				throw("checkdead: no p for timer")
  6065  			}
  6066  			mp := mget()
  6067  			if mp == nil {
  6068  				// There should always be a free M since
  6069  				// nothing is running.
  6070  				unlock(&sched.lock)
  6071  				throw("checkdead: no m for timer")
  6072  			}
  6073  			// M must be spinning to steal. We set this to be
  6074  			// explicit, but since this is the only M it would
  6075  			// become spinning on its own anyways.
  6076  			sched.nmspinning.Add(1)
  6077  			mp.spinning = true
  6078  			mp.nextp.set(pp)
  6079  			notewakeup(&mp.park)
  6080  			return
  6081  		}
  6082  	}
  6083  
  6084  	// There are no goroutines running, so we can look at the P's.
  6085  	for _, pp := range allp {
  6086  		if len(pp.timers.heap) > 0 {
  6087  			return
  6088  		}
  6089  	}
  6090  
  6091  	unlock(&sched.lock) // unlock so that GODEBUG=scheddetail=1 doesn't hang
  6092  	fatal("all goroutines are asleep - deadlock!")
  6093  }
  6094  
  6095  // forcegcperiod is the maximum time in nanoseconds between garbage
  6096  // collections. If we go this long without a garbage collection, one
  6097  // is forced to run.
  6098  //
  6099  // This is a variable for testing purposes. It normally doesn't change.
  6100  var forcegcperiod int64 = 2 * 60 * 1e9
  6101  
  6102  // needSysmonWorkaround is true if the workaround for
  6103  // golang.org/issue/42515 is needed on NetBSD.
  6104  var needSysmonWorkaround bool = false
  6105  
  6106  // haveSysmon indicates whether there is sysmon thread support.
  6107  //
  6108  // No threads on wasm yet, so no sysmon.
  6109  const haveSysmon = GOARCH != "wasm"
  6110  
  6111  // Always runs without a P, so write barriers are not allowed.
  6112  //
  6113  //go:nowritebarrierrec
  6114  func sysmon() {
  6115  	lock(&sched.lock)
  6116  	sched.nmsys++
  6117  	checkdead()
  6118  	unlock(&sched.lock)
  6119  
  6120  	lasttrace := int64(0)
  6121  	idle := 0 // how many cycles in succession we had not wokeup somebody
  6122  	delay := uint32(0)
  6123  
  6124  	for {
  6125  		if idle == 0 { // start with 20us sleep...
  6126  			delay = 20
  6127  		} else if idle > 50 { // start doubling the sleep after 1ms...
  6128  			delay *= 2
  6129  		}
  6130  		if delay > 10*1000 { // up to 10ms
  6131  			delay = 10 * 1000
  6132  		}
  6133  		usleep(delay)
  6134  
  6135  		// sysmon should not enter deep sleep if schedtrace is enabled so that
  6136  		// it can print that information at the right time.
  6137  		//
  6138  		// It should also not enter deep sleep if there are any active P's so
  6139  		// that it can retake P's from syscalls, preempt long running G's, and
  6140  		// poll the network if all P's are busy for long stretches.
  6141  		//
  6142  		// It should wakeup from deep sleep if any P's become active either due
  6143  		// to exiting a syscall or waking up due to a timer expiring so that it
  6144  		// can resume performing those duties. If it wakes from a syscall it
  6145  		// resets idle and delay as a bet that since it had retaken a P from a
  6146  		// syscall before, it may need to do it again shortly after the
  6147  		// application starts work again. It does not reset idle when waking
  6148  		// from a timer to avoid adding system load to applications that spend
  6149  		// most of their time sleeping.
  6150  		now := nanotime()
  6151  		if debug.schedtrace <= 0 && (sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs) {
  6152  			lock(&sched.lock)
  6153  			if sched.gcwaiting.Load() || sched.npidle.Load() == gomaxprocs {
  6154  				syscallWake := false
  6155  				next := timeSleepUntil()
  6156  				if next > now {
  6157  					sched.sysmonwait.Store(true)
  6158  					unlock(&sched.lock)
  6159  					// Make wake-up period small enough
  6160  					// for the sampling to be correct.
  6161  					sleep := forcegcperiod / 2
  6162  					if next-now < sleep {
  6163  						sleep = next - now
  6164  					}
  6165  					shouldRelax := sleep >= osRelaxMinNS
  6166  					if shouldRelax {
  6167  						osRelax(true)
  6168  					}
  6169  					syscallWake = notetsleep(&sched.sysmonnote, sleep)
  6170  					if shouldRelax {
  6171  						osRelax(false)
  6172  					}
  6173  					lock(&sched.lock)
  6174  					sched.sysmonwait.Store(false)
  6175  					noteclear(&sched.sysmonnote)
  6176  				}
  6177  				if syscallWake {
  6178  					idle = 0
  6179  					delay = 20
  6180  				}
  6181  			}
  6182  			unlock(&sched.lock)
  6183  		}
  6184  
  6185  		lock(&sched.sysmonlock)
  6186  		// Update now in case we blocked on sysmonnote or spent a long time
  6187  		// blocked on schedlock or sysmonlock above.
  6188  		now = nanotime()
  6189  
  6190  		// trigger libc interceptors if needed
  6191  		if *cgo_yield != nil {
  6192  			asmcgocall(*cgo_yield, nil)
  6193  		}
  6194  		// poll network if not polled for more than 10ms
  6195  		lastpoll := sched.lastpoll.Load()
  6196  		if netpollinited() && lastpoll != 0 && lastpoll+10*1000*1000 < now {
  6197  			sched.lastpoll.CompareAndSwap(lastpoll, now)
  6198  			list, delta := netpoll(0) // non-blocking - returns list of goroutines
  6199  			if !list.empty() {
  6200  				// Need to decrement number of idle locked M's
  6201  				// (pretending that one more is running) before injectglist.
  6202  				// Otherwise it can lead to the following situation:
  6203  				// injectglist grabs all P's but before it starts M's to run the P's,
  6204  				// another M returns from syscall, finishes running its G,
  6205  				// observes that there is no work to do and no other running M's
  6206  				// and reports deadlock.
  6207  				incidlelocked(-1)
  6208  				injectglist(&list)
  6209  				incidlelocked(1)
  6210  				netpollAdjustWaiters(delta)
  6211  			}
  6212  		}
  6213  		if GOOS == "netbsd" && needSysmonWorkaround {
  6214  			// netpoll is responsible for waiting for timer
  6215  			// expiration, so we typically don't have to worry
  6216  			// about starting an M to service timers. (Note that
  6217  			// sleep for timeSleepUntil above simply ensures sysmon
  6218  			// starts running again when that timer expiration may
  6219  			// cause Go code to run again).
  6220  			//
  6221  			// However, netbsd has a kernel bug that sometimes
  6222  			// misses netpollBreak wake-ups, which can lead to
  6223  			// unbounded delays servicing timers. If we detect this
  6224  			// overrun, then startm to get something to handle the
  6225  			// timer.
  6226  			//
  6227  			// See issue 42515 and
  6228  			// https://gnats.netbsd.org/cgi-bin/query-pr-single.pl?number=50094.
  6229  			if next := timeSleepUntil(); next < now {
  6230  				startm(nil, false, false)
  6231  			}
  6232  		}
  6233  		if scavenger.sysmonWake.Load() != 0 {
  6234  			// Kick the scavenger awake if someone requested it.
  6235  			scavenger.wake()
  6236  		}
  6237  		// retake P's blocked in syscalls
  6238  		// and preempt long running G's
  6239  		if retake(now) != 0 {
  6240  			idle = 0
  6241  		} else {
  6242  			idle++
  6243  		}
  6244  		// check if we need to force a GC
  6245  		if t := (gcTrigger{kind: gcTriggerTime, now: now}); t.test() && forcegc.idle.Load() {
  6246  			lock(&forcegc.lock)
  6247  			forcegc.idle.Store(false)
  6248  			var list gList
  6249  			list.push(forcegc.g)
  6250  			injectglist(&list)
  6251  			unlock(&forcegc.lock)
  6252  		}
  6253  		if debug.schedtrace > 0 && lasttrace+int64(debug.schedtrace)*1000000 <= now {
  6254  			lasttrace = now
  6255  			schedtrace(debug.scheddetail > 0)
  6256  		}
  6257  		unlock(&sched.sysmonlock)
  6258  	}
  6259  }
  6260  
  6261  type sysmontick struct {
  6262  	schedtick   uint32
  6263  	syscalltick uint32
  6264  	schedwhen   int64
  6265  	syscallwhen int64
  6266  }
  6267  
  6268  // forcePreemptNS is the time slice given to a G before it is
  6269  // preempted.
  6270  const forcePreemptNS = 10 * 1000 * 1000 // 10ms
  6271  
  6272  func retake(now int64) uint32 {
  6273  	n := 0
  6274  	// Prevent allp slice changes. This lock will be completely
  6275  	// uncontended unless we're already stopping the world.
  6276  	lock(&allpLock)
  6277  	// We can't use a range loop over allp because we may
  6278  	// temporarily drop the allpLock. Hence, we need to re-fetch
  6279  	// allp each time around the loop.
  6280  	for i := 0; i < len(allp); i++ {
  6281  		pp := allp[i]
  6282  		if pp == nil {
  6283  			// This can happen if procresize has grown
  6284  			// allp but not yet created new Ps.
  6285  			continue
  6286  		}
  6287  		pd := &pp.sysmontick
  6288  		s := pp.status
  6289  		sysretake := false
  6290  		if s == _Prunning || s == _Psyscall {
  6291  			// Preempt G if it's running on the same schedtick for
  6292  			// too long. This could be from a single long-running
  6293  			// goroutine or a sequence of goroutines run via
  6294  			// runnext, which share a single schedtick time slice.
  6295  			t := int64(pp.schedtick)
  6296  			if int64(pd.schedtick) != t {
  6297  				pd.schedtick = uint32(t)
  6298  				pd.schedwhen = now
  6299  			} else if pd.schedwhen+forcePreemptNS <= now {
  6300  				preemptone(pp)
  6301  				// In case of syscall, preemptone() doesn't
  6302  				// work, because there is no M wired to P.
  6303  				sysretake = true
  6304  			}
  6305  		}
  6306  		if s == _Psyscall {
  6307  			// Retake P from syscall if it's there for more than 1 sysmon tick (at least 20us).
  6308  			t := int64(pp.syscalltick)
  6309  			if !sysretake && int64(pd.syscalltick) != t {
  6310  				pd.syscalltick = uint32(t)
  6311  				pd.syscallwhen = now
  6312  				continue
  6313  			}
  6314  			// On the one hand we don't want to retake Ps if there is no other work to do,
  6315  			// but on the other hand we want to retake them eventually
  6316  			// because they can prevent the sysmon thread from deep sleep.
  6317  			if runqempty(pp) && sched.nmspinning.Load()+sched.npidle.Load() > 0 && pd.syscallwhen+10*1000*1000 > now {
  6318  				continue
  6319  			}
  6320  			// Drop allpLock so we can take sched.lock.
  6321  			unlock(&allpLock)
  6322  			// Need to decrement number of idle locked M's
  6323  			// (pretending that one more is running) before the CAS.
  6324  			// Otherwise the M from which we retake can exit the syscall,
  6325  			// increment nmidle and report deadlock.
  6326  			incidlelocked(-1)
  6327  			trace := traceAcquire()
  6328  			if atomic.Cas(&pp.status, s, _Pidle) {
  6329  				if trace.ok() {
  6330  					trace.ProcSteal(pp, false)
  6331  					traceRelease(trace)
  6332  				}
  6333  				n++
  6334  				pp.syscalltick++
  6335  				handoffp(pp)
  6336  			} else if trace.ok() {
  6337  				traceRelease(trace)
  6338  			}
  6339  			incidlelocked(1)
  6340  			lock(&allpLock)
  6341  		}
  6342  	}
  6343  	unlock(&allpLock)
  6344  	return uint32(n)
  6345  }
  6346  
  6347  // Tell all goroutines that they have been preempted and they should stop.
  6348  // This function is purely best-effort. It can fail to inform a goroutine if a
  6349  // processor just started running it.
  6350  // No locks need to be held.
  6351  // Returns true if preemption request was issued to at least one goroutine.
  6352  func preemptall() bool {
  6353  	res := false
  6354  	for _, pp := range allp {
  6355  		if pp.status != _Prunning {
  6356  			continue
  6357  		}
  6358  		if preemptone(pp) {
  6359  			res = true
  6360  		}
  6361  	}
  6362  	return res
  6363  }
  6364  
  6365  // Tell the goroutine running on processor P to stop.
  6366  // This function is purely best-effort. It can incorrectly fail to inform the
  6367  // goroutine. It can inform the wrong goroutine. Even if it informs the
  6368  // correct goroutine, that goroutine might ignore the request if it is
  6369  // simultaneously executing newstack.
  6370  // No lock needs to be held.
  6371  // Returns true if preemption request was issued.
  6372  // The actual preemption will happen at some point in the future
  6373  // and will be indicated by the gp->status no longer being
  6374  // Grunning
  6375  func preemptone(pp *p) bool {
  6376  	mp := pp.m.ptr()
  6377  	if mp == nil || mp == getg().m {
  6378  		return false
  6379  	}
  6380  	gp := mp.curg
  6381  	if gp == nil || gp == mp.g0 {
  6382  		return false
  6383  	}
  6384  
  6385  	gp.preempt = true
  6386  
  6387  	// Every call in a goroutine checks for stack overflow by
  6388  	// comparing the current stack pointer to gp->stackguard0.
  6389  	// Setting gp->stackguard0 to StackPreempt folds
  6390  	// preemption into the normal stack overflow check.
  6391  	gp.stackguard0 = stackPreempt
  6392  
  6393  	// Request an async preemption of this P.
  6394  	if preemptMSupported && debug.asyncpreemptoff == 0 {
  6395  		pp.preempt = true
  6396  		preemptM(mp)
  6397  	}
  6398  
  6399  	return true
  6400  }
  6401  
  6402  var starttime int64
  6403  
  6404  func schedtrace(detailed bool) {
  6405  	now := nanotime()
  6406  	if starttime == 0 {
  6407  		starttime = now
  6408  	}
  6409  
  6410  	lock(&sched.lock)
  6411  	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)
  6412  	if detailed {
  6413  		print(" gcwaiting=", sched.gcwaiting.Load(), " nmidlelocked=", sched.nmidlelocked, " stopwait=", sched.stopwait, " sysmonwait=", sched.sysmonwait.Load(), "\n")
  6414  	}
  6415  	// We must be careful while reading data from P's, M's and G's.
  6416  	// Even if we hold schedlock, most data can be changed concurrently.
  6417  	// E.g. (p->m ? p->m->id : -1) can crash if p->m changes from non-nil to nil.
  6418  	for i, pp := range allp {
  6419  		h := atomic.Load(&pp.runqhead)
  6420  		t := atomic.Load(&pp.runqtail)
  6421  		if detailed {
  6422  			print("  P", i, ": status=", pp.status, " schedtick=", pp.schedtick, " syscalltick=", pp.syscalltick, " m=")
  6423  			mp := pp.m.ptr()
  6424  			if mp != nil {
  6425  				print(mp.id)
  6426  			} else {
  6427  				print("nil")
  6428  			}
  6429  			print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers.heap), "\n")
  6430  		} else {
  6431  			// In non-detailed mode format lengths of per-P run queues as:
  6432  			// [ len1 len2 len3 len4 ]
  6433  			print(" ")
  6434  			if i == 0 {
  6435  				print("[ ")
  6436  			}
  6437  			print(t - h)
  6438  			if i == len(allp)-1 {
  6439  				print(" ]")
  6440  			}
  6441  		}
  6442  	}
  6443  
  6444  	if !detailed {
  6445  		// Format per-P schedticks as: schedticks=[ tick1 tick2 tick3 tick4 ].
  6446  		print(" schedticks=[ ")
  6447  		for _, pp := range allp {
  6448  			print(pp.schedtick)
  6449  			print(" ")
  6450  		}
  6451  		print("]\n")
  6452  	}
  6453  
  6454  	if !detailed {
  6455  		unlock(&sched.lock)
  6456  		return
  6457  	}
  6458  
  6459  	for mp := allm; mp != nil; mp = mp.alllink {
  6460  		pp := mp.p.ptr()
  6461  		print("  M", mp.id, ": p=")
  6462  		if pp != nil {
  6463  			print(pp.id)
  6464  		} else {
  6465  			print("nil")
  6466  		}
  6467  		print(" curg=")
  6468  		if mp.curg != nil {
  6469  			print(mp.curg.goid)
  6470  		} else {
  6471  			print("nil")
  6472  		}
  6473  		print(" mallocing=", mp.mallocing, " throwing=", mp.throwing, " preemptoff=", mp.preemptoff, " locks=", mp.locks, " dying=", mp.dying, " spinning=", mp.spinning, " blocked=", mp.blocked, " lockedg=")
  6474  		if lockedg := mp.lockedg.ptr(); lockedg != nil {
  6475  			print(lockedg.goid)
  6476  		} else {
  6477  			print("nil")
  6478  		}
  6479  		print("\n")
  6480  	}
  6481  
  6482  	forEachG(func(gp *g) {
  6483  		print("  G", gp.goid, ": status=", readgstatus(gp), "(", gp.waitreason.String(), ") m=")
  6484  		if gp.m != nil {
  6485  			print(gp.m.id)
  6486  		} else {
  6487  			print("nil")
  6488  		}
  6489  		print(" lockedm=")
  6490  		if lockedm := gp.lockedm.ptr(); lockedm != nil {
  6491  			print(lockedm.id)
  6492  		} else {
  6493  			print("nil")
  6494  		}
  6495  		print("\n")
  6496  	})
  6497  	unlock(&sched.lock)
  6498  }
  6499  
  6500  // schedEnableUser enables or disables the scheduling of user
  6501  // goroutines.
  6502  //
  6503  // This does not stop already running user goroutines, so the caller
  6504  // should first stop the world when disabling user goroutines.
  6505  func schedEnableUser(enable bool) {
  6506  	lock(&sched.lock)
  6507  	if sched.disable.user == !enable {
  6508  		unlock(&sched.lock)
  6509  		return
  6510  	}
  6511  	sched.disable.user = !enable
  6512  	if enable {
  6513  		n := sched.disable.n
  6514  		sched.disable.n = 0
  6515  		globrunqputbatch(&sched.disable.runnable, n)
  6516  		unlock(&sched.lock)
  6517  		for ; n != 0 && sched.npidle.Load() != 0; n-- {
  6518  			startm(nil, false, false)
  6519  		}
  6520  	} else {
  6521  		unlock(&sched.lock)
  6522  	}
  6523  }
  6524  
  6525  // schedEnabled reports whether gp should be scheduled. It returns
  6526  // false is scheduling of gp is disabled.
  6527  //
  6528  // sched.lock must be held.
  6529  func schedEnabled(gp *g) bool {
  6530  	assertLockHeld(&sched.lock)
  6531  
  6532  	if sched.disable.user {
  6533  		return isSystemGoroutine(gp, true)
  6534  	}
  6535  	return true
  6536  }
  6537  
  6538  // Put mp on midle list.
  6539  // sched.lock must be held.
  6540  // May run during STW, so write barriers are not allowed.
  6541  //
  6542  //go:nowritebarrierrec
  6543  func mput(mp *m) {
  6544  	assertLockHeld(&sched.lock)
  6545  
  6546  	mp.schedlink = sched.midle
  6547  	sched.midle.set(mp)
  6548  	sched.nmidle++
  6549  	checkdead()
  6550  }
  6551  
  6552  // Try to get an m from midle list.
  6553  // sched.lock must be held.
  6554  // May run during STW, so write barriers are not allowed.
  6555  //
  6556  //go:nowritebarrierrec
  6557  func mget() *m {
  6558  	assertLockHeld(&sched.lock)
  6559  
  6560  	mp := sched.midle.ptr()
  6561  	if mp != nil {
  6562  		sched.midle = mp.schedlink
  6563  		sched.nmidle--
  6564  	}
  6565  	return mp
  6566  }
  6567  
  6568  // Put gp on the global runnable queue.
  6569  // sched.lock must be held.
  6570  // May run during STW, so write barriers are not allowed.
  6571  //
  6572  //go:nowritebarrierrec
  6573  func globrunqput(gp *g) {
  6574  	assertLockHeld(&sched.lock)
  6575  
  6576  	sched.runq.pushBack(gp)
  6577  	sched.runqsize++
  6578  }
  6579  
  6580  // Put gp at the head of the global runnable queue.
  6581  // sched.lock must be held.
  6582  // May run during STW, so write barriers are not allowed.
  6583  //
  6584  //go:nowritebarrierrec
  6585  func globrunqputhead(gp *g) {
  6586  	assertLockHeld(&sched.lock)
  6587  
  6588  	sched.runq.push(gp)
  6589  	sched.runqsize++
  6590  }
  6591  
  6592  // Put a batch of runnable goroutines on the global runnable queue.
  6593  // This clears *batch.
  6594  // sched.lock must be held.
  6595  // May run during STW, so write barriers are not allowed.
  6596  //
  6597  //go:nowritebarrierrec
  6598  func globrunqputbatch(batch *gQueue, n int32) {
  6599  	assertLockHeld(&sched.lock)
  6600  
  6601  	sched.runq.pushBackAll(*batch)
  6602  	sched.runqsize += n
  6603  	*batch = gQueue{}
  6604  }
  6605  
  6606  // Try get a batch of G's from the global runnable queue.
  6607  // sched.lock must be held.
  6608  func globrunqget(pp *p, max int32) *g {
  6609  	assertLockHeld(&sched.lock)
  6610  
  6611  	if sched.runqsize == 0 {
  6612  		return nil
  6613  	}
  6614  
  6615  	n := sched.runqsize/gomaxprocs + 1
  6616  	if n > sched.runqsize {
  6617  		n = sched.runqsize
  6618  	}
  6619  	if max > 0 && n > max {
  6620  		n = max
  6621  	}
  6622  	if n > int32(len(pp.runq))/2 {
  6623  		n = int32(len(pp.runq)) / 2
  6624  	}
  6625  
  6626  	sched.runqsize -= n
  6627  
  6628  	gp := sched.runq.pop()
  6629  	n--
  6630  	for ; n > 0; n-- {
  6631  		gp1 := sched.runq.pop()
  6632  		runqput(pp, gp1, false)
  6633  	}
  6634  	return gp
  6635  }
  6636  
  6637  // pMask is an atomic bitstring with one bit per P.
  6638  type pMask []uint32
  6639  
  6640  // read returns true if P id's bit is set.
  6641  func (p pMask) read(id uint32) bool {
  6642  	word := id / 32
  6643  	mask := uint32(1) << (id % 32)
  6644  	return (atomic.Load(&p[word]) & mask) != 0
  6645  }
  6646  
  6647  // set sets P id's bit.
  6648  func (p pMask) set(id int32) {
  6649  	word := id / 32
  6650  	mask := uint32(1) << (id % 32)
  6651  	atomic.Or(&p[word], mask)
  6652  }
  6653  
  6654  // clear clears P id's bit.
  6655  func (p pMask) clear(id int32) {
  6656  	word := id / 32
  6657  	mask := uint32(1) << (id % 32)
  6658  	atomic.And(&p[word], ^mask)
  6659  }
  6660  
  6661  // pidleput puts p on the _Pidle list. now must be a relatively recent call
  6662  // to nanotime or zero. Returns now or the current time if now was zero.
  6663  //
  6664  // This releases ownership of p. Once sched.lock is released it is no longer
  6665  // safe to use p.
  6666  //
  6667  // sched.lock must be held.
  6668  //
  6669  // May run during STW, so write barriers are not allowed.
  6670  //
  6671  //go:nowritebarrierrec
  6672  func pidleput(pp *p, now int64) int64 {
  6673  	assertLockHeld(&sched.lock)
  6674  
  6675  	if !runqempty(pp) {
  6676  		throw("pidleput: P has non-empty run queue")
  6677  	}
  6678  	if now == 0 {
  6679  		now = nanotime()
  6680  	}
  6681  	if pp.timers.len.Load() == 0 {
  6682  		timerpMask.clear(pp.id)
  6683  	}
  6684  	idlepMask.set(pp.id)
  6685  	pp.link = sched.pidle
  6686  	sched.pidle.set(pp)
  6687  	sched.npidle.Add(1)
  6688  	if !pp.limiterEvent.start(limiterEventIdle, now) {
  6689  		throw("must be able to track idle limiter event")
  6690  	}
  6691  	return now
  6692  }
  6693  
  6694  // pidleget tries to get a p from the _Pidle list, acquiring ownership.
  6695  //
  6696  // sched.lock must be held.
  6697  //
  6698  // May run during STW, so write barriers are not allowed.
  6699  //
  6700  //go:nowritebarrierrec
  6701  func pidleget(now int64) (*p, int64) {
  6702  	assertLockHeld(&sched.lock)
  6703  
  6704  	pp := sched.pidle.ptr()
  6705  	if pp != nil {
  6706  		// Timer may get added at any time now.
  6707  		if now == 0 {
  6708  			now = nanotime()
  6709  		}
  6710  		timerpMask.set(pp.id)
  6711  		idlepMask.clear(pp.id)
  6712  		sched.pidle = pp.link
  6713  		sched.npidle.Add(-1)
  6714  		pp.limiterEvent.stop(limiterEventIdle, now)
  6715  	}
  6716  	return pp, now
  6717  }
  6718  
  6719  // pidlegetSpinning tries to get a p from the _Pidle list, acquiring ownership.
  6720  // This is called by spinning Ms (or callers than need a spinning M) that have
  6721  // found work. If no P is available, this must synchronized with non-spinning
  6722  // Ms that may be preparing to drop their P without discovering this work.
  6723  //
  6724  // sched.lock must be held.
  6725  //
  6726  // May run during STW, so write barriers are not allowed.
  6727  //
  6728  //go:nowritebarrierrec
  6729  func pidlegetSpinning(now int64) (*p, int64) {
  6730  	assertLockHeld(&sched.lock)
  6731  
  6732  	pp, now := pidleget(now)
  6733  	if pp == nil {
  6734  		// See "Delicate dance" comment in findrunnable. We found work
  6735  		// that we cannot take, we must synchronize with non-spinning
  6736  		// Ms that may be preparing to drop their P.
  6737  		sched.needspinning.Store(1)
  6738  		return nil, now
  6739  	}
  6740  
  6741  	return pp, now
  6742  }
  6743  
  6744  // runqempty reports whether pp has no Gs on its local run queue.
  6745  // It never returns true spuriously.
  6746  func runqempty(pp *p) bool {
  6747  	// Defend against a race where 1) pp has G1 in runqnext but runqhead == runqtail,
  6748  	// 2) runqput on pp kicks G1 to the runq, 3) runqget on pp empties runqnext.
  6749  	// Simply observing that runqhead == runqtail and then observing that runqnext == nil
  6750  	// does not mean the queue is empty.
  6751  	for {
  6752  		head := atomic.Load(&pp.runqhead)
  6753  		tail := atomic.Load(&pp.runqtail)
  6754  		runnext := atomic.Loaduintptr((*uintptr)(unsafe.Pointer(&pp.runnext)))
  6755  		if tail == atomic.Load(&pp.runqtail) {
  6756  			return head == tail && runnext == 0
  6757  		}
  6758  	}
  6759  }
  6760  
  6761  // To shake out latent assumptions about scheduling order,
  6762  // we introduce some randomness into scheduling decisions
  6763  // when running with the race detector.
  6764  // The need for this was made obvious by changing the
  6765  // (deterministic) scheduling order in Go 1.5 and breaking
  6766  // many poorly-written tests.
  6767  // With the randomness here, as long as the tests pass
  6768  // consistently with -race, they shouldn't have latent scheduling
  6769  // assumptions.
  6770  const randomizeScheduler = raceenabled
  6771  
  6772  // runqput tries to put g on the local runnable queue.
  6773  // If next is false, runqput adds g to the tail of the runnable queue.
  6774  // If next is true, runqput puts g in the pp.runnext slot.
  6775  // If the run queue is full, runnext puts g on the global queue.
  6776  // Executed only by the owner P.
  6777  func runqput(pp *p, gp *g, next bool) {
  6778  	if !haveSysmon && next {
  6779  		// A runnext goroutine shares the same time slice as the
  6780  		// current goroutine (inheritTime from runqget). To prevent a
  6781  		// ping-pong pair of goroutines from starving all others, we
  6782  		// depend on sysmon to preempt "long-running goroutines". That
  6783  		// is, any set of goroutines sharing the same time slice.
  6784  		//
  6785  		// If there is no sysmon, we must avoid runnext entirely or
  6786  		// risk starvation.
  6787  		next = false
  6788  	}
  6789  	if randomizeScheduler && next && randn(2) == 0 {
  6790  		next = false
  6791  	}
  6792  
  6793  	if next {
  6794  	retryNext:
  6795  		oldnext := pp.runnext
  6796  		if !pp.runnext.cas(oldnext, guintptr(unsafe.Pointer(gp))) {
  6797  			goto retryNext
  6798  		}
  6799  		if oldnext == 0 {
  6800  			return
  6801  		}
  6802  		// Kick the old runnext out to the regular run queue.
  6803  		gp = oldnext.ptr()
  6804  	}
  6805  
  6806  retry:
  6807  	h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
  6808  	t := pp.runqtail
  6809  	if t-h < uint32(len(pp.runq)) {
  6810  		pp.runq[t%uint32(len(pp.runq))].set(gp)
  6811  		atomic.StoreRel(&pp.runqtail, t+1) // store-release, makes the item available for consumption
  6812  		return
  6813  	}
  6814  	if runqputslow(pp, gp, h, t) {
  6815  		return
  6816  	}
  6817  	// the queue is not full, now the put above must succeed
  6818  	goto retry
  6819  }
  6820  
  6821  // Put g and a batch of work from local runnable queue on global queue.
  6822  // Executed only by the owner P.
  6823  func runqputslow(pp *p, gp *g, h, t uint32) bool {
  6824  	var batch [len(pp.runq)/2 + 1]*g
  6825  
  6826  	// First, grab a batch from local queue.
  6827  	n := t - h
  6828  	n = n / 2
  6829  	if n != uint32(len(pp.runq)/2) {
  6830  		throw("runqputslow: queue is not full")
  6831  	}
  6832  	for i := uint32(0); i < n; i++ {
  6833  		batch[i] = pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
  6834  	}
  6835  	if !atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
  6836  		return false
  6837  	}
  6838  	batch[n] = gp
  6839  
  6840  	if randomizeScheduler {
  6841  		for i := uint32(1); i <= n; i++ {
  6842  			j := cheaprandn(i + 1)
  6843  			batch[i], batch[j] = batch[j], batch[i]
  6844  		}
  6845  	}
  6846  
  6847  	// Link the goroutines.
  6848  	for i := uint32(0); i < n; i++ {
  6849  		batch[i].schedlink.set(batch[i+1])
  6850  	}
  6851  	var q gQueue
  6852  	q.head.set(batch[0])
  6853  	q.tail.set(batch[n])
  6854  
  6855  	// Now put the batch on global queue.
  6856  	lock(&sched.lock)
  6857  	globrunqputbatch(&q, int32(n+1))
  6858  	unlock(&sched.lock)
  6859  	return true
  6860  }
  6861  
  6862  // runqputbatch tries to put all the G's on q on the local runnable queue.
  6863  // If the queue is full, they are put on the global queue; in that case
  6864  // this will temporarily acquire the scheduler lock.
  6865  // Executed only by the owner P.
  6866  func runqputbatch(pp *p, q *gQueue, qsize int) {
  6867  	h := atomic.LoadAcq(&pp.runqhead)
  6868  	t := pp.runqtail
  6869  	n := uint32(0)
  6870  	for !q.empty() && t-h < uint32(len(pp.runq)) {
  6871  		gp := q.pop()
  6872  		pp.runq[t%uint32(len(pp.runq))].set(gp)
  6873  		t++
  6874  		n++
  6875  	}
  6876  	qsize -= int(n)
  6877  
  6878  	if randomizeScheduler {
  6879  		off := func(o uint32) uint32 {
  6880  			return (pp.runqtail + o) % uint32(len(pp.runq))
  6881  		}
  6882  		for i := uint32(1); i < n; i++ {
  6883  			j := cheaprandn(i + 1)
  6884  			pp.runq[off(i)], pp.runq[off(j)] = pp.runq[off(j)], pp.runq[off(i)]
  6885  		}
  6886  	}
  6887  
  6888  	atomic.StoreRel(&pp.runqtail, t)
  6889  	if !q.empty() {
  6890  		lock(&sched.lock)
  6891  		globrunqputbatch(q, int32(qsize))
  6892  		unlock(&sched.lock)
  6893  	}
  6894  }
  6895  
  6896  // Get g from local runnable queue.
  6897  // If inheritTime is true, gp should inherit the remaining time in the
  6898  // current time slice. Otherwise, it should start a new time slice.
  6899  // Executed only by the owner P.
  6900  func runqget(pp *p) (gp *g, inheritTime bool) {
  6901  	// If there's a runnext, it's the next G to run.
  6902  	next := pp.runnext
  6903  	// If the runnext is non-0 and the CAS fails, it could only have been stolen by another P,
  6904  	// because other Ps can race to set runnext to 0, but only the current P can set it to non-0.
  6905  	// Hence, there's no need to retry this CAS if it fails.
  6906  	if next != 0 && pp.runnext.cas(next, 0) {
  6907  		return next.ptr(), true
  6908  	}
  6909  
  6910  	for {
  6911  		h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
  6912  		t := pp.runqtail
  6913  		if t == h {
  6914  			return nil, false
  6915  		}
  6916  		gp := pp.runq[h%uint32(len(pp.runq))].ptr()
  6917  		if atomic.CasRel(&pp.runqhead, h, h+1) { // cas-release, commits consume
  6918  			return gp, false
  6919  		}
  6920  	}
  6921  }
  6922  
  6923  // runqdrain drains the local runnable queue of pp and returns all goroutines in it.
  6924  // Executed only by the owner P.
  6925  func runqdrain(pp *p) (drainQ gQueue, n uint32) {
  6926  	oldNext := pp.runnext
  6927  	if oldNext != 0 && pp.runnext.cas(oldNext, 0) {
  6928  		drainQ.pushBack(oldNext.ptr())
  6929  		n++
  6930  	}
  6931  
  6932  retry:
  6933  	h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
  6934  	t := pp.runqtail
  6935  	qn := t - h
  6936  	if qn == 0 {
  6937  		return
  6938  	}
  6939  	if qn > uint32(len(pp.runq)) { // read inconsistent h and t
  6940  		goto retry
  6941  	}
  6942  
  6943  	if !atomic.CasRel(&pp.runqhead, h, h+qn) { // cas-release, commits consume
  6944  		goto retry
  6945  	}
  6946  
  6947  	// We've inverted the order in which it gets G's from the local P's runnable queue
  6948  	// and then advances the head pointer because we don't want to mess up the statuses of G's
  6949  	// while runqdrain() and runqsteal() are running in parallel.
  6950  	// Thus we should advance the head pointer before draining the local P into a gQueue,
  6951  	// so that we can update any gp.schedlink only after we take the full ownership of G,
  6952  	// meanwhile, other P's can't access to all G's in local P's runnable queue and steal them.
  6953  	// See https://groups.google.com/g/golang-dev/c/0pTKxEKhHSc/m/6Q85QjdVBQAJ for more details.
  6954  	for i := uint32(0); i < qn; i++ {
  6955  		gp := pp.runq[(h+i)%uint32(len(pp.runq))].ptr()
  6956  		drainQ.pushBack(gp)
  6957  		n++
  6958  	}
  6959  	return
  6960  }
  6961  
  6962  // Grabs a batch of goroutines from pp's runnable queue into batch.
  6963  // Batch is a ring buffer starting at batchHead.
  6964  // Returns number of grabbed goroutines.
  6965  // Can be executed by any P.
  6966  func runqgrab(pp *p, batch *[256]guintptr, batchHead uint32, stealRunNextG bool) uint32 {
  6967  	for {
  6968  		h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with other consumers
  6969  		t := atomic.LoadAcq(&pp.runqtail) // load-acquire, synchronize with the producer
  6970  		n := t - h
  6971  		n = n - n/2
  6972  		if n == 0 {
  6973  			if stealRunNextG {
  6974  				// Try to steal from pp.runnext.
  6975  				if next := pp.runnext; next != 0 {
  6976  					if pp.status == _Prunning {
  6977  						// Sleep to ensure that pp isn't about to run the g
  6978  						// we are about to steal.
  6979  						// The important use case here is when the g running
  6980  						// on pp ready()s another g and then almost
  6981  						// immediately blocks. Instead of stealing runnext
  6982  						// in this window, back off to give pp a chance to
  6983  						// schedule runnext. This will avoid thrashing gs
  6984  						// between different Ps.
  6985  						// A sync chan send/recv takes ~50ns as of time of
  6986  						// writing, so 3us gives ~50x overshoot.
  6987  						if !osHasLowResTimer {
  6988  							usleep(3)
  6989  						} else {
  6990  							// On some platforms system timer granularity is
  6991  							// 1-15ms, which is way too much for this
  6992  							// optimization. So just yield.
  6993  							osyield()
  6994  						}
  6995  					}
  6996  					if !pp.runnext.cas(next, 0) {
  6997  						continue
  6998  					}
  6999  					batch[batchHead%uint32(len(batch))] = next
  7000  					return 1
  7001  				}
  7002  			}
  7003  			return 0
  7004  		}
  7005  		if n > uint32(len(pp.runq)/2) { // read inconsistent h and t
  7006  			continue
  7007  		}
  7008  		for i := uint32(0); i < n; i++ {
  7009  			g := pp.runq[(h+i)%uint32(len(pp.runq))]
  7010  			batch[(batchHead+i)%uint32(len(batch))] = g
  7011  		}
  7012  		if atomic.CasRel(&pp.runqhead, h, h+n) { // cas-release, commits consume
  7013  			return n
  7014  		}
  7015  	}
  7016  }
  7017  
  7018  // Steal half of elements from local runnable queue of p2
  7019  // and put onto local runnable queue of p.
  7020  // Returns one of the stolen elements (or nil if failed).
  7021  func runqsteal(pp, p2 *p, stealRunNextG bool) *g {
  7022  	t := pp.runqtail
  7023  	n := runqgrab(p2, &pp.runq, t, stealRunNextG)
  7024  	if n == 0 {
  7025  		return nil
  7026  	}
  7027  	n--
  7028  	gp := pp.runq[(t+n)%uint32(len(pp.runq))].ptr()
  7029  	if n == 0 {
  7030  		return gp
  7031  	}
  7032  	h := atomic.LoadAcq(&pp.runqhead) // load-acquire, synchronize with consumers
  7033  	if t-h+n >= uint32(len(pp.runq)) {
  7034  		throw("runqsteal: runq overflow")
  7035  	}
  7036  	atomic.StoreRel(&pp.runqtail, t+n) // store-release, makes the item available for consumption
  7037  	return gp
  7038  }
  7039  
  7040  // A gQueue is a dequeue of Gs linked through g.schedlink. A G can only
  7041  // be on one gQueue or gList at a time.
  7042  type gQueue struct {
  7043  	head guintptr
  7044  	tail guintptr
  7045  }
  7046  
  7047  // empty reports whether q is empty.
  7048  func (q *gQueue) empty() bool {
  7049  	return q.head == 0
  7050  }
  7051  
  7052  // push adds gp to the head of q.
  7053  func (q *gQueue) push(gp *g) {
  7054  	gp.schedlink = q.head
  7055  	q.head.set(gp)
  7056  	if q.tail == 0 {
  7057  		q.tail.set(gp)
  7058  	}
  7059  }
  7060  
  7061  // pushBack adds gp to the tail of q.
  7062  func (q *gQueue) pushBack(gp *g) {
  7063  	gp.schedlink = 0
  7064  	if q.tail != 0 {
  7065  		q.tail.ptr().schedlink.set(gp)
  7066  	} else {
  7067  		q.head.set(gp)
  7068  	}
  7069  	q.tail.set(gp)
  7070  }
  7071  
  7072  // pushBackAll adds all Gs in q2 to the tail of q. After this q2 must
  7073  // not be used.
  7074  func (q *gQueue) pushBackAll(q2 gQueue) {
  7075  	if q2.tail == 0 {
  7076  		return
  7077  	}
  7078  	q2.tail.ptr().schedlink = 0
  7079  	if q.tail != 0 {
  7080  		q.tail.ptr().schedlink = q2.head
  7081  	} else {
  7082  		q.head = q2.head
  7083  	}
  7084  	q.tail = q2.tail
  7085  }
  7086  
  7087  // pop removes and returns the head of queue q. It returns nil if
  7088  // q is empty.
  7089  func (q *gQueue) pop() *g {
  7090  	gp := q.head.ptr()
  7091  	if gp != nil {
  7092  		q.head = gp.schedlink
  7093  		if q.head == 0 {
  7094  			q.tail = 0
  7095  		}
  7096  	}
  7097  	return gp
  7098  }
  7099  
  7100  // popList takes all Gs in q and returns them as a gList.
  7101  func (q *gQueue) popList() gList {
  7102  	stack := gList{q.head}
  7103  	*q = gQueue{}
  7104  	return stack
  7105  }
  7106  
  7107  // A gList is a list of Gs linked through g.schedlink. A G can only be
  7108  // on one gQueue or gList at a time.
  7109  type gList struct {
  7110  	head guintptr
  7111  }
  7112  
  7113  // empty reports whether l is empty.
  7114  func (l *gList) empty() bool {
  7115  	return l.head == 0
  7116  }
  7117  
  7118  // push adds gp to the head of l.
  7119  func (l *gList) push(gp *g) {
  7120  	gp.schedlink = l.head
  7121  	l.head.set(gp)
  7122  }
  7123  
  7124  // pushAll prepends all Gs in q to l.
  7125  func (l *gList) pushAll(q gQueue) {
  7126  	if !q.empty() {
  7127  		q.tail.ptr().schedlink = l.head
  7128  		l.head = q.head
  7129  	}
  7130  }
  7131  
  7132  // pop removes and returns the head of l. If l is empty, it returns nil.
  7133  func (l *gList) pop() *g {
  7134  	gp := l.head.ptr()
  7135  	if gp != nil {
  7136  		l.head = gp.schedlink
  7137  	}
  7138  	return gp
  7139  }
  7140  
  7141  //go:linkname setMaxThreads runtime/debug.setMaxThreads
  7142  func setMaxThreads(in int) (out int) {
  7143  	lock(&sched.lock)
  7144  	out = int(sched.maxmcount)
  7145  	if in > 0x7fffffff { // MaxInt32
  7146  		sched.maxmcount = 0x7fffffff
  7147  	} else {
  7148  		sched.maxmcount = int32(in)
  7149  	}
  7150  	checkmcount()
  7151  	unlock(&sched.lock)
  7152  	return
  7153  }
  7154  
  7155  // procPin should be an internal detail,
  7156  // but widely used packages access it using linkname.
  7157  // Notable members of the hall of shame include:
  7158  //   - github.com/bytedance/gopkg
  7159  //   - github.com/choleraehyq/pid
  7160  //   - github.com/songzhibin97/gkit
  7161  //
  7162  // Do not remove or change the type signature.
  7163  // See go.dev/issue/67401.
  7164  //
  7165  //go:linkname procPin
  7166  //go:nosplit
  7167  func procPin() int {
  7168  	gp := getg()
  7169  	mp := gp.m
  7170  
  7171  	mp.locks++
  7172  	return int(mp.p.ptr().id)
  7173  }
  7174  
  7175  // procUnpin should be an internal detail,
  7176  // but widely used packages access it using linkname.
  7177  // Notable members of the hall of shame include:
  7178  //   - github.com/bytedance/gopkg
  7179  //   - github.com/choleraehyq/pid
  7180  //   - github.com/songzhibin97/gkit
  7181  //
  7182  // Do not remove or change the type signature.
  7183  // See go.dev/issue/67401.
  7184  //
  7185  //go:linkname procUnpin
  7186  //go:nosplit
  7187  func procUnpin() {
  7188  	gp := getg()
  7189  	gp.m.locks--
  7190  }
  7191  
  7192  //go:linkname sync_runtime_procPin sync.runtime_procPin
  7193  //go:nosplit
  7194  func sync_runtime_procPin() int {
  7195  	return procPin()
  7196  }
  7197  
  7198  //go:linkname sync_runtime_procUnpin sync.runtime_procUnpin
  7199  //go:nosplit
  7200  func sync_runtime_procUnpin() {
  7201  	procUnpin()
  7202  }
  7203  
  7204  //go:linkname sync_atomic_runtime_procPin sync/atomic.runtime_procPin
  7205  //go:nosplit
  7206  func sync_atomic_runtime_procPin() int {
  7207  	return procPin()
  7208  }
  7209  
  7210  //go:linkname sync_atomic_runtime_procUnpin sync/atomic.runtime_procUnpin
  7211  //go:nosplit
  7212  func sync_atomic_runtime_procUnpin() {
  7213  	procUnpin()
  7214  }
  7215  
  7216  // Active spinning for sync.Mutex.
  7217  //
  7218  //go:linkname internal_sync_runtime_canSpin internal/sync.runtime_canSpin
  7219  //go:nosplit
  7220  func internal_sync_runtime_canSpin(i int) bool {
  7221  	// sync.Mutex is cooperative, so we are conservative with spinning.
  7222  	// Spin only few times and only if running on a multicore machine and
  7223  	// GOMAXPROCS>1 and there is at least one other running P and local runq is empty.
  7224  	// As opposed to runtime mutex we don't do passive spinning here,
  7225  	// because there can be work on global runq or on other Ps.
  7226  	if i >= active_spin || ncpu <= 1 || gomaxprocs <= sched.npidle.Load()+sched.nmspinning.Load()+1 {
  7227  		return false
  7228  	}
  7229  	if p := getg().m.p.ptr(); !runqempty(p) {
  7230  		return false
  7231  	}
  7232  	return true
  7233  }
  7234  
  7235  //go:linkname internal_sync_runtime_doSpin internal/sync.runtime_doSpin
  7236  //go:nosplit
  7237  func internal_sync_runtime_doSpin() {
  7238  	procyield(active_spin_cnt)
  7239  }
  7240  
  7241  // Active spinning for sync.Mutex.
  7242  //
  7243  // sync_runtime_canSpin should be an internal detail,
  7244  // but widely used packages access it using linkname.
  7245  // Notable members of the hall of shame include:
  7246  //   - github.com/livekit/protocol
  7247  //   - github.com/sagernet/gvisor
  7248  //   - gvisor.dev/gvisor
  7249  //
  7250  // Do not remove or change the type signature.
  7251  // See go.dev/issue/67401.
  7252  //
  7253  //go:linkname sync_runtime_canSpin sync.runtime_canSpin
  7254  //go:nosplit
  7255  func sync_runtime_canSpin(i int) bool {
  7256  	return internal_sync_runtime_canSpin(i)
  7257  }
  7258  
  7259  // sync_runtime_doSpin should be an internal detail,
  7260  // but widely used packages access it using linkname.
  7261  // Notable members of the hall of shame include:
  7262  //   - github.com/livekit/protocol
  7263  //   - github.com/sagernet/gvisor
  7264  //   - gvisor.dev/gvisor
  7265  //
  7266  // Do not remove or change the type signature.
  7267  // See go.dev/issue/67401.
  7268  //
  7269  //go:linkname sync_runtime_doSpin sync.runtime_doSpin
  7270  //go:nosplit
  7271  func sync_runtime_doSpin() {
  7272  	internal_sync_runtime_doSpin()
  7273  }
  7274  
  7275  var stealOrder randomOrder
  7276  
  7277  // randomOrder/randomEnum are helper types for randomized work stealing.
  7278  // They allow to enumerate all Ps in different pseudo-random orders without repetitions.
  7279  // The algorithm is based on the fact that if we have X such that X and GOMAXPROCS
  7280  // are coprime, then a sequences of (i + X) % GOMAXPROCS gives the required enumeration.
  7281  type randomOrder struct {
  7282  	count    uint32
  7283  	coprimes []uint32
  7284  }
  7285  
  7286  type randomEnum struct {
  7287  	i     uint32
  7288  	count uint32
  7289  	pos   uint32
  7290  	inc   uint32
  7291  }
  7292  
  7293  func (ord *randomOrder) reset(count uint32) {
  7294  	ord.count = count
  7295  	ord.coprimes = ord.coprimes[:0]
  7296  	for i := uint32(1); i <= count; i++ {
  7297  		if gcd(i, count) == 1 {
  7298  			ord.coprimes = append(ord.coprimes, i)
  7299  		}
  7300  	}
  7301  }
  7302  
  7303  func (ord *randomOrder) start(i uint32) randomEnum {
  7304  	return randomEnum{
  7305  		count: ord.count,
  7306  		pos:   i % ord.count,
  7307  		inc:   ord.coprimes[i/ord.count%uint32(len(ord.coprimes))],
  7308  	}
  7309  }
  7310  
  7311  func (enum *randomEnum) done() bool {
  7312  	return enum.i == enum.count
  7313  }
  7314  
  7315  func (enum *randomEnum) next() {
  7316  	enum.i++
  7317  	enum.pos = (enum.pos + enum.inc) % enum.count
  7318  }
  7319  
  7320  func (enum *randomEnum) position() uint32 {
  7321  	return enum.pos
  7322  }
  7323  
  7324  func gcd(a, b uint32) uint32 {
  7325  	for b != 0 {
  7326  		a, b = b, a%b
  7327  	}
  7328  	return a
  7329  }
  7330  
  7331  // An initTask represents the set of initializations that need to be done for a package.
  7332  // Keep in sync with ../../test/noinit.go:initTask
  7333  type initTask struct {
  7334  	state uint32 // 0 = uninitialized, 1 = in progress, 2 = done
  7335  	nfns  uint32
  7336  	// followed by nfns pcs, uintptr sized, one per init function to run
  7337  }
  7338  
  7339  // inittrace stores statistics for init functions which are
  7340  // updated by malloc and newproc when active is true.
  7341  var inittrace tracestat
  7342  
  7343  type tracestat struct {
  7344  	active bool   // init tracing activation status
  7345  	id     uint64 // init goroutine id
  7346  	allocs uint64 // heap allocations
  7347  	bytes  uint64 // heap allocated bytes
  7348  }
  7349  
  7350  func doInit(ts []*initTask) {
  7351  	for _, t := range ts {
  7352  		doInit1(t)
  7353  	}
  7354  }
  7355  
  7356  func doInit1(t *initTask) {
  7357  	switch t.state {
  7358  	case 2: // fully initialized
  7359  		return
  7360  	case 1: // initialization in progress
  7361  		throw("recursive call during initialization - linker skew")
  7362  	default: // not initialized yet
  7363  		t.state = 1 // initialization in progress
  7364  
  7365  		var (
  7366  			start  int64
  7367  			before tracestat
  7368  		)
  7369  
  7370  		if inittrace.active {
  7371  			start = nanotime()
  7372  			// Load stats non-atomically since tracinit is updated only by this init goroutine.
  7373  			before = inittrace
  7374  		}
  7375  
  7376  		if t.nfns == 0 {
  7377  			// We should have pruned all of these in the linker.
  7378  			throw("inittask with no functions")
  7379  		}
  7380  
  7381  		firstFunc := add(unsafe.Pointer(t), 8)
  7382  		for i := uint32(0); i < t.nfns; i++ {
  7383  			p := add(firstFunc, uintptr(i)*goarch.PtrSize)
  7384  			f := *(*func())(unsafe.Pointer(&p))
  7385  			f()
  7386  		}
  7387  
  7388  		if inittrace.active {
  7389  			end := nanotime()
  7390  			// Load stats non-atomically since tracinit is updated only by this init goroutine.
  7391  			after := inittrace
  7392  
  7393  			f := *(*func())(unsafe.Pointer(&firstFunc))
  7394  			pkg := funcpkgpath(findfunc(abi.FuncPCABIInternal(f)))
  7395  
  7396  			var sbuf [24]byte
  7397  			print("init ", pkg, " @")
  7398  			print(string(fmtNSAsMS(sbuf[:], uint64(start-runtimeInitTime))), " ms, ")
  7399  			print(string(fmtNSAsMS(sbuf[:], uint64(end-start))), " ms clock, ")
  7400  			print(string(itoa(sbuf[:], after.bytes-before.bytes)), " bytes, ")
  7401  			print(string(itoa(sbuf[:], after.allocs-before.allocs)), " allocs")
  7402  			print("\n")
  7403  		}
  7404  
  7405  		t.state = 2 // initialization done
  7406  	}
  7407  }
  7408