RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity

add some timers, don't clone aux nodes

Browse Source 
llvm-svn: 20752
This commit is contained in:
Chris Lattner 2005-03-22 00:12:00 +00:00
parent 21b3519b2e
commit 940600a185
1 changed files with 29 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
lib/Analysis/DataStructure/TopDownClosure.cpp
View File

@ -19,9 +19,17 @@
#include "llvm/DerivedTypes.h" #include "llvm/DerivedTypes.h"
#include "llvm/Analysis/DataStructure/DSGraph.h" #include "llvm/Analysis/DataStructure/DSGraph.h"
#include "llvm/Support/Debug.h" #include "llvm/Support/Debug.h"
#include "llvm/Support/Timer.h"
#include "llvm/ADT/Statistic.h" #include "llvm/ADT/Statistic.h"
using namespace llvm; using namespace llvm;
#if 0
#define TIME_REGION(VARNAME, DESC) \
NamedRegionTimer VARNAME(DESC)
#else
#define TIME_REGION(VARNAME, DESC)
#endif
namespace { namespace {
RegisterAnalysis<TDDataStructures> // Register the pass RegisterAnalysis<TDDataStructures> // Register the pass
Y("tddatastructure", "Top-down Data Structure Analysis"); Y("tddatastructure", "Top-down Data Structure Analysis");
@ -90,6 +98,20 @@ bool TDDataStructures::runOnModule(Module &M) {
const BUDataStructures::ActualCalleesTy &ActualCallees = const BUDataStructures::ActualCalleesTy &ActualCallees =
getAnalysis<BUDataStructures>().getActualCallees(); getAnalysis<BUDataStructures>().getActualCallees();
#if 0
{TIME_REGION(XXX, "td:Copy graphs");
// Visit each of the graphs in reverse post-order now!
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (!I->isExternal())
getOrCreateDSGraph(*I);
}
//return false;
#endif
{TIME_REGION(XXX, "td:Compute postorder");
// Calculate top-down from main... // Calculate top-down from main...
if (Function *F = M.getMainFunction()) if (Function *F = M.getMainFunction())
ComputePostOrder(*F, VisitedGraph, PostOrder, ActualCallees); ComputePostOrder(*F, VisitedGraph, PostOrder, ActualCallees);
@ -99,12 +121,16 @@ bool TDDataStructures::runOnModule(Module &M) {
ComputePostOrder(*I, VisitedGraph, PostOrder, ActualCallees); ComputePostOrder(*I, VisitedGraph, PostOrder, ActualCallees);
VisitedGraph.clear(); // Release memory! VisitedGraph.clear(); // Release memory!
}
{TIME_REGION(XXX, "td:Inline stuff");
// Visit each of the graphs in reverse post-order now! // Visit each of the graphs in reverse post-order now!
while (!PostOrder.empty()) { while (!PostOrder.empty()) {
InlineCallersIntoGraph(*PostOrder.back()); InlineCallersIntoGraph(*PostOrder.back());
PostOrder.pop_back(); PostOrder.pop_back();
} }
}
// Free the IndCallMap. // Free the IndCallMap.
while (!IndCallMap.empty()) { while (!IndCallMap.empty()) {
@ -123,8 +149,9 @@ bool TDDataStructures::runOnModule(Module &M) {
DSGraph &TDDataStructures::getOrCreateDSGraph(Function &F) { DSGraph &TDDataStructures::getOrCreateDSGraph(Function &F) {
DSGraph *&G = DSInfo[&F]; DSGraph *&G = DSInfo[&F];
if (G == 0) { // Not created yet? Clone BU graph... if (G == 0) { // Not created yet? Clone BU graph...
G = new DSGraph(getAnalysis<BUDataStructures>().getDSGraph(F), GlobalECs); G = new DSGraph(getAnalysis<BUDataStructures>().getDSGraph(F), GlobalECs,
G->getAuxFunctionCalls().clear(); DSGraph::DontCloneAuxCallNodes);
assert(G->getAuxFunctionCalls().empty() && "Cloned aux calls?");
G->setPrintAuxCalls(); G->setPrintAuxCalls();
G->setGlobalsGraph(GlobalsGraph); G->setGlobalsGraph(GlobalsGraph);
} }