Move DFSPass back down into DominatorTree. I need to figure out what the difference is between it
and the PostDomTree version first. llvm-svn: 42250
This commit is contained in:
parent
7888658c5f
commit
da853a400f
|
@ -129,7 +129,6 @@ protected:
|
|||
|
||||
// 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 @@ 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);
|
||||
};
|
||||
|
||||
//===-------------------------------------
|
||||
|
|
|
@ -53,7 +53,7 @@ char DominatorTree::ID = 0;
|
|||
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.
|
||||
|
|
Loading…
Reference in New Issue