| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 1 | //===-- GlobalDCE.cpp - DCE unreachable internal functions ----------------===// |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 2 | // |
| 3 | // This transform is designed to eliminate unreachable internal globals |
| Chris Lattner | c8e6654 | 2002-04-27 06:56:12 +0000 | [diff] [blame] | 4 | // FIXME: GlobalDCE should update the callgraph, not destroy it! |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 5 | // |
| 6 | //===----------------------------------------------------------------------===// |
| 7 | |
| 8 | #include "llvm/Transforms/IPO/GlobalDCE.h" |
| 9 | #include "llvm/Analysis/CallGraph.h" |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 10 | #include "llvm/Module.h" |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 11 | #include "llvm/Function.h" |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 12 | #include "llvm/Pass.h" |
| Chris Lattner | 5de2204 | 2001-11-27 00:03:19 +0000 | [diff] [blame] | 13 | #include "Support/DepthFirstIterator.h" |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 14 | #include <set> |
| 15 | |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 16 | static bool RemoveUnreachableFunctions(Module *M, CallGraph &CallGraph) { |
| 17 | // Calculate which functions are reachable from the external functions in the |
| 18 | // call graph. |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 19 | // |
| Chris Lattner | 8032732 | 2002-03-06 17:16:43 +0000 | [diff] [blame] | 20 | std::set<CallGraphNode*> ReachableNodes(df_begin(&CallGraph), |
| 21 | df_end(&CallGraph)); |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 22 | |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 23 | // Loop over the functions in the module twice. The first time is used to |
| 24 | // drop references that functions have to each other before they are deleted. |
| 25 | // The second pass removes the functions that need to be removed. |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 26 | // |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 27 | std::vector<CallGraphNode*> FunctionsToDelete; // Track unused functions |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 28 | for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) { |
| Chris Lattner | 8032732 | 2002-03-06 17:16:43 +0000 | [diff] [blame] | 29 | CallGraphNode *N = CallGraph[*I]; |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 30 | if (!ReachableNodes.count(N)) { // Not reachable?? |
| 31 | (*I)->dropAllReferences(); |
| 32 | N->removeAllCalledMethods(); |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 33 | FunctionsToDelete.push_back(N); |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 34 | } |
| 35 | } |
| 36 | |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 37 | // Nothing to do if no unreachable functions have been found... |
| 38 | if (FunctionsToDelete.empty()) return false; |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 39 | |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 40 | // Unreachables functions have been found and should have no references to |
| 41 | // them, delete them now. |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 42 | // |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 43 | for (std::vector<CallGraphNode*>::iterator I = FunctionsToDelete.begin(), |
| 44 | E = FunctionsToDelete.end(); I != E; ++I) |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 45 | delete CallGraph.removeMethodFromModule(*I); |
| 46 | |
| Chris Lattner | bd422e6 | 2001-11-26 18:42:17 +0000 | [diff] [blame] | 47 | return true; |
| 48 | } |
| 49 | |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 50 | namespace { |
| 51 | struct GlobalDCE : public Pass { |
| Chris Lattner | 37104aa | 2002-04-29 14:57:45 +0000 | [diff] [blame^] | 52 | const char *getPassName() const { return "Dead Global Elimination"; } |
| 53 | |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 54 | // run - Do the GlobalDCE pass on the specified module, optionally updating |
| 55 | // the specified callgraph to reflect the changes. |
| 56 | // |
| 57 | bool run(Module *M) { |
| Chris Lattner | 62b7fd1 | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 58 | return RemoveUnreachableFunctions(M, getAnalysis<CallGraph>()); |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 59 | } |
| 60 | |
| Chris Lattner | c8e6654 | 2002-04-27 06:56:12 +0000 | [diff] [blame] | 61 | // getAnalysisUsage - This function works on the call graph of a module. |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 62 | // It is capable of updating the call graph to reflect the new state of the |
| 63 | // module. |
| 64 | // |
| Chris Lattner | c8e6654 | 2002-04-27 06:56:12 +0000 | [diff] [blame] | 65 | virtual void getAnalysisUsage(AnalysisUsage &AU) const { |
| 66 | AU.addRequired(CallGraph::ID); |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 67 | } |
| 68 | }; |
| Chris Lattner | d5d5678 | 2002-01-31 00:45:11 +0000 | [diff] [blame] | 69 | } |
| 70 | |
| Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 71 | Pass *createGlobalDCEPass() { return new GlobalDCE(); } |