- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 55 for Predecessors (0.14 sec)
-
src/cmd/compile/internal/ssa/shortcircuit.go
// // p other pred(s) // \ / // b // / \ // t other succ // // in which b is an If block containing a single phi value with a single use (b's Control), // which has a ConstBool arg. // p is the predecessor corresponding to the argument slot in which the ConstBool is found. // t is the successor corresponding to the value of the ConstBool arg. // // Rewrite this into // // p other pred(s) // | / // | b // |/ \
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 03 17:47:02 UTC 2022 - 12.6K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/model/internal/registry/DefaultModelRegistry.java
// Node must be at the predecessor state before calculating dependencies NodeAtState predecessor = new NodeAtState(getPath(), getTargetState().previous()); dependencies.add(graph.nodeAtState(predecessor)); // Transition any other nodes that depend on the predecessor state dependencies.add(new TransitionDependents(predecessor)); seenPredecessor = true;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 24 15:40:00 UTC 2024 - 45.7K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/Node.java
*/ public void maybeInheritFinalizerGroups() { NodeGroup newGroup = group; for (Node predecessor : getDependencyPredecessors()) { if (predecessor.getGroup() instanceof HasFinalizers) { newGroup = maybeInheritGroupAsFinalizerDependency((HasFinalizers) predecessor.getGroup(), newGroup); } } if (newGroup != group) { setGroup(newGroup);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Aug 24 13:30:48 UTC 2023 - 22.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/check.go
for _, c := range b.Preds { if !blockMark[c.b.ID] { f.Fatalf("predecessor block %v for %v is missing", c, b) } } for _, c := range b.Succs { if !blockMark[c.b.ID] { f.Fatalf("successor block %v for %v is missing", c, b) } } } if len(f.Entry.Preds) > 0 { f.Fatalf("entry block %s of %s has predecessor(s) %v", f.Entry, f.Name, f.Entry.Preds) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom_test.go
blocs = append(blocs, Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("p", OpConstBool, types.Types[types.TBOOL], 1, nil), Goto(blockn(0)), ), ) // We want predecessor lists to be long, so 2/3rds of the blocks have a // successor of the first or last block. for i := 0; i < size; i++ { switch i % 3 { case 0: blocs = append(blocs, Bloc(blockn(i),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 13.3K bytes - Viewed (0) -
src/internal/trace/gc.go
} } // An integrator tracks a position in a utilization function and // integrates it. type integrator struct { u *mmuSeries // pos is the index in u.util of the current time's non-strict // predecessor. pos int } // advance returns the integral of the utilization function from 0 to // time. advance must be called on monotonically increasing values of // times.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/phi.go
// This block is dead. // It doesn't matter what we use here as long as it is well-formed. v.Op = ssa.OpUnknown v.Aux = nil continue } // Find variable value on each predecessor. args = args[:0] for _, e := range b.Preds { args = append(args, s.lookupVarOutgoing(e.Block(), v.Type, var_, v.Pos)) } // Decide if we need a phi or not. We need a phi if there
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopbce.go
// only when it's smaller than the limiting value. // Two conditions must happen listed below to accept ind // as an induction variable. // First condition: loop entry has a single predecessor, which // is the header block. This implies that b.Succs[0] is // reached iff ind < limit. if len(b.Succs[0].b.Preds) != 1 { // b.Succs[1] must exit the loop. continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 17:37:47 UTC 2023 - 11.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/branchelim.go
dom.Values = append(dom.Values, post.Values...) // Trash 'post' and 'simple' clobberBlock(post) clobberBlock(simple) f.invalidateCFG() return true } // is this a BlockPlain with one predecessor? func isLeafPlain(b *Block) bool { return b.Kind == BlockPlain && len(b.Preds) == 1 } func clobberBlock(b *Block) { b.Values = nil b.Preds = nil b.Succs = nil b.Aux = nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 30 17:46:51 UTC 2022 - 12.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
phis = append(phis, v) } continue } for _, a := range v.Args { if s.values[a.ID].needSlot { live.add(a.ID) } } } // for each predecessor of b, expand its list of live-at-end values // invariant: s contains the values live at the start of b (excluding phi inputs) for i, e := range b.Preds { p := e.b t.clear() t.addAll(s.live[p.ID])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0)