- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 25 for Decrement (0.63 sec)
-
src/cmd/compile/internal/ppc64/ssa.go
p.To.Type = obj.TYPE_MEM p.To.Reg = dstReg p.To.Offset = offset + 48 // increment the src reg for next iteration p = s.Prog(ppc64.AADD) p.Reg = srcReg p.From.Type = obj.TYPE_CONST p.From.Offset = bytesPerLoop p.To.Type = obj.TYPE_REG p.To.Reg = srcReg // increment the dst reg for next iteration p = s.Prog(ppc64.AADD) p.Reg = dstReg
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 55.4K bytes - Viewed (0) -
src/runtime/mprof.go
next := prev | 0x1 if c.value.CompareAndSwap(prev, next) { return cycle, alreadyFlushed } } } // increment increases the cycle count by one, wrapping the value at // mProfCycleWrap. It clears the flushed flag. func (c *mProfCycleHolder) increment() { // We explicitly wrap mProfCycle rather than depending on // uint wraparound because the memRecord.future ring does not
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 53.3K bytes - Viewed (0) -
cmd/kube-controller-manager/app/options/options_test.go
"--node-monitor-grace-period=30s", "--node-monitor-period=10s", "--node-startup-grace-period=30s", "--profiling=false", "--pv-recycler-increment-timeout-nfs=45", "--pv-recycler-minimum-timeout-hostpath=45", "--pv-recycler-minimum-timeout-nfs=200", "--pv-recycler-timeout-increment-hostpath=45", "--pvclaimbinder-sync-period=30s", "--resource-quota-sync-period=10m", "--route-reconciliation-period=30s",
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 27 02:59:09 UTC 2024 - 55.1K bytes - Viewed (0) -
src/runtime/mgc.go
} // Bump GC cycle count and wake goroutines waiting on sweep. lock(&work.sweepWaiters.lock) memstats.numgc++ injectglist(&work.sweepWaiters.list) unlock(&work.sweepWaiters.lock) // Increment the scavenge generation now. // // This moment represents peak heap in use because we're // about to start sweeping. mheap_.pages.scav.index.nextGen() // Release the CPU limiter.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
pkg/controller/disruption/disruption_test.go
if err != nil { t.Fatalf("Failed to get PDB: %v", err) } updatedPDB := obj.(*policy.PodDisruptionBudget) // Each eviction, // - decrements DisruptionsAllowed // - adds the pod to DisruptedPods // - deletes the pod updatedPDB.Status.DisruptionsAllowed -= int32(len(podNames)) updatedPDB.Status.DisruptedPods = make(map[string]metav1.Time)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 50K bytes - Viewed (0) -
src/runtime/mgcmark.go
} for i := uintptr(0); i < n; i += goarch.PtrSize { if ptrmask != nil { word := i / goarch.PtrSize bits := *addb(ptrmask, word/8) if bits == 0 { // Skip 8 words (the loop increment will do the 8th) // // This must be the first time we've // seen this word of ptrmask, so i // must be 8-word-aligned, but check // our reasoning just in case.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
pkg/kubelet/kuberuntime/kuberuntime_manager.go
// Now we retain restart count of container as a container label. Each time a container // restarts, pod will read the restart count from the registered dead container, increment // it to get the new restart count, and then add a label with the new restart count on // the newly started container. // However, there are some limitations of this method:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 22 02:01:31 UTC 2024 - 64.7K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass_test.cc
} void AddCtrlEdge(const Scope& scope, Operation a, Output b) { AddCtrlEdge(scope, a, b.op()); } // Tests that we pick a good clustering for graphs that have an integer // increment operation control dependent on gradient update operations. TEST(XlaCompilationTest, IterationIncrementAndGroupDeps) { Scope scope = Scope::NewRootScope().ExitOnError(); Output iter =
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 14 10:11:10 UTC 2024 - 79.6K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_asm_ppc64le.s
VSEL X1L, X2L, SEL1, X1L // Select if idx matched VSEL X1H, X2H, SEL1, X1H VSEL Y1L, Y2L, SEL1, Y1L VSEL Y1H, Y2H, SEL1, Y1H VADDUBM SEL2, ONE, SEL2 // Increment SEL2 bytes by 1 ADD $64, P1ptr // Next chunk BDNZ loop_select STXVD2X X1H, (P3ptr+R0) STXVD2X X1L, (P3ptr+R16) STXVD2X Y1H, (P3ptr+R17) STXVD2X Y1L, (P3ptr+R18) RET
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 56.5K bytes - Viewed (0) -
src/runtime/map.go
// We trigger same-size map growth if there are // as many overflow buckets as buckets. // We need to be able to count to 1<<h.B. if h.B < 16 { h.noverflow++ return } // Increment with probability 1/(1<<(h.B-15)). // When we reach 1<<15 - 1, we will have approximately // as many overflow buckets as buckets. mask := uint32(1)<<(h.B-15) - 1 // Example: if h.B == 18, then mask == 7,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0)