RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-02 00:36:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

simplify some logic further

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@23408 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-09-23 07:23:18 +00:00
parent f58c1a578e
commit 055dc102e9
1 changed files with 1 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1041,7 +1041,6 @@ static bool FoldTwoEntryPHINode(PHINode *PN) {
// that need to be moved to the dominating block.
std::set<Instruction*> AggressiveInsts;
bool CanPromote = true;
BasicBlock::iterator AfterPHIIt = BB->begin();
while (isa<PHINode>(AfterPHIIt)) {
PHINode *PN = cast<PHINode>(AfterPHIIt++);
@ -1054,14 +1053,10 @@ static bool FoldTwoEntryPHINode(PHINode *PN) {
&AggressiveInsts) ||
!DominatesMergePoint(PN->getIncomingValue(1), BB,
&AggressiveInsts)) {
CanPromote = false;
return false;
}
}
// Did we eliminate all PHI's?
if (!CanPromote && AfterPHIIt != BB->begin())
return false;
// If we all PHI nodes are promotable, check to make sure that all
// instructions in the predecessor blocks can be promoted as well. If
// not, we won't be able to get rid of the control flow, so it's not