Searched refs:Loop (Results 101 - 125 of 250) sorted by relevance

12345678910

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopVersioning.cpp35 LoopVersioning::LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
41 assert(L->isLoopSimplifyForm() && "Loop is not in loop-simplify form");
274 SmallVector<Loop *, 8> Worklist;
276 for (Loop *TopLevelLoop : *LI)
277 for (Loop *L : depth_first(TopLevelLoop))
284 for (Loop *L : Worklist) {
316 static const char LVer_name[] = "Loop Versioning";
H A DLoopUnrollPeel.cpp1 //===- UnrollLoopPeel.cpp - Loop peeling utilities ------------------------===//
77 bool llvm::canPeel(Loop *L) {
126 PHINode *Phi, Loop *L, BasicBlock *BackEdge,
172 static unsigned countToEliminateCompares(Loop &L, unsigned MaxPeelCount,
174 assert(L.isLoopSimplifyForm() && "Loop needs to be in loop simplify form");
280 void llvm::computePeelCount(Loop *L, unsigned LoopSize,
334 assert(BackEdge && "Loop is not in simplified form?");
493 Loop *L, unsigned IterNumber, BasicBlock *InsertTop, BasicBlock *InsertBot,
505 Loop *ParentLoop = L->getParentLoop();
533 // Recursively create the new Loop object
[all...]
H A DCloneFunction.cpp52 // Loop over all instructions, and copy them over.
157 // Loop over all of the basic blocks in the function, cloning them as
199 // Loop over all of the instructions in the function, fixing up operand
205 // Loop over all instructions, fixing each one as we find it...
253 // Loop over the arguments, copying the names of the mapped arguments over...
328 // Loop over all instructions, and copy them over, DCE'ing as we go. This
484 // Loop over all of the basic blocks in the old function. If the block was
567 // map. Loop over all of the PHIs and remove excess predecessor
750 Loop *llvm::cloneLoopWithPreheader(BasicBlock *Before, BasicBlock *LoopDomBB,
751 Loop *OrigLoo
[all...]
H A DUnifyLoopExits.cpp79 static void restoreSSA(const DominatorTree &DT, const Loop *L,
134 static bool unifyLoopExits(DominatorTree &DT, LoopInfo &LI, Loop *L) {
143 // We need SetVectors, but the Loop API takes a vector, so we use a temporary.
215 LLVM_DEBUG(dbgs() << "Loop: " << L->getHeader()->getName() << " (depth: "
H A DLoopUnrollRuntime.cpp1 //===-- UnrollLoopRuntime.cpp - Runtime Loop unrolling utilities ----------===//
67 static void ConnectProlog(Loop *L, Value *BECount, unsigned Count,
73 // Loop structure should be the following:
85 assert(Latch && "Loop must have a latch");
137 Loop *PrologLoop = LI->getLoopFor(PrologLatch);
183 static void ConnectEpilog(Loop *L, Value *ModVal, BasicBlock *NewExit,
189 assert(Latch && "Loop must have a latch");
192 // Loop structure should be the following:
223 // Add incoming PreHeader from branch around the Loop
274 assert(Exit && "Loop mus
[all...]
H A DSimplifyIndVar.cpp53 Loop *L;
64 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, argument
68 : L(Loop), LI(LI), SE(SE), DT(DT), TTI(TTI), Rewriter(Rewriter),
190 const Loop *ICmpLoop = LI->getLoopFor(ICmp->getParent());
260 const Loop *ICmpLoop = LI->getLoopFor(ICmp->getParent());
300 const Loop *L = LI->getLoopFor(SDiv->getParent());
372 const Loop *ICmpLoop = LI->getLoopFor(Rem->getParent());
653 static Instruction *GetLoopInvariantInsertPosition(Loop *L, Instruction *Hint) {
801 Instruction *Def, Loop *
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/TableGen/
H A DTGParser.h42 std::unique_ptr<ForeachLoop> Loop; member in struct:llvm::RecordsEntry
48 RecordsEntry(std::unique_ptr<ForeachLoop> Loop) argument
49 : Loop(std::move(Loop)) {}
205 bool resolve(const ForeachLoop &Loop, SubstStack &Stack, bool Final,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp1 //===-- LICM.cpp - Loop Invariant Code Motion Pass ------------------------===//
137 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
138 static bool isNotUsedOrFreeInLoop(const Instruction &I, const Loop *CurLoop,
141 static void hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop,
146 const Loop *CurLoop, ICFLoopSafetyInfo *SafetyInfo,
150 const Loop *CurLoop,
155 AliasSetTracker *CurAST, Loop *CurLoop,
158 Loop *CurLoop,
173 bool runOnLoop(Loop *L, AAResults *AA, LoopInfo *LI, DominatorTree *DT,
188 collectAliasInfoForLoop(Loop *
[all...]
H A DLoopFuse.cpp1 //===- LoopFuse.cpp - Loop Fusion Pass ------------------------------------===//
13 /// Code Transformations to Augment the Scope of Loop Fusion in a
74 STATISTIC(InvalidPreheader, "Loop has invalid preheader");
75 STATISTIC(InvalidHeader, "Loop has invalid header");
76 STATISTIC(InvalidExitingBlock, "Loop has invalid exiting blocks");
77 STATISTIC(InvalidExitBlock, "Loop has invalid exit block");
78 STATISTIC(InvalidLatch, "Loop has invalid latch");
79 STATISTIC(InvalidLoop, "Loop is invalid");
81 STATISTIC(MayThrowException, "Loop may throw an exception");
82 STATISTIC(ContainsVolatileAccess, "Loop contain
[all...]
H A DLoopRerollPass.cpp1 //===- LoopReroll.cpp - Loop rerolling pass -------------------------------===//
172 bool runOnLoop(Loop *L, LPPassManager &LPM) override;
201 SimpleLoopReduction(Instruction *P, Loop *L) : Instructions(1, P) {
253 void add(Loop *L);
379 DAGRootTracker(LoopReroll *Parent, Loop *L, Instruction *IV,
433 Loop *L;
444 // Loop step amount.
447 // Loop reroll count; if Inc == 1, this records the scaling applied
477 bool isLoopControlIV(Loop *L, Instruction *IV);
478 void collectPossibleIVs(Loop *
[all...]
H A DLoopInstSimplify.cpp1 //===- LoopInstSimplify.cpp - Loop Instruction Simplification Pass --------===//
51 static bool simplifyLoopInst(Loop &L, DominatorTree &DT, LoopInfo &LI,
187 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
224 PreservedAnalyses LoopInstSimplifyPass::run(Loop &L, LoopAnalysisManager &AM,
H A DLoopPredication.cpp259 Loop *L;
308 bool predicateLoopExits(Loop *L, SCEVExpander &Rewriter);
315 bool runOnLoop(Loop *L);
330 bool runOnLoop(Loop *L, LPPassManager &LPM) override {
348 "Loop predication", false, false)
352 "Loop predication", false, false)
358 PreservedAnalyses LoopPredicationPass::run(Loop &L, LoopAnalysisManager &AM,
659 static void normalizePredicate(ScalarEvolution *SE, Loop *L,
969 static BranchInst *FindWidenableTerminatorAboveLoop(Loop *L, LoopInfo &LI) {
1005 Loop *
1186 runOnLoop(Loop *Loop) argument
[all...]
H A DIndVarSimplify.cpp149 bool handleFloatingPointIV(Loop *L, PHINode *PH);
150 bool rewriteNonIntegerIVs(Loop *L);
152 bool simplifyAndExtend(Loop *L, SCEVExpander &Rewriter, LoopInfo *LI);
154 bool optimizeLoopExits(Loop *L, SCEVExpander &Rewriter);
157 bool predicateLoopExits(Loop *L, SCEVExpander &Rewriter);
159 bool rewriteFirstIterationLoopExitValues(Loop *L);
161 bool linearFunctionTestReplace(Loop *L, BasicBlock *ExitingBB,
165 bool sinkUnusedInvariants(Loop *L);
176 bool run(Loop *L);
257 bool IndVarSimplify::handleFloatingPointIV(Loop *
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DHardwareLoops.cpp49 #define HW_LOOPS_NAME "Hardware Loop Insertion"
94 createHWLoopAnalysis(StringRef RemarkName, Loop *L, Instruction *I) {
114 OptimizationRemarkEmitter *ORE, Loop *TheLoop, Instruction *I = nullptr) {
142 // Try to convert the given Loop into a hardware loop.
143 bool TryConvertLoop(Loop *L);
203 Loop *L = nullptr;
236 Loop *L = *I;
246 bool HardwareLoops::TryConvertLoop(Loop *L) {
249 for (Loop *SL : *L)
257 LLVM_DEBUG(dbgs() << "HWLoops: Loop " <<
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCodeExtractor.h35 class Loop;
130 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateUniformValues.cpp88 // 1. get Loop for the Load->getparent();
96 const Loop *L = LI->getLoopFor(Start);
98 const Loop *P = L;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.h50 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
53 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.cpp20 Loop *OrigLoop, VPlanPtr &Plan,
H A DLoopVectorizationLegality.cpp71 LoopVectorizeHints::LoopVectorizeHints(const Loop *L,
116 Function *F, Loop *L, bool VectorizeOnlyWhenForced) const {
243 Function *F, Loop *L, const LoopVectorizeHints &Hints) {
301 static bool isUniformLoop(Loop *Lp, Loop *OuterLp) {
328 dbgs() << "LV: Loop latch condition is not a compare instruction.\n");
337 LLVM_DEBUG(dbgs() << "LV: Loop latch condition is not uniform.\n");
346 static bool isUniformLoopNest(Loop *Lp, Loop *OuterLp) {
351 for (Loop *SubL
[all...]
/freebsd-13-stable/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-s390x.pl107 j .Loop
110 .Loop:
155 brct$g $len,.Loop
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64TargetTransformInfo.h34 class Loop;
153 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
156 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp1 //===------ PPCLoopInstrFormPrep.cpp - Loop Instr Form Prep Pass ----------===//
186 bool runOnLoop(Loop *L);
188 /// Check if required PHI node is already exist in Loop \p L.
189 bool alreadyPrepared(Loop *L, Instruction* MemI,
195 /// candidates in Loop \p L.
197 collectCandidates(Loop *L,
208 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
212 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
233 bool rewriteLoadStores(Loop *L, Bucket &BucketChain,
332 Loop *
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DTargetTransformInfo.h48 class Loop;
89 HardwareLoopInfo(Loop *L) : L(L) {}
90 Loop *L = nullptr;
503 void getUnrollingPreferences(Loop *L, ScalarEvolution &,
508 bool isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE,
514 bool preferPredicateOverEpilogue(Loop *L, LoopInfo *LI, ScalarEvolution &SE,
543 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
590 /// Loop-strength-reduction (LSR) uses that knowledge to adjust its cost
596 bool canSaveCmp(Loop *L, BranchInst **BI, ScalarEvolution *SE, LoopInfo *LI,
606 bool shouldFavorBackedgeIndex(const Loop *
[all...]
/freebsd-13-stable/crypto/openssl/crypto/rc4/asm/
H A Drc4-md5-x86_64.pl178 jz .Loop${MOD}_is_hot
180 .Loop${MOD}_warmup:
193 jnz .Loop${MOD}_warmup
199 .Loop${MOD}_is_hot:
225 jmp .Loop
228 .Loop:
416 jb .Loop
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DInstrProfiling.cpp195 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCands,
239 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCandidates;
249 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCands,
250 Loop &CurLoop, LoopInfo &LI, BlockFrequencyInfo *BFI)
319 bool allowSpeculativeCounterPromotion(Loop *LP) {
332 bool isPromotionPossible(Loop *LP,
351 unsigned getMaxNumOfPromotionsInLoop(Loop *LP) {
390 DenseMap<Loop *, SmallVector<LoadStorePair, 8>> &LoopToCandidates;
393 Loop &L;
478 DenseMap<Loop *, SmallVecto
[all...]

Completed in 1488 milliseconds

12345678910