diff options
author | Chris Lattner <sabre@nondot.org> | 2005-01-30 23:51:02 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2005-01-30 23:51:02 +0000 |
commit | a9548d9fd99beea7d5e4dc6619cb5569b54620c0 (patch) | |
tree | 9f87a41c58c91a4329843364d64c54d788e5171e /lib/Analysis/DataStructure/CompleteBottomUp.cpp | |
parent | 7b2a5270b7613a12fb0b3c12ccdef26367fb8339 (diff) |
* Make some methods more const correct.
* Change the FunctionCalls and AuxFunctionCalls vectors into std::lists.
This makes many operations on these lists much more natural, and avoids
*exteremely* expensive copying of DSCallSites (e.g. moving nodes around
between lists, erasing a node from not the end of the vector, etc).
With a profile build of analyze, this speeds up BU DS from 25.14s to
12.59s on 176.gcc. I expect that it would help TD even more, but I don't
have data for it.
This effectively eliminates removeIdenticalCalls and children from the
profile, going from 6.53 to 0.27s.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19939 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis/DataStructure/CompleteBottomUp.cpp')
-rw-r--r-- | lib/Analysis/DataStructure/CompleteBottomUp.cpp | 26 |
1 files changed, 15 insertions, 11 deletions
diff --git a/lib/Analysis/DataStructure/CompleteBottomUp.cpp b/lib/Analysis/DataStructure/CompleteBottomUp.cpp index 3cd2bb0eef..2dba93158f 100644 --- a/lib/Analysis/DataStructure/CompleteBottomUp.cpp +++ b/lib/Analysis/DataStructure/CompleteBottomUp.cpp @@ -49,20 +49,21 @@ bool CompleteBUDataStructures::runOnModule(Module &M) { // we hack it like this: for (Module::iterator MI = M.begin(), ME = M.end(); MI != ME; ++MI) { if (MI->isExternal()) continue; - const std::vector<DSCallSite> &CSs = TD.getDSGraph(*MI).getFunctionCalls(); + const std::list<DSCallSite> &CSs = TD.getDSGraph(*MI).getFunctionCalls(); - for (unsigned CSi = 0, e = CSs.size(); CSi != e; ++CSi) { - Instruction *TheCall = CSs[CSi].getCallSite().getInstruction(); + for (std::list<DSCallSite>::const_iterator CSI = CSs.begin(), E = CSs.end(); + CSI != E; ++CSI) { + Instruction *TheCall = CSI->getCallSite().getInstruction(); - if (CSs[CSi].isIndirectCall()) { // indirect call: insert all callees + if (CSI->isIndirectCall()) { // indirect call: insert all callees const std::vector<GlobalValue*> &Callees = - CSs[CSi].getCalleeNode()->getGlobals(); + CSI->getCalleeNode()->getGlobals(); for (unsigned i = 0, e = Callees.size(); i != e; ++i) if (Function *F = dyn_cast<Function>(Callees[i])) ActualCallees.insert(std::make_pair(TheCall, F)); } else { // direct call: insert the single callee directly ActualCallees.insert(std::make_pair(TheCall, - CSs[CSi].getCalleeFunc())); + CSI->getCalleeFunc())); } } } @@ -121,8 +122,8 @@ unsigned CompleteBUDataStructures::calculateSCCGraphs(DSGraph &FG, Stack.push_back(&FG); // The edges out of the current node are the call site targets... - for (unsigned i = 0, e = FG.getFunctionCalls().size(); i != e; ++i) { - Instruction *Call = FG.getFunctionCalls()[i].getCallSite().getInstruction(); + for (DSGraph::fc_iterator CI = FG.fc_begin(), E = FG.fc_end(); CI != E; ++CI){ + Instruction *Call = CI->getCallSite().getInstruction(); // Loop over all of the actually called functions... ActualCalleesTy::iterator I, E; @@ -183,8 +184,10 @@ void CompleteBUDataStructures::processGraph(DSGraph &G) { hash_set<Instruction*> calls; // The edges out of the current node are the call site targets... - for (unsigned i = 0, e = G.getFunctionCalls().size(); i != e; ++i) { - const DSCallSite &CS = G.getFunctionCalls()[i]; + unsigned i = 0; + for (DSGraph::fc_iterator CI = G.fc_begin(), E = G.fc_end(); CI != E; + ++CI, ++i) { + const DSCallSite &CS = *CI; Instruction *TheCall = CS.getCallSite().getInstruction(); assert(calls.insert(TheCall).second && @@ -208,7 +211,8 @@ void CompleteBUDataStructures::processGraph(DSGraph &G) { G.mergeInGraph(CS, *CalleeFunc, GI, DSGraph::KeepModRefBits | DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes | DSGraph::DontCloneAuxCallNodes); - DEBUG(std::cerr << " Inlining graph [" << i << "/" << e-1 + DEBUG(std::cerr << " Inlining graph [" << i << "/" + << G.getFunctionCalls().size()-1 << ":" << TNum << "/" << Num-1 << "] for " << CalleeFunc->getName() << "[" << GI.getGraphSize() << "+" << GI.getAuxFunctionCalls().size() |