| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | BasicBlockUtils.h | 36 class LoopInfo; variable 97 LoopInfo *LI = nullptr, 112 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr); 148 LoopInfo *LI; 160 LoopInfo *LI = nullptr, 252 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr, 284 LoopInfo *LI = nullptr, 288 LoopInfo *LI = nullptr, 303 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr, 307 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr, [all …]
|
| H A D | LoopUtils.h | 35 class LoopInfo; 55 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, 63 bool formDedicatedExitBlocks(Loop *L, DominatorTree *DT, LoopInfo *LI, 73 /// LoopInfo and DominatorTree are required and, since the routine makes no 86 const LoopInfo &LI, ScalarEvolution *SE, 97 /// LoopInfo and DominatorTree are required and preserved. 102 bool formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, 109 /// LoopInfo and DominatorTree are required and preserved. 114 bool formLCSSARecursively(Loop &L, const DominatorTree &DT, const LoopInfo *LI, 147 /// iteration. Takes DomTreeNode, AAResults, LoopInfo, DominatorTre 33 class LoopInfo; global() variable [all...] |
| H A D | UnrollLoop.h | 32 class LoopInfo; 52 BasicBlock *ClonedBB, LoopInfo *LI, 80 LoopUnrollResult UnrollLoop(Loop *L, UnrollLoopOptions ULO, LoopInfo *LI, 91 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC, 97 LoopInfo *LI, ScalarEvolution *SE, 104 DependenceInfo &DI, LoopInfo &LI); 106 void simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI, 153 DominatorTree &DT, LoopInfo *LI, AssumptionCache *AC, 30 class LoopInfo; global() variable
|
| H A D | SimplifyIndVar.h | 28 class LoopInfo; 56 DominatorTree *DT, LoopInfo *LI, 65 LoopInfo *LI, const TargetTransformInfo *TTI, 84 LoopInfo *LI, ScalarEvolution *SE, SCEVExpander &Rewriter, 26 class LoopInfo; global() variable
|
| H A D | MatrixUtils.h | 23 class LoopInfo; variable 75 LoopInfo &LI); 85 LoopInfo &LI);
|
| H A D | LoopVersioning.h | 28 class LoopInfo; variable 48 ArrayRef<RuntimePointerCheck> Checks, Loop *L, LoopInfo *LI, 142 LoopInfo *LI;
|
| H A D | LoopRotationUtils.h | 21 class LoopInfo; variable 33 bool LoopRotation(Loop *L, LoopInfo *LI, const TargetTransformInfo *TTI,
|
| H A D | LoopSimplify.h | 48 class LoopInfo; variable 64 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LoopInfo.h | 1 //===- llvm/Analysis/LoopInfo.h - Natural Loop Calculator -------*- C++ -*-===// 32 class LoopInfo; variable 324 bool isRecursivelyLCSSAForm(const DominatorTree &DT, const LoopInfo &LI, 412 class LoopInfo : public LoopInfoBase<BasicBlock, Loop> { 417 void operator=(const LoopInfo &) = delete; 418 LoopInfo(const LoopInfo &) = delete; 421 LoopInfo() = default; 422 explicit LoopInfo(const DominatorTreeBase<BasicBlock, false> &DomTree); 424 LoopInfo(LoopInf 419 LoopInfo(LoopInfo &&Arg) : BaseT(std::move(static_cast<BaseT &>(Arg))) {} LoopInfo() function [all...] |
| H A D | CFG.h | 27 class LoopInfo; variable 72 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr); 83 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr); 97 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr); 109 const DominatorTree *DT = nullptr, const LoopInfo *LI = nullptr);
|
| H A D | LoopAnalysisManager.h | 18 /// - LoopInfo 43 class LoopInfo; 57 LoopInfo &LI; 84 /// retains a \c LoopInfo reference. 90 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI) in Result() 127 /// If the proxy, \c LoopInfo, and associated analyses are preserved, this 133 /// LoopInfo for this function. 139 LoopInfo *LI; 144 /// so it can pass the \c LoopInfo to the result. 41 class LoopInfo; global() variable
|
| H A D | LoopCacheAnalysis.h | 28 class LoopInfo; variable 53 IndexedReference(Instruction &StoreOrLoadInst, const LoopInfo &LI, 100 bool delinearize(const LoopInfo &LI); 201 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE, 275 const LoopInfo &LI;
|
| H A D | LazyBranchProbabilityInfo.h | 25 class LoopInfo; variable 58 LazyBranchProbabilityInfo(const Function *F, const LoopInfo *LI, in LazyBranchProbabilityInfo() 80 const LoopInfo *LI;
|
| H A D | BlockFrequencyInfo.h | 29 class LoopInfo; variable 46 const LoopInfo &LI); 94 const LoopInfo &LI);
|
| H A D | FunctionPropertiesAnalysis.h | 24 class LoopInfo; variable 29 void updateAggregateStats(const Function &F, const LoopInfo &LI); 35 const LoopInfo &LI);
|
| H A D | LoopIterator.h | 123 void perform(const LoopInfo *LI); 180 void perform(const LoopInfo *LI) { in perform() 207 const LoopInfo *LI; 210 LoopBlocksTraversal(LoopBlocksDFS &Storage, const LoopInfo *LInfo) : in LoopBlocksTraversal()
|
| H A D | BranchProbabilityInfo.h | 35 class LoopInfo; variable 117 BranchProbabilityInfo(const Function &F, const LoopInfo &LI, 207 void calculate(const Function &F, const LoopInfo &LI, 301 explicit LoopBlock(const BasicBlock *BB, const LoopInfo &LI, 335 const LoopInfo *LI = nullptr;
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | LoopExtractor.cpp | 62 function_ref<LoopInfo &(Function &)> LookupLoopInfo, in LoopExtractor() 74 function_ref<LoopInfo &(Function &)> LookupLoopInfo; 79 bool extractLoops(Loop::iterator From, Loop::iterator To, LoopInfo &LI, 81 bool extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT); 120 auto LookupLoopInfo = [this, &Changed](Function &F) -> LoopInfo & { in runOnModule() 170 LoopInfo &LI = LookupLoopInfo(F); in runOnFunction() 221 LoopInfo &LI, DominatorTree &DT) { in extractLoops() 239 bool LoopExtractor::extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT) { in extractLoop() 266 auto LookupLoopInfo = [&FAM](Function &F) -> LoopInfo & { in run()
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanHCFGBuilder.h | 32 class LoopInfo; 46 LoopInfo *LI; 60 VPlanHCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P) 33 class LoopInfo; global() variable
|
| /freebsd-src/contrib/llvm-project/clang/lib/CodeGen/ |
| H A D | CGLoopInfo.h | 90 class LoopInfo { 92 /// Construct a new LoopInfo for the loop with entry Header. 93 LoopInfo(llvm::BasicBlock *Header, const LoopAttributes &Attrs, 95 LoopInfo *Parent); 115 const LoopInfo *getParent() const { return Parent; } 131 LoopInfo *Parent; 133 /// loop's LoopInfo to set the llvm.loop.unroll_and_jam.followup_inner 298 /// Returns true if there is LoopInfo on the stack. 300 /// Return the LoopInfo for the current loop. HasInfo should be called 301 /// first to ensure LoopInfo i [all...] |
| H A D | CGLoopInfo.cpp | 25 LoopInfo::createLoopPropertiesMetadata(ArrayRef<Metadata *> LoopProperties) { in createLoopPropertiesMetadata() 36 MDNode *LoopInfo::createPipeliningMetadata(const LoopAttributes &Attrs, in createPipeliningMetadata() 81 LoopInfo::createPartialUnrollMetadata(const LoopAttributes &Attrs, in createPartialUnrollMetadata() 143 LoopInfo::createUnrollAndJamMetadata(const LoopAttributes &Attrs, in createUnrollAndJamMetadata() 211 LoopInfo::createLoopVectorizeMetadata(const LoopAttributes &Attrs, in createLoopVectorizeMetadata() 329 LoopInfo::createLoopDistributeMetadata(const LoopAttributes &Attrs, in createLoopDistributeMetadata() 379 MDNode *LoopInfo::createFullUnrollMetadata(const LoopAttributes &Attrs, in createFullUnrollMetadata() 416 MDNode *LoopInfo::createMetadata( in createMetadata() 484 LoopInfo::LoopInfo(BasicBloc function in LoopInfo [all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 115 static void reconnectChildLoops(LoopInfo &LI, Loop *ParentLoop, Loop *NewLoop, in INITIALIZE_PASS_DEPENDENCY() 164 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, in createNaturalLoopInternal() 253 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, in createNaturalLoop() 259 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, in createNaturalLoop() 267 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G) { in makeReducible() 313 static bool FixIrreducibleImpl(Function &F, LoopInfo &LI, DominatorTree &DT) { in FixIrreducibleImpl()
|
| /freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/ |
| H A D | LoopVectorize.h | 73 class LoopInfo; 175 LoopInfo *LI; 191 LoopVectorizeResult runImpl(Function &F, ScalarEvolution &SE_, LoopInfo &LI_, 72 class LoopInfo; global() variable
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | Sink.cpp | 66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() 104 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction() 175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock() 213 LoopInfo &LI, AAResults &AA) { in iterativelySinkInstructions()
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CFG.cpp | 15 #include "llvm/Analysis/LoopInfo.h" 126 // LoopInfo contains a mapping from basic block to the innermost loop. Find 128 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop() 137 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachableFromMany() 242 const LoopInfo *LI) { in isPotentiallyReachable() 252 const LoopInfo *LI) { in isPotentiallyReachable() 260 const LoopInfo *LI) { in isPotentiallyReachable() 284 const LoopInfo *LI) {
|