// 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)
friend BasicBlock *DTEval(DominatorTree& DT, BasicBlock *v);
friend void DTLink(DominatorTree& DT, BasicBlock *V,
BasicBlock *W, InfoRec &WInfo);
+
+ unsigned DFSPass(BasicBlock *V, unsigned N);
};
//===-------------------------------------
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.