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

[MemorySSA] We don't need to compute dominator levels anymore.

Browse Source 
Differential Revision:  https://reviews.llvm.org/D31818

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@299893 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Davide Italiano 2017-04-10 22:44:46 +00:00
parent 663903f2e8
commit 21197c2fc5
2 changed files with 0 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
include/llvm/Transforms/Utils/MemorySSA.h
View File

@ -701,7 +701,6 @@ private:
void
determineInsertionPoint(const SmallPtrSetImpl<BasicBlock *> &DefiningBlocks);
void computeDomLevels(DenseMap<DomTreeNode *, unsigned> &DomLevels);
void markUnreachableAsLiveOnEntry(BasicBlock *BB);
bool dominatesUse(const MemoryAccess *, const MemoryAccess *) const;
MemoryPhi *createMemoryPhi(BasicBlock *BB);

7
lib/Transforms/Utils/MemorySSA.cpp
View File

@ -976,13 +976,6 @@ void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal,
}
}
/// \brief Compute dominator levels, used by the phi insertion algorithm above.
void MemorySSA::computeDomLevels(DenseMap<DomTreeNode *, unsigned> &DomLevels) {
for (auto DFI = df_begin(DT->getRootNode()), DFE = df_end(DT->getRootNode());
DFI != DFE; ++DFI)
DomLevels[*DFI] = DFI.getPathLength() - 1;
}
/// \brief This handles unreachable block accesses by deleting phi nodes in
/// unreachable blocks, and marking all other unreachable MemoryAccess's as
/// being uses of the live on entry definition.