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

* Fix bug: CorrelatedExprs/2002-09-23-PHIUpdateBug.ll

Browse Source 
* Make sure "Changed" is updated correctly


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3891 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-09-23 20:06:22 +00:00
parent cba39ca9fe
commit c017d9132a
1 changed files with 20 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
lib/Transforms/Scalar/CorrelatedExprs.cpp
View File

@ -23,6 +23,7 @@
#include "llvm/Pass.h"
#include "llvm/Function.h"
#include "llvm/iTerminators.h"
#include "llvm/iPHINode.h"
#include "llvm/iOperators.h"
#include "llvm/ConstantHandling.h"
#include "llvm/Assembly/Writer.h"
@ -349,20 +350,34 @@ bool CEE::TransformRegion(BasicBlock *BB, std::set<BasicBlock*> &VisitedBlocks){
// another conditional branch, one whose outcome is known inside of this
// region, then vector this outgoing edge directly to the known destination.
//
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
while (BasicBlock *Dest = isCorrelatedBranchBlock(TI->getSuccessor(i), RI)){
// If there are any PHI nodes in the Dest BB, we must duplicate the entry
// in the PHI node for the old successor to now include an entry from the
// current basic block.
//
BasicBlock *OldSucc = TI->getSuccessor(i);
// Loop over all of the PHI nodes...
for (BasicBlock::iterator I = Dest->begin();
PHINode *PN = dyn_cast<PHINode>(&*I); ++I) {
// Find the entry in the PHI node for OldSucc, create a duplicate entry
// for BB now.
int BlockIndex = PN->getBasicBlockIndex(OldSucc);
assert(BlockIndex != -1 && "Block should have entry in PHI!");
PN->addIncoming(PN->getIncomingValue(BlockIndex), BB);
}
// Actually revector the branch now...
TI->setSuccessor(i, Dest);
++BranchRevectors;
Changed = true;
}
}
// Now that all of our successors have information, recursively process them.
for (unsigned i = 0, e = BBN->getChildren().size(); i != e; ++i)
Changed |= TransformRegion(BBN->getChildren()[i]->getNode(), VisitedBlocks);
// for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
//Changed |= TransformRegion(TI->getSuccessor(i), VisitedBlocks);
return Changed;
}