diff options
| author | Chris Lattner <sabre@nondot.org> | 2002-07-18 18:18:40 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2002-07-18 18:18:40 +0000 |
| commit | 2dfbe3a751e717387c862399285eff5b795d333f (patch) | |
| tree | d8f8b68fd72e0c1fa106ead3e88dfd013387eef3 /include/llvm | |
| parent | a990291462b460e58a19210db8ca85075339ea46 (diff) | |
| download | llvm-2dfbe3a751e717387c862399285eff5b795d333f.tar.gz llvm-2dfbe3a751e717387c862399285eff5b795d333f.tar.bz2 llvm-2dfbe3a751e717387c862399285eff5b795d333f.tar.xz | |
Rename removeDeadNodes to removeTriviallyDeadNodes
Add new removeDeadNodes method
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2968 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm')
| -rw-r--r-- | include/llvm/Analysis/DataStructure.h | 15 | ||||
| -rw-r--r-- | include/llvm/Analysis/DataStructure/DataStructure.h | 15 |
2 files changed, 24 insertions, 6 deletions
diff --git a/include/llvm/Analysis/DataStructure.h b/include/llvm/Analysis/DataStructure.h index 1a269e8de8..5c981ce8fe 100644 --- a/include/llvm/Analysis/DataStructure.h +++ b/include/llvm/Analysis/DataStructure.h @@ -274,12 +274,21 @@ public: // void markIncompleteNodes(); - // removeDeadNodes - After the graph has been constructed, this method removes - // all unreachable nodes that are created because they got merged with other - // nodes in the graph. + // removeTriviallyDeadNodes - After the graph has been constructed, this + // method removes all unreachable nodes that are created because they got + // 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(); + // AddCaller - add a known caller node into the graph and mark it pending. // getCallers - get a vector of the functions that call this one // getCallersPending - get a matching vector of bools indicating if each diff --git a/include/llvm/Analysis/DataStructure/DataStructure.h b/include/llvm/Analysis/DataStructure/DataStructure.h index 1a269e8de8..5c981ce8fe 100644 --- a/include/llvm/Analysis/DataStructure/DataStructure.h +++ b/include/llvm/Analysis/DataStructure/DataStructure.h @@ -274,12 +274,21 @@ public: // void markIncompleteNodes(); - // removeDeadNodes - After the graph has been constructed, this method removes - // all unreachable nodes that are created because they got merged with other - // nodes in the graph. + // removeTriviallyDeadNodes - After the graph has been constructed, this + // method removes all unreachable nodes that are created because they got + // 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(); + // AddCaller - add a known caller node into the graph and mark it pending. // getCallers - get a vector of the functions that call this one // getCallersPending - get a matching vector of bools indicating if each |