Mercurial > hg > truffle
changeset 8161:191883d1c563
Undo experiment with using probabilities for split positions.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Fri, 08 Mar 2013 11:19:23 +0100 |
parents | a357b7a3de5e |
children | da10229e5a33 |
files | graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java |
diffstat | 1 files changed, 0 insertions(+), 9 deletions(-) [+] |
line wrap: on
line diff
--- 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";