1 // Copyright 2021 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.
9 "internal/goexperiment"
10 "runtime/internal/atomic"
11 _ "unsafe" // for go:linkname
14 // go119MemoryLimitSupport is a feature flag for a number of changes
15 // related to the memory limit feature (#48409). Disabling this flag
16 // disables those features, as well as the memory limit mechanism,
17 // which becomes a no-op.
18 const go119MemoryLimitSupport = true
21 // gcGoalUtilization is the goal CPU utilization for
22 // marking as a fraction of GOMAXPROCS.
24 // Increasing the goal utilization will shorten GC cycles as the GC
25 // has more resources behind it, lessening costs from the write barrier,
26 // but comes at the cost of increasing mutator latency.
27 gcGoalUtilization = gcBackgroundUtilization
29 // gcBackgroundUtilization is the fixed CPU utilization for background
30 // marking. It must be <= gcGoalUtilization. The difference between
31 // gcGoalUtilization and gcBackgroundUtilization will be made up by
32 // mark assists. The scheduler will aim to use within 50% of this
35 // As a general rule, there's little reason to set gcBackgroundUtilization
36 // < gcGoalUtilization. One reason might be in mostly idle applications,
37 // where goroutines are unlikely to assist at all, so the actual
38 // utilization will be lower than the goal. But this is moot point
39 // because the idle mark workers already soak up idle CPU resources.
40 // These two values are still kept separate however because they are
41 // distinct conceptually, and in previous iterations of the pacer the
42 // distinction was more important.
43 gcBackgroundUtilization = 0.25
45 // gcCreditSlack is the amount of scan work credit that can
46 // accumulate locally before updating gcController.heapScanWork and,
47 // optionally, gcController.bgScanCredit. Lower values give a more
48 // accurate assist ratio and make it more likely that assists will
49 // successfully steal background credit. Higher values reduce memory
53 // gcAssistTimeSlack is the nanoseconds of mutator assist time that
54 // can accumulate on a P before updating gcController.assistTime.
55 gcAssistTimeSlack = 5000
57 // gcOverAssistWork determines how many extra units of scan work a GC
58 // assist does when an assist happens. This amortizes the cost of an
59 // assist by pre-paying for this many bytes of future allocations.
60 gcOverAssistWork = 64 << 10
62 // defaultHeapMinimum is the value of heapMinimum for GOGC==100.
63 defaultHeapMinimum = (goexperiment.HeapMinimum512KiBInt)*(512<<10) +
64 (1-goexperiment.HeapMinimum512KiBInt)*(4<<20)
66 // maxStackScanSlack is the bytes of stack space allocated or freed
67 // that can accumulate on a P before updating gcController.stackSize.
68 maxStackScanSlack = 8 << 10
70 // memoryLimitHeapGoalHeadroom is the amount of headroom the pacer gives to
71 // the heap goal when operating in the memory-limited regime. That is,
72 // it'll reduce the heap goal by this many extra bytes off of the base
74 memoryLimitHeapGoalHeadroom = 1 << 20
77 // gcController implements the GC pacing controller that determines
78 // when to trigger concurrent garbage collection and how much marking
79 // work to do in mutator assists and background marking.
81 // It calculates the ratio between the allocation rate (in terms of CPU
82 // time) and the GC scan throughput to determine the heap size at which to
83 // trigger a GC cycle such that no GC assists are required to finish on time.
84 // This algorithm thus optimizes GC CPU utilization to the dedicated background
85 // mark utilization of 25% of GOMAXPROCS by minimizing GC assists.
86 // GOMAXPROCS. The high-level design of this algorithm is documented
87 // at https://github.com/golang/proposal/blob/master/design/44167-gc-pacer-redesign.md.
88 // See https://golang.org/s/go15gcpacing for additional historical context.
89 var gcController gcControllerState
91 type gcControllerState struct {
92 // Initialized from GOGC. GOGC=off means no GC.
93 gcPercent atomic.Int32
95 _ uint32 // padding so following 64-bit values are 8-byte aligned
97 // memoryLimit is the soft memory limit in bytes.
99 // Initialized from GOMEMLIMIT. GOMEMLIMIT=off is equivalent to MaxInt64
100 // which means no soft memory limit in practice.
102 // This is an int64 instead of a uint64 to more easily maintain parity with
103 // the SetMemoryLimit API, which sets a maximum at MaxInt64. This value
104 // should never be negative.
105 memoryLimit atomic.Int64
107 // heapMinimum is the minimum heap size at which to trigger GC.
108 // For small heaps, this overrides the usual GOGC*live set rule.
110 // When there is a very small live set but a lot of allocation, simply
111 // collecting when the heap reaches GOGC*live results in many GC
112 // cycles and high total per-GC overhead. This minimum amortizes this
113 // per-GC overhead while keeping the heap reasonably small.
115 // During initialization this is set to 4MB*GOGC/100. In the case of
116 // GOGC==0, this will set heapMinimum to 0, resulting in constant
117 // collection even when the heap size is small, which is useful for
121 // runway is the amount of runway in heap bytes allocated by the
122 // application that we want to give the GC once it starts.
124 // This is computed from consMark during mark termination.
127 // consMark is the estimated per-CPU consMark ratio for the application.
129 // It represents the ratio between the application's allocation
130 // rate, as bytes allocated per CPU-time, and the GC's scan rate,
131 // as bytes scanned per CPU-time.
132 // The units of this ratio are (B / cpu-ns) / (B / cpu-ns).
134 // At a high level, this value is computed as the bytes of memory
135 // allocated (cons) per unit of scan work completed (mark) in a GC
136 // cycle, divided by the CPU time spent on each activity.
138 // Updated at the end of each GC cycle, in endCycle.
141 // consMarkController holds the state for the mark-cons ratio
142 // estimation over time.
144 // Its purpose is to smooth out noisiness in the computation of
145 // consMark; see consMark for details.
146 consMarkController piController
148 _ uint32 // Padding for atomics on 32-bit platforms.
150 // gcPercentHeapGoal is the goal heapLive for when next GC ends derived
153 // Set to ^uint64(0) if gcPercent is disabled.
154 gcPercentHeapGoal atomic.Uint64
156 // sweepDistMinTrigger is the minimum trigger to ensure a minimum
159 // This bound is also special because it applies to both the trigger
160 // *and* the goal (all other trigger bounds must be based *on* the goal).
162 // It is computed ahead of time, at commit time. The theory is that,
163 // absent a sudden change to a parameter like gcPercent, the trigger
164 // will be chosen to always give the sweeper enough headroom. However,
165 // such a change might dramatically and suddenly move up the trigger,
166 // in which case we need to ensure the sweeper still has enough headroom.
167 sweepDistMinTrigger atomic.Uint64
169 // triggered is the point at which the current GC cycle actually triggered.
170 // Only valid during the mark phase of a GC cycle, otherwise set to ^uint64(0).
172 // Updated while the world is stopped.
175 // lastHeapGoal is the value of heapGoal at the moment the last GC
176 // ended. Note that this is distinct from the last value heapGoal had,
177 // because it could change if e.g. gcPercent changes.
179 // Read and written with the world stopped or with mheap_.lock held.
182 // heapLive is the number of bytes considered live by the GC.
183 // That is: retained by the most recent GC plus allocated
184 // since then. heapLive ≤ memstats.totalAlloc-memstats.totalFree, since
185 // heapAlloc includes unmarked objects that have not yet been swept (and
186 // hence goes up as we allocate and down as we sweep) while heapLive
187 // excludes these objects (and hence only goes up between GCs).
189 // To reduce contention, this is updated only when obtaining a span
190 // from an mcentral and at this point it counts all of the unallocated
191 // slots in that span (which will be allocated before that mcache
192 // obtains another span from that mcentral). Hence, it slightly
193 // overestimates the "true" live heap size. It's better to overestimate
194 // than to underestimate because 1) this triggers the GC earlier than
195 // necessary rather than potentially too late and 2) this leads to a
196 // conservative GC rate rather than a GC rate that is potentially too
199 // Whenever this is updated, call traceHeapAlloc() and
200 // this gcControllerState's revise() method.
201 heapLive atomic.Uint64
203 // heapScan is the number of bytes of "scannable" heap. This is the
204 // live heap (as counted by heapLive), but omitting no-scan objects and
205 // no-scan tails of objects.
207 // This value is fixed at the start of a GC cycle. It represents the
208 // maximum scannable heap.
209 heapScan atomic.Uint64
211 // lastHeapScan is the number of bytes of heap that were scanned
212 // last GC cycle. It is the same as heapMarked, but only
213 // includes the "scannable" parts of objects.
215 // Updated when the world is stopped.
218 // lastStackScan is the number of bytes of stack that were scanned
220 lastStackScan atomic.Uint64
222 // maxStackScan is the amount of allocated goroutine stack space in
223 // use by goroutines.
225 // This number tracks allocated goroutine stack space rather than used
226 // goroutine stack space (i.e. what is actually scanned) because used
227 // goroutine stack space is much harder to measure cheaply. By using
228 // allocated space, we make an overestimate; this is OK, it's better
229 // to conservatively overcount than undercount.
230 maxStackScan atomic.Uint64
232 // globalsScan is the total amount of global variable space
233 // that is scannable.
234 globalsScan atomic.Uint64
236 // heapMarked is the number of bytes marked by the previous
237 // GC. After mark termination, heapLive == heapMarked, but
238 // unlike heapLive, heapMarked does not change until the
239 // next mark termination.
242 // heapScanWork is the total heap scan work performed this cycle.
243 // stackScanWork is the total stack scan work performed this cycle.
244 // globalsScanWork is the total globals scan work performed this cycle.
246 // These are updated atomically during the cycle. Updates occur in
247 // bounded batches, since they are both written and read
248 // throughout the cycle. At the end of the cycle, heapScanWork is how
249 // much of the retained heap is scannable.
251 // Currently these are measured in bytes. For most uses, this is an
252 // opaque unit of work, but for estimation the definition is important.
254 // Note that stackScanWork includes only stack space scanned, not all
255 // of the allocated stack.
256 heapScanWork atomic.Int64
257 stackScanWork atomic.Int64
258 globalsScanWork atomic.Int64
260 // bgScanCredit is the scan work credit accumulated by the concurrent
261 // background scan. This credit is accumulated by the background scan
262 // and stolen by mutator assists. Updates occur in bounded batches,
263 // since it is both written and read throughout the cycle.
264 bgScanCredit atomic.Int64
266 // assistTime is the nanoseconds spent in mutator assists
267 // during this cycle. This is updated atomically, and must also
268 // be updated atomically even during a STW, because it is read
269 // by sysmon. Updates occur in bounded batches, since it is both
270 // written and read throughout the cycle.
271 assistTime atomic.Int64
273 // dedicatedMarkTime is the nanoseconds spent in dedicated mark workers
274 // during this cycle. This is updated at the end of the concurrent mark
276 dedicatedMarkTime atomic.Int64
278 // fractionalMarkTime is the nanoseconds spent in the fractional mark
279 // worker during this cycle. This is updated throughout the cycle and
280 // will be up-to-date if the fractional mark worker is not currently
282 fractionalMarkTime atomic.Int64
284 // idleMarkTime is the nanoseconds spent in idle marking during this
285 // cycle. This is updated throughout the cycle.
286 idleMarkTime atomic.Int64
288 // markStartTime is the absolute start time in nanoseconds
289 // that assists and background mark workers started.
292 // dedicatedMarkWorkersNeeded is the number of dedicated mark
293 // workers that need to be started. This is computed at the
294 // beginning of each cycle and decremented atomically as
295 // dedicated mark workers get started.
296 dedicatedMarkWorkersNeeded int64
298 // idleMarkWorkers is two packed int32 values in a single uint64.
299 // These two values are always updated simultaneously.
301 // The bottom int32 is the current number of idle mark workers executing.
303 // The top int32 is the maximum number of idle mark workers allowed to
304 // execute concurrently. Normally, this number is just gomaxprocs. However,
305 // during periodic GC cycles it is set to 0 because the system is idle
306 // anyway; there's no need to go full blast on all of GOMAXPROCS.
308 // The maximum number of idle mark workers is used to prevent new workers
309 // from starting, but it is not a hard maximum. It is possible (but
310 // exceedingly rare) for the current number of idle mark workers to
311 // transiently exceed the maximum. This could happen if the maximum changes
312 // just after a GC ends, and an M with no P.
314 // Note that if we have no dedicated mark workers, we set this value to
315 // 1 in this case we only have fractional GC workers which aren't scheduled
316 // strictly enough to ensure GC progress. As a result, idle-priority mark
317 // workers are vital to GC progress in these situations.
319 // For example, consider a situation in which goroutines block on the GC
320 // (such as via runtime.GOMAXPROCS) and only fractional mark workers are
321 // scheduled (e.g. GOMAXPROCS=1). Without idle-priority mark workers, the
322 // last running M might skip scheduling a fractional mark worker if its
323 // utilization goal is met, such that once it goes to sleep (because there's
324 // nothing to do), there will be nothing else to spin up a new M for the
325 // fractional worker in the future, stalling GC progress and causing a
326 // deadlock. However, idle-priority workers will *always* run when there is
327 // nothing left to do, ensuring the GC makes progress.
329 // See github.com/golang/go/issues/44163 for more details.
330 idleMarkWorkers atomic.Uint64
332 // assistWorkPerByte is the ratio of scan work to allocated
333 // bytes that should be performed by mutator assists. This is
334 // computed at the beginning of each cycle and updated every
335 // time heapScan is updated.
336 assistWorkPerByte atomic.Float64
338 // assistBytesPerWork is 1/assistWorkPerByte.
340 // Note that because this is read and written independently
341 // from assistWorkPerByte users may notice a skew between
342 // the two values, and such a state should be safe.
343 assistBytesPerWork atomic.Float64
345 // fractionalUtilizationGoal is the fraction of wall clock
346 // time that should be spent in the fractional mark worker on
347 // each P that isn't running a dedicated worker.
349 // For example, if the utilization goal is 25% and there are
350 // no dedicated workers, this will be 0.25. If the goal is
351 // 25%, there is one dedicated worker, and GOMAXPROCS is 5,
352 // this will be 0.05 to make up the missing 5%.
354 // If this is zero, no fractional workers are needed.
355 fractionalUtilizationGoal float64
357 // These memory stats are effectively duplicates of fields from
358 // memstats.heapStats but are updated atomically or with the world
359 // stopped and don't provide the same consistency guarantees.
361 // Because the runtime is responsible for managing a memory limit, it's
362 // useful to couple these stats more tightly to the gcController, which
363 // is intimately connected to how that memory limit is maintained.
364 heapInUse sysMemStat // bytes in mSpanInUse spans
365 heapReleased sysMemStat // bytes released to the OS
366 heapFree sysMemStat // bytes not in any span, but not released to the OS
367 totalAlloc atomic.Uint64 // total bytes allocated
368 totalFree atomic.Uint64 // total bytes freed
369 mappedReady atomic.Uint64 // total virtual memory in the Ready state (see mem.go).
371 // test indicates that this is a test-only copy of gcControllerState.
377 func (c *gcControllerState) init(gcPercent int32, memoryLimit int64) {
378 c.heapMinimum = defaultHeapMinimum
379 c.triggered = ^uint64(0)
381 c.consMarkController = piController{
382 // Tuned first via the Ziegler-Nichols process in simulation,
383 // then the integral time was manually tuned against real-world
384 // applications to deal with noisiness in the measured cons/mark
389 // Set a high reset time in GC cycles.
390 // This is inversely proportional to the rate at which we
391 // accumulate error from clipping. By making this very high
392 // we make the accumulation slow. In general, clipping is
393 // OK in our situation, hence the choice.
395 // Tune this if we get unintended effects from clipping for
402 c.setGCPercent(gcPercent)
403 c.setMemoryLimit(memoryLimit)
404 c.commit(true) // No sweep phase in the first GC cycle.
405 // N.B. Don't bother calling traceHeapGoal. Tracing is never enabled at
406 // initialization time.
407 // N.B. No need to call revise; there's no GC enabled during
411 // startCycle resets the GC controller's state and computes estimates
412 // for a new GC cycle. The caller must hold worldsema and the world
414 func (c *gcControllerState) startCycle(markStartTime int64, procs int, trigger gcTrigger) {
415 c.heapScanWork.Store(0)
416 c.stackScanWork.Store(0)
417 c.globalsScanWork.Store(0)
418 c.bgScanCredit.Store(0)
419 c.assistTime.Store(0)
420 c.dedicatedMarkTime.Store(0)
421 c.fractionalMarkTime.Store(0)
422 c.idleMarkTime.Store(0)
423 c.markStartTime = markStartTime
425 // TODO(mknyszek): This is supposed to be the actual trigger point for the heap, but
426 // causes regressions in memory use. The cause is that the PI controller used to smooth
427 // the cons/mark ratio measurements tends to flail when using the less accurate precomputed
428 // trigger for the cons/mark calculation, and this results in the controller being more
429 // conservative about steady-states it tries to find in the future.
431 // This conservatism is transient, but these transient states tend to matter for short-lived
432 // programs, especially because the PI controller is overdamped, partially because it is
433 // configured with a relatively large time constant.
435 // Ultimately, I think this is just two mistakes piled on one another: the choice of a swingy
436 // smoothing function that recalls a fairly long history (due to its overdamped time constant)
437 // coupled with an inaccurate cons/mark calculation. It just so happens this works better
438 // today, and it makes it harder to change things in the future.
440 // This is described in #53738. Fix this for #53892 by changing back to the actual trigger
441 // point and simplifying the smoothing function.
442 heapTrigger, heapGoal := c.trigger()
443 c.triggered = heapTrigger
445 // Compute the background mark utilization goal. In general,
446 // this may not come out exactly. We round the number of
447 // dedicated workers so that the utilization is closest to
448 // 25%. For small GOMAXPROCS, this would introduce too much
449 // error, so we add fractional workers in that case.
450 totalUtilizationGoal := float64(procs) * gcBackgroundUtilization
451 c.dedicatedMarkWorkersNeeded = int64(totalUtilizationGoal + 0.5)
452 utilError := float64(c.dedicatedMarkWorkersNeeded)/totalUtilizationGoal - 1
453 const maxUtilError = 0.3
454 if utilError < -maxUtilError || utilError > maxUtilError {
455 // Rounding put us more than 30% off our goal. With
456 // gcBackgroundUtilization of 25%, this happens for
457 // GOMAXPROCS<=3 or GOMAXPROCS=6. Enable fractional
458 // workers to compensate.
459 if float64(c.dedicatedMarkWorkersNeeded) > totalUtilizationGoal {
460 // Too many dedicated workers.
461 c.dedicatedMarkWorkersNeeded--
463 c.fractionalUtilizationGoal = (totalUtilizationGoal - float64(c.dedicatedMarkWorkersNeeded)) / float64(procs)
465 c.fractionalUtilizationGoal = 0
468 // In STW mode, we just want dedicated workers.
469 if debug.gcstoptheworld > 0 {
470 c.dedicatedMarkWorkersNeeded = int64(procs)
471 c.fractionalUtilizationGoal = 0
475 for _, p := range allp {
477 p.gcFractionalMarkTime = 0
480 if trigger.kind == gcTriggerTime {
481 // During a periodic GC cycle, reduce the number of idle mark workers
482 // required. However, we need at least one dedicated mark worker or
483 // idle GC worker to ensure GC progress in some scenarios (see comment
484 // on maxIdleMarkWorkers).
485 if c.dedicatedMarkWorkersNeeded > 0 {
486 c.setMaxIdleMarkWorkers(0)
488 // TODO(mknyszek): The fundamental reason why we need this is because
489 // we can't count on the fractional mark worker to get scheduled.
490 // Fix that by ensuring it gets scheduled according to its quota even
491 // if the rest of the application is idle.
492 c.setMaxIdleMarkWorkers(1)
495 // N.B. gomaxprocs and dedicatedMarkWorkersNeeded is guaranteed not to
496 // change during a GC cycle.
497 c.setMaxIdleMarkWorkers(int32(procs) - int32(c.dedicatedMarkWorkersNeeded))
500 // Compute initial values for controls that are updated
501 // throughout the cycle.
504 if debug.gcpacertrace > 0 {
505 assistRatio := c.assistWorkPerByte.Load()
506 print("pacer: assist ratio=", assistRatio,
507 " (scan ", gcController.heapScan.Load()>>20, " MB in ",
508 work.initialHeapLive>>20, "->",
509 heapGoal>>20, " MB)",
510 " workers=", c.dedicatedMarkWorkersNeeded,
511 "+", c.fractionalUtilizationGoal, "\n")
515 // revise updates the assist ratio during the GC cycle to account for
516 // improved estimates. This should be called whenever gcController.heapScan,
517 // gcController.heapLive, or if any inputs to gcController.heapGoal are
518 // updated. It is safe to call concurrently, but it may race with other
521 // The result of this race is that the two assist ratio values may not line
522 // up or may be stale. In practice this is OK because the assist ratio
523 // moves slowly throughout a GC cycle, and the assist ratio is a best-effort
524 // heuristic anyway. Furthermore, no part of the heuristic depends on
525 // the two assist ratio values being exact reciprocals of one another, since
526 // the two values are used to convert values from different sources.
528 // The worst case result of this raciness is that we may miss a larger shift
529 // in the ratio (say, if we decide to pace more aggressively against the
530 // hard heap goal) but even this "hard goal" is best-effort (see #40460).
531 // The dedicated GC should ensure we don't exceed the hard goal by too much
532 // in the rare case we do exceed it.
534 // It should only be called when gcBlackenEnabled != 0 (because this
535 // is when assists are enabled and the necessary statistics are
537 func (c *gcControllerState) revise() {
538 gcPercent := c.gcPercent.Load()
540 // If GC is disabled but we're running a forced GC,
541 // act like GOGC is huge for the below calculations.
544 live := c.heapLive.Load()
545 scan := c.heapScan.Load()
546 work := c.heapScanWork.Load() + c.stackScanWork.Load() + c.globalsScanWork.Load()
548 // Assume we're under the soft goal. Pace GC to complete at
549 // heapGoal assuming the heap is in steady-state.
550 heapGoal := int64(c.heapGoal())
552 // The expected scan work is computed as the amount of bytes scanned last
553 // GC cycle (both heap and stack), plus our estimate of globals work for this cycle.
554 scanWorkExpected := int64(c.lastHeapScan + c.lastStackScan.Load() + c.globalsScan.Load())
556 // maxScanWork is a worst-case estimate of the amount of scan work that
557 // needs to be performed in this GC cycle. Specifically, it represents
558 // the case where *all* scannable memory turns out to be live, and
559 // *all* allocated stack space is scannable.
560 maxStackScan := c.maxStackScan.Load()
561 maxScanWork := int64(scan + maxStackScan + c.globalsScan.Load())
562 if work > scanWorkExpected {
563 // We've already done more scan work than expected. Because our expectation
564 // is based on a steady-state scannable heap size, we assume this means our
565 // heap is growing. Compute a new heap goal that takes our existing runway
566 // computed for scanWorkExpected and extrapolates it to maxScanWork, the worst-case
567 // scan work. This keeps our assist ratio stable if the heap continues to grow.
569 // The effect of this mechanism is that assists stay flat in the face of heap
570 // growths. It's OK to use more memory this cycle to scan all the live heap,
571 // because the next GC cycle is inevitably going to use *at least* that much
573 extHeapGoal := int64(float64(heapGoal-int64(c.triggered))/float64(scanWorkExpected)*float64(maxScanWork)) + int64(c.triggered)
574 scanWorkExpected = maxScanWork
576 // hardGoal is a hard limit on the amount that we're willing to push back the
577 // heap goal, and that's twice the heap goal (i.e. if GOGC=100 and the heap and/or
578 // stacks and/or globals grow to twice their size, this limits the current GC cycle's
579 // growth to 4x the original live heap's size).
581 // This maintains the invariant that we use no more memory than the next GC cycle
583 hardGoal := int64((1.0 + float64(gcPercent)/100.0) * float64(heapGoal))
584 if extHeapGoal > hardGoal {
585 extHeapGoal = hardGoal
587 heapGoal = extHeapGoal
589 if int64(live) > heapGoal {
590 // We're already past our heap goal, even the extrapolated one.
591 // Leave ourselves some extra runway, so in the worst case we
592 // finish by that point.
593 const maxOvershoot = 1.1
594 heapGoal = int64(float64(heapGoal) * maxOvershoot)
596 // Compute the upper bound on the scan work remaining.
597 scanWorkExpected = maxScanWork
600 // Compute the remaining scan work estimate.
602 // Note that we currently count allocations during GC as both
603 // scannable heap (heapScan) and scan work completed
604 // (scanWork), so allocation will change this difference
605 // slowly in the soft regime and not at all in the hard
607 scanWorkRemaining := scanWorkExpected - work
608 if scanWorkRemaining < 1000 {
609 // We set a somewhat arbitrary lower bound on
610 // remaining scan work since if we aim a little high,
611 // we can miss by a little.
613 // We *do* need to enforce that this is at least 1,
614 // since marking is racy and double-scanning objects
615 // may legitimately make the remaining scan work
616 // negative, even in the hard goal regime.
617 scanWorkRemaining = 1000
620 // Compute the heap distance remaining.
621 heapRemaining := heapGoal - int64(live)
622 if heapRemaining <= 0 {
623 // This shouldn't happen, but if it does, avoid
624 // dividing by zero or setting the assist negative.
628 // Compute the mutator assist ratio so by the time the mutator
629 // allocates the remaining heap bytes up to heapGoal, it will
630 // have done (or stolen) the remaining amount of scan work.
631 // Note that the assist ratio values are updated atomically
632 // but not together. This means there may be some degree of
633 // skew between the two values. This is generally OK as the
634 // values shift relatively slowly over the course of a GC
636 assistWorkPerByte := float64(scanWorkRemaining) / float64(heapRemaining)
637 assistBytesPerWork := float64(heapRemaining) / float64(scanWorkRemaining)
638 c.assistWorkPerByte.Store(assistWorkPerByte)
639 c.assistBytesPerWork.Store(assistBytesPerWork)
642 // endCycle computes the consMark estimate for the next cycle.
643 // userForced indicates whether the current GC cycle was forced
644 // by the application.
645 func (c *gcControllerState) endCycle(now int64, procs int, userForced bool) {
646 // Record last heap goal for the scavenger.
647 // We'll be updating the heap goal soon.
648 gcController.lastHeapGoal = c.heapGoal()
650 // Compute the duration of time for which assists were turned on.
651 assistDuration := now - c.markStartTime
653 // Assume background mark hit its utilization goal.
654 utilization := gcBackgroundUtilization
655 // Add assist utilization; avoid divide by zero.
656 if assistDuration > 0 {
657 utilization += float64(c.assistTime.Load()) / float64(assistDuration*int64(procs))
660 if c.heapLive.Load() <= c.triggered {
661 // Shouldn't happen, but let's be very safe about this in case the
662 // GC is somehow extremely short.
664 // In this case though, the only reasonable value for c.heapLive-c.triggered
665 // would be 0, which isn't really all that useful, i.e. the GC was so short
666 // that it didn't matter.
668 // Ignore this case and don't update anything.
671 idleUtilization := 0.0
672 if assistDuration > 0 {
673 idleUtilization = float64(c.idleMarkTime.Load()) / float64(assistDuration*int64(procs))
675 // Determine the cons/mark ratio.
677 // The units we want for the numerator and denominator are both B / cpu-ns.
678 // We get this by taking the bytes allocated or scanned, and divide by the amount of
679 // CPU time it took for those operations. For allocations, that CPU time is
681 // assistDuration * procs * (1 - utilization)
683 // Where utilization includes just background GC workers and assists. It does *not*
684 // include idle GC work time, because in theory the mutator is free to take that at
687 // For scanning, that CPU time is
689 // assistDuration * procs * (utilization + idleUtilization)
691 // In this case, we *include* idle utilization, because that is additional CPU time that the
692 // the GC had available to it.
694 // In effect, idle GC time is sort of double-counted here, but it's very weird compared
695 // to other kinds of GC work, because of how fluid it is. Namely, because the mutator is
696 // *always* free to take it.
698 // So this calculation is really:
699 // (heapLive-trigger) / (assistDuration * procs * (1-utilization)) /
700 // (scanWork) / (assistDuration * procs * (utilization+idleUtilization)
702 // Note that because we only care about the ratio, assistDuration and procs cancel out.
703 scanWork := c.heapScanWork.Load() + c.stackScanWork.Load() + c.globalsScanWork.Load()
704 currentConsMark := (float64(c.heapLive.Load()-c.triggered) * (utilization + idleUtilization)) /
705 (float64(scanWork) * (1 - utilization))
707 // Update cons/mark controller. The time period for this is 1 GC cycle.
709 // This use of a PI controller might seem strange. So, here's an explanation:
711 // currentConsMark represents the consMark we *should've* had to be perfectly
712 // on-target for this cycle. Given that we assume the next GC will be like this
713 // one in the steady-state, it stands to reason that we should just pick that
714 // as our next consMark. In practice, however, currentConsMark is too noisy:
715 // we're going to be wildly off-target in each GC cycle if we do that.
717 // What we do instead is make a long-term assumption: there is some steady-state
718 // consMark value, but it's obscured by noise. By constantly shooting for this
719 // noisy-but-perfect consMark value, the controller will bounce around a bit,
720 // but its average behavior, in aggregate, should be less noisy and closer to
721 // the true long-term consMark value, provided its tuned to be slightly overdamped.
723 oldConsMark := c.consMark
724 c.consMark, ok = c.consMarkController.next(c.consMark, currentConsMark, 1.0)
726 // The error spiraled out of control. This is incredibly unlikely seeing
727 // as this controller is essentially just a smoothing function, but it might
728 // mean that something went very wrong with how currentConsMark was calculated.
729 // Just reset consMark and keep going.
733 if debug.gcpacertrace > 0 {
735 goal := gcGoalUtilization * 100
736 print("pacer: ", int(utilization*100), "% CPU (", int(goal), " exp.) for ")
737 print(c.heapScanWork.Load(), "+", c.stackScanWork.Load(), "+", c.globalsScanWork.Load(), " B work (", c.lastHeapScan+c.lastStackScan.Load()+c.globalsScan.Load(), " B exp.) ")
738 live := c.heapLive.Load()
739 print("in ", c.triggered, " B -> ", live, " B (∆goal ", int64(live)-int64(c.lastHeapGoal), ", cons/mark ", oldConsMark, ")")
741 print("[controller reset]")
748 // enlistWorker encourages another dedicated mark worker to start on
749 // another P if there are spare worker slots. It is used by putfull
750 // when more work is made available.
753 func (c *gcControllerState) enlistWorker() {
754 // If there are idle Ps, wake one so it will run an idle worker.
755 // NOTE: This is suspected of causing deadlocks. See golang.org/issue/19112.
757 // if atomic.Load(&sched.npidle) != 0 && atomic.Load(&sched.nmspinning) == 0 {
762 // There are no idle Ps. If we need more dedicated workers,
763 // try to preempt a running P so it will switch to a worker.
764 if c.dedicatedMarkWorkersNeeded <= 0 {
767 // Pick a random other P to preempt.
772 if gp == nil || gp.m == nil || gp.m.p == 0 {
775 myID := gp.m.p.ptr().id
776 for tries := 0; tries < 5; tries++ {
777 id := int32(fastrandn(uint32(gomaxprocs - 1)))
782 if p.status != _Prunning {
791 // findRunnableGCWorker returns a background mark worker for pp if it
792 // should be run. This must only be called when gcBlackenEnabled != 0.
793 func (c *gcControllerState) findRunnableGCWorker(pp *p, now int64) (*g, int64) {
794 if gcBlackenEnabled == 0 {
795 throw("gcControllerState.findRunnable: blackening not enabled")
798 // Since we have the current time, check if the GC CPU limiter
799 // hasn't had an update in a while. This check is necessary in
800 // case the limiter is on but hasn't been checked in a while and
801 // so may have left sufficient headroom to turn off again.
805 if gcCPULimiter.needUpdate(now) {
806 gcCPULimiter.update(now)
809 if !gcMarkWorkAvailable(pp) {
810 // No work to be done right now. This can happen at
811 // the end of the mark phase when there are still
812 // assists tapering off. Don't bother running a worker
813 // now because it'll just return immediately.
817 // Grab a worker before we commit to running below.
818 node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
820 // There is at least one worker per P, so normally there are
821 // enough workers to run on all Ps, if necessary. However, once
822 // a worker enters gcMarkDone it may park without rejoining the
823 // pool, thus freeing a P with no corresponding worker.
824 // gcMarkDone never depends on another worker doing work, so it
825 // is safe to simply do nothing here.
827 // If gcMarkDone bails out without completing the mark phase,
828 // it will always do so with queued global work. Thus, that P
829 // will be immediately eligible to re-run the worker G it was
830 // just using, ensuring work can complete.
834 decIfPositive := func(ptr *int64) bool {
836 v := atomic.Loadint64(ptr)
841 if atomic.Casint64(ptr, v, v-1) {
847 if decIfPositive(&c.dedicatedMarkWorkersNeeded) {
848 // This P is now dedicated to marking until the end of
849 // the concurrent mark phase.
850 pp.gcMarkWorkerMode = gcMarkWorkerDedicatedMode
851 } else if c.fractionalUtilizationGoal == 0 {
852 // No need for fractional workers.
853 gcBgMarkWorkerPool.push(&node.node)
856 // Is this P behind on the fractional utilization
859 // This should be kept in sync with pollFractionalWorkerExit.
860 delta := now - c.markStartTime
861 if delta > 0 && float64(pp.gcFractionalMarkTime)/float64(delta) > c.fractionalUtilizationGoal {
862 // Nope. No need to run a fractional worker.
863 gcBgMarkWorkerPool.push(&node.node)
866 // Run a fractional worker.
867 pp.gcMarkWorkerMode = gcMarkWorkerFractionalMode
870 // Run the background mark worker.
872 casgstatus(gp, _Gwaiting, _Grunnable)
879 // resetLive sets up the controller state for the next mark phase after the end
880 // of the previous one. Must be called after endCycle and before commit, before
881 // the world is started.
883 // The world must be stopped.
884 func (c *gcControllerState) resetLive(bytesMarked uint64) {
885 c.heapMarked = bytesMarked
886 c.heapLive.Store(bytesMarked)
887 c.heapScan.Store(uint64(c.heapScanWork.Load()))
888 c.lastHeapScan = uint64(c.heapScanWork.Load())
889 c.lastStackScan.Store(uint64(c.stackScanWork.Load()))
890 c.triggered = ^uint64(0) // Reset triggered.
892 // heapLive was updated, so emit a trace event.
894 traceHeapAlloc(bytesMarked)
898 // markWorkerStop must be called whenever a mark worker stops executing.
900 // It updates mark work accounting in the controller by a duration of
901 // work in nanoseconds and other bookkeeping.
903 // Safe to execute at any time.
904 func (c *gcControllerState) markWorkerStop(mode gcMarkWorkerMode, duration int64) {
906 case gcMarkWorkerDedicatedMode:
907 c.dedicatedMarkTime.Add(duration)
908 atomic.Xaddint64(&c.dedicatedMarkWorkersNeeded, 1)
909 case gcMarkWorkerFractionalMode:
910 c.fractionalMarkTime.Add(duration)
911 case gcMarkWorkerIdleMode:
912 c.idleMarkTime.Add(duration)
913 c.removeIdleMarkWorker()
915 throw("markWorkerStop: unknown mark worker mode")
919 func (c *gcControllerState) update(dHeapLive, dHeapScan int64) {
921 live := gcController.heapLive.Add(dHeapLive)
923 // gcController.heapLive changed.
927 if gcBlackenEnabled == 0 {
928 // Update heapScan when we're not in a current GC. It is fixed
929 // at the beginning of a cycle.
931 gcController.heapScan.Add(dHeapScan)
934 // gcController.heapLive changed.
939 func (c *gcControllerState) addScannableStack(pp *p, amount int64) {
941 c.maxStackScan.Add(amount)
944 pp.maxStackScanDelta += amount
945 if pp.maxStackScanDelta >= maxStackScanSlack || pp.maxStackScanDelta <= -maxStackScanSlack {
946 c.maxStackScan.Add(pp.maxStackScanDelta)
947 pp.maxStackScanDelta = 0
951 func (c *gcControllerState) addGlobals(amount int64) {
952 c.globalsScan.Add(amount)
955 // heapGoal returns the current heap goal.
956 func (c *gcControllerState) heapGoal() uint64 {
957 goal, _ := c.heapGoalInternal()
961 // heapGoalInternal is the implementation of heapGoal which returns additional
962 // information that is necessary for computing the trigger.
964 // The returned minTrigger is always <= goal.
965 func (c *gcControllerState) heapGoalInternal() (goal, minTrigger uint64) {
966 // Start with the goal calculated for gcPercent.
967 goal = c.gcPercentHeapGoal.Load()
969 // Check if the memory-limit-based goal is smaller, and if so, pick that.
970 if newGoal := c.memoryLimitHeapGoal(); go119MemoryLimitSupport && newGoal < goal {
973 // We're not limited by the memory limit goal, so perform a series of
974 // adjustments that might move the goal forward in a variety of circumstances.
976 sweepDistTrigger := c.sweepDistMinTrigger.Load()
977 if sweepDistTrigger > goal {
978 // Set the goal to maintain a minimum sweep distance since
979 // the last call to commit. Note that we never want to do this
980 // if we're in the memory limit regime, because it could push
982 goal = sweepDistTrigger
984 // Since we ignore the sweep distance trigger in the memory
985 // limit regime, we need to ensure we don't propagate it to
986 // the trigger, because it could cause a violation of the
987 // invariant that the trigger < goal.
988 minTrigger = sweepDistTrigger
990 // Ensure that the heap goal is at least a little larger than
991 // the point at which we triggered. This may not be the case if GC
992 // start is delayed or if the allocation that pushed gcController.heapLive
993 // over trigger is large or if the trigger is really close to
994 // GOGC. Assist is proportional to this distance, so enforce a
995 // minimum distance, even if it means going over the GOGC goal
998 // Ignore this if we're in the memory limit regime: we'd prefer to
999 // have the GC respond hard about how close we are to the goal than to
1000 // push the goal back in such a manner that it could cause us to exceed
1001 // the memory limit.
1002 const minRunway = 64 << 10
1003 if c.triggered != ^uint64(0) && goal < c.triggered+minRunway {
1004 goal = c.triggered + minRunway
1010 // memoryLimitHeapGoal returns a heap goal derived from memoryLimit.
1011 func (c *gcControllerState) memoryLimitHeapGoal() uint64 {
1012 // Start by pulling out some values we'll need. Be careful about overflow.
1013 var heapFree, heapAlloc, mappedReady uint64
1015 heapFree = c.heapFree.load() // Free and unscavenged memory.
1016 heapAlloc = c.totalAlloc.Load() - c.totalFree.Load() // Heap object bytes in use.
1017 mappedReady = c.mappedReady.Load() // Total unreleased mapped memory.
1018 if heapFree+heapAlloc <= mappedReady {
1021 // It is impossible for total unreleased mapped memory to exceed heap memory, but
1022 // because these stats are updated independently, we may observe a partial update
1023 // including only some values. Thus, we appear to break the invariant. However,
1024 // this condition is necessarily transient, so just try again. In the case of a
1025 // persistent accounting error, we'll deadlock here.
1028 // Below we compute a goal from memoryLimit. There are a few things to be aware of.
1029 // Firstly, the memoryLimit does not easily compare to the heap goal: the former
1030 // is total mapped memory by the runtime that hasn't been released, while the latter is
1031 // only heap object memory. Intuitively, the way we convert from one to the other is to
1032 // subtract everything from memoryLimit that both contributes to the memory limit (so,
1033 // ignore scavenged memory) and doesn't contain heap objects. This isn't quite what
1034 // lines up with reality, but it's a good starting point.
1036 // In practice this computation looks like the following:
1038 // memoryLimit - ((mappedReady - heapFree - heapAlloc) + max(mappedReady - memoryLimit, 0)) - memoryLimitHeapGoalHeadroom
1041 // Let's break this down.
1043 // The first term (marker 1) is everything that contributes to the memory limit and isn't
1044 // or couldn't become heap objects. It represents, broadly speaking, non-heap overheads.
1045 // One oddity you may have noticed is that we also subtract out heapFree, i.e. unscavenged
1046 // memory that may contain heap objects in the future.
1048 // Let's take a step back. In an ideal world, this term would look something like just
1049 // the heap goal. That is, we "reserve" enough space for the heap to grow to the heap
1050 // goal, and subtract out everything else. This is of course impossible; the definition
1051 // is circular! However, this impossible definition contains a key insight: the amount
1052 // we're *going* to use matters just as much as whatever we're currently using.
1054 // Consider if the heap shrinks to 1/10th its size, leaving behind lots of free and
1055 // unscavenged memory. mappedReady - heapAlloc will be quite large, because of that free
1056 // and unscavenged memory, pushing the goal down significantly.
1058 // heapFree is also safe to exclude from the memory limit because in the steady-state, it's
1059 // just a pool of memory for future heap allocations, and making new allocations from heapFree
1060 // memory doesn't increase overall memory use. In transient states, the scavenger and the
1061 // allocator actively manage the pool of heapFree memory to maintain the memory limit.
1063 // The second term (marker 2) is the amount of memory we've exceeded the limit by, and is
1064 // intended to help recover from such a situation. By pushing the heap goal down, we also
1065 // push the trigger down, triggering and finishing a GC sooner in order to make room for
1066 // other memory sources. Note that since we're effectively reducing the heap goal by X bytes,
1067 // we're actually giving more than X bytes of headroom back, because the heap goal is in
1068 // terms of heap objects, but it takes more than X bytes (e.g. due to fragmentation) to store
1069 // X bytes worth of objects.
1071 // The third term (marker 3) subtracts an additional memoryLimitHeapGoalHeadroom bytes from the
1072 // heap goal. As the name implies, this is to provide additional headroom in the face of pacing
1073 // inaccuracies. This is a fixed number of bytes because these inaccuracies disproportionately
1074 // affect small heaps: as heaps get smaller, the pacer's inputs get fuzzier. Shorter GC cycles
1075 // and less GC work means noisy external factors like the OS scheduler have a greater impact.
1077 memoryLimit := uint64(c.memoryLimit.Load())
1080 nonHeapMemory := mappedReady - heapFree - heapAlloc
1084 if mappedReady > memoryLimit {
1085 overage = mappedReady - memoryLimit
1088 if nonHeapMemory+overage >= memoryLimit {
1089 // We're at a point where non-heap memory exceeds the memory limit on its own.
1090 // There's honestly not much we can do here but just trigger GCs continuously
1091 // and let the CPU limiter reign that in. Something has to give at this point.
1092 // Set it to heapMarked, the lowest possible goal.
1096 // Compute the goal.
1097 goal := memoryLimit - (nonHeapMemory + overage)
1099 // Apply some headroom to the goal to account for pacing inaccuracies.
1100 // Be careful about small limits.
1101 if goal < memoryLimitHeapGoalHeadroom || goal-memoryLimitHeapGoalHeadroom < memoryLimitHeapGoalHeadroom {
1102 goal = memoryLimitHeapGoalHeadroom
1104 goal = goal - memoryLimitHeapGoalHeadroom
1106 // Don't let us go below the live heap. A heap goal below the live heap doesn't make sense.
1107 if goal < c.heapMarked {
1114 // These constants determine the bounds on the GC trigger as a fraction
1115 // of heap bytes allocated between the start of a GC (heapLive == heapMarked)
1116 // and the end of a GC (heapLive == heapGoal).
1118 // The constants are obscured in this way for efficiency. The denominator
1119 // of the fraction is always a power-of-two for a quick division, so that
1120 // the numerator is a single constant integer multiplication.
1121 triggerRatioDen = 64
1123 // The minimum trigger constant was chosen empirically: given a sufficiently
1124 // fast/scalable allocator with 48 Ps that could drive the trigger ratio
1125 // to <0.05, this constant causes applications to retain the same peak
1126 // RSS compared to not having this allocator.
1127 minTriggerRatioNum = 45 // ~0.7
1129 // The maximum trigger constant is chosen somewhat arbitrarily, but the
1130 // current constant has served us well over the years.
1131 maxTriggerRatioNum = 61 // ~0.95
1134 // trigger returns the current point at which a GC should trigger along with
1137 // The returned value may be compared against heapLive to determine whether
1138 // the GC should trigger. Thus, the GC trigger condition should be (but may
1139 // not be, in the case of small movements for efficiency) checked whenever
1140 // the heap goal may change.
1141 func (c *gcControllerState) trigger() (uint64, uint64) {
1142 goal, minTrigger := c.heapGoalInternal()
1144 // Invariant: the trigger must always be less than the heap goal.
1146 // Note that the memory limit sets a hard maximum on our heap goal,
1147 // but the live heap may grow beyond it.
1149 if c.heapMarked >= goal {
1150 // The goal should never be smaller than heapMarked, but let's be
1151 // defensive about it. The only reasonable trigger here is one that
1152 // causes a continuous GC cycle at heapMarked, but respect the goal
1153 // if it came out as smaller than that.
1157 // Below this point, c.heapMarked < goal.
1159 // heapMarked is our absolute minimum, and it's possible the trigger
1160 // bound we get from heapGoalinternal is less than that.
1161 if minTrigger < c.heapMarked {
1162 minTrigger = c.heapMarked
1165 // If we let the trigger go too low, then if the application
1166 // is allocating very rapidly we might end up in a situation
1167 // where we're allocating black during a nearly always-on GC.
1168 // The result of this is a growing heap and ultimately an
1169 // increase in RSS. By capping us at a point >0, we're essentially
1170 // saying that we're OK using more CPU during the GC to prevent
1171 // this growth in RSS.
1172 triggerLowerBound := uint64(((goal-c.heapMarked)/triggerRatioDen)*minTriggerRatioNum) + c.heapMarked
1173 if minTrigger < triggerLowerBound {
1174 minTrigger = triggerLowerBound
1177 // For small heaps, set the max trigger point at maxTriggerRatio of the way
1178 // from the live heap to the heap goal. This ensures we always have *some*
1179 // headroom when the GC actually starts. For larger heaps, set the max trigger
1180 // point at the goal, minus the minimum heap size.
1182 // This choice follows from the fact that the minimum heap size is chosen
1183 // to reflect the costs of a GC with no work to do. With a large heap but
1184 // very little scan work to perform, this gives us exactly as much runway
1185 // as we would need, in the worst case.
1186 maxTrigger := uint64(((goal-c.heapMarked)/triggerRatioDen)*maxTriggerRatioNum) + c.heapMarked
1187 if goal > defaultHeapMinimum && goal-defaultHeapMinimum > maxTrigger {
1188 maxTrigger = goal - defaultHeapMinimum
1190 if maxTrigger < minTrigger {
1191 maxTrigger = minTrigger
1194 // Compute the trigger from our bounds and the runway stored by commit.
1196 runway := c.runway.Load()
1198 trigger = minTrigger
1200 trigger = goal - runway
1202 if trigger < minTrigger {
1203 trigger = minTrigger
1205 if trigger > maxTrigger {
1206 trigger = maxTrigger
1209 print("trigger=", trigger, " heapGoal=", goal, "\n")
1210 print("minTrigger=", minTrigger, " maxTrigger=", maxTrigger, "\n")
1211 throw("produced a trigger greater than the heap goal")
1213 return trigger, goal
1216 // commit recomputes all pacing parameters needed to derive the
1217 // trigger and the heap goal. Namely, the gcPercent-based heap goal,
1218 // and the amount of runway we want to give the GC this cycle.
1220 // This can be called any time. If GC is the in the middle of a
1221 // concurrent phase, it will adjust the pacing of that phase.
1223 // isSweepDone should be the result of calling isSweepDone(),
1224 // unless we're testing or we know we're executing during a GC cycle.
1226 // This depends on gcPercent, gcController.heapMarked, and
1227 // gcController.heapLive. These must be up to date.
1229 // Callers must call gcControllerState.revise after calling this
1230 // function if the GC is enabled.
1232 // mheap_.lock must be held or the world must be stopped.
1233 func (c *gcControllerState) commit(isSweepDone bool) {
1235 assertWorldStoppedOrLockHeld(&mheap_.lock)
1239 // The sweep is done, so there aren't any restrictions on the trigger
1240 // we need to think about.
1241 c.sweepDistMinTrigger.Store(0)
1243 // Concurrent sweep happens in the heap growth
1244 // from gcController.heapLive to trigger. Make sure we
1245 // give the sweeper some runway if it doesn't have enough.
1246 c.sweepDistMinTrigger.Store(c.heapLive.Load() + sweepMinHeapDistance)
1249 // Compute the next GC goal, which is when the allocated heap
1250 // has grown by GOGC/100 over where it started the last cycle,
1251 // plus additional runway for non-heap sources of GC work.
1252 gcPercentHeapGoal := ^uint64(0)
1253 if gcPercent := c.gcPercent.Load(); gcPercent >= 0 {
1254 gcPercentHeapGoal = c.heapMarked + (c.heapMarked+c.lastStackScan.Load()+c.globalsScan.Load())*uint64(gcPercent)/100
1256 // Apply the minimum heap size here. It's defined in terms of gcPercent
1257 // and is only updated by functions that call commit.
1258 if gcPercentHeapGoal < c.heapMinimum {
1259 gcPercentHeapGoal = c.heapMinimum
1261 c.gcPercentHeapGoal.Store(gcPercentHeapGoal)
1263 // Compute the amount of runway we want the GC to have by using our
1264 // estimate of the cons/mark ratio.
1266 // The idea is to take our expected scan work, and multiply it by
1267 // the cons/mark ratio to determine how long it'll take to complete
1268 // that scan work in terms of bytes allocated. This gives us our GC's
1271 // However, the cons/mark ratio is a ratio of rates per CPU-second, but
1272 // here we care about the relative rates for some division of CPU
1273 // resources among the mutator and the GC.
1275 // To summarize, we have B / cpu-ns, and we want B / ns. We get that
1276 // by multiplying by our desired division of CPU resources. We choose
1277 // to express CPU resources as GOMAPROCS*fraction. Note that because
1278 // we're working with a ratio here, we can omit the number of CPU cores,
1279 // because they'll appear in the numerator and denominator and cancel out.
1280 // As a result, this is basically just "weighing" the cons/mark ratio by
1281 // our desired division of resources.
1283 // Furthermore, by setting the runway so that CPU resources are divided
1284 // this way, assuming that the cons/mark ratio is correct, we make that
1285 // division a reality.
1286 c.runway.Store(uint64((c.consMark * (1 - gcGoalUtilization) / (gcGoalUtilization)) * float64(c.lastHeapScan+c.lastStackScan.Load()+c.globalsScan.Load())))
1289 // setGCPercent updates gcPercent. commit must be called after.
1290 // Returns the old value of gcPercent.
1292 // The world must be stopped, or mheap_.lock must be held.
1293 func (c *gcControllerState) setGCPercent(in int32) int32 {
1295 assertWorldStoppedOrLockHeld(&mheap_.lock)
1298 out := c.gcPercent.Load()
1302 c.heapMinimum = defaultHeapMinimum * uint64(in) / 100
1303 c.gcPercent.Store(in)
1308 //go:linkname setGCPercent runtime/debug.setGCPercent
1309 func setGCPercent(in int32) (out int32) {
1310 // Run on the system stack since we grab the heap lock.
1311 systemstack(func() {
1313 out = gcController.setGCPercent(in)
1314 gcControllerCommit()
1315 unlock(&mheap_.lock)
1318 // If we just disabled GC, wait for any concurrent GC mark to
1319 // finish so we always return with no GC running.
1321 gcWaitOnMark(atomic.Load(&work.cycles))
1327 func readGOGC() int32 {
1328 p := gogetenv("GOGC")
1332 if n, ok := atoi32(p); ok {
1338 // setMemoryLimit updates memoryLimit. commit must be called after
1339 // Returns the old value of memoryLimit.
1341 // The world must be stopped, or mheap_.lock must be held.
1342 func (c *gcControllerState) setMemoryLimit(in int64) int64 {
1344 assertWorldStoppedOrLockHeld(&mheap_.lock)
1347 out := c.memoryLimit.Load()
1349 c.memoryLimit.Store(in)
1355 //go:linkname setMemoryLimit runtime/debug.setMemoryLimit
1356 func setMemoryLimit(in int64) (out int64) {
1357 // Run on the system stack since we grab the heap lock.
1358 systemstack(func() {
1360 out = gcController.setMemoryLimit(in)
1361 if in < 0 || out == in {
1362 // If we're just checking the value or not changing
1363 // it, there's no point in doing the rest.
1364 unlock(&mheap_.lock)
1367 gcControllerCommit()
1368 unlock(&mheap_.lock)
1373 func readGOMEMLIMIT() int64 {
1374 p := gogetenv("GOMEMLIMIT")
1375 if p == "" || p == "off" {
1378 n, ok := parseByteCount(p)
1380 print("GOMEMLIMIT=", p, "\n")
1381 throw("malformed GOMEMLIMIT; see `go doc runtime/debug.SetMemoryLimit`")
1386 type piController struct {
1387 kp float64 // Proportional constant.
1388 ti float64 // Integral time constant.
1389 tt float64 // Reset time.
1391 min, max float64 // Output boundaries.
1393 // PI controller state.
1395 errIntegral float64 // Integral of the error from t=0 to now.
1398 errOverflow bool // Set if errIntegral ever overflowed.
1399 inputOverflow bool // Set if an operation with the input overflowed.
1402 // next provides a new sample to the controller.
1404 // input is the sample, setpoint is the desired point, and period is how much
1405 // time (in whatever unit makes the most sense) has passed since the last sample.
1407 // Returns a new value for the variable it's controlling, and whether the operation
1408 // completed successfully. One reason this might fail is if error has been growing
1409 // in an unbounded manner, to the point of overflow.
1411 // In the specific case of an error overflow occurs, the errOverflow field will be
1412 // set and the rest of the controller's internal state will be fully reset.
1413 func (c *piController) next(input, setpoint, period float64) (float64, bool) {
1414 // Compute the raw output value.
1415 prop := c.kp * (setpoint - input)
1416 rawOutput := prop + c.errIntegral
1418 // Clamp rawOutput into output.
1420 if isInf(output) || isNaN(output) {
1421 // The input had a large enough magnitude that either it was already
1422 // overflowed, or some operation with it overflowed.
1423 // Set a flag and reset. That's the safest thing to do.
1425 c.inputOverflow = true
1430 } else if output > c.max {
1434 // Update the controller's state.
1435 if c.ti != 0 && c.tt != 0 {
1436 c.errIntegral += (c.kp*period/c.ti)*(setpoint-input) + (period/c.tt)*(output-rawOutput)
1437 if isInf(c.errIntegral) || isNaN(c.errIntegral) {
1438 // So much error has accumulated that we managed to overflow.
1439 // The assumptions around the controller have likely broken down.
1440 // Set a flag and reset. That's the safest thing to do.
1442 c.errOverflow = true
1449 // reset resets the controller state, except for controller error flags.
1450 func (c *piController) reset() {
1454 // addIdleMarkWorker attempts to add a new idle mark worker.
1456 // If this returns true, the caller must become an idle mark worker unless
1457 // there's no background mark worker goroutines in the pool. This case is
1458 // harmless because there are already background mark workers running.
1459 // If this returns false, the caller must NOT become an idle mark worker.
1461 // nosplit because it may be called without a P.
1464 func (c *gcControllerState) addIdleMarkWorker() bool {
1466 old := c.idleMarkWorkers.Load()
1467 n, max := int32(old&uint64(^uint32(0))), int32(old>>32)
1469 // See the comment on idleMarkWorkers for why
1470 // n > max is tolerated.
1474 print("n=", n, " max=", max, "\n")
1475 throw("negative idle mark workers")
1477 new := uint64(uint32(n+1)) | (uint64(max) << 32)
1478 if c.idleMarkWorkers.CompareAndSwap(old, new) {
1484 // needIdleMarkWorker is a hint as to whether another idle mark worker is needed.
1486 // The caller must still call addIdleMarkWorker to become one. This is mainly
1487 // useful for a quick check before an expensive operation.
1489 // nosplit because it may be called without a P.
1492 func (c *gcControllerState) needIdleMarkWorker() bool {
1493 p := c.idleMarkWorkers.Load()
1494 n, max := int32(p&uint64(^uint32(0))), int32(p>>32)
1498 // removeIdleMarkWorker must be called when an new idle mark worker stops executing.
1499 func (c *gcControllerState) removeIdleMarkWorker() {
1501 old := c.idleMarkWorkers.Load()
1502 n, max := int32(old&uint64(^uint32(0))), int32(old>>32)
1504 print("n=", n, " max=", max, "\n")
1505 throw("negative idle mark workers")
1507 new := uint64(uint32(n-1)) | (uint64(max) << 32)
1508 if c.idleMarkWorkers.CompareAndSwap(old, new) {
1514 // setMaxIdleMarkWorkers sets the maximum number of idle mark workers allowed.
1516 // This method is optimistic in that it does not wait for the number of
1517 // idle mark workers to reduce to max before returning; it assumes the workers
1518 // will deschedule themselves.
1519 func (c *gcControllerState) setMaxIdleMarkWorkers(max int32) {
1521 old := c.idleMarkWorkers.Load()
1522 n := int32(old & uint64(^uint32(0)))
1524 print("n=", n, " max=", max, "\n")
1525 throw("negative idle mark workers")
1527 new := uint64(uint32(n)) | (uint64(max) << 32)
1528 if c.idleMarkWorkers.CompareAndSwap(old, new) {
1534 // gcControllerCommit is gcController.commit, but passes arguments from live
1535 // (non-test) data. It also updates any consumers of the GC pacing, such as
1536 // sweep pacing and the background scavenger.
1538 // Calls gcController.commit.
1540 // The heap lock must be held, so this must be executed on the system stack.
1543 func gcControllerCommit() {
1544 assertWorldStoppedOrLockHeld(&mheap_.lock)
1546 gcController.commit(isSweepDone())
1548 // Update mark pacing.
1549 if gcphase != _GCoff {
1550 gcController.revise()
1553 // TODO(mknyszek): This isn't really accurate any longer because the heap
1554 // goal is computed dynamically. Still useful to snapshot, but not as useful.
1559 trigger, heapGoal := gcController.trigger()
1560 gcPaceSweeper(trigger)
1561 gcPaceScavenger(gcController.memoryLimit.Load(), heapGoal, gcController.lastHeapGoal)