RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

Add partial caching of non-local memory dependence queries. This provides a modest

Browse Source 
speedup for GVN.

llvm-svn: 42185
This commit is contained in:
Owen Anderson 2007-09-21 03:53:52 +00:00
parent d675ed5400
commit 9070cf6dea
2 changed files with 34 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
lib/Analysis/MemoryDependenceAnalysis.cpp
View File

@ -135,6 +135,13 @@ void MemoryDependenceAnalysis::nonLocalHelper(Instruction* query,
DenseMap<BasicBlock*, Value*>& resp) { DenseMap<BasicBlock*, Value*>& resp) {
// Set of blocks that we've already visited in our DFS // Set of blocks that we've already visited in our DFS
SmallPtrSet<BasicBlock*, 4> visited; SmallPtrSet<BasicBlock*, 4> visited;
// If we're updating a dirtied cache entry, we don't need to reprocess
// already computed entries.
for (DenseMap<BasicBlock*, Value*>::iterator I = resp.begin(),
E = resp.end(); I != E; ++I)
if (I->second != Dirty)
visited.insert(I->first);
// Current stack of the DFS // Current stack of the DFS
SmallVector<BasicBlock*, 4> stack; SmallVector<BasicBlock*, 4> stack;
stack.push_back(block); stack.push_back(block);
@ -211,8 +218,28 @@ void MemoryDependenceAnalysis::nonLocalHelper(Instruction* query,
void MemoryDependenceAnalysis::getNonLocalDependency(Instruction* query, void MemoryDependenceAnalysis::getNonLocalDependency(Instruction* query,
DenseMap<BasicBlock*, Value*>& resp) { DenseMap<BasicBlock*, Value*>& resp) {
if (depGraphNonLocal.count(query)) { if (depGraphNonLocal.count(query)) {
resp = depGraphNonLocal[query]; DenseMap<BasicBlock*, Value*>& cached = depGraphNonLocal[query];
NumCacheNonlocal++; NumCacheNonlocal++;
SmallVector<BasicBlock*, 4> dirtied;
for (DenseMap<BasicBlock*, Value*>::iterator I = cached.begin(),
E = cached.end(); I != E; ++I)
if (I->second == Dirty)
dirtied.push_back(I->first);
for (SmallVector<BasicBlock*, 4>::iterator I = dirtied.begin(),
E = dirtied.end(); I != E; ++I) {
Instruction* localDep = getDependency(query, 0, *I);
if (localDep != NonLocal)
cached[*I] = localDep;
else {
cached.erase(*I);
nonLocalHelper(query, *I, cached);
}
}
resp = cached;
return; return;
} else } else
NumUncacheNonlocal++; NumUncacheNonlocal++;
@ -430,7 +457,11 @@ void MemoryDependenceAnalysis::removeInstruction(Instruction* rem) {
SmallPtrSet<Instruction*, 4>& set = reverseDepNonLocal[rem]; SmallPtrSet<Instruction*, 4>& set = reverseDepNonLocal[rem];
for (SmallPtrSet<Instruction*, 4>::iterator I = set.begin(), E = set.end(); for (SmallPtrSet<Instruction*, 4>::iterator I = set.begin(), E = set.end();
I != E; ++I) I != E; ++I)
depGraphNonLocal.erase(*I); for (DenseMap<BasicBlock*, Value*>::iterator DI =
depGraphNonLocal[*I].begin(), DE = depGraphNonLocal[*I].end();
DI != DE; ++DI)
if (DI->second == rem)
DI->second = Dirty;
reverseDepNonLocal.erase(rem); reverseDepNonLocal.erase(rem);
} }

2
lib/Transforms/Scalar/GVN.cpp
View File

@ -834,7 +834,7 @@ bool GVN::processNonLocalLoad(LoadInst* L,
return false; return false;
} else if (I->second == MemoryDependenceAnalysis::NonLocal) { } else if (I->second == MemoryDependenceAnalysis::NonLocal) {
continue; continue;
}else if (StoreInst* S = dyn_cast<StoreInst>(I->second)) { } else if (StoreInst* S = dyn_cast<StoreInst>(I->second)) {
if (S->getPointerOperand() == L->getPointerOperand()) if (S->getPointerOperand() == L->getPointerOperand())
repl[I->first] = S->getOperand(0); repl[I->first] = S->getOperand(0);
else else