6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-14 11:32:34 +00:00
Code Issues Projects Releases Wiki Activity

Handle extremely trivial cases extremely efficiently. This speeds up

Browse Source 
SRoA/mem2reg from 41.2s to 27.5s on the testcase in PR209.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11099 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2004-02-03 22:00:33 +00:00
parent 9f08a92e6c
commit 7fecc2e5e2
1 changed files with 30 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -400,12 +400,24 @@ void PromoteMem2Reg::MarkDominatingPHILive(BasicBlock *BB, unsigned AllocaNum,
//
void PromoteMem2Reg::PromoteLocallyUsedAlloca(AllocaInst *AI) {
assert(!AI->use_empty() && "There are no uses of the alloca!");
BasicBlock *BB = cast<Instruction>(AI->use_back())->getParent();
// Handle degenerate cases quickly.
if (AI->hasOneUse()) {
Instruction *U = cast<Instruction>(AI->use_back());
if (LoadInst *LI = dyn_cast<LoadInst>(U)) {
// Must be a load of uninitialized value.
LI->replaceAllUsesWith(Constant::getNullValue(AI->getAllocatedType()));
} else {
// Otherwise it must be a store which is never read.
assert(isa<StoreInst>(U));
}
BB->getInstList().erase(U);
} else {
// Uses of the uninitialized memory location shall get zero...
Value *CurVal = Constant::getNullValue(AI->getAllocatedType());
BasicBlock *BB = cast<Instruction>(AI->use_back())->getParent();
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
Instruction *Inst = I++;
if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) {
@ -422,6 +434,7 @@ void PromoteMem2Reg::PromoteLocallyUsedAlloca(AllocaInst *AI) {
}
}
}
}
// After traversing the basic block, there should be no more uses of the
// alloca, remove it now.