- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 20 for Precompute (0.47 sec)
-
staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher_whitebox_test.go
} defer cacher.Stop() // Update bookmarkFrequency to speed up test. // Note that the frequency lower than 1s doesn't change much due to // resolution how frequency we recompute. cacher.bookmarkWatchers.bookmarkFrequency = time.Second if !utilfeature.DefaultFeatureGate.Enabled(features.ResilientWatchCacheInitialization) { if err := cacher.ready.wait(context.Background()); err != nil {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 10:12:02 UTC 2024 - 82.9K bytes - Viewed (0) -
src/runtime/map.go
// Fortunately, we have the freedom to send these keys either // way. Also, tophash is meaningless for these kinds of keys. // We let the low bit of tophash drive the evacuation decision. // We recompute a new random tophash for the next level so // these keys will get evenly distributed across all buckets // after multiple grows. useY = top & 1 top = tophash(hash) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/runtime/mgcpacer.go
print("minTrigger=", minTrigger, " maxTrigger=", maxTrigger, "\n") throw("produced a trigger greater than the heap goal") } return trigger, goal } // commit recomputes all pacing parameters needed to derive the // trigger and the heap goal. Namely, the gcPercent-based heap goal, // and the amount of runway we want to give the GC this cycle. //
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/cmd/go/internal/modload/init.go
return nil, errNoChange } if index != nil && !bytes.Equal(old, index.data) { // The contents of the go.mod file have changed. In theory we could add all // of the new modules to the build list, recompute, and check whether any // module in *our* build list got bumped to a different version, but that's // a lot of work for marginal benefit. Instead, fail the command: if users
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 18:36:30 UTC 2024 - 69.8K bytes - Viewed (0) -
src/cmd/internal/obj/loong64/asm.go
return false } // If p is a multi-instruction sequence with uses REGTMP inserted by // the assembler in order to materialize a large constant/offset, we // can restart p (at the start of the instruction sequence), recompute // the content of REGTMP, upon async preemption. Currently, all cases // of assembler-inserted REGTMP fall into this category. // If p doesn't use REGTMP, it can be simply preempted, so we don't // mark it.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 02:04:54 UTC 2024 - 61.8K bytes - Viewed (0) -
pilot/pkg/networking/core/listener_test.go
validateAccessLog(t, xdstest.ExtractListener(model.VirtualOutboundListenerName, listeners), "") // Update MeshConfig m.AccessLogFormat = "format modified" // Trigger MeshConfig change and validate that access log is recomputed. accessLogBuilder.reset() listeners = buildListeners(t, TestOptions{MeshConfig: m}, nil) // Validate that access log filter uses the new format.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jun 13 01:56:28 UTC 2024 - 93.6K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/optimizing-performance/configuration_cache.adoc
System properties and environment variables referenced in the code of the `ValueSource` do not become build configuration inputs, so any processing can be applied. Instead, the value of the `ValueSource` is recomputed each time the build runs and only if the value changes the configuration cache is invalidated. For example, a `ValueSource` can be used to get all environment variables with names containing the substring `JDK`: ====
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 29 16:24:12 UTC 2024 - 71.1K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
var noPkgs []*loadPkg // We also know that we're going to call updateRequirements again next // iteration so we don't need to also update it here. (That would waste time // computing a "direct" map that we'll have to recompute later anyway.) direct := ld.requirements.direct rs, err := updateRoots(ctx, direct, ld.requirements, noPkgs, toAdd, ld.AssumeRootsImported) if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
} } e.s.f.Fatalf("can't find empty register on edge %s->%s", e.p, e.b) return nil } // rematerializeable reports whether the register allocator should recompute // a value instead of spilling/restoring it. func (v *Value) rematerializeable() bool { if !opcodeTable[v.Op].rematerializeable { return false } for _, a := range v.Args {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
return c.loadType(dtype, pos, "") } // loadType recursively loads the requested dtype and its dependency graph. func (c *typeConv) loadType(dtype dwarf.Type, pos token.Pos, parent string) *Type { // Always recompute bad pointer typedefs, as the set of such // typedefs changes as we see more types. checkCache := true if dtt, ok := dtype.(*dwarf.TypedefType); ok && c.badPointerTypedef(dtt) { checkCache = false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0)