RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-04 14:22:26 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Optimize a common case in the Lengauer-Tarjan dominators algorithm. This gives a

Browse Source 
9.7% speedup running domtree on test-suite.

Reviewed by Chris Lattner.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@120003 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Cameron Zwarich 2010-11-23 06:32:37 +00:00
parent 9f9bd8e4af
commit 2974b6ffbc
1 changed files with 9 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
include/llvm/Analysis/DominatorInternals.h
View File

@ -278,9 +278,16 @@ void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
} }
} }
DT.Info[DT.Vertex[WInfo.Semi]].Bucket.push_back(W);
typename GraphT::NodeType* WParent = DT.Vertex[WInfo.Parent]; typename GraphT::NodeType* WParent = DT.Vertex[WInfo.Parent];
// If V is a non-root vertex and sdom(V) = parent(V), then idom(V) is
// necessarily parent(V). In this case, set idom(V) here and avoid placing
// V into a bucket.
if (WInfo.Semi == WInfo.Parent)
DT.IDoms[W] = WParent;
else
DT.Info[DT.Vertex[WInfo.Semi]].Bucket.push_back(W);
Link<GraphT>(DT, WInfo.Parent, W, WInfo); Link<GraphT>(DT, WInfo.Parent, W, WInfo);
// Step #3: Implicitly define the immediate dominator of vertices // Step #3: Implicitly define the immediate dominator of vertices