RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-13 14:46:53 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove a bunch of debugging code that was slowing PBQP down by 25% or so.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78601 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2009-08-10 21:49:45 +00:00
parent 027c2b11ea
commit 4600d179fd
1 changed files with 0 additions and 45 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
lib/CodeGen/RegAllocPBQP.cpp
View File

@ -690,51 +690,6 @@ bool PBQPRegAlloc::mapPBQPToRegAlloc(const PBQP::Solution &solution) {
// Clear the existing allocation.
vrm->clearAllVirt();
CoalesceMap coalesces;//(findCoalesces());
for (unsigned i = 0; i < node2LI.size(); ++i) {
if (solution.getSelection(i) == 0) {
continue;
}
unsigned iSel = solution.getSelection(i);
unsigned iAlloc = allowedSets[i][iSel - 1];
for (unsigned j = i + 1; j < node2LI.size(); ++j) {
if (solution.getSelection(j) == 0) {
continue;
}
unsigned jSel = solution.getSelection(j);
unsigned jAlloc = allowedSets[j][jSel - 1];
if ((iAlloc != jAlloc) && !tri->areAliases(iAlloc, jAlloc)) {
continue;
}
if (node2LI[i]->overlaps(*node2LI[j])) {
if (coalesces.find(RegPair(node2LI[i]->reg, node2LI[j]->reg)) == coalesces.end()) {
DEBUG(errs() << "In round " << ++round << ":\n"
<< "Bogusness in " << mf->getFunction()->getName() << "!\n"
<< "Live interval " << i << " (reg" << node2LI[i]->reg << ") and\n"
<< "Live interval " << j << " (reg" << node2LI[j]->reg << ")\n"
<< " were allocated registers " << iAlloc << " (index " << iSel << ") and "
<< jAlloc << "(index " << jSel
<< ") respectively in a graph of " << solution.numNodes() << " nodes.\n"
<< "li[i]->empty() = " << node2LI[i]->empty() << "\n"
<< "li[j]->empty() = " << node2LI[j]->empty() << "\n"
<< "li[i]->overlaps(li[j]) = " << node2LI[i]->overlaps(*node2LI[j]) << "\n"
<< "coalesce = " << (coalesces.find(RegPair(node2LI[i]->reg, node2LI[j]->reg)) != coalesces.end()) << "\n");
DEBUG(errs() << "solution.getCost() = " << solution.getCost() << "\n");
exit(1);
}
}
}
}
// Iterate over the nodes mapping the PBQP solution to a register assignment.
for (unsigned node = 0; node < node2LI.size(); ++node) {
unsigned virtReg = node2LI[node]->reg,