src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.common/src/org/graalvm/compiler/core/common/alloc/UniDirectionalTraceBuilder.java

rev 52509 : [mq]: graal

@@ -63,11 +63,11 @@
             blocked[block.getId()] = block.getPredecessorCount();
         }
     }
 
     private static int compare(AbstractBlockBase<?> a, AbstractBlockBase<?> b) {
-        return Double.compare(b.probability(), a.probability());
+        return Double.compare(b.getRelativeFrequency(), a.getRelativeFrequency());
     }
 
     private boolean processed(AbstractBlockBase<?> b) {
         return processed.get(b.getId());
     }

@@ -108,11 +108,11 @@
         assert checkPredecessorsProcessed(traceStart);
         ArrayList<AbstractBlockBase<?>> trace = new ArrayList<>();
         int blockNumber = 0;
         try (Indent i = debug.logAndIndent("StartTrace: %s", traceStart)) {
             for (AbstractBlockBase<?> block = traceStart; block != null; block = selectNext(block)) {
-                debug.log("add %s (prob: %f)", block, block.probability());
+                debug.log("add %s (freq: %f)", block, block.getRelativeFrequency());
                 processed.set(block.getId());
                 trace.add(block);
                 unblock(block);
                 block.setLinearScanNumber(blockNumber++);
             }

@@ -147,11 +147,11 @@
      * @return The unprocessed predecessor with the highest probability, or {@code null}.
      */
     private AbstractBlockBase<?> selectNext(AbstractBlockBase<?> block) {
         AbstractBlockBase<?> next = null;
         for (AbstractBlockBase<?> successor : block.getSuccessors()) {
-            if (!processed(successor) && (next == null || successor.probability() > next.probability())) {
+            if (!processed(successor) && (next == null || successor.getRelativeFrequency() > next.getRelativeFrequency())) {
                 next = successor;
             }
         }
         return next;
     }