RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-24 04:09:45 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Changes DOUT references in the PBQP allocator to use DEBUG(errs() ...)

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@79378 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Lang Hames 2009-08-18 23:34:50 +00:00
parent b120ab4057
commit 233fd9cea0
1 changed files with 7 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
lib/CodeGen/RegAllocPBQP.cpp
View File

@ -702,7 +702,8 @@ bool PBQPRegAlloc::mapPBQPToRegAlloc(const PBQP::Solution &solution) {
// Get the physical reg, subtracting 1 to account for the spill option.
unsigned physReg = allowedSets[node][allocSelection - 1];
DOUT << "VREG " << virtReg << " -> " << tri->getName(physReg) << "\n";
DEBUG(errs() << "VREG " << virtReg << " -> "
<< tri->getName(physReg) << "\n");
assert(physReg != 0);
@ -724,8 +725,8 @@ bool PBQPRegAlloc::mapPBQPToRegAlloc(const PBQP::Solution &solution) {
lis->addIntervalsForSpills(*spillInterval, spillIs, loopInfo, *vrm);
addStackInterval(spillInterval, mri);
DOUT << "VREG " << virtReg << " -> SPILLED (Cost: "
<< oldSpillWeight << ", New vregs: ";
DEBUG(errs() << "VREG " << virtReg << " -> SPILLED (Cost: "
<< oldSpillWeight << ", New vregs: ");
// Copy any newly inserted live intervals into the list of regs to
// allocate.
@ -735,12 +736,12 @@ bool PBQPRegAlloc::mapPBQPToRegAlloc(const PBQP::Solution &solution) {
assert(!(*itr)->empty() && "Empty spill range.");
DOUT << (*itr)->reg << " ";
DEBUG(errs() << (*itr)->reg << " ");
vregIntervalsToAlloc.insert(*itr);
}
DOUT << ")\n";
DEBUG(errs() << ")\n");
// We need another round if spill intervals were added.
anotherRoundNeeded |= !newSpills.empty();
@ -863,12 +864,7 @@ bool PBQPRegAlloc::runOnMachineFunction(MachineFunction &MF) {
PBQP::HeuristicSolver<PBQP::Heuristics::Briggs> solver;
problem.assignNodeIDs();
PBQP::Solution solution = solver.solve(problem);
/*
std::cerr << "Solution:\n";
for (unsigned i = 0; i < solution.numNodes(); ++i) {
std::cerr << " " << i << " -> " << solution.getSelection(i) << "\n";
}
*/
pbqpAllocComplete = mapPBQPToRegAlloc(solution);
++round;