# HG changeset patch
# User Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
# Date 1362737963 -3600
# Node ID 191883d1c5637b1c6dc76fb690e354dd32d441a0
# Parent  a357b7a3de5ece17acebdde17d93fa57ba5ca68e
Undo experiment with using probabilities for split positions.

diff -r a357b7a3de5e -r 191883d1c563 graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java
--- a/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java	Fri Mar 08 00:50:48 2013 +0100
+++ b/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java	Fri Mar 08 11:19:23 2013 +0100
@@ -46,11 +46,6 @@
  */
 final class LinearScanWalker extends IntervalWalker {
 
-    /**
-     * Delta how much a probability must be lower to be considered a better split position.
-     */
-    private static final double DELTA_FACTOR = 0.75;
-
     private final boolean callKillsRegisters;
 
     private Register[] availableRegs;
@@ -285,7 +280,6 @@
         }
 
         int minLoopDepth = maxBlock.getLoopDepth();
-        double probability = maxBlock.getProbability();
         for (int i = toBlockNr - 1; i >= fromBlockNr; i--) {
             Block cur = blockAt(i);
 
@@ -293,9 +287,6 @@
                 // block with lower loop-depth found . split at the end of this block
                 minLoopDepth = cur.getLoopDepth();
                 optimalSplitPos = allocator.getLastLirInstructionId(cur) + 2;
-            } else if (cur.getLoopDepth() == minLoopDepth && cur.getProbability() < probability * DELTA_FACTOR) {
-                probability = cur.getProbability();
-                optimalSplitPos = allocator.getLastLirInstructionId(cur) + 2;
             }
         }
         assert optimalSplitPos > allocator.maxOpId() || allocator.isBlockBegin(optimalSplitPos) : "algorithm must move split pos to block boundary";