maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Change errs() to dbgs(). 

llvm-svn: 92614
This commit is contained in:
David Greene 2010-01-05 01:27:19 +00:00
parent 2e6efc441f
commit 1efdb45562
1 changed files with 25 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
llvm/lib/Transforms/Scalar/JumpThreading.cpp
View File

@ -118,7 +118,7 @@ FunctionPass *llvm::createJumpThreadingPass() { return new JumpThreading(); }
/// runOnFunction - Top level algorithm. /// runOnFunction - Top level algorithm.
/// ///
bool JumpThreading::runOnFunction(Function &F) { bool JumpThreading::runOnFunction(Function &F) {
DEBUG(errs() << "Jump threading on function '" << F.getName() << "'\n"); DEBUG(dbgs() << "Jump threading on function '" << F.getName() << "'\n");
TD = getAnalysisIfAvailable<TargetData>(); TD = getAnalysisIfAvailable<TargetData>();
LVI = EnableLVI ? &getAnalysis<LazyValueInfo>() : 0; LVI = EnableLVI ? &getAnalysis<LazyValueInfo>() : 0;
@ -140,7 +140,7 @@ bool JumpThreading::runOnFunction(Function &F) {
// edges which simplifies the CFG. // edges which simplifies the CFG.
if (pred_begin(BB) == pred_end(BB) && if (pred_begin(BB) == pred_end(BB) &&
BB != &BB->getParent()->getEntryBlock()) { BB != &BB->getParent()->getEntryBlock()) {
DEBUG(errs() << " JT: Deleting dead block '" << BB->getName() DEBUG(dbgs() << " JT: Deleting dead block '" << BB->getName()
<< "' with terminator: " << *BB->getTerminator() << '\n'); << "' with terminator: " << *BB->getTerminator() << '\n');
LoopHeaders.erase(BB); LoopHeaders.erase(BB);
DeleteDeadBlock(BB); DeleteDeadBlock(BB);
@ -490,7 +490,7 @@ bool JumpThreading::ProcessBlock(BasicBlock *BB) {
// terminator to an unconditional branch. This can occur due to threading in // terminator to an unconditional branch. This can occur due to threading in
// other blocks. // other blocks.
if (isa<ConstantInt>(Condition)) { if (isa<ConstantInt>(Condition)) {
DEBUG(errs() << " In block '" << BB->getName() DEBUG(dbgs() << " In block '" << BB->getName()
<< "' folding terminator: " << *BB->getTerminator() << '\n'); << "' folding terminator: " << *BB->getTerminator() << '\n');
++NumFolds; ++NumFolds;
ConstantFoldTerminator(BB); ConstantFoldTerminator(BB);
@ -509,7 +509,7 @@ bool JumpThreading::ProcessBlock(BasicBlock *BB) {
RemovePredecessorAndSimplify(BBTerm->getSuccessor(i), BB, TD); RemovePredecessorAndSimplify(BBTerm->getSuccessor(i), BB, TD);
} }
DEBUG(errs() << " In block '" << BB->getName() DEBUG(dbgs() << " In block '" << BB->getName()
<< "' folding undef terminator: " << *BBTerm << '\n'); << "' folding undef terminator: " << *BBTerm << '\n');
BranchInst::Create(BBTerm->getSuccessor(BestSucc), BBTerm); BranchInst::Create(BBTerm->getSuccessor(BestSucc), BBTerm);
BBTerm->eraseFromParent(); BBTerm->eraseFromParent();
@ -636,7 +636,7 @@ bool JumpThreading::ProcessBranchOnDuplicateCond(BasicBlock *PredBB,
else if (PredBI->getSuccessor(0) != BB) else if (PredBI->getSuccessor(0) != BB)
BranchDir = false; BranchDir = false;
else { else {
DEBUG(errs() << " In block '" << PredBB->getName() DEBUG(dbgs() << " In block '" << PredBB->getName()
<< "' folding terminator: " << *PredBB->getTerminator() << '\n'); << "' folding terminator: " << *PredBB->getTerminator() << '\n');
++NumFolds; ++NumFolds;
ConstantFoldTerminator(PredBB); ConstantFoldTerminator(PredBB);
@ -648,7 +648,7 @@ bool JumpThreading::ProcessBranchOnDuplicateCond(BasicBlock *PredBB,
// If the dest block has one predecessor, just fix the branch condition to a // If the dest block has one predecessor, just fix the branch condition to a
// constant and fold it. // constant and fold it.
if (BB->getSinglePredecessor()) { if (BB->getSinglePredecessor()) {
DEBUG(errs() << " In block '" << BB->getName() DEBUG(dbgs() << " In block '" << BB->getName()
<< "' folding condition to '" << BranchDir << "': " << "' folding condition to '" << BranchDir << "': "
<< *BB->getTerminator() << '\n'); << *BB->getTerminator() << '\n');
++NumFolds; ++NumFolds;
@ -727,8 +727,8 @@ bool JumpThreading::ProcessSwitchOnDuplicateCond(BasicBlock *PredBB,
// Otherwise, we're safe to make the change. Make sure that the edge from // Otherwise, we're safe to make the change. Make sure that the edge from
// DestSI to DestSucc is not critical and has no PHI nodes. // DestSI to DestSucc is not critical and has no PHI nodes.
DEBUG(errs() << "FORWARDING EDGE " << *DestVal << " FROM: " << *PredSI); DEBUG(dbgs() << "FORWARDING EDGE " << *DestVal << " FROM: " << *PredSI);
DEBUG(errs() << "THROUGH: " << *DestSI); DEBUG(dbgs() << "THROUGH: " << *DestSI);
// If the destination has PHI nodes, just split the edge for updating // If the destination has PHI nodes, just split the edge for updating
// simplicity. // simplicity.
@ -979,14 +979,14 @@ bool JumpThreading::ProcessThreadableEdges(Value *Cond, BasicBlock *BB) {
assert(!PredValues.empty() && assert(!PredValues.empty() &&
"ComputeValueKnownInPredecessors returned true with no values"); "ComputeValueKnownInPredecessors returned true with no values");
DEBUG(errs() << "IN BB: " << *BB; DEBUG(dbgs() << "IN BB: " << *BB;
for (unsigned i = 0, e = PredValues.size(); i != e; ++i) { for (unsigned i = 0, e = PredValues.size(); i != e; ++i) {
errs() << " BB '" << BB->getName() << "': FOUND condition = "; dbgs() << " BB '" << BB->getName() << "': FOUND condition = ";
if (PredValues[i].first) if (PredValues[i].first)
errs() << *PredValues[i].first; dbgs() << *PredValues[i].first;
else else
errs() << "UNDEF"; dbgs() << "UNDEF";
errs() << " for pred '" << PredValues[i].second->getName() dbgs() << " for pred '" << PredValues[i].second->getName()
<< "'.\n"; << "'.\n";
}); });
@ -1133,7 +1133,7 @@ bool JumpThreading::ThreadEdge(BasicBlock *BB,
BasicBlock *SuccBB) { BasicBlock *SuccBB) {
// If threading to the same block as we come from, we would infinite loop. // If threading to the same block as we come from, we would infinite loop.
if (SuccBB == BB) { if (SuccBB == BB) {
DEBUG(errs() << " Not threading across BB '" << BB->getName() DEBUG(dbgs() << " Not threading across BB '" << BB->getName()
<< "' - would thread to self!\n"); << "' - would thread to self!\n");
return false; return false;
} }
@ -1141,7 +1141,7 @@ bool JumpThreading::ThreadEdge(BasicBlock *BB,
// If threading this would thread across a loop header, don't thread the edge. // If threading this would thread across a loop header, don't thread the edge.
// See the comments above FindLoopHeaders for justifications and caveats. // See the comments above FindLoopHeaders for justifications and caveats.
if (LoopHeaders.count(BB)) { if (LoopHeaders.count(BB)) {
DEBUG(errs() << " Not threading across loop header BB '" << BB->getName() DEBUG(dbgs() << " Not threading across loop header BB '" << BB->getName()
<< "' to dest BB '" << SuccBB->getName() << "' to dest BB '" << SuccBB->getName()
<< "' - it might create an irreducible loop!\n"); << "' - it might create an irreducible loop!\n");
return false; return false;
@ -1149,7 +1149,7 @@ bool JumpThreading::ThreadEdge(BasicBlock *BB,
unsigned JumpThreadCost = getJumpThreadDuplicationCost(BB); unsigned JumpThreadCost = getJumpThreadDuplicationCost(BB);
if (JumpThreadCost > Threshold) { if (JumpThreadCost > Threshold) {
DEBUG(errs() << " Not threading BB '" << BB->getName() DEBUG(dbgs() << " Not threading BB '" << BB->getName()
<< "' - Cost is too high: " << JumpThreadCost << "\n"); << "' - Cost is too high: " << JumpThreadCost << "\n");
return false; return false;
} }
@ -1159,14 +1159,14 @@ bool JumpThreading::ThreadEdge(BasicBlock *BB,
if (PredBBs.size() == 1) if (PredBBs.size() == 1)
PredBB = PredBBs[0]; PredBB = PredBBs[0];
else { else {
DEBUG(errs() << " Factoring out " << PredBBs.size() DEBUG(dbgs() << " Factoring out " << PredBBs.size()
<< " common predecessors.\n"); << " common predecessors.\n");
PredBB = SplitBlockPredecessors(BB, &PredBBs[0], PredBBs.size(), PredBB = SplitBlockPredecessors(BB, &PredBBs[0], PredBBs.size(),
".thr_comm", this); ".thr_comm", this);
} }
// And finally, do it! // And finally, do it!
DEBUG(errs() << " Threading edge from '" << PredBB->getName() << "' to '" DEBUG(dbgs() << " Threading edge from '" << PredBB->getName() << "' to '"
<< SuccBB->getName() << "' with cost: " << JumpThreadCost << SuccBB->getName() << "' with cost: " << JumpThreadCost
<< ", across block:\n " << ", across block:\n "
<< *BB << "\n"); << *BB << "\n");
@ -1235,7 +1235,7 @@ bool JumpThreading::ThreadEdge(BasicBlock *BB,
if (UsesToRename.empty()) if (UsesToRename.empty())
continue; continue;
DEBUG(errs() << "JT: Renaming non-local uses of: " << *I << "\n"); DEBUG(dbgs() << "JT: Renaming non-local uses of: " << *I << "\n");
// We found a use of I outside of BB. Rename all uses of I that are outside // We found a use of I outside of BB. Rename all uses of I that are outside
// its block to be uses of the appropriate PHI node etc. See ValuesInBlocks // its block to be uses of the appropriate PHI node etc. See ValuesInBlocks
@ -1246,7 +1246,7 @@ bool JumpThreading::ThreadEdge(BasicBlock *BB,
while (!UsesToRename.empty()) while (!UsesToRename.empty())
SSAUpdate.RewriteUse(*UsesToRename.pop_back_val()); SSAUpdate.RewriteUse(*UsesToRename.pop_back_val());
DEBUG(errs() << "\n"); DEBUG(dbgs() << "\n");
} }
@ -1294,7 +1294,7 @@ bool JumpThreading::DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
// cause us to transform this into an irreducible loop, don't do this. // cause us to transform this into an irreducible loop, don't do this.
// See the comments above FindLoopHeaders for justifications and caveats. // See the comments above FindLoopHeaders for justifications and caveats.
if (LoopHeaders.count(BB)) { if (LoopHeaders.count(BB)) {
DEBUG(errs() << " Not duplicating loop header '" << BB->getName() DEBUG(dbgs() << " Not duplicating loop header '" << BB->getName()
<< "' into predecessor block '" << PredBB->getName() << "' into predecessor block '" << PredBB->getName()
<< "' - it might create an irreducible loop!\n"); << "' - it might create an irreducible loop!\n");
return false; return false;
@ -1302,14 +1302,14 @@ bool JumpThreading::DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
unsigned DuplicationCost = getJumpThreadDuplicationCost(BB); unsigned DuplicationCost = getJumpThreadDuplicationCost(BB);
if (DuplicationCost > Threshold) { if (DuplicationCost > Threshold) {
DEBUG(errs() << " Not duplicating BB '" << BB->getName() DEBUG(dbgs() << " Not duplicating BB '" << BB->getName()
<< "' - Cost is too high: " << DuplicationCost << "\n"); << "' - Cost is too high: " << DuplicationCost << "\n");
return false; return false;
} }
// Okay, we decided to do this! Clone all the instructions in BB onto the end // Okay, we decided to do this! Clone all the instructions in BB onto the end
// of PredBB. // of PredBB.
DEBUG(errs() << " Duplicating block '" << BB->getName() << "' into end of '" DEBUG(dbgs() << " Duplicating block '" << BB->getName() << "' into end of '"
<< PredBB->getName() << "' to eliminate branch on phi. Cost: " << PredBB->getName() << "' to eliminate branch on phi. Cost: "
<< DuplicationCost << " block is:" << *BB << "\n"); << DuplicationCost << " block is:" << *BB << "\n");
@ -1373,7 +1373,7 @@ bool JumpThreading::DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
if (UsesToRename.empty()) if (UsesToRename.empty())
continue; continue;
DEBUG(errs() << "JT: Renaming non-local uses of: " << *I << "\n"); DEBUG(dbgs() << "JT: Renaming non-local uses of: " << *I << "\n");
// We found a use of I outside of BB. Rename all uses of I that are outside // We found a use of I outside of BB. Rename all uses of I that are outside
// its block to be uses of the appropriate PHI node etc. See ValuesInBlocks // its block to be uses of the appropriate PHI node etc. See ValuesInBlocks
@ -1384,7 +1384,7 @@ bool JumpThreading::DuplicateCondBranchOnPHIIntoPred(BasicBlock *BB,
while (!UsesToRename.empty()) while (!UsesToRename.empty())
SSAUpdate.RewriteUse(*UsesToRename.pop_back_val()); SSAUpdate.RewriteUse(*UsesToRename.pop_back_val());
DEBUG(errs() << "\n"); DEBUG(dbgs() << "\n");
} }
// PredBB no longer jumps to BB, remove entries in the PHI node for the edge // PredBB no longer jumps to BB, remove entries in the PHI node for the edge