From eefb31094f2481815884afba0076eadbf89045f1 Mon Sep 17 00:00:00 2001 From: Owen Anderson Date: Sun, 23 Sep 2007 22:16:38 +0000 Subject: [PATCH] Move DFSPass back down into DominatorTree. I need to figure out what the difference is between it and the PostDomTree version first. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42250 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/Analysis/Dominators.h | 3 ++- lib/VMCore/Dominators.cpp | 2 +- 2 files changed, 3 insertions(+), 2 deletions(-) diff --git a/include/llvm/Analysis/Dominators.h b/include/llvm/Analysis/Dominators.h index eec87d43474..f4c31a5f161 100644 --- a/include/llvm/Analysis/Dominators.h +++ b/include/llvm/Analysis/Dominators.h @@ -129,7 +129,6 @@ protected: // Info - Collection of information used during the computation of idoms. DenseMap Info; - unsigned DFSPass(BasicBlock *V, unsigned N); public: DominatorTreeBase(intptr_t ID, bool isPostDom) @@ -319,6 +318,8 @@ private: friend BasicBlock *DTEval(DominatorTree& DT, BasicBlock *v); friend void DTLink(DominatorTree& DT, BasicBlock *V, BasicBlock *W, InfoRec &WInfo); + + unsigned DFSPass(BasicBlock *V, unsigned N); }; //===------------------------------------- diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp index 860387fffda..0fc024ba6fe 100644 --- a/lib/VMCore/Dominators.cpp +++ b/lib/VMCore/Dominators.cpp @@ -53,7 +53,7 @@ char DominatorTree::ID = 0; static RegisterPass 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.