001/*
002 * Copyright (c) 2014, 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 jdk.internal.jvmci.code.*;
026
027import com.oracle.graal.graph.*;
028import com.oracle.graal.graph.spi.*;
029import com.oracle.graal.nodeinfo.*;
030import com.oracle.graal.nodes.spi.*;
031
032@NodeInfo
033public final class SimpleInfopointNode extends InfopointNode implements LIRLowerable, IterableNodeType, Simplifiable {
034    public static final NodeClass<SimpleInfopointNode> TYPE = NodeClass.create(SimpleInfopointNode.class);
035    protected BytecodePosition position;
036
037    public SimpleInfopointNode(InfopointReason reason, BytecodePosition position) {
038        super(TYPE, reason);
039        this.position = position;
040    }
041
042    @Override
043    public void generate(NodeLIRBuilderTool generator) {
044        generator.visitSimpleInfopointNode(this);
045    }
046
047    public BytecodePosition getPosition() {
048        return position;
049    }
050
051    public void addCaller(BytecodePosition caller) {
052        this.position = position.addCaller(caller);
053    }
054
055    @Override
056    public void simplify(SimplifierTool tool) {
057        if (next() instanceof SimpleInfopointNode) {
058            graph().removeFixed(this);
059        }
060    }
061
062    public void setPosition(BytecodePosition position) {
063        this.position = position;
064    }
065
066    @Override
067    public boolean verify() {
068        BytecodePosition pos = position;
069        if (pos != null) {
070            // Verify that the outermost position belongs to this graph.
071            while (pos.getCaller() != null) {
072                pos = pos.getCaller();
073            }
074            assert pos.getMethod().equals(graph().method());
075        }
076        return super.verify();
077    }
078}