6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-19 01:34:32 +00:00
Code Issues Projects Releases Wiki Activity

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

Browse Source 
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
This commit is contained in:
Cameron Zwarich 2011-01-23 04:13:53 +00:00
parent 9b8d2c26bc
commit 5c96c69161
1 changed files with 2 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
include/llvm/Analysis/DominatorInternals.h
View File

@ -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) {