/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/ |
H A D | MergeableState.java | 30 import org.graalvm.compiler.nodes.LoopBeginNode; 48 * This method is called before a loop is entered (before the {@link LoopBeginNode} is visited). 52 public void loopBegin(LoopBeginNode loopBegin) { 61 * {@link LoopBeginNode#orderedLoopEnds()} 63 public void loopEnds(LoopBeginNode loopBegin, List<T> loopEndStates) {
|
H A D | ScopedPostOrderNodeIterator.java | 39 import org.graalvm.compiler.nodes.LoopBeginNode; 77 } else if (current instanceof LoopBeginNode) { 78 queueLoopBeginSuccessors((LoopBeginNode) current); 99 protected void queueLoopBeginSuccessors(LoopBeginNode node) { 102 } else if (currentScopeStart instanceof LoopBeginNode) { 106 if (!((LoopBeginNode) currentScopeStart).loopExits().contains(loopExit)) { 116 if (!(currentScopeStart instanceof LoopBeginNode) || !((LoopBeginNode) currentScopeStart).loopExits().contains(node)) { 124 for (LoopBeginNode loopBegin : graph.getNodes(LoopBeginNode [all...] |
H A D | StatelessPostOrderNodeIterator.java | 37 import org.graalvm.compiler.nodes.LoopBeginNode; 62 if (current instanceof LoopBeginNode) { 63 loopBegin((LoopBeginNode) current); 64 current = ((LoopBeginNode) current).next(); 126 protected void loopBegin(LoopBeginNode loopBegin) {
|
H A D | PostOrderNodeIterator.java | 41 import org.graalvm.compiler.nodes.LoopBeginNode; 86 } else if (current instanceof LoopBeginNode) { 87 state.loopBegin((LoopBeginNode) current); 90 loopBegin((LoopBeginNode) current); 91 current = ((LoopBeginNode) current).next(); 176 LoopBeginNode begin = end.loopBegin(); 224 protected void loopBegin(LoopBeginNode loopBegin) {
|
H A D | SinglePassNodeIterator.java | 41 import org.graalvm.compiler.nodes.LoopBeginNode; 180 } else if (current instanceof LoopBeginNode) { 181 state.loopBegin((LoopBeginNode) current); 184 loopBegin((LoopBeginNode) current); 185 current = ((LoopBeginNode) current).next(); 300 LoopBeginNode begin = end.loopBegin(); 355 protected void loopBegin(LoopBeginNode loopBegin) { 386 assert (x instanceof LoopBeginNode) || (x instanceof LoopEndNode) || (x instanceof EndNode);
|
H A D | ReentrantNodeIterator.java | 38 import org.graalvm.compiler.nodes.LoopBeginNode; 66 protected abstract EconomicMap<LoopExitNode, StateT> processLoop(LoopBeginNode loop, StateT initialState); 82 public static <StateT> LoopInfo<StateT> processLoop(NodeIteratorClosure<StateT> closure, LoopBeginNode loop, StateT initialState) { 103 private static <StateT> EconomicMap<FixedNode, StateT> apply(NodeIteratorClosure<StateT> closure, FixedNode start, StateT initialState, LoopBeginNode boundary) { 133 if (merge instanceof LoopBeginNode) { 134 EconomicMap<LoopExitNode, StateT> loopExitState = closure.processLoop((LoopBeginNode) merge, state);
|
H A D | FixedNodeProbabilityCache.java | 37 import org.graalvm.compiler.nodes.LoopBeginNode; 129 if (current instanceof LoopBeginNode) { 130 result = multiplyProbabilities(result, ((LoopBeginNode) current).loopFrequency());
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
H A D | LoopSafepointInsertionPhase.java | 27 import org.graalvm.compiler.nodes.LoopBeginNode; 48 for (LoopBeginNode loopBeginNode : graph.getNodes(LoopBeginNode.TYPE)) {
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/nodes/ |
H A D | ExplodeLoopNode.java | 36 import org.graalvm.compiler.nodes.LoopBeginNode; 52 public LoopBeginNode findLoopBegin() { 55 while (!(currentNext instanceof LoopBeginNode)) { 66 return (LoopBeginNode) currentNext;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.api.directives.test/src/org/graalvm/compiler/api/directives/test/ |
H A D | IterationDirectiveTest.java | 31 import org.graalvm.compiler.nodes.LoopBeginNode; 56 NodeIterable<LoopBeginNode> loopBeginNodes = graph.getNodes(LoopBeginNode.TYPE); 57 Assert.assertEquals("LoopBeginNode count", 1, loopBeginNodes.count()); 59 LoopBeginNode loopBeginNode = loopBeginNodes.first();
|
H A D | ControlFlowAnchorDirectiveTest.java | 42 import org.graalvm.compiler.nodes.LoopBeginNode; 125 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 0) 134 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 1) 151 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 1) 164 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 1) 184 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 2) 196 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 1)
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/walker/ |
H A D | ComputeInliningRelevance.java | 39 import org.graalvm.compiler.nodes.LoopBeginNode; 91 EconomicMap<LoopBeginNode, Scope> loops = EconomicMap.create(Equivalence.IDENTITY, EXPECTED_LOOP_COUNT); 94 for (LoopBeginNode loopBegin : graph.getNodes(LoopBeginNode.TYPE)) { 117 private Scope createLoopScope(LoopBeginNode loopBegin, EconomicMap<LoopBeginNode, Scope> loops, Scope topScope) { 125 if (current instanceof LoopBeginNode) { 126 // if we reach a LoopBeginNode then we're within this loop 127 parent = createLoopScope((LoopBeginNode) current, loops, topScope); 190 if (start instanceof LoopBeginNode) { [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
H A D | LoopEndNode.java | 49 * The declared type of the field cannot be LoopBeginNode, because loop explosion during partial 67 * {@link LoopBeginNode#canEndsSafepoint loop begin}. New loop ends inherit the flag value from 72 public LoopEndNode(LoopBeginNode begin) { 86 public LoopBeginNode loopBegin() { 87 return (LoopBeginNode) loopBegin; 90 public void setLoopBegin(LoopBeginNode x) { 97 * {@link LoopBeginNode#disableSafepoint() the whole loop}. 122 * Returns the index of this loop end amongst its {@link LoopBeginNode}'s loop ends.<br> 124 * Since a LoopBeginNode also has {@linkplain LoopBeginNode#forwardEnd [all...] |
H A D | LoopExitNode.java | 43 * The declared type of the field cannot be LoopBeginNode, because loop explosion during partial 49 public LoopExitNode(LoopBeginNode loop) { 55 public LoopBeginNode loopBegin() { 56 return (LoopBeginNode) loopBegin;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/cfg/ |
H A D | HIRLoop.java | 26 import org.graalvm.compiler.nodes.LoopBeginNode; 39 return ((LoopBeginNode) getHeader().getBeginNode()).loopEnds().count();
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes.test/src/org/graalvm/compiler/nodes/test/ |
H A D | LoopPhiCanonicalizerTest.java | 31 import org.graalvm.compiler.nodes.LoopBeginNode; 65 NodePredicate loopPhis = node -> node instanceof PhiNode && ((PhiNode) node).merge() instanceof LoopBeginNode;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/deopt/ |
H A D | MonitorDeoptTest.java | 38 import org.graalvm.compiler.nodes.LoopBeginNode; 159 private static LoopBeginNode findFirstLoop(StructuredGraph graph) { 162 if (node instanceof LoopBeginNode) { 163 return (LoopBeginNode) node; 180 LoopBeginNode loopBegin = findFirstLoop(graph);
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/ |
H A D | LoopsData.java | 32 import org.graalvm.compiler.nodes.LoopBeginNode; 42 private final EconomicMap<LoopBeginNode, LoopEx> loopBeginToEx = EconomicMap.create(Equivalence.IDENTITY); 78 return loopBeginToEx.get((LoopBeginNode) loop.getHeader().getBeginNode()); 81 public LoopEx loop(LoopBeginNode loopBegin) {
|
H A D | LoopFragmentWhole.java | 33 import org.graalvm.compiler.nodes.LoopBeginNode; 102 LoopBeginNode newLoopBegin = getDuplicatedNode(original().loop().loopBegin()); 114 LoopBeginNode loopBegin = original().loop().loopBegin();
|
H A D | LoopFragmentInside.java | 47 import org.graalvm.compiler.nodes.LoopBeginNode; 171 LoopBeginNode mainLoopBegin = loop.loopBegin(); 234 LoopBeginNode mainLoopBegin = loop.loopBegin(); 309 LoopBeginNode loopBegin = loop().loopBegin(); 341 final LoopBeginNode loopBegin = loop().loopBegin(); 406 LoopBeginNode loopBegin = loop().loopBegin(); 508 LoopBeginNode loopBegin = original().loop().loopBegin(); 525 LoopBeginNode loopBegin = original().loop().loopBegin(); 546 LoopBeginNode loopBegin = original().loop().loopBegin();
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.amd64/src/org/graalvm/compiler/core/amd64/ |
H A D | AMD64AddressNode.java | 35 import org.graalvm.compiler.nodes.LoopBeginNode; 79 if (phi.merge() instanceof LoopBeginNode) { 80 LoopBeginNode loopNode = (LoopBeginNode) phi.merge();
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/ |
H A D | LoopFullUnrollTest.java | 29 import org.graalvm.compiler.nodes.LoopBeginNode; 92 assertTrue(graph.getNodes().filter(LoopBeginNode.class).count() == loopCount);
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.java/src/org/graalvm/compiler/java/ |
H A D | ComputeLoopFrequenciesClosure.java | 31 import org.graalvm.compiler.nodes.LoopBeginNode; 73 protected EconomicMap<LoopExitNode, Double> processLoop(LoopBeginNode loop, Double initialState) {
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/phases/profiling/ |
H A D | FinalizeProfileNodesPhase.java | 37 import org.graalvm.compiler.nodes.LoopBeginNode; 121 Map<LoopBeginNode, ValueNode> loopRandomValueCache = new HashMap<>(); 130 LoopBeginNode loopBegin = (LoopBeginNode) loop.getHeader().getBeginNode();
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/util/ |
H A D | GraphOrder.java | 40 import org.graalvm.compiler.nodes.LoopBeginNode; 79 if (node instanceof PhiNode && ((PhiNode) node).merge() instanceof LoopBeginNode) { 158 final EconomicMap<LoopBeginNode, NodeBitMap> loopEntryStates = EconomicMap.create(Equivalence.IDENTITY); 200 if (node instanceof LoopBeginNode) { 202 loopEntryStates.put((LoopBeginNode) node, currentState.copy());
|