Cache DT[*SI] lookup.

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

diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp
index b239596163f57e9e4ec19b326abd0815fd0297bd..add25fdf42fe2e6bc70d249faa6b831ce5f4c7f8 100644 (file)
--- a/lib/Analysis/PostDominators.cpp
+++ b/lib/Analysis/PostDominators.cpp
@@ -282,10 +282,12 @@ PostDominanceFrontier::calculate(const PostDominatorTree &DT,
 
   if (BB)
     for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB);
-         SI != SE; ++SI)
+         SI != SE; ++SI) {
       // Does Node immediately dominate this predecessor?
-      if (DT[*SI] && DT[*SI]->getIDom() != Node)
+      DominatorTree::Node *SINode = DT[*SI];
+      if (SINode && SINode->getIDom() != Node)
         S.insert(*SI);
+    }
 
   // At this point, S is DFlocal.  Now we union in DFup's of our children...
   // Loop through and visit the nodes that Node immediately dominates (Node's