Fix some formatting.
authorOwen Anderson <resistor@mac.com>
Tue, 16 Oct 2007 22:59:15 +0000 (22:59 +0000)
committerOwen Anderson <resistor@mac.com>
Tue, 16 Oct 2007 22:59:15 +0000 (22:59 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43049 91177308-0d34-0410-b5e6-96231b3b80d8

include/llvm/Analysis/Dominators.h

index 855180d6953b2abf2dff439793e022473bf76983..3d674e7d818aef639796e59ea823716483f6c6ce 100644 (file)
@@ -443,23 +443,29 @@ public:
   }
   
 protected:
-  template<class GraphT> friend void Compress(DominatorTreeBase<typename GraphT::NodeType>& DT,
-                                              typename GraphT::NodeType* VIn);
-  template<class GraphT> friend typename GraphT::NodeType* Eval(
-                                                  DominatorTreeBase<typename GraphT::NodeType>& DT,
-                                                  typename GraphT::NodeType* V);
-  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 void Compress(DominatorTreeBase<typename GraphT::NodeType>& DT,
+                       typename GraphT::NodeType* VIn);
+
+  template<class GraphT>
+  friend typename GraphT::NodeType* Eval(
+                               DominatorTreeBase<typename GraphT::NodeType>& DT,
+                                         typename GraphT::NodeType* V);
+
+  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(
-                                                 DominatorTreeBase<typename GraphT::NodeType>& DT,
-                                                 typename GraphT::NodeType* V,
-                                                 unsigned N);
+  template<class GraphT>
+  friend unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
+                          typename GraphT::NodeType* V,
+                          unsigned N);
   
-  template<class N, class GraphT> friend void Calculate(DominatorTreeBase<typename GraphT::NodeType>& DT,
-                                                   Function& F);
+  template<class N, class GraphT>
+  friend void Calculate(DominatorTreeBase<typename GraphT::NodeType>& DT,
+                        Function& F);
   
   /// updateDFSNumbers - Assign In and Out numbers to the nodes while walking
   /// dominator tree in dfs order.