RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-02-22 11:42:42 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Clean up debug output.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@110940 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Jakob Stoklund Olesen 2010-08-12 18:50:55 +00:00
parent 6da9cee0f1
commit e1f543fbb3
2 changed files with 32 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lib/CodeGen/CalcSpillWeights.cpp
View File

@ -201,8 +201,6 @@ void VirtRegAuxInfo::CalculateRegClass(unsigned reg) {
// This could happen if reg is only used by COPY instructions, so we may need
// to improve on this.
if (rcs.empty()) {
DEBUG(dbgs() << "Not inflating unconstrained" << orc->getName() << ":%reg"
<< reg << ".\n");
return;
}

36
lib/CodeGen/SplitKit.cpp
View File

@ -72,11 +72,10 @@ void SplitAnalysis::analyzeUses() {
if (MachineLoop *Loop = loops_.getLoopFor(MBB))
usingLoops_.insert(Loop);
}
DEBUG(dbgs() << "Counted "
DEBUG(dbgs() << " counted "
<< usingInstrs_.size() << " instrs, "
<< usingBlocks_.size() << " blocks, "
<< usingLoops_.size() << " loops in "
<< *curli_ << "\n");
<< usingLoops_.size() << " loops.\n");
}
// Get three sets of basic blocks surrounding a loop: Blocks inside the loop,
@ -226,7 +225,7 @@ const MachineLoop *SplitAnalysis::getBestSplitLoop() {
// FIXME: We need an SSA updater to properly handle multiple exit blocks.
if (Blocks.Exits.size() > 1) {
DEBUG(dbgs() << "MultipleExits: " << **I);
DEBUG(dbgs() << " multiple exits from " << **I);
continue;
}
@ -239,15 +238,16 @@ const MachineLoop *SplitAnalysis::getBestSplitLoop() {
LPS = &SecondLoops;
break;
case ContainedInLoop:
DEBUG(dbgs() << "ContainedInLoop: " << **I);
DEBUG(dbgs() << " contained in " << **I);
continue;
case SinglePeripheral:
DEBUG(dbgs() << "SinglePeripheral: " << **I);
DEBUG(dbgs() << " single peripheral use in " << **I);
continue;
}
// Will it be possible to split around this loop?
getCriticalExits(Blocks, CriticalExits);
DEBUG(dbgs() << CriticalExits.size() << " critical exits: " << **I);
DEBUG(dbgs() << " " << CriticalExits.size() << " critical exits from "
<< **I);
if (!canSplitCriticalExits(Blocks, CriticalExits))
continue;
// This is a possible split.
@ -255,8 +255,8 @@ const MachineLoop *SplitAnalysis::getBestSplitLoop() {
LPS->insert(*I);
}
DEBUG(dbgs() << "Got " << Loops.size() << " + " << SecondLoops.size()
<< " candidate loops\n");
DEBUG(dbgs() << " getBestSplitLoop found " << Loops.size() << " + "
<< SecondLoops.size() << " candidate loops.\n");
// If there are no first class loops available, look at second class loops.
if (Loops.empty())
@ -275,7 +275,7 @@ const MachineLoop *SplitAnalysis::getBestSplitLoop() {
if (!Best || Idx < BestIdx)
Best = *I, BestIdx = Idx;
}
DEBUG(dbgs() << "Best: " << *Best);
DEBUG(dbgs() << " getBestSplitLoop found " << *Best);
return Best;
}
@ -345,7 +345,6 @@ LiveInterval *SplitEditor::getDupLI() {
// Create an interval for dupli that is a copy of curli.
dupli_ = createInterval();
dupli_->Copy(*curli_, &mri_, lis_.getVNInfoAllocator());
DEBUG(dbgs() << "SplitEditor DupLI: " << *dupli_ << '\n');
}
return dupli_;
}
@ -408,7 +407,7 @@ void SplitEditor::enterIntvAtEnd(MachineBasicBlock &A, MachineBasicBlock &B) {
SlotIndex EndA = lis_.getMBBEndIdx(&A);
VNInfo *CurVNIA = curli_->getVNInfoAt(EndA.getPrevIndex());
if (!CurVNIA) {
DEBUG(dbgs() << " ignoring enterIntvAtEnd, curli not live out of BB#"
DEBUG(dbgs() << " enterIntvAtEnd, curli not live out of BB#"
<< A.getNumber() << ".\n");
return;
}
@ -479,7 +478,7 @@ void SplitEditor::useIntv(SlotIndex Start, SlotIndex End) {
for (;I != E && I->start < End; ++I)
openli_->addRange(LiveRange(I->start, std::min(End, I->end),
mapValue(I->valno)));
DEBUG(dbgs() << " added range [" << Start << ';' << End << "): " << *openli_
DEBUG(dbgs() << " use [" << Start << ';' << End << "): " << *openli_
<< '\n');
}
@ -489,7 +488,7 @@ void SplitEditor::leaveIntvAfter(SlotIndex Idx) {
const LiveRange *CurLR = curli_->getLiveRangeContaining(Idx.getDefIndex());
if (!CurLR || CurLR->end <= Idx.getBoundaryIndex()) {
DEBUG(dbgs() << " leaveIntvAfter at " << Idx << ": not live\n");
DEBUG(dbgs() << " leaveIntvAfter " << Idx << ": not live\n");
return;
}
@ -638,10 +637,11 @@ void SplitEditor::rewrite() {
break;
}
}
if (LI)
if (LI) {
MO.setReg(LI->reg);
DEBUG(dbgs() << " rewrite " << Idx << '\t' << *MI);
}
}
// dupli_ goes in last, after rewriting.
if (dupli_) {
@ -655,8 +655,8 @@ void SplitEditor::rewrite() {
LiveInterval &li = *intervals_[i];
vrai.CalculateRegClass(li.reg);
vrai.CalculateWeightAndHint(li);
DEBUG(dbgs() << "new intv " << mri_.getRegClass(li.reg)->getName() << ":"
<< li << '\n');
DEBUG(dbgs() << " new interval " << mri_.getRegClass(li.reg)->getName()
<< ":" << li << '\n');
}
}
@ -734,7 +734,7 @@ bool SplitEditor::splitSingleBlocks(const SplitAnalysis::BlockPtrSet &Blocks) {
for (SplitAnalysis::BlockPtrSet::const_iterator I = Blocks.begin(),
E = Blocks.end(); I != E; ++I) {
IndexPair &IP = MBBRange[*I];
DEBUG(dbgs() << "Splitting for BB#" << (*I)->getNumber() << ": ["
DEBUG(dbgs() << " splitting for BB#" << (*I)->getNumber() << ": ["
<< IP.first << ';' << IP.second << ")\n");
assert(IP.first.isValid() && IP.second.isValid());