< prev index next >

src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/walker/CallsiteHolderExplorable.java

Print this page
rev 52509 : [mq]: graal2

*** 34,44 **** import org.graalvm.compiler.nodes.Invoke; import org.graalvm.compiler.nodes.ParameterNode; import org.graalvm.compiler.nodes.StructuredGraph; import org.graalvm.compiler.nodes.ValueNode; import org.graalvm.compiler.phases.common.inlining.policy.AbstractInliningPolicy; ! import org.graalvm.compiler.phases.graph.FixedNodeProbabilityCache; import jdk.vm.ci.meta.ResolvedJavaMethod; /** * <p> --- 34,44 ---- import org.graalvm.compiler.nodes.Invoke; import org.graalvm.compiler.nodes.ParameterNode; import org.graalvm.compiler.nodes.StructuredGraph; import org.graalvm.compiler.nodes.ValueNode; import org.graalvm.compiler.phases.common.inlining.policy.AbstractInliningPolicy; ! import org.graalvm.compiler.phases.graph.FixedNodeRelativeFrequencyCache; import jdk.vm.ci.meta.ResolvedJavaMethod; /** * <p>
*** 85,95 **** remainingInvokes = invokes == null ? new InliningIterator(graph).apply() : invokes; if (remainingInvokes.isEmpty()) { probabilities = null; computeInliningRelevance = null; } else { ! probabilities = new FixedNodeProbabilityCache(); computeInliningRelevance = new ComputeInliningRelevance(graph, probabilities); computeProbabilities(); } assert repOK(); } --- 85,95 ---- remainingInvokes = invokes == null ? new InliningIterator(graph).apply() : invokes; if (remainingInvokes.isEmpty()) { probabilities = null; computeInliningRelevance = null; } else { ! probabilities = new FixedNodeRelativeFrequencyCache(); computeInliningRelevance = new ComputeInliningRelevance(graph, probabilities); computeProbabilities(); } assert repOK(); }
< prev index next >