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

More minor microoptimizations

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

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

@ -264,8 +264,6 @@ bool ADCE::doADCE() {
for (pred_iterator PI = pred_begin(I), E = pred_end(I); PI != E; ++PI)
markInstructionLive((*PI)->getTerminator());
DEBUG(std::cerr << "Processing work list\n");
// AliveBlocks - Set of basic blocks that we know have instructions that are
@ -291,12 +289,12 @@ bool ADCE::doADCE() {
// makes the predecessors alive.
//
if (PHINode *PN = dyn_cast<PHINode>(I))
for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI)
if (AliveBlocks.insert(*PI).second) // Block is now ALIVE!
markBlockAlive(*PI);
for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
if (AliveBlocks.insert(PN->getIncomingBlock(i)).second)
markBlockAlive(PN->getIncomingBlock(i)); // Block is newly ALIVE!
// Loop over all of the operands of the live instruction, making sure that
// they are known to be alive as well...
// they are known to be alive as well.
//
for (unsigned op = 0, End = I->getNumOperands(); op != End; ++op)
if (Instruction *Operand = dyn_cast<Instruction>(I->getOperand(op)))