1 /*
2  * Copyright (c) 2012, 2018, Oracle and/or its affiliates. All rights reserved.
3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4  *
5  * This code is free software; you can redistribute it and/or modify it
6  * under the terms of the GNU General Public License version 2 only, as
7  * published by the Free Software Foundation.
8  *
9  * This code is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12  * version 2 for more details (a copy is included in the LICENSE file that
13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 
24 
25 package org.graalvm.compiler.nodes;
26 
27 import static org.graalvm.compiler.nodeinfo.InputType.Association;
28 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_0;
29 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_0;
30 
31 import org.graalvm.compiler.debug.GraalError;
32 import org.graalvm.compiler.graph.IterableNodeType;
33 import org.graalvm.compiler.graph.Node;
34 import org.graalvm.compiler.graph.NodeClass;
35 import org.graalvm.compiler.graph.iterators.NodeIterable;
36 import org.graalvm.compiler.nodeinfo.NodeInfo;
37 import org.graalvm.compiler.nodes.spi.LIRLowerable;
38 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
39 
40 /**
41  * This node will be inserted at point specified by {@link StructuredGraph#getEntryBCI()}, usually
42  * by the graph builder.
43  */
44 @NodeInfo(allowedUsageTypes = Association, cycles = CYCLES_0, size = SIZE_0)
45 public final class EntryMarkerNode extends BeginStateSplitNode implements IterableNodeType, LIRLowerable {
46     public static final NodeClass<EntryMarkerNode> TYPE = NodeClass.create(EntryMarkerNode.class);
47 
EntryMarkerNode()48     public EntryMarkerNode() {
49         super(TYPE);
50     }
51 
52     @Override
generate(NodeLIRBuilderTool gen)53     public void generate(NodeLIRBuilderTool gen) {
54         throw new GraalError("OnStackReplacementNode should not survive");
55     }
56 
57     @Override
anchored()58     public NodeIterable<Node> anchored() {
59         return super.anchored().filter(n -> {
60             if (n instanceof EntryProxyNode) {
61                 EntryProxyNode proxyNode = (EntryProxyNode) n;
62                 return proxyNode.proxyPoint != this;
63             }
64             return true;
65         });
66     }
67 
68     @Override
69     public void prepareDelete(FixedNode evacuateFrom) {
70         for (Node usage : usages().filter(EntryProxyNode.class).snapshot()) {
71             EntryProxyNode proxy = (EntryProxyNode) usage;
72             proxy.replaceAndDelete(proxy.value());
73         }
74         super.prepareDelete(evacuateFrom);
75     }
76 }
77