Rename removeDeadNodes to removeTriviallyDeadNodes

Add new removeDeadNodes method

llvm-svn: 2968
This commit is contained in:
Chris Lattner 2002-07-18 18:18:40 +00:00
parent 8211ada36a
commit c04eeaaded
1 changed files with 12 additions and 3 deletions

View File

@ -274,12 +274,21 @@ public:
// //
void markIncompleteNodes(); void markIncompleteNodes();
// removeDeadNodes - After the graph has been constructed, this method removes // removeTriviallyDeadNodes - After the graph has been constructed, this
// all unreachable nodes that are created because they got merged with other // method removes all unreachable nodes that are created because they got
// nodes in the graph. // merged with other nodes in the graph.
//
void removeTriviallyDeadNodes();
// removeDeadNodes - Use a more powerful reachability analysis to eliminate
// subgraphs that are unreachable. This often occurs because the data
// structure doesn't "escape" into it's caller, and thus should be eliminated
// from the caller's graph entirely. This is only appropriate to use when
// inlining graphs.
// //
void removeDeadNodes(); void removeDeadNodes();
// AddCaller - add a known caller node into the graph and mark it pending. // AddCaller - add a known caller node into the graph and mark it pending.
// getCallers - get a vector of the functions that call this one // getCallers - get a vector of the functions that call this one
// getCallersPending - get a matching vector of bools indicating if each // getCallersPending - get a matching vector of bools indicating if each