Mercurial > hg > graal-compiler
view graal/com.oracle.graal.truffle/src/com/oracle/graal/truffle/DefaultTruffleSplittingStrategy.java @ 20942:a2e295c6cf7c
Truffle-DSL: fixed frame might be added twice for polymorphic signatures.
author | Christian Humer <christian.humer@gmail.com> |
---|---|
date | Tue, 14 Apr 2015 19:23:32 +0200 |
parents | 4cd28f6e3485 |
children | 05183a084a08 |
line wrap: on
line source
/* * Copyright (c) 2013, 2014, 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 com.oracle.truffle.api.nodes.*; import com.oracle.truffle.api.nodes.NodeUtil.NodeCountFilter; public class DefaultTruffleSplittingStrategy implements TruffleSplittingStrategy { private final OptimizedDirectCallNode call; public DefaultTruffleSplittingStrategy(OptimizedDirectCallNode call) { this.call = call; } public void beforeCall(Object[] arguments) { if (call.getCallCount() == 2) { if (shouldSplit()) { forceSplitting(); } } } public void forceSplitting() { if (call.isCallTargetCloned()) { return; } call.installSplitCallTarget(call.getCallTarget().cloneUninitialized()); } public void afterCall(Object returnValue) { } private boolean shouldSplit() { if (call.getClonedCallTarget() != null) { return false; } if (!TruffleCompilerOptions.TruffleSplitting.getValue()) { return false; } if (!call.isCallTargetCloningAllowed()) { return false; } OptimizedCallTarget splitTarget = call.getCallTarget(); int nodeCount = splitTarget.getNonTrivialNodeCount(); if (nodeCount > TruffleCompilerOptions.TruffleSplittingMaxCalleeSize.getValue()) { return false; } // disable recursive splitting for now OptimizedCallTarget root = (OptimizedCallTarget) call.getRootNode().getCallTarget(); if (root == splitTarget || root.getSourceCallTarget() == splitTarget) { // recursive call found return false; } // max one child call and callCount > 2 and kind of small number of nodes if (isMaxSingleCall(call)) { return true; } return countPolymorphic(call) >= 1; } private static boolean isMaxSingleCall(OptimizedDirectCallNode call) { return NodeUtil.countNodes(call.getCurrentCallTarget().getRootNode(), new NodeCountFilter() { public boolean isCounted(Node node) { return node instanceof DirectCallNode; } }) <= 1; } private static int countPolymorphic(OptimizedDirectCallNode call) { return NodeUtil.countNodes(call.getCurrentCallTarget().getRootNode(), new NodeCountFilter() { public boolean isCounted(Node node) { NodeCost cost = node.getCost(); boolean polymorphic = cost == NodeCost.POLYMORPHIC || cost == NodeCost.MEGAMORPHIC; return polymorphic; } }); } }