KillingBeginNode.java revision 13175:3df8ef613001 
1/*
2 * Copyright (c) 2013, 2016, 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 */
23package org.graalvm.compiler.nodes;
24
25import static org.graalvm.compiler.nodeinfo.InputType.Memory;
26import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_0;
27import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_0;
28
29import org.graalvm.compiler.graph.NodeClass;
30import org.graalvm.compiler.nodeinfo.NodeInfo;
31import org.graalvm.compiler.nodes.memory.MemoryCheckpoint;
32import org.graalvm.word.LocationIdentity;
33
34@NodeInfo(allowedUsageTypes = {Memory}, cycles = CYCLES_0, size = SIZE_0)
35public final class KillingBeginNode extends AbstractBeginNode implements MemoryCheckpoint.Single {
36
37    public static final NodeClass<KillingBeginNode> TYPE = NodeClass.create(KillingBeginNode.class);
38    protected LocationIdentity locationIdentity;
39
40    public KillingBeginNode(LocationIdentity locationIdentity) {
41        super(TYPE);
42        this.locationIdentity = locationIdentity;
43    }
44
45    public static AbstractBeginNode begin(FixedNode with, LocationIdentity locationIdentity) {
46        if (with instanceof KillingBeginNode) {
47            return (KillingBeginNode) with;
48        }
49        AbstractBeginNode begin = with.graph().add(KillingBeginNode.create(locationIdentity));
50        begin.setNext(with);
51        return begin;
52    }
53
54    public static AbstractBeginNode create(LocationIdentity locationIdentity) {
55        return new KillingBeginNode(locationIdentity);
56    }
57
58    @Override
59    public LocationIdentity getLocationIdentity() {
60        return locationIdentity;
61    }
62}
63