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.
5 // Garbage collector: marking and scanning
11 "runtime/internal/atomic"
12 "runtime/internal/sys"
17 fixedRootFinalizers = iota
21 // rootBlockBytes is the number of bytes to scan per data or
23 rootBlockBytes = 256 << 10
25 // maxObletBytes is the maximum bytes of an object to scan at
26 // once. Larger objects will be split up into "oblets" of at
27 // most this size. Since we can scan 1–2 MB/ms, 128 KB bounds
28 // scan preemption at ~100 µs.
30 // This must be > _MaxSmallSize so that the object base is the
32 maxObletBytes = 128 << 10
34 // drainCheckThreshold specifies how many units of work to do
35 // between self-preemption checks in gcDrain. Assuming a scan
36 // rate of 1 MB/ms, this is ~100 µs. Lower values have higher
37 // overhead in the scan loop (the scheduler check may perform
38 // a syscall, so its overhead is nontrivial). Higher values
39 // make the system less responsive to incoming work.
40 drainCheckThreshold = 100000
42 // pagesPerSpanRoot indicates how many pages to scan from a span root
43 // at a time. Used by special root marking.
45 // Higher values improve throughput by increasing locality, but
46 // increase the minimum latency of a marking operation.
48 // Must be a multiple of the pageInUse bitmap element size and
49 // must also evenly divide pagesPerArena.
50 pagesPerSpanRoot = 512
53 // gcMarkRootPrepare queues root scanning jobs (stacks, globals, and
54 // some miscellany) and initializes scanning-related state.
56 // The world must be stopped.
57 func gcMarkRootPrepare() {
60 // Compute how many data and BSS root blocks there are.
61 nBlocks := func(bytes uintptr) int {
62 return int(divRoundUp(bytes, rootBlockBytes))
69 for _, datap := range activeModules() {
70 nDataRoots := nBlocks(datap.edata - datap.data)
71 if nDataRoots > work.nDataRoots {
72 work.nDataRoots = nDataRoots
76 for _, datap := range activeModules() {
77 nBSSRoots := nBlocks(datap.ebss - datap.bss)
78 if nBSSRoots > work.nBSSRoots {
79 work.nBSSRoots = nBSSRoots
83 // Scan span roots for finalizer specials.
85 // We depend on addfinalizer to mark objects that get
86 // finalizers after root marking.
88 // We're going to scan the whole heap (that was available at the time the
89 // mark phase started, i.e. markArenas) for in-use spans which have specials.
91 // Break up the work into arenas, and further into chunks.
93 // Snapshot allArenas as markArenas. This snapshot is safe because allArenas
95 mheap_.markArenas = mheap_.allArenas[:len(mheap_.allArenas):len(mheap_.allArenas)]
96 work.nSpanRoots = len(mheap_.markArenas) * (pagesPerArena / pagesPerSpanRoot)
100 // Gs may be created after this point, but it's okay that we
101 // ignore them because they begin life without any roots, so
102 // there's nothing to scan, and any roots they create during
103 // the concurrent phase will be caught by the write barrier.
104 work.stackRoots = allGsSnapshot()
105 work.nStackRoots = len(work.stackRoots)
107 work.markrootNext = 0
108 work.markrootJobs = uint32(fixedRootCount + work.nDataRoots + work.nBSSRoots + work.nSpanRoots + work.nStackRoots)
110 // Calculate base indexes of each root type
111 work.baseData = uint32(fixedRootCount)
112 work.baseBSS = work.baseData + uint32(work.nDataRoots)
113 work.baseSpans = work.baseBSS + uint32(work.nBSSRoots)
114 work.baseStacks = work.baseSpans + uint32(work.nSpanRoots)
115 work.baseEnd = work.baseStacks + uint32(work.nStackRoots)
118 // gcMarkRootCheck checks that all roots have been scanned. It is
119 // purely for debugging.
120 func gcMarkRootCheck() {
121 if work.markrootNext < work.markrootJobs {
122 print(work.markrootNext, " of ", work.markrootJobs, " markroot jobs done\n")
123 throw("left over markroot jobs")
126 // Check that stacks have been scanned.
128 // We only check the first nStackRoots Gs that we should have scanned.
129 // Since we don't care about newer Gs (see comment in
130 // gcMarkRootPrepare), no locking is required.
132 forEachGRace(func(gp *g) {
133 if i >= work.nStackRoots {
138 println("gp", gp, "goid", gp.goid,
139 "status", readgstatus(gp),
140 "gcscandone", gp.gcscandone)
141 throw("scan missed a g")
148 // ptrmask for an allocation containing a single pointer.
149 var oneptrmask = [...]uint8{1}
151 // markroot scans the i'th root.
153 // Preemption must be disabled (because this uses a gcWork).
155 // Returns the amount of GC work credit produced by the operation.
156 // If flushBgCredit is true, then that credit is also flushed
157 // to the background credit pool.
159 // nowritebarrier is only advisory here.
162 func markroot(gcw *gcWork, i uint32, flushBgCredit bool) int64 {
163 // Note: if you add a case here, please also update heapdump.go:dumproots.
165 var workCounter *atomic.Int64
167 case work.baseData <= i && i < work.baseBSS:
168 workCounter = &gcController.globalsScanWork
169 for _, datap := range activeModules() {
170 workDone += markrootBlock(datap.data, datap.edata-datap.data, datap.gcdatamask.bytedata, gcw, int(i-work.baseData))
173 case work.baseBSS <= i && i < work.baseSpans:
174 workCounter = &gcController.globalsScanWork
175 for _, datap := range activeModules() {
176 workDone += markrootBlock(datap.bss, datap.ebss-datap.bss, datap.gcbssmask.bytedata, gcw, int(i-work.baseBSS))
179 case i == fixedRootFinalizers:
180 for fb := allfin; fb != nil; fb = fb.alllink {
181 cnt := uintptr(atomic.Load(&fb.cnt))
182 scanblock(uintptr(unsafe.Pointer(&fb.fin[0])), cnt*unsafe.Sizeof(fb.fin[0]), &finptrmask[0], gcw, nil)
185 case i == fixedRootFreeGStacks:
186 // Switch to the system stack so we can call
188 systemstack(markrootFreeGStacks)
190 case work.baseSpans <= i && i < work.baseStacks:
191 // mark mspan.specials
192 markrootSpans(gcw, int(i-work.baseSpans))
195 // the rest is scanning goroutine stacks
196 workCounter = &gcController.stackScanWork
197 if i < work.baseStacks || work.baseEnd <= i {
199 print("runtime: markroot index ", i, " not in stack roots range [", work.baseStacks, ", ", work.baseEnd, ")\n")
200 throw("markroot: bad index")
202 gp := work.stackRoots[i-work.baseStacks]
204 // remember when we've first observed the G blocked
205 // needed only to output in traceback
206 status := readgstatus(gp) // We are not in a scan state
207 if (status == _Gwaiting || status == _Gsyscall) && gp.waitsince == 0 {
208 gp.waitsince = work.tstart
211 // scanstack must be done on the system stack in case
212 // we're trying to scan our own stack.
214 // If this is a self-scan, put the user G in
215 // _Gwaiting to prevent self-deadlock. It may
216 // already be in _Gwaiting if this is a mark
217 // worker or we're in mark termination.
218 userG := getg().m.curg
219 selfScan := gp == userG && readgstatus(userG) == _Grunning
221 casgstatus(userG, _Grunning, _Gwaiting)
222 userG.waitreason = waitReasonGarbageCollectionScan
225 // TODO: suspendG blocks (and spins) until gp
226 // stops, which may take a while for
227 // running goroutines. Consider doing this in
228 // two phases where the first is non-blocking:
229 // we scan the stacks we can and ask running
230 // goroutines to scan themselves; and the
232 stopped := suspendG(gp)
238 throw("g already scanned")
240 workDone += scanstack(gp, gcw)
245 casgstatus(userG, _Gwaiting, _Grunning)
249 if workCounter != nil && workDone != 0 {
250 workCounter.Add(workDone)
252 gcFlushBgCredit(workDone)
258 // markrootBlock scans the shard'th shard of the block of memory [b0,
259 // b0+n0), with the given pointer mask.
261 // Returns the amount of work done.
264 func markrootBlock(b0, n0 uintptr, ptrmask0 *uint8, gcw *gcWork, shard int) int64 {
265 if rootBlockBytes%(8*goarch.PtrSize) != 0 {
266 // This is necessary to pick byte offsets in ptrmask0.
267 throw("rootBlockBytes must be a multiple of 8*ptrSize")
270 // Note that if b0 is toward the end of the address space,
271 // then b0 + rootBlockBytes might wrap around.
272 // These tests are written to avoid any possible overflow.
273 off := uintptr(shard) * rootBlockBytes
278 ptrmask := (*uint8)(add(unsafe.Pointer(ptrmask0), uintptr(shard)*(rootBlockBytes/(8*goarch.PtrSize))))
279 n := uintptr(rootBlockBytes)
285 scanblock(b, n, ptrmask, gcw, nil)
289 // markrootFreeGStacks frees stacks of dead Gs.
291 // This does not free stacks of dead Gs cached on Ps, but having a few
292 // cached stacks around isn't a problem.
293 func markrootFreeGStacks() {
294 // Take list of dead Gs with stacks.
295 lock(&sched.gFree.lock)
296 list := sched.gFree.stack
297 sched.gFree.stack = gList{}
298 unlock(&sched.gFree.lock)
304 q := gQueue{list.head, list.head}
305 for gp := list.head.ptr(); gp != nil; gp = gp.schedlink.ptr() {
309 // Manipulate the queue directly since the Gs are
310 // already all linked the right way.
314 // Put Gs back on the free list.
315 lock(&sched.gFree.lock)
316 sched.gFree.noStack.pushAll(q)
317 unlock(&sched.gFree.lock)
320 // markrootSpans marks roots for one shard of markArenas.
323 func markrootSpans(gcw *gcWork, shard int) {
324 // Objects with finalizers have two GC-related invariants:
326 // 1) Everything reachable from the object must be marked.
327 // This ensures that when we pass the object to its finalizer,
328 // everything the finalizer can reach will be retained.
330 // 2) Finalizer specials (which are not in the garbage
331 // collected heap) are roots. In practice, this means the fn
332 // field must be scanned.
333 sg := mheap_.sweepgen
335 // Find the arena and page index into that arena for this shard.
336 ai := mheap_.markArenas[shard/(pagesPerArena/pagesPerSpanRoot)]
337 ha := mheap_.arenas[ai.l1()][ai.l2()]
338 arenaPage := uint(uintptr(shard) * pagesPerSpanRoot % pagesPerArena)
340 // Construct slice of bitmap which we'll iterate over.
341 specialsbits := ha.pageSpecials[arenaPage/8:]
342 specialsbits = specialsbits[:pagesPerSpanRoot/8]
343 for i := range specialsbits {
344 // Find set bits, which correspond to spans with specials.
345 specials := atomic.Load8(&specialsbits[i])
349 for j := uint(0); j < 8; j++ {
350 if specials&(1<<j) == 0 {
353 // Find the span for this bit.
355 // This value is guaranteed to be non-nil because having
356 // specials implies that the span is in-use, and since we're
357 // currently marking we can be sure that we don't have to worry
358 // about the span being freed and re-used.
359 s := ha.spans[arenaPage+uint(i)*8+j]
361 // The state must be mSpanInUse if the specials bit is set, so
362 // sanity check that.
363 if state := s.state.get(); state != mSpanInUse {
364 print("s.state = ", state, "\n")
365 throw("non in-use span found with specials bit set")
367 // Check that this span was swept (it may be cached or uncached).
368 if !useCheckmark && !(s.sweepgen == sg || s.sweepgen == sg+3) {
369 // sweepgen was updated (+2) during non-checkmark GC pass
370 print("sweep ", s.sweepgen, " ", sg, "\n")
371 throw("gc: unswept span")
374 // Lock the specials to prevent a special from being
375 // removed from the list while we're traversing it.
377 for sp := s.specials; sp != nil; sp = sp.next {
378 if sp.kind != _KindSpecialFinalizer {
381 // don't mark finalized object, but scan it so we
382 // retain everything it points to.
383 spf := (*specialfinalizer)(unsafe.Pointer(sp))
384 // A finalizer can be set for an inner byte of an object, find object beginning.
385 p := s.base() + uintptr(spf.special.offset)/s.elemsize*s.elemsize
387 // Mark everything that can be reached from
388 // the object (but *not* the object itself or
389 // we'll never collect it).
392 // The special itself is a root.
393 scanblock(uintptr(unsafe.Pointer(&spf.fn)), goarch.PtrSize, &oneptrmask[0], gcw, nil)
395 unlock(&s.speciallock)
400 // gcAssistAlloc performs GC work to make gp's assist debt positive.
401 // gp must be the calling user goroutine.
403 // This must be called with preemption enabled.
404 func gcAssistAlloc(gp *g) {
405 // Don't assist in non-preemptible contexts. These are
406 // generally fragile and won't allow the assist to block.
407 if getg() == gp.m.g0 {
410 if mp := getg().m; mp.locks > 0 || mp.preemptoff != "" {
416 if go119MemoryLimitSupport && gcCPULimiter.limiting() {
417 // If the CPU limiter is enabled, intentionally don't
418 // assist to reduce the amount of CPU time spent in the GC.
420 traceGCMarkAssistDone()
424 // Compute the amount of scan work we need to do to make the
425 // balance positive. When the required amount of work is low,
426 // we over-assist to build up credit for future allocations
427 // and amortize the cost of assisting.
428 assistWorkPerByte := gcController.assistWorkPerByte.Load()
429 assistBytesPerWork := gcController.assistBytesPerWork.Load()
430 debtBytes := -gp.gcAssistBytes
431 scanWork := int64(assistWorkPerByte * float64(debtBytes))
432 if scanWork < gcOverAssistWork {
433 scanWork = gcOverAssistWork
434 debtBytes = int64(assistBytesPerWork * float64(scanWork))
437 // Steal as much credit as we can from the background GC's
438 // scan credit. This is racy and may drop the background
439 // credit below 0 if two mutators steal at the same time. This
440 // will just cause steals to fail until credit is accumulated
441 // again, so in the long run it doesn't really matter, but we
442 // do have to handle the negative credit case.
443 bgScanCredit := atomic.Loadint64(&gcController.bgScanCredit)
445 if bgScanCredit > 0 {
446 if bgScanCredit < scanWork {
447 stolen = bgScanCredit
448 gp.gcAssistBytes += 1 + int64(assistBytesPerWork*float64(stolen))
451 gp.gcAssistBytes += debtBytes
453 atomic.Xaddint64(&gcController.bgScanCredit, -stolen)
458 // We were able to steal all of the credit we
461 traceGCMarkAssistDone()
467 if trace.enabled && !traced {
469 traceGCMarkAssistStart()
472 // Perform assist work
474 gcAssistAlloc1(gp, scanWork)
475 // The user stack may have moved, so this can't touch
476 // anything on it until it returns from systemstack.
479 completed := gp.param != nil
485 if gp.gcAssistBytes < 0 {
486 // We were unable steal enough credit or perform
487 // enough work to pay off the assist debt. We need to
488 // do one of these before letting the mutator allocate
489 // more to prevent over-allocation.
491 // If this is because we were preempted, reschedule
492 // and try some more.
498 // Add this G to an assist queue and park. When the GC
499 // has more background credit, it will satisfy queued
500 // assists before flushing to the global credit pool.
502 // Note that this does *not* get woken up when more
503 // work is added to the work list. The theory is that
504 // there wasn't enough work to do anyway, so we might
505 // as well let background marking take care of the
506 // work that is available.
511 // At this point either background GC has satisfied
512 // this G's assist debt, or the GC cycle is over.
515 traceGCMarkAssistDone()
519 // gcAssistAlloc1 is the part of gcAssistAlloc that runs on the system
520 // stack. This is a separate function to make it easier to see that
521 // we're not capturing anything from the user stack, since the user
522 // stack may move while we're in this function.
524 // gcAssistAlloc1 indicates whether this assist completed the mark
525 // phase by setting gp.param to non-nil. This can't be communicated on
526 // the stack since it may move.
529 func gcAssistAlloc1(gp *g, scanWork int64) {
530 // Clear the flag indicating that this assist completed the
534 if atomic.Load(&gcBlackenEnabled) == 0 {
535 // The gcBlackenEnabled check in malloc races with the
536 // store that clears it but an atomic check in every malloc
537 // would be a performance hit.
538 // Instead we recheck it here on the non-preemptable system
539 // stack to determine if we should perform an assist.
541 // GC is done, so ignore any remaining debt.
545 // Track time spent in this assist. Since we're on the
546 // system stack, this is non-preemptible, so we can
547 // just measure start and end time.
548 startTime := nanotime()
550 decnwait := atomic.Xadd(&work.nwait, -1)
551 if decnwait == work.nproc {
552 println("runtime: work.nwait =", decnwait, "work.nproc=", work.nproc)
553 throw("nwait > work.nprocs")
556 // gcDrainN requires the caller to be preemptible.
557 casgstatus(gp, _Grunning, _Gwaiting)
558 gp.waitreason = waitReasonGCAssistMarking
560 // drain own cached work first in the hopes that it
561 // will be more cache friendly.
562 gcw := &getg().m.p.ptr().gcw
563 workDone := gcDrainN(gcw, scanWork)
565 casgstatus(gp, _Gwaiting, _Grunning)
567 // Record that we did this much scan work.
569 // Back out the number of bytes of assist credit that
570 // this scan work counts for. The "1+" is a poor man's
571 // round-up, to ensure this adds credit even if
572 // assistBytesPerWork is very low.
573 assistBytesPerWork := gcController.assistBytesPerWork.Load()
574 gp.gcAssistBytes += 1 + int64(assistBytesPerWork*float64(workDone))
576 // If this is the last worker and we ran out of work,
577 // signal a completion point.
578 incnwait := atomic.Xadd(&work.nwait, +1)
579 if incnwait > work.nproc {
580 println("runtime: work.nwait=", incnwait,
581 "work.nproc=", work.nproc)
582 throw("work.nwait > work.nproc")
585 if incnwait == work.nproc && !gcMarkWorkAvailable(nil) {
586 // This has reached a background completion point. Set
587 // gp.param to a non-nil value to indicate this. It
588 // doesn't matter what we set it to (it just has to be
590 gp.param = unsafe.Pointer(gp)
593 duration := now - startTime
595 _p_.gcAssistTime += duration
596 if _p_.gcAssistTime > gcAssistTimeSlack {
597 assistTime := gcController.assistTime.Add(_p_.gcAssistTime)
599 gcCPULimiter.update(assistTime+mheap_.pages.scav.assistTime.Load(), now)
603 // gcWakeAllAssists wakes all currently blocked assists. This is used
604 // at the end of a GC cycle. gcBlackenEnabled must be false to prevent
605 // new assists from going to sleep after this point.
606 func gcWakeAllAssists() {
607 lock(&work.assistQueue.lock)
608 list := work.assistQueue.q.popList()
610 unlock(&work.assistQueue.lock)
613 // gcParkAssist puts the current goroutine on the assist queue and parks.
615 // gcParkAssist reports whether the assist is now satisfied. If it
616 // returns false, the caller must retry the assist.
617 func gcParkAssist() bool {
618 lock(&work.assistQueue.lock)
619 // If the GC cycle finished while we were getting the lock,
620 // exit the assist. The cycle can't finish while we hold the
622 if atomic.Load(&gcBlackenEnabled) == 0 {
623 unlock(&work.assistQueue.lock)
628 oldList := work.assistQueue.q
629 work.assistQueue.q.pushBack(gp)
631 // Recheck for background credit now that this G is in
632 // the queue, but can still back out. This avoids a
633 // race in case background marking has flushed more
634 // credit since we checked above.
635 if atomic.Loadint64(&gcController.bgScanCredit) > 0 {
636 work.assistQueue.q = oldList
637 if oldList.tail != 0 {
638 oldList.tail.ptr().schedlink.set(nil)
640 unlock(&work.assistQueue.lock)
644 goparkunlock(&work.assistQueue.lock, waitReasonGCAssistWait, traceEvGoBlockGC, 2)
648 // gcFlushBgCredit flushes scanWork units of background scan work
649 // credit. This first satisfies blocked assists on the
650 // work.assistQueue and then flushes any remaining credit to
651 // gcController.bgScanCredit.
653 // Write barriers are disallowed because this is used by gcDrain after
654 // it has ensured that all work is drained and this must preserve that
657 //go:nowritebarrierrec
658 func gcFlushBgCredit(scanWork int64) {
659 if work.assistQueue.q.empty() {
660 // Fast path; there are no blocked assists. There's a
661 // small window here where an assist may add itself to
662 // the blocked queue and park. If that happens, we'll
663 // just get it on the next flush.
664 atomic.Xaddint64(&gcController.bgScanCredit, scanWork)
668 assistBytesPerWork := gcController.assistBytesPerWork.Load()
669 scanBytes := int64(float64(scanWork) * assistBytesPerWork)
671 lock(&work.assistQueue.lock)
672 for !work.assistQueue.q.empty() && scanBytes > 0 {
673 gp := work.assistQueue.q.pop()
674 // Note that gp.gcAssistBytes is negative because gp
675 // is in debt. Think carefully about the signs below.
676 if scanBytes+gp.gcAssistBytes >= 0 {
677 // Satisfy this entire assist debt.
678 scanBytes += gp.gcAssistBytes
680 // It's important that we *not* put gp in
681 // runnext. Otherwise, it's possible for user
682 // code to exploit the GC worker's high
683 // scheduler priority to get itself always run
684 // before other goroutines and always in the
685 // fresh quantum started by GC.
688 // Partially satisfy this assist.
689 gp.gcAssistBytes += scanBytes
691 // As a heuristic, we move this assist to the
692 // back of the queue so that large assists
693 // can't clog up the assist queue and
694 // substantially delay small assists.
695 work.assistQueue.q.pushBack(gp)
701 // Convert from scan bytes back to work.
702 assistWorkPerByte := gcController.assistWorkPerByte.Load()
703 scanWork = int64(float64(scanBytes) * assistWorkPerByte)
704 atomic.Xaddint64(&gcController.bgScanCredit, scanWork)
706 unlock(&work.assistQueue.lock)
709 // scanstack scans gp's stack, greying all pointers found on the stack.
711 // Returns the amount of scan work performed, but doesn't update
712 // gcController.stackScanWork or flush any credit. Any background credit produced
713 // by this function should be flushed by its caller. scanstack itself can't
714 // safely flush because it may result in trying to wake up a goroutine that
715 // was just scanned, resulting in a self-deadlock.
717 // scanstack will also shrink the stack if it is safe to do so. If it
718 // is not, it schedules a stack shrink for the next synchronous safe
721 // scanstack is marked go:systemstack because it must not be preempted
722 // while using a workbuf.
726 func scanstack(gp *g, gcw *gcWork) int64 {
727 if readgstatus(gp)&_Gscan == 0 {
728 print("runtime:scanstack: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", hex(readgstatus(gp)), "\n")
729 throw("scanstack - bad status")
732 switch readgstatus(gp) &^ _Gscan {
734 print("runtime: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
735 throw("mark - bad status")
739 print("runtime: gp=", gp, ", goid=", gp.goid, ", gp->atomicstatus=", readgstatus(gp), "\n")
740 throw("scanstack: goroutine not stopped")
741 case _Grunnable, _Gsyscall, _Gwaiting:
746 throw("can't scan our own stack")
749 // scannedSize is the amount of work we'll be reporting.
751 // It is less than the allocated size (which is hi-lo).
753 if gp.syscallsp != 0 {
754 sp = gp.syscallsp // If in a system call this is the stack pointer (gp.sched.sp can be 0 in this case on Windows).
758 scannedSize := gp.stack.hi - sp
760 // Keep statistics for initial stack size calculation.
761 // Note that this accumulates the scanned size, not the allocated size.
762 p := getg().m.p.ptr()
763 p.scannedStackSize += uint64(scannedSize)
766 if isShrinkStackSafe(gp) {
767 // Shrink the stack if not much of it is being used.
770 // Otherwise, shrink the stack at the next sync safe point.
771 gp.preemptShrink = true
774 var state stackScanState
775 state.stack = gp.stack
778 println("stack trace goroutine", gp.goid)
781 if debugScanConservative && gp.asyncSafePoint {
782 print("scanning async preempted goroutine ", gp.goid, " stack [", hex(gp.stack.lo), ",", hex(gp.stack.hi), ")\n")
785 // Scan the saved context register. This is effectively a live
786 // register that gets moved back and forth between the
787 // register and sched.ctxt without a write barrier.
788 if gp.sched.ctxt != nil {
789 scanblock(uintptr(unsafe.Pointer(&gp.sched.ctxt)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
792 // Scan the stack. Accumulate a list of stack objects.
793 scanframe := func(frame *stkframe, unused unsafe.Pointer) bool {
794 scanframeworker(frame, &state, gcw)
797 gentraceback(^uintptr(0), ^uintptr(0), 0, gp, 0, nil, 0x7fffffff, scanframe, nil, 0)
799 // Find additional pointers that point into the stack from the heap.
800 // Currently this includes defers and panics. See also function copystack.
802 // Find and trace other pointers in defer records.
803 for d := gp._defer; d != nil; d = d.link {
805 // Scan the func value, which could be a stack allocated closure.
807 scanblock(uintptr(unsafe.Pointer(&d.fn)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
810 // The link field of a stack-allocated defer record might point
811 // to a heap-allocated defer record. Keep that heap record live.
812 scanblock(uintptr(unsafe.Pointer(&d.link)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
814 // Retain defers records themselves.
815 // Defer records might not be reachable from the G through regular heap
816 // tracing because the defer linked list might weave between the stack and the heap.
818 scanblock(uintptr(unsafe.Pointer(&d)), goarch.PtrSize, &oneptrmask[0], gcw, &state)
821 if gp._panic != nil {
822 // Panics are always stack allocated.
823 state.putPtr(uintptr(unsafe.Pointer(gp._panic)), false)
826 // Find and scan all reachable stack objects.
828 // The state's pointer queue prioritizes precise pointers over
829 // conservative pointers so that we'll prefer scanning stack
830 // objects precisely.
833 p, conservative := state.getPtr()
837 obj := state.findObject(p)
843 // We've already scanned this object.
846 obj.setRecord(nil) // Don't scan it again.
849 print(" live stkobj at", hex(state.stack.lo+uintptr(obj.off)), "of size", obj.size)
851 print(" (conservative)")
859 // This path is pretty unlikely, an object large enough
860 // to have a GC program allocated on the stack.
861 // We need some space to unpack the program into a straight
862 // bitmask, which we allocate/free here.
863 // TODO: it would be nice if there were a way to run a GC
864 // program without having to store all its bits. We'd have
865 // to change from a Lempel-Ziv style program to something else.
866 // Or we can forbid putting objects on stacks if they require
867 // a gc program (see issue 27447).
868 s = materializeGCProg(r.ptrdata(), gcdata)
869 gcdata = (*byte)(unsafe.Pointer(s.startAddr))
872 b := state.stack.lo + uintptr(obj.off)
874 scanConservative(b, r.ptrdata(), gcdata, gcw, &state)
876 scanblock(b, r.ptrdata(), gcdata, gcw, &state)
880 dematerializeGCProg(s)
884 // Deallocate object buffers.
885 // (Pointer buffers were all deallocated in the loop above.)
886 for state.head != nil {
890 for i := 0; i < x.nobj; i++ {
892 if obj.r == nil { // reachable
895 println(" dead stkobj at", hex(gp.stack.lo+uintptr(obj.off)), "of size", obj.r.size)
896 // Note: not necessarily really dead - only reachable-from-ptr dead.
900 putempty((*workbuf)(unsafe.Pointer(x)))
902 if state.buf != nil || state.cbuf != nil || state.freeBuf != nil {
903 throw("remaining pointer buffers")
905 return int64(scannedSize)
908 // Scan a stack frame: local variables and function arguments/results.
911 func scanframeworker(frame *stkframe, state *stackScanState, gcw *gcWork) {
912 if _DebugGC > 1 && frame.continpc != 0 {
913 print("scanframe ", funcname(frame.fn), "\n")
916 isAsyncPreempt := frame.fn.valid() && frame.fn.funcID == funcID_asyncPreempt
917 isDebugCall := frame.fn.valid() && frame.fn.funcID == funcID_debugCallV2
918 if state.conservative || isAsyncPreempt || isDebugCall {
919 if debugScanConservative {
920 println("conservatively scanning function", funcname(frame.fn), "at PC", hex(frame.continpc))
923 // Conservatively scan the frame. Unlike the precise
924 // case, this includes the outgoing argument space
925 // since we may have stopped while this function was
926 // setting up a call.
928 // TODO: We could narrow this down if the compiler
929 // produced a single map per function of stack slots
930 // and registers that ever contain a pointer.
932 size := frame.varp - frame.sp
934 scanConservative(frame.sp, size, nil, gcw, state)
938 // Scan arguments to this frame.
939 if frame.arglen != 0 {
940 // TODO: We could pass the entry argument map
941 // to narrow this down further.
942 scanConservative(frame.argp, frame.arglen, nil, gcw, state)
945 if isAsyncPreempt || isDebugCall {
946 // This function's frame contained the
947 // registers for the asynchronously stopped
948 // parent frame. Scan the parent
950 state.conservative = true
952 // We only wanted to scan those two frames
953 // conservatively. Clear the flag for future
955 state.conservative = false
960 locals, args, objs := getStackMap(frame, &state.cache, false)
962 // Scan local variables if stack frame has been allocated.
964 size := uintptr(locals.n) * goarch.PtrSize
965 scanblock(frame.varp-size, size, locals.bytedata, gcw, state)
970 scanblock(frame.argp, uintptr(args.n)*goarch.PtrSize, args.bytedata, gcw, state)
973 // Add all stack objects to the stack object list.
975 // varp is 0 for defers, where there are no locals.
976 // In that case, there can't be a pointer to its args, either.
977 // (And all args would be scanned above anyway.)
978 for i := range objs {
981 base := frame.varp // locals base pointer
983 base = frame.argp // arguments and return values base pointer
985 ptr := base + uintptr(off)
987 // object hasn't been allocated in the frame yet.
991 println("stkobj at", hex(ptr), "of size", obj.size)
993 state.addObject(ptr, obj)
998 type gcDrainFlags int
1001 gcDrainUntilPreempt gcDrainFlags = 1 << iota
1002 gcDrainFlushBgCredit
1007 // gcDrain scans roots and objects in work buffers, blackening grey
1008 // objects until it is unable to get more work. It may return before
1009 // GC is done; it's the caller's responsibility to balance work from
1012 // If flags&gcDrainUntilPreempt != 0, gcDrain returns when g.preempt
1015 // If flags&gcDrainIdle != 0, gcDrain returns when there is other work
1018 // If flags&gcDrainFractional != 0, gcDrain self-preempts when
1019 // pollFractionalWorkerExit() returns true. This implies
1022 // If flags&gcDrainFlushBgCredit != 0, gcDrain flushes scan work
1023 // credit to gcController.bgScanCredit every gcCreditSlack units of
1026 // gcDrain will always return if there is a pending STW.
1029 func gcDrain(gcw *gcWork, flags gcDrainFlags) {
1030 if !writeBarrier.needed {
1031 throw("gcDrain phase incorrect")
1035 preemptible := flags&gcDrainUntilPreempt != 0
1036 flushBgCredit := flags&gcDrainFlushBgCredit != 0
1037 idle := flags&gcDrainIdle != 0
1039 initScanWork := gcw.heapScanWork
1041 // checkWork is the scan work before performing the next
1042 // self-preempt check.
1043 checkWork := int64(1<<63 - 1)
1044 var check func() bool
1045 if flags&(gcDrainIdle|gcDrainFractional) != 0 {
1046 checkWork = initScanWork + drainCheckThreshold
1049 } else if flags&gcDrainFractional != 0 {
1050 check = pollFractionalWorkerExit
1054 // Drain root marking jobs.
1055 if work.markrootNext < work.markrootJobs {
1056 // Stop if we're preemptible or if someone wants to STW.
1057 for !(gp.preempt && (preemptible || atomic.Load(&sched.gcwaiting) != 0)) {
1058 job := atomic.Xadd(&work.markrootNext, +1) - 1
1059 if job >= work.markrootJobs {
1062 markroot(gcw, job, flushBgCredit)
1063 if check != nil && check() {
1069 // Drain heap marking jobs.
1070 // Stop if we're preemptible or if someone wants to STW.
1071 for !(gp.preempt && (preemptible || atomic.Load(&sched.gcwaiting) != 0)) {
1072 // Try to keep work available on the global queue. We used to
1073 // check if there were waiting workers, but it's better to
1074 // just keep work available than to make workers wait. In the
1075 // worst case, we'll do O(log(_WorkbufSize)) unnecessary
1081 b := gcw.tryGetFast()
1085 // Flush the write barrier
1086 // buffer; this may create
1093 // Unable to get work.
1098 // Flush background scan work credit to the global
1099 // account if we've accumulated enough locally so
1100 // mutator assists can draw on it.
1101 if gcw.heapScanWork >= gcCreditSlack {
1102 gcController.heapScanWork.Add(gcw.heapScanWork)
1104 gcFlushBgCredit(gcw.heapScanWork - initScanWork)
1107 checkWork -= gcw.heapScanWork
1108 gcw.heapScanWork = 0
1111 checkWork += drainCheckThreshold
1112 if check != nil && check() {
1120 // Flush remaining scan work credit.
1121 if gcw.heapScanWork > 0 {
1122 gcController.heapScanWork.Add(gcw.heapScanWork)
1124 gcFlushBgCredit(gcw.heapScanWork - initScanWork)
1126 gcw.heapScanWork = 0
1130 // gcDrainN blackens grey objects until it has performed roughly
1131 // scanWork units of scan work or the G is preempted. This is
1132 // best-effort, so it may perform less work if it fails to get a work
1133 // buffer. Otherwise, it will perform at least n units of work, but
1134 // may perform more because scanning is always done in whole object
1135 // increments. It returns the amount of scan work performed.
1137 // The caller goroutine must be in a preemptible state (e.g.,
1138 // _Gwaiting) to prevent deadlocks during stack scanning. As a
1139 // consequence, this must be called on the system stack.
1143 func gcDrainN(gcw *gcWork, scanWork int64) int64 {
1144 if !writeBarrier.needed {
1145 throw("gcDrainN phase incorrect")
1148 // There may already be scan work on the gcw, which we don't
1149 // want to claim was done by this call.
1150 workFlushed := -gcw.heapScanWork
1153 for !gp.preempt && workFlushed+gcw.heapScanWork < scanWork {
1154 // See gcDrain comment.
1159 b := gcw.tryGetFast()
1163 // Flush the write barrier buffer;
1164 // this may create more work.
1171 // Try to do a root job.
1172 if work.markrootNext < work.markrootJobs {
1173 job := atomic.Xadd(&work.markrootNext, +1) - 1
1174 if job < work.markrootJobs {
1175 workFlushed += markroot(gcw, job, false)
1179 // No heap or root jobs.
1185 // Flush background scan work credit.
1186 if gcw.heapScanWork >= gcCreditSlack {
1187 gcController.heapScanWork.Add(gcw.heapScanWork)
1188 workFlushed += gcw.heapScanWork
1189 gcw.heapScanWork = 0
1193 // Unlike gcDrain, there's no need to flush remaining work
1194 // here because this never flushes to bgScanCredit and
1195 // gcw.dispose will flush any remaining work to scanWork.
1197 return workFlushed + gcw.heapScanWork
1200 // scanblock scans b as scanobject would, but using an explicit
1201 // pointer bitmap instead of the heap bitmap.
1203 // This is used to scan non-heap roots, so it does not update
1204 // gcw.bytesMarked or gcw.heapScanWork.
1206 // If stk != nil, possible stack pointers are also reported to stk.putPtr.
1209 func scanblock(b0, n0 uintptr, ptrmask *uint8, gcw *gcWork, stk *stackScanState) {
1210 // Use local copies of original parameters, so that a stack trace
1211 // due to one of the throws below shows the original block
1216 for i := uintptr(0); i < n; {
1217 // Find bits for the next word.
1218 bits := uint32(*addb(ptrmask, i/(goarch.PtrSize*8)))
1220 i += goarch.PtrSize * 8
1223 for j := 0; j < 8 && i < n; j++ {
1225 // Same work as in scanobject; see comments there.
1226 p := *(*uintptr)(unsafe.Pointer(b + i))
1228 if obj, span, objIndex := findObject(p, b, i); obj != 0 {
1229 greyobject(obj, b, i, span, gcw, objIndex)
1230 } else if stk != nil && p >= stk.stack.lo && p < stk.stack.hi {
1231 stk.putPtr(p, false)
1241 // scanobject scans the object starting at b, adding pointers to gcw.
1242 // b must point to the beginning of a heap object or an oblet.
1243 // scanobject consults the GC bitmap for the pointer mask and the
1244 // spans for the size of the object.
1247 func scanobject(b uintptr, gcw *gcWork) {
1248 // Prefetch object before we scan it.
1250 // This will overlap fetching the beginning of the object with initial
1251 // setup before we start scanning the object.
1254 // Find the bits for b and the size of the object at b.
1256 // b is either the beginning of an object, in which case this
1257 // is the size of the object to scan, or it points to an
1258 // oblet, in which case we compute the size to scan below.
1259 hbits := heapBitsForAddr(b)
1260 s := spanOfUnchecked(b)
1263 throw("scanobject n == 0")
1266 if n > maxObletBytes {
1267 // Large object. Break into oblets for better
1268 // parallelism and lower latency.
1270 // It's possible this is a noscan object (not
1271 // from greyobject, but from other code
1272 // paths), in which case we must *not* enqueue
1273 // oblets since their bitmaps will be
1275 if s.spanclass.noscan() {
1276 // Bypass the whole scan.
1277 gcw.bytesMarked += uint64(n)
1281 // Enqueue the other oblets to scan later.
1282 // Some oblets may be in b's scalar tail, but
1283 // these will be marked as "no more pointers",
1284 // so we'll drop out immediately when we go to
1286 for oblet := b + maxObletBytes; oblet < s.base()+s.elemsize; oblet += maxObletBytes {
1287 if !gcw.putFast(oblet) {
1293 // Compute the size of the oblet. Since this object
1294 // must be a large object, s.base() is the beginning
1296 n = s.base() + s.elemsize - b
1297 if n > maxObletBytes {
1303 for i = 0; i < n; i, hbits = i+goarch.PtrSize, hbits.next() {
1304 // Load bits once. See CL 22712 and issue 16973 for discussion.
1305 bits := hbits.bits()
1306 if bits&bitScan == 0 {
1307 break // no more pointers in this object
1309 if bits&bitPointer == 0 {
1310 continue // not a pointer
1313 // Work here is duplicated in scanblock and above.
1314 // If you make changes here, make changes there too.
1315 obj := *(*uintptr)(unsafe.Pointer(b + i))
1317 // At this point we have extracted the next potential pointer.
1318 // Quickly filter out nil and pointers back to the current object.
1319 if obj != 0 && obj-b >= n {
1320 // Test if obj points into the Go heap and, if so,
1323 // Note that it's possible for findObject to
1324 // fail if obj points to a just-allocated heap
1325 // object because of a race with growing the
1326 // heap. In this case, we know the object was
1327 // just allocated and hence will be marked by
1328 // allocation itself.
1329 if obj, span, objIndex := findObject(obj, b, i); obj != 0 {
1330 greyobject(obj, b, i, span, gcw, objIndex)
1334 gcw.bytesMarked += uint64(n)
1335 gcw.heapScanWork += int64(i)
1338 // scanConservative scans block [b, b+n) conservatively, treating any
1339 // pointer-like value in the block as a pointer.
1341 // If ptrmask != nil, only words that are marked in ptrmask are
1342 // considered as potential pointers.
1344 // If state != nil, it's assumed that [b, b+n) is a block in the stack
1345 // and may contain pointers to stack objects.
1346 func scanConservative(b, n uintptr, ptrmask *uint8, gcw *gcWork, state *stackScanState) {
1347 if debugScanConservative {
1349 print("conservatively scanning [", hex(b), ",", hex(b+n), ")\n")
1350 hexdumpWords(b, b+n, func(p uintptr) byte {
1352 word := (p - b) / goarch.PtrSize
1353 bits := *addb(ptrmask, word/8)
1354 if (bits>>(word%8))&1 == 0 {
1359 val := *(*uintptr)(unsafe.Pointer(p))
1360 if state != nil && state.stack.lo <= val && val < state.stack.hi {
1364 span := spanOfHeap(val)
1368 idx := span.objIndex(val)
1369 if span.isFree(idx) {
1377 for i := uintptr(0); i < n; i += goarch.PtrSize {
1379 word := i / goarch.PtrSize
1380 bits := *addb(ptrmask, word/8)
1382 // Skip 8 words (the loop increment will do the 8th)
1384 // This must be the first time we've
1385 // seen this word of ptrmask, so i
1386 // must be 8-word-aligned, but check
1387 // our reasoning just in case.
1388 if i%(goarch.PtrSize*8) != 0 {
1389 throw("misaligned mask")
1391 i += goarch.PtrSize*8 - goarch.PtrSize
1394 if (bits>>(word%8))&1 == 0 {
1399 val := *(*uintptr)(unsafe.Pointer(b + i))
1401 // Check if val points into the stack.
1402 if state != nil && state.stack.lo <= val && val < state.stack.hi {
1403 // val may point to a stack object. This
1404 // object may be dead from last cycle and
1405 // hence may contain pointers to unallocated
1406 // objects, but unlike heap objects we can't
1407 // tell if it's already dead. Hence, if all
1408 // pointers to this object are from
1409 // conservative scanning, we have to scan it
1410 // defensively, too.
1411 state.putPtr(val, true)
1415 // Check if val points to a heap span.
1416 span := spanOfHeap(val)
1421 // Check if val points to an allocated object.
1422 idx := span.objIndex(val)
1423 if span.isFree(idx) {
1427 // val points to an allocated object. Mark it.
1428 obj := span.base() + idx*span.elemsize
1429 greyobject(obj, b, i, span, gcw, idx)
1433 // Shade the object if it isn't already.
1434 // The object is not nil and known to be in the heap.
1435 // Preemption must be disabled.
1438 func shade(b uintptr) {
1439 if obj, span, objIndex := findObject(b, 0, 0); obj != 0 {
1440 gcw := &getg().m.p.ptr().gcw
1441 greyobject(obj, 0, 0, span, gcw, objIndex)
1445 // obj is the start of an object with mark mbits.
1446 // If it isn't already marked, mark it and enqueue into gcw.
1447 // base and off are for debugging only and could be removed.
1449 // See also wbBufFlush1, which partially duplicates this logic.
1451 //go:nowritebarrierrec
1452 func greyobject(obj, base, off uintptr, span *mspan, gcw *gcWork, objIndex uintptr) {
1453 // obj should be start of allocation, and so must be at least pointer-aligned.
1454 if obj&(goarch.PtrSize-1) != 0 {
1455 throw("greyobject: obj not pointer-aligned")
1457 mbits := span.markBitsForIndex(objIndex)
1460 if setCheckmark(obj, base, off, mbits) {
1465 if debug.gccheckmark > 0 && span.isFree(objIndex) {
1466 print("runtime: marking free object ", hex(obj), " found at *(", hex(base), "+", hex(off), ")\n")
1467 gcDumpObject("base", base, off)
1468 gcDumpObject("obj", obj, ^uintptr(0))
1469 getg().m.traceback = 2
1470 throw("marking free object")
1473 // If marked we have nothing to do.
1474 if mbits.isMarked() {
1480 arena, pageIdx, pageMask := pageIndexOf(span.base())
1481 if arena.pageMarks[pageIdx]&pageMask == 0 {
1482 atomic.Or8(&arena.pageMarks[pageIdx], pageMask)
1485 // If this is a noscan object, fast-track it to black
1486 // instead of greying it.
1487 if span.spanclass.noscan() {
1488 gcw.bytesMarked += uint64(span.elemsize)
1493 // We're adding obj to P's local workbuf, so it's likely
1494 // this object will be processed soon by the same P.
1495 // Even if the workbuf gets flushed, there will likely still be
1496 // some benefit on platforms with inclusive shared caches.
1498 // Queue the obj for scanning.
1499 if !gcw.putFast(obj) {
1504 // gcDumpObject dumps the contents of obj for debugging and marks the
1505 // field at byte offset off in obj.
1506 func gcDumpObject(label string, obj, off uintptr) {
1508 print(label, "=", hex(obj))
1513 print(" s.base()=", hex(s.base()), " s.limit=", hex(s.limit), " s.spanclass=", s.spanclass, " s.elemsize=", s.elemsize, " s.state=")
1514 if state := s.state.get(); 0 <= state && int(state) < len(mSpanStateNames) {
1515 print(mSpanStateNames[state], "\n")
1517 print("unknown(", state, ")\n")
1522 if s.state.get() == mSpanManual && size == 0 {
1523 // We're printing something from a stack frame. We
1524 // don't know how big it is, so just show up to an
1526 size = off + goarch.PtrSize
1528 for i := uintptr(0); i < size; i += goarch.PtrSize {
1529 // For big objects, just print the beginning (because
1530 // that usually hints at the object's type) and the
1531 // fields around off.
1532 if !(i < 128*goarch.PtrSize || off-16*goarch.PtrSize < i && i < off+16*goarch.PtrSize) {
1540 print(" *(", label, "+", i, ") = ", hex(*(*uintptr)(unsafe.Pointer(obj + i))))
1551 // gcmarknewobject marks a newly allocated object black. obj must
1552 // not contain any non-nil pointers.
1554 // This is nosplit so it can manipulate a gcWork without preemption.
1558 func gcmarknewobject(span *mspan, obj, size, scanSize uintptr) {
1559 if useCheckmark { // The world should be stopped so this should not happen.
1560 throw("gcmarknewobject called while doing checkmark")
1564 objIndex := span.objIndex(obj)
1565 span.markBitsForIndex(objIndex).setMarked()
1568 arena, pageIdx, pageMask := pageIndexOf(span.base())
1569 if arena.pageMarks[pageIdx]&pageMask == 0 {
1570 atomic.Or8(&arena.pageMarks[pageIdx], pageMask)
1573 gcw := &getg().m.p.ptr().gcw
1574 gcw.bytesMarked += uint64(size)
1577 // gcMarkTinyAllocs greys all active tiny alloc blocks.
1579 // The world must be stopped.
1580 func gcMarkTinyAllocs() {
1581 assertWorldStopped()
1583 for _, p := range allp {
1585 if c == nil || c.tiny == 0 {
1588 _, span, objIndex := findObject(c.tiny, 0, 0)
1590 greyobject(c.tiny, 0, 0, span, gcw, objIndex)