replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fix a problem Nate and Duraid reported where simplifying nodes can cause 

them to get ressurected, in which case, deleting the undead nodes is
unfriendly.

llvm-svn: 26291
This commit is contained in:
Chris Lattner 2006-02-20 06:51:04 +00:00
parent 486d1bc5ed
commit 301f45cf6f
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
llvm/lib/CodeGen/SelectionDAG/DAGCombiner.cpp
View File

@ -120,18 +120,22 @@ namespace {
std::vector<SDNode*> NowDead;
DAG.ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, NowDead);
// Push the new node and any (now) users onto the worklist.
// Push the new node and any (possibly new) users onto the worklist.
WorkList.push_back(TLO.New.Val);
AddUsersToWorkList(TLO.New.Val);
// Nodes can end up on the worklist more than once. Make sure we do
// not process a node that has been replaced.
removeFromWorkList(TLO.Old.Val);
for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
removeFromWorkList(NowDead[i]);
// Finally, since the node is now dead, remove it from the graph.
DAG.DeleteNode(TLO.Old.Val);
// Finally, if the node is now dead, remove it from the graph. The node
// may not be dead if the replacement process recursively simplified to
// something else needing this node.
if (TLO.Old.Val->use_empty()) {
removeFromWorkList(TLO.Old.Val);
DAG.DeleteNode(TLO.Old.Val);
}
return true;
}