001/*
002 * Copyright (c) 2012, 2015, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.nodes;
024
025import com.oracle.graal.graph.*;
026import com.oracle.graal.graph.spi.*;
027import com.oracle.graal.nodeinfo.*;
028
029@NodeInfo(allowedUsageTypes = {InputType.Association})
030public final class LoopExitNode extends BeginStateSplitNode implements IterableNodeType {
031
032    public static final NodeClass<LoopExitNode> TYPE = NodeClass.create(LoopExitNode.class);
033    @Input(InputType.Association) LoopBeginNode loopBegin;
034
035    public LoopExitNode(LoopBeginNode loop) {
036        super(TYPE);
037        assert loop != null;
038        loopBegin = loop;
039    }
040
041    public LoopBeginNode loopBegin() {
042        return loopBegin;
043    }
044
045    @Override
046    public void simplify(SimplifierTool tool) {
047        Node prev = this.predecessor();
048        while (tool.allUsagesAvailable() && prev instanceof BeginNode && prev.hasNoUsages()) {
049            AbstractBeginNode begin = (AbstractBeginNode) prev;
050            prev = prev.predecessor();
051            graph().removeFixed(begin);
052        }
053    }
054}