LLVM  13.0.0git
CGSCCPassManager.h
Go to the documentation of this file.
1 //===- CGSCCPassManager.h - Call graph pass management ----------*- C++ -*-===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 /// \file
9 ///
10 /// This header provides classes for managing passes over SCCs of the call
11 /// graph. These passes form an important component of LLVM's interprocedural
12 /// optimizations. Because they operate on the SCCs of the call graph, and they
13 /// traverse the graph in post-order, they can effectively do pair-wise
14 /// interprocedural optimizations for all call edges in the program while
15 /// incrementally refining it and improving the context of these pair-wise
16 /// optimizations. At each call site edge, the callee has already been
17 /// optimized as much as is possible. This in turn allows very accurate
18 /// analysis of it for IPO.
19 ///
20 /// A secondary more general goal is to be able to isolate optimization on
21 /// unrelated parts of the IR module. This is useful to ensure our
22 /// optimizations are principled and don't miss oportunities where refinement
23 /// of one part of the module influence transformations in another part of the
24 /// module. But this is also useful if we want to parallelize the optimizations
25 /// across common large module graph shapes which tend to be very wide and have
26 /// large regions of unrelated cliques.
27 ///
28 /// To satisfy these goals, we use the LazyCallGraph which provides two graphs
29 /// nested inside each other (and built lazily from the bottom-up): the call
30 /// graph proper, and a reference graph. The reference graph is super set of
31 /// the call graph and is a conservative approximation of what could through
32 /// scalar or CGSCC transforms *become* the call graph. Using this allows us to
33 /// ensure we optimize functions prior to them being introduced into the call
34 /// graph by devirtualization or other technique, and thus ensures that
35 /// subsequent pair-wise interprocedural optimizations observe the optimized
36 /// form of these functions. The (potentially transitive) reference
37 /// reachability used by the reference graph is a conservative approximation
38 /// that still allows us to have independent regions of the graph.
39 ///
40 /// FIXME: There is one major drawback of the reference graph: in its naive
41 /// form it is quadratic because it contains a distinct edge for each
42 /// (potentially indirect) reference, even if are all through some common
43 /// global table of function pointers. This can be fixed in a number of ways
44 /// that essentially preserve enough of the normalization. While it isn't
45 /// expected to completely preclude the usability of this, it will need to be
46 /// addressed.
47 ///
48 ///
49 /// All of these issues are made substantially more complex in the face of
50 /// mutations to the call graph while optimization passes are being run. When
51 /// mutations to the call graph occur we want to achieve two different things:
52 ///
53 /// - We need to update the call graph in-flight and invalidate analyses
54 /// cached on entities in the graph. Because of the cache-based analysis
55 /// design of the pass manager, it is essential to have stable identities for
56 /// the elements of the IR that passes traverse, and to invalidate any
57 /// analyses cached on these elements as the mutations take place.
58 ///
59 /// - We want to preserve the incremental and post-order traversal of the
60 /// graph even as it is refined and mutated. This means we want optimization
61 /// to observe the most refined form of the call graph and to do so in
62 /// post-order.
63 ///
64 /// To address this, the CGSCC manager uses both worklists that can be expanded
65 /// by passes which transform the IR, and provides invalidation tests to skip
66 /// entries that become dead. This extra data is provided to every SCC pass so
67 /// that it can carefully update the manager's traversal as the call graph
68 /// mutates.
69 ///
70 /// We also provide support for running function passes within the CGSCC walk,
71 /// and there we provide automatic update of the call graph including of the
72 /// pass manager to reflect call graph changes that fall out naturally as part
73 /// of scalar transformations.
74 ///
75 /// The patterns used to ensure the goals of post-order visitation of the fully
76 /// refined graph:
77 ///
78 /// 1) Sink toward the "bottom" as the graph is refined. This means that any
79 /// iteration continues in some valid post-order sequence after the mutation
80 /// has altered the structure.
81 ///
82 /// 2) Enqueue in post-order, including the current entity. If the current
83 /// entity's shape changes, it and everything after it in post-order needs
84 /// to be visited to observe that shape.
85 ///
86 //===----------------------------------------------------------------------===//
87 
88 #ifndef LLVM_ANALYSIS_CGSCCPASSMANAGER_H
89 #define LLVM_ANALYSIS_CGSCCPASSMANAGER_H
90 
91 #include "llvm/ADT/DenseMap.h"
92 #include "llvm/ADT/DenseSet.h"
93 #include "llvm/ADT/MapVector.h"
95 #include "llvm/ADT/STLExtras.h"
96 #include "llvm/ADT/SmallPtrSet.h"
97 #include "llvm/ADT/SmallVector.h"
99 #include "llvm/IR/Function.h"
100 #include "llvm/IR/InstIterator.h"
101 #include "llvm/IR/PassManager.h"
102 #include "llvm/IR/ValueHandle.h"
103 #include "llvm/Support/Debug.h"
105 #include <algorithm>
106 #include <cassert>
107 #include <utility>
108 
109 namespace llvm {
110 
111 struct CGSCCUpdateResult;
112 class Module;
113 
114 // Allow debug logging in this inline function.
115 #define DEBUG_TYPE "cgscc"
116 
117 /// Extern template declaration for the analysis set for this IR unit.
118 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
119 
120 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
121 
122 /// The CGSCC analysis manager.
123 ///
124 /// See the documentation for the AnalysisManager template for detail
125 /// documentation. This type serves as a convenient way to refer to this
126 /// construct in the adaptors and proxies used to integrate this into the larger
127 /// pass manager infrastructure.
128 using CGSCCAnalysisManager =
130 
131 // Explicit specialization and instantiation declarations for the pass manager.
132 // See the comments on the definition of the specialization for details on how
133 // it differs from the primary template.
134 template <>
137  CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
142 
143 /// The CGSCC pass manager.
144 ///
145 /// See the documentation for the PassManager template for details. It runs
146 /// a sequence of SCC passes over each SCC that the manager is run over. This
147 /// type serves as a convenient way to refer to this construct.
148 using CGSCCPassManager =
151 
152 /// An explicit specialization of the require analysis template pass.
153 template <typename AnalysisT>
156  : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC,
157  CGSCCAnalysisManager, LazyCallGraph &,
158  CGSCCUpdateResult &>> {
161  (void)AM.template getResult<AnalysisT>(C, CG);
162  return PreservedAnalyses::all();
163  }
164 };
165 
166 /// A proxy from a \c CGSCCAnalysisManager to a \c Module.
169 
170 /// We need a specialized result for the \c CGSCCAnalysisManagerModuleProxy so
171 /// it can have access to the call graph in order to walk all the SCCs when
172 /// invalidating things.
174 public:
176  : InnerAM(&InnerAM), G(&G) {}
177 
178  /// Accessor for the analysis manager.
179  CGSCCAnalysisManager &getManager() { return *InnerAM; }
180 
181  /// Handler for invalidation of the Module.
182  ///
183  /// If the proxy analysis itself is preserved, then we assume that the set of
184  /// SCCs in the Module hasn't changed. Thus any pointers to SCCs in the
185  /// CGSCCAnalysisManager are still valid, and we don't need to call \c clear
186  /// on the CGSCCAnalysisManager.
187  ///
188  /// Regardless of whether this analysis is marked as preserved, all of the
189  /// analyses in the \c CGSCCAnalysisManager are potentially invalidated based
190  /// on the set of preserved analyses.
191  bool invalidate(Module &M, const PreservedAnalyses &PA,
193 
194 private:
195  CGSCCAnalysisManager *InnerAM;
196  LazyCallGraph *G;
197 };
198 
199 /// Provide a specialized run method for the \c CGSCCAnalysisManagerModuleProxy
200 /// so it can pass the lazy call graph to the result.
201 template <>
204 
205 // Ensure the \c CGSCCAnalysisManagerModuleProxy is provided as an extern
206 // template.
208 
209 extern template class OuterAnalysisManagerProxy<
211 
212 /// A proxy from a \c ModuleAnalysisManager to an \c SCC.
216 
217 /// Support structure for SCC passes to communicate updates the call graph back
218 /// to the CGSCC pass manager infrsatructure.
219 ///
220 /// The CGSCC pass manager runs SCC passes which are allowed to update the call
221 /// graph and SCC structures. This means the structure the pass manager works
222 /// on is mutating underneath it. In order to support that, there needs to be
223 /// careful communication about the precise nature and ramifications of these
224 /// updates to the pass management infrastructure.
225 ///
226 /// All SCC passes will have to accept a reference to the management layer's
227 /// update result struct and use it to reflect the results of any CG updates
228 /// performed.
229 ///
230 /// Passes which do not change the call graph structure in any way can just
231 /// ignore this argument to their run method.
233  /// Worklist of the RefSCCs queued for processing.
234  ///
235  /// When a pass refines the graph and creates new RefSCCs or causes them to
236  /// have a different shape or set of component SCCs it should add the RefSCCs
237  /// to this worklist so that we visit them in the refined form.
238  ///
239  /// This worklist is in reverse post-order, as we pop off the back in order
240  /// to observe RefSCCs in post-order. When adding RefSCCs, clients should add
241  /// them in reverse post-order.
243 
244  /// Worklist of the SCCs queued for processing.
245  ///
246  /// When a pass refines the graph and creates new SCCs or causes them to have
247  /// a different shape or set of component functions it should add the SCCs to
248  /// this worklist so that we visit them in the refined form.
249  ///
250  /// Note that if the SCCs are part of a RefSCC that is added to the \c
251  /// RCWorklist, they don't need to be added here as visiting the RefSCC will
252  /// be sufficient to re-visit the SCCs within it.
253  ///
254  /// This worklist is in reverse post-order, as we pop off the back in order
255  /// to observe SCCs in post-order. When adding SCCs, clients should add them
256  /// in reverse post-order.
258 
259  /// The set of invalidated RefSCCs which should be skipped if they are found
260  /// in \c RCWorklist.
261  ///
262  /// This is used to quickly prune out RefSCCs when they get deleted and
263  /// happen to already be on the worklist. We use this primarily to avoid
264  /// scanning the list and removing entries from it.
266 
267  /// The set of invalidated SCCs which should be skipped if they are found
268  /// in \c CWorklist.
269  ///
270  /// This is used to quickly prune out SCCs when they get deleted and happen
271  /// to already be on the worklist. We use this primarily to avoid scanning
272  /// the list and removing entries from it.
274 
275  /// If non-null, the updated current \c RefSCC being processed.
276  ///
277  /// This is set when a graph refinement takes place an the "current" point in
278  /// the graph moves "down" or earlier in the post-order walk. This will often
279  /// cause the "current" RefSCC to be a newly created RefSCC object and the
280  /// old one to be added to the above worklist. When that happens, this
281  /// pointer is non-null and can be used to continue processing the "top" of
282  /// the post-order walk.
284 
285  /// If non-null, the updated current \c SCC being processed.
286  ///
287  /// This is set when a graph refinement takes place an the "current" point in
288  /// the graph moves "down" or earlier in the post-order walk. This will often
289  /// cause the "current" SCC to be a newly created SCC object and the old one
290  /// to be added to the above worklist. When that happens, this pointer is
291  /// non-null and can be used to continue processing the "top" of the
292  /// post-order walk.
294 
295  /// Preserved analyses across SCCs.
296  ///
297  /// We specifically want to allow CGSCC passes to mutate ancestor IR
298  /// (changing both the CG structure and the function IR itself). However,
299  /// this means we need to take special care to correctly mark what analyses
300  /// are preserved *across* SCCs. We have to track this out-of-band here
301  /// because within the main `PassManeger` infrastructure we need to mark
302  /// everything within an SCC as preserved in order to avoid repeatedly
303  /// invalidating the same analyses as we unnest pass managers and adaptors.
304  /// So we track the cross-SCC version of the preserved analyses here from any
305  /// code that does direct invalidation of SCC analyses, and then use it
306  /// whenever we move forward in the post-order walk of SCCs before running
307  /// passes over the new SCC.
309 
310  /// A hacky area where the inliner can retain history about inlining
311  /// decisions that mutated the call graph's SCC structure in order to avoid
312  /// infinite inlining. See the comments in the inliner's CG update logic.
313  ///
314  /// FIXME: Keeping this here seems like a big layering issue, we should look
315  /// for a better technique.
318 
319  /// Weak VHs to keep track of indirect calls for the purposes of detecting
320  /// devirtualization.
321  ///
322  /// This is a map to avoid having duplicate entries. If a Value is
323  /// deallocated, its corresponding WeakTrackingVH will be nulled out. When
324  /// checking if a Value is in the map or not, also check if the corresponding
325  /// WeakTrackingVH is null to avoid issues with a new Value sharing the same
326  /// address as a deallocated one.
328 };
329 
330 /// The core module pass which does a post-order walk of the SCCs and
331 /// runs a CGSCC pass over each one.
332 ///
333 /// Designed to allow composition of a CGSCCPass(Manager) and
334 /// a ModulePassManager. Note that this pass must be run with a module analysis
335 /// manager as it uses the LazyCallGraph analysis. It will also run the
336 /// \c CGSCCAnalysisManagerModuleProxy analysis prior to running the CGSCC
337 /// pass over the module to enable a \c FunctionAnalysisManager to be used
338 /// within this run safely.
340  : public PassInfoMixin<ModuleToPostOrderCGSCCPassAdaptor> {
341 public:
342  using PassConceptT =
345 
346  explicit ModuleToPostOrderCGSCCPassAdaptor(std::unique_ptr<PassConceptT> Pass)
347  : Pass(std::move(Pass)) {}
348 
350  : Pass(std::move(Arg.Pass)) {}
351 
354  std::swap(LHS.Pass, RHS.Pass);
355  }
356 
359  swap(*this, RHS);
360  return *this;
361  }
362 
363  /// Runs the CGSCC pass across every SCC in the module.
365 
366  static bool isRequired() { return true; }
367 
368 private:
369  std::unique_ptr<PassConceptT> Pass;
370 };
371 
372 /// A function to deduce a function pass type and wrap it in the
373 /// templated adaptor.
374 template <typename CGSCCPassT>
375 ModuleToPostOrderCGSCCPassAdaptor
377  using PassModelT = detail::PassModel<LazyCallGraph::SCC, CGSCCPassT,
381  std::make_unique<PassModelT>(std::move(Pass)));
382 }
383 
384 /// A proxy from a \c FunctionAnalysisManager to an \c SCC.
385 ///
386 /// When a module pass runs and triggers invalidation, both the CGSCC and
387 /// Function analysis manager proxies on the module get an invalidation event.
388 /// We don't want to fully duplicate responsibility for most of the
389 /// invalidation logic. Instead, this layer is only responsible for SCC-local
390 /// invalidation events. We work with the module's FunctionAnalysisManager to
391 /// invalidate function analyses.
393  : public AnalysisInfoMixin<FunctionAnalysisManagerCGSCCProxy> {
394 public:
395  class Result {
396  public:
397  explicit Result() : FAM(nullptr) {}
398  explicit Result(FunctionAnalysisManager &FAM) : FAM(&FAM) {}
399 
400  void updateFAM(FunctionAnalysisManager &FAM) { this->FAM = &FAM; }
401  /// Accessor for the analysis manager.
403  assert(FAM);
404  return *FAM;
405  }
406 
409 
410  private:
412  };
413 
414  /// Computes the \c FunctionAnalysisManager and stores it in the result proxy.
416 
417 private:
419 
420  static AnalysisKey Key;
421 };
422 
423 extern template class OuterAnalysisManagerProxy<CGSCCAnalysisManager, Function>;
424 
425 /// A proxy from a \c CGSCCAnalysisManager to a \c Function.
428 
429 /// Helper to update the call graph after running a function pass.
430 ///
431 /// Function passes can only mutate the call graph in specific ways. This
432 /// routine provides a helper that updates the call graph in those ways
433 /// including returning whether any changes were made and populating a CG
434 /// update result struct for the overall CGSCC walk.
439 
440 /// Helper to update the call graph after running a CGSCC pass.
441 ///
442 /// CGSCC passes can only mutate the call graph in specific ways. This
443 /// routine provides a helper that updates the call graph in those ways
444 /// including returning whether any changes were made and populating a CG
445 /// update result struct for the overall CGSCC walk.
450 
451 /// Adaptor that maps from a SCC to its functions.
452 ///
453 /// Designed to allow composition of a FunctionPass(Manager) and
454 /// a CGSCCPassManager. Note that if this pass is constructed with a pointer
455 /// to a \c CGSCCAnalysisManager it will run the
456 /// \c FunctionAnalysisManagerCGSCCProxy analysis prior to running the function
457 /// pass over the SCC to enable a \c FunctionAnalysisManager to be used
458 /// within this run safely.
461 public:
463 
464  explicit CGSCCToFunctionPassAdaptor(std::unique_ptr<PassConceptT> Pass)
465  : Pass(std::move(Pass)) {}
466 
468  : Pass(std::move(Arg.Pass)) {}
469 
472  std::swap(LHS.Pass, RHS.Pass);
473  }
474 
476  swap(*this, RHS);
477  return *this;
478  }
479 
480  /// Runs the function pass across every function in the module.
483 
484  static bool isRequired() { return true; }
485 
486 private:
487  std::unique_ptr<PassConceptT> Pass;
488 };
489 
490 /// A 'signaling' analysis to indicate whether a function has been changed. It
491 /// is meant to control the runs of the function pass(es) managed by the
492 /// FunctionAnalysisManagerCGSCCProxy.
495 public:
496  static AnalysisKey Key;
497  struct Result {};
498 
500 };
501 
502 /// A function to deduce a function pass type and wrap it in the
503 /// templated adaptor.
504 template <typename FunctionPassT>
505 CGSCCToFunctionPassAdaptor
507  using PassModelT =
511  std::make_unique<PassModelT>(std::move(Pass)));
512 }
513 
514 /// A helper that repeats an SCC pass each time an indirect call is refined to
515 /// a direct call by that pass.
516 ///
517 /// While the CGSCC pass manager works to re-visit SCCs and RefSCCs as they
518 /// change shape, we may also want to repeat an SCC pass if it simply refines
519 /// an indirect call to a direct call, even if doing so does not alter the
520 /// shape of the graph. Note that this only pertains to direct calls to
521 /// functions where IPO across the SCC may be able to compute more precise
522 /// results. For intrinsics, we assume scalar optimizations already can fully
523 /// reason about them.
524 ///
525 /// This repetition has the potential to be very large however, as each one
526 /// might refine a single call site. As a consequence, in practice we use an
527 /// upper bound on the number of repetitions to limit things.
528 class DevirtSCCRepeatedPass : public PassInfoMixin<DevirtSCCRepeatedPass> {
529 public:
530  using PassConceptT =
533 
534  explicit DevirtSCCRepeatedPass(std::unique_ptr<PassConceptT> Pass,
535  int MaxIterations)
536  : Pass(std::move(Pass)), MaxIterations(MaxIterations) {}
537 
538  /// Runs the wrapped pass up to \c MaxIterations on the SCC, iterating
539  /// whenever an indirect call is refined.
542 
543 private:
544  std::unique_ptr<PassConceptT> Pass;
545  int MaxIterations;
546 };
547 
548 /// A function to deduce a function pass type and wrap it in the
549 /// templated adaptor.
550 template <typename CGSCCPassT>
552  int MaxIterations) {
553  using PassModelT = detail::PassModel<LazyCallGraph::SCC, CGSCCPassT,
556  return DevirtSCCRepeatedPass(std::make_unique<PassModelT>(std::move(Pass)),
557  MaxIterations);
558 }
559 
560 // Clear out the debug logging macro.
561 #undef DEBUG_TYPE
562 
563 } // end namespace llvm
564 
565 #endif // LLVM_ANALYSIS_CGSCCPASSMANAGER_H
llvm::PreservedAnalyses
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:155
llvm::OuterAnalysisManagerProxy
An analysis over an "inner" IR unit that provides access to an analysis manager over a "outer" IR uni...
Definition: PassManager.h:1051
llvm::FunctionStatusAnalysis
A 'signaling' analysis to indicate whether a function has been changed.
Definition: CGSCCPassManager.h:493
llvm::CGSCCToFunctionPassAdaptor::isRequired
static bool isRequired()
Definition: CGSCCPassManager.h:484
llvm
Definition: AllocatorList.h:23
Pass
print lazy value Lazy Value Info Printer Pass
Definition: LazyValueInfo.cpp:1947
llvm::CGSCCUpdateResult::InvalidatedSCCs
SmallPtrSetImpl< LazyCallGraph::SCC * > & InvalidatedSCCs
The set of invalidated SCCs which should be skipped if they are found in CWorklist.
Definition: CGSCCPassManager.h:273
llvm::PassInfoMixin
A CRTP mix-in to automatically provide informational APIs needed for passes.
Definition: PassManager.h:374
InstIterator.h
llvm::Function
Definition: Function.h:61
llvm::DevirtSCCRepeatedPass
A helper that repeats an SCC pass each time an indirect call is refined to a direct call by that pass...
Definition: CGSCCPassManager.h:528
llvm::SmallDenseSet
Implements a dense probed hash-table based set with some number of buckets stored inline.
Definition: DenseSet.h:286
MapVector.h
llvm::InnerAnalysisManagerProxy::Result
Definition: PassManager.h:930
llvm::FunctionAnalysisManagerCGSCCProxy::run
Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &)
Computes the FunctionAnalysisManager and stores it in the result proxy.
Definition: CGSCCPassManager.cpp:687
FAM
FunctionAnalysisManager FAM
Definition: PassBuilderBindings.cpp:59
DenseMap.h
llvm::ModuleAnalysisManager
AnalysisManager< Module > ModuleAnalysisManager
Convenience typedef for the Module analysis manager.
Definition: PassManager.h:902
llvm::createCGSCCToFunctionPassAdaptor
CGSCCToFunctionPassAdaptor createCGSCCToFunctionPassAdaptor(FunctionPassT Pass)
A function to deduce a function pass type and wrap it in the templated adaptor.
Definition: CGSCCPassManager.h:506
llvm::createModuleToPostOrderCGSCCPassAdaptor
ModuleToPostOrderCGSCCPassAdaptor createModuleToPostOrderCGSCCPassAdaptor(CGSCCPassT Pass)
A function to deduce a function pass type and wrap it in the templated adaptor.
Definition: CGSCCPassManager.h:376
STLExtras.h
llvm::CGSCCAnalysisManagerModuleProxy::Result::Result
Result(CGSCCAnalysisManager &InnerAM, LazyCallGraph &G)
Definition: CGSCCPassManager.h:175
llvm::CGSCCToFunctionPassAdaptor::swap
friend void swap(CGSCCToFunctionPassAdaptor &LHS, CGSCCToFunctionPassAdaptor &RHS)
Definition: CGSCCPassManager.h:470
llvm::FunctionStatusAnalysis::run
Result run(Function &F, FunctionAnalysisManager &FAM)
Definition: CGSCCPassManager.h:499
F
#define F(x, y, z)
Definition: MD5.cpp:56
llvm::FunctionAnalysisManagerCGSCCProxy::Result::Result
Result(FunctionAnalysisManager &FAM)
Definition: CGSCCPassManager.h:398
llvm::FunctionStatusAnalysis::Key
static AnalysisKey Key
Definition: CGSCCPassManager.h:496
llvm::FunctionAnalysisManagerCGSCCProxy::Result
Definition: CGSCCPassManager.h:395
llvm::CGSCCToFunctionPassAdaptor
Adaptor that maps from a SCC to its functions.
Definition: CGSCCPassManager.h:459
Arg
amdgpu Simplify well known AMD library false FunctionCallee Value * Arg
Definition: AMDGPULibCalls.cpp:205
PriorityWorklist.h
llvm::ModuleToPostOrderCGSCCPassAdaptor::swap
friend void swap(ModuleToPostOrderCGSCCPassAdaptor &LHS, ModuleToPostOrderCGSCCPassAdaptor &RHS)
Definition: CGSCCPassManager.h:352
llvm::ModuleToPostOrderCGSCCPassAdaptor::ModuleToPostOrderCGSCCPassAdaptor
ModuleToPostOrderCGSCCPassAdaptor(ModuleToPostOrderCGSCCPassAdaptor &&Arg)
Definition: CGSCCPassManager.h:349
llvm::CGSCCUpdateResult::IndirectVHs
SmallMapVector< Value *, WeakTrackingVH, 16 > IndirectVHs
Weak VHs to keep track of indirect calls for the purposes of detecting devirtualization.
Definition: CGSCCPassManager.h:327
llvm::LazyCallGraph::SCC
An SCC of the call graph.
Definition: LazyCallGraph.h:421
C
(vector float) vec_cmpeq(*A, *B) C
Definition: README_ALTIVEC.txt:86
llvm::CGSCCAnalysisManagerModuleProxy
InnerAnalysisManagerProxy< CGSCCAnalysisManager, Module > CGSCCAnalysisManagerModuleProxy
A proxy from a CGSCCAnalysisManager to a Module.
Definition: CGSCCPassManager.h:168
llvm::CGSCCToFunctionPassAdaptor::CGSCCToFunctionPassAdaptor
CGSCCToFunctionPassAdaptor(std::unique_ptr< PassConceptT > Pass)
Definition: CGSCCPassManager.h:464
DenseSet.h
llvm::LazyCallGraph::RefSCC
A RefSCC of the call graph.
Definition: LazyCallGraph.h:537
SmallPtrSet.h
llvm::AnalysisManager::Invalidator
API to communicate dependencies between analyses during invalidation.
Definition: PassManager.h:656
llvm::ModuleToPostOrderCGSCCPassAdaptor
The core module pass which does a post-order walk of the SCCs and runs a CGSCC pass over each one.
Definition: CGSCCPassManager.h:339
LazyCallGraph.h
llvm::ModuleToPostOrderCGSCCPassAdaptor::operator=
ModuleToPostOrderCGSCCPassAdaptor & operator=(ModuleToPostOrderCGSCCPassAdaptor RHS)
Definition: CGSCCPassManager.h:358
llvm::FunctionAnalysisManagerCGSCCProxy::Result::invalidate
bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA, CGSCCAnalysisManager::Invalidator &Inv)
Definition: CGSCCPassManager.cpp:708
llvm::ModuleToPostOrderCGSCCPassAdaptor::isRequired
static bool isRequired()
Definition: CGSCCPassManager.h:366
llvm::CGSCCToFunctionPassAdaptor::operator=
CGSCCToFunctionPassAdaptor & operator=(CGSCCToFunctionPassAdaptor RHS)
Definition: CGSCCPassManager.h:475
G
const DataFlowGraph & G
Definition: RDFGraph.cpp:202
llvm::SmallMapVector
A MapVector that performs no allocations if smaller than a certain size.
Definition: MapVector.h:232
llvm::CGSCCUpdateResult::UpdatedC
LazyCallGraph::SCC * UpdatedC
If non-null, the updated current SCC being processed.
Definition: CGSCCPassManager.h:293
llvm::updateCGAndAnalysisManagerForFunctionPass
LazyCallGraph::SCC & updateCGAndAnalysisManagerForFunctionPass(LazyCallGraph &G, LazyCallGraph::SCC &C, LazyCallGraph::Node &N, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, FunctionAnalysisManager &FAM)
Helper to update the call graph after running a function pass.
Definition: CGSCCPassManager.cpp:1230
llvm::CGSCCUpdateResult::InlinedInternalEdges
SmallDenseSet< std::pair< LazyCallGraph::Node *, LazyCallGraph::SCC * >, 4 > & InlinedInternalEdges
A hacky area where the inliner can retain history about inlining decisions that mutated the call grap...
Definition: CGSCCPassManager.h:317
llvm::SmallPriorityWorklist
A version of PriorityWorklist that selects small size optimized data structures for the vector and ma...
Definition: PriorityWorklist.h:256
move
compiles ldr LCPI1_0 ldr ldr mov lsr tst moveq r1 ldr LCPI1_1 and r0 bx lr It would be better to do something like to fold the shift into the conditional move
Definition: README.txt:546
llvm::AnalysisKey
A special type used by analysis passes to provide an address that identifies that particular analysis...
Definition: PassManager.h:72
llvm::ModuleToPostOrderCGSCCPassAdaptor::ModuleToPostOrderCGSCCPassAdaptor
ModuleToPostOrderCGSCCPassAdaptor(std::unique_ptr< PassConceptT > Pass)
Definition: CGSCCPassManager.h:346
llvm::CGSCCUpdateResult::CWorklist
SmallPriorityWorklist< LazyCallGraph::SCC *, 1 > & CWorklist
Worklist of the SCCs queued for processing.
Definition: CGSCCPassManager.h:257
llvm::detail::PassConcept
Template for the abstract base class used to dispatch polymorphically over pass objects.
Definition: PassManagerInternal.h:37
llvm::InnerAnalysisManagerProxy::Result::invalidate
bool invalidate(IRUnitT &IR, const PreservedAnalyses &PA, typename AnalysisManager< IRUnitT, ExtraArgTs... >::Invalidator &Inv)
Handler for invalidation of the outer IR unit, IRUnitT.
assert
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
llvm::CGSCCAnalysisManager
AnalysisManager< LazyCallGraph::SCC, LazyCallGraph & > CGSCCAnalysisManager
The CGSCC analysis manager.
Definition: CGSCCPassManager.h:129
llvm::move
OutputIt move(R &&Range, OutputIt Out)
Provide wrappers to std::move which take ranges instead of having to pass begin/end explicitly.
Definition: STLExtras.h:1540
std::swap
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
Definition: BitVector.h:840
llvm::createDevirtSCCRepeatedPass
DevirtSCCRepeatedPass createDevirtSCCRepeatedPass(CGSCCPassT Pass, int MaxIterations)
A function to deduce a function pass type and wrap it in the templated adaptor.
Definition: CGSCCPassManager.h:551
llvm::FunctionAnalysisManagerCGSCCProxy::Result::updateFAM
void updateFAM(FunctionAnalysisManager &FAM)
Definition: CGSCCPassManager.h:400
llvm::Module
A Module instance is used to store all the information related to an LLVM module.
Definition: Module.h:67
llvm::AnalysisInfoMixin
A CRTP mix-in that provides informational APIs needed for analysis passes.
Definition: PassManager.h:391
llvm::LazyCallGraph::Node
A node in the call graph.
Definition: LazyCallGraph.h:317
llvm::AMDGPU::CPol::SCC
@ SCC
Definition: SIDefines.h:285
llvm::CGSCCUpdateResult::CrossSCCPA
PreservedAnalyses CrossSCCPA
Preserved analyses across SCCs.
Definition: CGSCCPassManager.h:308
llvm::CGSCCAnalysisManagerModuleProxy::Result::getManager
CGSCCAnalysisManager & getManager()
Accessor for the analysis manager.
Definition: CGSCCPassManager.h:179
llvm::FunctionAnalysisManagerCGSCCProxy::Result::Result
Result()
Definition: CGSCCPassManager.h:397
llvm::RequireAnalysisPass< AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, CGSCCUpdateResult & >::run
PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &)
Definition: CGSCCPassManager.h:159
llvm::FunctionStatusAnalysis::Result
Definition: CGSCCPassManager.h:497
llvm::DevirtSCCRepeatedPass::run
PreservedAnalyses run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &UR)
Runs the wrapped pass up to MaxIterations on the SCC, iterating whenever an indirect call is refined.
Definition: CGSCCPassManager.cpp:370
Module
Machine Check Debug Module
Definition: MachineCheckDebugify.cpp:122
llvm::CGSCCToFunctionPassAdaptor::CGSCCToFunctionPassAdaptor
CGSCCToFunctionPassAdaptor(CGSCCToFunctionPassAdaptor &&Arg)
Definition: CGSCCPassManager.h:467
ValueHandle.h
llvm::PassManager
Manages a sequence of passes over a particular unit of IR.
Definition: PassManager.h:466
llvm::CGSCCUpdateResult
Support structure for SCC passes to communicate updates the call graph back to the CGSCC pass manager...
Definition: CGSCCPassManager.h:232
llvm::CGSCCAnalysisManagerFunctionProxy
OuterAnalysisManagerProxy< CGSCCAnalysisManager, Function > CGSCCAnalysisManagerFunctionProxy
A proxy from a CGSCCAnalysisManager to a Function.
Definition: CGSCCPassManager.h:427
std
Definition: BitVector.h:838
llvm::PreservedAnalyses::all
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: PassManager.h:161
Function.h
llvm::DevirtSCCRepeatedPass::DevirtSCCRepeatedPass
DevirtSCCRepeatedPass(std::unique_ptr< PassConceptT > Pass, int MaxIterations)
Definition: CGSCCPassManager.h:534
llvm::ModuleToPostOrderCGSCCPassAdaptor::run
PreservedAnalyses run(Module &M, ModuleAnalysisManager &AM)
Runs the CGSCC pass across every SCC in the module.
Definition: CGSCCPassManager.cpp:148
PassManager.h
llvm::updateCGAndAnalysisManagerForCGSCCPass
LazyCallGraph::SCC & updateCGAndAnalysisManagerForCGSCCPass(LazyCallGraph &G, LazyCallGraph::SCC &C, LazyCallGraph::Node &N, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, FunctionAnalysisManager &FAM)
Helper to update the call graph after running a CGSCC pass.
Definition: CGSCCPassManager.cpp:1237
llvm::Pass
Pass interface - Implemented by all 'passes'.
Definition: Pass.h:91
SmallVector.h
llvm::detail::PassModel
A template wrapper used to implement the polymorphic API.
Definition: PassManagerInternal.h:66
N
#define N
llvm::CGSCCUpdateResult::UpdatedRC
LazyCallGraph::RefSCC * UpdatedRC
If non-null, the updated current RefSCC being processed.
Definition: CGSCCPassManager.h:283
llvm::SmallPtrSetImpl
A templated base class for SmallPtrSet which provides the typesafe interface that is common across al...
Definition: SmallPtrSet.h:343
llvm::AnalysisManager
A container for analyses that lazily runs them and caches their results.
Definition: InstructionSimplify.h:44
llvm::InnerAnalysisManagerProxy
An analysis over an "outer" IR unit that provides access to an analysis manager over an "inner" IR un...
Definition: PassManager.h:926
llvm::RequireAnalysisPass
A utility pass template to force an analysis result to be available.
Definition: PassManager.h:1230
llvm::LazyCallGraph
A lazily constructed view of the call graph of a module.
Definition: LazyCallGraph.h:112
raw_ostream.h
llvm::FunctionAnalysisManagerCGSCCProxy::Result::getManager
FunctionAnalysisManager & getManager()
Accessor for the analysis manager.
Definition: CGSCCPassManager.h:402
llvm::FunctionAnalysisManagerCGSCCProxy
A proxy from a FunctionAnalysisManager to an SCC.
Definition: CGSCCPassManager.h:392
llvm::CGSCCUpdateResult::InvalidatedRefSCCs
SmallPtrSetImpl< LazyCallGraph::RefSCC * > & InvalidatedRefSCCs
The set of invalidated RefSCCs which should be skipped if they are found in RCWorklist.
Definition: CGSCCPassManager.h:265
llvm::InnerAnalysisManagerProxy::run
Result run(IRUnitT &IR, AnalysisManager< IRUnitT, ExtraArgTs... > &AM, ExtraArgTs...)
Run the analysis pass and create our proxy result object.
Definition: PassManager.h:989
Debug.h
llvm::CGSCCUpdateResult::RCWorklist
SmallPriorityWorklist< LazyCallGraph::RefSCC *, 1 > & RCWorklist
Worklist of the RefSCCs queued for processing.
Definition: CGSCCPassManager.h:242