Switch some std::sets to SmallPtrSet. This speeds up

domtree by 10% and postdomtree by 17%

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40829 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp
index 244f8cdff525c16649730bb714a82d59d4423760..d2892de8ed2429622a930271e3b959f9d1856389 100644 (file)
--- a/lib/Analysis/PostDominators.cpp
+++ b/lib/Analysis/PostDominators.cpp
@@ -29,7 +29,7 @@ F("postdomtree", "Post-Dominator Tree Construction", true);
 
 unsigned PostDominatorTree::DFSPass(BasicBlock *V, unsigned N) {
   std::vector<BasicBlock *> workStack;
-  std::set<BasicBlock *> visited;
+  SmallPtrSet<BasicBlock *, 32> Visited;
   workStack.push_back(V);
 
   do {
@@ -37,7 +37,7 @@ unsigned PostDominatorTree::DFSPass(BasicBlock *V, unsigned N) {
     InfoRec &CurVInfo = Info[currentBB];
 
     // Visit each block only once.
-    if (visited.insert(currentBB).second) {
+    if (Visited.insert(currentBB)) {
       CurVInfo.Semi = ++N;
       CurVInfo.Label = currentBB;
       
@@ -55,7 +55,7 @@ unsigned PostDominatorTree::DFSPass(BasicBlock *V, unsigned N) {
       InfoRec &SuccVInfo = Info[*PI];
       if (SuccVInfo.Semi == 0) {
         SuccVInfo.Parent = currentBB;
-        if (!visited.count(*PI)) {
+        if (!Visited.count(*PI)) {
           workStack.push_back(*PI);   
           visitChild = true;
         }

diff --git a/lib/VMCore/Dominators.cpp b/lib/VMCore/Dominators.cpp
index 6231eb8e469d6d3e397f8c1249a79bb3c6751170..7d0fbaa29aa5e656f6bca56981c68930c2ed573f 100644 (file)
--- a/lib/VMCore/Dominators.cpp
+++ b/lib/VMCore/Dominators.cpp
@@ -211,7 +211,7 @@ unsigned DominatorTree::DFSPass(BasicBlock *V, unsigned N) {
 void DominatorTree::Compress(BasicBlock *VIn) {
 
   std::vector<BasicBlock *> Work;
-  std::set<BasicBlock *> Visited;
+  SmallPtrSet<BasicBlock *, 32> Visited;
   BasicBlock *VInAncestor = Info[VIn].Ancestor;
   InfoRec &VInVAInfo = Info[VInAncestor];
 
@@ -225,9 +225,9 @@ void DominatorTree::Compress(BasicBlock *VIn) {
     InfoRec &VAInfo = Info[VAncestor];
 
     // Process Ancestor first
-    if (Visited.count(VAncestor) == 0 && VAInfo.Ancestor != 0) {
+    if (Visited.insert(VAncestor) &&
+        VAInfo.Ancestor != 0) {
       Work.push_back(VAncestor);
-      Visited.insert(VAncestor);
       continue;
     } 
     Work.pop_back();