diff options
| author | Cameron Zwarich <zwarich@apple.com> | 2011-01-23 04:13:53 +0000 |
|---|---|---|
| committer | Cameron Zwarich <zwarich@apple.com> | 2011-01-23 04:13:53 +0000 |
| commit | a914bed8006a754ce36ccb00860bd944ca8807ae (patch) | |
| tree | 5fd97600d70219beb5ad316ab8af75c4b35e248c | |
| parent | ce395a9acdcab4a38e27fa18534b0b9e6c8d9cb0 (diff) | |
| download | bcm5719-llvm-a914bed8006a754ce36ccb00860bd944ca8807ae.tar.gz bcm5719-llvm-a914bed8006a754ce36ccb00860bd944ca8807ae.zip | |
Simplify some code now that we've removed the more optimal (but slower) version
of the link-eval data structure from dominator computation.
llvm-svn: 124053
| -rw-r--r-- | llvm/include/llvm/Analysis/DominatorInternals.h | 10 |
1 files changed, 2 insertions, 8 deletions
diff --git a/llvm/include/llvm/Analysis/DominatorInternals.h b/llvm/include/llvm/Analysis/DominatorInternals.h index 5687c2350fd..7d15fc4ad36 100644 --- a/llvm/include/llvm/Analysis/DominatorInternals.h +++ b/llvm/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) { |
