| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/walker/ |
| H A D | MethodInvocation.java | 50 private final double relevance; field in class:MethodInvocation
80 public MethodInvocation(InlineInfo info, double probability, double relevance, BitSet freshlyInstantiatedArguments) { argument
83 this.relevance = relevance;
110 public double relevance() { method in class:MethodInvocation
111 return relevance;
131 final double invokeRelevance = relevance * callee.relevanceAt(index);
|
| H A D | CallsiteHolderExplorable.java | 67 private final double relevance; field in class:CallsiteHolderExplorable
77 public CallsiteHolderExplorable(StructuredGraph graph, double probability, double relevance, BitSet freshlyInstantiatedArguments, LinkedList<Invoke> invokes) { argument
81 this.relevance = relevance;
212 return Math.min(AbstractInliningPolicy.CapInheritedRelevance, relevance) * computeInliningRelevance.getRelevance(invoke);
|
| H A D | ComputeInliningRelevance.java | 78 * Initializes or updates the relevance computation. If there are no loops within the graph,
109 assert nodeRelevances != null : "uninitialized relevance";
240 * The relevance of an invoke is the ratio between the invoke's probability and the current
247 double relevance = (invokeProbability / getFastPathMinProbability()) * Math.min(1.0, getScopeRelevanceWithinParent());
248 assert !Double.isNaN(relevance) : invoke + ": " + relevance + " / " + invokeProbability + " / " + getFastPathMinProbability() + " / " + getScopeRelevanceWithinParent();
249 return relevance;
|
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/policy/ |
| H A D | GreedyInliningPolicy.java | 69 final double relevance = invocation.relevance();
91 InliningUtil.logNotInlinedMethod(info, inliningDepth, "too large previous low-level graph (low-level-nodes: %d, relevance=%f, probability=%f, bonus=%f, nodes=%d)", lowLevelGraphSize,
92 relevance, probability, inliningBonus, nodes);
97 InliningUtil.logInlinedMethod(info, inliningDepth, fullyProcessed, "trivial (relevance=%f, probability=%f, bonus=%f, nodes=%d)", relevance, probability, inliningBonus, nodes);
109 InliningUtil.logNotInlinedMethod(info, inliningDepth, "callee invoke probability is too high (invokeP=%f, relevance=%f, probability=%f, bonus=%f, nodes=%d)", invokes, relevance,
114 double maximumNodes = computeMaximumSize(relevance, (int) (MaximumInliningSize.getValue(options) * inliningBonus));
116 InliningUtil.logInlinedMethod(info, inliningDepth, fullyProcessed, "relevance
[all...] |
| H A D | AbstractInliningPolicy.java | 48 protected double computeMaximumSize(double relevance, int configuredMaximum) { argument
49 double inlineRatio = Math.min(RelevanceCapForInlining, relevance);
|
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/phases/aot/ |
| H A D | AOTInliningPolicy.java | 75 final double relevance = invocation.relevance();
97 InliningUtil.logInlinedMethod(info, inliningDepth, fullyProcessed, "trivial (relevance=%f, probability=%f, bonus=%f, nodes=%d)", relevance, probability, inliningBonus, nodes);
101 double maximumNodes = computeMaximumSize(relevance, (int) (maxInliningSize(inliningDepth, options) * inliningBonus));
103 InliningUtil.logInlinedMethod(info, inliningDepth, fullyProcessed, "relevance-based (relevance=%f, probability=%f, bonus=%f, nodes=%d <= %f)", relevance, probability, inliningBonus,
108 InliningUtil.logNotInlinedMethod(info, inliningDepth, "relevance-based (relevance
[all...] |