| /external/llvm/lib/Transforms/Scalar/ |
| D | LICM.cpp | 77 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
78 static bool isNotUsedInLoop(const Instruction &I, const Loop *CurLoop);
81 const Loop *CurLoop, AliasSetTracker *CurAST );
84 const Loop *CurLoop,
89 const Loop *CurLoop,
101 Loop *CurLoop, AliasSetTracker *CurAST,
150 Loop *CurLoop; // The current loop we are working on... member
219 CurLoop = L; in runOnLoop()
237 computeLICMSafetyInfo(&SafetyInfo, CurLoop); in runOnLoop()
250 Changed |= sinkRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI, CurLoop, in runOnLoop()
[all …]
|
| D | LoopIdiomRecognize.cpp | 69 Loop *CurLoop; member in __anon50fea5e80111::LoopIdiomRecognize
190 CurLoop = L; in runOnLoop()
207 *CurLoop->getHeader()->getParent()); in runOnLoop()
208 DL = &CurLoop->getHeader()->getModule()->getDataLayout(); in runOnLoop()
217 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop); in runOnCountableLoop()
229 CurLoop->getUniqueExitBlocks(ExitBlocks); in runOnCountableLoop()
232 << CurLoop->getHeader()->getParent()->getName() << "] Loop %" in runOnCountableLoop()
233 << CurLoop->getHeader()->getName() << "\n"); in runOnCountableLoop()
237 for (auto *BB : CurLoop->getBlocks()) { in runOnCountableLoop()
239 if (LI->getLoopFor(BB) != CurLoop) in runOnCountableLoop()
[all …]
|
| D | SeparateConstOffsetFromGEP.cpp | 408 Loop *CurLoop);
1178 GetElementPtrInst *FirstGEP, GetElementPtrInst *SecondGEP, Loop *CurLoop) { in isLegalToSwapOperand() argument
1198 if (CurLoop->isLoopInvariant(FirstOffset)) in isLegalToSwapOperand()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineLICM.cpp | 88 MachineLoop *CurLoop; // The current loop we are working on. member in __anon9dedcdf10111::MachineLICM
250 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { in INITIALIZE_PASS_DEPENDENCY()
252 if (!CurLoop->getLoopPredecessor()) in INITIALIZE_PASS_DEPENDENCY()
255 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop()) in INITIALIZE_PASS_DEPENDENCY()
300 CurLoop = Worklist.pop_back_val(); in runOnMachineFunction()
306 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) { in runOnMachineFunction()
307 Worklist.append(CurLoop->begin(), CurLoop->end()); in runOnMachineFunction()
311 CurLoop->getExitBlocks(ExitBlocks); in runOnMachineFunction()
318 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader()); in runOnMachineFunction()
450 const std::vector<MachineBasicBlock *> &Blocks = CurLoop->getBlocks(); in HoistRegionPostRA()
[all …]
|
| D | PHIElimination.cpp | 554 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; in SplitPHIEdges() local
555 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader(); in SplitPHIEdges()
572 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges) in SplitPHIEdges()
601 if (!ShouldSplit && CurLoop != PreLoop) { in SplitPHIEdges()
605 if (CurLoop) dbgs() << "CurLoop: " << *CurLoop; in SplitPHIEdges()
611 ShouldSplit = PreLoop && !PreLoop->contains(CurLoop); in SplitPHIEdges()
|
| D | MachineTraceMetrics.cpp | 316 const MachineLoop *CurLoop = getLoopFor(MBB); in pickTracePred() local
318 if (CurLoop && MBB == CurLoop->getHeader()) in pickTracePred()
342 const MachineLoop *CurLoop = getLoopFor(MBB); in pickTraceSucc() local
347 if (CurLoop && Succ == CurLoop->getHeader()) in pickTraceSucc()
350 if (isExitingLoop(CurLoop, getLoopFor(Succ))) in pickTraceSucc()
|
| /external/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 352 const Loop *CurLoop) { in setPoint() argument
356 AssociatedLoop = CurLoop; in setPoint()
363 const Loop *CurLoop) { in setLine() argument
368 AssociatedLoop = CurLoop; in setLine()
373 const Loop *CurLoop) { in setDistance() argument
378 AssociatedLoop = CurLoop; in setDistance()
1080 const Loop *CurLoop, in strongSIVtest() argument
1100 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) { in strongSIVtest()
1133 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop); in strongSIVtest()
1145 NewConstraint.setDistance(Delta, CurLoop); in strongSIVtest()
[all …]
|
| D | ScalarEvolutionExpander.cpp | 690 const Loop *CurLoop = I->first; in visitAddExpr() local
700 for (; I != E && I->first == CurLoop; ++I) { in visitAddExpr()
717 for (++I; I != E && I->first == CurLoop; ++I) in visitAddExpr()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopInfo.h | 96 for (const LoopT *CurLoop = ParentLoop; CurLoop; in getLoopDepth() local
97 CurLoop = CurLoop->ParentLoop) in getLoopDepth()
|
| /external/llvm/lib/TableGen/ |
| D | TGParser.cpp | 303 ForeachLoop &CurLoop = Loops[IterVals.size()]; in ProcessForeachDefs() local
304 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue); in ProcessForeachDefs()
313 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal)); in ProcessForeachDefs()
|