diff options
author | Devang Patel <dpatel@apple.com> | 2007-06-07 17:47:21 +0000 |
---|---|---|
committer | Devang Patel <dpatel@apple.com> | 2007-06-07 17:47:21 +0000 |
commit | 9a51157db555395f7a6ad89faec40b3afa121091 (patch) | |
tree | 5f02f2a7b6838c0506698b2af3d2aa42ccaf8cf6 /lib/Analysis/PostDominators.cpp | |
parent | b62fa8ab6bf223e8f10178345e89721c9f46a9c9 (diff) |
Maintain ETNode as part of DomTreeNode.
This adds redundancy for now.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37492 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/PostDominators.cpp')
-rw-r--r-- | lib/Analysis/PostDominators.cpp | 28 |
1 files changed, 24 insertions, 4 deletions
diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp index fc7526ad8f..c4d42e9f3c 100644 --- a/lib/Analysis/PostDominators.cpp +++ b/lib/Analysis/PostDominators.cpp @@ -165,7 +165,9 @@ void PostDominatorTree::calculate(Function &F) { // one exit block, or it may be the virtual exit (denoted by (BasicBlock *)0) // which postdominates all real exits if there are multiple exit blocks. BasicBlock *Root = Roots.size() == 1 ? Roots[0] : 0; - DomTreeNodes[Root] = RootNode = new DomTreeNode(Root, 0); + ETNode *ERoot = new ETNode(Root); + ETNodes[Root] = ERoot; + DomTreeNodes[Root] = RootNode = new DomTreeNode(Root, 0, ERoot); // Loop over all of the reachable blocks in the function... for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) @@ -177,7 +179,11 @@ void PostDominatorTree::calculate(Function &F) { // Add a new tree node for this BasicBlock, and link it as a child of // IDomNode - BBNode = IPDomNode->addChild(new DomTreeNode(I, IPDomNode)); + ETNode *ET = new ETNode(I); + ETNodes[I] = ET; + DomTreeNode *C = new DomTreeNode(I, IPDomNode, ET); + DomTreeNodes[I] = C; + BBNode = IPDomNode->addChild(C); } } @@ -185,6 +191,16 @@ void PostDominatorTree::calculate(Function &F) { IDoms.clear(); Info.clear(); std::vector<BasicBlock*>().swap(Vertex); + + int dfsnum = 0; + // Iterate over all nodes in depth first order... + for (unsigned i = 0, e = Roots.size(); i != e; ++i) + for (idf_iterator<BasicBlock*> I = idf_begin(Roots[i]), + E = idf_end(Roots[i]); I != E; ++I) { + if (!getNodeForBlock(*I)->getETNode()->hasFather()) + getNodeForBlock(*I)->getETNode()->assignDFSNumber(dfsnum); + } + DFSInfoValid = true; } @@ -199,7 +215,11 @@ DomTreeNode *PostDominatorTree::getNodeForBlock(BasicBlock *BB) { // Add a new tree node for this BasicBlock, and link it as a child of // IDomNode - return BBNode = IPDomNode->addChild(new DomTreeNode(BB, IPDomNode)); + ETNode *ET = new ETNode(BB); + ETNodes[BB] = ET; + DomTreeNode *C = new DomTreeNode(BB, IPDomNode, ET); + DomTreeNodes[BB] = C; + return BBNode = IPDomNode->addChild(C); } //===----------------------------------------------------------------------===// @@ -303,7 +323,7 @@ PostDominanceFrontier::calculate(const PostDominatorTree &DT, DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end(); for (; CDFI != CDFE; ++CDFI) { - if (!Node->properlyDominates(DT[*CDFI])) + if (!DT.properlyDominates(Node, DT[*CDFI])) S.insert(*CDFI); } } |