1 //===- BottomUpClosure.cpp - Compute bottom-up interprocedural closure ----===//
3 // This file implements the BUDataStructures class, which represents the
4 // Bottom-Up Interprocedural closure of the data structure graph over the
5 // program. This is useful for applications like pool allocation, but **not**
6 // applications like alias analysis.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Analysis/DataStructure.h"
11 #include "llvm/Module.h"
12 #include "Support/Statistic.h"
13 #include "DSCallSiteIterator.h"
16 Statistic<> MaxSCC("budatastructure", "Maximum SCC Size in Call Graph");
18 RegisterAnalysis<BUDataStructures>
19 X("budatastructure", "Bottom-up Data Structure Analysis");
24 // run - Calculate the bottom up data structure graphs for each function in the
27 bool BUDataStructures::run(Module &M) {
28 LocalDataStructures &LocalDSA = getAnalysis<LocalDataStructures>();
29 GlobalsGraph = new DSGraph(LocalDSA.getGlobalsGraph());
30 GlobalsGraph->setPrintAuxCalls();
32 Function *MainFunc = M.getMainFunction();
34 calculateReachableGraphs(MainFunc);
36 // Calculate the graphs for any functions that are unreachable from main...
37 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
38 if (!I->isExternal() && !DSInfo.count(I)) {
41 std::cerr << "*** Function unreachable from main: "
42 << I->getName() << "\n";
44 calculateReachableGraphs(I); // Calculate all graphs...
49 void BUDataStructures::calculateReachableGraphs(Function *F) {
50 std::vector<Function*> Stack;
51 hash_map<Function*, unsigned> ValMap;
53 calculateGraphs(F, Stack, NextID, ValMap);
56 DSGraph &BUDataStructures::getOrCreateGraph(Function *F) {
57 // Has the graph already been created?
58 DSGraph *&Graph = DSInfo[F];
59 if (Graph) return *Graph;
61 // Copy the local version into DSInfo...
62 Graph = new DSGraph(getAnalysis<LocalDataStructures>().getDSGraph(*F));
64 Graph->setGlobalsGraph(GlobalsGraph);
65 Graph->setPrintAuxCalls();
67 // Start with a copy of the original call sites...
68 Graph->getAuxFunctionCalls() = Graph->getFunctionCalls();
72 unsigned BUDataStructures::calculateGraphs(Function *F,
73 std::vector<Function*> &Stack,
75 hash_map<Function*, unsigned> &ValMap) {
76 assert(ValMap.find(F) == ValMap.end() && "Shouldn't revisit functions!");
77 unsigned Min = NextID++, MyID = Min;
81 if (F->isExternal()) { // sprintf, fprintf, sscanf, etc...
88 DSGraph &Graph = getOrCreateGraph(F);
90 // The edges out of the current node are the call site targets...
91 for (DSCallSiteIterator I = DSCallSiteIterator::begin_aux(Graph),
92 E = DSCallSiteIterator::end_aux(Graph); I != E; ++I) {
93 Function *Callee = *I;
95 // Have we visited the destination function yet?
96 hash_map<Function*, unsigned>::iterator It = ValMap.find(Callee);
97 if (It == ValMap.end()) // No, visit it now.
98 M = calculateGraphs(Callee, Stack, NextID, ValMap);
99 else // Yes, get it's number.
101 if (M < Min) Min = M;
104 assert(ValMap[F] == MyID && "SCC construction assumption wrong!");
106 return Min; // This is part of a larger SCC!
108 // If this is a new SCC, process it now.
109 if (Stack.back() == F) { // Special case the single "SCC" case here.
110 DEBUG(std::cerr << "Visiting single node SCC #: " << MyID << " fn: "
111 << F->getName() << "\n");
113 DSGraph &G = getDSGraph(*F);
114 DEBUG(std::cerr << " [BU] Calculating graph for: " << F->getName()<< "\n");
116 DEBUG(std::cerr << " [BU] Done inlining: " << F->getName() << " ["
117 << G.getGraphSize() << "+" << G.getAuxFunctionCalls().size()
120 if (MaxSCC < 1) MaxSCC = 1;
122 // Should we revisit the graph?
123 if (DSCallSiteIterator::begin_aux(G) != DSCallSiteIterator::end_aux(G)) {
125 return calculateGraphs(F, Stack, NextID, ValMap);
132 // SCCFunctions - Keep track of the functions in the current SCC
134 hash_set<Function*> SCCFunctions;
137 std::vector<Function*>::iterator FirstInSCC = Stack.end();
138 DSGraph *SCCGraph = 0;
142 SCCFunctions.insert(NF);
144 // Figure out which graph is the largest one, in order to speed things up
145 // a bit in situations where functions in the SCC have widely different
147 DSGraph &NFGraph = getDSGraph(*NF);
148 if (!SCCGraph || SCCGraph->getGraphSize() < NFGraph.getGraphSize())
152 std::cerr << "Calculating graph for SCC #: " << MyID << " of size: "
153 << SCCFunctions.size() << "\n";
155 // Compute the Max SCC Size...
156 if (MaxSCC < SCCFunctions.size())
157 MaxSCC = SCCFunctions.size();
159 // First thing first, collapse all of the DSGraphs into a single graph for
160 // the entire SCC. We computed the largest graph, so clone all of the other
161 // (smaller) graphs into it. Discard all of the old graphs.
163 for (hash_set<Function*>::iterator I = SCCFunctions.begin(),
164 E = SCCFunctions.end(); I != E; ++I) {
165 DSGraph &G = getDSGraph(**I);
166 if (&G != SCCGraph) {
167 DSGraph::NodeMapTy NodeMap;
168 SCCGraph->cloneInto(G, SCCGraph->getScalarMap(),
169 SCCGraph->getReturnNodes(), NodeMap, 0);
170 // Update the DSInfo map and delete the old graph...
171 DSInfo[*I] = SCCGraph;
176 // Clean up the graph before we start inlining a bunch again...
177 SCCGraph->removeTriviallyDeadNodes();
179 // Now that we have one big happy family, resolve all of the call sites in
181 calculateGraph(*SCCGraph);
182 DEBUG(std::cerr << " [BU] Done inlining SCC [" << SCCGraph->getGraphSize()
183 << "+" << SCCGraph->getAuxFunctionCalls().size() << "]\n");
185 std::cerr << "DONE with SCC #: " << MyID << "\n";
187 // We never have to revisit "SCC" processed functions...
189 // Drop the stuff we don't need from the end of the stack
190 Stack.erase(FirstInSCC, Stack.end());
194 return MyID; // == Min
198 // releaseMemory - If the pass pipeline is done with this pass, we can release
199 // our memory... here...
201 void BUDataStructures::releaseMemory() {
202 for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
203 E = DSInfo.end(); I != E; ++I) {
204 I->second->getReturnNodes().erase(I->first);
205 if (I->second->getReturnNodes().empty())
209 // Empty map so next time memory is released, data structures are not
216 void BUDataStructures::calculateGraph(DSGraph &Graph) {
217 // Move our call site list into TempFCs so that inline call sites go into the
218 // new call site list and doesn't invalidate our iterators!
219 std::vector<DSCallSite> TempFCs;
220 std::vector<DSCallSite> &AuxCallsList = Graph.getAuxFunctionCalls();
221 TempFCs.swap(AuxCallsList);
223 DSGraph::ReturnNodesTy &ReturnNodes = Graph.getReturnNodes();
225 // Loop over all of the resolvable call sites
226 unsigned LastCallSiteIdx = ~0U;
227 for (DSCallSiteIterator I = DSCallSiteIterator::begin(TempFCs),
228 E = DSCallSiteIterator::end(TempFCs); I != E; ++I) {
229 // If we skipped over any call sites, they must be unresolvable, copy them
230 // to the real call site list.
232 for (; LastCallSiteIdx < I.getCallSiteIdx(); ++LastCallSiteIdx)
233 AuxCallsList.push_back(TempFCs[LastCallSiteIdx]);
234 LastCallSiteIdx = I.getCallSiteIdx();
236 // Resolve the current call...
237 Function *Callee = *I;
238 DSCallSite CS = I.getCallSite();
240 if (Callee->isExternal()) {
241 // Ignore this case, simple varargs functions we cannot stub out!
242 } else if (ReturnNodes.find(Callee) != ReturnNodes.end()) {
243 // Self recursion... simply link up the formal arguments with the
244 // actual arguments...
245 DEBUG(std::cerr << " Self Inlining: " << Callee->getName() << "\n");
247 // Handle self recursion by resolving the arguments and return value
248 Graph.mergeInGraph(CS, *Callee, Graph, 0);
251 ActualCallees.insert(std::make_pair(&CS.getCallInst(), Callee));
253 // Get the data structure graph for the called function.
255 DSGraph &GI = getDSGraph(*Callee); // Graph to inline
257 DEBUG(std::cerr << " Inlining graph for " << Callee->getName()
258 << "[" << GI.getGraphSize() << "+"
259 << GI.getAuxFunctionCalls().size() << "] into '"
260 << Graph.getFunctionNames() << "' [" << Graph.getGraphSize() << "+"
261 << Graph.getAuxFunctionCalls().size() << "]\n");
263 // Handle self recursion by resolving the arguments and return value
264 Graph.mergeInGraph(CS, *Callee, GI,
265 DSGraph::KeepModRefBits |
266 DSGraph::StripAllocaBit | DSGraph::DontCloneCallNodes);
269 Graph.writeGraphToFile(std::cerr, "bu_" + F.getName() + "_after_" +
275 // Make sure to catch any leftover unresolvable calls...
276 for (++LastCallSiteIdx; LastCallSiteIdx < TempFCs.size(); ++LastCallSiteIdx)
277 AuxCallsList.push_back(TempFCs[LastCallSiteIdx]);
281 // Recompute the Incomplete markers. If there are any function calls left
282 // now that are complete, we must loop!
283 Graph.maskIncompleteMarkers();
284 Graph.markIncompleteNodes(DSGraph::MarkFormalArgs);
285 // FIXME: materialize nodes from the globals graph as neccesary...
286 Graph.removeDeadNodes(DSGraph::KeepUnreachableGlobals);
288 //Graph.writeGraphToFile(std::cerr, "bu_" + F.getName());