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 
17 #include "llvm/Support/Debug.h"
19 
20 using namespace llvm;
21 
22 namespace llvm {
23 
24 /// Explicitly specialize the pass manager's run method to handle loop nest
25 /// structure updates.
30  // Runs loop-nest passes only when the current loop is a top-level one.
31  PreservedAnalyses PA = (L.isOutermost() && !LoopNestPasses.empty())
32  ? runWithLoopNestPasses(L, AM, AR, U)
33  : runWithoutLoopNestPasses(L, AM, AR, U);
34 
35  // Invalidation for the current loop should be handled above, and other loop
36  // analysis results shouldn't be impacted by runs over this loop. Therefore,
37  // the remaining analysis results in the AnalysisManager are preserved. We
38  // mark this with a set so that we don't need to inspect each one
39  // individually.
40  // FIXME: This isn't correct! This loop and all nested loops' analyses should
41  // be preserved, but unrolling should invalidate the parent loop's analyses.
43 
44  return PA;
45 }
46 
48  LPMUpdater &>::printPipeline(raw_ostream &OS,
50  MapClassName2PassName) {
51  for (unsigned Idx = 0, Size = LoopPasses.size(); Idx != Size; ++Idx) {
52  auto *P = LoopPasses[Idx].get();
53  P->printPipeline(OS, MapClassName2PassName);
54  if (Idx + 1 < Size)
55  OS << ",";
56  }
57 }
58 
59 // Run both loop passes and loop-nest passes on top-level loop \p L.
63  LPMUpdater &U) {
64  assert(L.isOutermost() &&
65  "Loop-nest passes should only run on top-level loops.");
67 
68  // Request PassInstrumentation from analysis manager, will use it to run
69  // instrumenting callbacks for the passes later.
71 
72  unsigned LoopPassIndex = 0, LoopNestPassIndex = 0;
73 
74  // `LoopNestPtr` points to the `LoopNest` object for the current top-level
75  // loop and `IsLoopNestPtrValid` indicates whether the pointer is still valid.
76  // The `LoopNest` object will have to be re-constructed if the pointer is
77  // invalid when encountering a loop-nest pass.
78  std::unique_ptr<LoopNest> LoopNestPtr;
79  bool IsLoopNestPtrValid = false;
80 
81  for (size_t I = 0, E = IsLoopNestPass.size(); I != E; ++I) {
83  if (!IsLoopNestPass[I]) {
84  // The `I`-th pass is a loop pass.
85  auto &Pass = LoopPasses[LoopPassIndex++];
86  PassPA = runSinglePass(L, Pass, AM, AR, U, PI);
87  } else {
88  // The `I`-th pass is a loop-nest pass.
89  auto &Pass = LoopNestPasses[LoopNestPassIndex++];
90 
91  // If the loop-nest object calculated before is no longer valid,
92  // re-calculate it here before running the loop-nest pass.
93  if (!IsLoopNestPtrValid) {
94  LoopNestPtr = LoopNest::getLoopNest(L, AR.SE);
95  IsLoopNestPtrValid = true;
96  }
97  PassPA = runSinglePass(*LoopNestPtr, Pass, AM, AR, U, PI);
98  }
99 
100  // `PassPA` is `None` means that the before-pass callbacks in
101  // `PassInstrumentation` return false. The pass does not run in this case,
102  // so we can skip the following procedure.
103  if (!PassPA)
104  continue;
105 
106  // If the loop was deleted, abort the run and return to the outer walk.
107  if (U.skipCurrentLoop()) {
108  PA.intersect(std::move(*PassPA));
109  break;
110  }
111 
112  // Update the analysis manager as each pass runs and potentially
113  // invalidates analyses.
114  AM.invalidate(L, *PassPA);
115 
116  // Finally, we intersect the final preserved analyses to compute the
117  // aggregate preserved set for this pass manager.
118  PA.intersect(std::move(*PassPA));
119 
120  // Check if the current pass preserved the loop-nest object or not.
121  IsLoopNestPtrValid &= PassPA->getChecker<LoopNestAnalysis>().preserved();
122 
123  // After running the loop pass, the parent loop might change and we need to
124  // notify the updater, otherwise U.ParentL might gets outdated and triggers
125  // assertion failures in addSiblingLoops and addChildLoops.
126  U.setParentLoop(L.getParentLoop());
127  }
128  return PA;
129 }
130 
131 // Run all loop passes on loop \p L. Loop-nest passes don't run either because
132 // \p L is not a top-level one or simply because there are no loop-nest passes
133 // in the pass manager at all.
137  LPMUpdater &U) {
139 
140  // Request PassInstrumentation from analysis manager, will use it to run
141  // instrumenting callbacks for the passes later.
143  for (auto &Pass : LoopPasses) {
144  Optional<PreservedAnalyses> PassPA = runSinglePass(L, Pass, AM, AR, U, PI);
145 
146  // `PassPA` is `None` means that the before-pass callbacks in
147  // `PassInstrumentation` return false. The pass does not run in this case,
148  // so we can skip the following procedure.
149  if (!PassPA)
150  continue;
151 
152  // If the loop was deleted, abort the run and return to the outer walk.
153  if (U.skipCurrentLoop()) {
154  PA.intersect(std::move(*PassPA));
155  break;
156  }
157 
158  // Update the analysis manager as each pass runs and potentially
159  // invalidates analyses.
160  AM.invalidate(L, *PassPA);
161 
162  // Finally, we intersect the final preserved analyses to compute the
163  // aggregate preserved set for this pass manager.
164  PA.intersect(std::move(*PassPA));
165 
166  // After running the loop pass, the parent loop might change and we need to
167  // notify the updater, otherwise U.ParentL might gets outdated and triggers
168  // assertion failures in addSiblingLoops and addChildLoops.
169  U.setParentLoop(L.getParentLoop());
170  }
171  return PA;
172 }
173 } // namespace llvm
174 
175 void FunctionToLoopPassAdaptor::printPipeline(
176  raw_ostream &OS, function_ref<StringRef(StringRef)> MapClassName2PassName) {
177  OS << (UseMemorySSA ? "loop-mssa(" : "loop(");
178  Pass->printPipeline(OS, MapClassName2PassName);
179  OS << ")";
180 }
183  // Before we even compute any loop analyses, first run a miniature function
184  // pass pipeline to put loops into their canonical form. Note that we can
185  // directly build up function analyses after this as the function pass
186  // manager handles all the invalidation at that layer.
188 
190  // Check the PassInstrumentation's BeforePass callbacks before running the
191  // canonicalization pipeline.
192  if (PI.runBeforePass<Function>(LoopCanonicalizationFPM, F)) {
193  PA = LoopCanonicalizationFPM.run(F, AM);
194  PI.runAfterPass<Function>(LoopCanonicalizationFPM, F, PA);
195  }
196 
197  // Get the loop structure for this function
198  LoopInfo &LI = AM.getResult<LoopAnalysis>(F);
199 
200  // If there are no loops, there is nothing to do here.
201  if (LI.empty())
202  return PA;
203 
204  // Get the analysis results needed by loop passes.
205  MemorySSA *MSSA =
206  UseMemorySSA ? (&AM.getResult<MemorySSAAnalysis>(F).getMSSA()) : nullptr;
207  BlockFrequencyInfo *BFI = UseBlockFrequencyInfo && F.hasProfileData()
209  : nullptr;
213  AM.getResult<LoopAnalysis>(F),
217  BFI,
218  MSSA};
219 
220  // Setup the loop analysis manager from its proxy. It is important that
221  // this is only done when there are loops to process and we have built the
222  // LoopStandardAnalysisResults object. The loop analyses cached in this
223  // manager have access to those analysis results and so it must invalidate
224  // itself when they go away.
225  auto &LAMFP = AM.getResult<LoopAnalysisManagerFunctionProxy>(F);
226  if (UseMemorySSA)
227  LAMFP.markMSSAUsed();
228  LoopAnalysisManager &LAM = LAMFP.getManager();
229 
230  // A postorder worklist of loops to process.
232 
233  // Register the worklist and loop analysis manager so that loop passes can
234  // update them when they mutate the loop nest structure.
235  LPMUpdater Updater(Worklist, LAM, LoopNestMode);
236 
237  // Add the loop nests in the reverse order of LoopInfo. See method
238  // declaration.
239  if (!LoopNestMode) {
240  appendLoopsToWorklist(LI, Worklist);
241  } else {
242  for (Loop *L : LI)
243  Worklist.insert(L);
244  }
245 
246 #ifndef NDEBUG
247  PI.pushBeforeNonSkippedPassCallback([&LAR, &LI](StringRef PassID, Any IR) {
248  if (isSpecialPass(PassID, {"PassManager"}))
249  return;
250  assert(any_isa<const Loop *>(IR) || any_isa<const LoopNest *>(IR));
251  const Loop *L = any_isa<const Loop *>(IR)
252  ? any_cast<const Loop *>(IR)
253  : &any_cast<const LoopNest *>(IR)->getOutermostLoop();
254  assert(L && "Loop should be valid for printing");
255 
256  // Verify the loop structure and LCSSA form before visiting the loop.
257  L->verifyLoop();
258  assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) &&
259  "Loops must remain in LCSSA form!");
260  });
261 #endif
262 
263  do {
264  Loop *L = Worklist.pop_back_val();
265  assert(!(LoopNestMode && L->getParentLoop()) &&
266  "L should be a top-level loop in loop-nest mode.");
267 
268  // Reset the update structure for this loop.
269  Updater.CurrentL = L;
270  Updater.SkipCurrentLoop = false;
271 
272 #ifndef NDEBUG
273  // Save a parent loop pointer for asserts.
274  Updater.ParentL = L->getParentLoop();
275 #endif
276  // Check the PassInstrumentation's BeforePass callbacks before running the
277  // pass, skip its execution completely if asked to (callback returns
278  // false).
279  if (!PI.runBeforePass<Loop>(*Pass, *L))
280  continue;
281 
282  PreservedAnalyses PassPA;
283  {
284  TimeTraceScope TimeScope(Pass->name());
285  PassPA = Pass->run(*L, LAM, LAR, Updater);
286  }
287 
288  // Do not pass deleted Loop into the instrumentation.
289  if (Updater.skipCurrentLoop())
290  PI.runAfterPassInvalidated<Loop>(*Pass, PassPA);
291  else
292  PI.runAfterPass<Loop>(*Pass, *L, PassPA);
293 
294  if (LAR.MSSA && !PassPA.getChecker<MemorySSAAnalysis>().preserved())
295  report_fatal_error("Loop pass manager using MemorySSA contains a pass "
296  "that does not preserve MemorySSA");
297 
298 #ifndef NDEBUG
299  // LoopAnalysisResults should always be valid.
300  // Note that we don't LAR.SE.verify() because that can change observed SE
301  // queries. See PR44815.
302  if (VerifyDomInfo)
303  LAR.DT.verify();
304  if (VerifyLoopInfo)
305  LAR.LI.verify(LAR.DT);
306  if (LAR.MSSA && VerifyMemorySSA)
307  LAR.MSSA->verifyMemorySSA();
308 #endif
309 
310  // If the loop hasn't been deleted, we need to handle invalidation here.
311  if (!Updater.skipCurrentLoop())
312  // We know that the loop pass couldn't have invalidated any other
313  // loop's analyses (that's the contract of a loop pass), so directly
314  // handle the loop analysis manager's invalidation here.
315  LAM.invalidate(*L, PassPA);
316 
317  // Then intersect the preserved set so that invalidation of module
318  // analyses will eventually occur when the module pass completes.
319  PA.intersect(std::move(PassPA));
320  } while (!Worklist.empty());
321 
322 #ifndef NDEBUG
324 #endif
325 
326  // By definition we preserve the proxy. We also preserve all analyses on
327  // Loops. This precludes *any* invalidation of loop analyses by the proxy,
328  // but that's OK because we've taken care to invalidate analyses in the
329  // loop analysis manager incrementally above.
330  PA.preserveSet<AllAnalysesOn<Loop>>();
331  PA.preserve<LoopAnalysisManagerFunctionProxy>();
332  // We also preserve the set of standard analyses.
333  PA.preserve<DominatorTreeAnalysis>();
334  PA.preserve<LoopAnalysis>();
335  PA.preserve<ScalarEvolutionAnalysis>();
336  if (UseBlockFrequencyInfo && F.hasProfileData())
337  PA.preserve<BlockFrequencyAnalysis>();
338  if (UseMemorySSA)
339  PA.preserve<MemorySSAAnalysis>();
340  return PA;
341 }
342 
344 PrintLoopPass::PrintLoopPass(raw_ostream &OS, const std::string &Banner)
345  : OS(OS), Banner(Banner) {}
346 
349  LPMUpdater &) {
350  printLoop(L, OS, Banner);
351  return PreservedAnalyses::all();
352 }
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:1233
llvm::TargetIRAnalysis
Analysis pass providing the TargetTransformInfo.
Definition: TargetTransformInfo.h:2331
llvm::ScalarEvolutionAnalysis
Analysis pass that exposes the ScalarEvolution for a function.
Definition: ScalarEvolution.h:2036
llvm
---------------------— PointerInfo ------------------------------------—
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:1899
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:779
llvm::Function
Definition: Function.h:61
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:181
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::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::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:979
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:140
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:744
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:61
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:347
llvm::LPMUpdater
This class provides an interface for updating the loop pass manager based on mutations to the loop ne...
Definition: LoopPassManager.h:249
llvm::AssumptionAnalysis
A function analysis which provides an AssumptionCache.
Definition: AssumptionCache.h:169
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:58
llvm::appendLoopsToWorklist
void appendLoopsToWorklist(RangeT &&, SmallPriorityWorklist< Loop *, 4 > &)
Utility that implements appending of loops onto a worklist given a range.
Definition: LoopUtils.cpp:1429
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:421
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:343
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:468
llvm::LPMUpdater::setParentLoop
void setParentLoop(Loop *L)
Definition: LoopPassManager.h:280
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:135
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:75
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:61
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:599
llvm::InnerAnalysisManagerProxy
An analysis over an "outer" IR unit that provides access to an analysis manager over an "inner" IR un...
Definition: PassManager.h:936
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:257
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:438
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