43972
|
1 |
/*
|
58299
|
2 |
* Copyright (c) 2009, 2019, Oracle and/or its affiliates. All rights reserved.
|
43972
|
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 |
*/
|
50858
|
23 |
|
|
24 |
|
43972
|
25 |
package org.graalvm.compiler.nodes.java;
|
|
26 |
|
46393
|
27 |
import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_8;
|
|
28 |
import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_8;
|
43972
|
29 |
|
|
30 |
import org.graalvm.compiler.core.common.type.Stamp;
|
|
31 |
import org.graalvm.compiler.graph.NodeClass;
|
|
32 |
import org.graalvm.compiler.nodeinfo.NodeInfo;
|
|
33 |
import org.graalvm.compiler.nodes.DeoptimizingFixedWithNextNode;
|
|
34 |
import org.graalvm.compiler.nodes.FrameState;
|
57537
|
35 |
import org.graalvm.compiler.nodes.extended.MembarNode;
|
43972
|
36 |
import org.graalvm.compiler.nodes.spi.Lowerable;
|
|
37 |
import org.graalvm.compiler.nodes.spi.LoweringTool;
|
|
38 |
|
57537
|
39 |
import jdk.vm.ci.code.MemoryBarriers;
|
|
40 |
|
43972
|
41 |
/**
|
|
42 |
* The {@code AbstractNewObjectNode} is the base class for the new instance and new array nodes.
|
|
43 |
*/
|
46393
|
44 |
@NodeInfo(cycles = CYCLES_8, cyclesRationale = "tlab alloc + header init", size = SIZE_8)
|
43972
|
45 |
public abstract class AbstractNewObjectNode extends DeoptimizingFixedWithNextNode implements Lowerable {
|
|
46 |
|
|
47 |
public static final NodeClass<AbstractNewObjectNode> TYPE = NodeClass.create(AbstractNewObjectNode.class);
|
|
48 |
protected final boolean fillContents;
|
|
49 |
|
57537
|
50 |
/**
|
|
51 |
* Controls whether this allocation emits a {@link MembarNode} with
|
|
52 |
* {@link MemoryBarriers#STORE_STORE} as part of the object initialization.
|
|
53 |
*/
|
|
54 |
protected boolean emitMemoryBarrier = true;
|
|
55 |
|
43972
|
56 |
protected AbstractNewObjectNode(NodeClass<? extends AbstractNewObjectNode> c, Stamp stamp, boolean fillContents, FrameState stateBefore) {
|
|
57 |
super(c, stamp, stateBefore);
|
|
58 |
this.fillContents = fillContents;
|
|
59 |
}
|
|
60 |
|
|
61 |
/**
|
|
62 |
* @return <code>true</code> if the object's contents should be initialized to zero/null.
|
|
63 |
*/
|
|
64 |
public boolean fillContents() {
|
|
65 |
return fillContents;
|
|
66 |
}
|
|
67 |
|
|
68 |
@Override
|
|
69 |
public void lower(LoweringTool tool) {
|
|
70 |
tool.getLowerer().lower(this, tool);
|
|
71 |
}
|
|
72 |
|
|
73 |
@Override
|
|
74 |
public boolean canDeoptimize() {
|
|
75 |
return true;
|
|
76 |
}
|
57537
|
77 |
|
|
78 |
public boolean emitMemoryBarrier() {
|
|
79 |
return emitMemoryBarrier;
|
|
80 |
}
|
|
81 |
|
|
82 |
public void clearEmitMemoryBarrier() {
|
|
83 |
this.emitMemoryBarrier = false;
|
|
84 |
}
|
43972
|
85 |
}
|