Searched refs:LoopBeginNode (Results 26 - 50 of 58) sorted by relevance

123

/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DFloatingReadPhase.java41 import org.graalvm.compiler.nodes.LoopBeginNode;
187 private EconomicSet<LocationIdentity> processLoop(HIRLoop loop, EconomicMap<LoopBeginNode, EconomicSet<LocationIdentity>> modifiedInLoops) {
188 LoopBeginNode loopBegin = (LoopBeginNode) loop.getHeader().getBeginNode();
212 EconomicMap<LoopBeginNode, EconomicSet<LocationIdentity>> modifiedInLoops = null;
288 private final EconomicMap<LoopBeginNode, EconomicSet<LocationIdentity>> modifiedInLoops;
292 public FloatingReadClosure(EconomicMap<LoopBeginNode, EconomicSet<LocationIdentity>> modifiedInLoops, boolean createFloatingReads, boolean createMemoryMapNodes) {
409 protected EconomicMap<LoopExitNode, MemoryMapImpl> processLoop(LoopBeginNode loop, MemoryMapImpl initialState) {
438 private static void createMemoryPhi(LoopBeginNode loop, MemoryMapImpl initialState, EconomicMap<LocationIdentity, MemoryPhiNode> phis, LocationIdentity location) {
H A DGuardLoweringPhase.java35 import org.graalvm.compiler.nodes.LoopBeginNode;
113 LoopExitNode exit = graph.add(new LoopExitNode((LoopBeginNode) loop.getHeader().getBeginNode()));
H A DFrameStateAssignmentPhase.java34 import org.graalvm.compiler.nodes.LoopBeginNode;
116 protected EconomicMap<LoopExitNode, FrameState> processLoop(LoopBeginNode loop, FrameState initialState) {
H A DDeoptimizationGroupingPhase.java36 import org.graalvm.compiler.nodes.LoopBeginNode;
113 end.graph().addBeforeFixed(end, end.graph().add(new LoopExitNode((LoopBeginNode) loop.getHeader().getBeginNode())));
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop.phases/src/org/graalvm/compiler/loop/phases/
H A DLoopTransformations.java58 import org.graalvm.compiler.nodes.LoopBeginNode;
84 LoopBeginNode loopBegin = loop.loopBegin();
168 // (LoopBeginNode) (LoopBeginNode)
183 // | | (LoopBeginNode)
197 // (LoopBeginNode)
226 public static LoopBeginNode insertPrePostLoops(LoopEx loop) {
233 LoopBeginNode preLoopBegin = loop.loopBegin();
245 LoopBeginNode mainLoopBegin = mainLoop.getDuplicatedNode(preLoopBegin);
247 LoopBeginNode postLoopBegi
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/walker/
H A DInliningIterator.java40 import org.graalvm.compiler.nodes.LoopBeginNode;
77 } else if (current instanceof LoopBeginNode) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/
H A DDefaultLoopPolicies.java41 import org.graalvm.compiler.nodes.LoopBeginNode;
71 LoopBeginNode loopBegin = loop.loopBegin();
103 LoopBeginNode loopBegin = loop.loopBegin();
148 LoopBeginNode loopBegin = loop.loopBegin();
H A DLoopEx.java46 import org.graalvm.compiler.nodes.LoopBeginNode;
129 public LoopBeginNode loopBegin() {
130 return (LoopBeginNode) loop().getHeader().getBeginNode();
210 LoopBeginNode loopBegin = loopBegin();
354 LoopBeginNode loopBegin = loop.loopBegin();
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/
H A DLoopBeginNode.java42 public final class LoopBeginNode extends AbstractMergeNode implements IterableNodeType, LIRLowerable { class in inherits:AbstractMergeNode,IterableNodeType,LIRLowerable
44 public static final NodeClass<LoopBeginNode> TYPE = NodeClass.create(LoopBeginNode.class);
66 public LoopBeginNode() { method in class:LoopBeginNode
H A DPhiNode.java42 * {@link AbstractMergeNode} or {@link LoopBeginNode}). For a {@link AbstractMergeNode}, the order
43 * of the values corresponds to the order of the ends. For {@link LoopBeginNode}s, the first value
142 assert !(x instanceof ValuePhiNode) || ((ValuePhiNode) x).merge() instanceof LoopBeginNode || ((ValuePhiNode) x).merge() != this.merge();
181 assert merge() instanceof LoopBeginNode && valueCount >= 2;
234 return merge() instanceof LoopBeginNode;
H A DAbstractMergeNode.java166 if (merge instanceof LoopBeginNode && !(origLoopEnd instanceof LoopEndNode)) {
193 if (merge instanceof LoopBeginNode) {
194 newEnd = graph().add(new LoopEndNode((LoopBeginNode) merge));
H A DValuePhiNode.java82 if (merge() instanceof LoopBeginNode) {
H A DStructuredGraph.java543 return hasNode(LoopBeginNode.TYPE);
671 public void reduceDegenerateLoopBegin(LoopBeginNode begin) {
687 assert !(merge instanceof LoopBeginNode) || ((LoopBeginNode) merge).loopEnds().isEmpty();
701 if (merge instanceof LoopBeginNode) {
702 ((LoopBeginNode) merge).removeExits();
H A DGraphDecoder.java463 (node instanceof LoopBeginNode && (methodScope.loopExplosion == LoopExplosionKind.FULL_UNROLL || methodScope.loopExplosion == LoopExplosionKind.FULL_EXPLODE ||
542 if (node instanceof LoopBeginNode) {
544 handleLoopExplosionBegin(methodScope, loopScope, (LoopBeginNode) node);
571 if (merge instanceof LoopBeginNode) {
663 protected void handleLoopExplosionBegin(MethodScope methodScope, LoopScope loopScope, LoopBeginNode loopBegin) {
949 int numEnds = ((LoopBeginNode) merge).loopEnds().count();
950 ((LoopBeginNode) merge).nextEndIndex = numEnds;
969 boolean lazyPhi = allowLazyPhis() && (!(merge instanceof LoopBeginNode) || methodScope.loopExplosion != LoopExplosionKind.NONE);
1531 LoopBeginNode innerLoopBegin = ((LoopExitNode) predecessor).loopBegin();
1624 LoopBeginNode loopBegi
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/phases/
H A DOnStackReplacementPhase.java45 import org.graalvm.compiler.nodes.LoopBeginNode;
105 final LoopBeginNode originalOSRLoop = osrLoop(originalOSRNode);
253 private static LoopBeginNode osrLoop(EntryMarkerNode osr) {
260 return (LoopBeginNode) l.getHeader().getBeginNode();
H A DWriteBarrierVerificationPhase.java39 import org.graalvm.compiler.nodes.LoopBeginNode;
176 return ((node instanceof DeoptimizingNode) && ((DeoptimizingNode) node).canDeoptimize()) || (node instanceof LoopBeginNode);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop.test/src/org/graalvm/compiler/loop/test/
H A DLoopPartialUnrollTest.java37 import org.graalvm.compiler.nodes.LoopBeginNode;
64 NodeIterable<LoopBeginNode> loops = graph.getNodes().filter(LoopBeginNode.class);
65 for (LoopBeginNode loop : loops) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/util/
H A DGraphUtil.java55 import org.graalvm.compiler.nodes.LoopBeginNode;
158 assert !markedNodes.contains(merge) || (merge instanceof LoopBeginNode && end instanceof LoopEndNode) : merge;
159 if (merge instanceof LoopBeginNode) {
160 if (end == ((LoopBeginNode) merge).forwardEnd()) {
192 if (merge instanceof LoopBeginNode) {
193 LoopBeginNode loopBegin = (LoopBeginNode) merge;
416 LoopBeginNode loopBegin = exit.loopBegin();
453 for (LoopBeginNode begin : graph.getNodes(LoopBeginNode
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/cfg/
H A DControlFlowGraph.java45 import org.graalvm.compiler.nodes.LoopBeginNode;
508 if (beginNode instanceof LoopBeginNode) {
509 computeLoopPredecessors(nodeMap, block, (LoopBeginNode) beginNode);
538 private static void computeLoopPredecessors(NodeMap<Block> nodeMap, Block block, LoopBeginNode loopBeginNode) {
573 if (block.getBeginNode() instanceof LoopBeginNode) {
574 LoopBeginNode loopBegin = (LoopBeginNode) block.getBeginNode();
594 if (beginNode instanceof LoopBeginNode) {
600 LoopBeginNode loopBegin = (LoopBeginNode) beginNod
[all...]
H A DBlock.java38 import org.graalvm.compiler.nodes.LoopBeginNode;
103 return getBeginNode() instanceof LoopBeginNode;
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DReentrantBlockIterator.java38 import org.graalvm.compiler.nodes.LoopBeginNode;
205 LoopBeginNode loopBegin = (LoopBeginNode) loop.getHeader().getBeginNode();
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/
H A DNodePropertiesTest.java31 import org.graalvm.compiler.nodes.LoopBeginNode;
180 NodeIterable<LoopBeginNode> loopBeginNodes = g.getNodes(LoopBeginNode.TYPE);
181 LoopBeginNode loopBeginNode = loopBeginNodes.first();
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/schedule/
H A DMemoryScheduleVerification.java33 import org.graalvm.compiler.nodes.LoopBeginNode;
153 for (MemoryPhiNode memoryPhi : ((LoopBeginNode) l.getHeader().getBeginNode()).memoryPhis()) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.virtual/src/org/graalvm/compiler/virtual/phases/ea/
H A DEffectsClosure.java43 import org.graalvm.compiler.nodes.LoopBeginNode;
109 private final EconomicMap<LoopBeginNode, BlockT> loopEntryStates = EconomicMap.create(Equivalence.IDENTITY);
351 loopEntryStates.put((LoopBeginNode) loop.getHeader().getBeginNode(), loopEntryState);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot.test/src/org/graalvm/compiler/hotspot/test/
H A DWriteBarrierVerificationTest.java46 import org.graalvm.compiler.nodes.LoopBeginNode;
713 protected EconomicMap<LoopExitNode, Boolean> processLoop(LoopBeginNode loop, Boolean initialState) {

Completed in 224 milliseconds

123