6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-28 03:25:23 +00:00
Code Issues Projects Releases Wiki Activity

switch the inliner from being recursive to being iterative.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34832 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2007-03-02 03:11:20 +00:00
parent 9b4aeb3cc1
commit 67ef241f45
1 changed files with 14 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
lib/Transforms/Utils/CloneFunction.cpp
View File

@@ -175,7 +175,8 @@ namespace {
/// CloneBlock - The specified block is found to be reachable, clone it and /// CloneBlock - The specified block is found to be reachable, clone it and
/// anything that it can reach. /// anything that it can reach.
void CloneBlock(const BasicBlock *BB); void CloneBlock(const BasicBlock *BB,
std::vector<const BasicBlock*> &ToClone);
public: public:
/// ConstantFoldMappedInstruction - Constant fold the specified instruction, /// ConstantFoldMappedInstruction - Constant fold the specified instruction,
@@ -186,7 +187,8 @@ namespace {
/// CloneBlock - The specified block is found to be reachable, clone it and /// CloneBlock - The specified block is found to be reachable, clone it and
/// anything that it can reach. /// anything that it can reach.
void PruningFunctionCloner::CloneBlock(const BasicBlock *BB) { void PruningFunctionCloner::CloneBlock(const BasicBlock *BB,
std::vector<const BasicBlock*> &ToClone){
Value *&BBEntry = ValueMap[BB]; Value *&BBEntry = ValueMap[BB];
// Have we already cloned this block? // Have we already cloned this block?
@@ -240,7 +242,7 @@ void PruningFunctionCloner::CloneBlock(const BasicBlock *BB) {
if (Cond) { if (Cond) {
BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue()); BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
ValueMap[OldTI] = new BranchInst(Dest, NewBB); ValueMap[OldTI] = new BranchInst(Dest, NewBB);
CloneBlock(Dest); ToClone.push_back(Dest);
TerminatorDone = true; TerminatorDone = true;
} }
} }
@@ -252,7 +254,7 @@ void PruningFunctionCloner::CloneBlock(const BasicBlock *BB) {
if (Cond) { // Constant fold to uncond branch! if (Cond) { // Constant fold to uncond branch!
BasicBlock *Dest = SI->getSuccessor(SI->findCaseValue(Cond)); BasicBlock *Dest = SI->getSuccessor(SI->findCaseValue(Cond));
ValueMap[OldTI] = new BranchInst(Dest, NewBB); ValueMap[OldTI] = new BranchInst(Dest, NewBB);
CloneBlock(Dest); ToClone.push_back(Dest);
TerminatorDone = true; TerminatorDone = true;
} }
} }
@@ -267,7 +269,7 @@ void PruningFunctionCloner::CloneBlock(const BasicBlock *BB) {
// Recursively clone any reachable successor blocks. // Recursively clone any reachable successor blocks.
const TerminatorInst *TI = BB->getTerminator(); const TerminatorInst *TI = BB->getTerminator();
for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
CloneBlock(TI->getSuccessor(i)); ToClone.push_back(TI->getSuccessor(i));
} }
if (CodeInfo) { if (CodeInfo) {
@@ -322,7 +324,13 @@ void llvm::CloneAndPruneFunctionInto(Function *NewFunc, const Function *OldFunc,
NameSuffix, CodeInfo, TD); NameSuffix, CodeInfo, TD);
// Clone the entry block, and anything recursively reachable from it. // Clone the entry block, and anything recursively reachable from it.
PFC.CloneBlock(&OldFunc->getEntryBlock()); std::vector<const BasicBlock*> CloneWorklist;
CloneWorklist.push_back(&OldFunc->getEntryBlock());
while (!CloneWorklist.empty()) {
const BasicBlock *BB = CloneWorklist.back();
CloneWorklist.pop_back();
PFC.CloneBlock(BB, CloneWorklist);
}
// Loop over all of the basic blocks in the old function. If the block was // Loop over all of the basic blocks in the old function. If the block was
// reachable, we have cloned it and the old block is now in the value map: // reachable, we have cloned it and the old block is now in the value map: