6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-11-23 00:20:25 +00:00
Code Issues Projects Releases Wiki Activity

Fix some formatting.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43049 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson
2007-10-16 22:59:15 +00:00
parent 11923cc05e
commit 280f8a2ece
1 changed files with 21 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
include/llvm/Analysis/Dominators.h
View File

@@ -443,23 +443,29 @@ public:
} }
protected: protected:
template<class GraphT> friend void Compress(DominatorTreeBase<typename GraphT::NodeType>& DT, template<class GraphT>
typename GraphT::NodeType* VIn); friend void Compress(DominatorTreeBase<typename GraphT::NodeType>& DT,
template<class GraphT> friend typename GraphT::NodeType* Eval( typename GraphT::NodeType* VIn);
DominatorTreeBase<typename GraphT::NodeType>& DT,
typename GraphT::NodeType* V); template<class GraphT>
template<class GraphT> friend void Link(DominatorTreeBase<typename GraphT::NodeType>& DT, friend typename GraphT::NodeType* Eval(
typename GraphT::NodeType* V, DominatorTreeBase<typename GraphT::NodeType>& DT,
typename GraphT::NodeType* W, typename GraphT::NodeType* V);
typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &WInfo);
template<class GraphT>
friend void Link(DominatorTreeBase<typename GraphT::NodeType>& DT,
typename GraphT::NodeType* V,
typename GraphT::NodeType* W,
typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &WInfo);
template<class GraphT> friend unsigned DFSPass( template<class GraphT>
DominatorTreeBase<typename GraphT::NodeType>& DT, friend unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
typename GraphT::NodeType* V, typename GraphT::NodeType* V,
unsigned N); unsigned N);
template<class N, class GraphT> friend void Calculate(DominatorTreeBase<typename GraphT::NodeType>& DT, template<class N, class GraphT>
Function& F); friend void Calculate(DominatorTreeBase<typename GraphT::NodeType>& DT,
Function& F);
/// updateDFSNumbers - Assign In and Out numbers to the nodes while walking /// updateDFSNumbers - Assign In and Out numbers to the nodes while walking
/// dominator tree in dfs order. /// dominator tree in dfs order.