/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopVersioningLICM.cpp | 169 Preheader(nullptr), CurLoop(nullptr), CurAST(nullptr), 186 Loop *CurLoop; // The current loop we are working on. member in struct:__anon13389::LoopVersioningLICM 210 if (!CurLoop->getLoopPreheader()) { 215 if (CurLoop->getSubLoops().size()) { 220 if (CurLoop->getNumBackEdges() != 1) { 225 if (!CurLoop->getExitingBlock()) { 232 if (CurLoop->getExitingBlock() != CurLoop->getLoopLatch()) { 238 if (CurLoop->isAnnotatedParallel()) { 243 if (CurLoop [all...] |
H A D | LICM.cpp | 83 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI); 84 static bool isNotUsedInLoop(const Instruction &I, const Loop *CurLoop, 86 static bool hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop, 89 const Loop *CurLoop, AliasSetTracker *CurAST, 93 const Loop *CurLoop, 105 Loop *CurLoop, AliasSetTracker *CurAST, 296 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, 301 CurLoop != nullptr && CurAST != nullptr && SafetyInfo != nullptr && 306 if (!CurLoop->contains(BB)) 313 Changed |= sinkRegion(Child, AA, LI, DT, TLI, CurLoop, CurAS 295 sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, AliasSetTracker *CurAST, LoopSafetyInfo *SafetyInfo) argument 353 hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, AliasSetTracker *CurAST, LoopSafetyInfo *SafetyInfo) argument 407 computeLoopSafetyInfo(LoopSafetyInfo *SafetyInfo, Loop *CurLoop) argument 440 canSinkOrHoistInst(Instruction &I, AliasAnalysis *AA, DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, AliasSetTracker *CurAST, LoopSafetyInfo *SafetyInfo) argument 539 isNotUsedInLoop(const Instruction &I, const Loop *CurLoop, const LoopSafetyInfo *SafetyInfo) argument 650 sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT, const Loop *CurLoop, AliasSetTracker *CurAST, const LoopSafetyInfo *SafetyInfo) argument 719 hoist(Instruction &I, const DominatorTree *DT, const Loop *CurLoop, const LoopSafetyInfo *SafetyInfo) argument 750 isSafeToExecuteUnconditionally(const Instruction &Inst, const DominatorTree *DT, const Loop *CurLoop, const LoopSafetyInfo *SafetyInfo, const Instruction *CtxI) argument 842 promoteLoopAccessesToScalars( AliasSet &AS, SmallVectorImpl<BasicBlock *> &ExitBlocks, SmallVectorImpl<Instruction *> &InsertPts, PredIteratorCache &PIC, LoopInfo *LI, DominatorTree *DT, const TargetLibraryInfo *TLI, Loop *CurLoop, AliasSetTracker *CurAST, LoopSafetyInfo *SafetyInfo) argument 1171 inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI) argument [all...] |
H A D | LoopIdiomRecognize.cpp | 71 Loop *CurLoop; member in class:__anon13365::LoopIdiomRecognize 86 : CurLoop(nullptr), AA(AA), DT(DT), LI(LI), SE(SE), TLI(TLI), TTI(TTI), 221 CurLoop = L; 244 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop); 256 CurLoop->getUniqueExitBlocks(ExitBlocks); 259 << CurLoop->getHeader()->getParent()->getName() << "] Loop %" 260 << CurLoop->getHeader()->getName() << "\n"); 267 computeLoopSafetyInfo(&SafetyInfo, CurLoop); 272 for (auto *BB : CurLoop->getBlocks()) { 274 if (LI->getLoopFor(BB) != CurLoop) 1004 detectPopcountIdiom(Loop *CurLoop, BasicBlock *PreCondBB, Instruction *&CntInst, PHINode *&CntPhi, Value *&Var) argument [all...] |
H A D | GuardWidening.cpp | 279 auto *CurLoop = LI.getLoopFor(CurBB); local 312 computeWideningScore(GuardInst, GuardInstLoop, Candidate, CurLoop);
|
H A D | SeparateConstOffsetFromGEP.cpp | 408 Loop *CurLoop); 1178 GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) { 1198 if (CurLoop->isLoopInvariant(FirstOffset)) 1177 isLegalToSwapOperand( GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) argument
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 102 Loop *CurLoop; // The current loop we are working on... member in struct:__anon18935::LICM 133 assert(CurLoop->contains(BB) && "Only valid if BB is IN the loop"); 134 return LI->getLoopFor(BB) != CurLoop; 164 // Check to see if any of the basic blocks in CurLoop invalidate *V. 214 CurLoop = L; 255 CurLoop = 0; 278 if (!CurLoop->contains(BB)) return; 325 if (!CurLoop->contains(BB)) return; 349 if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) && 427 if (CurLoop [all...] |
H A D | LoopIdiomRecognize.cpp | 67 Loop *CurLoop; member in class:__anon18938::LoopIdiomRecognize 174 CurLoop = L; 203 CurLoop->getUniqueExitBlocks(ExitBlocks); 214 if (LI.getLoopFor(*BI) != CurLoop) 285 if (StoreEv == 0 || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) 316 if (LoadEv && LoadEv->getLoop() == CurLoop && LoadEv->isAffine() && 342 if (Ev == 0 || Ev->getLoop() != CurLoop || !Ev->isAffine()) 457 CurLoop->isLoopInvariant(SplatValue)) { 473 BasicBlock *Preheader = CurLoop->getLoopPreheader(); 489 CurLoop, BECoun [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineLICM.cpp | 88 MachineLoop *CurLoop; // The current loop we are working on. member in class:__anon12578::MachineLICM 89 MachineBasicBlock *CurPreheader; // The preheader for CurLoop. 91 // Exit blocks for CurLoop. 250 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { argument 252 if (!CurLoop->getLoopPredecessor()) 255 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop()) 300 CurLoop = Worklist.pop_back_val(); 306 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) { 307 Worklist.append(CurLoop->begin(), CurLoop [all...] |
H A D | PHIElimination.cpp | 553 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; local 554 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader(); 571 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges) 600 if (!ShouldSplit && CurLoop != PreLoop) { 604 if (CurLoop) dbgs() << "CurLoop: " << *CurLoop; 609 // Split unless this edge is entering CurLoop from an outer loop. 610 ShouldSplit = PreLoop && !PreLoop->contains(CurLoop); [all...] |
H A D | MachineTraceMetrics.cpp | 316 const MachineLoop *CurLoop = getLoopFor(MBB); local 318 if (CurLoop && MBB == CurLoop->getHeader()) 344 const MachineLoop *CurLoop = getLoopFor(MBB); local 349 if (CurLoop && Succ == CurLoop->getHeader()) 351 // Don't consider successors exiting CurLoop. 352 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | MachineLICM.cpp | 81 MachineLoop *CurLoop; // The current loop we are working on. member in class:__anon18536::MachineLICM 82 MachineBasicBlock *CurPreheader; // The preheader for CurLoop. 295 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { argument 297 if (!CurLoop->getLoopPredecessor()) 300 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop()) 342 CurLoop = Worklist.pop_back_val(); 347 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) { 348 Worklist.append(CurLoop->begin(), CurLoop->end()); 357 MachineDomTreeNode *N = DT->getNode(CurLoop [all...] |
/external/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 356 const Loop *CurLoop) { 360 AssociatedLoop = CurLoop; 364 const SCEV *CC, const Loop *CurLoop) { 369 AssociatedLoop = CurLoop; 373 const Loop *CurLoop) { 378 AssociatedLoop = CurLoop; 1067 const SCEV *DstConst, const Loop *CurLoop, 1086 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) { 1119 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop); 1131 NewConstraint.setDistance(Delta, CurLoop); 355 setPoint(const SCEV *X, const SCEV *Y, const Loop *CurLoop) argument 363 setLine(const SCEV *AA, const SCEV *BB, const SCEV *CC, const Loop *CurLoop) argument 372 setDistance(const SCEV *D, const Loop *CurLoop) argument 1066 strongSIVtest(const SCEV *Coeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument 1202 weakCrossingSIVtest( const SCEV *Coeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint, const SCEV *&SplitIter) const argument 1413 exactSIVtest(const SCEV *SrcCoeff, const SCEV *DstCoeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument 1622 weakZeroSrcSIVtest(const SCEV *DstCoeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument 1732 weakZeroDstSIVtest(const SCEV *SrcCoeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument 2085 const Loop *CurLoop = SrcAddRec->getLoop(); local 2107 const Loop *CurLoop = SrcAddRec->getLoop(); local 2117 const Loop *CurLoop = DstAddRec->getLoop(); local 2353 const Loop *CurLoop = AddRec->getLoop(); local 3008 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); local 3034 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); local 3107 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); local [all...] |
H A D | ScalarEvolutionExpander.cpp | 686 const Loop *CurLoop = I->first; local 696 for (; I != E && I->first == CurLoop; ++I) { 713 for (++I; I != E && I->first == CurLoop; ++I)
|
/external/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 281 MachineLoop *CurLoop = Worklist.pop_back_val(); local 282 Worklist.append(CurLoop->begin(), CurLoop->end()); 283 Changed |= VisitLoop(MF, MLI, CurLoop);
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | LoopUtils.h | 396 const Loop *CurLoop,
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | LoopInfo.h | 93 for (const LoopT *CurLoop = ParentLoop; CurLoop; 94 CurLoop = CurLoop->ParentLoop)
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopUtils.cpp | 932 const DominatorTree *DT, const Loop *CurLoop, 941 if (Inst.getParent() == CurLoop->getHeader()) 953 CurLoop->getExitBlocks(ExitBlocks); 931 isGuaranteedToExecute(const Instruction &Inst, const DominatorTree *DT, const Loop *CurLoop, const LoopSafetyInfo *SafetyInfo) argument
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 717 const Loop *CurLoop = I->first; local 727 for (; I != E && I->first == CurLoop; ++I) { 744 for (++I; I != E && I->first == CurLoop; ++I)
|
/external/llvm/lib/TableGen/ |
H A D | TGParser.cpp | 299 ForeachLoop &CurLoop = Loops[IterVals.size()]; local 300 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue); 309 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal));
|