diff options
author | Chris Lattner <sabre@nondot.org> | 2007-08-04 23:48:07 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2007-08-04 23:48:07 +0000 |
commit | 0a5f83c22cc5d1fe24e57aadde9399fa90eb5c98 (patch) | |
tree | d74b2bec4e988640e62405cf2386b454483b412b /lib/VMCore | |
parent | f12f8def399c80aa283783ca406434ee2f80b49f (diff) | |
download | external_llvm-0a5f83c22cc5d1fe24e57aadde9399fa90eb5c98.zip external_llvm-0a5f83c22cc5d1fe24e57aadde9399fa90eb5c98.tar.gz external_llvm-0a5f83c22cc5d1fe24e57aadde9399fa90eb5c98.tar.bz2 |
switch the DomTreeNodes and IDoms maps in idom/postidom to a
DenseMap instead of an std::map. This speeds up postdomtree
by about 25% and domtree by about 23%. It also speeds up clients,
for example, domfrontier by 11%, mem2reg by 4% and ADCE by 6%.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40826 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/VMCore')
-rw-r--r-- | lib/VMCore/Dominators.cpp | 29 |
1 files changed, 13 insertions, 16 deletions
diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp index 91b422c..9b36e1d 100644 --- a/lib/VMCore/Dominators.cpp +++ b/lib/VMCore/Dominators.cpp @@ -212,8 +212,7 @@ void DominatorTree::Compress(BasicBlock *VIn) { std::vector<BasicBlock *> Work; std::set<BasicBlock *> Visited; - InfoRec &VInInfo = Info[VIn]; - BasicBlock *VInAncestor = VInInfo.Ancestor; + BasicBlock *VInAncestor = Info[VIn].Ancestor; InfoRec &VInVAInfo = Info[VInAncestor]; if (VInVAInfo.Ancestor != 0) @@ -233,7 +232,7 @@ void DominatorTree::Compress(BasicBlock *VIn) { } Work.pop_back(); - // Update VINfo based on Ancestor info + // Update VInfo based on Ancestor info if (VAInfo.Ancestor == 0) continue; BasicBlock *VAncestorLabel = VAInfo.Label; @@ -366,17 +365,16 @@ void DominatorTree::calculate(Function& F) { // Loop over all of the reachable blocks in the function... for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) if (BasicBlock *ImmDom = getIDom(I)) { // Reachable block. - DomTreeNode *&BBNode = DomTreeNodes[I]; - if (!BBNode) { // Haven't calculated this node yet? - // Get or calculate the node for the immediate dominator - DomTreeNode *IDomNode = getNodeForBlock(ImmDom); - - // Add a new tree node for this BasicBlock, and link it as a child of - // IDomNode - DomTreeNode *C = new DomTreeNode(I, IDomNode); - DomTreeNodes[I] = C; - BBNode = IDomNode->addChild(C); - } + DomTreeNode *BBNode = DomTreeNodes[I]; + if (BBNode) continue; // Haven't calculated this node yet? + + // Get or calculate the node for the immediate dominator + DomTreeNode *IDomNode = getNodeForBlock(ImmDom); + + // Add a new tree node for this BasicBlock, and link it as a child of + // IDomNode + DomTreeNode *C = new DomTreeNode(I, IDomNode); + DomTreeNodes[I] = IDomNode->addChild(C); } // Free temporary memory used to construct idom's @@ -387,8 +385,7 @@ void DominatorTree::calculate(Function& F) { updateDFSNumbers(); } -void DominatorTreeBase::updateDFSNumbers() -{ +void DominatorTreeBase::updateDFSNumbers() { int dfsnum = 0; // Iterate over all nodes in depth first order. for (unsigned i = 0, e = Roots.size(); i != e; ++i) |