forked from OSchip/llvm-project
[MemorySSA] We don't need to compute dominator levels anymore.
Differential Revision: https://reviews.llvm.org/D31818 llvm-svn: 299893
This commit is contained in:
parent
7e8be28661
commit
fa6a0a819d
|
@ -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);
|
||||
|
|
|
@ -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.
|
||||
|
|
Loading…
Reference in New Issue