LLVM  14.0.0git
LoopPassManager.cpp
Go to the documentation of this file.
1 //===- LoopPassManager.cpp - Loop pass management -------------------------===//
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 
18 #include "llvm/Support/Debug.h"
20 
21 using namespace llvm;
22 
23 namespace llvm {
24 
25 /// Explicitly specialize the pass manager's run method to handle loop nest
26 /// structure updates.
31  // Runs loop-nest passes only when the current loop is a top-level one.
32  PreservedAnalyses PA = (L.isOutermost() && !LoopNestPasses.empty())
33  ? runWithLoopNestPasses(L, AM, AR, U)
34  : runWithoutLoopNestPasses(L, AM, AR, U);
35 
36  // Invalidation for the current loop should be handled above, and other loop
37  // analysis results shouldn't be impacted by runs over this loop. Therefore,
38  // the remaining analysis results in the AnalysisManager are preserved. We
39  // mark this with a set so that we don't need to inspect each one
40  // individually.
41  // FIXME: This isn't correct! This loop and all nested loops' analyses should
42  // be preserved, but unrolling should invalidate the parent loop's analyses.
44 
45  return PA;
46 }
47 
49  LPMUpdater &>::printPipeline(raw_ostream &OS,
51  MapClassName2PassName) {
52  assert(LoopPasses.size() + LoopNestPasses.size() == IsLoopNestPass.size());
53 
54  unsigned IdxLP = 0, IdxLNP = 0;
55  for (unsigned Idx = 0, Size = IsLoopNestPass.size(); Idx != Size; ++Idx) {
56  if (IsLoopNestPass[Idx]) {
57  auto *P = LoopNestPasses[IdxLNP++].get();
58  P->printPipeline(OS, MapClassName2PassName);
59  } else {
60  auto *P = LoopPasses[IdxLP++].get();
61  P->printPipeline(OS, MapClassName2PassName);
62  }
63  if (Idx + 1 < Size)
64  OS << ",";
65  }
66 }
67 
68 // Run both loop passes and loop-nest passes on top-level loop \p L.
72  LPMUpdater &U) {
73  assert(L.isOutermost() &&
74  "Loop-nest passes should only run on top-level loops.");
76 
77  // Request PassInstrumentation from analysis manager, will use it to run
78  // instrumenting callbacks for the passes later.
80 
81  unsigned LoopPassIndex = 0, LoopNestPassIndex = 0;
82 
83  // `LoopNestPtr` points to the `LoopNest` object for the current top-level
84  // loop and `IsLoopNestPtrValid` indicates whether the pointer is still valid.
85  // The `LoopNest` object will have to be re-constructed if the pointer is
86  // invalid when encountering a loop-nest pass.
87  std::unique_ptr<LoopNest> LoopNestPtr;
88  bool IsLoopNestPtrValid = false;
89 
90  for (size_t I = 0, E = IsLoopNestPass.size(); I != E; ++I) {
92  if (!IsLoopNestPass[I]) {
93  // The `I`-th pass is a loop pass.
94  auto &Pass = LoopPasses[LoopPassIndex++];
95  PassPA = runSinglePass(L, Pass, AM, AR, U, PI);
96  } else {
97  // The `I`-th pass is a loop-nest pass.
98  auto &Pass = LoopNestPasses[LoopNestPassIndex++];
99 
100  // If the loop-nest object calculated before is no longer valid,
101  // re-calculate it here before running the loop-nest pass.
102  if (!IsLoopNestPtrValid) {
103  LoopNestPtr = LoopNest::getLoopNest(L, AR.SE);
104  IsLoopNestPtrValid = true;
105  }
106  PassPA = runSinglePass(*LoopNestPtr, Pass, AM, AR, U, PI);
107  }
108 
109  // `PassPA` is `None` means that the before-pass callbacks in
110  // `PassInstrumentation` return false. The pass does not run in this case,
111  // so we can skip the following procedure.
112  if (!PassPA)
113  continue;
114 
115  // If the loop was deleted, abort the run and return to the outer walk.
116  if (U.skipCurrentLoop()) {
117  PA.intersect(std::move(*PassPA));
118  break;
119  }
120 
121  // Update the analysis manager as each pass runs and potentially
122  // invalidates analyses.
123  AM.invalidate(L, *PassPA);
124 
125  // Finally, we intersect the final preserved analyses to compute the
126  // aggregate preserved set for this pass manager.
127  PA.intersect(std::move(*PassPA));
128 
129  // Check if the current pass preserved the loop-nest object or not.
130  IsLoopNestPtrValid &= PassPA->getChecker<LoopNestAnalysis>().preserved();
131 
132  // After running the loop pass, the parent loop might change and we need to
133  // notify the updater, otherwise U.ParentL might gets outdated and triggers
134  // assertion failures in addSiblingLoops and addChildLoops.
135  U.setParentLoop(L.getParentLoop());
136  }
137  return PA;
138 }
139 
140 // Run all loop passes on loop \p L. Loop-nest passes don't run either because
141 // \p L is not a top-level one or simply because there are no loop-nest passes
142 // in the pass manager at all.
146  LPMUpdater &U) {
148 
149  // Request PassInstrumentation from analysis manager, will use it to run
150  // instrumenting callbacks for the passes later.
152  for (auto &Pass : LoopPasses) {
153  Optional<PreservedAnalyses> PassPA = runSinglePass(L, Pass, AM, AR, U, PI);
154 
155  // `PassPA` is `None` means that the before-pass callbacks in
156  // `PassInstrumentation` return false. The pass does not run in this case,
157  // so we can skip the following procedure.
158  if (!PassPA)
159  continue;
160 
161  // If the loop was deleted, abort the run and return to the outer walk.
162  if (U.skipCurrentLoop()) {
163  PA.intersect(std::move(*PassPA));
164  break;
165  }
166 
167  // Update the analysis manager as each pass runs and potentially
168  // invalidates analyses.
169  AM.invalidate(L, *PassPA);
170 
171  // Finally, we intersect the final preserved analyses to compute the
172  // aggregate preserved set for this pass manager.
173  PA.intersect(std::move(*PassPA));
174 
175  // After running the loop pass, the parent loop might change and we need to
176  // notify the updater, otherwise U.ParentL might gets outdated and triggers
177  // assertion failures in addSiblingLoops and addChildLoops.
178  U.setParentLoop(L.getParentLoop());
179  }
180  return PA;
181 }
182 } // namespace llvm
183 
184 void FunctionToLoopPassAdaptor::printPipeline(
185  raw_ostream &OS, function_ref<StringRef(StringRef)> MapClassName2PassName) {
186  OS << (UseMemorySSA ? "loop-mssa(" : "loop(");
187  Pass->printPipeline(OS, MapClassName2PassName);
188  OS << ")";
189 }
192  // Before we even compute any loop analyses, first run a miniature function
193  // pass pipeline to put loops into their canonical form. Note that we can
194  // directly build up function analyses after this as the function pass
195  // manager handles all the invalidation at that layer.
197 
199  // Check the PassInstrumentation's BeforePass callbacks before running the
200  // canonicalization pipeline.
201  if (PI.runBeforePass<Function>(LoopCanonicalizationFPM, F)) {
202  PA = LoopCanonicalizationFPM.run(F, AM);
203  PI.runAfterPass<Function>(LoopCanonicalizationFPM, F, PA);
204  }
205 
206  // Get the loop structure for this function
207  LoopInfo &LI = AM.getResult<LoopAnalysis>(F);
208 
209  // If there are no loops, there is nothing to do here.
210  if (LI.empty())
211  return PA;
212 
213  // Get the analysis results needed by loop passes.
214  MemorySSA *MSSA =
215  UseMemorySSA ? (&AM.getResult<MemorySSAAnalysis>(F).getMSSA()) : nullptr;
216  BlockFrequencyInfo *BFI = UseBlockFrequencyInfo && F.hasProfileData()
218  : nullptr;
219  BranchProbabilityInfo *BPI =
220  UseBranchProbabilityInfo && F.hasProfileData()
222  : nullptr;
226  AM.getResult<LoopAnalysis>(F),
230  BFI,
231  BPI,
232  MSSA};
233 
234  // Setup the loop analysis manager from its proxy. It is important that
235  // this is only done when there are loops to process and we have built the
236  // LoopStandardAnalysisResults object. The loop analyses cached in this
237  // manager have access to those analysis results and so it must invalidate
238  // itself when they go away.
239  auto &LAMFP = AM.getResult<LoopAnalysisManagerFunctionProxy>(F);
240  if (UseMemorySSA)
241  LAMFP.markMSSAUsed();
242  LoopAnalysisManager &LAM = LAMFP.getManager();
243 
244  // A postorder worklist of loops to process.
246 
247  // Register the worklist and loop analysis manager so that loop passes can
248  // update them when they mutate the loop nest structure.
249  LPMUpdater Updater(Worklist, LAM, LoopNestMode);
250 
251  // Add the loop nests in the reverse order of LoopInfo. See method
252  // declaration.
253  if (!LoopNestMode) {
254  appendLoopsToWorklist(LI, Worklist);
255  } else {
256  for (Loop *L : LI)
257  Worklist.insert(L);
258  }
259 
260 #ifndef NDEBUG
261  PI.pushBeforeNonSkippedPassCallback([&LAR, &LI](StringRef PassID, Any IR) {
262  if (isSpecialPass(PassID, {"PassManager"}))
263  return;
264  assert(any_isa<const Loop *>(IR) || any_isa<const LoopNest *>(IR));
265  const Loop *L = any_isa<const Loop *>(IR)
266  ? any_cast<const Loop *>(IR)
267  : &any_cast<const LoopNest *>(IR)->getOutermostLoop();
268  assert(L && "Loop should be valid for printing");
269 
270  // Verify the loop structure and LCSSA form before visiting the loop.
271  L->verifyLoop();
272  assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) &&
273  "Loops must remain in LCSSA form!");
274  });
275 #endif
276 
277  do {
278  Loop *L = Worklist.pop_back_val();
279  assert(!(LoopNestMode && L->getParentLoop()) &&
280  "L should be a top-level loop in loop-nest mode.");
281 
282  // Reset the update structure for this loop.
283  Updater.CurrentL = L;
284  Updater.SkipCurrentLoop = false;
285 
286 #ifndef NDEBUG
287  // Save a parent loop pointer for asserts.
288  Updater.ParentL = L->getParentLoop();
289 #endif
290  // Check the PassInstrumentation's BeforePass callbacks before running the
291  // pass, skip its execution completely if asked to (callback returns
292  // false).
293  if (!PI.runBeforePass<Loop>(*Pass, *L))
294  continue;
295 
296  PreservedAnalyses PassPA;
297  {
298  TimeTraceScope TimeScope(Pass->name());
299  PassPA = Pass->run(*L, LAM, LAR, Updater);
300  }
301 
302  // Do not pass deleted Loop into the instrumentation.
303  if (Updater.skipCurrentLoop())
304  PI.runAfterPassInvalidated<Loop>(*Pass, PassPA);
305  else
306  PI.runAfterPass<Loop>(*Pass, *L, PassPA);
307 
308  if (LAR.MSSA && !PassPA.getChecker<MemorySSAAnalysis>().preserved())
309  report_fatal_error("Loop pass manager using MemorySSA contains a pass "
310  "that does not preserve MemorySSA");
311 
312 #ifndef NDEBUG
313  // LoopAnalysisResults should always be valid.
314  // Note that we don't LAR.SE.verify() because that can change observed SE
315  // queries. See PR44815.
316  if (VerifyDomInfo)
317  LAR.DT.verify();
318  if (VerifyLoopInfo)
319  LAR.LI.verify(LAR.DT);
320  if (LAR.MSSA && VerifyMemorySSA)
321  LAR.MSSA->verifyMemorySSA();
322 #endif
323 
324  // If the loop hasn't been deleted, we need to handle invalidation here.
325  if (!Updater.skipCurrentLoop())
326  // We know that the loop pass couldn't have invalidated any other
327  // loop's analyses (that's the contract of a loop pass), so directly
328  // handle the loop analysis manager's invalidation here.
329  LAM.invalidate(*L, PassPA);
330 
331  // Then intersect the preserved set so that invalidation of module
332  // analyses will eventually occur when the module pass completes.
333  PA.intersect(std::move(PassPA));
334  } while (!Worklist.empty());
335 
336 #ifndef NDEBUG
338 #endif
339 
340  // By definition we preserve the proxy. We also preserve all analyses on
341  // Loops. This precludes *any* invalidation of loop analyses by the proxy,
342  // but that's OK because we've taken care to invalidate analyses in the
343  // loop analysis manager incrementally above.
344  PA.preserveSet<AllAnalysesOn<Loop>>();
345  PA.preserve<LoopAnalysisManagerFunctionProxy>();
346  // We also preserve the set of standard analyses.
347  PA.preserve<DominatorTreeAnalysis>();
348  PA.preserve<LoopAnalysis>();
349  PA.preserve<ScalarEvolutionAnalysis>();
350  if (UseBlockFrequencyInfo && F.hasProfileData())
351  PA.preserve<BlockFrequencyAnalysis>();
352  if (UseBranchProbabilityInfo && F.hasProfileData())
353  PA.preserve<BranchProbabilityAnalysis>();
354  if (UseMemorySSA)
355  PA.preserve<MemorySSAAnalysis>();
356  return PA;
357 }
358 
360 PrintLoopPass::PrintLoopPass(raw_ostream &OS, const std::string &Banner)
361  : OS(OS), Banner(Banner) {}
362 
365  LPMUpdater &) {
366  printLoop(L, OS, Banner);
367  return PreservedAnalyses::all();
368 }
llvm::Check::Size
@ Size
Definition: FileCheck.h:73
llvm::PreservedAnalyses
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:155
AssumptionCache.h
llvm::AAManager
A manager for alias analyses.
Definition: AliasAnalysis.h:1288
llvm::TargetIRAnalysis
Analysis pass providing the TargetTransformInfo.
Definition: TargetTransformInfo.h:2372
llvm::ScalarEvolutionAnalysis
Analysis pass that exposes the ScalarEvolution for a function.
Definition: ScalarEvolution.h:2093
llvm
This is an optimization pass for GlobalISel generic memory operations.
Definition: AllocatorList.h:23
llvm::MemorySSA::verifyMemorySSA
void verifyMemorySSA(VerificationLevel=VerificationLevel::Fast) const
Verify that MemorySSA is self consistent (IE definitions dominate all uses, uses appear in the right ...
Definition: MemorySSA.cpp:1901
llvm::TimeTraceScope
The TimeTraceScope is a helper class to call the begin and end functions of the time trace profiler.
Definition: TimeProfiler.h:65
llvm::AnalysisManager::getResult
PassT::Result & getResult(IRUnitT &IR, ExtraArgTs... ExtraArgs)
Get the result of an analysis pass for a given IR unit.
Definition: PassManager.h:783
llvm::Function
Definition: Function.h:62
llvm::Loop
Represents a single loop in the control flow graph.
Definition: LoopInfo.h:530
llvm::AnalysisManager::invalidate
void invalidate(IRUnitT &IR, const PreservedAnalyses &PA)
Invalidate cached analyses for an IR unit.
Definition: PassManagerImpl.h:89
P
This currently compiles esp xmm0 movsd esp eax eax esp ret We should use not the dag combiner This is because dagcombine2 needs to be able to see through the X86ISD::Wrapper which DAGCombine can t really do The code for turning x load into a single vector load is target independent and should be moved to the dag combiner The code for turning x load into a vector load can only handle a direct load from a global or a direct load from the stack It should be generalized to handle any load from P
Definition: README-SSE.txt:411
llvm::PriorityWorklist< T, SmallVector< T, N >, SmallDenseMap< T, ptrdiff_t > >::insert
bool insert(const T &X)
Insert a new element into the PriorityWorklist.
Definition: PriorityWorklist.h:91
llvm::LoopInfoBase::verify
void verify(const DominatorTreeBase< BlockT, false > &DomTree) const
Definition: LoopInfoImpl.h:690
llvm::VerifyLoopInfo
bool VerifyLoopInfo
Enable verification of loop info.
Definition: LoopInfo.cpp:54
llvm::AllAnalysesOn
This templated class represents "all analyses that operate over <a particular IR unit>" (e....
Definition: PassManager.h:93
GlobalsModRef.h
llvm::PassInstrumentation::pushBeforeNonSkippedPassCallback
void pushBeforeNonSkippedPassCallback(CallableT C)
Definition: PassInstrumentation.h:308
llvm::LoopStandardAnalysisResults
The adaptor from a function pass to a loop pass computes these analyses and makes them available to t...
Definition: LoopAnalysisManager.h:52
llvm::Optional
Definition: APInt.h:33
llvm::FunctionToLoopPassAdaptor::run
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM)
Runs the loop passes across every loop in the function.
Definition: LoopPassManager.cpp:190
llvm::LoopStandardAnalysisResults::DT
DominatorTree & DT
Definition: LoopAnalysisManager.h:55
BasicAliasAnalysis.h
F
#define F(x, y, z)
Definition: MD5.cpp:56
llvm::dbgs
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
Definition: Debug.cpp:163
llvm::PreservedAnalyses::intersect
void intersect(const PreservedAnalyses &Arg)
Intersect this set with another in place.
Definition: PassManager.h:227
llvm::LoopBase::getParentLoop
LoopT * getParentLoop() const
Return the parent loop if it exists or nullptr for top level loops.
Definition: LoopInfo.h:113
llvm::BranchProbabilityAnalysis
Analysis pass which computes BranchProbabilityInfo.
Definition: BranchProbabilityInfo.h:414
llvm::BlockFrequencyInfo
BlockFrequencyInfo pass uses BlockFrequencyInfoImpl implementation to estimate IR basic block frequen...
Definition: BlockFrequencyInfo.h:37
E
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
llvm::BranchProbabilityInfo
Analysis providing branch probability information.
Definition: BranchProbabilityInfo.h:115
llvm::PriorityWorklist< T, SmallVector< T, N >, SmallDenseMap< T, ptrdiff_t > >::pop_back_val
LLVM_NODISCARD T pop_back_val()
Definition: PriorityWorklist.h:154
TargetLibraryInfo.h
llvm::isSpecialPass
bool isSpecialPass(StringRef PassID, const std::vector< StringRef > &Specials)
Definition: PassInstrumentation.cpp:33
llvm::printLoop
void printLoop(Loop &L, raw_ostream &OS, const std::string &Banner="")
Function to print a loop's contents as LLVM's text IR assembly.
Definition: LoopInfo.cpp:980
llvm::LoopBase::verifyLoop
void verifyLoop() const
Verify loop structure.
Definition: LoopInfoImpl.h:286
llvm::report_fatal_error
void report_fatal_error(Error Err, bool gen_crash_diag=true)
Report a serious error, calling any installed error handler.
Definition: Error.cpp:143
llvm::raw_ostream
This class implements an extremely fast bulk output stream that can only output to a stream.
Definition: raw_ostream.h:53
IR
Statically lint checks LLVM IR
Definition: Lint.cpp:746
llvm::BlockFrequencyAnalysis
Analysis pass which computes BlockFrequencyInfo.
Definition: BlockFrequencyInfo.h:112
llvm::LoopNestAnalysis
This analysis provides information for a loop nest.
Definition: LoopNestAnalysis.h:179
llvm::function_ref
An efficient, type-erasing, non-owning reference to a callable.
Definition: STLExtras.h:168
llvm::PassManager< Loop, LoopAnalysisManager, LoopStandardAnalysisResults &, LPMUpdater & >::runWithLoopNestPasses
PreservedAnalyses runWithLoopNestPasses(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &U)
Definition: LoopPassManager.cpp:70
BranchProbabilityInfo.h
llvm::PassInstrumentation::runAfterPass
void runAfterPass(const PassT &Pass, const IRUnitT &IR, const PreservedAnalyses &PA) const
AfterPass instrumentation point - takes Pass instance that has just been executed and constant refere...
Definition: PassInstrumentation.h:242
llvm::PrintLoopPass::run
PreservedAnalyses run(Loop &L, LoopAnalysisManager &, LoopStandardAnalysisResults &, LPMUpdater &)
Definition: LoopPassManager.cpp:363
llvm::LPMUpdater
This class provides an interface for updating the loop pass manager based on mutations to the loop ne...
Definition: LoopPassManager.h:263
llvm::AssumptionAnalysis
A function analysis which provides an AssumptionCache.
Definition: AssumptionCache.h:173
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::MemorySSA
Encapsulates MemorySSA, including all data associated with memory accesses.
Definition: MemorySSA.h:705
I
#define I(x, y, z)
Definition: MD5.cpp:59
llvm::PassInstrumentation::runAfterPassInvalidated
void runAfterPassInvalidated(const PassT &Pass, const PreservedAnalyses &PA) const
AfterPassInvalidated instrumentation point - takes Pass instance that has just been executed.
Definition: PassInstrumentation.h:253
llvm::PriorityWorklist< T, SmallVector< T, N >, SmallDenseMap< T, ptrdiff_t > >::empty
bool empty() const
Determine if the PriorityWorklist is empty or not.
Definition: PriorityWorklist.h:68
assert
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
llvm::PassInstrumentation
This class provides instrumentation entry points for the Pass Manager, doing calls to callbacks regis...
Definition: PassInstrumentation.h:180
LoopPassManager.h
llvm::MemorySSAAnalysis
An analysis that produces MemorySSA for a function.
Definition: MemorySSA.h:931
llvm::PassInstrumentation::popBeforeNonSkippedPassCallback
void popBeforeNonSkippedPassCallback()
Definition: PassInstrumentation.h:312
llvm::LoopInfo
Definition: LoopInfo.h:1083
llvm::StringRef
StringRef - Represent a constant reference to a string, i.e.
Definition: StringRef.h:57
llvm::appendLoopsToWorklist
void appendLoopsToWorklist(RangeT &&, SmallPriorityWorklist< Loop *, 4 > &)
Utility that implements appending of loops onto a worklist given a range.
Definition: LoopUtils.cpp:1476
llvm::LoopBase::isOutermost
bool isOutermost() const
Return true if the loop does not have a parent (natural) loop.
Definition: LoopInfo.h:168
llvm::LoopStandardAnalysisResults::LI
LoopInfo & LI
Definition: LoopAnalysisManager.h:56
BlockFrequencyInfo.h
llvm::AMDGPUISD::BFI
@ BFI
Definition: AMDGPUISelLowering.h:431
LAM
LoopAnalysisManager LAM
Definition: PassBuilderBindings.cpp:58
llvm::PassManager
Manages a sequence of passes over a particular unit of IR.
Definition: PassManager.h:472
llvm::Any
Definition: Any.h:26
llvm::PassInstrumentation::runBeforePass
bool runBeforePass(const PassT &Pass, const IRUnitT &IR) const
BeforePass instrumentation point - takes Pass instance to be executed and constant reference to IR it...
Definition: PassInstrumentation.h:217
llvm::PrintLoopPass::PrintLoopPass
PrintLoopPass()
Definition: LoopPassManager.cpp:359
llvm::PreservedAnalyses::all
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: PassManager.h:161
llvm::Loop::isRecursivelyLCSSAForm
bool isRecursivelyLCSSAForm(const DominatorTree &DT, const LoopInfo &LI) const
Return true if this Loop and all inner subloops are in LCSSA form.
Definition: LoopInfo.cpp:469
llvm::LPMUpdater::setParentLoop
void setParentLoop(Loop *L)
Definition: LoopPassManager.h:292
ScalarEvolutionAliasAnalysis.h
llvm::LoopStandardAnalysisResults::SE
ScalarEvolution & SE
Definition: LoopAnalysisManager.h:57
llvm::PassManager::run
PreservedAnalyses run(IRUnitT &IR, AnalysisManagerT &AM, ExtraArgTs... ExtraArgs)
Run all of the passes in this manager over the given unit of IR.
Definition: PassManager.h:501
llvm::DominatorTreeAnalysis
Analysis pass which computes a DominatorTree.
Definition: Dominators.h:252
llvm::PassManager< Loop, LoopAnalysisManager, LoopStandardAnalysisResults &, LPMUpdater & >::runWithoutLoopNestPasses
PreservedAnalyses runWithoutLoopNestPasses(Loop &L, LoopAnalysisManager &AM, LoopStandardAnalysisResults &AR, LPMUpdater &U)
Definition: LoopPassManager.cpp:144
llvm::Pass
Pass interface - Implemented by all 'passes'.
Definition: Pass.h:91
MemorySSA.h
llvm::PreservedAnalyses::preserveSet
void preserveSet()
Mark an analysis set as preserved.
Definition: PassManager.h:191
llvm::LoopAnalysisManager
AnalysisManager< Loop, LoopStandardAnalysisResults & > LoopAnalysisManager
The loop analysis manager.
Definition: LoopAnalysisManager.h:76
llvm::DominatorTreeBase::verify
bool verify(VerificationLevel VL=VerificationLevel::Full) const
verify - checks if the tree is correct.
Definition: GenericDomTree.h:802
llvm::LoopStandardAnalysisResults::MSSA
MemorySSA * MSSA
Definition: LoopAnalysisManager.h:62
llvm::LoopInfoBase::empty
bool empty() const
Definition: LoopInfo.h:946
llvm::PreservedAnalyses::getChecker
PreservedAnalysisChecker getChecker() const
Build a checker for this PreservedAnalyses and the specified analysis type.
Definition: PassManager.h:313
llvm::AnalysisManager
A container for analyses that lazily runs them and caches their results.
Definition: InstructionSimplify.h:44
llvm::PassInstrumentationAnalysis
Pseudo-analysis pass that exposes the PassInstrumentation to pass managers.
Definition: PassManager.h:603
llvm::InnerAnalysisManagerProxy
An analysis over an "outer" IR unit that provides access to an analysis manager over an "inner" IR un...
Definition: PassManager.h:940
llvm::LPMUpdater::skipCurrentLoop
bool skipCurrentLoop() const
This can be queried by loop passes which run other loop passes (like pass managers) to know whether t...
Definition: LoopPassManager.h:271
llvm::VerifyMemorySSA
bool VerifyMemorySSA
Enables verification of MemorySSA.
Definition: MemorySSA.cpp:91
llvm::LoopNest::getLoopNest
static std::unique_ptr< LoopNest > getLoopNest(Loop &Root, ScalarEvolution &SE)
Construct a LoopNest object.
Definition: LoopNestAnalysis.cpp:48
TimeProfiler.h
Debug.h
llvm::TargetLibraryAnalysis
Analysis pass providing the TargetLibraryInfo.
Definition: TargetLibraryInfo.h:440
llvm::VerifyDomInfo
bool VerifyDomInfo
Enables verification of dominator trees.
Definition: Dominators.cpp:32
llvm::LoopAnalysis
Analysis pass that exposes the LoopInfo for a function.
Definition: LoopInfo.h:1243