001/* 002 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. 003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 004 * 005 * This code is free software; you can redistribute it and/or modify it 006 * under the terms of the GNU General Public License version 2 only, as 007 * published by the Free Software Foundation. 008 * 009 * This code is distributed in the hope that it will be useful, but WITHOUT 010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 011 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 012 * version 2 for more details (a copy is included in the LICENSE file that 013 * accompanied this code). 014 * 015 * You should have received a copy of the GNU General Public License version 016 * 2 along with this work; if not, write to the Free Software Foundation, 017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 018 * 019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 020 * or visit www.oracle.com if you need additional information or have any 021 * questions. 022 */ 023package com.oracle.graal.truffle.debug; 024 025import static com.oracle.graal.truffle.TruffleCompilerOptions.*; 026 027import java.util.*; 028 029import jdk.internal.jvmci.code.*; 030 031import com.oracle.graal.nodes.*; 032import com.oracle.graal.truffle.*; 033import com.oracle.graal.truffle.TruffleInlining.CallTreeNodeVisitor; 034import com.oracle.truffle.api.nodes.*; 035 036public final class TraceCompilationCallTreeListener extends AbstractDebugCompilationListener { 037 038 private TraceCompilationCallTreeListener() { 039 } 040 041 public static void install(GraalTruffleRuntime runtime) { 042 if (TraceTruffleCompilationCallTree.getValue()) { 043 runtime.addCompilationListener(new TraceCompilationCallTreeListener()); 044 } 045 } 046 047 @Override 048 public void notifyCompilationSuccess(OptimizedCallTarget target, StructuredGraph graph, CompilationResult result) { 049 log(target, 0, "opt call tree", target.toString(), target.getDebugProperties()); 050 logTruffleCallTree(target); 051 } 052 053 private static void logTruffleCallTree(OptimizedCallTarget compilable) { 054 CallTreeNodeVisitor visitor = new CallTreeNodeVisitor() { 055 056 public boolean visit(List<TruffleInlining> decisionStack, Node node) { 057 if (node instanceof OptimizedDirectCallNode) { 058 OptimizedDirectCallNode callNode = ((OptimizedDirectCallNode) node); 059 int depth = decisionStack == null ? 0 : decisionStack.size() - 1; 060 TruffleInliningDecision inlining = CallTreeNodeVisitor.getCurrentInliningDecision(decisionStack); 061 String dispatched = "<dispatched>"; 062 if (inlining != null && inlining.isInline()) { 063 dispatched = ""; 064 } 065 Map<String, Object> properties = new LinkedHashMap<>(); 066 addASTSizeProperty(callNode.getCurrentCallTarget(), properties); 067 properties.putAll(callNode.getCurrentCallTarget().getDebugProperties()); 068 properties.put("Stamp", callNode.getCurrentCallTarget().getArgumentStamp()); 069 log(compilable, depth, "opt call tree", callNode.getCurrentCallTarget().toString() + dispatched, properties); 070 } else if (node instanceof OptimizedIndirectCallNode) { 071 int depth = decisionStack == null ? 0 : decisionStack.size() - 1; 072 log(compilable, depth, "opt call tree", "<indirect>", new LinkedHashMap<String, Object>()); 073 } 074 return true; 075 } 076 077 }; 078 compilable.accept(visitor, true); 079 } 080 081}