/external/llvm/lib/Transforms/Scalar/ |
LoopVersioningLICM.cpp | 169 Preheader(nullptr), CurLoop(nullptr), CurAST(nullptr), 186 Loop *CurLoop; // The current loop we are working on. 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->getLoopDepth() > LoopDepthThreshold) [all...] |
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, CurAST, SafetyInfo) [all...] |
LoopIdiomRecognize.cpp | 71 Loop *CurLoop; 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) [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
LICM.cpp | 102 Loop *CurLoop; // The current loop we are working on... 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->contains(PN->getIncomingBlock(i)) [all...] |
LoopIdiomRecognize.cpp | 67 Loop *CurLoop; 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, BECount [all...] |
/external/llvm/lib/CodeGen/ |
MachineLICM.cpp | 88 MachineLoop *CurLoop; // The current loop we are working on. 89 MachineBasicBlock *CurPreheader; // The preheader for CurLoop. 91 // Exit blocks for CurLoop. 250 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { 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->end()) [all...] |
PHIElimination.cpp | 553 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; 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...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
MachineLICM.cpp | 81 MachineLoop *CurLoop; // The current loop we are working on. 82 MachineBasicBlock *CurPreheader; // The preheader for CurLoop. 295 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { 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->getHeader()) [all...] |
/external/llvm/lib/Analysis/ |
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; [all...] |
/external/llvm/lib/Target/WebAssembly/ |
WebAssemblyFixIrreducibleControlFlow.cpp | 281 MachineLoop *CurLoop = Worklist.pop_back_val(); 282 Worklist.append(CurLoop->begin(), CurLoop->end()); 283 Changed |= VisitLoop(MF, MLI, CurLoop);
|
/external/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
LoopInfo.h | 97 for (const LoopT *CurLoop = ParentLoop; CurLoop; 98 CurLoop = CurLoop->ParentLoop)
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
LoopUtils.h | 450 const Loop *CurLoop, 488 Loop *CurLoop, AliasSetTracker *CurAST,
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
LoopUtils.h | 450 const Loop *CurLoop, 488 Loop *CurLoop, AliasSetTracker *CurAST,
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
LoopUtils.h | 450 const Loop *CurLoop, 488 Loop *CurLoop, AliasSetTracker *CurAST,
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
LoopUtils.h | 450 const Loop *CurLoop, 488 Loop *CurLoop, AliasSetTracker *CurAST,
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
LoopUtils.h | 450 const Loop *CurLoop, 488 Loop *CurLoop, AliasSetTracker *CurAST,
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
LoopUtils.h | 450 const Loop *CurLoop, 488 Loop *CurLoop, AliasSetTracker *CurAST,
|