/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | LoopPassManager.h | 18 /// - LoopInfo 46 #include "llvm/Analysis/LoopInfo.h" 259 LoopInfo &LI = AM.getResult<LoopAnalysis>(F); 295 // Add the loop nests in the reverse order of LoopInfo. See method
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | InstrProfiling.cpp | 23 #include "llvm/Analysis/LoopInfo.h" 196 LoopInfo &LI) 240 LoopInfo &LI; 250 Loop &CurLoop, LoopInfo &LI, BlockFrequencyInfo *BFI) 394 LoopInfo &LI; 477 LoopInfo LI(DT);
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | RegionInfo.h | 64 class LoopInfo; 98 using LoopInfoT = LoopInfo; 496 /// @param LI A pointer to a LoopInfo analysis.
|
H A D | VectorUtils.h | 732 DominatorTree *DT, LoopInfo *LI, 803 LoopInfo *LI;
|
H A D | ScalarEvolution.h | 64 class LoopInfo; 476 DominatorTree &DT, LoopInfo &LI); 1139 LoopInfo &LI;
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachinePipeliner.h | 78 struct LoopInfo { struct in class:llvm::MachinePipeliner 85 LoopInfo LI;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | IndVarSimplify.cpp | 39 #include "llvm/Analysis/LoopInfo.h" 139 LoopInfo *LI; 152 bool simplifyAndExtend(Loop *L, SCEVExpander &Rewriter, LoopInfo *LI); 168 IndVarSimplify(LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, 188 DominatorTree *DT, LoopInfo *LI) { 650 LoopInfo *LI; 706 WidenIV(const WideIVInfo &WI, LoopInfo *LInfo, ScalarEvolution *SEv, 1023 static void truncateIVUse(NarrowIVDefUse DU, DominatorTree *DT, LoopInfo *LI) { 1634 LoopInfo *LI) {
|
H A D | LoopInterchange.cpp | 20 #include "llvm/Analysis/LoopInfo.h" 400 LoopInfo *LI, DominatorTree *DT, 423 LoopInfo *LI; 434 LoopInfo *LI = nullptr; 1150 /// Update LoopInfo, after interchanging. NewInner and NewOuter refer to the 1376 Loop *InnerLoop, LoopInfo *LI) {
|
H A D | LoopVersioningLICM.cpp | 68 #include "llvm/Analysis/LoopInfo.h" 590 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
H A D | LoopPredication.cpp | 184 #include "llvm/Analysis/LoopInfo.h" 256 LoopInfo *LI; 312 ScalarEvolution *SE, LoopInfo *LI, 969 static BranchInst *FindWidenableTerminatorAboveLoop(Loop *L, LoopInfo &LI) {
|
H A D | InductiveRangeCheckElimination.cpp | 57 #include "llvm/Analysis/LoopInfo.h" 236 LoopInfo &LI; 241 LoopInfo &LI) 615 LoopInfo &LI; 636 LoopConstrainer(Loop &L, LoopInfo &LI, 1773 LoopInfo &LI = AM.getResult<LoopAnalysis>(F);
|
H A D | LoopFuse.cpp | 51 #include "llvm/Analysis/LoopInfo.h" 440 /// given function (specified by the LoopInfo object). It starts at the 447 LoopDepthTree(LoopInfo &LI) : Depth(1) { 512 LoopInfo &LI; 520 LoopFuser(LoopInfo &LI, DominatorTree &DT, DependenceInfo &DI,
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopUnrollPeel.cpp | 19 #include "llvm/Analysis/LoopInfo.h" 497 LoopInfo *LI) { 534 // to preserve LoopInfo. 611 bool llvm::peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI,
|
H A D | LoopVersioning.cpp | 18 #include "llvm/Analysis/LoopInfo.h" 35 LoopVersioning::LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
|
H A D | LoopUnrollAndJam.cpp | 28 #include "llvm/Analysis/LoopInfo.h" 225 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, 612 // Update LoopInfo if the loop is completely removed. 769 DependenceInfo &DI, LoopInfo &LI) { 856 DependenceInfo &DI, LoopInfo &LI) {
|
H A D | LoopUtils.cpp | 27 #include "llvm/Analysis/LoopInfo.h" 67 bool llvm::formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI, 155 // By definition, all loop passes need the LoopInfo analysis and the 524 LoopInfo *LI, MemorySSA *MSSA) { 712 // The last step is to update LoopInfo now that we've eliminated this loop. 713 // Note: LoopInfo::erase remove the given loop and relink its subloops with 1284 int llvm::rewriteLoopExitValues(Loop *L, LoopInfo *LI, TargetLibraryInfo *TLI, 1535 void llvm::appendLoopsToWorklist(LoopInfo &LI, 1541 LoopInfo *LI, LPPassManager *LPM) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | HardwareLoops.cpp | 20 #include "llvm/Analysis/LoopInfo.h" 151 LoopInfo *LI = nullptr; 235 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 25 #include "llvm/Analysis/LoopInfo.h" 398 LoopInfo LI(DT); 935 LoopInfo LI(DT); 1119 LoopInfo LI(DT); 1194 LoopInfo LI(DT);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 62 class LoopInfo; 338 LoopInfo *LI; 347 ProfileSummaryInfo *PSI, const DataLayout &DL, LoopInfo *LI) 363 LoopInfo *getLoopInfo() const { return LI; }
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DDG.cpp | 13 #include "llvm/Analysis/LoopInfo.h" 199 DataDependenceGraph::DataDependenceGraph(Loop &L, LoopInfo &LI,
|
H A D | LegacyDivergenceAnalysis.cpp | 191 // LoopInfo, which only recognizes natural loops. 318 const LoopInfo>(FuncRPOT, LI);
|
H A D | TargetTransformInfo.cpp | 47 bool HardwareLoopInfo::canAnalyze(LoopInfo &LI) { 149 LoopInfo &LI, DominatorTree &DT, 315 Loop *L, LoopInfo *LI, ScalarEvolution &SE, AssumptionCache &AC, 365 ScalarEvolution *SE, LoopInfo *LI,
|
H A D | BranchProbabilityInfo.cpp | 18 #include "llvm/Analysis/LoopInfo.h" 656 const LoopInfo &LI, 676 // Use LoopInfo if we have it, otherwise fall-back to SCC info to catch 1066 void BranchProbabilityInfo::calculate(const Function &F, const LoopInfo &LI, 1077 // (perhaps cache this info in LoopInfo if we can easily calculate it there?). 1082 // Ignore single-block SCCs since they either aren't loops or LoopInfo will 1155 const LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIAnnotateControlFlow.cpp | 20 #include "llvm/Analysis/LoopInfo.h" 78 LoopInfo *LI;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64FalkorHWPFFix.cpp | 25 #include "llvm/Analysis/LoopInfo.h" 71 FalkorMarkStridedAccesses(LoopInfo &LI, ScalarEvolution &SE) 79 LoopInfo &LI; 130 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|