Don't mess up SCC traversal when a node has null edges out of it.

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

diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp
index a95d2522a0a205c76708c1e6afd48d02a7c324f5..904d8b10b769c53fcbea35d79376de8776d1c99b 100644 (file)
--- a/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/lib/Analysis/DataStructure/DataStructure.cpp
@@ -1430,11 +1430,12 @@ VisitForSCCs(const DSNode *N) {
   // Otherwise, check all successors.
   bool AnyDirectSuccessorsReachClonedNodes = false;
   for (DSNode::const_edge_iterator EI = N->edge_begin(), EE = N->edge_end();
-       EI != EE; ++EI) {
-    std::pair<unsigned, bool> &SuccInfo = VisitForSCCs(EI->getNode());
-    if (SuccInfo.first < Min) Min = SuccInfo.first;
-    AnyDirectSuccessorsReachClonedNodes |= SuccInfo.second;
-  }
+       EI != EE; ++EI)
+    if (DSNode *Succ = EI->getNode()) {
+      std::pair<unsigned, bool> &SuccInfo = VisitForSCCs(Succ);
+      if (SuccInfo.first < Min) Min = SuccInfo.first;
+      AnyDirectSuccessorsReachClonedNodes |= SuccInfo.second;
+    }
 
   if (Min != MyId)
     return ThisNodeInfo;  // Part of a large SCC.  Leave self on stack.