RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-01 00:25:01 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

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

Browse Source 
ALL allocation nodes... hrm... bad.

llvm-svn: 2018
This commit is contained in:
Chris Lattner 2002-03-28 18:38:38 +00:00
parent 42ebbcbaf7
commit fa67ad938c
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
lib/Analysis/DataStructure/EliminateNodes.cpp
View File

@ -152,7 +152,7 @@ static inline void MarkReferredNodeSetReachable(const PointerValSet &PVS,
vector<AllocDSNode*> &AllocNodes, vector<AllocDSNode*> &AllocNodes,
vector<bool> &ReachableAllocNodes) { vector<bool> &ReachableAllocNodes) {
for (unsigned i = 0, e = PVS.size(); i != e; ++i) 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, MarkReferredNodesReachable(PVS[i].Node, ShadowNodes, ReachableShadowNodes,
AllocNodes, ReachableAllocNodes); AllocNodes, ReachableAllocNodes);
} }
@ -194,6 +194,7 @@ static void MarkReferredNodesReachable(DSNode *N,
bool FunctionDSGraph::RemoveUnreachableShadowNodes() { bool FunctionDSGraph::RemoveUnreachableShadowNodes() {
bool Changed = false; bool Changed = false;
while (1) { while (1) {
// Reachable*Nodes - Contains true if there is an edge from a reachable // Reachable*Nodes - Contains true if there is an edge from a reachable
// node to the numbered node... // node to the numbered node...