mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-21 03:29:40 +00:00
f57b845547
- Rename runOnMethod to runOnFunction
* Transform getAnalysisUsageInfo into getAnalysisUsage
- Method is now const
- It now takes one AnalysisUsage object to fill in instead of 3 vectors
to fill in
- Pass's now specify which other passes they _preserve_ not which ones
they modify (be conservative!)
- A pass can specify that it preserves all analyses (because it never
modifies the underlying program)
* s/Method/Function/g in other random places as well
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2333 91177308-0d34-0410-b5e6-96231b3b80d8
70 lines
2.4 KiB
C++
70 lines
2.4 KiB
C++
//===-- GlobalDCE.cpp - DCE unreachable internal functions ----------------===//
|
|
//
|
|
// This transform is designed to eliminate unreachable internal globals
|
|
// FIXME: GlobalDCE should update the callgraph, not destroy it!
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Transforms/IPO/GlobalDCE.h"
|
|
#include "llvm/Analysis/CallGraph.h"
|
|
#include "llvm/Module.h"
|
|
#include "llvm/Function.h"
|
|
#include "llvm/Pass.h"
|
|
#include "Support/DepthFirstIterator.h"
|
|
#include <set>
|
|
|
|
static bool RemoveUnreachableFunctions(Module *M, CallGraph &CallGraph) {
|
|
// Calculate which functions are reachable from the external functions in the
|
|
// call graph.
|
|
//
|
|
std::set<CallGraphNode*> ReachableNodes(df_begin(&CallGraph),
|
|
df_end(&CallGraph));
|
|
|
|
// Loop over the functions in the module twice. The first time is used to
|
|
// drop references that functions have to each other before they are deleted.
|
|
// The second pass removes the functions that need to be removed.
|
|
//
|
|
std::vector<CallGraphNode*> FunctionsToDelete; // Track unused functions
|
|
for (Module::iterator I = M->begin(), E = M->end(); I != E; ++I) {
|
|
CallGraphNode *N = CallGraph[*I];
|
|
if (!ReachableNodes.count(N)) { // Not reachable??
|
|
(*I)->dropAllReferences();
|
|
N->removeAllCalledMethods();
|
|
FunctionsToDelete.push_back(N);
|
|
}
|
|
}
|
|
|
|
// Nothing to do if no unreachable functions have been found...
|
|
if (FunctionsToDelete.empty()) return false;
|
|
|
|
// Unreachables functions have been found and should have no references to
|
|
// them, delete them now.
|
|
//
|
|
for (std::vector<CallGraphNode*>::iterator I = FunctionsToDelete.begin(),
|
|
E = FunctionsToDelete.end(); I != E; ++I)
|
|
delete CallGraph.removeMethodFromModule(*I);
|
|
|
|
return true;
|
|
}
|
|
|
|
namespace {
|
|
struct GlobalDCE : public Pass {
|
|
// run - Do the GlobalDCE pass on the specified module, optionally updating
|
|
// the specified callgraph to reflect the changes.
|
|
//
|
|
bool run(Module *M) {
|
|
return RemoveUnreachableFunctions(M, getAnalysis<CallGraph>());
|
|
}
|
|
|
|
// getAnalysisUsage - This function works on the call graph of a module.
|
|
// It is capable of updating the call graph to reflect the new state of the
|
|
// module.
|
|
//
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.addRequired(CallGraph::ID);
|
|
}
|
|
};
|
|
}
|
|
|
|
Pass *createGlobalDCEPass() { return new GlobalDCE(); }
|