mirror of
https://github.com/RPCS3/llvm.git
synced 2025-01-07 12:30:57 +00:00
4ce0f8aa9e
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@1820 91177308-0d34-0410-b5e6-96231b3b80d8
73 lines
2.6 KiB
C++
73 lines
2.6 KiB
C++
//===-- GlobalDCE.cpp - DCE unreachable internal methods ---------*- C++ -*--=//
|
|
//
|
|
// This transform is designed to eliminate unreachable internal globals
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/Transforms/IPO/GlobalDCE.h"
|
|
#include "llvm/Analysis/CallGraph.h"
|
|
#include "llvm/Module.h"
|
|
#include "llvm/Method.h"
|
|
#include "llvm/Pass.h"
|
|
#include "Support/DepthFirstIterator.h"
|
|
#include <set>
|
|
|
|
static bool RemoveUnreachableMethods(Module *M, CallGraph &CallGraph) {
|
|
// Calculate which methods are reachable from the external methods in the call
|
|
// graph.
|
|
//
|
|
std::set<CallGraphNode*> ReachableNodes(df_begin(&CallGraph),
|
|
df_end(&CallGraph));
|
|
|
|
// Loop over the methods in the module twice. The first time is used to drop
|
|
// references that methods have to each other before they are deleted. The
|
|
// second pass removes the methods that need to be removed.
|
|
//
|
|
std::vector<CallGraphNode*> MethodsToDelete; // Track unused methods
|
|
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();
|
|
MethodsToDelete.push_back(N);
|
|
}
|
|
}
|
|
|
|
// Nothing to do if no unreachable methods have been found...
|
|
if (MethodsToDelete.empty()) return false;
|
|
|
|
// Unreachables methods have been found and should have no references to them,
|
|
// delete them now.
|
|
//
|
|
for (std::vector<CallGraphNode*>::iterator I = MethodsToDelete.begin(),
|
|
E = MethodsToDelete.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 RemoveUnreachableMethods(M, getAnalysis<CallGraph>());
|
|
}
|
|
|
|
// getAnalysisUsageInfo - 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 getAnalysisUsageInfo(Pass::AnalysisSet &Required,
|
|
Pass::AnalysisSet &Destroyed,
|
|
Pass::AnalysisSet &Provided) {
|
|
Required.push_back(CallGraph::ID);
|
|
// FIXME: This should update the callgraph, not destroy it!
|
|
Destroyed.push_back(CallGraph::ID);
|
|
}
|
|
};
|
|
}
|
|
|
|
Pass *createGlobalDCEPass() { return new GlobalDCE(); }
|