Searched refs:forwardEnd (Results 1 - 12 of 12) sorted by relevance

/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DMergeNode.java44 EndNode forwardEnd = node.forwardEndAt(0);
45 forwardEnd.replaceAtPredecessor(currentNext);
47 forwardEnd.markDeleted();
H A DLoopBeginNode.java193 public AbstractEndNode forwardEnd() { method in class:LoopBeginNode
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DReentrantNodeIterator.java142 for (AbstractEndNode forwardEnd : merge.forwardEnds()) {
143 if (forwardEnd != current && !blockEndStates.containsKey(forwardEnd)) {
151 AbstractEndNode forwardEnd = merge.forwardEndAt(i);
152 assert forwardEnd == current || blockEndStates.containsKey(forwardEnd);
153 StateT other = forwardEnd == current ? state : blockEndStates.removeKey(forwardEnd);
H A DReentrantBlockIterator.java174 for (AbstractEndNode forwardEnd : merge.forwardEnds()) {
175 if (forwardEnd != current.getEndNode() && !states.containsKey(forwardEnd)) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/
H A DLoopEx.java134 return (FixedNode) loopBegin().forwardEnd().predecessor();
138 return loopBegin().forwardEnd();
355 AbstractEndNode forwardEnd = loopBegin.forwardEnd();
363 BasicInductionVariable biv = new BasicInductionVariable(loop, (ValuePhiNode) phi, phi.valueAt(forwardEnd), stride, (BinaryArithmeticNode<?>) backValue);
H A DLoopFragmentWhole.java103 return newLoopBegin.forwardEnd();
H A DDefaultLoopPolicies.java72 double entryProbability = cfg.blockFor(loopBegin.forwardEnd()).probability();
H A DLoopFragmentInside.java511 return phi.valueAt(loopBegin.forwardEnd());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/walker/
H A DComputeInliningRelevance.java122 FixedNode current = loopBegin.forwardEnd();
192 double scopeEntryProbability = nodeProbabilities.applyAsDouble(((LoopBeginNode) start).forwardEnd());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop.phases/src/org/graalvm/compiler/loop/phases/
H A DLoopTransformations.java262 AbstractEndNode postEntryNode = postLoopBegin.forwardEnd();
268 preLoopExitNode.setNext(mainLoopBegin.forwardEnd());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/util/
H A DGraphUtil.java160 if (end == ((LoopBeginNode) merge).forwardEnd()) {
421 v2 = ((PhiNode) v2).valueAt(loopBegin.forwardEnd());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.virtual/src/org/graalvm/compiler/virtual/phases/ea/
H A DPartialEscapeClosure.java471 AbstractEndNode end = loopBegin.forwardEnd();

Completed in 117 milliseconds