/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | MVETailPredication.cpp | 58 Loop *L = nullptr; 76 bool runOnLoop(Loop *L, LPPassManager&) override; 123 bool MVETailPredication::runOnLoop(Loop *L, LPPassManager&) { 186 LLVM_DEBUG(dbgs() << "ARM TP: Running on Loop: " << *L << *Setup << "\n" 411 SetVector<Instruction*> &MaybeDead, Loop *L) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTXTargetTransformInfo.cpp | 144 void NVPTXTTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | WarnMissedTransforms.cpp | 24 static void warnAboutLeftoverTransformations(Loop *L,
|
H A D | Sink.cpp | 126 Loop *succ = LI.getLoopFor(SuccToSinkTo); 127 Loop *cur = LI.getLoopFor(Inst->getParent());
|
H A D | StructurizeCFG.cpp | 173 /// |/ 2 = "Loop" optional subregion, with all exits at "Flow" block 214 Loop *getAdjustedLoop(RegionNode *RN); 315 Loop *StructurizeCFG::getAdjustedLoop(RegionNode *RN) { 337 SmallDenseMap<Loop*, unsigned, 8> LoopBlocks; 343 Loop *Loop = getAdjustedLoop(RN); local 344 ++LoopBlocks[Loop]; 348 Loop *CurrentLoop = nullptr; 523 << RN->getEntry()->getName() << " Loop Depth: "
|
H A D | LoopStrengthReduce.cpp | 364 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE); 366 bool isCanonical(const Loop &L) const; 368 void canonicalize(const Loop &L); 390 static void DoInitialMatch(const SCEV *S, Loop *L, 444 void Formula::initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) { 466 bool Formula::isCanonical(const Loop &L) const { 497 void Formula::canonicalize(const Loop &L) { 512 // BaseRegs containing the recurrent expr related with Loop L. Swap the 1013 const Loop &L); 1019 const Loop * [all...] |
H A D | LoopIdiomRecognize.cpp | 1 //===- LoopIdiomRecognize.cpp - Loop idiom recognition --------------------===// 116 Loop *CurLoop = nullptr; 136 bool runOnLoop(Loop *L); 160 /// \name Countable Loop Idiom Handling 185 /// \name Noncountable Loop Idiom Handling 212 bool runOnLoop(Loop *L, LPPassManager &LPM) override { 250 PreservedAnalyses LoopIdiomRecognizePass::run(Loop &L, LoopAnalysisManager &AM, 295 bool LoopIdiomRecognize::runOnLoop(Loop *L) { 339 << "] Countable Loop %" << CurLoop->getHeader()->getName() 799 mayLoopAccessLocation(Value *Ptr, ModRefInfo Access, Loop * [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | IVDescriptors.cpp | 160 static void collectCastsToIgnore(Loop *TheLoop, Instruction *Exit, 190 Loop *TheLoop, bool HasFunNoNaNAttr, 610 bool RecurrenceDescriptor::isReductionPHI(PHINode *Phi, Loop *TheLoop, 671 PHINode *Phi, Loop *TheLoop, 849 bool InductionDescriptor::isFPInductionPHI(PHINode *Phi, const Loop *TheLoop, 942 const Loop *L = AR->getLoop(); 1007 bool InductionDescriptor::isInductionPHI(PHINode *Phi, const Loop *TheLoop, 1052 PHINode *Phi, const Loop *TheLoop, ScalarEvolution *SE,
|
H A D | LoopAccessAnalysis.cpp | 1 //===- LoopAccessAnalysis.cpp - Loop Access Analysis Implementation --------==// 190 void RuntimePointerChecking::insert(Loop *Lp, Value *Ptr, bool WritePtr, 503 AccessAnalysis(const DataLayout &Dl, Loop *TheLoop, AliasAnalysis *AA, 536 Loop *TheLoop, unsigned &RunningDepId, 546 Loop *TheLoop, const ValueToValueMap &Strides, 583 const Loop *TheLoop; 622 Loop *L, bool Assume) { 642 const ValueToValueMap &Strides, Value *Ptr, Loop *L) { 658 Loop *TheLoop, unsigned &RunningDepId, 696 ScalarEvolution *SE, Loop *TheLoo [all...] |
H A D | ScalarEvolution.cpp | 48 // Symbolic Evaluation of Chains of Recurrences for Loop Optimization 709 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop(); 1449 const Loop *L = AR->getLoop(); 1504 // 3. Loop precondition. 1567 const Loop *L) { 1699 const Loop *L = AR->getLoop(); 2043 const Loop *L = AR->getLoop(); 2408 bool ScalarEvolution::isAvailableAtLoopEntry(const SCEV *S, const Loop *L) { 2705 const Loop *AddRecLoop = AddRec->getLoop(); 2816 const Loop * [all...] |
H A D | CodeMetrics.cpp | 71 const Loop *L, AssumptionCache *AC,
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64TargetTransformInfo.h | 34 class Loop; 144 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorizationPlanner.h | 187 Loop *OrigLoop; 189 /// Loop Info analysis. 228 LoopVectorizationPlanner(Loop *L, LoopInfo *LI, const TargetLibraryInfo *TLI,
|
H A D | VPlanHCFGBuilder.cpp | 37 Loop *TheLoop; 39 // Loop Info analysis. 73 PlainCFGBuilder(Loop *Lp, LoopInfo *LI, VPlan &P) 250 // Loop PH needs to be explicitly visited since it's not taken into account by 257 // Create empty VPBB for Loop H so that we can link PH->H. 314 // Loop exit was already set as successor of the loop exiting BB.
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineTraceMetrics.cpp | 597 const MachineLoop *Loop = getLoopFor(MBB); 598 assert(!(Loop && MBB == Loop->getHeader()) && "Trace contains backedge"); 605 const MachineLoop *Loop = getLoopFor(MBB); 607 assert(!(Loop && Loop == SuccLoop && TBI.Succ == Loop->getHeader()) && 1070 if (const MachineLoop *Loop = getLoopFor(MBB)) 1071 if (MBB->isSuccessor(Loop->getHeader())) 1072 Succ = Loop [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 142 bool runOnLoop(Loop *L, LPPassManager &LPM) override; 146 bool isLegalStore(Loop *CurLoop, StoreInst *SI); 147 void collectStores(Loop *CurLoop, BasicBlock *BB, 149 bool processCopyingStore(Loop *CurLoop, StoreInst *SI, const SCEV *BECount); 150 bool coverLoop(Loop *L, SmallVectorImpl<Instruction*> &Insts) const; 151 bool runOnLoopBlock(Loop *CurLoop, BasicBlock *BB, const SCEV *BECount, 153 bool runOnCountableLoop(Loop *L); 560 explicit PolynomialMultiplyRecognize(Loop *loop, const DataLayout &dl, 616 Loop *CurLoop; 1772 LLVM_DEBUG(dbgs() << "Loop heade [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUTargetTransformInfo.cpp | 72 static bool dependsOnLocalPhi(const Loop *L, const Value *Cond, 82 if (llvm::none_of(L->getSubLoops(), [PHI](const Loop* SubLoop) { 91 void AMDGPUTTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 109 if (llvm::any_of(L->getSubLoops(), [BB](const Loop* SubLoop) { 184 if (llvm::any_of(L->getSubLoops(), [Inst](const Loop* SubLoop) { 753 void GCNTTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE, 969 void R600TTIImpl::getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | AliasSetTracker.h | 39 class Loop; 348 Loop *L = nullptr; 361 explicit AliasSetTracker(AliasAnalysis &aa, MemorySSA *mssa, Loop *l)
|
H A D | ScalarEvolutionExpressions.h | 35 class Loop; 299 const Loop *L; 302 const SCEV *const *O, size_t N, const Loop *l) 307 const Loop *getLoop() const { return L; } 817 using LoopToScevMapT = DenseMap<const Loop *, const SCEV *>; 820 /// the Map (Loop -> SCEV) to all AddRecExprs. 838 const Loop *L = Expr->getLoop();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 248 if (Loop *TIL = LI->getLoopFor(TIBB)) { 251 if (Loop *DestLoop = LI->getLoopFor(DestBB)) { 268 if (Loop *P = DestLoop->getParentLoop())
|
H A D | BasicBlockUtils.cpp | 59 // Loop through all of our successors and make sure they know that one 530 if (Loop *L = LI->getLoopFor(Old)) 577 Loop *L = LI->getLoopFor(OldBB); 593 if (Loop *PL = LI->getLoopFor(Pred)) 616 Loop *InnermostPredLoop = nullptr; 618 if (Loop *PredLoop = LI->getLoopFor(Pred)) { 968 if (Loop *L = LI->getLoopFor(Head)) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/TableGen/ |
H A D | TGParser.cpp | 195 // Loop over bits, assigning values as appropriate. 242 // Loop over all of the template arguments, setting them to the specified 295 for (auto &E : Entry.Loop->Entries) { 345 assert(!E.Rec || !E.Loop); 352 if (E.Loop) { 354 return resolve(*E.Loop, Stack, CurMultiClass == nullptr, 366 /// Resolve the entries in \p Loop, going over inner loops recursively 371 bool TGParser::resolve(const ForeachLoop &Loop, SubstStack &Substs, argument 377 Init *List = Loop.ListValue->resolveReferences(R); 381 Dest->emplace_back(std::make_unique<ForeachLoop>(Loop 2910 std::unique_ptr<ForeachLoop> Loop = std::move(Loops.back()); local [all...] |
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
H A D | FuzzerInternal.h | 38 void Loop(Vector<SizedFile> &CorporaFiles);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
H A D | SystemZTargetTransformInfo.h | 49 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
|
/freebsd-12-stable/crypto/openssl/crypto/poly1305/asm/ |
H A D | poly1305-ppc.pl | 166 b Loop 169 Loop: label 224 bdnz Loop 400 b Loop 403 Loop: label 531 bdnz Loop
|