RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-05 14:52:02 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Avoid recursion. Use iterative algorithm for RenamePass().

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@35052 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Devang Patel 2007-03-09 23:39:14 +00:00
parent 4fe26582c0
commit a5b7dc5ef8
1 changed files with 31 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
lib/Transforms/Utils/PromoteMemoryToRegister.cpp
View File

@ -72,6 +72,17 @@ bool llvm::isAllocaPromotable(const AllocaInst *AI, const TargetData &TD) {
} }
namespace { namespace {
// Data package used by RenamePass()
class VISIBILITY_HIDDEN RenamePassData {
public:
RenamePassData(BasicBlock *B, BasicBlock *P,
std::vector<Value *> V) : BB(B), Pred(P), Values(V) {}
BasicBlock *BB;
BasicBlock *Pred;
std::vector<Value *> Values;
};
struct VISIBILITY_HIDDEN PromoteMem2Reg { struct VISIBILITY_HIDDEN PromoteMem2Reg {
/// Allocas - The alloca instructions being promoted. /// Allocas - The alloca instructions being promoted.
/// ///
@ -111,6 +122,9 @@ namespace {
/// non-determinstic behavior. /// non-determinstic behavior.
DenseMap<BasicBlock*, unsigned> BBNumbers; DenseMap<BasicBlock*, unsigned> BBNumbers;
/// RenamePassWorkList - Worklist used by RenamePass()
std::vector<RenamePassData *> RenamePassWorkList;
public: public:
PromoteMem2Reg(const std::vector<AllocaInst*> &A, PromoteMem2Reg(const std::vector<AllocaInst*> &A,
SmallVector<AllocaInst*, 16> &Retry, DominatorTree &dt, SmallVector<AllocaInst*, 16> &Retry, DominatorTree &dt,
@ -146,6 +160,7 @@ namespace {
bool QueuePhiNode(BasicBlock *BB, unsigned AllocaIdx, unsigned &Version, bool QueuePhiNode(BasicBlock *BB, unsigned AllocaIdx, unsigned &Version,
SmallPtrSet<PHINode*, 16> &InsertedPHINodes); SmallPtrSet<PHINode*, 16> &InsertedPHINodes);
}; };
} // end of anonymous namespace } // end of anonymous namespace
void PromoteMem2Reg::run() { void PromoteMem2Reg::run() {
@ -391,8 +406,17 @@ void PromoteMem2Reg::run() {
// Walks all basic blocks in the function performing the SSA rename algorithm // Walks all basic blocks in the function performing the SSA rename algorithm
// and inserting the phi nodes we marked as necessary // and inserting the phi nodes we marked as necessary
// //
RenamePass(F.begin(), 0, Values); //RenamePass(F.begin(), 0, Values);
RenamePassWorkList.clear();
RenamePassData *RPD = new RenamePassData(F.begin(), 0, Values);
RenamePassWorkList.push_back(RPD);
while(!RenamePassWorkList.empty()) {
RenamePassData *RPD = RenamePassWorkList.back(); RenamePassWorkList.pop_back();
// RenamePass may add new worklist entries.
RenamePass(RPD->BB, RPD->Pred, RPD->Values);
delete RPD;
}
// The renamer uses the Visited set to avoid infinite loops. Clear it now. // The renamer uses the Visited set to avoid infinite loops. Clear it now.
Visited.clear(); Visited.clear();
@ -772,8 +796,11 @@ void PromoteMem2Reg::RenamePass(BasicBlock *BB, BasicBlock *Pred,
// Recurse to our successors. // Recurse to our successors.
TerminatorInst *TI = BB->getTerminator(); TerminatorInst *TI = BB->getTerminator();
for (unsigned i = 0; i != TI->getNumSuccessors(); i++) { for (unsigned i = 0; i != TI->getNumSuccessors(); i++) {
std::vector<Value*> OutgoingVals(IncomingVals); RenamePassData *RPD = new RenamePassData(TI->getSuccessor(i), BB,
RenamePass(TI->getSuccessor(i), BB, OutgoingVals); IncomingVals);
RenamePassWorkList.push_back(RPD);
// std::vector<Value*> OutgoingVals(IncomingVals);
// RenamePass(TI->getSuccessor(i), BB, OutgoingVals);
} }
} }