RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-07 03:40:35 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

switch from using a std::set to using a SmallPtrSet. This speeds up the

Browse Source 
testcase in PR1432 from 6.33s to 2.90s (2.22x)

llvm-svn: 40810
This commit is contained in:
Chris Lattner 2007-08-04 02:21:22 +00:00
parent 9b45ad1f5c
commit fe6a3e2fb4
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -534,7 +534,7 @@ void PromoteMem2Reg::RewriteSingleStoreAlloca(AllocaInst *AI,
StoreInst *OnlyStore = Info.OnlyStore;
// Be aware of loads before the store.
std::set<BasicBlock*> ProcessedBlocks;
SmallPtrSet<BasicBlock*, 32> ProcessedBlocks;
for (unsigned i = 0, e = Info.UsingBlocks.size(); i != e; ++i) {
// If the store dominates the block and if we haven't processed it yet,
// do so now.
@ -542,7 +542,7 @@ void PromoteMem2Reg::RewriteSingleStoreAlloca(AllocaInst *AI,
continue;
BasicBlock *UseBlock = Info.UsingBlocks[i];
if (!ProcessedBlocks.insert(UseBlock).second)
if (!ProcessedBlocks.insert(UseBlock))
continue;
// If the use and store are in the same block, do a quick scan to
@ -559,7 +559,7 @@ void PromoteMem2Reg::RewriteSingleStoreAlloca(AllocaInst *AI,
// Otherwise, if this is a different block or if all uses happen
// after the store, do a simple linear scan to replace loads with
// the stored value.
for (BasicBlock::iterator I = UseBlock->begin(),E = UseBlock->end();
for (BasicBlock::iterator I = UseBlock->begin(), E = UseBlock->end();
I != E; ) {
if (LoadInst *LI = dyn_cast<LoadInst>(I++)) {
if (LI->getOperand(0) == AI) {