6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-21 03:29:40 +00:00
Code Issues Projects Releases Wiki Activity

Change errs() to dbgs().

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92604 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
David Greene 2010-01-05 01:26:52 +00:00
parent 1af40cacd4
commit 89d6fd36a2
1 changed files with 13 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
lib/Transforms/Utils/SimplifyCFG.cpp
View File

@ -459,7 +459,7 @@ static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
// Remove PHI node entries for the dead edge. // Remove PHI node entries for the dead edge.
ThisCases[0].second->removePredecessor(TI->getParent()); ThisCases[0].second->removePredecessor(TI->getParent());
DEBUG(errs() << "Threading pred instr: " << *Pred->getTerminator() DEBUG(dbgs() << "Threading pred instr: " << *Pred->getTerminator()
<< "Through successor TI: " << *TI << "Leaving: " << *NI << "\n"); << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
EraseTerminatorInstAndDCECond(TI); EraseTerminatorInstAndDCECond(TI);
@ -472,7 +472,7 @@ static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
for (unsigned i = 0, e = PredCases.size(); i != e; ++i) for (unsigned i = 0, e = PredCases.size(); i != e; ++i)
DeadCases.insert(PredCases[i].first); DeadCases.insert(PredCases[i].first);
DEBUG(errs() << "Threading pred instr: " << *Pred->getTerminator() DEBUG(dbgs() << "Threading pred instr: " << *Pred->getTerminator()
<< "Through successor TI: " << *TI); << "Through successor TI: " << *TI);
for (unsigned i = SI->getNumCases()-1; i != 0; --i) for (unsigned i = SI->getNumCases()-1; i != 0; --i)
@ -481,7 +481,7 @@ static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
SI->removeCase(i); SI->removeCase(i);
} }
DEBUG(errs() << "Leaving: " << *TI << "\n"); DEBUG(dbgs() << "Leaving: " << *TI << "\n");
return true; return true;
} }
} }
@ -524,7 +524,7 @@ static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
Instruction *NI = BranchInst::Create(TheRealDest, TI); Instruction *NI = BranchInst::Create(TheRealDest, TI);
(void) NI; (void) NI;
DEBUG(errs() << "Threading pred instr: " << *Pred->getTerminator() DEBUG(dbgs() << "Threading pred instr: " << *Pred->getTerminator()
<< "Through successor TI: " << *TI << "Leaving: " << *NI << "\n"); << "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
EraseTerminatorInstAndDCECond(TI); EraseTerminatorInstAndDCECond(TI);
@ -1111,7 +1111,7 @@ static bool FoldTwoEntryPHINode(PHINode *PN) {
if (NumPhis > 2) if (NumPhis > 2)
return false; return false;
DEBUG(errs() << "FOUND IF CONDITION! " << *IfCond << " T: " DEBUG(dbgs() << "FOUND IF CONDITION! " << *IfCond << " T: "
<< IfTrue->getName() << " F: " << IfFalse->getName() << "\n"); << IfTrue->getName() << " F: " << IfFalse->getName() << "\n");
// Loop over the PHI's seeing if we can promote them all to select // Loop over the PHI's seeing if we can promote them all to select
@ -1295,7 +1295,7 @@ static bool SimplifyCondBranchToTwoReturns(BranchInst *BI) {
ReturnInst::Create(BI->getContext(), TrueValue, BI); ReturnInst::Create(BI->getContext(), TrueValue, BI);
(void) RI; (void) RI;
DEBUG(errs() << "\nCHANGING BRANCH TO TWO RETURNS INTO SELECT:" DEBUG(dbgs() << "\nCHANGING BRANCH TO TWO RETURNS INTO SELECT:"
<< "\n " << *BI << "NewRet = " << *RI << "\n " << *BI << "NewRet = " << *RI
<< "TRUEBLOCK: " << *TrueSucc << "FALSEBLOCK: "<< *FalseSucc); << "TRUEBLOCK: " << *TrueSucc << "FALSEBLOCK: "<< *FalseSucc);
@ -1377,7 +1377,7 @@ bool llvm::FoldBranchToCommonDest(BranchInst *BI) {
else else
continue; continue;
DEBUG(errs() << "FOLDING BRANCH TO COMMON DEST:\n" << *PBI << *BB); DEBUG(dbgs() << "FOLDING BRANCH TO COMMON DEST:\n" << *PBI << *BB);
// If we need to invert the condition in the pred block to match, do so now. // If we need to invert the condition in the pred block to match, do so now.
if (InvertPredCond) { if (InvertPredCond) {
@ -1511,7 +1511,7 @@ static bool SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) {
// Finally, if everything is ok, fold the branches to logical ops. // Finally, if everything is ok, fold the branches to logical ops.
BasicBlock *OtherDest = BI->getSuccessor(BIOp ^ 1); BasicBlock *OtherDest = BI->getSuccessor(BIOp ^ 1);
DEBUG(errs() << "FOLDING BRs:" << *PBI->getParent() DEBUG(dbgs() << "FOLDING BRs:" << *PBI->getParent()
<< "AND: " << *BI->getParent()); << "AND: " << *BI->getParent());
@ -1531,7 +1531,7 @@ static bool SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) {
OtherDest = InfLoopBlock; OtherDest = InfLoopBlock;
} }
DEBUG(errs() << *PBI->getParent()->getParent()); DEBUG(dbgs() << *PBI->getParent()->getParent());
// BI may have other predecessors. Because of this, we leave // BI may have other predecessors. Because of this, we leave
// it alone, but modify PBI. // it alone, but modify PBI.
@ -1581,8 +1581,8 @@ static bool SimplifyCondBranchToCondBranch(BranchInst *PBI, BranchInst *BI) {
} }
} }
DEBUG(errs() << "INTO: " << *PBI->getParent()); DEBUG(dbgs() << "INTO: " << *PBI->getParent());
DEBUG(errs() << *PBI->getParent()->getParent()); DEBUG(dbgs() << *PBI->getParent()->getParent());
// This basic block is probably dead. We know it has at least // This basic block is probably dead. We know it has at least
// one fewer predecessor. // one fewer predecessor.
@ -1608,7 +1608,7 @@ bool llvm::SimplifyCFG(BasicBlock *BB) {
// Remove basic blocks that have no predecessors... or that just have themself // Remove basic blocks that have no predecessors... or that just have themself
// as a predecessor. These are unreachable. // as a predecessor. These are unreachable.
if (pred_begin(BB) == pred_end(BB) || BB->getSinglePredecessor() == BB) { if (pred_begin(BB) == pred_end(BB) || BB->getSinglePredecessor() == BB) {
DEBUG(errs() << "Removing BB: \n" << *BB); DEBUG(dbgs() << "Removing BB: \n" << *BB);
DeleteDeadBlock(BB); DeleteDeadBlock(BB);
return true; return true;
} }
@ -1651,7 +1651,7 @@ bool llvm::SimplifyCFG(BasicBlock *BB) {
if (!UncondBranchPreds.empty()) { if (!UncondBranchPreds.empty()) {
while (!UncondBranchPreds.empty()) { while (!UncondBranchPreds.empty()) {
BasicBlock *Pred = UncondBranchPreds.pop_back_val(); BasicBlock *Pred = UncondBranchPreds.pop_back_val();
DEBUG(errs() << "FOLDING: " << *BB DEBUG(dbgs() << "FOLDING: " << *BB
<< "INTO UNCOND BRANCH PRED: " << *Pred); << "INTO UNCOND BRANCH PRED: " << *Pred);
Instruction *UncondBranch = Pred->getTerminator(); Instruction *UncondBranch = Pred->getTerminator();
// Clone the return and add it to the end of the predecessor. // Clone the return and add it to the end of the predecessor.