blob: 6a2a7cfa6ae9ccca01ca130f31414ce63de03525 [file] [log] [blame]
/*
* Copyright (c) 2011, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.compiler.nodes;
import static org.graalvm.compiler.nodeinfo.InputType.Extension;
import static org.graalvm.compiler.nodeinfo.InputType.Guard;
import static org.graalvm.compiler.nodeinfo.InputType.Memory;
import static org.graalvm.compiler.nodeinfo.InputType.State;
import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_UNKNOWN;
import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_UNKNOWN;
import java.util.Map;
import org.graalvm.compiler.core.common.LocationIdentity;
import org.graalvm.compiler.core.common.type.Stamp;
import org.graalvm.compiler.graph.Node;
import org.graalvm.compiler.graph.NodeClass;
import org.graalvm.compiler.nodeinfo.NodeInfo;
import org.graalvm.compiler.nodeinfo.Verbosity;
import org.graalvm.compiler.nodes.extended.ForeignCallNode;
import org.graalvm.compiler.nodes.extended.GuardingNode;
import org.graalvm.compiler.nodes.java.MethodCallTargetNode;
import org.graalvm.compiler.nodes.memory.MemoryCheckpoint;
import org.graalvm.compiler.nodes.spi.LIRLowerable;
import org.graalvm.compiler.nodes.spi.LoweringTool;
import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
import org.graalvm.compiler.nodes.spi.UncheckedInterfaceProvider;
import org.graalvm.compiler.nodes.util.GraphUtil;
import jdk.vm.ci.meta.JavaKind;
@NodeInfo(nameTemplate = "Invoke!#{p#targetMethod/s}", allowedUsageTypes = {Memory}, cycles = CYCLES_UNKNOWN, size = SIZE_UNKNOWN)
public final class InvokeWithExceptionNode extends ControlSplitNode implements Invoke, MemoryCheckpoint.Single, LIRLowerable, UncheckedInterfaceProvider {
public static final NodeClass<InvokeWithExceptionNode> TYPE = NodeClass.create(InvokeWithExceptionNode.class);
private static final double EXCEPTION_PROBA = 1e-5;
@Successor AbstractBeginNode next;
@Successor AbstractBeginNode exceptionEdge;
@OptionalInput ValueNode classInit;
@Input(Extension) CallTargetNode callTarget;
@OptionalInput(State) FrameState stateDuring;
@OptionalInput(State) FrameState stateAfter;
@OptionalInput(Guard) GuardingNode guard;
protected final int bci;
protected boolean polymorphic;
protected boolean useForInlining;
protected double exceptionProbability;
public InvokeWithExceptionNode(CallTargetNode callTarget, AbstractBeginNode exceptionEdge, int bci) {
super(TYPE, callTarget.returnStamp().getTrustedStamp());
this.exceptionEdge = exceptionEdge;
this.bci = bci;
this.callTarget = callTarget;
this.polymorphic = false;
this.useForInlining = true;
this.exceptionProbability = EXCEPTION_PROBA;
}
public AbstractBeginNode exceptionEdge() {
return exceptionEdge;
}
public void setExceptionEdge(AbstractBeginNode x) {
updatePredecessor(exceptionEdge, x);
exceptionEdge = x;
}
@Override
public AbstractBeginNode next() {
return next;
}
public void setNext(AbstractBeginNode x) {
updatePredecessor(next, x);
next = x;
}
@Override
public CallTargetNode callTarget() {
return callTarget;
}
void setCallTarget(CallTargetNode callTarget) {
updateUsages(this.callTarget, callTarget);
this.callTarget = callTarget;
}
public MethodCallTargetNode methodCallTarget() {
return (MethodCallTargetNode) callTarget;
}
@Override
public boolean isPolymorphic() {
return polymorphic;
}
@Override
public void setPolymorphic(boolean value) {
this.polymorphic = value;
}
@Override
public boolean useForInlining() {
return useForInlining;
}
@Override
public void setUseForInlining(boolean value) {
this.useForInlining = value;
}
@Override
public String toString(Verbosity verbosity) {
if (verbosity == Verbosity.Long) {
return super.toString(Verbosity.Short) + "(bci=" + bci() + ")";
} else if (verbosity == Verbosity.Name) {
return "Invoke#" + (callTarget == null ? "null" : callTarget().targetName());
} else {
return super.toString(verbosity);
}
}
@Override
public int bci() {
return bci;
}
@Override
public void setNext(FixedNode x) {
if (x != null) {
this.setNext(KillingBeginNode.begin(x, getLocationIdentity()));
} else {
this.setNext(null);
}
}
@Override
public void lower(LoweringTool tool) {
tool.getLowerer().lower(this, tool);
}
@Override
public void generate(NodeLIRBuilderTool gen) {
gen.emitInvoke(this);
}
@Override
public FrameState stateAfter() {
return stateAfter;
}
@Override
public void setStateAfter(FrameState stateAfter) {
updateUsages(this.stateAfter, stateAfter);
this.stateAfter = stateAfter;
}
@Override
public boolean hasSideEffect() {
return true;
}
@Override
public LocationIdentity getLocationIdentity() {
return LocationIdentity.any();
}
@Override
public Map<Object, Object> getDebugProperties(Map<Object, Object> map) {
Map<Object, Object> debugProperties = super.getDebugProperties(map);
if (callTarget != null) {
debugProperties.put("targetMethod", callTarget.targetName());
}
return debugProperties;
}
public void killExceptionEdge() {
AbstractBeginNode edge = exceptionEdge();
setExceptionEdge(null);
GraphUtil.killCFG(edge);
}
@Override
public void intrinsify(Node node) {
assert !(node instanceof ValueNode) || (((ValueNode) node).getStackKind() == JavaKind.Void) == (getStackKind() == JavaKind.Void);
CallTargetNode call = callTarget;
FrameState state = stateAfter();
killExceptionEdge();
if (node instanceof StateSplit) {
StateSplit stateSplit = (StateSplit) node;
stateSplit.setStateAfter(state);
}
if (node instanceof ForeignCallNode) {
ForeignCallNode foreign = (ForeignCallNode) node;
foreign.setBci(bci());
}
if (node == null) {
assert getStackKind() == JavaKind.Void && hasNoUsages();
graph().removeSplit(this, next());
} else if (node instanceof ControlSinkNode) {
this.replaceAtPredecessor(node);
this.replaceAtUsages(null);
GraphUtil.killCFG(this);
return;
} else {
graph().replaceSplit(this, node, next());
}
GraphUtil.killWithUnusedFloatingInputs(call);
if (state.hasNoUsages()) {
GraphUtil.killWithUnusedFloatingInputs(state);
}
}
@Override
public double probability(AbstractBeginNode successor) {
return successor == next ? 1 - exceptionProbability : exceptionProbability;
}
@Override
public boolean canDeoptimize() {
return true;
}
@Override
public FrameState stateDuring() {
return stateDuring;
}
@Override
public void setStateDuring(FrameState stateDuring) {
updateUsages(this.stateDuring, stateDuring);
this.stateDuring = stateDuring;
}
@Override
public GuardingNode getGuard() {
return guard;
}
@Override
public void setGuard(GuardingNode guard) {
updateUsagesInterface(this.guard, guard);
this.guard = guard;
}
@Override
public AbstractBeginNode getPrimarySuccessor() {
return this.next();
}
@Override
public Stamp uncheckedStamp() {
return this.callTarget.returnStamp().getUncheckedStamp();
}
@Override
public void setClassInit(ValueNode classInit) {
this.classInit = classInit;
updateUsages(null, classInit);
}
@Override
public ValueNode classInit() {
return classInit;
}
}