Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/LoopEndNode.java @ 19526:8fc336a04d77
Create TYPE fields for LIRInstruction and CompositeValue. Renaming NodeClass#get to NodeClass#create.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Fri, 20 Feb 2015 22:22:55 +0100 |
parents | 61d3cb8e1280 |
children |
line wrap: on
line source
/* * Copyright (c) 2011, 2015, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.nodes; import java.util.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodeinfo.*; import com.oracle.graal.nodes.spi.*; /** * LoopEnd nodes represent a loop back-edge. When a LoopEnd is reached, execution continues at the * {@linkplain #loopBegin() loop header}. */ @NodeInfo public final class LoopEndNode extends AbstractEndNode { public static final NodeClass<LoopEndNode> TYPE = NodeClass.create(LoopEndNode.class); @Input(InputType.Association) LoopBeginNode loopBegin; protected boolean canSafepoint; protected int endIndex; public LoopEndNode(LoopBeginNode begin) { super(TYPE); int idx = begin.nextEndIndex(); assert idx >= 0; this.endIndex = idx; this.loopBegin = begin; this.canSafepoint = true; } @Override public AbstractMergeNode merge() { return loopBegin(); } public LoopBeginNode loopBegin() { return loopBegin; } public void setLoopBegin(LoopBeginNode x) { updateUsages(this.loopBegin, x); this.loopBegin = x; } public void disableSafepoint() { this.canSafepoint = false; } public boolean canSafepoint() { return canSafepoint; } @Override public void generate(NodeLIRBuilderTool gen) { gen.visitLoopEnd(this); super.generate(gen); } @Override public boolean verify() { assertTrue(loopBegin != null, "must have a loop begin"); assertTrue(hasNoUsages(), "LoopEnds can not be used"); return super.verify(); } /** * Returns the index of this loop end amongst its {@link LoopBeginNode}'s loop ends.<br> * * Since a LoopBeginNode also has {@linkplain LoopBeginNode#forwardEnds() forward ends}, this is * <b>not</b> the index into {@link PhiNode} values at the loop begin. Use * {@link LoopBeginNode#phiPredecessorIndex(AbstractEndNode)} for this purpose. * */ int endIndex() { return endIndex; } void setEndIndex(int idx) { this.endIndex = idx; } @Override public Iterable<? extends Node> cfgSuccessors() { return Collections.emptyList(); } }