Ooops, I did such a great job pruning nodes, that I accidentally deleted

ALL allocation nodes... hrm... bad.

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

diff --git a/lib/Analysis/DataStructure/EliminateNodes.cpp b/lib/Analysis/DataStructure/EliminateNodes.cpp
index ca82ed1cd92efac0c831a9cd81846d47f927f429..39fdd2c5b290a0d10422420b791f88e9a5161d8d 100644 (file)
--- a/lib/Analysis/DataStructure/EliminateNodes.cpp
+++ b/lib/Analysis/DataStructure/EliminateNodes.cpp
@@ -152,7 +152,7 @@ static inline void MarkReferredNodeSetReachable(const PointerValSet &PVS,
                                             vector<AllocDSNode*>  &AllocNodes,
                                             vector<bool> &ReachableAllocNodes) {
   for (unsigned i = 0, e = PVS.size(); i != e; ++i)
-    if (isa<ShadowDSNode>(PVS[i].Node) || isa<ShadowDSNode>(PVS[i].Node))
+    if (isa<ShadowDSNode>(PVS[i].Node) || isa<AllocDSNode>(PVS[i].Node))
       MarkReferredNodesReachable(PVS[i].Node, ShadowNodes, ReachableShadowNodes,
                                  AllocNodes, ReachableAllocNodes);
 }
@@ -194,6 +194,7 @@ static void MarkReferredNodesReachable(DSNode *N,
 
 bool FunctionDSGraph::RemoveUnreachableShadowNodes() {
   bool Changed = false;
+
   while (1) {
     // Reachable*Nodes - Contains true if there is an edge from a reachable
     // node to the numbered node...