- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 72 for enumValues (0.29 sec)
-
src/cmd/compile/internal/ssa/schedule_test.go
Valu("v", OpConst64, c.config.Types.Int64, 12, nil), Goto("exit")), Bloc("exit", Exit("mem2"))) CheckFunc(fun.f) order := storeOrder(fun.f.Blocks[0].Values, fun.f.newSparseSet(fun.f.NumValues()), make([]int32, fun.f.NumValues())) // check that v2, v3, v4 is sorted after v5 var ai, bi, ci, si int for i, v := range order { switch v.ID { case 2: ai = i case 3: bi = i case 4: ci = i
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Oct 08 01:46:00 UTC 2022 - 5.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cse.go
// It starts with a coarse partition and iteratively refines it // until it reaches a fixed point. // Make initial coarse partitions by using a subset of the conditions above. a := f.Cache.allocValueSlice(f.NumValues()) defer func() { f.Cache.freeValueSlice(a) }() // inside closure to use final value of a a = a[:0] if f.auxmap == nil { f.auxmap = auxmap{} } for _, b := range f.Blocks { for _, v := range b.Values {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 9.6K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/internal/snapshot/impl/AbstractValueProcessor.java
} if (value instanceof List) { return processList((List<?>) value, visitor); } if (value instanceof Enum) { return visitor.enumValue((Enum<?>) value); } if (value instanceof Class<?>) { return visitor.classValue((Class<?>) value); } Class<?> valueClass = value.getClass();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Feb 05 19:08:37 UTC 2024 - 10K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/pkg/apis/testdata/HEAD/apiextensions.k8s.io.v1.CustomResourceDefinition.json
"pattern": "patternValue", "maxItems": 16, "minItems": 17, "uniqueItems": true, "multipleOf": 19.5, "enum": [ "enumValue" ], "maxProperties": 21, "minProperties": 22, "required": [ "requiredValue" ], "items": [ {} ],
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 19:06:46 UTC 2024 - 5.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
func dse(f *Func) { var stores []*Value loadUse := f.newSparseSet(f.NumValues()) defer f.retSparseSet(loadUse) storeUse := f.newSparseSet(f.NumValues()) defer f.retSparseSet(storeUse) shadowed := f.newSparseMap(f.NumValues()) defer f.retSparseMap(shadowed)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
func schedule(f *Func) { // reusable priority queue priq := new(ValHeap) // "priority" for a value score := f.Cache.allocInt8Slice(f.NumValues()) defer f.Cache.freeInt8Slice(score) // maps mem values to the next live memory value nextMem := f.Cache.allocValueSlice(f.NumValues()) defer f.Cache.freeValueSlice(nextMem) // inBlockUses records whether a value is used in the block
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/tighten.go
// Too many values live across blocks can cause pathological // behavior in the register allocator (see issue 52180). return } canMove := f.Cache.allocBoolSlice(f.NumValues()) defer f.Cache.freeBoolSlice(canMove) // Compute the memory states of each block. startMem := f.Cache.allocValueSlice(f.NumBlocks()) defer f.Cache.freeValueSlice(startMem)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 01:01:38 UTC 2023 - 7.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/critical.go
// Regalloc wants a critical-edge-free CFG so it can implement phi values. func critical(f *Func) { // maps from phi arg ID to the new block created for that argument blocks := f.Cache.allocBlockSlice(f.NumValues()) defer f.Cache.freeBlockSlice(blocks) // need to iterate over f.Blocks without range, as we might // need to split critical edges on newly constructed blocks for j := 0; j < len(f.Blocks); j++ { b := f.Blocks[j]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.1K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/internal/snapshot/impl/DefaultValueSnapshotter.java
} @Override public ValueSnapshot hashCode(HashCode value) { return new HashCodeSnapshot(value); } @Override public ValueSnapshot enumValue(Enum<?> value) { return new EnumValueSnapshot(value); } @Override public ValueSnapshot classValue(Class<?> value) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jan 11 20:22:01 UTC 2024 - 6.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/print.go
fmt.Fprintf(p.w, "name %s: %v\n", n, vals) } func fprintFunc(p funcPrinter, f *Func) { reachable, live := findlive(f) defer f.Cache.freeBoolSlice(live) p.header(f) printed := make([]bool, f.NumValues()) for _, b := range f.Blocks { p.startBlock(b, reachable[b.ID]) if f.scheduled { // Order of Values has been decided - print in that order. for _, v := range b.Values { p.value(v, live[v.ID])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 3.9K bytes - Viewed (0)