Simplify some code now that we've removed the more optimal (but slower) version

of the link-eval data structure from dominator computation.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@124053 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/llvm/Analysis/DominatorInternals.h b/include/llvm/Analysis/DominatorInternals.h
index 5687c2350fd992ef75c7d15868aba0c08a1f0f43..7d15fc4ad36415c7449850f20da78ea674ca3d93 100644 (file)
--- a/include/llvm/Analysis/DominatorInternals.h
+++ b/include/llvm/Analysis/DominatorInternals.h
@@ -159,13 +159,6 @@ Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
   return VInfo.Label;
 }
 
-template<class GraphT>
-void Link(DominatorTreeBase<typename GraphT::NodeType>& DT,
-          unsigned DFSNumV, typename GraphT::NodeType* W,
-        typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &WInfo) {
-  WInfo.Ancestor = DFSNumV;
-}
-
 template<class FuncT, class NodeT>
 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
                FuncT& F) {
@@ -248,7 +241,8 @@ void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
       Buckets[WInfo.Semi] = i;
     }
 
-    Link<GraphT>(DT, WInfo.Parent, W, WInfo);
+    // Link W to its DFS tree parent.
+    WInfo.Ancestor = WInfo.Parent;
   }
 
   if (N >= 1) {