1 //===- LazyCallGraph.cpp - Analysis of a Module's call graph --------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Analysis/LazyCallGraph.h"
11 #include "llvm/ADT/STLExtras.h"
12 #include "llvm/IR/CallSite.h"
13 #include "llvm/IR/InstVisitor.h"
14 #include "llvm/IR/Instructions.h"
15 #include "llvm/IR/PassManager.h"
16 #include "llvm/Support/Debug.h"
17 #include "llvm/Support/raw_ostream.h"
21 #define DEBUG_TYPE "lcg"
23 static void findCallees(
24 SmallVectorImpl<Constant *> &Worklist, SmallPtrSetImpl<Constant *> &Visited,
25 SmallVectorImpl<PointerUnion<Function *, LazyCallGraph::Node *>> &Callees,
26 DenseMap<Function *, size_t> &CalleeIndexMap) {
27 while (!Worklist.empty()) {
28 Constant *C = Worklist.pop_back_val();
30 if (Function *F = dyn_cast<Function>(C)) {
31 // Note that we consider *any* function with a definition to be a viable
32 // edge. Even if the function's definition is subject to replacement by
33 // some other module (say, a weak definition) there may still be
34 // optimizations which essentially speculate based on the definition and
35 // a way to check that the specific definition is in fact the one being
36 // used. For example, this could be done by moving the weak definition to
37 // a strong (internal) definition and making the weak definition be an
38 // alias. Then a test of the address of the weak function against the new
39 // strong definition's address would be an effective way to determine the
40 // safety of optimizing a direct call edge.
41 if (!F->isDeclaration() &&
42 CalleeIndexMap.insert(std::make_pair(F, Callees.size())).second) {
43 DEBUG(dbgs() << " Added callable function: " << F->getName()
50 for (Value *Op : C->operand_values())
51 if (Visited.insert(cast<Constant>(Op)))
52 Worklist.push_back(cast<Constant>(Op));
56 LazyCallGraph::Node::Node(LazyCallGraph &G, Function &F)
57 : G(&G), F(F), DFSNumber(0), LowLink(0) {
58 DEBUG(dbgs() << " Adding functions called by '" << F.getName()
59 << "' to the graph.\n");
61 SmallVector<Constant *, 16> Worklist;
62 SmallPtrSet<Constant *, 16> Visited;
63 // Find all the potential callees in this function. First walk the
64 // instructions and add every operand which is a constant to the worklist.
65 for (BasicBlock &BB : F)
66 for (Instruction &I : BB)
67 for (Value *Op : I.operand_values())
68 if (Constant *C = dyn_cast<Constant>(Op))
69 if (Visited.insert(C))
70 Worklist.push_back(C);
72 // We've collected all the constant (and thus potentially function or
73 // function containing) operands to all of the instructions in the function.
74 // Process them (recursively) collecting every function found.
75 findCallees(Worklist, Visited, Callees, CalleeIndexMap);
78 void LazyCallGraph::Node::removeEdgeInternal(Function &Callee) {
79 auto IndexMapI = CalleeIndexMap.find(&Callee);
80 assert(IndexMapI != CalleeIndexMap.end() &&
81 "Callee not in the callee set for this caller?");
83 Callees.erase(Callees.begin() + IndexMapI->second);
84 CalleeIndexMap.erase(IndexMapI);
87 LazyCallGraph::LazyCallGraph(Module &M) : NextDFSNumber(0) {
88 DEBUG(dbgs() << "Building CG for module: " << M.getModuleIdentifier()
91 if (!F.isDeclaration() && !F.hasLocalLinkage())
92 if (EntryIndexMap.insert(std::make_pair(&F, EntryNodes.size())).second) {
93 DEBUG(dbgs() << " Adding '" << F.getName()
94 << "' to entry set of the graph.\n");
95 EntryNodes.push_back(&F);
98 // Now add entry nodes for functions reachable via initializers to globals.
99 SmallVector<Constant *, 16> Worklist;
100 SmallPtrSet<Constant *, 16> Visited;
101 for (GlobalVariable &GV : M.globals())
102 if (GV.hasInitializer())
103 if (Visited.insert(GV.getInitializer()))
104 Worklist.push_back(GV.getInitializer());
106 DEBUG(dbgs() << " Adding functions referenced by global initializers to the "
108 findCallees(Worklist, Visited, EntryNodes, EntryIndexMap);
110 for (auto &Entry : EntryNodes)
111 if (Function *F = Entry.dyn_cast<Function *>())
112 SCCEntryNodes.push_back(F);
114 SCCEntryNodes.push_back(&Entry.get<Node *>()->getFunction());
117 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)
118 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)),
119 EntryNodes(std::move(G.EntryNodes)),
120 EntryIndexMap(std::move(G.EntryIndexMap)), SCCBPA(std::move(G.SCCBPA)),
121 SCCMap(std::move(G.SCCMap)), LeafSCCs(std::move(G.LeafSCCs)),
122 DFSStack(std::move(G.DFSStack)),
123 SCCEntryNodes(std::move(G.SCCEntryNodes)),
124 NextDFSNumber(G.NextDFSNumber) {
128 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {
129 BPA = std::move(G.BPA);
130 NodeMap = std::move(G.NodeMap);
131 EntryNodes = std::move(G.EntryNodes);
132 EntryIndexMap = std::move(G.EntryIndexMap);
133 SCCBPA = std::move(G.SCCBPA);
134 SCCMap = std::move(G.SCCMap);
135 LeafSCCs = std::move(G.LeafSCCs);
136 DFSStack = std::move(G.DFSStack);
137 SCCEntryNodes = std::move(G.SCCEntryNodes);
138 NextDFSNumber = G.NextDFSNumber;
143 void LazyCallGraph::SCC::insert(Node &N) {
144 N.DFSNumber = N.LowLink = -1;
146 G->SCCMap[&N] = this;
149 void LazyCallGraph::SCC::removeInterSCCEdge(Node &CallerN, Node &CalleeN) {
150 // First remove it from the node.
151 CallerN.removeEdgeInternal(CalleeN.getFunction());
153 assert(G->SCCMap.lookup(&CallerN) == this &&
154 "The caller must be a member of this SCC.");
156 SCC &CalleeC = *G->SCCMap.lookup(&CalleeN);
157 assert(&CalleeC != this &&
158 "This API only supports the rmoval of inter-SCC edges.");
160 assert(std::find(G->LeafSCCs.begin(), G->LeafSCCs.end(), this) ==
162 "Cannot have a leaf SCC caller with a different SCC callee.");
164 bool HasOtherCallToCalleeC = false;
165 bool HasOtherCallOutsideSCC = false;
166 for (Node *N : *this) {
167 for (Node &OtherCalleeN : *N) {
168 SCC &OtherCalleeC = *G->SCCMap.lookup(&OtherCalleeN);
169 if (&OtherCalleeC == &CalleeC) {
170 HasOtherCallToCalleeC = true;
173 if (&OtherCalleeC != this)
174 HasOtherCallOutsideSCC = true;
176 if (HasOtherCallToCalleeC)
179 // Because the SCCs form a DAG, deleting such an edge cannot change the set
180 // of SCCs in the graph. However, it may cut an edge of the SCC DAG, making
181 // the caller no longer a parent of the callee. Walk the other call edges
182 // in the caller to tell.
183 if (!HasOtherCallToCalleeC) {
184 bool Removed = CalleeC.ParentSCCs.erase(this);
187 "Did not find the caller SCC in the callee SCC's parent list!");
189 // It may orphan an SCC if it is the last edge reaching it, but that does
190 // not violate any invariants of the graph.
191 if (CalleeC.ParentSCCs.empty())
192 DEBUG(dbgs() << "LCG: Update removing " << CallerN.getFunction().getName()
193 << " -> " << CalleeN.getFunction().getName()
194 << " edge orphaned the callee's SCC!\n");
197 // It may make the Caller SCC a leaf SCC.
198 if (!HasOtherCallOutsideSCC)
199 G->LeafSCCs.push_back(this);
202 void LazyCallGraph::SCC::internalDFS(
203 SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack,
204 SmallVectorImpl<Node *> &PendingSCCStack, Node *N,
205 SmallVectorImpl<SCC *> &ResultSCCs) {
206 Node::iterator I = N->begin();
207 N->LowLink = N->DFSNumber = 1;
208 int NextDFSNumber = 2;
210 assert(N->DFSNumber != 0 && "We should always assign a DFS number "
211 "before processing a node.");
213 // We simulate recursion by popping out of the nested loop and continuing.
214 Node::iterator E = N->end();
217 if (SCC *ChildSCC = G->SCCMap.lookup(&ChildN)) {
218 // Check if we have reached a node in the new (known connected) set of
219 // this SCC. If so, the entire stack is necessarily in that set and we
221 if (ChildSCC == this) {
223 while (!PendingSCCStack.empty())
224 insert(*PendingSCCStack.pop_back_val());
225 while (!DFSStack.empty())
226 insert(*DFSStack.pop_back_val().first);
230 // If this child isn't currently in this SCC, no need to process it.
231 // However, we do need to remove this SCC from its SCC's parent set.
232 ChildSCC->ParentSCCs.erase(this);
237 if (ChildN.DFSNumber == 0) {
238 // Mark that we should start at this child when next this node is the
239 // top of the stack. We don't start at the next child to ensure this
240 // child's lowlink is reflected.
241 DFSStack.push_back(std::make_pair(N, I));
243 // Continue, resetting to the child node.
244 ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;
251 // Track the lowest link of the childen, if any are still in the stack.
252 // Any child not on the stack will have a LowLink of -1.
253 assert(ChildN.LowLink != 0 &&
254 "Low-link must not be zero with a non-zero DFS number.");
255 if (ChildN.LowLink >= 0 && ChildN.LowLink < N->LowLink)
256 N->LowLink = ChildN.LowLink;
260 if (N->LowLink == N->DFSNumber) {
261 ResultSCCs.push_back(G->formSCC(N, PendingSCCStack));
262 if (DFSStack.empty())
265 // At this point we know that N cannot ever be an SCC root. Its low-link
266 // is not its dfs-number, and we've processed all of its children. It is
267 // just sitting here waiting until some node further down the stack gets
268 // low-link == dfs-number and pops it off as well. Move it to the pending
269 // stack which is pulled into the next SCC to be formed.
270 PendingSCCStack.push_back(N);
272 assert(!DFSStack.empty() && "We shouldn't have an empty stack!");
275 N = DFSStack.back().first;
276 I = DFSStack.back().second;
281 SmallVector<LazyCallGraph::SCC *, 1>
282 LazyCallGraph::SCC::removeIntraSCCEdge(Node &CallerN,
284 // First remove it from the node.
285 CallerN.removeEdgeInternal(CalleeN.getFunction());
287 // We return a list of the resulting SCCs, where 'this' is always the first
289 SmallVector<SCC *, 1> ResultSCCs;
290 ResultSCCs.push_back(this);
292 // Direct recursion doesn't impact the SCC graph at all.
293 if (&CallerN == &CalleeN)
296 // The worklist is every node in the original SCC.
297 SmallVector<Node *, 1> Worklist;
298 Worklist.swap(Nodes);
299 for (Node *N : Worklist) {
300 // The nodes formerly in this SCC are no longer in any SCC.
305 assert(Worklist.size() > 1 && "We have to have at least two nodes to have an "
306 "edge between them that is within the SCC.");
308 // The callee can already reach every node in this SCC (by definition). It is
309 // the only node we know will stay inside this SCC. Everything which
310 // transitively reaches Callee will also remain in the SCC. To model this we
311 // incrementally add any chain of nodes which reaches something in the new
312 // node set to the new node set. This short circuits one side of the Tarjan's
316 // We're going to do a full mini-Tarjan's walk using a local stack here.
317 SmallVector<std::pair<Node *, Node::iterator>, 4> DFSStack;
318 SmallVector<Node *, 4> PendingSCCStack;
320 Node *N = Worklist.pop_back_val();
321 if (N->DFSNumber == 0)
322 internalDFS(DFSStack, PendingSCCStack, N, ResultSCCs);
324 assert(DFSStack.empty() && "Didn't flush the entire DFS stack!");
325 assert(PendingSCCStack.empty() && "Didn't flush all pending SCC nodes!");
326 } while (!Worklist.empty());
328 // Now we need to reconnect the current SCC to the graph.
329 bool IsLeafSCC = true;
330 for (Node *N : Nodes) {
331 for (Node &ChildN : *N) {
332 SCC &ChildSCC = *G->SCCMap.lookup(&ChildN);
333 if (&ChildSCC == this)
335 ChildSCC.ParentSCCs.insert(this);
340 if (ResultSCCs.size() > 1)
341 assert(!IsLeafSCC && "This SCC cannot be a leaf as we have split out new "
342 "SCCs by removing this edge.");
343 if (!std::any_of(G->LeafSCCs.begin(), G->LeafSCCs.end(),
344 [&](SCC *C) { return C == this; }))
345 assert(!IsLeafSCC && "This SCC cannot be a leaf as it already had child "
346 "SCCs before we removed this edge.");
348 // If this SCC stopped being a leaf through this edge removal, remove it from
349 // the leaf SCC list.
350 if (!IsLeafSCC && ResultSCCs.size() > 1)
351 G->LeafSCCs.erase(std::remove(G->LeafSCCs.begin(), G->LeafSCCs.end(), this),
354 // Return the new list of SCCs.
358 void LazyCallGraph::removeEdge(Node &CallerN, Function &Callee) {
359 assert(SCCMap.empty() && DFSStack.empty() &&
360 "This method cannot be called after SCCs have been formed!");
362 return CallerN.removeEdgeInternal(Callee);
365 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {
366 return *new (MappedN = BPA.Allocate()) Node(*this, F);
369 void LazyCallGraph::updateGraphPtrs() {
370 // Process all nodes updating the graph pointers.
372 SmallVector<Node *, 16> Worklist;
373 for (auto &Entry : EntryNodes)
374 if (Node *EntryN = Entry.dyn_cast<Node *>())
375 Worklist.push_back(EntryN);
377 while (!Worklist.empty()) {
378 Node *N = Worklist.pop_back_val();
380 for (auto &Callee : N->Callees)
381 if (Node *CalleeN = Callee.dyn_cast<Node *>())
382 Worklist.push_back(CalleeN);
386 // Process all SCCs updating the graph pointers.
388 SmallVector<SCC *, 16> Worklist(LeafSCCs.begin(), LeafSCCs.end());
390 while (!Worklist.empty()) {
391 SCC *C = Worklist.pop_back_val();
393 Worklist.insert(Worklist.end(), C->ParentSCCs.begin(),
394 C->ParentSCCs.end());
399 LazyCallGraph::SCC *LazyCallGraph::formSCC(Node *RootN,
400 SmallVectorImpl<Node *> &NodeStack) {
401 // The tail of the stack is the new SCC. Allocate the SCC and pop the stack
403 SCC *NewSCC = new (SCCBPA.Allocate()) SCC(*this);
405 while (!NodeStack.empty() && NodeStack.back()->DFSNumber > RootN->DFSNumber) {
406 assert(NodeStack.back()->LowLink >= RootN->LowLink &&
407 "We cannot have a low link in an SCC lower than its root on the "
409 NewSCC->insert(*NodeStack.pop_back_val());
411 NewSCC->insert(*RootN);
413 // A final pass over all edges in the SCC (this remains linear as we only
414 // do this once when we build the SCC) to connect it to the parent sets of
416 bool IsLeafSCC = true;
417 for (Node *SCCN : NewSCC->Nodes)
418 for (Node &SCCChildN : *SCCN) {
419 if (SCCMap.lookup(&SCCChildN) == NewSCC)
421 SCC &ChildSCC = *SCCMap.lookup(&SCCChildN);
422 ChildSCC.ParentSCCs.insert(NewSCC);
426 // For the SCCs where we fine no child SCCs, add them to the leaf list.
428 LeafSCCs.push_back(NewSCC);
433 LazyCallGraph::SCC *LazyCallGraph::getNextSCCInPostOrder() {
436 if (!DFSStack.empty()) {
437 N = DFSStack.back().first;
438 I = DFSStack.back().second;
441 // If we've handled all candidate entry nodes to the SCC forest, we're done.
443 if (SCCEntryNodes.empty())
446 N = &get(*SCCEntryNodes.pop_back_val());
447 } while (N->DFSNumber != 0);
449 N->LowLink = N->DFSNumber = 1;
454 assert(N->DFSNumber != 0 && "We should always assign a DFS number "
455 "before placing a node onto the stack.");
457 Node::iterator E = N->end();
460 if (ChildN.DFSNumber == 0) {
461 // Mark that we should start at this child when next this node is the
462 // top of the stack. We don't start at the next child to ensure this
463 // child's lowlink is reflected.
464 DFSStack.push_back(std::make_pair(N, N->begin()));
466 // Recurse onto this node via a tail call.
467 assert(!SCCMap.count(&ChildN) &&
468 "Found a node with 0 DFS number but already in an SCC!");
469 ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;
476 // Track the lowest link of the childen, if any are still in the stack.
477 assert(ChildN.LowLink != 0 &&
478 "Low-link must not be zero with a non-zero DFS number.");
479 if (ChildN.LowLink >= 0 && ChildN.LowLink < N->LowLink)
480 N->LowLink = ChildN.LowLink;
484 if (N->LowLink == N->DFSNumber)
485 // Form the new SCC out of the top of the DFS stack.
486 return formSCC(N, PendingSCCStack);
488 // At this point we know that N cannot ever be an SCC root. Its low-link
489 // is not its dfs-number, and we've processed all of its children. It is
490 // just sitting here waiting until some node further down the stack gets
491 // low-link == dfs-number and pops it off as well. Move it to the pending
492 // stack which is pulled into the next SCC to be formed.
493 PendingSCCStack.push_back(N);
495 assert(!DFSStack.empty() && "We never found a viable root!");
496 N = DFSStack.back().first;
497 I = DFSStack.back().second;
502 char LazyCallGraphAnalysis::PassID;
504 LazyCallGraphPrinterPass::LazyCallGraphPrinterPass(raw_ostream &OS) : OS(OS) {}
506 static void printNodes(raw_ostream &OS, LazyCallGraph::Node &N,
507 SmallPtrSetImpl<LazyCallGraph::Node *> &Printed) {
508 // Recurse depth first through the nodes.
509 for (LazyCallGraph::Node &ChildN : N)
510 if (Printed.insert(&ChildN))
511 printNodes(OS, ChildN, Printed);
513 OS << " Call edges in function: " << N.getFunction().getName() << "\n";
514 for (LazyCallGraph::iterator I = N.begin(), E = N.end(); I != E; ++I)
515 OS << " -> " << I->getFunction().getName() << "\n";
520 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &SCC) {
521 ptrdiff_t SCCSize = std::distance(SCC.begin(), SCC.end());
522 OS << " SCC with " << SCCSize << " functions:\n";
524 for (LazyCallGraph::Node *N : SCC)
525 OS << " " << N->getFunction().getName() << "\n";
530 PreservedAnalyses LazyCallGraphPrinterPass::run(Module *M,
531 ModuleAnalysisManager *AM) {
532 LazyCallGraph &G = AM->getResult<LazyCallGraphAnalysis>(M);
534 OS << "Printing the call graph for module: " << M->getModuleIdentifier()
537 SmallPtrSet<LazyCallGraph::Node *, 16> Printed;
538 for (LazyCallGraph::Node &N : G)
539 if (Printed.insert(&N))
540 printNodes(OS, N, Printed);
542 for (LazyCallGraph::SCC &SCC : G.postorder_sccs())
545 return PreservedAnalyses::all();