Mercurial > hg > graal-compiler
view graal/com.oracle.graal.truffle/src/com/oracle/graal/truffle/TruffleInliningProfile.java @ 17560:562643f42b65
Merge with jdk8u5-b13
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Wed, 15 Oct 2014 12:04:20 +0200 |
parents | 89f801a9b4d4 |
children | a8cf75bb781a |
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 java.util.*; public class TruffleInliningProfile { private final OptimizedDirectCallNode callNode; private final int nodeCount; private final int deepNodeCount; private final double frequency; private final boolean recursiveCall; private int graalDeepNodeCount = -1; private String failedReason; private int queryIndex = -1; private double score; public TruffleInliningProfile(OptimizedDirectCallNode callNode, int nodeCount, int deepNodeCount, double frequency, boolean recursiveCall) { this.callNode = callNode; this.nodeCount = nodeCount; this.deepNodeCount = deepNodeCount; this.frequency = frequency; this.recursiveCall = recursiveCall; } public boolean isRecursiveCall() { return recursiveCall; } public OptimizedDirectCallNode getCallNode() { return callNode; } public int getCallSites() { return callNode.getCurrentCallTarget().getKnownCallSiteCount(); } public int getNodeCount() { return nodeCount; } public void setScore(double score) { this.score = score; } public double getScore() { return score; } public String getFailedReason() { return failedReason; } public void setQueryIndex(int queryIndex) { this.queryIndex = queryIndex; } public int getQueryIndex() { return queryIndex; } public void setFailedReason(String reason) { this.failedReason = reason; } public boolean isForced() { return callNode.isInliningForced(); } public double getFrequency() { return frequency; } public int getDeepNodeCount() { return deepNodeCount; } public Map<String, Object> getDebugProperties() { Map<String, Object> properties = new LinkedHashMap<>(); properties.put("ASTSize", String.format("%5d/%5d", nodeCount, deepNodeCount)); properties.put("frequency", String.format("%8.4f", getFrequency())); properties.put("score", String.format("%8.4f", getScore())); properties.put(String.format("index=%3d, force=%s, callSites=%2d", queryIndex, (isForced() ? "Y" : "N"), getCallSites()), ""); if (graalDeepNodeCount != -1) { properties.put("graalCount", String.format("%5d", graalDeepNodeCount)); } properties.put("reason", failedReason); return properties; } public void setGraalDeepNodeCount(int graalDeepNodeCount) { this.graalDeepNodeCount = graalDeepNodeCount; } public int getGraalDeepNodeCount() { return graalDeepNodeCount; } }