Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/LoopExitNode.java @ 18123:3c7e73362d6a
Encapsulate FrameMap.registerConfig & FrameMap.target.
author | Josef Eisl <josef.eisl@jku.at> |
---|---|
date | Mon, 20 Oct 2014 12:12:52 +0200 |
parents | 45b45f902bed |
children | f57d86eb036f |
line wrap: on
line source
/* * Copyright (c) 2012, 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 com.oracle.graal.graph.*; import com.oracle.graal.graph.spi.*; import com.oracle.graal.nodeinfo.*; @NodeInfo(allowedUsageTypes = {InputType.Association}) public class LoopExitNode extends BeginStateSplitNode implements IterableNodeType { @Input(InputType.Association) LoopBeginNode loopBegin; public static LoopExitNode create(LoopBeginNode loop) { return new LoopExitNode(loop); } protected LoopExitNode(LoopBeginNode loop) { assert loop != null; loopBegin = loop; } public LoopBeginNode loopBegin() { return loopBegin; } @Override public void simplify(SimplifierTool tool) { Node prev = this.predecessor(); while (prev.getClass() == BeginNode.class && prev.usages().isEmpty()) { BeginNode begin = (BeginNode) prev; prev = prev.predecessor(); graph().removeFixed(begin); } } }