Mercurial > hg > graal-compiler
view graal/com.oracle.graal.truffle/src/com/oracle/graal/truffle/OptimizedCallNode.java @ 14991:64dcb92ee75a
Truffle: Change signature for Truffle calls from (PackedFrame, Arguments) to (Object[]).
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Sun, 06 Apr 2014 17:46:24 +0200 |
parents | a5bebb69dc78 |
children | f675818d9ad0 |
line wrap: on
line source
/* * Copyright (c) 2013, 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 com.oracle.graal.truffle; import java.util.concurrent.atomic.*; import com.oracle.truffle.api.*; import com.oracle.truffle.api.CompilerDirectives.CompilationFinal; import com.oracle.truffle.api.impl.*; import com.oracle.truffle.api.nodes.*; import com.oracle.truffle.api.nodes.NodeUtil.NodeCountFilter; /** * Call target that is optimized by Graal upon surpassing a specific invocation threshold. */ public final class OptimizedCallNode extends DefaultCallNode { protected int callCount; private boolean trySplit = true; private boolean inliningForced; @CompilationFinal private OptimizedCallTarget splitCallTarget; private final AtomicInteger inliningCounter = new AtomicInteger(0); private OptimizedCallNode(OptimizedCallTarget target) { super(target); } @Override public boolean isSplittable() { return getCallTarget().getRootNode().isSplittable(); } @Override public OptimizedCallTarget getCallTarget() { return (OptimizedCallTarget) super.getCallTarget(); } public int getCallCount() { return callCount; } @Override public OptimizedCallTarget getCurrentCallTarget() { return (OptimizedCallTarget) super.getCurrentCallTarget(); } @Override public OptimizedCallTarget getSplitCallTarget() { return splitCallTarget; } public static OptimizedCallNode create(OptimizedCallTarget target) { return new OptimizedCallNode(target); } @Override public Object call(Object[] arguments) { if (CompilerDirectives.inInterpreter()) { interpreterCall(); if (inliningCounter.get() > 0 || inliningForced) { return getCurrentCallTarget().callInlined(arguments); } } return getCurrentCallTarget().call(arguments); } private void interpreterCall() { callCount++; if (trySplit) { if (callCount == 1) { // on first call getCurrentCallTarget().incrementKnownCallSite(); } if (callCount > 1) { trySplit = false; if (shouldSplit()) { splitImpl(true); } } } } void notifyInlining() { inliningCounter.incrementAndGet(); } void notifyInliningDone() { inliningCounter.decrementAndGet(); } @Override public void inline() { inliningForced = true; } @Override public boolean isInlined() { return inliningForced; } private void splitImpl(boolean heuristic) { CompilerAsserts.neverPartOfCompilation(); OptimizedCallTarget splitTarget = (OptimizedCallTarget) Truffle.getRuntime().createCallTarget(getCallTarget().getRootNode().split()); splitTarget.setSplitSource(getCallTarget()); if (heuristic) { OptimizedCallTarget.logSplit(this, getCallTarget(), splitTarget); } if (callCount >= 1) { getCallTarget().decrementKnownCallSite(); splitTarget.incrementKnownCallSite(); } this.splitCallTarget = splitTarget; } private boolean shouldSplit() { if (splitCallTarget != null) { return false; } if (!TruffleCompilerOptions.TruffleSplittingEnabled.getValue()) { return false; } if (!isSplittable()) { return false; } OptimizedCallTarget splitTarget = getCallTarget(); int nodeCount = OptimizedCallUtils.countNonTrivialNodes(null, new TruffleCallPath(splitTarget)); if (nodeCount > TruffleCompilerOptions.TruffleSplittingMaxCalleeSize.getValue()) { return false; } // disable recursive splitting for now OptimizedCallTarget root = (OptimizedCallTarget) getRootNode().getCallTarget(); if (root == splitTarget || root.getSplitSource() == splitTarget) { // recursive call found return false; } // max one child call and callCount > 2 and kind of small number of nodes if (isMaxSingleCall()) { return true; } return countPolymorphic() >= 1; } private boolean isMaxSingleCall() { return NodeUtil.countNodes(getCurrentCallTarget().getRootNode(), new NodeCountFilter() { public boolean isCounted(Node node) { return node instanceof CallNode; } }) <= 1; } private int countPolymorphic() { return NodeUtil.countNodes(getCallTarget().getRootNode(), new NodeCountFilter() { public boolean isCounted(Node node) { NodeCost cost = node.getCost(); boolean polymorphic = cost == NodeCost.POLYMORPHIC || cost == NodeCost.MEGAMORPHIC; return polymorphic; } }); } @SuppressWarnings("unused") public void nodeReplaced(Node oldNode, Node newNode, CharSequence reason) { if (!isSplit() && isSplittable()) { trySplit = true; } } }