use of com.oracle.truffle.api.nodes.NodeCost in project graal by oracle.
the class TraceCompilationPolymorphismListener method onCompilationSuccess.
@Override
public void onCompilationSuccess(OptimizedCallTarget target, TruffleInlining inliningDecision, GraphInfo graph, CompilationResultInfo result) {
for (Node node : target.nodeIterable(inliningDecision)) {
if (node != null && (node.getCost() == NodeCost.MEGAMORPHIC || node.getCost() == NodeCost.POLYMORPHIC)) {
NodeCost cost = node.getCost();
Map<String, Object> props = new LinkedHashMap<>();
props.put("simpleName", node.getClass().getSimpleName());
props.put("subtree", "\n" + NodeUtil.printCompactTreeToString(node));
String msg = cost == NodeCost.MEGAMORPHIC ? "megamorphic" : "polymorphic";
runtime.logEvent(0, msg, node.toString(), props);
}
}
}
use of com.oracle.truffle.api.nodes.NodeCost in project graal by oracle.
the class SplittingStrategyTest method testDefaultStrategyStabilises.
@Test
@SuppressWarnings("try")
public void testDefaultStrategyStabilises() {
try (TruffleCompilerOptions.TruffleOptionsOverrideScope s = TruffleCompilerOptions.overrideOptions(TruffleCompilerOptions.TruffleSplittingMaxNumberOfSplitNodes, fallbackSplitInfo.getSplitLimit() + 1000)) {
createDummyTargetsToBoostGrowingSplitLimit();
class InnerRootNode extends SplittableRootNode {
OptimizedCallTarget target;
@Child
private DirectCallNode callNode1;
@Child
private Node polymorphic = new Node() {
@Override
public NodeCost getCost() {
return NodeCost.POLYMORPHIC;
}
};
protected InnerRootNode() {
super();
}
@Override
public Object execute(VirtualFrame frame) {
CompilerDirectives.transferToInterpreterAndInvalidate();
if (callNode1 == null) {
callNode1 = runtime.createDirectCallNode(target);
adoptChildren();
}
if (frame.getArguments().length > 0) {
if ((Integer) frame.getArguments()[0] < 100) {
callNode1.call(frame.getArguments());
}
}
return null;
}
@Override
public String toString() {
return "INNER";
}
}
final InnerRootNode innerRootNode = new InnerRootNode();
final OptimizedCallTarget inner = (OptimizedCallTarget) runtime.createCallTarget(innerRootNode);
final OptimizedCallTarget mid = (OptimizedCallTarget) runtime.createCallTarget(new SplittableRootNode() {
@Child
private DirectCallNode callNode = null;
@Child
private Node polymorphic = new Node() {
@Override
public NodeCost getCost() {
return NodeCost.POLYMORPHIC;
}
};
@Override
public Object execute(VirtualFrame frame) {
CompilerDirectives.transferToInterpreterAndInvalidate();
if (callNode == null) {
callNode = runtime.createDirectCallNode(inner);
adoptChildren();
}
Object[] arguments = frame.getArguments();
if ((Integer) arguments[0] < 100) {
callNode.call(new Object[] { ((Integer) arguments[0]) + 1 });
}
return null;
}
@Override
public String toString() {
return "MID";
}
});
OptimizedCallTarget outside = (OptimizedCallTarget) runtime.createCallTarget(new SplittableRootNode() {
// runtime.createDirectCallNode(mid);
@Child
private DirectCallNode outsideCallNode = null;
@Override
public Object execute(VirtualFrame frame) {
CompilerDirectives.transferToInterpreterAndInvalidate();
// Emulates builtin i.e. Split immediately
if (outsideCallNode == null) {
outsideCallNode = runtime.createDirectCallNode(mid);
adoptChildren();
outsideCallNode.cloneCallTarget();
}
return outsideCallNode.call(frame.getArguments());
}
@Override
public String toString() {
return "OUTSIDE";
}
});
innerRootNode.target = outside;
createDummyTargetsToBoostGrowingSplitLimit();
final int baseSplitCount = listener.splitCount;
outside.call(1);
// Expected 14
// OUTSIDE MID
// MID <split> INNER
// INNER <split> OUTSIDE
// OUTSIDE <split> MID
// INNER OUTSIDE
// OUTSIDE <split> MID
// MID <split> INNER
// MID <split> INNER
// INNER <split> OUTSIDE
// OUTSIDE <split> MID
// INNER <split> OUTSIDE
// OUTSIDE <split> MID
// MID <split> INNER
Assert.assertEquals("Not the right number of splits.", baseSplitCount + 13, listener.splitCount);
}
}
Aggregations