aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/EliminateNodes.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2002-03-28 18:38:38 +0000
committerChris Lattner <sabre@nondot.org>2002-03-28 18:38:38 +0000
commitcdae0b2591ee1772af0874e1956da01762405c42 (patch)
tree61b69bc35c702c87391e85645f9f759c74b96bec /lib/Analysis/DataStructure/EliminateNodes.cpp
parent846f1c3c1340303bfb3fd5d4e944446279ddd8df (diff)
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
Diffstat (limited to 'lib/Analysis/DataStructure/EliminateNodes.cpp')
-rw-r--r--lib/Analysis/DataStructure/EliminateNodes.cpp3
1 files changed, 2 insertions, 1 deletions
diff --git a/lib/Analysis/DataStructure/EliminateNodes.cpp b/lib/Analysis/DataStructure/EliminateNodes.cpp
index ca82ed1cd9..39fdd2c5b2 100644
--- 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...