summaryrefslogtreecommitdiff
path: root/include/llvm/CodeGen/PBQP
diff options
context:
space:
mode:
authorLang Hames <lhames@gmail.com>2012-04-03 16:27:16 +0000
committerLang Hames <lhames@gmail.com>2012-04-03 16:27:16 +0000
commitd5be48a9db6bf9b1b399e1309b9654e06a616165 (patch)
treee310e7a016879565c033c0e67c059131bdd2ba99 /include/llvm/CodeGen/PBQP
parent75e3b7fb8fdf069b6f9f1e1db9634ca5701cbe96 (diff)
downloadllvm-d5be48a9db6bf9b1b399e1309b9654e06a616165.tar.gz
llvm-d5be48a9db6bf9b1b399e1309b9654e06a616165.tar.bz2
llvm-d5be48a9db6bf9b1b399e1309b9654e06a616165.tar.xz
Matrix simplification in PBQP may push infinite costs onto register options.
The colorability heuristic should count these as denied registers. No test case - this exposed a bug on an out-of-tree target. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153958 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/CodeGen/PBQP')
-rw-r--r--include/llvm/CodeGen/PBQP/Heuristics/Briggs.h6
1 files changed, 6 insertions, 0 deletions
diff --git a/include/llvm/CodeGen/PBQP/Heuristics/Briggs.h b/include/llvm/CodeGen/PBQP/Heuristics/Briggs.h
index e96c4cb1e0..a859e5899f 100644
--- a/include/llvm/CodeGen/PBQP/Heuristics/Briggs.h
+++ b/include/llvm/CodeGen/PBQP/Heuristics/Briggs.h
@@ -418,6 +418,12 @@ namespace PBQP {
unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
nd.numDenied = 0;
+ const Vector& nCosts = getGraph().getNodeCosts(nItr);
+ for (unsigned i = 1; i < nCosts.getLength(); ++i) {
+ if (nCosts[i] == std::numeric_limits<PBQPNum>::infinity())
+ ++nd.numDenied;
+ }
+
nd.numSafe = numRegs;
nd.unsafeDegrees.resize(numRegs, 0);