1 //===- CallGraphSCCPass.cpp - Pass that operates BU on 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 // This file implements the CallGraphSCCPass class, which is used for passes
11 // which are implemented as bottom-up traversals on the call graph. Because
12 // there may be cycles in the call graph, passes of this type operate on the
13 // call-graph in SCC order: that is, they process function bottom-up, except for
14 // recursive functions, which they process all at once.
16 //===----------------------------------------------------------------------===//
18 #define DEBUG_TYPE "cgscc-passmgr"
19 #include "llvm/CallGraphSCCPass.h"
20 #include "llvm/IntrinsicInst.h"
21 #include "llvm/Function.h"
22 #include "llvm/PassManagers.h"
23 #include "llvm/Analysis/CallGraph.h"
24 #include "llvm/ADT/SCCIterator.h"
25 #include "llvm/ADT/Statistic.h"
26 #include "llvm/Support/CommandLine.h"
27 #include "llvm/Support/Debug.h"
28 #include "llvm/Support/Timer.h"
29 #include "llvm/Support/raw_ostream.h"
32 static cl::opt<unsigned>
33 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
35 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
37 //===----------------------------------------------------------------------===//
40 /// CGPassManager manages FPPassManagers and CallGraphSCCPasses.
44 class CGPassManager : public ModulePass, public PMDataManager {
47 explicit CGPassManager()
48 : ModulePass(ID), PMDataManager() { }
50 /// run - Execute all of the passes scheduled for execution. Keep track of
51 /// whether any of the passes modifies the module, and if so, return true.
52 bool runOnModule(Module &M);
54 bool doInitialization(CallGraph &CG);
55 bool doFinalization(CallGraph &CG);
57 /// Pass Manager itself does not invalidate any analysis info.
58 void getAnalysisUsage(AnalysisUsage &Info) const {
59 // CGPassManager walks SCC and it needs CallGraph.
60 Info.addRequired<CallGraph>();
61 Info.setPreservesAll();
64 virtual const char *getPassName() const {
65 return "CallGraph Pass Manager";
68 virtual PMDataManager *getAsPMDataManager() { return this; }
69 virtual Pass *getAsPass() { return this; }
71 // Print passes managed by this manager
72 void dumpPassStructure(unsigned Offset) {
73 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
74 for (unsigned Index = 0; Index < getNumContainedPasses(); ++Index) {
75 Pass *P = getContainedPass(Index);
76 P->dumpPassStructure(Offset + 1);
77 dumpLastUses(P, Offset+1);
81 Pass *getContainedPass(unsigned N) {
82 assert(N < PassVector.size() && "Pass number out of range!");
83 return static_cast<Pass *>(PassVector[N]);
86 virtual PassManagerType getPassManagerType() const {
87 return PMT_CallGraphPassManager;
91 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
92 bool &DevirtualizedCall);
94 bool RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC,
95 CallGraph &CG, bool &CallGraphUpToDate,
96 bool &DevirtualizedCall);
97 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
101 } // end anonymous namespace.
103 char CGPassManager::ID = 0;
106 bool CGPassManager::RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC,
107 CallGraph &CG, bool &CallGraphUpToDate,
108 bool &DevirtualizedCall) {
109 bool Changed = false;
110 PMDataManager *PM = P->getAsPMDataManager();
113 CallGraphSCCPass *CGSP = (CallGraphSCCPass*)P;
114 if (!CallGraphUpToDate) {
115 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
116 CallGraphUpToDate = true;
120 TimeRegion PassTimer(getPassTimer(CGSP));
121 Changed = CGSP->runOnSCC(CurSCC);
124 // After the CGSCCPass is done, when assertions are enabled, use
125 // RefreshCallGraph to verify that the callgraph was correctly updated.
128 RefreshCallGraph(CurSCC, CG, true);
135 assert(PM->getPassManagerType() == PMT_FunctionPassManager &&
136 "Invalid CGPassManager member");
137 FPPassManager *FPP = (FPPassManager*)P;
139 // Run pass P on all functions in the current SCC.
140 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
142 if (Function *F = (*I)->getFunction()) {
143 dumpPassInfo(P, EXECUTION_MSG, ON_FUNCTION_MSG, F->getName());
144 TimeRegion PassTimer(getPassTimer(FPP));
145 Changed |= FPP->runOnFunction(*F);
149 // The function pass(es) modified the IR, they may have clobbered the
151 if (Changed && CallGraphUpToDate) {
152 DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: "
153 << P->getPassName() << '\n');
154 CallGraphUpToDate = false;
160 /// RefreshCallGraph - Scan the functions in the specified CFG and resync the
161 /// callgraph with the call sites found in it. This is used after
162 /// FunctionPasses have potentially munged the callgraph, and can be used after
163 /// CallGraphSCC passes to verify that they correctly updated the callgraph.
165 /// This function returns true if it devirtualized an existing function call,
166 /// meaning it turned an indirect call into a direct call. This happens when
167 /// a function pass like GVN optimizes away stuff feeding the indirect call.
168 /// This never happens in checking mode.
170 bool CGPassManager::RefreshCallGraph(CallGraphSCC &CurSCC,
171 CallGraph &CG, bool CheckingMode) {
172 DenseMap<Value*, CallGraphNode*> CallSites;
174 DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
176 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
181 bool MadeChange = false;
182 bool DevirtualizedCall = false;
184 // Scan all functions in the SCC.
185 unsigned FunctionNo = 0;
186 for (CallGraphSCC::iterator SCCIdx = CurSCC.begin(), E = CurSCC.end();
187 SCCIdx != E; ++SCCIdx, ++FunctionNo) {
188 CallGraphNode *CGN = *SCCIdx;
189 Function *F = CGN->getFunction();
190 if (F == 0 || F->isDeclaration()) continue;
192 // Walk the function body looking for call sites. Sync up the call sites in
193 // CGN with those actually in the function.
195 // Keep track of the number of direct and indirect calls that were
196 // invalidated and removed.
197 unsigned NumDirectRemoved = 0, NumIndirectRemoved = 0;
199 // Get the set of call sites currently in the function.
200 for (CallGraphNode::iterator I = CGN->begin(), E = CGN->end(); I != E; ) {
201 // If this call site is null, then the function pass deleted the call
202 // entirely and the WeakVH nulled it out.
204 // If we've already seen this call site, then the FunctionPass RAUW'd
205 // one call with another, which resulted in two "uses" in the edge
206 // list of the same call.
207 CallSites.count(I->first) ||
209 // If the call edge is not from a call or invoke, then the function
210 // pass RAUW'd a call with another value. This can happen when
211 // constant folding happens of well known functions etc.
212 !CallSite(I->first)) {
213 assert(!CheckingMode &&
214 "CallGraphSCCPass did not update the CallGraph correctly!");
216 // If this was an indirect call site, count it.
217 if (I->second->getFunction() == 0)
218 ++NumIndirectRemoved;
222 // Just remove the edge from the set of callees, keep track of whether
223 // I points to the last element of the vector.
224 bool WasLast = I + 1 == E;
225 CGN->removeCallEdge(I);
227 // If I pointed to the last element of the vector, we have to bail out:
228 // iterator checking rejects comparisons of the resultant pointer with
236 assert(!CallSites.count(I->first) &&
237 "Call site occurs in node multiple times");
238 CallSites.insert(std::make_pair(I->first, I->second));
242 // Loop over all of the instructions in the function, getting the callsites.
243 // Keep track of the number of direct/indirect calls added.
244 unsigned NumDirectAdded = 0, NumIndirectAdded = 0;
246 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
247 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
248 CallSite CS(cast<Value>(I));
249 if (!CS || isa<IntrinsicInst>(I)) continue;
251 // If this call site already existed in the callgraph, just verify it
252 // matches up to expectations and remove it from CallSites.
253 DenseMap<Value*, CallGraphNode*>::iterator ExistingIt =
254 CallSites.find(CS.getInstruction());
255 if (ExistingIt != CallSites.end()) {
256 CallGraphNode *ExistingNode = ExistingIt->second;
258 // Remove from CallSites since we have now seen it.
259 CallSites.erase(ExistingIt);
261 // Verify that the callee is right.
262 if (ExistingNode->getFunction() == CS.getCalledFunction())
265 // If we are in checking mode, we are not allowed to actually mutate
266 // the callgraph. If this is a case where we can infer that the
267 // callgraph is less precise than it could be (e.g. an indirect call
268 // site could be turned direct), don't reject it in checking mode, and
269 // don't tweak it to be more precise.
270 if (CheckingMode && CS.getCalledFunction() &&
271 ExistingNode->getFunction() == 0)
274 assert(!CheckingMode &&
275 "CallGraphSCCPass did not update the CallGraph correctly!");
277 // If not, we either went from a direct call to indirect, indirect to
278 // direct, or direct to different direct.
279 CallGraphNode *CalleeNode;
280 if (Function *Callee = CS.getCalledFunction()) {
281 CalleeNode = CG.getOrInsertFunction(Callee);
282 // Keep track of whether we turned an indirect call into a direct
284 if (ExistingNode->getFunction() == 0) {
285 DevirtualizedCall = true;
286 DEBUG(dbgs() << " CGSCCPASSMGR: Devirtualized call to '"
287 << Callee->getName() << "'\n");
290 CalleeNode = CG.getCallsExternalNode();
293 // Update the edge target in CGN.
294 CGN->replaceCallEdge(CS, CS, CalleeNode);
299 assert(!CheckingMode &&
300 "CallGraphSCCPass did not update the CallGraph correctly!");
302 // If the call site didn't exist in the CGN yet, add it.
303 CallGraphNode *CalleeNode;
304 if (Function *Callee = CS.getCalledFunction()) {
305 CalleeNode = CG.getOrInsertFunction(Callee);
308 CalleeNode = CG.getCallsExternalNode();
312 CGN->addCalledFunction(CS, CalleeNode);
316 // We scanned the old callgraph node, removing invalidated call sites and
317 // then added back newly found call sites. One thing that can happen is
318 // that an old indirect call site was deleted and replaced with a new direct
319 // call. In this case, we have devirtualized a call, and CGSCCPM would like
320 // to iteratively optimize the new code. Unfortunately, we don't really
321 // have a great way to detect when this happens. As an approximation, we
322 // just look at whether the number of indirect calls is reduced and the
323 // number of direct calls is increased. There are tons of ways to fool this
324 // (e.g. DCE'ing an indirect call and duplicating an unrelated block with a
325 // direct call) but this is close enough.
326 if (NumIndirectRemoved > NumIndirectAdded &&
327 NumDirectRemoved < NumDirectAdded)
328 DevirtualizedCall = true;
330 // After scanning this function, if we still have entries in callsites, then
331 // they are dangling pointers. WeakVH should save us for this, so abort if
333 assert(CallSites.empty() && "Dangling pointers found in call sites map");
335 // Periodically do an explicit clear to remove tombstones when processing
337 if ((FunctionNo & 15) == 15)
341 DEBUG(if (MadeChange) {
342 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
343 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
346 if (DevirtualizedCall)
347 dbgs() << "CGSCCPASSMGR: Refresh devirtualized a call!\n";
350 dbgs() << "CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
355 return DevirtualizedCall;
358 /// RunAllPassesOnSCC - Execute the body of the entire pass manager on the
359 /// specified SCC. This keeps track of whether a function pass devirtualizes
360 /// any calls and returns it in DevirtualizedCall.
361 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
362 bool &DevirtualizedCall) {
363 bool Changed = false;
365 // CallGraphUpToDate - Keep track of whether the callgraph is known to be
366 // up-to-date or not. The CGSSC pass manager runs two types of passes:
367 // CallGraphSCC Passes and other random function passes. Because other
368 // random function passes are not CallGraph aware, they may clobber the
369 // call graph by introducing new calls or deleting other ones. This flag
370 // is set to false when we run a function pass so that we know to clean up
371 // the callgraph when we need to run a CGSCCPass again.
372 bool CallGraphUpToDate = true;
374 // Run all passes on current SCC.
375 for (unsigned PassNo = 0, e = getNumContainedPasses();
376 PassNo != e; ++PassNo) {
377 Pass *P = getContainedPass(PassNo);
379 // If we're in -debug-pass=Executions mode, construct the SCC node list,
380 // otherwise avoid constructing this string as it is expensive.
381 if (isPassDebuggingExecutionsOrMore()) {
382 std::string Functions;
384 raw_string_ostream OS(Functions);
385 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
387 if (I != CurSCC.begin()) OS << ", ";
392 dumpPassInfo(P, EXECUTION_MSG, ON_CG_MSG, Functions);
396 initializeAnalysisImpl(P);
398 // Actually run this pass on the current SCC.
399 Changed |= RunPassOnSCC(P, CurSCC, CG,
400 CallGraphUpToDate, DevirtualizedCall);
403 dumpPassInfo(P, MODIFICATION_MSG, ON_CG_MSG, "");
406 verifyPreservedAnalysis(P);
407 removeNotPreservedAnalysis(P);
408 recordAvailableAnalysis(P);
409 removeDeadPasses(P, "", ON_CG_MSG);
412 // If the callgraph was left out of date (because the last pass run was a
413 // functionpass), refresh it before we move on to the next SCC.
414 if (!CallGraphUpToDate)
415 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
419 /// run - Execute all of the passes scheduled for execution. Keep track of
420 /// whether any of the passes modifies the module, and if so, return true.
421 bool CGPassManager::runOnModule(Module &M) {
422 CallGraph &CG = getAnalysis<CallGraph>();
423 bool Changed = doInitialization(CG);
425 // Walk the callgraph in bottom-up SCC order.
426 scc_iterator<CallGraph*> CGI = scc_begin(&CG);
428 CallGraphSCC CurSCC(&CGI);
429 while (!CGI.isAtEnd()) {
430 // Copy the current SCC and increment past it so that the pass can hack
431 // on the SCC if it wants to without invalidating our iterator.
432 std::vector<CallGraphNode*> &NodeVec = *CGI;
433 CurSCC.initialize(&NodeVec[0], &NodeVec[0]+NodeVec.size());
436 // At the top level, we run all the passes in this pass manager on the
437 // functions in this SCC. However, we support iterative compilation in the
438 // case where a function pass devirtualizes a call to a function. For
439 // example, it is very common for a function pass (often GVN or instcombine)
440 // to eliminate the addressing that feeds into a call. With that improved
441 // information, we would like the call to be an inline candidate, infer
442 // mod-ref information etc.
444 // Because of this, we allow iteration up to a specified iteration count.
445 // This only happens in the case of a devirtualized call, so we only burn
446 // compile time in the case that we're making progress. We also have a hard
447 // iteration count limit in case there is crazy code.
448 unsigned Iteration = 0;
449 bool DevirtualizedCall = false;
452 dbgs() << " SCCPASSMGR: Re-visiting SCC, iteration #"
453 << Iteration << '\n');
454 DevirtualizedCall = false;
455 Changed |= RunAllPassesOnSCC(CurSCC, CG, DevirtualizedCall);
456 } while (Iteration++ < MaxIterations && DevirtualizedCall);
458 if (DevirtualizedCall)
459 DEBUG(dbgs() << " CGSCCPASSMGR: Stopped iteration after " << Iteration
460 << " times, due to -max-cg-scc-iterations\n");
462 if (Iteration > MaxSCCIterations)
463 MaxSCCIterations = Iteration;
466 Changed |= doFinalization(CG);
472 bool CGPassManager::doInitialization(CallGraph &CG) {
473 bool Changed = false;
474 for (unsigned i = 0, e = getNumContainedPasses(); i != e; ++i) {
475 if (PMDataManager *PM = getContainedPass(i)->getAsPMDataManager()) {
476 assert(PM->getPassManagerType() == PMT_FunctionPassManager &&
477 "Invalid CGPassManager member");
478 Changed |= ((FPPassManager*)PM)->doInitialization(CG.getModule());
480 Changed |= ((CallGraphSCCPass*)getContainedPass(i))->doInitialization(CG);
487 bool CGPassManager::doFinalization(CallGraph &CG) {
488 bool Changed = false;
489 for (unsigned i = 0, e = getNumContainedPasses(); i != e; ++i) {
490 if (PMDataManager *PM = getContainedPass(i)->getAsPMDataManager()) {
491 assert(PM->getPassManagerType() == PMT_FunctionPassManager &&
492 "Invalid CGPassManager member");
493 Changed |= ((FPPassManager*)PM)->doFinalization(CG.getModule());
495 Changed |= ((CallGraphSCCPass*)getContainedPass(i))->doFinalization(CG);
501 //===----------------------------------------------------------------------===//
502 // CallGraphSCC Implementation
503 //===----------------------------------------------------------------------===//
505 /// ReplaceNode - This informs the SCC and the pass manager that the specified
506 /// Old node has been deleted, and New is to be used in its place.
507 void CallGraphSCC::ReplaceNode(CallGraphNode *Old, CallGraphNode *New) {
508 assert(Old != New && "Should not replace node with self");
509 for (unsigned i = 0; ; ++i) {
510 assert(i != Nodes.size() && "Node not in SCC");
511 if (Nodes[i] != Old) continue;
516 // Update the active scc_iterator so that it doesn't contain dangling
517 // pointers to the old CallGraphNode.
518 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context;
519 CGI->ReplaceNode(Old, New);
523 //===----------------------------------------------------------------------===//
524 // CallGraphSCCPass Implementation
525 //===----------------------------------------------------------------------===//
527 /// Assign pass manager to manage this pass.
528 void CallGraphSCCPass::assignPassManager(PMStack &PMS,
529 PassManagerType PreferredType) {
530 // Find CGPassManager
531 while (!PMS.empty() &&
532 PMS.top()->getPassManagerType() > PMT_CallGraphPassManager)
535 assert(!PMS.empty() && "Unable to handle Call Graph Pass");
538 if (PMS.top()->getPassManagerType() == PMT_CallGraphPassManager)
539 CGP = (CGPassManager*)PMS.top();
541 // Create new Call Graph SCC Pass Manager if it does not exist.
542 assert(!PMS.empty() && "Unable to create Call Graph Pass Manager");
543 PMDataManager *PMD = PMS.top();
545 // [1] Create new Call Graph Pass Manager
546 CGP = new CGPassManager();
548 // [2] Set up new manager's top level manager
549 PMTopLevelManager *TPM = PMD->getTopLevelManager();
550 TPM->addIndirectPassManager(CGP);
552 // [3] Assign manager to manage this new manager. This may create
553 // and push new managers into PMS
555 TPM->schedulePass(P);
557 // [4] Push new manager into PMS
564 /// getAnalysisUsage - For this class, we declare that we require and preserve
565 /// the call graph. If the derived class implements this method, it should
566 /// always explicitly call the implementation here.
567 void CallGraphSCCPass::getAnalysisUsage(AnalysisUsage &AU) const {
568 AU.addRequired<CallGraph>();
569 AU.addPreserved<CallGraph>();
573 //===----------------------------------------------------------------------===//
574 // PrintCallGraphPass Implementation
575 //===----------------------------------------------------------------------===//
578 /// PrintCallGraphPass - Print a Module corresponding to a call graph.
580 class PrintCallGraphPass : public CallGraphSCCPass {
582 raw_ostream &Out; // raw_ostream to print on.
586 PrintCallGraphPass(const std::string &B, raw_ostream &o)
587 : CallGraphSCCPass(ID), Banner(B), Out(o) {}
589 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
590 AU.setPreservesAll();
593 bool runOnSCC(CallGraphSCC &SCC) {
595 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
596 (*I)->getFunction()->print(Out);
601 } // end anonymous namespace.
603 char PrintCallGraphPass::ID = 0;
605 Pass *CallGraphSCCPass::createPrinterPass(raw_ostream &O,
606 const std::string &Banner) const {
607 return new PrintCallGraphPass(Banner, O);