Source file src/runtime/mgcmark.go

     1  // Copyright 2009 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  // Garbage collector: marking and scanning
     6  
     7  package runtime
     8  
     9  import (
    10  	"internal/abi"
    11  	"internal/goarch"
    12  	"internal/goexperiment"
    13  	"internal/runtime/atomic"
    14  	"internal/runtime/sys"
    15  	"unsafe"
    16  )
    17  
    18  const (
    19  	fixedRootFinalizers = iota
    20  	fixedRootFreeGStacks
    21  	fixedRootCleanups
    22  	fixedRootCount
    23  
    24  	// rootBlockBytes is the number of bytes to scan per data or
    25  	// BSS root.
    26  	rootBlockBytes = 256 << 10
    27  
    28  	// maxObletBytes is the maximum bytes of an object to scan at
    29  	// once. Larger objects will be split up into "oblets" of at
    30  	// most this size. Since we can scan 1–2 MB/ms, 128 KB bounds
    31  	// scan preemption at ~100 µs.
    32  	//
    33  	// This must be > _MaxSmallSize so that the object base is the
    34  	// span base.
    35  	maxObletBytes = 128 << 10
    36  
    37  	// drainCheckThreshold specifies how many units of work to do
    38  	// between self-preemption checks in gcDrain. Assuming a scan
    39  	// rate of 1 MB/ms, this is ~100 µs. Lower values have higher
    40  	// overhead in the scan loop (the scheduler check may perform
    41  	// a syscall, so its overhead is nontrivial). Higher values
    42  	// make the system less responsive to incoming work.
    43  	drainCheckThreshold = 100000
    44  
    45  	// pagesPerSpanRoot indicates how many pages to scan from a span root
    46  	// at a time. Used by special root marking.
    47  	//
    48  	// Higher values improve throughput by increasing locality, but
    49  	// increase the minimum latency of a marking operation.
    50  	//
    51  	// Must be a multiple of the pageInUse bitmap element size and
    52  	// must also evenly divide pagesPerArena.
    53  	pagesPerSpanRoot = min(512, pagesPerArena)
    54  )
    55  
    56  // internalBlocked returns true if the goroutine is blocked due to an
    57  // internal (non-leaking) waitReason, e.g. waiting for the netpoller or garbage collector.
    58  // Such goroutines are never leak detection candidates according to the GC.
    59  //
    60  //go:nosplit
    61  func (gp *g) internalBlocked() bool {
    62  	reason := gp.waitreason
    63  	return reason < waitReasonChanReceiveNilChan || waitReasonSyncWaitGroupWait < reason
    64  }
    65  
    66  // allGsSnapshotSortedForGC takes a snapshot of allgs and returns a sorted
    67  // array of Gs. The array is sorted by the G's status, with running Gs
    68  // first, followed by blocked Gs. The returned index indicates the cutoff
    69  // between runnable and blocked Gs.
    70  //
    71  // The world must be stopped or allglock must be held.
    72  func allGsSnapshotSortedForGC() ([]*g, int) {
    73  	assertWorldStoppedOrLockHeld(&allglock)
    74  
    75  	// Reset the status of leaked goroutines in order to improve
    76  	// the precision of goroutine leak detection.
    77  	for _, gp := range allgs {
    78  		gp.atomicstatus.CompareAndSwap(_Gleaked, _Gwaiting)
    79  	}
    80  
    81  	allgsSorted := make([]*g, len(allgs))
    82  
    83  	// Indices cutting off runnable and blocked Gs.
    84  	var currIndex, blockedIndex = 0, len(allgsSorted) - 1
    85  	for _, gp := range allgs {
    86  		// not sure if we need atomic load because we are stopping the world,
    87  		// but do it just to be safe for now
    88  		if status := readgstatus(gp); status != _Gwaiting || gp.internalBlocked() {
    89  			allgsSorted[currIndex] = gp
    90  			currIndex++
    91  		} else {
    92  			allgsSorted[blockedIndex] = gp
    93  			blockedIndex--
    94  		}
    95  	}
    96  
    97  	// Because the world is stopped or allglock is held, allgadd
    98  	// cannot happen concurrently with this. allgs grows
    99  	// monotonically and existing entries never change, so we can
   100  	// simply return a copy of the slice header. For added safety,
   101  	// we trim everything past len because that can still change.
   102  	return allgsSorted, blockedIndex + 1
   103  }
   104  
   105  // gcPrepareMarkRoots queues root scanning jobs (stacks, globals, and
   106  // some miscellany) and initializes scanning-related state.
   107  //
   108  // The world must be stopped.
   109  func gcPrepareMarkRoots() {
   110  	assertWorldStopped()
   111  
   112  	// Compute how many data and BSS root blocks there are.
   113  	nBlocks := func(bytes uintptr) int {
   114  		return int(divRoundUp(bytes, rootBlockBytes))
   115  	}
   116  
   117  	work.nDataRoots = 0
   118  	work.nBSSRoots = 0
   119  
   120  	// Scan globals.
   121  	for _, datap := range activeModules() {
   122  		nDataRoots := nBlocks(datap.edata - datap.data)
   123  		if nDataRoots > work.nDataRoots {
   124  			work.nDataRoots = nDataRoots
   125  		}
   126  
   127  		nBSSRoots := nBlocks(datap.ebss - datap.bss)
   128  		if nBSSRoots > work.nBSSRoots {
   129  			work.nBSSRoots = nBSSRoots
   130  		}
   131  	}
   132  
   133  	// Scan span roots for finalizer specials.
   134  	//
   135  	// We depend on addfinalizer to mark objects that get
   136  	// finalizers after root marking.
   137  	//
   138  	// We're going to scan the whole heap (that was available at the time the
   139  	// mark phase started, i.e. markArenas) for in-use spans which have specials.
   140  	//
   141  	// Break up the work into arenas, and further into chunks.
   142  	//
   143  	// Snapshot heapArenas as markArenas. This snapshot is safe because heapArenas
   144  	// is append-only.
   145  	mheap_.markArenas = mheap_.heapArenas[:len(mheap_.heapArenas):len(mheap_.heapArenas)]
   146  	work.nSpanRoots = len(mheap_.markArenas) * (pagesPerArena / pagesPerSpanRoot)
   147  
   148  	// Scan stacks.
   149  	//
   150  	// Gs may be created after this point, but it's okay that we
   151  	// ignore them because they begin life without any roots, so
   152  	// there's nothing to scan, and any roots they create during
   153  	// the concurrent phase will be caught by the write barrier.
   154  	if work.goroutineLeak.enabled {
   155  		// goroutine leak finder GC --- only prepare runnable
   156  		// goroutines for marking.
   157  		work.stackRoots, work.nMaybeRunnableStackRoots = allGsSnapshotSortedForGC()
   158  	} else {
   159  		// regular GC --- scan every goroutine
   160  		work.stackRoots = allGsSnapshot()
   161  		work.nMaybeRunnableStackRoots = len(work.stackRoots)
   162  	}
   163  
   164  	work.nStackRoots = len(work.stackRoots)
   165  
   166  	work.markrootNext.Store(0)
   167  	work.markrootJobs.Store(uint32(fixedRootCount + work.nDataRoots + work.nBSSRoots + work.nSpanRoots + work.nMaybeRunnableStackRoots))
   168  
   169  	// Calculate base indexes of each root type
   170  	work.baseData = uint32(fixedRootCount)
   171  	work.baseBSS = work.baseData + uint32(work.nDataRoots)
   172  	work.baseSpans = work.baseBSS + uint32(work.nBSSRoots)
   173  	work.baseStacks = work.baseSpans + uint32(work.nSpanRoots)
   174  	work.baseEnd = work.baseStacks + uint32(work.nStackRoots)
   175  }
   176  
   177  // gcMarkRootCheck checks that all roots have been scanned. It is
   178  // purely for debugging.
   179  func gcMarkRootCheck() {
   180  	if next, jobs := work.markrootNext.Load(), work.markrootJobs.Load(); next < jobs {
   181  		print(next, " of ", jobs, " markroot jobs done\n")
   182  		throw("left over markroot jobs")
   183  	}
   184  
   185  	// Check that stacks have been scanned.
   186  	//
   187  	// We only check the first nStackRoots Gs that we should have scanned.
   188  	// Since we don't care about newer Gs (see comment in
   189  	// gcPrepareMarkRoots), no locking is required.
   190  	i := 0
   191  	forEachGRace(func(gp *g) {
   192  		if i >= work.nStackRoots {
   193  			return
   194  		}
   195  
   196  		if !gp.gcscandone {
   197  			println("gp", gp, "goid", gp.goid,
   198  				"status", readgstatus(gp),
   199  				"gcscandone", gp.gcscandone)
   200  			throw("scan missed a g")
   201  		}
   202  
   203  		i++
   204  	})
   205  }
   206  
   207  // oneptrmask for an allocation containing a single pointer.
   208  var oneptrmask = [...]uint8{1}
   209  
   210  // markroot scans the i'th root.
   211  //
   212  // Preemption must be disabled (because this uses a gcWork).
   213  //
   214  // Returns the amount of GC work credit produced by the operation.
   215  // If flushBgCredit is true, then that credit is also flushed
   216  // to the background credit pool.
   217  //
   218  // nowritebarrier is only advisory here.
   219  //
   220  //go:nowritebarrier
   221  func markroot(gcw *gcWork, i uint32, flushBgCredit bool) int64 {
   222  	// Note: if you add a case here, please also update heapdump.go:dumproots.
   223  	var workDone int64
   224  	var workCounter *atomic.Int64
   225  	switch {
   226  	case work.baseData <= i && i < work.baseBSS:
   227  		workCounter = &gcController.globalsScanWork
   228  		for _, datap := range activeModules() {
   229  			workDone += markrootBlock(datap.data, datap.edata-datap.data, datap.gcdatamask.bytedata, gcw, int(i-work.baseData))
   230  		}
   231  
   232  	case work.baseBSS <= i && i < work.baseSpans:
   233  		workCounter = &gcController.globalsScanWork
   234  		for _, datap := range activeModules() {
   235  			workDone += markrootBlock(datap.bss, datap.ebss-datap.bss, datap.gcbssmask.bytedata, gcw, int(i-work.baseBSS))
   236  		}
   237  
   238  	case i == fixedRootFinalizers:
   239  		for fb := allfin; fb != nil; fb = fb.alllink {
   240  			cnt := uintptr(atomic.Load(&fb.cnt))
   241  			scanblock(uintptr(unsafe.Pointer(&fb.fin[0])), cnt*unsafe.Sizeof(fb.fin[0]), &finptrmask[0], gcw, nil)
   242  		}
   243  
   244  	case i == fixedRootFreeGStacks:
   245  		// Switch to the system stack so we can call
   246  		// stackfree.
   247  		systemstack(markrootFreeGStacks)
   248  
   249  	case i == fixedRootCleanups:
   250  		for cb := (*cleanupBlock)(gcCleanups.all.Load()); cb != nil; cb = cb.alllink {
   251  			// N.B. This only needs to synchronize with cleanup execution, which only resets these blocks.
   252  			// All cleanup queueing happens during sweep.
   253  			n := uintptr(atomic.Load(&cb.n))
   254  			scanblock(uintptr(unsafe.Pointer(&cb.cleanups[0])), n*unsafe.Sizeof(cleanupFn{}), &cleanupBlockPtrMask[0], gcw, nil)
   255  		}
   256  
   257  	case work.baseSpans <= i && i < work.baseStacks:
   258  		// mark mspan.specials
   259  		markrootSpans(gcw, int(i-work.baseSpans))
   260  
   261  	default:
   262  		// the rest is scanning goroutine stacks
   263  		workCounter = &gcController.stackScanWork
   264  		if i < work.baseStacks || work.baseEnd <= i {
   265  			printlock()
   266  			print("runtime: markroot index ", i, " not in stack roots range [", work.baseStacks, ", ", work.baseEnd, ")\n")
   267  			throw("markroot: bad index")
   268  		}
   269  		gp := work.stackRoots[i-work.baseStacks]
   270  
   271  		// remember when we've first observed the G blocked
   272  		// needed only to output in traceback
   273  		status := readgstatus(gp) // We are not in a scan state
   274  		if (status == _Gwaiting || status == _Gsyscall) && gp.waitsince == 0 {
   275  			gp.waitsince = work.tstart
   276  		}
   277  
   278  		// scanstack must be done on the system stack in case
   279  		// we're trying to scan our own stack.
   280  		systemstack(func() {
   281  			// If this is a self-scan, put the user G in
   282  			// _Gwaiting to prevent self-deadlock. It may
   283  			// already be in _Gwaiting if this is a mark
   284  			// worker or we're in mark termination.
   285  			userG := getg().m.curg
   286  			selfScan := gp == userG && readgstatus(userG) == _Grunning
   287  			if selfScan {
   288  				casGToWaitingForSuspendG(userG, _Grunning, waitReasonGarbageCollectionScan)
   289  			}
   290  
   291  			// TODO: suspendG blocks (and spins) until gp
   292  			// stops, which may take a while for
   293  			// running goroutines. Consider doing this in
   294  			// two phases where the first is non-blocking:
   295  			// we scan the stacks we can and ask running
   296  			// goroutines to scan themselves; and the
   297  			// second blocks.
   298  			stopped := suspendG(gp)
   299  			if stopped.dead {
   300  				gp.gcscandone = true
   301  				return
   302  			}
   303  			if gp.gcscandone {
   304  				throw("g already scanned")
   305  			}
   306  			workDone += scanstack(gp, gcw)
   307  			gp.gcscandone = true
   308  			resumeG(stopped)
   309  
   310  			if selfScan {
   311  				casgstatus(userG, _Gwaiting, _Grunning)
   312  			}
   313  		})
   314  	}
   315  	if workCounter != nil && workDone != 0 {
   316  		workCounter.Add(workDone)
   317  		if flushBgCredit {
   318  			gcFlushBgCredit(workDone)
   319  		}
   320  	}
   321  	return workDone
   322  }
   323  
   324  // markrootBlock scans the shard'th shard of the block of memory [b0,
   325  // b0+n0), with the given pointer mask.
   326  //
   327  // Returns the amount of work done.
   328  //
   329  //go:nowritebarrier
   330  func markrootBlock(b0, n0 uintptr, ptrmask0 *uint8, gcw *gcWork, shard int) int64 {
   331  	if rootBlockBytes%(8*goarch.PtrSize) != 0 {
   332  		// This is necessary to pick byte offsets in ptrmask0.
   333  		throw("rootBlockBytes must be a multiple of 8*ptrSize")
   334  	}
   335  
   336  	// Note that if b0 is toward the end of the address space,
   337  	// then b0 + rootBlockBytes might wrap around.
   338  	// These tests are written to avoid any possible overflow.
   339  	off := uintptr(shard) * rootBlockBytes
   340  	if off >= n0 {
   341  		return 0
   342  	}
   343  	b := b0 + off
   344  	ptrmask := (*uint8)(add(unsafe.Pointer(ptrmask0), uintptr(shard)*(rootBlockBytes/(8*goarch.PtrSize))))
   345  	n := uintptr(rootBlockBytes)
   346  	if off+n > n0 {
   347  		n = n0 - off
   348  	}
   349  
   350  	// Scan this shard.
   351  	scanblock(b, n, ptrmask, gcw, nil)
   352  	return int64(n)
   353  }
   354  
   355  // markrootFreeGStacks frees stacks of dead Gs.
   356  //
   357  // This does not free stacks of dead Gs cached on Ps, but having a few
   358  // cached stacks around isn't a problem.
   359  func markrootFreeGStacks() {
   360  	// Take list of dead Gs with stacks.
   361  	lock(&sched.gFree.lock)
   362  	list := sched.gFree.stack
   363  	sched.gFree.stack = gList{}
   364  	unlock(&sched.gFree.lock)
   365  	if list.empty() {
   366  		return
   367  	}
   368  
   369  	// Free stacks.
   370  	var tail *g
   371  	for gp := list.head.ptr(); gp != nil; gp = gp.schedlink.ptr() {
   372  		tail = gp
   373  		stackfree(gp.stack)
   374  		gp.stack.lo = 0
   375  		gp.stack.hi = 0
   376  		if valgrindenabled {
   377  			valgrindDeregisterStack(gp.valgrindStackID)
   378  			gp.valgrindStackID = 0
   379  		}
   380  	}
   381  
   382  	q := gQueue{list.head, tail.guintptr(), list.size}
   383  
   384  	// Put Gs back on the free list.
   385  	lock(&sched.gFree.lock)
   386  	sched.gFree.noStack.pushAll(q)
   387  	unlock(&sched.gFree.lock)
   388  }
   389  
   390  // markrootSpans marks roots for one shard of markArenas.
   391  //
   392  //go:nowritebarrier
   393  func markrootSpans(gcw *gcWork, shard int) {
   394  	// Objects with finalizers have two GC-related invariants:
   395  	//
   396  	// 1) Everything reachable from the object must be marked.
   397  	// This ensures that when we pass the object to its finalizer,
   398  	// everything the finalizer can reach will be retained.
   399  	//
   400  	// 2) Finalizer specials (which are not in the garbage
   401  	// collected heap) are roots. In practice, this means the fn
   402  	// field must be scanned.
   403  	//
   404  	// Objects with weak handles have only one invariant related
   405  	// to this function: weak handle specials (which are not in the
   406  	// garbage collected heap) are roots. In practice, this means
   407  	// the handle field must be scanned. Note that the value the
   408  	// handle pointer referenced does *not* need to be scanned. See
   409  	// the definition of specialWeakHandle for details.
   410  	sg := mheap_.sweepgen
   411  
   412  	// Find the arena and page index into that arena for this shard.
   413  	ai := mheap_.markArenas[shard/(pagesPerArena/pagesPerSpanRoot)]
   414  	ha := mheap_.arenas[ai.l1()][ai.l2()]
   415  	arenaPage := uint(uintptr(shard) * pagesPerSpanRoot % pagesPerArena)
   416  
   417  	// Construct slice of bitmap which we'll iterate over.
   418  	specialsbits := ha.pageSpecials[arenaPage/8:]
   419  	specialsbits = specialsbits[:pagesPerSpanRoot/8]
   420  	for i := range specialsbits {
   421  		// Find set bits, which correspond to spans with specials.
   422  		specials := atomic.Load8(&specialsbits[i])
   423  		if specials == 0 {
   424  			continue
   425  		}
   426  		for j := uint(0); j < 8; j++ {
   427  			if specials&(1<<j) == 0 {
   428  				continue
   429  			}
   430  			// Find the span for this bit.
   431  			//
   432  			// This value is guaranteed to be non-nil because having
   433  			// specials implies that the span is in-use, and since we're
   434  			// currently marking we can be sure that we don't have to worry
   435  			// about the span being freed and re-used.
   436  			s := ha.spans[arenaPage+uint(i)*8+j]
   437  
   438  			// The state must be mSpanInUse if the specials bit is set, so
   439  			// sanity check that.
   440  			if state := s.state.get(); state != mSpanInUse {
   441  				print("s.state = ", state, "\n")
   442  				throw("non in-use span found with specials bit set")
   443  			}
   444  			// Check that this span was swept (it may be cached or uncached).
   445  			if !useCheckmark && !(s.sweepgen == sg || s.sweepgen == sg+3) {
   446  				// sweepgen was updated (+2) during non-checkmark GC pass
   447  				print("sweep ", s.sweepgen, " ", sg, "\n")
   448  				throw("gc: unswept span")
   449  			}
   450  
   451  			// Lock the specials to prevent a special from being
   452  			// removed from the list while we're traversing it.
   453  			lock(&s.speciallock)
   454  			for sp := s.specials; sp != nil; sp = sp.next {
   455  				switch sp.kind {
   456  				case _KindSpecialFinalizer:
   457  					gcScanFinalizer((*specialfinalizer)(unsafe.Pointer(sp)), s, gcw)
   458  				case _KindSpecialWeakHandle:
   459  					// The special itself is a root.
   460  					spw := (*specialWeakHandle)(unsafe.Pointer(sp))
   461  					scanblock(uintptr(unsafe.Pointer(&spw.handle)), goarch.PtrSize, &oneptrmask[0], gcw, nil)
   462  				case _KindSpecialCleanup:
   463  					gcScanCleanup((*specialCleanup)(unsafe.Pointer(sp)), gcw)
   464  				}
   465  			}
   466  			unlock(&s.speciallock)
   467  		}
   468  	}
   469  }
   470  
   471  // gcScanFinalizer scans the relevant parts of a finalizer special as a root.
   472  func gcScanFinalizer(spf *specialfinalizer, s *mspan, gcw *gcWork) {
   473  	// Don't mark finalized object, but scan it so we retain everything it points to.
   474  
   475  	// A finalizer can be set for an inner byte of an object, find object beginning.
   476  	p := s.base() + spf.special.offset/s.elemsize*s.elemsize
   477  
   478  	// Mark everything that can be reached from
   479  	// the object (but *not* the object itself or
   480  	// we'll never collect it).
   481  	if !s.spanclass.noscan() {
   482  		scanObject(p, gcw)
   483  	}
   484  
   485  	// The special itself is also a root.
   486  	scanblock(uintptr(unsafe.Pointer(&spf.fn)), goarch.PtrSize, &oneptrmask[0], gcw, nil)
   487  }
   488  
   489  // gcScanCleanup scans the relevant parts of a cleanup special as a root.
   490  func gcScanCleanup(spc *specialCleanup, gcw *gcWork) {
   491  	// The special itself is a root.
   492  	scanblock(uintptr(unsafe.Pointer(&spc.cleanup)), unsafe.Sizeof(cleanupFn{}), &cleanupFnPtrMask[0], gcw, nil)
   493  }
   494  
   495  // gcAssistAlloc performs GC work to make gp's assist debt positive.
   496  // gp must be the calling user goroutine.
   497  //
   498  // This must be called with preemption enabled.
   499  func gcAssistAlloc(gp *g) {
   500  	// Don't assist in non-preemptible contexts. These are
   501  	// generally fragile and won't allow the assist to block.
   502  	if getg() == gp.m.g0 {
   503  		return
   504  	}
   505  	if mp := getg().m; mp.locks > 0 || mp.preemptoff != "" {
   506  		return
   507  	}
   508  
   509  	if gp := getg(); gp.bubble != nil {
   510  		// Disassociate the G from its synctest bubble while allocating.
   511  		// This is less elegant than incrementing the group's active count,
   512  		// but avoids any contamination between GC assist and synctest.
   513  		bubble := gp.bubble
   514  		gp.bubble = nil
   515  		defer func() {
   516  			gp.bubble = bubble
   517  		}()
   518  	}
   519  
   520  	// This extremely verbose boolean indicates whether we've
   521  	// entered mark assist from the perspective of the tracer.
   522  	//
   523  	// In the tracer, this is just before we call gcAssistAlloc1
   524  	// *regardless* of whether tracing is enabled. This is because
   525  	// the tracer allows for tracing to begin (and advance
   526  	// generations) in the middle of a GC mark phase, so we need to
   527  	// record some state so that the tracer can pick it up to ensure
   528  	// a consistent trace result.
   529  	//
   530  	// TODO(mknyszek): Hide the details of inMarkAssist in tracer
   531  	// functions and simplify all the state tracking. This is a lot.
   532  	enteredMarkAssistForTracing := false
   533  retry:
   534  	if gcCPULimiter.limiting() {
   535  		// If the CPU limiter is enabled, intentionally don't
   536  		// assist to reduce the amount of CPU time spent in the GC.
   537  		if enteredMarkAssistForTracing {
   538  			trace := traceAcquire()
   539  			if trace.ok() {
   540  				trace.GCMarkAssistDone()
   541  				// Set this *after* we trace the end to make sure
   542  				// that we emit an in-progress event if this is
   543  				// the first event for the goroutine in the trace
   544  				// or trace generation. Also, do this between
   545  				// acquire/release because this is part of the
   546  				// goroutine's trace state, and it must be atomic
   547  				// with respect to the tracer.
   548  				gp.inMarkAssist = false
   549  				traceRelease(trace)
   550  			} else {
   551  				// This state is tracked even if tracing isn't enabled.
   552  				// It's only used by the new tracer.
   553  				// See the comment on enteredMarkAssistForTracing.
   554  				gp.inMarkAssist = false
   555  			}
   556  		}
   557  		return
   558  	}
   559  	// Compute the amount of scan work we need to do to make the
   560  	// balance positive. When the required amount of work is low,
   561  	// we over-assist to build up credit for future allocations
   562  	// and amortize the cost of assisting.
   563  	assistWorkPerByte := gcController.assistWorkPerByte.Load()
   564  	assistBytesPerWork := gcController.assistBytesPerWork.Load()
   565  	debtBytes := -gp.gcAssistBytes
   566  	scanWork := int64(assistWorkPerByte * float64(debtBytes))
   567  	if scanWork < gcOverAssistWork {
   568  		scanWork = gcOverAssistWork
   569  		debtBytes = int64(assistBytesPerWork * float64(scanWork))
   570  	}
   571  
   572  	// Steal as much credit as we can from the background GC's
   573  	// scan credit. This is racy and may drop the background
   574  	// credit below 0 if two mutators steal at the same time. This
   575  	// will just cause steals to fail until credit is accumulated
   576  	// again, so in the long run it doesn't really matter, but we
   577  	// do have to handle the negative credit case.
   578  	bgScanCredit := gcController.bgScanCredit.Load()
   579  	stolen := int64(0)
   580  	if bgScanCredit > 0 {
   581  		if bgScanCredit < scanWork {
   582  			stolen = bgScanCredit
   583  			gp.gcAssistBytes += 1 + int64(assistBytesPerWork*float64(stolen))
   584  		} else {
   585  			stolen = scanWork
   586  			gp.gcAssistBytes += debtBytes
   587  		}
   588  		gcController.bgScanCredit.Add(-stolen)
   589  
   590  		scanWork -= stolen
   591  
   592  		if scanWork == 0 {
   593  			// We were able to steal all of the credit we
   594  			// needed.
   595  			if enteredMarkAssistForTracing {
   596  				trace := traceAcquire()
   597  				if trace.ok() {
   598  					trace.GCMarkAssistDone()
   599  					// Set this *after* we trace the end to make sure
   600  					// that we emit an in-progress event if this is
   601  					// the first event for the goroutine in the trace
   602  					// or trace generation. Also, do this between
   603  					// acquire/release because this is part of the
   604  					// goroutine's trace state, and it must be atomic
   605  					// with respect to the tracer.
   606  					gp.inMarkAssist = false
   607  					traceRelease(trace)
   608  				} else {
   609  					// This state is tracked even if tracing isn't enabled.
   610  					// It's only used by the new tracer.
   611  					// See the comment on enteredMarkAssistForTracing.
   612  					gp.inMarkAssist = false
   613  				}
   614  			}
   615  			return
   616  		}
   617  	}
   618  	if !enteredMarkAssistForTracing {
   619  		trace := traceAcquire()
   620  		if trace.ok() {
   621  			trace.GCMarkAssistStart()
   622  			// Set this *after* we trace the start, otherwise we may
   623  			// emit an in-progress event for an assist we're about to start.
   624  			gp.inMarkAssist = true
   625  			traceRelease(trace)
   626  		} else {
   627  			gp.inMarkAssist = true
   628  		}
   629  		// In the new tracer, set enter mark assist tracing if we
   630  		// ever pass this point, because we must manage inMarkAssist
   631  		// correctly.
   632  		//
   633  		// See the comment on enteredMarkAssistForTracing.
   634  		enteredMarkAssistForTracing = true
   635  	}
   636  
   637  	// Perform assist work
   638  	systemstack(func() {
   639  		gcAssistAlloc1(gp, scanWork)
   640  		// The user stack may have moved, so this can't touch
   641  		// anything on it until it returns from systemstack.
   642  	})
   643  
   644  	completed := gp.param != nil
   645  	gp.param = nil
   646  	if completed {
   647  		gcMarkDone()
   648  	}
   649  
   650  	if gp.gcAssistBytes < 0 {
   651  		// We were unable steal enough credit or perform
   652  		// enough work to pay off the assist debt. We need to
   653  		// do one of these before letting the mutator allocate
   654  		// more to prevent over-allocation.
   655  		//
   656  		// If this is because we were preempted, reschedule
   657  		// and try some more.
   658  		if gp.preempt {
   659  			Gosched()
   660  			goto retry
   661  		}
   662  
   663  		// Add this G to an assist queue and park. When the GC
   664  		// has more background credit, it will satisfy queued
   665  		// assists before flushing to the global credit pool.
   666  		//
   667  		// Note that this does *not* get woken up when more
   668  		// work is added to the work list. The theory is that
   669  		// there wasn't enough work to do anyway, so we might
   670  		// as well let background marking take care of the
   671  		// work that is available.
   672  		if !gcParkAssist() {
   673  			goto retry
   674  		}
   675  
   676  		// At this point either background GC has satisfied
   677  		// this G's assist debt, or the GC cycle is over.
   678  	}
   679  	if enteredMarkAssistForTracing {
   680  		trace := traceAcquire()
   681  		if trace.ok() {
   682  			trace.GCMarkAssistDone()
   683  			// Set this *after* we trace the end to make sure
   684  			// that we emit an in-progress event if this is
   685  			// the first event for the goroutine in the trace
   686  			// or trace generation. Also, do this between
   687  			// acquire/release because this is part of the
   688  			// goroutine's trace state, and it must be atomic
   689  			// with respect to the tracer.
   690  			gp.inMarkAssist = false
   691  			traceRelease(trace)
   692  		} else {
   693  			// This state is tracked even if tracing isn't enabled.
   694  			// It's only used by the new tracer.
   695  			// See the comment on enteredMarkAssistForTracing.
   696  			gp.inMarkAssist = false
   697  		}
   698  	}
   699  }
   700  
   701  // gcAssistAlloc1 is the part of gcAssistAlloc that runs on the system
   702  // stack. This is a separate function to make it easier to see that
   703  // we're not capturing anything from the user stack, since the user
   704  // stack may move while we're in this function.
   705  //
   706  // gcAssistAlloc1 indicates whether this assist completed the mark
   707  // phase by setting gp.param to non-nil. This can't be communicated on
   708  // the stack since it may move.
   709  //
   710  //go:systemstack
   711  func gcAssistAlloc1(gp *g, scanWork int64) {
   712  	// Clear the flag indicating that this assist completed the
   713  	// mark phase.
   714  	gp.param = nil
   715  
   716  	if atomic.Load(&gcBlackenEnabled) == 0 {
   717  		// The gcBlackenEnabled check in malloc races with the
   718  		// store that clears it but an atomic check in every malloc
   719  		// would be a performance hit.
   720  		// Instead we recheck it here on the non-preemptible system
   721  		// stack to determine if we should perform an assist.
   722  
   723  		// GC is done, so ignore any remaining debt.
   724  		gp.gcAssistBytes = 0
   725  		return
   726  	}
   727  
   728  	// Track time spent in this assist. Since we're on the
   729  	// system stack, this is non-preemptible, so we can
   730  	// just measure start and end time.
   731  	//
   732  	// Limiter event tracking might be disabled if we end up here
   733  	// while on a mark worker.
   734  	startTime := nanotime()
   735  	trackLimiterEvent := gp.m.p.ptr().limiterEvent.start(limiterEventMarkAssist, startTime)
   736  
   737  	gcBeginWork()
   738  
   739  	// gcDrainN requires the caller to be preemptible.
   740  	casGToWaitingForSuspendG(gp, _Grunning, waitReasonGCAssistMarking)
   741  
   742  	// drain own cached work first in the hopes that it
   743  	// will be more cache friendly.
   744  	gcw := &getg().m.p.ptr().gcw
   745  	workDone := gcDrainN(gcw, scanWork)
   746  
   747  	casgstatus(gp, _Gwaiting, _Grunning)
   748  
   749  	// Record that we did this much scan work.
   750  	//
   751  	// Back out the number of bytes of assist credit that
   752  	// this scan work counts for. The "1+" is a poor man's
   753  	// round-up, to ensure this adds credit even if
   754  	// assistBytesPerWork is very low.
   755  	assistBytesPerWork := gcController.assistBytesPerWork.Load()
   756  	gp.gcAssistBytes += 1 + int64(assistBytesPerWork*float64(workDone))
   757  
   758  	// If this is the last worker and we ran out of work,
   759  	// signal a completion point.
   760  	if gcEndWork() {
   761  		// This has reached a background completion point. Set
   762  		// gp.param to a non-nil value to indicate this. It
   763  		// doesn't matter what we set it to (it just has to be
   764  		// a valid pointer).
   765  		gp.param = unsafe.Pointer(gp)
   766  	}
   767  	now := nanotime()
   768  	duration := now - startTime
   769  	pp := gp.m.p.ptr()
   770  	pp.gcAssistTime += duration
   771  	if trackLimiterEvent {
   772  		pp.limiterEvent.stop(limiterEventMarkAssist, now)
   773  	}
   774  	if pp.gcAssistTime > gcAssistTimeSlack {
   775  		gcController.assistTime.Add(pp.gcAssistTime)
   776  		gcCPULimiter.update(now)
   777  		pp.gcAssistTime = 0
   778  	}
   779  }
   780  
   781  // gcWakeAllAssists wakes all currently blocked assists. This is used
   782  // at the end of a GC cycle. gcBlackenEnabled must be false to prevent
   783  // new assists from going to sleep after this point.
   784  func gcWakeAllAssists() {
   785  	lock(&work.assistQueue.lock)
   786  	list := work.assistQueue.q.popList()
   787  	injectglist(&list)
   788  	unlock(&work.assistQueue.lock)
   789  }
   790  
   791  // gcParkAssist puts the current goroutine on the assist queue and parks.
   792  //
   793  // gcParkAssist reports whether the assist is now satisfied. If it
   794  // returns false, the caller must retry the assist.
   795  func gcParkAssist() bool {
   796  	lock(&work.assistQueue.lock)
   797  	// If the GC cycle finished while we were getting the lock,
   798  	// exit the assist. The cycle can't finish while we hold the
   799  	// lock.
   800  	if atomic.Load(&gcBlackenEnabled) == 0 {
   801  		unlock(&work.assistQueue.lock)
   802  		return true
   803  	}
   804  
   805  	gp := getg()
   806  	oldList := work.assistQueue.q
   807  	work.assistQueue.q.pushBack(gp)
   808  
   809  	// Recheck for background credit now that this G is in
   810  	// the queue, but can still back out. This avoids a
   811  	// race in case background marking has flushed more
   812  	// credit since we checked above.
   813  	if gcController.bgScanCredit.Load() > 0 {
   814  		work.assistQueue.q = oldList
   815  		if oldList.tail != 0 {
   816  			oldList.tail.ptr().schedlink.set(nil)
   817  		}
   818  		unlock(&work.assistQueue.lock)
   819  		return false
   820  	}
   821  	// Park.
   822  	goparkunlock(&work.assistQueue.lock, waitReasonGCAssistWait, traceBlockGCMarkAssist, 2)
   823  	return true
   824  }
   825  
   826  // gcFlushBgCredit flushes scanWork units of background scan work
   827  // credit. This first satisfies blocked assists on the
   828  // work.assistQueue and then flushes any remaining credit to
   829  // gcController.bgScanCredit.
   830  //
   831  // Write barriers are disallowed because this is used by gcDrain after
   832  // it has ensured that all work is drained and this must preserve that
   833  // condition.
   834  //
   835  //go:nowritebarrierrec
   836  func gcFlushBgCredit(scanWork int64) {
   837  	if work.assistQueue.q.empty() {
   838  		// Fast path; there are no blocked assists. There's a
   839  		// small window here where an assist may add itself to
   840  		// the blocked queue and park. If that happens, we'll
   841  		// just get it on the next flush.
   842  		gcController.bgScanCredit.Add(scanWork)
   843  		return
   844  	}
   845  
   846  	assistBytesPerWork := gcController.assistBytesPerWork.Load()
   847  	scanBytes := int64(float64(scanWork) * assistBytesPerWork)
   848  
   849  	lock(&work.assistQueue.lock)
   850  	for !work.assistQueue.q.empty() && scanBytes > 0 {
   851  		gp := work.assistQueue.q.pop()
   852  		// Note that gp.gcAssistBytes is negative because gp
   853  		// is in debt. Think carefully about the signs below.
   854  		if scanBytes+gp.gcAssistBytes >= 0 {
   855  			// Satisfy this entire assist debt.
   856  			scanBytes += gp.gcAssistBytes
   857  			gp.gcAssistBytes = 0
   858  			// It's important that we *not* put gp in
   859  			// runnext. Otherwise, it's possible for user
   860  			// code to exploit the GC worker's high
   861  			// scheduler priority to get itself always run
   862  			// before other goroutines and always in the
   863  			// fresh quantum started by GC.
   864  			ready(gp, 0, false)
   865  		} else {
   866  			// Partially satisfy this assist.
   867  			gp.gcAssistBytes += scanBytes
   868  			scanBytes = 0
   869  			// As a heuristic, we move this assist to the
   870  			// back of the queue so that large assists
   871  			// can't clog up the assist queue and
   872  			// substantially delay small assists.
   873  			work.assistQueue.q.pushBack(gp)
   874  			break
   875  		}
   876  	}
   877  
   878  	if scanBytes > 0 {
   879  		// Convert from scan bytes back to work.
   880  		assistWorkPerByte := gcController.assistWorkPerByte.Load()
   881  		scanWork = int64(float64(scanBytes) * assistWorkPerByte)
   882  		gcController.bgScanCredit.Add(scanWork)
   883  	}
   884  	unlock(&work.assistQueue.lock)
   885  }
   886  
   887  // scanstack scans gp's stack, greying all pointers found on the stack.
   888  //
   889  // Returns the amount of scan work performed, but doesn't update
   890  // gcController.stackScanWork or flush any credit. Any background credit produced
   891  // by this function should be flushed by its caller. scanstack itself can't
   892  // safely flush because it may result in trying to wake up a goroutine that
   893  // was just scanned, resulting in a self-deadlock.
   894  //
   895  // scanstack will also shrink the stack if it is safe to do so. If it
   896  // is not, it schedules a stack shrink for the next synchronous safe
   897  // point.
   898  //
   899  // scanstack is marked go:systemstack because it must not be preempted
   900  // while using a workbuf.
   901  //
   902  //go:nowritebarrier
   903  //go:systemstack
   904  func scanstack(gp *g, gcw *gcWork) int64 {
   905  	if readgstatus(gp)&_Gscan == 0 {
   906  		print("runtime:scanstack: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", hex(readgstatus(gp)), "\n")
   907  		throw("scanstack - bad status")
   908  	}
   909  
   910  	switch readgstatus(gp) &^ _Gscan {
   911  	default:
   912  		print("runtime: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
   913  		throw("mark - bad status")
   914  	case _Gdead, _Gdeadextra:
   915  		return 0
   916  	case _Grunning:
   917  		print("runtime: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
   918  		throw("scanstack: goroutine not stopped")
   919  	case _Grunnable, _Gsyscall, _Gwaiting, _Gleaked:
   920  		// ok
   921  	}
   922  
   923  	if gp == getg() {
   924  		throw("can't scan our own stack")
   925  	}
   926  
   927  	// scannedSize is the amount of work we'll be reporting.
   928  	//
   929  	// It is less than the allocated size (which is hi-lo).
   930  	var sp uintptr
   931  	if gp.syscallsp != 0 {
   932  		sp = gp.syscallsp // If in a system call this is the stack pointer (gp.sched.sp can be 0 in this case on Windows).
   933  	} else {
   934  		sp = gp.sched.sp
   935  	}
   936  	scannedSize := gp.stack.hi - sp
   937  
   938  	// Keep statistics for initial stack size calculation.
   939  	// Note that this accumulates the scanned size, not the allocated size.
   940  	p := getg().m.p.ptr()
   941  	p.scannedStackSize += uint64(scannedSize)
   942  	p.scannedStacks++
   943  
   944  	if isShrinkStackSafe(gp) {
   945  		// Shrink the stack if not much of it is being used.
   946  		shrinkstack(gp)
   947  	} else {
   948  		// Otherwise, shrink the stack at the next sync safe point.
   949  		gp.preemptShrink = true
   950  	}
   951  
   952  	var state stackScanState
   953  	state.stack = gp.stack
   954  
   955  	if stackTraceDebug {
   956  		println("stack trace goroutine", gp.goid)
   957  	}
   958  
   959  	if debugScanConservative && gp.asyncSafePoint {
   960  		print("scanning async preempted goroutine ", gp.goid, " stack [", hex(gp.stack.lo), ",", hex(gp.stack.hi), ")\n")
   961  	}
   962  
   963  	// Scan the saved context register. This is effectively a live
   964  	// register that gets moved back and forth between the
   965  	// register and sched.ctxt without a write barrier.
   966  	if gp.sched.ctxt != nil {
   967  		scanblock(uintptr(unsafe.Pointer(&gp.sched.ctxt)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
   968  	}
   969  
   970  	// Scan conservatively the extended register state.
   971  	if gp.asyncSafePoint {
   972  		xRegScan(gp, gcw, &state)
   973  	}
   974  
   975  	// Scan the stack. Accumulate a list of stack objects.
   976  	var u unwinder
   977  	for u.init(gp, 0); u.valid(); u.next() {
   978  		scanframeworker(&u.frame, &state, gcw)
   979  	}
   980  
   981  	// Find additional pointers that point into the stack from the heap.
   982  	// Currently this includes defers and panics. See also function copystack.
   983  
   984  	// Find and trace other pointers in defer records.
   985  	for d := gp._defer; d != nil; d = d.link {
   986  		if d.fn != nil {
   987  			// Scan the func value, which could be a stack allocated closure.
   988  			// See issue 30453.
   989  			scanblock(uintptr(unsafe.Pointer(&d.fn)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
   990  		}
   991  		if d.link != nil {
   992  			// The link field of a stack-allocated defer record might point
   993  			// to a heap-allocated defer record. Keep that heap record live.
   994  			scanblock(uintptr(unsafe.Pointer(&d.link)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
   995  		}
   996  		// Retain defers records themselves.
   997  		// Defer records might not be reachable from the G through regular heap
   998  		// tracing because the defer linked list might weave between the stack and the heap.
   999  		if d.heap {
  1000  			scanblock(uintptr(unsafe.Pointer(&d)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
  1001  		}
  1002  	}
  1003  	if gp._panic != nil {
  1004  		// Panics are always stack allocated.
  1005  		state.putPtr(uintptr(unsafe.Pointer(gp._panic)), false)
  1006  	}
  1007  
  1008  	// Find and scan all reachable stack objects.
  1009  	//
  1010  	// The state's pointer queue prioritizes precise pointers over
  1011  	// conservative pointers so that we'll prefer scanning stack
  1012  	// objects precisely.
  1013  	state.buildIndex()
  1014  	for {
  1015  		p, conservative := state.getPtr()
  1016  		if p == 0 {
  1017  			break
  1018  		}
  1019  		obj := state.findObject(p)
  1020  		if obj == nil {
  1021  			continue
  1022  		}
  1023  		r := obj.r
  1024  		if r == nil {
  1025  			// We've already scanned this object.
  1026  			continue
  1027  		}
  1028  		obj.setRecord(nil) // Don't scan it again.
  1029  		if stackTraceDebug {
  1030  			printlock()
  1031  			print("  live stkobj at", hex(state.stack.lo+uintptr(obj.off)), "of size", obj.size)
  1032  			if conservative {
  1033  				print(" (conservative)")
  1034  			}
  1035  			println()
  1036  			printunlock()
  1037  		}
  1038  		ptrBytes, gcData := r.gcdata()
  1039  		b := state.stack.lo + uintptr(obj.off)
  1040  		if conservative {
  1041  			scanConservative(b, ptrBytes, gcData, gcw, &state)
  1042  		} else {
  1043  			scanblock(b, ptrBytes, gcData, gcw, &state)
  1044  		}
  1045  	}
  1046  
  1047  	// Deallocate object buffers.
  1048  	// (Pointer buffers were all deallocated in the loop above.)
  1049  	for state.head != nil {
  1050  		x := state.head
  1051  		state.head = x.next
  1052  		if stackTraceDebug {
  1053  			for i := 0; i < x.nobj; i++ {
  1054  				obj := &x.obj[i]
  1055  				if obj.r == nil { // reachable
  1056  					continue
  1057  				}
  1058  				println("  dead stkobj at", hex(gp.stack.lo+uintptr(obj.off)), "of size", obj.r.size)
  1059  				// Note: not necessarily really dead - only reachable-from-ptr dead.
  1060  			}
  1061  		}
  1062  		x.nobj = 0
  1063  		putempty((*workbuf)(unsafe.Pointer(x)))
  1064  	}
  1065  	if state.buf != nil || state.cbuf != nil || state.freeBuf != nil {
  1066  		throw("remaining pointer buffers")
  1067  	}
  1068  	return int64(scannedSize)
  1069  }
  1070  
  1071  // Scan a stack frame: local variables and function arguments/results.
  1072  //
  1073  //go:nowritebarrier
  1074  func scanframeworker(frame *stkframe, state *stackScanState, gcw *gcWork) {
  1075  	if _DebugGC > 1 && frame.continpc != 0 {
  1076  		print("scanframe ", funcname(frame.fn), "\n")
  1077  	}
  1078  
  1079  	isAsyncPreempt := frame.fn.valid() && frame.fn.funcID == abi.FuncID_asyncPreempt
  1080  	isDebugCall := frame.fn.valid() && frame.fn.funcID == abi.FuncID_debugCallV2
  1081  	if state.conservative || isAsyncPreempt || isDebugCall {
  1082  		if debugScanConservative {
  1083  			println("conservatively scanning function", funcname(frame.fn), "at PC", hex(frame.continpc))
  1084  		}
  1085  
  1086  		// Conservatively scan the frame. Unlike the precise
  1087  		// case, this includes the outgoing argument space
  1088  		// since we may have stopped while this function was
  1089  		// setting up a call.
  1090  		//
  1091  		// TODO: We could narrow this down if the compiler
  1092  		// produced a single map per function of stack slots
  1093  		// and registers that ever contain a pointer.
  1094  		if frame.varp != 0 {
  1095  			size := frame.varp - frame.sp
  1096  			if size > 0 {
  1097  				scanConservative(frame.sp, size, nil, gcw, state)
  1098  			}
  1099  		}
  1100  
  1101  		// Scan arguments to this frame.
  1102  		if n := frame.argBytes(); n != 0 {
  1103  			// TODO: We could pass the entry argument map
  1104  			// to narrow this down further.
  1105  			scanConservative(frame.argp, n, nil, gcw, state)
  1106  		}
  1107  
  1108  		if isAsyncPreempt || isDebugCall {
  1109  			// This function's frame contained the
  1110  			// registers for the asynchronously stopped
  1111  			// parent frame. Scan the parent
  1112  			// conservatively.
  1113  			state.conservative = true
  1114  		} else {
  1115  			// We only wanted to scan those two frames
  1116  			// conservatively. Clear the flag for future
  1117  			// frames.
  1118  			state.conservative = false
  1119  		}
  1120  		return
  1121  	}
  1122  
  1123  	locals, args, objs := frame.getStackMap(false)
  1124  
  1125  	// Scan local variables if stack frame has been allocated.
  1126  	if locals.n > 0 {
  1127  		size := uintptr(locals.n) * goarch.PtrSize
  1128  		scanblock(frame.varp-size, size, locals.bytedata, gcw, state)
  1129  	}
  1130  
  1131  	// Scan arguments.
  1132  	if args.n > 0 {
  1133  		scanblock(frame.argp, uintptr(args.n)*goarch.PtrSize, args.bytedata, gcw, state)
  1134  	}
  1135  
  1136  	// Add all stack objects to the stack object list.
  1137  	if frame.varp != 0 {
  1138  		// varp is 0 for defers, where there are no locals.
  1139  		// In that case, there can't be a pointer to its args, either.
  1140  		// (And all args would be scanned above anyway.)
  1141  		for i := range objs {
  1142  			obj := &objs[i]
  1143  			off := obj.off
  1144  			base := frame.varp // locals base pointer
  1145  			if off >= 0 {
  1146  				base = frame.argp // arguments and return values base pointer
  1147  			}
  1148  			ptr := base + uintptr(off)
  1149  			if ptr < frame.sp {
  1150  				// object hasn't been allocated in the frame yet.
  1151  				continue
  1152  			}
  1153  			if stackTraceDebug {
  1154  				println("stkobj at", hex(ptr), "of size", obj.size)
  1155  			}
  1156  			state.addObject(ptr, obj)
  1157  		}
  1158  	}
  1159  }
  1160  
  1161  type gcDrainFlags int
  1162  
  1163  const (
  1164  	gcDrainUntilPreempt gcDrainFlags = 1 << iota
  1165  	gcDrainFlushBgCredit
  1166  	gcDrainIdle
  1167  	gcDrainFractional
  1168  )
  1169  
  1170  // gcDrainMarkWorkerIdle is a wrapper for gcDrain that exists to better account
  1171  // mark time in profiles.
  1172  func gcDrainMarkWorkerIdle(gcw *gcWork) {
  1173  	gcDrain(gcw, gcDrainIdle|gcDrainUntilPreempt|gcDrainFlushBgCredit)
  1174  }
  1175  
  1176  // gcDrainMarkWorkerDedicated is a wrapper for gcDrain that exists to better account
  1177  // mark time in profiles.
  1178  func gcDrainMarkWorkerDedicated(gcw *gcWork, untilPreempt bool) {
  1179  	flags := gcDrainFlushBgCredit
  1180  	if untilPreempt {
  1181  		flags |= gcDrainUntilPreempt
  1182  	}
  1183  	gcDrain(gcw, flags)
  1184  }
  1185  
  1186  // gcDrainMarkWorkerFractional is a wrapper for gcDrain that exists to better account
  1187  // mark time in profiles.
  1188  func gcDrainMarkWorkerFractional(gcw *gcWork) {
  1189  	gcDrain(gcw, gcDrainFractional|gcDrainUntilPreempt|gcDrainFlushBgCredit)
  1190  }
  1191  
  1192  // gcNextMarkRoot safely increments work.markrootNext and returns the
  1193  // index of the next root job. The returned boolean is true if the root job
  1194  // is valid, and false if there are no more root jobs to be claimed,
  1195  // i.e. work.markrootNext >= work.markrootJobs.
  1196  func gcNextMarkRoot() (uint32, bool) {
  1197  	if !work.goroutineLeak.enabled {
  1198  		// If not running goroutine leak detection, assume regular GC behavior.
  1199  		job := work.markrootNext.Add(1) - 1
  1200  		return job, job < work.markrootJobs.Load()
  1201  	}
  1202  
  1203  	// Otherwise, use a CAS loop to increment markrootNext.
  1204  	for next, jobs := work.markrootNext.Load(), work.markrootJobs.Load(); next < jobs; next = work.markrootNext.Load() {
  1205  		// There is still work available at the moment.
  1206  		if work.markrootNext.CompareAndSwap(next, next+1) {
  1207  			// We manage to snatch a root job. Return the root index.
  1208  			return next, true
  1209  		}
  1210  	}
  1211  	return 0, false
  1212  }
  1213  
  1214  // gcDrain scans roots and objects in work buffers, blackening grey
  1215  // objects until it is unable to get more work. It may return before
  1216  // GC is done; it's the caller's responsibility to balance work from
  1217  // other Ps.
  1218  //
  1219  // If flags&gcDrainUntilPreempt != 0, gcDrain returns when g.preempt
  1220  // is set.
  1221  //
  1222  // If flags&gcDrainIdle != 0, gcDrain returns when there is other work
  1223  // to do.
  1224  //
  1225  // If flags&gcDrainFractional != 0, gcDrain self-preempts when
  1226  // pollFractionalWorkerExit() returns true. This implies
  1227  // gcDrainNoBlock.
  1228  //
  1229  // If flags&gcDrainFlushBgCredit != 0, gcDrain flushes scan work
  1230  // credit to gcController.bgScanCredit every gcCreditSlack units of
  1231  // scan work.
  1232  //
  1233  // gcDrain will always return if there is a pending STW or forEachP.
  1234  //
  1235  // Disabling write barriers is necessary to ensure that after we've
  1236  // confirmed that we've drained gcw, that we don't accidentally end
  1237  // up flipping that condition by immediately adding work in the form
  1238  // of a write barrier buffer flush.
  1239  //
  1240  // Don't set nowritebarrierrec because it's safe for some callees to
  1241  // have write barriers enabled.
  1242  //
  1243  //go:nowritebarrier
  1244  func gcDrain(gcw *gcWork, flags gcDrainFlags) {
  1245  	if !writeBarrier.enabled {
  1246  		throw("gcDrain phase incorrect")
  1247  	}
  1248  
  1249  	// N.B. We must be running in a non-preemptible context, so it's
  1250  	// safe to hold a reference to our P here.
  1251  	gp := getg().m.curg
  1252  	pp := gp.m.p.ptr()
  1253  	preemptible := flags&gcDrainUntilPreempt != 0
  1254  	flushBgCredit := flags&gcDrainFlushBgCredit != 0
  1255  	idle := flags&gcDrainIdle != 0
  1256  
  1257  	initScanWork := gcw.heapScanWork
  1258  
  1259  	// checkWork is the scan work before performing the next
  1260  	// self-preempt check.
  1261  	checkWork := int64(1<<63 - 1)
  1262  	var check func() bool
  1263  	if flags&(gcDrainIdle|gcDrainFractional) != 0 {
  1264  		checkWork = initScanWork + drainCheckThreshold
  1265  		if idle {
  1266  			check = pollWork
  1267  		} else if flags&gcDrainFractional != 0 {
  1268  			check = pollFractionalWorkerExit
  1269  		}
  1270  	}
  1271  
  1272  	if work.markrootNext.Load() < work.markrootJobs.Load() {
  1273  		// Stop if we're preemptible, if someone wants to STW, or if
  1274  		// someone is calling forEachP.
  1275  		for !(gp.preempt && (preemptible || sched.gcwaiting.Load() || pp.runSafePointFn != 0)) {
  1276  			job, ok := gcNextMarkRoot()
  1277  			if !ok {
  1278  				break
  1279  			}
  1280  			markroot(gcw, job, flushBgCredit)
  1281  			if check != nil && check() {
  1282  				goto done
  1283  			}
  1284  
  1285  			// Spin up a new worker if requested.
  1286  			if goexperiment.GreenTeaGC && gcw.mayNeedWorker {
  1287  				gcw.mayNeedWorker = false
  1288  				if gcphase == _GCmark {
  1289  					gcController.enlistWorker()
  1290  				}
  1291  			}
  1292  		}
  1293  	}
  1294  
  1295  	// Drain heap marking jobs.
  1296  	//
  1297  	// Stop if we're preemptible, if someone wants to STW, or if
  1298  	// someone is calling forEachP.
  1299  	//
  1300  	// TODO(mknyszek): Consider always checking gp.preempt instead
  1301  	// of having the preempt flag, and making an exception for certain
  1302  	// mark workers in retake. That might be simpler than trying to
  1303  	// enumerate all the reasons why we might want to preempt, even
  1304  	// if we're supposed to be mostly non-preemptible.
  1305  	for !(gp.preempt && (preemptible || sched.gcwaiting.Load() || pp.runSafePointFn != 0)) {
  1306  		// Try to keep work available on the global queue. We used to
  1307  		// check if there were waiting workers, but it's better to
  1308  		// just keep work available than to make workers wait. In the
  1309  		// worst case, we'll do O(log(_WorkbufSize)) unnecessary
  1310  		// balances.
  1311  		if work.full == 0 {
  1312  			gcw.balance()
  1313  		}
  1314  
  1315  		// See mgcwork.go for the rationale behind the order in which we check these queues.
  1316  		var b uintptr
  1317  		var s objptr
  1318  		if b = gcw.tryGetObjFast(); b == 0 {
  1319  			if s = gcw.tryGetSpanFast(); s == 0 {
  1320  				if b = gcw.tryGetObj(); b == 0 {
  1321  					if s = gcw.tryGetSpan(); s == 0 {
  1322  						// Flush the write barrier
  1323  						// buffer; this may create
  1324  						// more work.
  1325  						wbBufFlush()
  1326  						if b = gcw.tryGetObj(); b == 0 {
  1327  							if s = gcw.tryGetSpan(); s == 0 {
  1328  								s = gcw.tryStealSpan()
  1329  							}
  1330  						}
  1331  					}
  1332  				}
  1333  			}
  1334  		}
  1335  		if b != 0 {
  1336  			scanObject(b, gcw)
  1337  		} else if s != 0 {
  1338  			scanSpan(s, gcw)
  1339  		} else {
  1340  			// Unable to get work.
  1341  			break
  1342  		}
  1343  
  1344  		// Spin up a new worker if requested.
  1345  		if goexperiment.GreenTeaGC && gcw.mayNeedWorker {
  1346  			gcw.mayNeedWorker = false
  1347  			if gcphase == _GCmark {
  1348  				gcController.enlistWorker()
  1349  			}
  1350  		}
  1351  
  1352  		// Flush background scan work credit to the global
  1353  		// account if we've accumulated enough locally so
  1354  		// mutator assists can draw on it.
  1355  		if gcw.heapScanWork >= gcCreditSlack {
  1356  			gcController.heapScanWork.Add(gcw.heapScanWork)
  1357  			if flushBgCredit {
  1358  				gcFlushBgCredit(gcw.heapScanWork - initScanWork)
  1359  				initScanWork = 0
  1360  			}
  1361  			checkWork -= gcw.heapScanWork
  1362  			gcw.heapScanWork = 0
  1363  
  1364  			if checkWork <= 0 {
  1365  				checkWork += drainCheckThreshold
  1366  				if check != nil && check() {
  1367  					break
  1368  				}
  1369  			}
  1370  		}
  1371  	}
  1372  
  1373  done:
  1374  	// Flush remaining scan work credit.
  1375  	if gcw.heapScanWork > 0 {
  1376  		gcController.heapScanWork.Add(gcw.heapScanWork)
  1377  		if flushBgCredit {
  1378  			gcFlushBgCredit(gcw.heapScanWork - initScanWork)
  1379  		}
  1380  		gcw.heapScanWork = 0
  1381  	}
  1382  }
  1383  
  1384  // gcDrainN blackens grey objects until it has performed roughly
  1385  // scanWork units of scan work or the G is preempted. This is
  1386  // best-effort, so it may perform less work if it fails to get a work
  1387  // buffer. Otherwise, it will perform at least n units of work, but
  1388  // may perform more because scanning is always done in whole object
  1389  // increments. It returns the amount of scan work performed.
  1390  //
  1391  // The caller goroutine must be in a preemptible state (e.g.,
  1392  // _Gwaiting) to prevent deadlocks during stack scanning. As a
  1393  // consequence, this must be called on the system stack.
  1394  //
  1395  //go:nowritebarrier
  1396  //go:systemstack
  1397  func gcDrainN(gcw *gcWork, scanWork int64) int64 {
  1398  	if !writeBarrier.enabled {
  1399  		throw("gcDrainN phase incorrect")
  1400  	}
  1401  
  1402  	// There may already be scan work on the gcw, which we don't
  1403  	// want to claim was done by this call.
  1404  	workFlushed := -gcw.heapScanWork
  1405  
  1406  	// In addition to backing out because of a preemption, back out
  1407  	// if the GC CPU limiter is enabled.
  1408  	gp := getg().m.curg
  1409  	for !gp.preempt && !gcCPULimiter.limiting() && workFlushed+gcw.heapScanWork < scanWork {
  1410  		// See gcDrain comment.
  1411  		if work.full == 0 {
  1412  			gcw.balance()
  1413  		}
  1414  
  1415  		// See mgcwork.go for the rationale behind the order in which we check these queues.
  1416  		var b uintptr
  1417  		var s objptr
  1418  		if b = gcw.tryGetObjFast(); b == 0 {
  1419  			if s = gcw.tryGetSpanFast(); s == 0 {
  1420  				if b = gcw.tryGetObj(); b == 0 {
  1421  					if s = gcw.tryGetSpan(); s == 0 {
  1422  						// Flush the write barrier
  1423  						// buffer; this may create
  1424  						// more work.
  1425  						wbBufFlush()
  1426  						if b = gcw.tryGetObj(); b == 0 {
  1427  							if s = gcw.tryGetSpan(); s == 0 {
  1428  								// Try to do a root job.
  1429  								if work.markrootNext.Load() < work.markrootJobs.Load() {
  1430  									job, ok := gcNextMarkRoot()
  1431  									if ok {
  1432  										workFlushed += markroot(gcw, job, false)
  1433  										continue
  1434  									}
  1435  								}
  1436  								s = gcw.tryStealSpan()
  1437  							}
  1438  						}
  1439  					}
  1440  				}
  1441  			}
  1442  		}
  1443  		if b != 0 {
  1444  			scanObject(b, gcw)
  1445  		} else if s != 0 {
  1446  			scanSpan(s, gcw)
  1447  		} else {
  1448  			// Unable to get work.
  1449  			break
  1450  		}
  1451  
  1452  		// Flush background scan work credit.
  1453  		if gcw.heapScanWork >= gcCreditSlack {
  1454  			gcController.heapScanWork.Add(gcw.heapScanWork)
  1455  			workFlushed += gcw.heapScanWork
  1456  			gcw.heapScanWork = 0
  1457  		}
  1458  
  1459  		// Spin up a new worker if requested.
  1460  		if goexperiment.GreenTeaGC && gcw.mayNeedWorker {
  1461  			gcw.mayNeedWorker = false
  1462  			if gcphase == _GCmark {
  1463  				gcController.enlistWorker()
  1464  			}
  1465  		}
  1466  	}
  1467  
  1468  	// Unlike gcDrain, there's no need to flush remaining work
  1469  	// here because this never flushes to bgScanCredit and
  1470  	// gcw.dispose will flush any remaining work to scanWork.
  1471  
  1472  	return workFlushed + gcw.heapScanWork
  1473  }
  1474  
  1475  // scanblock scans b as scanObject would, but using an explicit
  1476  // pointer bitmap instead of the heap bitmap.
  1477  //
  1478  // This is used to scan non-heap roots, so it does not update
  1479  // gcw.bytesMarked or gcw.heapScanWork.
  1480  //
  1481  // If stk != nil, possible stack pointers are also reported to stk.putPtr.
  1482  //
  1483  //go:nowritebarrier
  1484  func scanblock(b0, n0 uintptr, ptrmask *uint8, gcw *gcWork, stk *stackScanState) {
  1485  	// Use local copies of original parameters, so that a stack trace
  1486  	// due to one of the throws below shows the original block
  1487  	// base and extent.
  1488  	b := b0
  1489  	n := n0
  1490  
  1491  	for i := uintptr(0); i < n; {
  1492  		// Find bits for the next word.
  1493  		bits := uint32(*addb(ptrmask, i/(goarch.PtrSize*8)))
  1494  		if bits == 0 {
  1495  			i += goarch.PtrSize * 8
  1496  			continue
  1497  		}
  1498  		for j := 0; j < 8 && i < n; j++ {
  1499  			if bits&1 != 0 {
  1500  				// Same work as in scanObject; see comments there.
  1501  				p := *(*uintptr)(unsafe.Pointer(b + i))
  1502  				if p != 0 {
  1503  					if stk != nil && p >= stk.stack.lo && p < stk.stack.hi {
  1504  						stk.putPtr(p, false)
  1505  					} else {
  1506  						if !tryDeferToSpanScan(p, gcw) {
  1507  							if obj, span, objIndex := findObject(p, b, i); obj != 0 {
  1508  								greyobject(obj, b, i, span, gcw, objIndex)
  1509  							}
  1510  						}
  1511  					}
  1512  				}
  1513  			}
  1514  			bits >>= 1
  1515  			i += goarch.PtrSize
  1516  		}
  1517  	}
  1518  }
  1519  
  1520  // scanConservative scans block [b, b+n) conservatively, treating any
  1521  // pointer-like value in the block as a pointer.
  1522  //
  1523  // If ptrmask != nil, only words that are marked in ptrmask are
  1524  // considered as potential pointers.
  1525  //
  1526  // If state != nil, it's assumed that [b, b+n) is a block in the stack
  1527  // and may contain pointers to stack objects.
  1528  func scanConservative(b, n uintptr, ptrmask *uint8, gcw *gcWork, state *stackScanState) {
  1529  	if debugScanConservative {
  1530  		printlock()
  1531  		print("conservatively scanning [", hex(b), ",", hex(b+n), ")\n")
  1532  		hexdumpWords(b, n, func(p uintptr, m hexdumpMarker) {
  1533  			if ptrmask != nil {
  1534  				word := (p - b) / goarch.PtrSize
  1535  				bits := *addb(ptrmask, word/8)
  1536  				if (bits>>(word%8))&1 == 0 {
  1537  					return
  1538  				}
  1539  			}
  1540  
  1541  			val := *(*uintptr)(unsafe.Pointer(p))
  1542  			if state != nil && state.stack.lo <= val && val < state.stack.hi {
  1543  				m.start()
  1544  				println("ptr to stack")
  1545  				return
  1546  			}
  1547  
  1548  			span := spanOfHeap(val)
  1549  			if span == nil {
  1550  				return
  1551  			}
  1552  			idx := span.objIndex(val)
  1553  			if span.isFreeOrNewlyAllocated(idx) {
  1554  				return
  1555  			}
  1556  			m.start()
  1557  			println("ptr to heap")
  1558  		})
  1559  		printunlock()
  1560  	}
  1561  
  1562  	for i := uintptr(0); i < n; i += goarch.PtrSize {
  1563  		if ptrmask != nil {
  1564  			word := i / goarch.PtrSize
  1565  			bits := *addb(ptrmask, word/8)
  1566  			if bits == 0 {
  1567  				// Skip 8 words (the loop increment will do the 8th)
  1568  				//
  1569  				// This must be the first time we've
  1570  				// seen this word of ptrmask, so i
  1571  				// must be 8-word-aligned, but check
  1572  				// our reasoning just in case.
  1573  				if i%(goarch.PtrSize*8) != 0 {
  1574  					throw("misaligned mask")
  1575  				}
  1576  				i += goarch.PtrSize*8 - goarch.PtrSize
  1577  				continue
  1578  			}
  1579  			if (bits>>(word%8))&1 == 0 {
  1580  				continue
  1581  			}
  1582  		}
  1583  
  1584  		val := *(*uintptr)(unsafe.Pointer(b + i))
  1585  
  1586  		// Check if val points into the stack.
  1587  		if state != nil && state.stack.lo <= val && val < state.stack.hi {
  1588  			// val may point to a stack object. This
  1589  			// object may be dead from last cycle and
  1590  			// hence may contain pointers to unallocated
  1591  			// objects, but unlike heap objects we can't
  1592  			// tell if it's already dead. Hence, if all
  1593  			// pointers to this object are from
  1594  			// conservative scanning, we have to scan it
  1595  			// defensively, too.
  1596  			state.putPtr(val, true)
  1597  			continue
  1598  		}
  1599  
  1600  		// Check if val points to a heap span.
  1601  		span := spanOfHeap(val)
  1602  		if span == nil {
  1603  			continue
  1604  		}
  1605  
  1606  		// Check if val points to an allocated object.
  1607  		//
  1608  		// Ignore objects allocated during the mark phase, they've
  1609  		// been allocated black.
  1610  		idx := span.objIndex(val)
  1611  		if span.isFreeOrNewlyAllocated(idx) {
  1612  			continue
  1613  		}
  1614  
  1615  		// val points to an allocated object. Mark it.
  1616  		obj := span.base() + idx*span.elemsize
  1617  		if !tryDeferToSpanScan(obj, gcw) {
  1618  			greyobject(obj, b, i, span, gcw, idx)
  1619  		}
  1620  	}
  1621  }
  1622  
  1623  // Shade the object if it isn't already.
  1624  // The object is not nil and known to be in the heap.
  1625  // Preemption must be disabled.
  1626  //
  1627  //go:nowritebarrier
  1628  func shade(b uintptr) {
  1629  	gcw := &getg().m.p.ptr().gcw
  1630  	if !tryDeferToSpanScan(b, gcw) {
  1631  		if obj, span, objIndex := findObject(b, 0, 0); obj != 0 {
  1632  			greyobject(obj, 0, 0, span, gcw, objIndex)
  1633  		}
  1634  	}
  1635  }
  1636  
  1637  // obj is the start of an object with mark mbits.
  1638  // If it isn't already marked, mark it and enqueue into gcw.
  1639  // base and off are for debugging only and could be removed.
  1640  //
  1641  // See also wbBufFlush1, which partially duplicates this logic.
  1642  //
  1643  //go:nowritebarrierrec
  1644  func greyobject(obj, base, off uintptr, span *mspan, gcw *gcWork, objIndex uintptr) {
  1645  	// obj should be start of allocation, and so must be at least pointer-aligned.
  1646  	if obj&(goarch.PtrSize-1) != 0 {
  1647  		throw("greyobject: obj not pointer-aligned")
  1648  	}
  1649  	mbits := span.markBitsForIndex(objIndex)
  1650  
  1651  	if useCheckmark {
  1652  		if setCheckmark(obj, base, off, mbits) {
  1653  			// Already marked.
  1654  			return
  1655  		}
  1656  		if debug.checkfinalizers > 1 {
  1657  			print("  mark ", hex(obj), " found at *(", hex(base), "+", hex(off), ")\n")
  1658  		}
  1659  	} else {
  1660  		if debug.gccheckmark > 0 && span.isFree(objIndex) {
  1661  			print("runtime: marking free object ", hex(obj), " found at *(", hex(base), "+", hex(off), ")\n")
  1662  			gcDumpObject("base", base, off)
  1663  			gcDumpObject("obj", obj, ^uintptr(0))
  1664  			getg().m.traceback = 2
  1665  			throw("marking free object")
  1666  		}
  1667  
  1668  		// If marked we have nothing to do.
  1669  		if mbits.isMarked() {
  1670  			return
  1671  		}
  1672  		mbits.setMarked()
  1673  
  1674  		// Mark span.
  1675  		arena, pageIdx, pageMask := pageIndexOf(span.base())
  1676  		if arena.pageMarks[pageIdx]&pageMask == 0 {
  1677  			atomic.Or8(&arena.pageMarks[pageIdx], pageMask)
  1678  		}
  1679  	}
  1680  
  1681  	// If this is a noscan object, fast-track it to black
  1682  	// instead of greying it.
  1683  	if span.spanclass.noscan() {
  1684  		gcw.bytesMarked += uint64(span.elemsize)
  1685  		return
  1686  	}
  1687  
  1688  	// We're adding obj to P's local workbuf, so it's likely
  1689  	// this object will be processed soon by the same P.
  1690  	// Even if the workbuf gets flushed, there will likely still be
  1691  	// some benefit on platforms with inclusive shared caches.
  1692  	sys.Prefetch(obj)
  1693  	// Queue the obj for scanning.
  1694  	if !gcw.putObjFast(obj) {
  1695  		gcw.putObj(obj)
  1696  	}
  1697  }
  1698  
  1699  // gcDumpObject dumps the contents of obj for debugging and marks the
  1700  // field at byte offset off in obj.
  1701  func gcDumpObject(label string, obj, off uintptr) {
  1702  	s := spanOf(obj)
  1703  	print(label, "=", hex(obj))
  1704  	if s == nil {
  1705  		print(" s=nil\n")
  1706  		return
  1707  	}
  1708  	print(" s.base()=", hex(s.base()), " s.limit=", hex(s.limit), " s.spanclass=", s.spanclass, " s.elemsize=", s.elemsize, " s.state=")
  1709  	if state := s.state.get(); 0 <= state && int(state) < len(mSpanStateNames) {
  1710  		print(mSpanStateNames[state], "\n")
  1711  	} else {
  1712  		print("unknown(", state, ")\n")
  1713  	}
  1714  
  1715  	skipped := false
  1716  	size := s.elemsize
  1717  	if s.state.get() == mSpanManual && size == 0 {
  1718  		// We're printing something from a stack frame. We
  1719  		// don't know how big it is, so just show up to an
  1720  		// including off.
  1721  		size = off + goarch.PtrSize
  1722  	}
  1723  	for i := uintptr(0); i < size; i += goarch.PtrSize {
  1724  		// For big objects, just print the beginning (because
  1725  		// that usually hints at the object's type) and the
  1726  		// fields around off.
  1727  		if !(i < 128*goarch.PtrSize || off-16*goarch.PtrSize < i && i < off+16*goarch.PtrSize) {
  1728  			skipped = true
  1729  			continue
  1730  		}
  1731  		if skipped {
  1732  			print(" ...\n")
  1733  			skipped = false
  1734  		}
  1735  		print(" *(", label, "+", i, ") = ", hex(*(*uintptr)(unsafe.Pointer(obj + i))))
  1736  		if i == off {
  1737  			print(" <==")
  1738  		}
  1739  		print("\n")
  1740  	}
  1741  	if skipped {
  1742  		print(" ...\n")
  1743  	}
  1744  }
  1745  
  1746  // gcmarknewobject marks a newly allocated object black. obj must
  1747  // not contain any non-nil pointers.
  1748  //
  1749  // This is nosplit so it can manipulate a gcWork without preemption.
  1750  //
  1751  //go:nowritebarrier
  1752  //go:nosplit
  1753  func gcmarknewobject(span *mspan, obj uintptr) {
  1754  	if useCheckmark { // The world should be stopped so this should not happen.
  1755  		throw("gcmarknewobject called while doing checkmark")
  1756  	}
  1757  	if gcphase == _GCmarktermination {
  1758  		// Check this here instead of on the hot path.
  1759  		throw("mallocgc called with gcphase == _GCmarktermination")
  1760  	}
  1761  
  1762  	// Mark object.
  1763  	objIndex := span.objIndex(obj)
  1764  	span.markBitsForIndex(objIndex).setMarked()
  1765  	if goexperiment.GreenTeaGC && gcUsesSpanInlineMarkBits(span.elemsize) {
  1766  		// No need to scan the new object.
  1767  		span.scannedBitsForIndex(objIndex).setMarked()
  1768  	}
  1769  
  1770  	// Mark span.
  1771  	arena, pageIdx, pageMask := pageIndexOf(span.base())
  1772  	if arena.pageMarks[pageIdx]&pageMask == 0 {
  1773  		atomic.Or8(&arena.pageMarks[pageIdx], pageMask)
  1774  	}
  1775  
  1776  	gcw := &getg().m.p.ptr().gcw
  1777  	gcw.bytesMarked += uint64(span.elemsize)
  1778  }
  1779  
  1780  // gcMarkTinyAllocs greys all active tiny alloc blocks.
  1781  //
  1782  // The world must be stopped.
  1783  func gcMarkTinyAllocs() {
  1784  	assertWorldStopped()
  1785  
  1786  	for _, p := range allp {
  1787  		c := p.mcache
  1788  		if c == nil || c.tiny == 0 {
  1789  			continue
  1790  		}
  1791  		gcw := &p.gcw
  1792  		if !tryDeferToSpanScan(c.tiny, gcw) {
  1793  			_, span, objIndex := findObject(c.tiny, 0, 0)
  1794  			greyobject(c.tiny, 0, 0, span, gcw, objIndex)
  1795  		}
  1796  	}
  1797  }
  1798  

View as plain text