1 //===- CGSCCPassManager.h - Call graph pass management ----------*- C++ -*-===//
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 //===----------------------------------------------------------------------===//
11 /// This header provides classes for managing passes over SCCs of the call
12 /// graph. These passes form an important component of LLVM's interprocedural
13 /// optimizations. Because they operate on the SCCs of the call graph, and they
14 /// traverse the graph in post-order, they can effectively do pair-wise
15 /// interprocedural optimizations for all call edges in the program while
16 /// incrementally refining it and improving the context of these pair-wise
17 /// optimizations. At each call site edge, the callee has already been
18 /// optimized as much as is possible. This in turn allows very accurate
19 /// analysis of it for IPO.
21 /// A secondary more general goal is to be able to isolate optimization on
22 /// unrelated parts of the IR module. This is useful to ensure our
23 /// optimizations are principled and don't miss oportunities where refinement
24 /// of one part of the module influence transformations in another part of the
25 /// module. But this is also useful if we want to parallelize the optimizations
26 /// across common large module graph shapes which tend to be very wide and have
27 /// large regions of unrelated cliques.
29 /// To satisfy these goals, we use the LazyCallGraph which provides two graphs
30 /// nested inside each other (and built lazily from the bottom-up): the call
31 /// graph proper, and a reference graph. The reference graph is super set of
32 /// the call graph and is a conservative approximation of what could through
33 /// scalar or CGSCC transforms *become* the call graph. Using this allows us to
34 /// ensure we optimize functions prior to them being introduced into the call
35 /// graph by devirtualization or other technique, and thus ensures that
36 /// subsequent pair-wise interprocedural optimizations observe the optimized
37 /// form of these functions. The (potentially transitive) reference
38 /// reachability used by the reference graph is a conservative approximation
39 /// that still allows us to have independent regions of the graph.
41 /// FIXME: There is one major drawback of the reference graph: in its naive
42 /// form it is quadratic because it contains a distinct edge for each
43 /// (potentially indirect) reference, even if are all through some common
44 /// global table of function pointers. This can be fixed in a number of ways
45 /// that essentially preserve enough of the normalization. While it isn't
46 /// expected to completely preclude the usability of this, it will need to be
50 /// All of these issues are made substantially more complex in the face of
51 /// mutations to the call graph while optimization passes are being run. When
52 /// mutations to the call graph occur we want to achieve two different things:
54 /// - We need to update the call graph in-flight and invalidate analyses
55 /// cached on entities in the graph. Because of the cache-based analysis
56 /// design of the pass manager, it is essential to have stable identities for
57 /// the elements of the IR that passes traverse, and to invalidate any
58 /// analyses cached on these elements as the mutations take place.
60 /// - We want to preserve the incremental and post-order traversal of the
61 /// graph even as it is refined and mutated. This means we want optimization
62 /// to observe the most refined form of the call graph and to do so in
65 /// To address this, the CGSCC manager uses both worklists that can be expanded
66 /// by passes which transform the IR, and provides invalidation tests to skip
67 /// entries that become dead. This extra data is provided to every SCC pass so
68 /// that it can carefully update the manager's traversal as the call graph
71 /// We also provide support for running function passes within the CGSCC walk,
72 /// and there we provide automatic update of the call graph including of the
73 /// pass manager to reflect call graph changes that fall out naturally as part
74 /// of scalar transformations.
76 /// The patterns used to ensure the goals of post-order visitation of the fully
79 /// 1) Sink toward the "bottom" as the graph is refined. This means that any
80 /// iteration continues in some valid post-order sequence after the mutation
81 /// has altered the structure.
83 /// 2) Enqueue in post-order, including the current entity. If the current
84 /// entity's shape changes, it and everything after it in post-order needs
85 /// to be visited to observe that shape.
87 //===----------------------------------------------------------------------===//
89 #ifndef LLVM_ANALYSIS_CGSCCPASSMANAGER_H
90 #define LLVM_ANALYSIS_CGSCCPASSMANAGER_H
92 #include "llvm/ADT/PriorityWorklist.h"
93 #include "llvm/Analysis/LazyCallGraph.h"
94 #include "llvm/IR/CallSite.h"
95 #include "llvm/IR/InstIterator.h"
96 #include "llvm/IR/PassManager.h"
97 #include "llvm/IR/ValueHandle.h"
101 struct CGSCCUpdateResult;
103 /// Extern template declaration for the analysis set for this IR unit.
104 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
106 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
107 /// \brief The CGSCC analysis manager.
109 /// See the documentation for the AnalysisManager template for detail
110 /// documentation. This typedef serves as a convenient way to refer to this
111 /// construct in the adaptors and proxies used to integrate this into the larger
112 /// pass manager infrastructure.
113 typedef AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>
114 CGSCCAnalysisManager;
116 // Explicit specialization and instantiation declarations for the pass manager.
117 // See the comments on the definition of the specialization for details on how
118 // it differs from the primary template.
121 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
122 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
123 CGSCCAnalysisManager &AM,
124 LazyCallGraph &G, CGSCCUpdateResult &UR);
125 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
126 LazyCallGraph &, CGSCCUpdateResult &>;
128 /// \brief The CGSCC pass manager.
130 /// See the documentation for the PassManager template for details. It runs
131 /// a sequence of SCC passes over each SCC that the manager is run over. This
132 /// typedef serves as a convenient way to refer to this construct.
133 typedef PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
137 /// An explicit specialization of the require analysis template pass.
138 template <typename AnalysisT>
139 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
140 LazyCallGraph &, CGSCCUpdateResult &>
141 : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC,
142 CGSCCAnalysisManager, LazyCallGraph &,
143 CGSCCUpdateResult &>> {
144 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
145 LazyCallGraph &CG, CGSCCUpdateResult &) {
146 (void)AM.template getResult<AnalysisT>(C, CG);
147 return PreservedAnalyses::all();
151 /// A proxy from a \c CGSCCAnalysisManager to a \c Module.
152 typedef InnerAnalysisManagerProxy<CGSCCAnalysisManager, Module>
153 CGSCCAnalysisManagerModuleProxy;
155 /// We need a specialized result for the \c CGSCCAnalysisManagerModuleProxy so
156 /// it can have access to the call graph in order to walk all the SCCs when
157 /// invalidating things.
158 template <> class CGSCCAnalysisManagerModuleProxy::Result {
160 explicit Result(CGSCCAnalysisManager &InnerAM, LazyCallGraph &G)
161 : InnerAM(&InnerAM), G(&G) {}
163 /// \brief Accessor for the analysis manager.
164 CGSCCAnalysisManager &getManager() { return *InnerAM; }
166 /// \brief Handler for invalidation of the Module.
168 /// If the proxy analysis itself is preserved, then we assume that the set of
169 /// SCCs in the Module hasn't changed. Thus any pointers to SCCs in the
170 /// CGSCCAnalysisManager are still valid, and we don't need to call \c clear
171 /// on the CGSCCAnalysisManager.
173 /// Regardless of whether this analysis is marked as preserved, all of the
174 /// analyses in the \c CGSCCAnalysisManager are potentially invalidated based
175 /// on the set of preserved analyses.
176 bool invalidate(Module &M, const PreservedAnalyses &PA,
177 ModuleAnalysisManager::Invalidator &Inv);
180 CGSCCAnalysisManager *InnerAM;
184 /// Provide a specialized run method for the \c CGSCCAnalysisManagerModuleProxy
185 /// so it can pass the lazy call graph to the result.
187 CGSCCAnalysisManagerModuleProxy::Result
188 CGSCCAnalysisManagerModuleProxy::run(Module &M, ModuleAnalysisManager &AM);
190 // Ensure the \c CGSCCAnalysisManagerModuleProxy is provided as an extern
192 extern template class InnerAnalysisManagerProxy<CGSCCAnalysisManager, Module>;
194 extern template class OuterAnalysisManagerProxy<
195 ModuleAnalysisManager, LazyCallGraph::SCC, LazyCallGraph &>;
196 /// A proxy from a \c ModuleAnalysisManager to an \c SCC.
197 typedef OuterAnalysisManagerProxy<ModuleAnalysisManager, LazyCallGraph::SCC,
199 ModuleAnalysisManagerCGSCCProxy;
201 /// Support structure for SCC passes to communicate updates the call graph back
202 /// to the CGSCC pass manager infrsatructure.
204 /// The CGSCC pass manager runs SCC passes which are allowed to update the call
205 /// graph and SCC structures. This means the structure the pass manager works
206 /// on is mutating underneath it. In order to support that, there needs to be
207 /// careful communication about the precise nature and ramifications of these
208 /// updates to the pass management infrastructure.
210 /// All SCC passes will have to accept a reference to the management layer's
211 /// update result struct and use it to reflect the results of any CG updates
214 /// Passes which do not change the call graph structure in any way can just
215 /// ignore this argument to their run method.
216 struct CGSCCUpdateResult {
217 /// Worklist of the RefSCCs queued for processing.
219 /// When a pass refines the graph and creates new RefSCCs or causes them to
220 /// have a different shape or set of component SCCs it should add the RefSCCs
221 /// to this worklist so that we visit them in the refined form.
223 /// This worklist is in reverse post-order, as we pop off the back in order
224 /// to observe RefSCCs in post-order. When adding RefSCCs, clients should add
225 /// them in reverse post-order.
226 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> &RCWorklist;
228 /// Worklist of the SCCs queued for processing.
230 /// When a pass refines the graph and creates new SCCs or causes them to have
231 /// a different shape or set of component functions it should add the SCCs to
232 /// this worklist so that we visit them in the refined form.
234 /// Note that if the SCCs are part of a RefSCC that is added to the \c
235 /// RCWorklist, they don't need to be added here as visiting the RefSCC will
236 /// be sufficient to re-visit the SCCs within it.
238 /// This worklist is in reverse post-order, as we pop off the back in order
239 /// to observe SCCs in post-order. When adding SCCs, clients should add them
240 /// in reverse post-order.
241 SmallPriorityWorklist<LazyCallGraph::SCC *, 1> &CWorklist;
243 /// The set of invalidated RefSCCs which should be skipped if they are found
244 /// in \c RCWorklist.
246 /// This is used to quickly prune out RefSCCs when they get deleted and
247 /// happen to already be on the worklist. We use this primarily to avoid
248 /// scanning the list and removing entries from it.
249 SmallPtrSetImpl<LazyCallGraph::RefSCC *> &InvalidatedRefSCCs;
251 /// The set of invalidated SCCs which should be skipped if they are found
254 /// This is used to quickly prune out SCCs when they get deleted and happen
255 /// to already be on the worklist. We use this primarily to avoid scanning
256 /// the list and removing entries from it.
257 SmallPtrSetImpl<LazyCallGraph::SCC *> &InvalidatedSCCs;
259 /// If non-null, the updated current \c RefSCC being processed.
261 /// This is set when a graph refinement takes place an the "current" point in
262 /// the graph moves "down" or earlier in the post-order walk. This will often
263 /// cause the "current" RefSCC to be a newly created RefSCC object and the
264 /// old one to be added to the above worklist. When that happens, this
265 /// pointer is non-null and can be used to continue processing the "top" of
266 /// the post-order walk.
267 LazyCallGraph::RefSCC *UpdatedRC;
269 /// If non-null, the updated current \c SCC being processed.
271 /// This is set when a graph refinement takes place an the "current" point in
272 /// the graph moves "down" or earlier in the post-order walk. This will often
273 /// cause the "current" SCC to be a newly created SCC object and the old one
274 /// to be added to the above worklist. When that happens, this pointer is
275 /// non-null and can be used to continue processing the "top" of the
277 LazyCallGraph::SCC *UpdatedC;
280 /// \brief The core module pass which does a post-order walk of the SCCs and
281 /// runs a CGSCC pass over each one.
283 /// Designed to allow composition of a CGSCCPass(Manager) and
284 /// a ModulePassManager. Note that this pass must be run with a module analysis
285 /// manager as it uses the LazyCallGraph analysis. It will also run the
286 /// \c CGSCCAnalysisManagerModuleProxy analysis prior to running the CGSCC
287 /// pass over the module to enable a \c FunctionAnalysisManager to be used
288 /// within this run safely.
289 template <typename CGSCCPassT>
290 class ModuleToPostOrderCGSCCPassAdaptor
291 : public PassInfoMixin<ModuleToPostOrderCGSCCPassAdaptor<CGSCCPassT>> {
293 explicit ModuleToPostOrderCGSCCPassAdaptor(CGSCCPassT Pass, bool DebugLogging = false)
294 : Pass(std::move(Pass)), DebugLogging(DebugLogging) {}
295 // We have to explicitly define all the special member functions because MSVC
296 // refuses to generate them.
297 ModuleToPostOrderCGSCCPassAdaptor(
298 const ModuleToPostOrderCGSCCPassAdaptor &Arg)
299 : Pass(Arg.Pass), DebugLogging(Arg.DebugLogging) {}
300 ModuleToPostOrderCGSCCPassAdaptor(ModuleToPostOrderCGSCCPassAdaptor &&Arg)
301 : Pass(std::move(Arg.Pass)), DebugLogging(Arg.DebugLogging) {}
302 friend void swap(ModuleToPostOrderCGSCCPassAdaptor &LHS,
303 ModuleToPostOrderCGSCCPassAdaptor &RHS) {
305 swap(LHS.Pass, RHS.Pass);
306 swap(LHS.DebugLogging, RHS.DebugLogging);
308 ModuleToPostOrderCGSCCPassAdaptor &
309 operator=(ModuleToPostOrderCGSCCPassAdaptor RHS) {
314 /// \brief Runs the CGSCC pass across every SCC in the module.
315 PreservedAnalyses run(Module &M, ModuleAnalysisManager &AM) {
316 // Setup the CGSCC analysis manager from its proxy.
317 CGSCCAnalysisManager &CGAM =
318 AM.getResult<CGSCCAnalysisManagerModuleProxy>(M).getManager();
320 // Get the call graph for this module.
321 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M);
323 // We keep worklists to allow us to push more work onto the pass manager as
324 // the passes are run.
325 SmallPriorityWorklist<LazyCallGraph::RefSCC *, 1> RCWorklist;
326 SmallPriorityWorklist<LazyCallGraph::SCC *, 1> CWorklist;
328 // Keep sets for invalidated SCCs and RefSCCs that should be skipped when
329 // iterating off the worklists.
330 SmallPtrSet<LazyCallGraph::RefSCC *, 4> InvalidRefSCCSet;
331 SmallPtrSet<LazyCallGraph::SCC *, 4> InvalidSCCSet;
333 CGSCCUpdateResult UR = {RCWorklist, CWorklist, InvalidRefSCCSet,
334 InvalidSCCSet, nullptr, nullptr};
336 PreservedAnalyses PA = PreservedAnalyses::all();
337 for (auto RCI = CG.postorder_ref_scc_begin(),
338 RCE = CG.postorder_ref_scc_end();
340 assert(RCWorklist.empty() &&
341 "Should always start with an empty RefSCC worklist");
342 // The postorder_ref_sccs range we are walking is lazily constructed, so
343 // we only push the first one onto the worklist. The worklist allows us
344 // to capture *new* RefSCCs created during transformations.
346 // We really want to form RefSCCs lazily because that makes them cheaper
347 // to update as the program is simplified and allows us to have greater
348 // cache locality as forming a RefSCC touches all the parts of all the
349 // functions within that RefSCC.
351 // We also eagerly increment the iterator to the next position because
352 // the CGSCC passes below may delete the current RefSCC.
353 RCWorklist.insert(&*RCI++);
356 LazyCallGraph::RefSCC *RC = RCWorklist.pop_back_val();
357 if (InvalidRefSCCSet.count(RC)) {
359 dbgs() << "Skipping an invalid RefSCC...\n";
363 assert(CWorklist.empty() &&
364 "Should always start with an empty SCC worklist");
367 dbgs() << "Running an SCC pass across the RefSCC: " << *RC << "\n";
369 // Push the initial SCCs in reverse post-order as we'll pop off the the
370 // back and so see this in post-order.
371 for (LazyCallGraph::SCC &C : reverse(*RC))
372 CWorklist.insert(&C);
375 LazyCallGraph::SCC *C = CWorklist.pop_back_val();
376 // Due to call graph mutations, we may have invalid SCCs or SCCs from
377 // other RefSCCs in the worklist. The invalid ones are dead and the
378 // other RefSCCs should be queued above, so we just need to skip both
380 if (InvalidSCCSet.count(C)) {
382 dbgs() << "Skipping an invalid SCC...\n";
385 if (&C->getOuterRefSCC() != RC) {
387 dbgs() << "Skipping an SCC that is now part of some other "
393 // Check that we didn't miss any update scenario.
394 assert(!InvalidSCCSet.count(C) && "Processing an invalid SCC!");
395 assert(C->begin() != C->end() && "Cannot have an empty SCC!");
396 assert(&C->getOuterRefSCC() == RC &&
397 "Processing an SCC in a different RefSCC!");
399 UR.UpdatedRC = nullptr;
400 UR.UpdatedC = nullptr;
401 PreservedAnalyses PassPA = Pass.run(*C, CGAM, CG, UR);
403 // We handle invalidating the CGSCC analysis manager's information
404 // for the (potentially updated) SCC here. Note that any other SCCs
405 // whose structure has changed should have been invalidated by
406 // whatever was updating the call graph. This SCC gets invalidated
407 // late as it contains the nodes that were actively being
409 CGAM.invalidate(*(UR.UpdatedC ? UR.UpdatedC : C), PassPA);
411 // Then intersect the preserved set so that invalidation of module
412 // analyses will eventually occur when the module pass completes.
413 PA.intersect(std::move(PassPA));
415 // The pass may have restructured the call graph and refined the
416 // current SCC and/or RefSCC. We need to update our current SCC and
417 // RefSCC pointers to follow these. Also, when the current SCC is
418 // refined, re-run the SCC pass over the newly refined SCC in order
419 // to observe the most precise SCC model available. This inherently
420 // cannot cycle excessively as it only happens when we split SCCs
421 // apart, at most converging on a DAG of single nodes.
422 // FIXME: If we ever start having RefSCC passes, we'll want to
423 // iterate there too.
424 RC = UR.UpdatedRC ? UR.UpdatedRC : RC;
425 C = UR.UpdatedC ? UR.UpdatedC : C;
426 if (DebugLogging && UR.UpdatedC)
427 dbgs() << "Re-running SCC passes after a refinement of the "
429 << *UR.UpdatedC << "\n";
431 // Note that both `C` and `RC` may at this point refer to deleted,
432 // invalid SCC and RefSCCs respectively. But we will short circuit
433 // the processing when we check them in the loop above.
434 } while (UR.UpdatedC);
436 } while (!CWorklist.empty());
437 } while (!RCWorklist.empty());
440 // By definition we preserve the call garph, all SCC analyses, and the
441 // analysis proxies by handling them above and in any nested pass managers.
442 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>();
443 PA.preserve<LazyCallGraphAnalysis>();
444 PA.preserve<CGSCCAnalysisManagerModuleProxy>();
445 PA.preserve<FunctionAnalysisManagerModuleProxy>();
454 /// \brief A function to deduce a function pass type and wrap it in the
455 /// templated adaptor.
456 template <typename CGSCCPassT>
457 ModuleToPostOrderCGSCCPassAdaptor<CGSCCPassT>
458 createModuleToPostOrderCGSCCPassAdaptor(CGSCCPassT Pass, bool DebugLogging = false) {
459 return ModuleToPostOrderCGSCCPassAdaptor<CGSCCPassT>(std::move(Pass), DebugLogging);
462 /// A proxy from a \c FunctionAnalysisManager to an \c SCC.
464 /// When a module pass runs and triggers invalidation, both the CGSCC and
465 /// Function analysis manager proxies on the module get an invalidation event.
466 /// We don't want to fully duplicate responsibility for most of the
467 /// invalidation logic. Instead, this layer is only responsible for SCC-local
468 /// invalidation events. We work with the module's FunctionAnalysisManager to
469 /// invalidate function analyses.
470 class FunctionAnalysisManagerCGSCCProxy
471 : public AnalysisInfoMixin<FunctionAnalysisManagerCGSCCProxy> {
475 explicit Result(FunctionAnalysisManager &FAM) : FAM(&FAM) {}
477 /// \brief Accessor for the analysis manager.
478 FunctionAnalysisManager &getManager() { return *FAM; }
480 bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA,
481 CGSCCAnalysisManager::Invalidator &Inv);
484 FunctionAnalysisManager *FAM;
487 /// Computes the \c FunctionAnalysisManager and stores it in the result proxy.
488 Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &);
491 friend AnalysisInfoMixin<FunctionAnalysisManagerCGSCCProxy>;
492 static AnalysisKey Key;
495 extern template class OuterAnalysisManagerProxy<CGSCCAnalysisManager, Function>;
496 /// A proxy from a \c CGSCCAnalysisManager to a \c Function.
497 typedef OuterAnalysisManagerProxy<CGSCCAnalysisManager, Function>
498 CGSCCAnalysisManagerFunctionProxy;
500 /// Helper to update the call graph after running a function pass.
502 /// Function passes can only mutate the call graph in specific ways. This
503 /// routine provides a helper that updates the call graph in those ways
504 /// including returning whether any changes were made and populating a CG
505 /// update result struct for the overall CGSCC walk.
506 LazyCallGraph::SCC &updateCGAndAnalysisManagerForFunctionPass(
507 LazyCallGraph &G, LazyCallGraph::SCC &C, LazyCallGraph::Node &N,
508 CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, bool DebugLogging = false);
510 /// \brief Adaptor that maps from a SCC to its functions.
512 /// Designed to allow composition of a FunctionPass(Manager) and
513 /// a CGSCCPassManager. Note that if this pass is constructed with a pointer
514 /// to a \c CGSCCAnalysisManager it will run the
515 /// \c FunctionAnalysisManagerCGSCCProxy analysis prior to running the function
516 /// pass over the SCC to enable a \c FunctionAnalysisManager to be used
517 /// within this run safely.
518 template <typename FunctionPassT>
519 class CGSCCToFunctionPassAdaptor
520 : public PassInfoMixin<CGSCCToFunctionPassAdaptor<FunctionPassT>> {
522 explicit CGSCCToFunctionPassAdaptor(FunctionPassT Pass, bool DebugLogging = false)
523 : Pass(std::move(Pass)), DebugLogging(DebugLogging) {}
524 // We have to explicitly define all the special member functions because MSVC
525 // refuses to generate them.
526 CGSCCToFunctionPassAdaptor(const CGSCCToFunctionPassAdaptor &Arg)
527 : Pass(Arg.Pass), DebugLogging(Arg.DebugLogging) {}
528 CGSCCToFunctionPassAdaptor(CGSCCToFunctionPassAdaptor &&Arg)
529 : Pass(std::move(Arg.Pass)), DebugLogging(Arg.DebugLogging) {}
530 friend void swap(CGSCCToFunctionPassAdaptor &LHS,
531 CGSCCToFunctionPassAdaptor &RHS) {
533 swap(LHS.Pass, RHS.Pass);
534 swap(LHS.DebugLogging, RHS.DebugLogging);
536 CGSCCToFunctionPassAdaptor &operator=(CGSCCToFunctionPassAdaptor RHS) {
541 /// \brief Runs the function pass across every function in the module.
542 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
543 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
544 // Setup the function analysis manager from its proxy.
545 FunctionAnalysisManager &FAM =
546 AM.getResult<FunctionAnalysisManagerCGSCCProxy>(C, CG).getManager();
548 SmallVector<LazyCallGraph::Node *, 4> Nodes;
549 for (LazyCallGraph::Node &N : C)
552 // The SCC may get split while we are optimizing functions due to deleting
553 // edges. If this happens, the current SCC can shift, so keep track of
554 // a pointer we can overwrite.
555 LazyCallGraph::SCC *CurrentC = &C;
558 dbgs() << "Running function passes across an SCC: " << C << "\n";
560 PreservedAnalyses PA = PreservedAnalyses::all();
561 for (LazyCallGraph::Node *N : Nodes) {
562 // Skip nodes from other SCCs. These may have been split out during
563 // processing. We'll eventually visit those SCCs and pick up the nodes
565 if (CG.lookupSCC(*N) != CurrentC)
568 PreservedAnalyses PassPA = Pass.run(N->getFunction(), FAM);
570 // We know that the function pass couldn't have invalidated any other
571 // function's analyses (that's the contract of a function pass), so
572 // directly handle the function analysis manager's invalidation here.
573 FAM.invalidate(N->getFunction(), PassPA);
575 // Then intersect the preserved set so that invalidation of module
576 // analyses will eventually occur when the module pass completes.
577 PA.intersect(std::move(PassPA));
579 // Update the call graph based on this function pass. This may also
580 // update the current SCC to point to a smaller, more refined SCC.
581 CurrentC = &updateCGAndAnalysisManagerForFunctionPass(
582 CG, *CurrentC, *N, AM, UR, DebugLogging);
583 assert(CG.lookupSCC(*N) == CurrentC &&
584 "Current SCC not updated to the SCC containing the current node!");
587 // By definition we preserve the proxy. And we preserve all analyses on
588 // Functions. This precludes *any* invalidation of function analyses by the
589 // proxy, but that's OK because we've taken care to invalidate analyses in
590 // the function analysis manager incrementally above.
591 PA.preserveSet<AllAnalysesOn<Function>>();
592 PA.preserve<FunctionAnalysisManagerCGSCCProxy>();
594 // We've also ensured that we updated the call graph along the way.
595 PA.preserve<LazyCallGraphAnalysis>();
605 /// \brief A function to deduce a function pass type and wrap it in the
606 /// templated adaptor.
607 template <typename FunctionPassT>
608 CGSCCToFunctionPassAdaptor<FunctionPassT>
609 createCGSCCToFunctionPassAdaptor(FunctionPassT Pass, bool DebugLogging = false) {
610 return CGSCCToFunctionPassAdaptor<FunctionPassT>(std::move(Pass),
614 /// A helper that repeats an SCC pass each time an indirect call is refined to
615 /// a direct call by that pass.
617 /// While the CGSCC pass manager works to re-visit SCCs and RefSCCs as they
618 /// change shape, we may also want to repeat an SCC pass if it simply refines
619 /// an indirect call to a direct call, even if doing so does not alter the
620 /// shape of the graph. Note that this only pertains to direct calls to
621 /// functions where IPO across the SCC may be able to compute more precise
622 /// results. For intrinsics, we assume scalar optimizations already can fully
623 /// reason about them.
625 /// This repetition has the potential to be very large however, as each one
626 /// might refine a single call site. As a consequence, in practice we use an
627 /// upper bound on the number of repetitions to limit things.
628 template <typename PassT>
629 class DevirtSCCRepeatedPass
630 : public PassInfoMixin<DevirtSCCRepeatedPass<PassT>> {
632 explicit DevirtSCCRepeatedPass(PassT Pass, int MaxIterations,
633 bool DebugLogging = false)
634 : Pass(std::move(Pass)), MaxIterations(MaxIterations),
635 DebugLogging(DebugLogging) {}
637 /// Runs the wrapped pass up to \c MaxIterations on the SCC, iterating
638 /// whenever an indirect call is refined.
639 PreservedAnalyses run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM,
640 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
641 PreservedAnalyses PA = PreservedAnalyses::all();
643 // The SCC may be refined while we are running passes over it, so set up
644 // a pointer that we can update.
645 LazyCallGraph::SCC *C = &InitialC;
647 // Collect value handles for all of the indirect call sites.
648 SmallVector<WeakVH, 8> CallHandles;
650 // Struct to track the counts of direct and indirect calls in each function
657 // Put value handles on all of the indirect calls and return the number of
658 // direct calls for each function in the SCC.
659 auto ScanSCC = [](LazyCallGraph::SCC &C,
660 SmallVectorImpl<WeakVH> &CallHandles) {
661 assert(CallHandles.empty() && "Must start with a clear set of handles.");
663 SmallVector<CallCount, 4> CallCounts;
664 for (LazyCallGraph::Node &N : C) {
665 CallCounts.push_back({0, 0});
666 CallCount &Count = CallCounts.back();
667 for (Instruction &I : instructions(N.getFunction()))
668 if (auto CS = CallSite(&I)) {
669 if (CS.getCalledFunction()) {
673 CallHandles.push_back(WeakVH(&I));
681 // Populate the initial call handles and get the initial call counts.
682 auto CallCounts = ScanSCC(*C, CallHandles);
684 for (int Iteration = 0;; ++Iteration) {
685 PreservedAnalyses PassPA = Pass.run(*C, AM, CG, UR);
687 // If the SCC structure has changed, bail immediately and let the outer
688 // CGSCC layer handle any iteration to reflect the refined structure.
689 if (UR.UpdatedC && UR.UpdatedC != C) {
690 PA.intersect(std::move(PassPA));
694 // Check that we didn't miss any update scenario.
695 assert(!UR.InvalidatedSCCs.count(C) && "Processing an invalid SCC!");
696 assert(C->begin() != C->end() && "Cannot have an empty SCC!");
697 assert((int)CallCounts.size() == C->size() &&
698 "Cannot have changed the size of the SCC!");
700 // Check whether any of the handles were devirtualized.
701 auto IsDevirtualizedHandle = [&](WeakVH &CallH) {
704 auto CS = CallSite(CallH);
708 // If the call is still indirect, leave it alone.
709 Function *F = CS.getCalledFunction();
714 dbgs() << "Found devirutalized call from "
715 << CS.getParent()->getParent()->getName() << " to "
716 << F->getName() << "\n";
718 // We now have a direct call where previously we had an indirect call,
719 // so iterate to process this devirtualization site.
722 bool Devirt = any_of(CallHandles, IsDevirtualizedHandle);
724 // Rescan to build up a new set of handles and count how many direct
725 // calls remain. If we decide to iterate, this also sets up the input to
726 // the next iteration.
728 auto NewCallCounts = ScanSCC(*C, CallHandles);
730 // If we haven't found an explicit devirtualization already see if we
731 // have decreased the number of indirect calls and increased the number
732 // of direct calls for any function in the SCC. This can be fooled by all
733 // manner of transformations such as DCE and other things, but seems to
734 // work well in practice.
736 for (int i = 0, Size = C->size(); i < Size; ++i)
737 if (CallCounts[i].Indirect > NewCallCounts[i].Indirect &&
738 CallCounts[i].Direct < NewCallCounts[i].Direct) {
744 PA.intersect(std::move(PassPA));
748 // Otherwise, if we've already hit our max, we're done.
749 if (Iteration >= MaxIterations) {
751 dbgs() << "Found another devirtualization after hitting the max "
752 "number of repetitions ("
753 << MaxIterations << ") on SCC: " << *C << "\n";
754 PA.intersect(std::move(PassPA));
759 dbgs() << "Repeating an SCC pass after finding a devirtualization in: "
762 // Move over the new call counts in preparation for iterating.
763 CallCounts = std::move(NewCallCounts);
765 // Update the analysis manager with each run and intersect the total set
766 // of preserved analyses so we're ready to iterate.
767 AM.invalidate(*C, PassPA);
768 PA.intersect(std::move(PassPA));
771 // Note that we don't add any preserved entries here unlike a more normal
772 // "pass manager" because we only handle invalidation *between* iterations,
773 // not after the last iteration.
783 /// \brief A function to deduce a function pass type and wrap it in the
784 /// templated adaptor.
785 template <typename PassT>
786 DevirtSCCRepeatedPass<PassT>
787 createDevirtSCCRepeatedPass(PassT Pass, int MaxIterations,
788 bool DebugLogging = false) {
789 return DevirtSCCRepeatedPass<PassT>(std::move(Pass), MaxIterations,