llvm.org GIT mirror llvm / eefb310
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 Owen Anderson 13 years ago
2 changed file(s) with 3 addition(s) and 2 deletion(s). Raw diff Collapse all Expand all
128128
129129 // Info - Collection of information used during the computation of idoms.
130130 DenseMap Info;
131 unsigned DFSPass(BasicBlock *V, unsigned N);
132131
133132 public:
134133 DominatorTreeBase(intptr_t ID, bool isPostDom)
318317 friend BasicBlock *DTEval(DominatorTree& DT, BasicBlock *v);
319318 friend void DTLink(DominatorTree& DT, BasicBlock *V,
320319 BasicBlock *W, InfoRec &WInfo);
320
321 unsigned DFSPass(BasicBlock *V, unsigned N);
321322 };
322323
323324 //===-------------------------------------
5252 static RegisterPass
5353 E("domtree", "Dominator Tree Construction", true);
5454
55 unsigned DominatorTreeBase::DFSPass(BasicBlock *V, unsigned N) {
55 unsigned DominatorTree::DFSPass(BasicBlock *V, unsigned N) {
5656 // This is more understandable as a recursive algorithm, but we can't use the
5757 // recursive algorithm due to stack depth issues. Keep it here for
5858 // documentation purposes.