Mercurial > hg > graal-compiler
view graal/com.oracle.graal.truffle/src/com/oracle/graal/truffle/CompilationProfile.java @ 15708:e5876a0f2453
[inlining] replaced method body with call to code duplicate
author | Miguel Garcia <miguel.m.garcia@oracle.com> |
---|---|
date | Fri, 16 May 2014 14:20:20 +0200 |
parents | ea9d5b6044af |
children | b725292b8a11 |
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 static com.oracle.graal.truffle.TruffleCompilerOptions.*; import java.util.*; public class CompilationProfile { /** * Number of times an installed code for this tree was invalidated. */ private int invalidationCount; /** * Number of times a node was replaced in this tree. */ private int nodeReplaceCount; private long previousTimestamp; private int callCount; private int callAndLoopCount; private int compilationCallThreshold; private int compilationCallAndLoopThreshold; private final int originalInvokeCounter; private final int originalCompilationThreshold; public CompilationProfile(final int compilationThreshold, final int initialInvokeCounter) { this.previousTimestamp = System.nanoTime(); this.compilationCallThreshold = initialInvokeCounter; this.compilationCallAndLoopThreshold = compilationThreshold; this.originalInvokeCounter = initialInvokeCounter; this.originalCompilationThreshold = compilationThreshold; } @Override public String toString() { return String.format("CompilationProfile(callCount=%d/%d, callAndLoopCount=%d/%d)", callCount, compilationCallThreshold, callAndLoopCount, compilationCallAndLoopThreshold); } public Map<String, Object> getDebugProperties() { Map<String, Object> properties = new LinkedHashMap<>(); String callsThreshold = String.format("%7d/%5d", getCallCount(), getCompilationCallThreshold()); String loopsThreshold = String.format("%7d/%5d", getCallAndLoopCount(), getCompilationCallAndLoopThreshold()); String invalidationReplace = String.format("%5d/%5d", invalidationCount, nodeReplaceCount); properties.put("C/T", callsThreshold); properties.put("L/T", loopsThreshold); properties.put("Inval#/Replace#", invalidationReplace); return properties; } public void reset() { callCount = 0; callAndLoopCount = 0; compilationCallAndLoopThreshold = originalCompilationThreshold; compilationCallThreshold = originalInvokeCounter; } public long getPreviousTimestamp() { return previousTimestamp; } public int getInvalidationCount() { return invalidationCount; } public int getNodeReplaceCount() { return nodeReplaceCount; } public int getCallAndLoopCount() { return callAndLoopCount; } public int getCallCount() { return callCount; } public int getCompilationCallAndLoopThreshold() { return compilationCallAndLoopThreshold; } public int getCompilationCallThreshold() { return compilationCallThreshold; } void ensureProfiling(int calls, int callsAndLoop) { int increaseCallAndLoopThreshold = callsAndLoop - (this.compilationCallAndLoopThreshold - this.callAndLoopCount); if (increaseCallAndLoopThreshold > 0) { this.compilationCallAndLoopThreshold += increaseCallAndLoopThreshold; } int increaseCallsThreshold = calls - (this.compilationCallThreshold - this.callCount); if (increaseCallsThreshold > 0) { this.compilationCallThreshold += increaseCallsThreshold; } } void reportTiminingFailed(long timestamp) { ensureProfiling(0, originalCompilationThreshold); this.previousTimestamp = timestamp; } public void reportInvalidated() { invalidationCount++; int reprofile = TruffleInvalidationReprofileCount.getValue(); ensureProfiling(reprofile, reprofile); } public void reportInterpreterCall() { callCount++; callAndLoopCount++; } void reportInlinedCall() { callCount++; callAndLoopCount++; compilationCallThreshold++; compilationCallAndLoopThreshold++; } void reportInterpreterCalls(int calls) { this.callCount += calls; this.callAndLoopCount += calls; } void reportLoopCount(int count) { callAndLoopCount += count; } void reportNodeReplaced() { nodeReplaceCount++; // delay compilation until tree is deemed stable enough int replaceBackoff = TruffleReplaceReprofileCount.getValue(); ensureProfiling(1, replaceBackoff); } }