From fa6a0a819de72a69f729d85d57f43e145e097190 Mon Sep 17 00:00:00 2001 From: Davide Italiano Date: Mon, 10 Apr 2017 22:44:46 +0000 Subject: [MemorySSA] We don't need to compute dominator levels anymore. Differential Revision: https://reviews.llvm.org/D31818 llvm-svn: 299893 --- llvm/lib/Transforms/Utils/MemorySSA.cpp | 7 ------- 1 file changed, 7 deletions(-) (limited to 'llvm/lib/Transforms/Utils') diff --git a/llvm/lib/Transforms/Utils/MemorySSA.cpp b/llvm/lib/Transforms/Utils/MemorySSA.cpp index 7aecda70836..b1e9603f533 100644 --- a/llvm/lib/Transforms/Utils/MemorySSA.cpp +++ b/llvm/lib/Transforms/Utils/MemorySSA.cpp @@ -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 &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. -- cgit v1.2.3