| /external/llvm/lib/Transforms/Scalar/ |
| D | LICM.cpp | 74 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
75 static bool isNotUsedInLoop(Instruction &I, Loop *CurLoop);
78 Loop *CurLoop, AliasSetTracker *CurAST );
80 Loop *CurLoop, LICMSafetyInfo *SafetyInfo);
82 Loop *CurLoop,
91 DominatorTree *DT, Loop *CurLoop,
138 Loop *CurLoop; // The current loop we are working on... member
204 CurLoop = L; in runOnLoop()
222 computeLICMSafetyInfo(&SafetyInfo, CurLoop); in runOnLoop()
235 Changed |= sinkRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI, CurLoop, in runOnLoop()
[all …]
|
| D | LoopIdiomRecognize.cpp | 95 Loop *CurLoop; member in __anon259313270111::NclPopcountRecognize
132 Loop *CurLoop; member in __anon259313270111::LoopIdiomRecognize
203 *CurLoop->getHeader()->getParent())); in getTargetTransformInfo()
206 Loop *getLoop() const { return CurLoop; } in getLoop()
276 LIR(TheLIR), CurLoop(TheLIR.getLoop()), PreCondBB(nullptr) { in NclPopcountRecognize()
290 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1) in preliminaryScreen()
293 BasicBlock *LoopBody = *(CurLoop->block_begin()); in preliminaryScreen()
300 BasicBlock *PreHead = CurLoop->getLoopPreheader(); in preliminaryScreen()
365 LoopEntry = *(CurLoop->block_begin()); in detectIdiom()
449 Value *T = matchCondition (PreCondBr, CurLoop->getLoopPreheader()); in detectIdiom()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineLICM.cpp | 88 MachineLoop *CurLoop; // The current loop we are working on. member in __anon19b931500111::MachineLICM
324 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { in INITIALIZE_PASS_DEPENDENCY()
326 if (!CurLoop->getLoopPredecessor()) in INITIALIZE_PASS_DEPENDENCY()
329 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop()) in INITIALIZE_PASS_DEPENDENCY()
373 CurLoop = Worklist.pop_back_val(); in runOnMachineFunction()
379 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) { in runOnMachineFunction()
380 Worklist.append(CurLoop->begin(), CurLoop->end()); in runOnMachineFunction()
384 CurLoop->getExitBlocks(ExitBlocks); in runOnMachineFunction()
391 MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader()); in runOnMachineFunction()
524 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()
344 const MachineLoop *CurLoop = getLoopFor(MBB); in pickTraceSucc() local
351 if (CurLoop && Succ == CurLoop->getHeader()) in pickTraceSucc()
354 if (isExitingLoop(CurLoop, getLoopFor(Succ))) in pickTraceSucc()
|
| /external/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 351 const Loop *CurLoop) { in setPoint() argument
355 AssociatedLoop = CurLoop; in setPoint()
362 const Loop *CurLoop) { in setLine() argument
367 AssociatedLoop = CurLoop; in setLine()
372 const Loop *CurLoop) { in setDistance() argument
377 AssociatedLoop = CurLoop; in setDistance()
1029 const Loop *CurLoop, in strongSIVtest() argument
1049 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) { in strongSIVtest()
1082 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop); in strongSIVtest()
1094 NewConstraint.setDistance(Delta, CurLoop); in strongSIVtest()
[all …]
|
| D | ScalarEvolutionExpander.cpp | 687 const Loop *CurLoop = I->first; in visitAddExpr() local
697 for (; I != E && I->first == CurLoop; ++I) { in visitAddExpr()
714 for (++I; I != E && I->first == CurLoop; ++I) in visitAddExpr()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopInfo.h | 98 for (const LoopT *CurLoop = ParentLoop; CurLoop; in getLoopDepth() local
99 CurLoop = CurLoop->ParentLoop) in getLoopDepth()
|
| /external/llvm/lib/TableGen/ |
| D | TGParser.cpp | 318 ForeachLoop &CurLoop = Loops[IterVals.size()]; in ProcessForeachDefs() local
319 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue); in ProcessForeachDefs()
328 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal)); in ProcessForeachDefs()
|