6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-12 18:33:22 +00:00
Code Issues Projects Releases Wiki Activity

tidy up a bit, move DEBUG down to when we commit to doing the transform so we

Browse Source 
don't print it unless the xform happens.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@121758 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2010-12-14 07:23:10 +00:00
parent 07ff3539f5
commit e0b18e5912
1 changed files with 5 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1161,9 +1161,6 @@ static bool FoldTwoEntryPHINode(PHINode *PN, const TargetData *TD) {
if (NumPhis > 2) if (NumPhis > 2)
return false; return false;
DEBUG(dbgs() << "FOUND IF CONDITION! " << *IfCond << " T: "
<< 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
// instructions. While we are at it, keep track of the instructions // instructions. While we are at it, keep track of the instructions
// that need to be moved to the dominating block. // that need to be moved to the dominating block.
@ -1192,8 +1189,7 @@ static bool FoldTwoEntryPHINode(PHINode *PN, const TargetData *TD) {
if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) { if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) {
IfBlock1 = Pred; IfBlock1 = Pred;
DomBlock = *pred_begin(Pred); DomBlock = *pred_begin(Pred);
for (BasicBlock::iterator I = Pred->begin(); for (BasicBlock::iterator I = Pred->begin(); !isa<TerminatorInst>(I); ++I)
!isa<TerminatorInst>(I); ++I)
if (!AggressiveInsts.count(I) && !isa<DbgInfoIntrinsic>(I)) { if (!AggressiveInsts.count(I) && !isa<DbgInfoIntrinsic>(I)) {
// This is not an aggressive instruction that we can promote. // This is not an aggressive instruction that we can promote.
// Because of this, we won't be able to get rid of the control // Because of this, we won't be able to get rid of the control
@ -1206,8 +1202,7 @@ static bool FoldTwoEntryPHINode(PHINode *PN, const TargetData *TD) {
if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) { if (cast<BranchInst>(Pred->getTerminator())->isUnconditional()) {
IfBlock2 = Pred; IfBlock2 = Pred;
DomBlock = *pred_begin(Pred); DomBlock = *pred_begin(Pred);
for (BasicBlock::iterator I = Pred->begin(); for (BasicBlock::iterator I = Pred->begin(); !isa<TerminatorInst>(I); ++I)
!isa<TerminatorInst>(I); ++I)
if (!AggressiveInsts.count(I) && !isa<DbgInfoIntrinsic>(I)) { if (!AggressiveInsts.count(I) && !isa<DbgInfoIntrinsic>(I)) {
// This is not an aggressive instruction that we can promote. // This is not an aggressive instruction that we can promote.
// Because of this, we won't be able to get rid of the control // Because of this, we won't be able to get rid of the control
@ -1216,6 +1211,9 @@ static bool FoldTwoEntryPHINode(PHINode *PN, const TargetData *TD) {
} }
} }
DEBUG(dbgs() << "FOUND IF CONDITION! " << *IfCond << " T: "
<< IfTrue->getName() << " F: " << IfFalse->getName() << "\n");
// If we can still promote the PHI nodes after this gauntlet of tests, // If we can still promote the PHI nodes after this gauntlet of tests,
// do all of the PHI's now. // do all of the PHI's now.