src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/contract/NodeCostUtil.java

rev 52509 : [mq]: graal2

@@ -81,16 +81,16 @@
         double weightedCycles = 0D;
         DebugContext debug = graph.getDebug();
         try (DebugContext.Scope s = debug.scope("NodeCostSummary")) {
             for (Block block : cfg.getBlocks()) {
                 for (Node n : blockToNodes.apply(block)) {
-                    double probWeighted = n.estimatedNodeCycles().value * block.probability();
+                    double probWeighted = n.estimatedNodeCycles().value * block.getRelativeFrequency();
                     assert Double.isFinite(probWeighted);
                     weightedCycles += probWeighted;
                     if (debug.isLogEnabled()) {
-                        debug.log("Node %s contributes cycles:%f size:%d to graph %s [block prob:%f]", n, n.estimatedNodeCycles().value * block.probability(),
-                                        n.estimatedNodeSize().value, graph, block.probability());
+                        debug.log("Node %s contributes cycles:%f size:%d to graph %s [block freq:%f]", n, n.estimatedNodeCycles().value * block.getRelativeFrequency(),
+                                        n.estimatedNodeSize().value, graph, block.getRelativeFrequency());
                     }
                 }
             }
         }
         assert weightedCycles >= 0D;