summaryrefslogtreecommitdiff
path: root/lib/CodeGen/SpillPlacement.cpp
diff options
context:
space:
mode:
authorJakob Stoklund Olesen <stoklund@2pi.dk>2012-05-21 03:11:23 +0000
committerJakob Stoklund Olesen <stoklund@2pi.dk>2012-05-21 03:11:23 +0000
commit1dc12aa148f0ecb4135fa3e47e7a2ac81ceac394 (patch)
tree5f17cff29841e3a114691b64a4659a416b5999d5 /lib/CodeGen/SpillPlacement.cpp
parent857ed2260403f2cbfe702e83da283b78e341707e (diff)
downloadllvm-1dc12aa148f0ecb4135fa3e47e7a2ac81ceac394.tar.gz
llvm-1dc12aa148f0ecb4135fa3e47e7a2ac81ceac394.tar.bz2
llvm-1dc12aa148f0ecb4135fa3e47e7a2ac81ceac394.tar.xz
Give a small negative bias to giant edge bundles.
This helps compile time when the greedy register allocator splits live ranges in giant functions. Without the bias, we would try to grow regions through the giant edge bundles, usually to find out that the region became too big and expensive. If a live range has many uses in blocks near the giant bundle, the small negative bias doesn't make a big difference, and we still consider regions including the giant edge bundle. Giant edge bundles are usually connected to landing pads or indirect branches. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@157174 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/SpillPlacement.cpp')
-rw-r--r--lib/CodeGen/SpillPlacement.cpp11
1 files changed, 11 insertions, 0 deletions
diff --git a/lib/CodeGen/SpillPlacement.cpp b/lib/CodeGen/SpillPlacement.cpp
index 6f33f5465c..320128a999 100644
--- a/lib/CodeGen/SpillPlacement.cpp
+++ b/lib/CodeGen/SpillPlacement.cpp
@@ -207,6 +207,17 @@ void SpillPlacement::activate(unsigned n) {
return;
ActiveNodes->set(n);
nodes[n].clear();
+
+ // Very large bundles usually come from big switches, indirect branches,
+ // landing pads, or loops with many 'continue' statements. It is difficult to
+ // allocate registers when so many different blocks are involved.
+ //
+ // Give a small negative bias to large bundles such that 1/32 of the
+ // connected blocks need to be interested before we consider expanding the
+ // region through the bundle. This helps compile time by limiting the number
+ // of blocks visited and the number of links in the Hopfield network.
+ if (bundles->getBlocks(n).size() > 100)
+ nodes[n].Bias = -0.0625f;
}