RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-23 20:45:06 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove some more set operations

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@18840 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-12-12 22:22:18 +00:00
parent 188839a219
commit 4e51ccdd38
1 changed files with 2 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Transforms/Scalar/ADCE.cpp
View File

@ -283,10 +283,8 @@ bool ADCE::doADCE() {
BasicBlock *BB = I->getParent();
if (!ReachableBBs.count(BB)) continue;
if (!AliveBlocks.count(BB)) { // Basic block not alive yet...
AliveBlocks.insert(BB); // Block is now ALIVE!
if (AliveBlocks.insert(BB).second) // Basic block not alive yet.
markBlockAlive(BB); // Make it so now!
}
// PHI nodes are a special case, because the incoming values are actually
// defined in the predecessor nodes of this block, meaning that the PHI
@ -294,10 +292,8 @@ bool ADCE::doADCE() {
//
if (PHINode *PN = dyn_cast<PHINode>(I))
for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI)
if (!AliveBlocks.count(*PI)) {
AliveBlocks.insert(BB); // Block is now ALIVE!
if (AliveBlocks.insert(*PI).second) // Block is now ALIVE!
markBlockAlive(*PI);
}
// Loop over all of the operands of the live instruction, making sure that
// they are known to be alive as well...