1 //===- DataStructureStats.cpp - Various statistics for DS Graphs ----------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines a little pass that prints out statistics for DS Graphs.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Analysis/DataStructure/DataStructure.h"
15 #include "llvm/Analysis/DataStructure/DSGraph.h"
16 #include "llvm/Function.h"
17 #include "llvm/Instructions.h"
18 #include "llvm/Pass.h"
19 #include "llvm/Support/InstVisitor.h"
20 #include "llvm/ADT/Statistic.h"
25 Statistic<> TotalNumCallees("totalcallees",
26 "Total number of callee functions at all indirect call sites");
27 Statistic<> NumIndirectCalls("numindirect",
28 "Total number of indirect call sites in the program");
29 Statistic<> NumPoolNodes("numpools",
30 "Number of allocation nodes that could be pool allocated");
32 // Typed/Untyped memory accesses: If DSA can infer that the types the loads
33 // and stores are accessing are correct (ie, the node has not been collapsed),
34 // increment the appropriate counter.
35 Statistic<> NumTypedMemAccesses("numtypedmemaccesses",
36 "Number of loads/stores which are fully typed");
37 Statistic<> NumUntypedMemAccesses("numuntypedmemaccesses",
38 "Number of loads/stores which are untyped");
40 class DSGraphStats : public FunctionPass, public InstVisitor<DSGraphStats> {
41 void countCallees(const Function &F);
42 const DSGraph *TDGraph;
44 DSNode *getNodeForValue(Value *V);
45 bool isNodeForValueCollapsed(Value *V);
47 /// Driver functions to compute the Load/Store Dep. Graph per function.
48 bool runOnFunction(Function& F);
50 /// getAnalysisUsage - This modify nothing, and uses the Top-Down Graph.
51 void getAnalysisUsage(AnalysisUsage &AU) const {
53 AU.addRequired<TDDataStructures>();
56 void visitLoad(LoadInst &LI);
57 void visitStore(StoreInst &SI);
59 /// Debugging support methods
60 void print(std::ostream &O, const Module* = 0) const { }
63 static RegisterAnalysis<DSGraphStats> Z("dsstats", "DS Graph Statistics");
66 static bool isIndirectCallee(Value *V) {
67 if (isa<Function>(V)) return false;
69 if (CastInst *CI = dyn_cast<CastInst>(V))
70 return isIndirectCallee(CI->getOperand(0));
75 void DSGraphStats::countCallees(const Function& F) {
76 unsigned numIndirectCalls = 0, totalNumCallees = 0;
78 const std::vector<DSCallSite> &callSites = TDGraph->getFunctionCalls();
79 for (unsigned i = 0, N = callSites.size(); i != N; ++i)
80 if (isIndirectCallee(callSites[i].getCallSite().getCalledValue())) {
81 // This is an indirect function call
82 const std::vector<GlobalValue*> &Callees =
83 callSites[i].getCalleeNode()->getGlobals();
84 if (Callees.size() > 0) {
85 totalNumCallees += Callees.size();
88 std::cerr << "WARNING: No callee in Function '" << F.getName()
90 << *callSites[i].getCallSite().getInstruction();
93 TotalNumCallees += totalNumCallees;
94 NumIndirectCalls += numIndirectCalls;
97 std::cout << " In function " << F.getName() << ": "
98 << (totalNumCallees / (double) numIndirectCalls)
99 << " average callees per indirect call\n";
102 DSNode *DSGraphStats::getNodeForValue(Value *V) {
103 const DSGraph *G = TDGraph;
104 if (isa<Constant>(V))
105 G = TDGraph->getGlobalsGraph();
107 const DSGraph::ScalarMapTy &ScalarMap = G->getScalarMap();
108 DSGraph::ScalarMapTy::const_iterator I = ScalarMap.find(V);
109 if (I != ScalarMap.end())
110 return I->second.getNode();
114 bool DSGraphStats::isNodeForValueCollapsed(Value *V) {
115 if (DSNode *N = getNodeForValue(V))
116 return N->isNodeCompletelyFolded() || N->isIncomplete();
120 void DSGraphStats::visitLoad(LoadInst &LI) {
121 if (isNodeForValueCollapsed(LI.getOperand(0))) {
122 NumUntypedMemAccesses++;
124 NumTypedMemAccesses++;
128 void DSGraphStats::visitStore(StoreInst &SI) {
129 if (isNodeForValueCollapsed(SI.getOperand(1))) {
130 NumUntypedMemAccesses++;
132 NumTypedMemAccesses++;
138 bool DSGraphStats::runOnFunction(Function& F) {
139 TDGraph = &getAnalysis<TDDataStructures>().getDSGraph(F);