[llvm-commits] [llvm] r42250 - in /llvm/trunk: include/llvm/Analysis/Dominators.h lib/VMCore/Dominators.cpp

[Owen Anderson]

Author: resistor
Date: Sun Sep 23 17:16:38 2007
New Revision: 42250

URL: http://llvm.org/viewvc/llvm-project?rev=42250&view=rev
Log:
Move DFSPass back down into DominatorTree.  I need to figure out what the difference is between it
and the PostDomTree version first.

Modified:
    llvm/trunk/include/llvm/Analysis/Dominators.h
    llvm/trunk/lib/VMCore/Dominators.cpp

Modified: llvm/trunk/include/llvm/Analysis/Dominators.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/Dominators.h?rev=42250&r1=42249&r2=42250&view=diff

==============================================================================
--- llvm/trunk/include/llvm/Analysis/Dominators.h (original)
+++ llvm/trunk/include/llvm/Analysis/Dominators.h Sun Sep 23 17:16:38 2007
@@ -129,7 +129,6 @@
 
   // Info - Collection of information used during the computation of idoms.
   DenseMap<BasicBlock*, InfoRec> Info;
-  unsigned DFSPass(BasicBlock *V, unsigned N);
 
 public:
   DominatorTreeBase(intptr_t ID, bool isPostDom) 
@@ -319,6 +318,8 @@
   friend BasicBlock *DTEval(DominatorTree& DT, BasicBlock *v);
   friend void DTLink(DominatorTree& DT, BasicBlock *V,
                      BasicBlock *W, InfoRec &WInfo);
+  
+  unsigned DFSPass(BasicBlock *V, unsigned N);
 };
 
 //===-------------------------------------

Modified: llvm/trunk/lib/VMCore/Dominators.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/VMCore/Dominators.cpp?rev=42250&r1=42249&r2=42250&view=diff

==============================================================================
--- llvm/trunk/lib/VMCore/Dominators.cpp (original)
+++ llvm/trunk/lib/VMCore/Dominators.cpp Sun Sep 23 17:16:38 2007
@@ -53,7 +53,7 @@
 static RegisterPass<DominatorTree>
 E("domtree", "Dominator Tree Construction", true);
 
-unsigned DominatorTreeBase::DFSPass(BasicBlock *V, unsigned N) {
+unsigned DominatorTree::DFSPass(BasicBlock *V, unsigned N) {
   // This is more understandable as a recursive algorithm, but we can't use the
   // recursive algorithm due to stack depth issues.  Keep it here for
   // documentation purposes.