43972
|
1 |
/*
|
|
2 |
* Copyright (c) 2011, 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 |
package org.graalvm.compiler.nodes;
|
|
24 |
|
|
25 |
import static org.graalvm.compiler.nodeinfo.InputType.Guard;
|
|
26 |
import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2;
|
|
27 |
import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_2;
|
|
28 |
|
|
29 |
import org.graalvm.compiler.graph.IterableNodeType;
|
|
30 |
import org.graalvm.compiler.graph.NodeClass;
|
|
31 |
import org.graalvm.compiler.graph.spi.SimplifierTool;
|
|
32 |
import org.graalvm.compiler.nodeinfo.NodeInfo;
|
|
33 |
import org.graalvm.compiler.nodes.spi.Lowerable;
|
|
34 |
import org.graalvm.compiler.nodes.spi.LoweringTool;
|
|
35 |
|
|
36 |
import jdk.vm.ci.meta.DeoptimizationAction;
|
|
37 |
import jdk.vm.ci.meta.DeoptimizationReason;
|
|
38 |
import jdk.vm.ci.meta.JavaConstant;
|
|
39 |
|
|
40 |
@NodeInfo(nameTemplate = "FixedGuard(!={p#negated}) {p#reason/s}", allowedUsageTypes = Guard, size = SIZE_2, cycles = CYCLES_2)
|
|
41 |
public final class FixedGuardNode extends AbstractFixedGuardNode implements Lowerable, IterableNodeType {
|
|
42 |
public static final NodeClass<FixedGuardNode> TYPE = NodeClass.create(FixedGuardNode.class);
|
|
43 |
|
|
44 |
public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action) {
|
|
45 |
this(condition, deoptReason, action, JavaConstant.NULL_POINTER, false);
|
|
46 |
}
|
|
47 |
|
|
48 |
public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) {
|
|
49 |
this(condition, deoptReason, action, JavaConstant.NULL_POINTER, negated);
|
|
50 |
}
|
|
51 |
|
|
52 |
public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, JavaConstant speculation, boolean negated) {
|
|
53 |
super(TYPE, condition, deoptReason, action, speculation, negated);
|
|
54 |
}
|
|
55 |
|
|
56 |
@Override
|
|
57 |
public void simplify(SimplifierTool tool) {
|
|
58 |
super.simplify(tool);
|
|
59 |
|
|
60 |
if (getCondition() instanceof LogicConstantNode) {
|
|
61 |
LogicConstantNode c = (LogicConstantNode) getCondition();
|
|
62 |
if (c.getValue() == isNegated()) {
|
|
63 |
FixedNode currentNext = this.next();
|
|
64 |
if (currentNext != null) {
|
|
65 |
tool.deleteBranch(currentNext);
|
|
66 |
}
|
|
67 |
|
|
68 |
DeoptimizeNode deopt = graph().add(new DeoptimizeNode(getAction(), getReason(), getSpeculation()));
|
|
69 |
deopt.setStateBefore(stateBefore());
|
|
70 |
setNext(deopt);
|
|
71 |
}
|
|
72 |
this.replaceAtUsages(null);
|
|
73 |
graph().removeFixed(this);
|
|
74 |
} else if (getCondition() instanceof ShortCircuitOrNode) {
|
|
75 |
ShortCircuitOrNode shortCircuitOr = (ShortCircuitOrNode) getCondition();
|
|
76 |
if (isNegated() && hasNoUsages()) {
|
|
77 |
graph().addAfterFixed(this, graph().add(new FixedGuardNode(shortCircuitOr.getY(), getReason(), getAction(), getSpeculation(), !shortCircuitOr.isYNegated())));
|
|
78 |
graph().replaceFixedWithFixed(this, graph().add(new FixedGuardNode(shortCircuitOr.getX(), getReason(), getAction(), getSpeculation(), !shortCircuitOr.isXNegated())));
|
|
79 |
}
|
|
80 |
}
|
|
81 |
}
|
|
82 |
|
|
83 |
@Override
|
|
84 |
public void lower(LoweringTool tool) {
|
|
85 |
if (graph().getGuardsStage().allowsFloatingGuards()) {
|
48861
|
86 |
if (getAction() != DeoptimizationAction.None) {
|
43972
|
87 |
ValueNode guard = tool.createGuard(this, getCondition(), getReason(), getAction(), getSpeculation(), isNegated()).asNode();
|
|
88 |
this.replaceAtUsages(guard);
|
46344
|
89 |
graph().removeFixed(this);
|
43972
|
90 |
}
|
|
91 |
} else {
|
|
92 |
lowerToIf().lower(tool);
|
|
93 |
}
|
|
94 |
}
|
|
95 |
|
|
96 |
@Override
|
|
97 |
public boolean canDeoptimize() {
|
|
98 |
return true;
|
|
99 |
}
|
|
100 |
}
|