aboutsummaryrefslogtreecommitdiff
path: root/lib/Analysis/DataStructure/DataStructureStats.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2005-01-30 23:51:02 +0000
committerChris Lattner <sabre@nondot.org>2005-01-30 23:51:02 +0000
commita9548d9fd99beea7d5e4dc6619cb5569b54620c0 (patch)
tree9f87a41c58c91a4329843364d64c54d788e5171e /lib/Analysis/DataStructure/DataStructureStats.cpp
parent7b2a5270b7613a12fb0b3c12ccdef26367fb8339 (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/DataStructureStats.cpp')
-rw-r--r--lib/Analysis/DataStructure/DataStructureStats.cpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/lib/Analysis/DataStructure/DataStructureStats.cpp b/lib/Analysis/DataStructure/DataStructureStats.cpp
index 330362ee8f..3f8b6a93b8 100644
--- a/lib/Analysis/DataStructure/DataStructureStats.cpp
+++ b/lib/Analysis/DataStructure/DataStructureStats.cpp
@@ -75,19 +75,19 @@ static bool isIndirectCallee(Value *V) {
void DSGraphStats::countCallees(const Function& F) {
unsigned numIndirectCalls = 0, totalNumCallees = 0;
- const std::vector<DSCallSite> &callSites = TDGraph->getFunctionCalls();
- for (unsigned i = 0, N = callSites.size(); i != N; ++i)
- if (isIndirectCallee(callSites[i].getCallSite().getCalledValue())) {
+ for (DSGraph::fc_iterator I = TDGraph->fc_begin(), E = TDGraph->fc_end();
+ I != E; ++I)
+ if (isIndirectCallee(I->getCallSite().getCalledValue())) {
// This is an indirect function call
const std::vector<GlobalValue*> &Callees =
- callSites[i].getCalleeNode()->getGlobals();
+ I->getCalleeNode()->getGlobals();
if (Callees.size() > 0) {
totalNumCallees += Callees.size();
++numIndirectCalls;
} else
std::cerr << "WARNING: No callee in Function '" << F.getName()
<< "' at call: \n"
- << *callSites[i].getCallSite().getInstruction();
+ << *I->getCallSite().getInstruction();
}
TotalNumCallees += totalNumCallees;