- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 71 for Amount (0.11 sec)
-
src/runtime/mgcpacer.go
func (c *gcControllerState) addScannableStack(pp *p, amount int64) { if pp == nil { c.maxStackScan.Add(amount) return } pp.maxStackScanDelta += amount if pp.maxStackScanDelta >= maxStackScanSlack || pp.maxStackScanDelta <= -maxStackScanSlack { c.maxStackScan.Add(pp.maxStackScanDelta) pp.maxStackScanDelta = 0 } } func (c *gcControllerState) addGlobals(amount int64) { c.globalsScan.Add(amount) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/main/java/org/codelibs/core/io/CopyUtil.java
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 52.4K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
// dramatically over the next GC cycle. Overestimating the amount of // fragmentation simply results in higher memory use, which will be accounted // for by the next pacing up date. Underestimating the fragmentation however // could lead to performance degradation. Handling this case is not within the // scope of the scavenger. Situations where the amount of fragmentation balloons
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
src/runtime/mgcmark.go
// It's only used by the new tracer. // See the comment on enteredMarkAssistForTracing. gp.inMarkAssist = false } } return } // Compute the amount of scan work we need to do to make the // balance positive. When the required amount of work is low, // we over-assist to build up credit for future allocations // and amortize the cost of assisting. assistWorkPerByte := gcController.assistWorkPerByte.Load()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/S390X.rules
(RISBGZ (RISBGZ x {y}) {z}) && z.InMerge(y.OutMask()) != nil => (RISBGZ x {(*z.InMerge(y.OutMask())).RotateLeft(y.Amount)}) // Convert RISBGZ into 64-bit shift (helps CSE). (RISBGZ x {r}) && r.End == 63 && r.Start == -r.Amount&63 => (SRDconst x [-r.Amount&63]) (RISBGZ x {r}) && r.Start == 0 && r.End == 63-r.Amount => (SLDconst x [r.Amount]) // Optimize single bit isolation when it is known to be equivalent to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 18:09:26 UTC 2023 - 74.3K bytes - Viewed (0) -
src/runtime/mgc.go
// The finalizer goroutine is kicked off only when all spans are swept. // When the next GC starts, it sweeps all not-yet-swept spans (if any). // GC rate. // Next GC is after we've allocated an extra amount of memory proportional to // the amount already in use. The proportion is controlled by GOGC environment variable // (100 by default). If GOGC=100 and we're using 4M, we'll GC again when we get to 8M
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/OkHttpClient.kt
* values must be between 1 and [Integer.MAX_VALUE] when converted to milliseconds. * * The close timeout is the maximum amount of time after the client calls [WebSocket.close] to * wait for a graceful shutdown. If the server doesn't respond the web socket will be canceled. * The default value is 60 seconds. */
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Sat Apr 06 04:21:33 UTC 2024 - 52K bytes - Viewed (0) -
pkg/controller/nodelifecycle/node_lifecycle_controller.go
// health signal updated from kubelet. There are 2 kinds of node healthiness // signals: NodeStatus and NodeLease. If it doesn't receive update for this amount // of time, it will start posting "NodeReady==ConditionUnknown". The amount of // time before which Controller start evicting pods is controlled via flag // 'pod-eviction-timeout'. // Note: be cautious when changing the constant, it must work with
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/queueset_test.go
func fairAlloc(demands []float64, capacity float64) []float64 { count := len(demands) indices := make([]int, count) for i := 0; i < count; i++ { indices[i] = i } sort.Slice(indices, func(i, j int) bool { return demands[indices[i]] < demands[indices[j]] }) alloc := make([]float64, count) var next int var prevAlloc float64 for ; next < count; next++ { // `capacity` is how much remains assuming that
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Sep 26 12:55:23 UTC 2023 - 58.4K bytes - Viewed (0) -
pkg/kubelet/volumemanager/reconciler/reconciler_test.go
"k8s.io/kubernetes/pkg/volume/util/types" ) const ( // reconcilerLoopSleepDuration is the amount of time the reconciler loop // waits between successive executions reconcilerLoopSleepDuration = 1 * time.Nanosecond // waitForAttachTimeout is the maximum amount of time a // operationexecutor.Mount call will wait for a volume to be attached. waitForAttachTimeout = 1 * time.Second
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 09 07:34:33 UTC 2024 - 75.4K bytes - Viewed (0)