LLVM 19.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 influences 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/MapVector.h"
93#include "llvm/IR/PassManager.h"
94#include "llvm/IR/ValueHandle.h"
96#include <cassert>
97#include <utility>
98
99namespace llvm {
100
101class Function;
102class Value;
103template <typename T, unsigned int N> class SmallPriorityWorklist;
104struct CGSCCUpdateResult;
105
106class Module;
107
108// Allow debug logging in this inline function.
109#define DEBUG_TYPE "cgscc"
110
111/// Extern template declaration for the analysis set for this IR unit.
112extern template class AllAnalysesOn<LazyCallGraph::SCC>;
113
114extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
115
116/// The CGSCC analysis manager.
117///
118/// See the documentation for the AnalysisManager template for detail
119/// documentation. This type serves as a convenient way to refer to this
120/// construct in the adaptors and proxies used to integrate this into the larger
121/// pass manager infrastructure.
124
125// Explicit specialization and instantiation declarations for the pass manager.
126// See the comments on the definition of the specialization for details on how
127// it differs from the primary template.
128template <>
136
137/// The CGSCC pass manager.
138///
139/// See the documentation for the PassManager template for details. It runs
140/// a sequence of SCC passes over each SCC that the manager is run over. This
141/// type serves as a convenient way to refer to this construct.
145
146/// An explicit specialization of the require analysis template pass.
147template <typename AnalysisT>
150 : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC,
151 CGSCCAnalysisManager, LazyCallGraph &,
152 CGSCCUpdateResult &>> {
155 (void)AM.template getResult<AnalysisT>(C, CG);
156 return PreservedAnalyses::all();
157 }
159 function_ref<StringRef(StringRef)> MapClassName2PassName) {
160 auto ClassName = AnalysisT::name();
161 auto PassName = MapClassName2PassName(ClassName);
162 OS << "require<" << PassName << '>';
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.
174public:
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
194private:
195 CGSCCAnalysisManager *InnerAM;
197};
198
199/// Provide a specialized run method for the \c CGSCCAnalysisManagerModuleProxy
200/// so it can pass the lazy call graph to the result.
201template <>
204
205// Ensure the \c CGSCCAnalysisManagerModuleProxy is provided as an extern
206// template.
208
209extern template class OuterAnalysisManagerProxy<
211
212/// A proxy from a \c ModuleAnalysisManager to an \c SCC.
215 LazyCallGraph &>;
216
217/// Support structure for SCC passes to communicate updates the call graph back
218/// to the CGSCC pass manager infrastructure.
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 SCC being processed.
276 ///
277 /// This is set when a graph refinement takes place and the "current" point
278 /// in the graph moves "down" or earlier in the post-order walk. This will
279 /// often cause the "current" SCC to be a newly created SCC 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 /// Preserved analyses across SCCs.
286 ///
287 /// We specifically want to allow CGSCC passes to mutate ancestor IR
288 /// (changing both the CG structure and the function IR itself). However,
289 /// this means we need to take special care to correctly mark what analyses
290 /// are preserved *across* SCCs. We have to track this out-of-band here
291 /// because within the main `PassManager` infrastructure we need to mark
292 /// everything within an SCC as preserved in order to avoid repeatedly
293 /// invalidating the same analyses as we unnest pass managers and adaptors.
294 /// So we track the cross-SCC version of the preserved analyses here from any
295 /// code that does direct invalidation of SCC analyses, and then use it
296 /// whenever we move forward in the post-order walk of SCCs before running
297 /// passes over the new SCC.
299
300 /// A hacky area where the inliner can retain history about inlining
301 /// decisions that mutated the call graph's SCC structure in order to avoid
302 /// infinite inlining. See the comments in the inliner's CG update logic.
303 ///
304 /// FIXME: Keeping this here seems like a big layering issue, we should look
305 /// for a better technique.
308
309 /// Functions that a pass has considered to be dead to be removed at the end
310 /// of the call graph walk in batch.
312
313 /// Weak VHs to keep track of indirect calls for the purposes of detecting
314 /// devirtualization.
315 ///
316 /// This is a map to avoid having duplicate entries. If a Value is
317 /// deallocated, its corresponding WeakTrackingVH will be nulled out. When
318 /// checking if a Value is in the map or not, also check if the corresponding
319 /// WeakTrackingVH is null to avoid issues with a new Value sharing the same
320 /// address as a deallocated one.
322};
323
324/// The core module pass which does a post-order walk of the SCCs and
325/// runs a CGSCC pass over each one.
326///
327/// Designed to allow composition of a CGSCCPass(Manager) and
328/// a ModulePassManager. Note that this pass must be run with a module analysis
329/// manager as it uses the LazyCallGraph analysis. It will also run the
330/// \c CGSCCAnalysisManagerModuleProxy analysis prior to running the CGSCC
331/// pass over the module to enable a \c FunctionAnalysisManager to be used
332/// within this run safely.
334 : public PassInfoMixin<ModuleToPostOrderCGSCCPassAdaptor> {
335public:
339
340 explicit ModuleToPostOrderCGSCCPassAdaptor(std::unique_ptr<PassConceptT> Pass)
341 : Pass(std::move(Pass)) {}
342
344 : Pass(std::move(Arg.Pass)) {}
345
348 std::swap(LHS.Pass, RHS.Pass);
349 }
350
353 swap(*this, RHS);
354 return *this;
355 }
356
357 /// Runs the CGSCC pass across every SCC in the module.
359
361 function_ref<StringRef(StringRef)> MapClassName2PassName) {
362 OS << "cgscc(";
363 Pass->printPipeline(OS, MapClassName2PassName);
364 OS << ')';
365 }
366
367 static bool isRequired() { return true; }
368
369private:
370 std::unique_ptr<PassConceptT> Pass;
371};
372
373/// A function to deduce a function pass type and wrap it in the
374/// templated adaptor.
375template <typename CGSCCPassT>
376ModuleToPostOrderCGSCCPassAdaptor
378 using PassModelT =
381 // Do not use make_unique, it causes too many template instantiations,
382 // causing terrible compile times.
384 std::unique_ptr<ModuleToPostOrderCGSCCPassAdaptor::PassConceptT>(
385 new PassModelT(std::forward<CGSCCPassT>(Pass))));
386}
387
388/// A proxy from a \c FunctionAnalysisManager to an \c SCC.
389///
390/// When a module pass runs and triggers invalidation, both the CGSCC and
391/// Function analysis manager proxies on the module get an invalidation event.
392/// We don't want to fully duplicate responsibility for most of the
393/// invalidation logic. Instead, this layer is only responsible for SCC-local
394/// invalidation events. We work with the module's FunctionAnalysisManager to
395/// invalidate function analyses.
397 : public AnalysisInfoMixin<FunctionAnalysisManagerCGSCCProxy> {
398public:
399 class Result {
400 public:
401 explicit Result() : FAM(nullptr) {}
402 explicit Result(FunctionAnalysisManager &FAM) : FAM(&FAM) {}
403
404 void updateFAM(FunctionAnalysisManager &FAM) { this->FAM = &FAM; }
405 /// Accessor for the analysis manager.
407 assert(FAM);
408 return *FAM;
409 }
410
413
414 private:
416 };
417
418 /// Computes the \c FunctionAnalysisManager and stores it in the result proxy.
420
421private:
423
424 static AnalysisKey Key;
425};
426
427extern template class OuterAnalysisManagerProxy<CGSCCAnalysisManager, Function>;
428
429/// A proxy from a \c CGSCCAnalysisManager to a \c Function.
432
433/// Helper to update the call graph after running a function pass.
434///
435/// Function passes can only mutate the call graph in specific ways. This
436/// routine provides a helper that updates the call graph in those ways
437/// including returning whether any changes were made and populating a CG
438/// update result struct for the overall CGSCC walk.
443
444/// Helper to update the call graph after running a CGSCC pass.
445///
446/// CGSCC passes can only mutate the call graph in specific ways. This
447/// routine provides a helper that updates the call graph in those ways
448/// including returning whether any changes were made and populating a CG
449/// update result struct for the overall CGSCC walk.
454
455/// Adaptor that maps from a SCC to its functions.
456///
457/// Designed to allow composition of a FunctionPass(Manager) and
458/// a CGSCCPassManager. Note that if this pass is constructed with a pointer
459/// to a \c CGSCCAnalysisManager it will run the
460/// \c FunctionAnalysisManagerCGSCCProxy analysis prior to running the function
461/// pass over the SCC to enable a \c FunctionAnalysisManager to be used
462/// within this run safely.
465public:
467
468 explicit CGSCCToFunctionPassAdaptor(std::unique_ptr<PassConceptT> Pass,
469 bool EagerlyInvalidate, bool NoRerun)
470 : Pass(std::move(Pass)), EagerlyInvalidate(EagerlyInvalidate),
471 NoRerun(NoRerun) {}
472
474 : Pass(std::move(Arg.Pass)), EagerlyInvalidate(Arg.EagerlyInvalidate),
475 NoRerun(Arg.NoRerun) {}
476
479 std::swap(LHS.Pass, RHS.Pass);
480 }
481
483 swap(*this, RHS);
484 return *this;
485 }
486
487 /// Runs the function pass across every function in the module.
490
492 function_ref<StringRef(StringRef)> MapClassName2PassName) {
493 OS << "function";
494 if (EagerlyInvalidate || NoRerun) {
495 OS << "<";
496 if (EagerlyInvalidate)
497 OS << "eager-inv";
498 if (EagerlyInvalidate && NoRerun)
499 OS << ";";
500 if (NoRerun)
501 OS << "no-rerun";
502 OS << ">";
503 }
504 OS << '(';
505 Pass->printPipeline(OS, MapClassName2PassName);
506 OS << ')';
507 }
508
509 static bool isRequired() { return true; }
510
511private:
512 std::unique_ptr<PassConceptT> Pass;
513 bool EagerlyInvalidate;
514 bool NoRerun;
515};
516
517/// A function to deduce a function pass type and wrap it in the
518/// templated adaptor.
519template <typename FunctionPassT>
520CGSCCToFunctionPassAdaptor
522 bool EagerlyInvalidate = false,
523 bool NoRerun = false) {
524 using PassModelT =
526 // Do not use make_unique, it causes too many template instantiations,
527 // causing terrible compile times.
529 std::unique_ptr<CGSCCToFunctionPassAdaptor::PassConceptT>(
530 new PassModelT(std::forward<FunctionPassT>(Pass))),
531 EagerlyInvalidate, NoRerun);
532}
533
534// A marker to determine if function passes should be run on a function within a
535// CGSCCToFunctionPassAdaptor. This is used to prevent running an expensive
536// function pass (manager) on a function multiple times if SCC mutations cause a
537// function to be visited multiple times and the function is not modified by
538// other SCC passes.
541public:
543 struct Result {};
544
546};
547
548/// A helper that repeats an SCC pass each time an indirect call is refined to
549/// a direct call by that pass.
550///
551/// While the CGSCC pass manager works to re-visit SCCs and RefSCCs as they
552/// change shape, we may also want to repeat an SCC pass if it simply refines
553/// an indirect call to a direct call, even if doing so does not alter the
554/// shape of the graph. Note that this only pertains to direct calls to
555/// functions where IPO across the SCC may be able to compute more precise
556/// results. For intrinsics, we assume scalar optimizations already can fully
557/// reason about them.
558///
559/// This repetition has the potential to be very large however, as each one
560/// might refine a single call site. As a consequence, in practice we use an
561/// upper bound on the number of repetitions to limit things.
563public:
567
568 explicit DevirtSCCRepeatedPass(std::unique_ptr<PassConceptT> Pass,
569 int MaxIterations)
570 : Pass(std::move(Pass)), MaxIterations(MaxIterations) {}
571
572 /// Runs the wrapped pass up to \c MaxIterations on the SCC, iterating
573 /// whenever an indirect call is refined.
576
578 function_ref<StringRef(StringRef)> MapClassName2PassName) {
579 OS << "devirt<" << MaxIterations << ">(";
580 Pass->printPipeline(OS, MapClassName2PassName);
581 OS << ')';
582 }
583
584private:
585 std::unique_ptr<PassConceptT> Pass;
586 int MaxIterations;
587};
588
589/// A function to deduce a function pass type and wrap it in the
590/// templated adaptor.
591template <typename CGSCCPassT>
593 int MaxIterations) {
594 using PassModelT =
597 // Do not use make_unique, it causes too many template instantiations,
598 // causing terrible compile times.
600 std::unique_ptr<DevirtSCCRepeatedPass::PassConceptT>(
601 new PassModelT(std::forward<CGSCCPassT>(Pass))),
602 MaxIterations);
603}
604
605// Clear out the debug logging macro.
606#undef DEBUG_TYPE
607
608} // end namespace llvm
609
610#endif // LLVM_ANALYSIS_CGSCCPASSMANAGER_H
Implements a lazy call graph analysis and related passes for the new pass manager.
#define F(x, y, z)
Definition: MD5.cpp:55
#define G(x, y, z)
Definition: MD5.cpp:56
Machine Check Debug Module
This file implements a map that provides insertion order iteration.
FunctionAnalysisManager FAM
This header defines various interfaces for pass management in LLVM.
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
raw_pwrite_stream & OS
static const char PassName[]
Value * RHS
Value * LHS
API to communicate dependencies between analyses during invalidation.
Definition: PassManager.h:281
A container for analyses that lazily runs them and caches their results.
Definition: PassManager.h:242
CGSCCAnalysisManager & getManager()
Accessor for the analysis manager.
Result(CGSCCAnalysisManager &InnerAM, LazyCallGraph &G)
Adaptor that maps from a SCC to its functions.
CGSCCToFunctionPassAdaptor(std::unique_ptr< PassConceptT > Pass, bool EagerlyInvalidate, bool NoRerun)
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
CGSCCToFunctionPassAdaptor & operator=(CGSCCToFunctionPassAdaptor RHS)
CGSCCToFunctionPassAdaptor(CGSCCToFunctionPassAdaptor &&Arg)
friend void swap(CGSCCToFunctionPassAdaptor &LHS, CGSCCToFunctionPassAdaptor &RHS)
A helper that repeats an SCC pass each time an indirect call is refined to a direct call by that pass...
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
DevirtSCCRepeatedPass(std::unique_ptr< PassConceptT > Pass, int MaxIterations)
bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA, CGSCCAnalysisManager::Invalidator &Inv)
void updateFAM(FunctionAnalysisManager &FAM)
FunctionAnalysisManager & getManager()
Accessor for the analysis manager.
A proxy from a FunctionAnalysisManager to an SCC.
Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &)
Computes the FunctionAnalysisManager and stores it in the result proxy.
bool invalidate(IRUnitT &IR, const PreservedAnalyses &PA, typename AnalysisManager< IRUnitT, ExtraArgTs... >::Invalidator &Inv)
Handler for invalidation of the outer IR unit, IRUnitT.
An analysis over an "outer" IR unit that provides access to an analysis manager over an "inner" IR un...
Definition: PassManager.h:552
Result run(IRUnitT &IR, AnalysisManager< IRUnitT, ExtraArgTs... > &AM, ExtraArgTs...)
Run the analysis pass and create our proxy result object.
Definition: PassManager.h:613
A node in the call graph.
An SCC of the call graph.
A lazily constructed view of the call graph of a module.
The core module pass which does a post-order walk of the SCCs and runs a CGSCC pass over each one.
PreservedAnalyses run(Module &M, ModuleAnalysisManager &AM)
Runs the CGSCC pass across every SCC in the module.
ModuleToPostOrderCGSCCPassAdaptor & operator=(ModuleToPostOrderCGSCCPassAdaptor RHS)
ModuleToPostOrderCGSCCPassAdaptor(std::unique_ptr< PassConceptT > Pass)
friend void swap(ModuleToPostOrderCGSCCPassAdaptor &LHS, ModuleToPostOrderCGSCCPassAdaptor &RHS)
ModuleToPostOrderCGSCCPassAdaptor(ModuleToPostOrderCGSCCPassAdaptor &&Arg)
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
A Module instance is used to store all the information related to an LLVM module.
Definition: Module.h:65
An analysis over an "inner" IR unit that provides access to an analysis manager over a "outer" IR uni...
Definition: PassManager.h:677
Manages a sequence of passes over a particular unit of IR.
Definition: PassManager.h:161
Pass interface - Implemented by all 'passes'.
Definition: Pass.h:94
A set of analyses that are preserved following a run of a transformation pass.
Definition: Analysis.h:109
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: Analysis.h:115
Result run(Function &F, FunctionAnalysisManager &FAM)
Implements a dense probed hash-table based set with some number of buckets stored inline.
Definition: DenseSet.h:290
A version of PriorityWorklist that selects small size optimized data structures for the vector and ma...
A templated base class for SmallPtrSet which provides the typesafe interface that is common across al...
Definition: SmallPtrSet.h:321
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
Definition: SmallVector.h:1209
StringRef - Represent a constant reference to a string, i.e.
Definition: StringRef.h:50
An efficient, type-erasing, non-owning reference to a callable.
This class implements an extremely fast bulk output stream that can only output to a stream.
Definition: raw_ostream.h:52
@ C
The default llvm calling convention, compatible with C.
Definition: CallingConv.h:34
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:18
DevirtSCCRepeatedPass createDevirtSCCRepeatedPass(CGSCCPassT &&Pass, int MaxIterations)
A function to deduce a function pass type and wrap it in the templated adaptor.
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.
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.
ModuleToPostOrderCGSCCPassAdaptor createModuleToPostOrderCGSCCPassAdaptor(CGSCCPassT &&Pass)
A function to deduce a function pass type and wrap it in the templated adaptor.
CGSCCToFunctionPassAdaptor createCGSCCToFunctionPassAdaptor(FunctionPassT &&Pass, bool EagerlyInvalidate=false, bool NoRerun=false)
A function to deduce a function pass type and wrap it in the templated adaptor.
AnalysisManager< LazyCallGraph::SCC, LazyCallGraph & > CGSCCAnalysisManager
The CGSCC analysis manager.
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:1849
AnalysisManager< Module > ModuleAnalysisManager
Convenience typedef for the Module analysis manager.
Definition: MIRParser.h:38
Implement std::hash so that hash_code can be used in STL containers.
Definition: BitVector.h:858
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
Definition: BitVector.h:860
#define N
A CRTP mix-in that provides informational APIs needed for analysis passes.
Definition: PassManager.h:91
A special type used by analysis passes to provide an address that identifies that particular analysis...
Definition: Analysis.h:26
Support structure for SCC passes to communicate updates the call graph back to the CGSCC pass manager...
SmallPriorityWorklist< LazyCallGraph::RefSCC *, 1 > & RCWorklist
Worklist of the RefSCCs queued for processing.
SmallMapVector< Value *, WeakTrackingVH, 16 > IndirectVHs
Weak VHs to keep track of indirect calls for the purposes of detecting devirtualization.
SmallPriorityWorklist< LazyCallGraph::SCC *, 1 > & CWorklist
Worklist of the SCCs queued for processing.
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...
SmallVector< Function *, 4 > & DeadFunctions
Functions that a pass has considered to be dead to be removed at the end of the call graph walk in ba...
SmallPtrSetImpl< LazyCallGraph::SCC * > & InvalidatedSCCs
The set of invalidated SCCs which should be skipped if they are found in CWorklist.
SmallPtrSetImpl< LazyCallGraph::RefSCC * > & InvalidatedRefSCCs
The set of invalidated RefSCCs which should be skipped if they are found in RCWorklist.
LazyCallGraph::SCC * UpdatedC
If non-null, the updated current SCC being processed.
PreservedAnalyses CrossSCCPA
Preserved analyses across SCCs.
A CRTP mix-in to automatically provide informational APIs needed for passes.
Definition: PassManager.h:68
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &)
A utility pass template to force an analysis result to be available.
Definition: PassManager.h:863
A MapVector that performs no allocations if smaller than a certain size.
Definition: MapVector.h:254
Template for the abstract base class used to dispatch polymorphically over pass objects.
A template wrapper used to implement the polymorphic API.