| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 316 const MachineLoop *CurLoop = getLoopFor(MBB);
318 if (CurLoop && MBB == CurLoop->getHeader())
344 const MachineLoop *CurLoop = getLoopFor(MBB);
349 if (CurLoop && Succ == CurLoop->getHeader())
351 // Don't consider successors exiting CurLoop.
352 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
[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...] |
| 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...] |
| /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/lib/Transforms/Scalar/ |
| GuardWidening.cpp | 279 auto *CurLoop = LI.getLoopFor(CurBB);
312 computeWideningScore(GuardInst, GuardInstLoop, Candidate, CurLoop);
|
| 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...] |
| 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/ |
| 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...] |
| 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...] |
| /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/TableGen/ |
| TGParser.cpp | 299 ForeachLoop &CurLoop = Loops[IterVals.size()];
300 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue);
309 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal));
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | 717 const Loop *CurLoop = I->first;
727 for (; I != E && I->first == CurLoop; ++I) {
744 for (++I; I != E && I->first == CurLoop; ++I)
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | 686 const Loop *CurLoop = I->first;
696 for (; I != E && I->first == CurLoop; ++I) {
713 for (++I; I != E && I->first == CurLoop; ++I)
[all...] |
| 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...] |
