/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | Loads.h | 26 class Loop; 77 bool isDereferenceableAndAlignedInLoop(LoadInst *LI, Loop *L,
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXTargetTransformInfo.h | 96 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 99 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
H A D | NVPTXTargetTransformInfo.cpp | 147 void NVPTXTTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 159 void NVPTXTTIImpl::getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | LoopUnrollPass.h | 22 class Loop; 25 /// Loop unroll pass that only does full loop unrolling. 45 PreservedAnalyses run(Loop &L, LoopAnalysisManager &AM, 130 /// Loop unroll pass that will support both full and partial unrolling.
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 1 //===- LoopDeletion.cpp - Dead Loop Deletion Pass ---------------===// 9 // This file implements the Dead Loop Deletion Pass. This pass is responsible 45 static bool isLoopDead(Loop *L, ScalarEvolution &SE, 96 static bool isLoopNeverExecuted(Loop *L) { 138 static LoopDeletionResult deleteLoopIfDead(Loop *L, DominatorTree &DT, 151 << "Deletion requires Loop with preheader and dedicated exits.\n"); 157 LLVM_DEBUG(dbgs() << "Loop contains subloops.\n"); 165 LLVM_DEBUG(dbgs() << "Loop is proven to never execute, delete it!"); 174 << "Loop deleted because it never executes"; 197 LLVM_DEBUG(dbgs() << "Loop i [all...] |
H A D | LoopDistribute.cpp | 1 //===- LoopDistribute.cpp - Loop Distribution Pass ------------------------===// 9 // This file implements the Loop Distribution Pass. Its main focus is to 96 "after Loop Distribution"), 107 cl::desc("The maximum number of SCEV checks allowed for Loop " 114 "The maximum number of SCEV checks allowed for Loop " 132 InstPartition(Instruction *I, Loop *L, bool DepCycle = false) 185 Loop *cloneLoopWithPreheader(BasicBlock *InsertBefore, BasicBlock *LoopDomBB, 196 const Loop *getClonedLoop() const { return ClonedLoop; } 201 Loop *getDistributedLoop() const { 261 Loop *OrigLoo [all...] |
H A D | InductiveRangeCheckElimination.cpp | 150 static bool parseRangeCheckICmp(Loop *L, ICmpInst *ICI, ScalarEvolution &SE, 155 extractRangeChecksFromCond(Loop *L, ScalarEvolution &SE, Use &ConditionUse, 227 extractRangeChecksFromBranch(BranchInst *BI, Loop *L, ScalarEvolution &SE, 244 bool run(Loop *L, function_ref<void(Loop *, bool)> LPMAddNewLoop); 286 InductiveRangeCheck::parseRangeCheckICmp(Loop *L, ICmpInst *ICI, 346 Loop *L, ScalarEvolution &SE, Use &ConditionUse, 402 BranchInst *BI, Loop *L, ScalarEvolution &SE, BranchProbabilityInfo *BPI, 420 static void DisableAllLoopOptsOnLoop(Loop &L) { 448 // Keeps track of the structure of a loop. This is similar to llvm::Loop, [all...] |
H A D | LoopLoadElimination.cpp | 1 //===- LoopLoadElimination.cpp - Loop Load Elimination Pass ---------------===// 81 cl::desc("The maximum number of SCEV checks allowed for Loop " 99 Loop *L) const { 147 static bool doesStoreDominatesAllLatches(BasicBlock *StoreBlock, Loop *L, 157 static bool isLoadConditional(LoadInst *Load, Loop *L) { 166 LoadEliminationForLoop(Loop *L, LoopInfo *LI, const LoopAccessInfo &LAI, 538 LLVM_DEBUG(dbgs() << "Loop is not is loop-simplify form"); 582 Loop *L; 602 function_ref<const LoopAccessInfo &(Loop &)> GetLAI) { 608 SmallVector<Loop *, [all...] |
H A D | LoopSink.cpp | 1 //===-- LoopSink.cpp - Loop Sink Pass -------------------------------------===// 121 findBBsToSinkInto(const Loop &L, const SmallPtrSetImpl<BasicBlock *> &UseBBs, 175 static bool sinkInstruction(Loop &L, Instruction &I, 252 static bool sinkLoopInvariantInstructions(Loop &L, AAResults &AA, LoopInfo &LI, 329 SmallVector<Loop *, 4> PreorderLoops = LI.getLoopsInPreorder(); 333 Loop &L = *PreorderLoops.pop_back_val(); 357 bool runOnLoop(Loop *L, LPPassManager &LPM) override { 379 INITIALIZE_PASS_BEGIN(LegacyLoopSinkPass, "loop-sink", "Loop Sink", false, 383 INITIALIZE_PASS_END(LegacyLoopSinkPass, "loop-sink", "Loop Sink", false, false)
|
H A D | LoopRotation.cpp | 1 //===- LoopRotation.cpp - Loop Rotation Pass ------------------------------===// 9 // This file implements Loop Rotation Pass. 39 PreservedAnalyses LoopRotatePass::run(Loop &L, LoopAnalysisManager &AM, 89 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
|
H A D | LoopUnrollPass.cpp | 1 //===- LoopUnroll.cpp - Loop unroller pass --------------------------------===// 192 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI, 279 llvm::gatherPeelingPreferences(Loop *L, ScalarEvolution &SE, 374 const Loop *L, unsigned TripCount, DominatorTree &DT, ScalarEvolution &SE, 452 assert(Cost.IsFree && "Loop PHIs shouldn't be evaluated as they " 680 const Loop *L, unsigned &NumCalls, bool &NotDuplicatable, bool &Convergent, 706 static MDNode *getUnrollMetadataForLoop(const Loop *L, StringRef Name) { 713 static bool hasUnrollFullPragma(const Loop *L) { 719 static bool hasUnrollEnablePragma(const Loop *L) { 724 static bool hasRuntimeUnrollDisablePragma(const Loop * [all...] |
H A D | PlaceSafepoints.cpp | 123 bool runOnLoop(Loop *); 124 void runOnLoopAndSubLoops(Loop *L) { 126 for (Loop *I : *L) 136 for (Loop *I : *LI) { 200 static bool containsUnconditionalCallSafepoint(Loop *L, BasicBlock *Header, 242 static bool mustBeFiniteCountedLoop(Loop *L, ScalarEvolution *SE, 308 bool PlaceBackedgeSafepointsImpl::runOnLoop(Loop *L) { 309 // Loop through all loop latches (branches controlling backedges). We need
|
H A D | LoopVersioningLICM.cpp | 1 //===- LoopVersioningLICM.cpp - LICM Loop Versioning ----------------------===// 14 // Loop Versioning will create a version of the loop with aggressive aliasing 43 // |Orig Loop Preheader | |Cloned Loop Preheader | 47 // |Orig Loop Body | |Cloned Loop Body | 51 // |Orig Loop Exit Block| |Cloned Loop Exit Block| 126 bool runOnLoop(Loop *L, LPPassManager &LPM) override; 142 StringRef getPassName() const override { return "Loop Versionin [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.h | 35 class Loop; 106 bool shouldFavorBackedgeIndex(const Loop *L) const; 249 bool isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE, 253 bool preferPredicateOverEpilogue(Loop *L, LoopInfo *LI, 259 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 264 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUTargetTransformInfo.h | 36 class Loop; 62 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 65 void getPeelingPreferences(Loop *L, ScalarEvolution &SE, 149 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 152 void getPeelingPreferences(Loop *L, ScalarEvolution &SE, 271 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 273 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
H A D | SIAnnotateControlFlow.cpp | 72 Function *Loop; member in class:__anon3966::SIAnnotateControlFlow 99 handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L, 157 Loop = Intrinsic::getDeclaration(&M, Intrinsic::amdgcn_loop, { IntMask }); 231 Value *Cond, PHINode *Broken, llvm::Loop *L, BranchInst *Term) { 263 llvm::Loop *L = LI->getLoopFor(BB); 286 Term->setCondition(CallInst::Create(Loop, Arg, "", Term)); 293 llvm::Loop *L = LI->getLoopFor(BB);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CanonicalizeFreezeInLoops.cpp | 61 bool runOnLoop(Loop *L, LPPassManager &LPM) override; 66 Loop *L; 96 CanonicalizeFreezeInLoopsImpl(Loop *L, ScalarEvolution &SE, DominatorTree &DT) 219 bool CanonicalizeFreezeInLoops::runOnLoop(Loop *L, LPPassManager &) { 229 CanonicalizeFreezeInLoopsPass::run(Loop &L, LoopAnalysisManager &AM,
|
H A D | LoopSimplify.cpp | 1 //===- LoopSimplify.cpp - Loop Canonicalization Pass ----------------------===// 13 // Loop pre-header insertion guarantees that there is a single, non-critical 17 // Loop exit-block insertion guarantees that all exit blocks from the loop 88 Loop *L) { 123 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, DominatorTree *DT, 183 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT, 212 /// Loop: 214 /// br cond, Loop, Next 216 /// br cond2, Loop, Out 225 static Loop *separateNestedLoo [all...] |
H A D | LoopUnroll.cpp | 1 //===-- UnrollLoop.cpp - Loop unrolling utilities -------------------------===// 111 static bool needToInsertPhisForLCSSA(Loop *L, std::vector<BasicBlock *> Blocks, 119 Loop *DefLoop = LI->getLoopFor(Def->getParent()); 135 const Loop* llvm::addClonedBlockToLoopInfo(BasicBlock *OriginalBB, 139 const Loop *OldLoop = LI->getLoopFor(OriginalBB); 142 Loop *&NewLoop = NewLoops[OldLoop]; 149 Loop *NewLoopParent = NewLoops.lookup(OldLoop->getParentLoop()); 189 static bool isEpilogProfitable(Loop *L) { 203 void llvm::simplifyLoopAfterUnroll(Loop *L, bool SimplifyIVs, LoopInfo *LI, 282 LoopUnrollResult llvm::UnrollLoop(Loop * [all...] |
H A D | LCSSA.cpp | 86 // Cache the Loop ExitBlocks across this loop. We expect to get a lot of 89 SmallDenseMap<Loop*, SmallVector<BasicBlock *,1>> LoopExitBlocks; 97 Loop *L = LI.getLoopFor(InstBB); 179 // exit for Loop L1 is the header of a disjoint Loop L2. Thus, when we 277 Loop &L, const DominatorTree &DT, SmallVector<BasicBlock *, 8> &ExitBlocks, 321 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, 327 for (Loop *SubLoop: L) 386 bool llvm::formLCSSARecursively(Loop &L, const DominatorTree &DT, 391 for (Loop *SubLoo [all...] |
H A D | LoopRotationUtils.cpp | 76 bool processLoop(Loop *L); 79 bool rotateLoop(Loop *L, bool SimplifiedLatch); 80 bool simplifyLoopLatch(Loop *L); 188 static bool profitableToRotateLoopExitingLatch(Loop *L) { 213 static bool canRotateDeoptimizingLatchExit(Loop *L) { 264 bool LoopRotate::rotateLoop(Loop *L, bool SimplifiedLatch) { 347 // Find new Loop header. NewHeader is a Header's one and only successor 539 Loop *PredLoop = LI->getLoopFor(ExitPred); 605 BasicBlock::iterator End, Loop *L) { 677 bool LoopRotate::simplifyLoopLatch(Loop * [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonTargetTransformInfo.h | 28 class Loop; 64 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 67 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | Cloning.h | 43 class Loop; 242 Loop *cloneLoopWithPreheader(BasicBlock *Before, BasicBlock *LoopDomBB, 243 Loop *OrigLoop, ValueToValueMapTy &VMap,
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPRecipeBuilder.h | 26 Loop *OrigLoop; 93 VPRecipeBuilder(Loop *OrigLoop, const TargetLibraryInfo *TLI,
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ModuloSchedule.h | 81 MachineLoop *Loop; member in class:llvm::ModuloSchedule 105 ModuloSchedule(MachineFunction &MF, MachineLoop *Loop, argument 109 : Loop(Loop), ScheduledInstrs(ScheduledInstrs), Cycle(std::move(Cycle)), 118 MachineLoop *getLoop() const { return Loop; }
|