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.truffle.api.nodes.*; 034 035public final class TraceCompilationPolymorphismListener extends AbstractDebugCompilationListener { 036 037 private TraceCompilationPolymorphismListener() { 038 } 039 040 public static void install(GraalTruffleRuntime runtime) { 041 if (TraceTruffleCompilationPolymorphism.getValue()) { 042 runtime.addCompilationListener(new TraceCompilationPolymorphismListener()); 043 } 044 } 045 046 @Override 047 public void notifyCompilationSuccess(OptimizedCallTarget target, StructuredGraph graph, CompilationResult result) { 048 super.notifyCompilationSuccess(target, graph, result); 049 target.nodeStream(true).filter(node -> node != null && (node.getCost() == NodeCost.MEGAMORPHIC || node.getCost() == NodeCost.POLYMORPHIC)).// 050 forEach(node -> { 051 NodeCost cost = node.getCost(); 052 Map<String, Object> props = new LinkedHashMap<>(); 053 props.put("simpleName", node.getClass().getSimpleName()); 054 props.put("subtree", "\n" + NodeUtil.printCompactTreeToString(node)); 055 String msg = cost == NodeCost.MEGAMORPHIC ? "megamorphic" : "polymorphic"; 056 log(target, 0, msg, node.toString(), props); 057 }); 058 } 059 060}