Searched refs:CurLoop (Results 1 - 9 of 9) sorted by relevance

/external/llvm/lib/Transforms/Scalar/
H A DLICM.cpp74 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 in struct:__anon11025::LICM
204 CurLoop = L;
222 computeLICMSafetyInfo(&SafetyInfo, CurLoop);
235 Changed |= sinkRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI, CurLoop,
291 sinkRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, AliasSetTracker *CurAST, LICMSafetyInfo *SafetyInfo) argument
349 hoistRegion(DomTreeNode *N, AliasAnalysis *AA, LoopInfo *LI, DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, AliasSetTracker *CurAST, LICMSafetyInfo *SafetyInfo) argument
400 computeLICMSafetyInfo(LICMSafetyInfo * SafetyInfo, Loop * CurLoop) argument
423 canSinkOrHoistInst(Instruction &I, AliasAnalysis *AA, DominatorTree *DT, Loop *CurLoop, AliasSetTracker *CurAST, LICMSafetyInfo *SafetyInfo) argument
505 isNotUsedInLoop(Instruction &I, Loop *CurLoop) argument
570 sink(Instruction &I, LoopInfo *LI, DominatorTree *DT, Loop *CurLoop, AliasSetTracker *CurAST ) argument
640 isSafeToExecuteUnconditionally(Instruction &Inst, DominatorTree *DT, Loop *CurLoop, LICMSafetyInfo *SafetyInfo) argument
650 isGuaranteedToExecute(Instruction &Inst, DominatorTree *DT, Loop *CurLoop, LICMSafetyInfo * SafetyInfo) argument
770 promoteLoopAccessesToScalars(AliasSet &AS, SmallVectorImpl<BasicBlock*>&ExitBlocks, SmallVectorImpl<Instruction*>&InsertPts, PredIteratorCache &PIC, LoopInfo *LI, DominatorTree *DT, Loop *CurLoop, AliasSetTracker *CurAST, LICMSafetyInfo * SafetyInfo) argument
992 inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI) argument
[all...]
H A DLoopIdiomRecognize.cpp95 Loop *CurLoop; member in class:__anon11029::NclPopcountRecognize
132 Loop *CurLoop; member in class:__anon11029::LoopIdiomRecognize
203 *CurLoop->getHeader()->getParent()));
206 Loop *getLoop() const { return CurLoop; }
276 LIR(TheLIR), CurLoop(TheLIR.getLoop()), PreCondBB(nullptr) {
290 if (CurLoop->getNumBackEdges() != 1 || CurLoop->getNumBlocks() != 1)
293 BasicBlock *LoopBody = *(CurLoop->block_begin());
300 BasicBlock *PreHead = CurLoop->getLoopPreheader();
365 LoopEntry = *(CurLoop
[all...]
/external/llvm/lib/CodeGen/
H A DMachineLICM.cpp88 MachineLoop *CurLoop; // The current loop we are working on. member in class:__anon10436::MachineLICM
89 MachineBasicBlock *CurPreheader; // The preheader for CurLoop.
91 // Exit blocks for CurLoop.
324 static bool LoopIsOuterMostWithPredecessor(MachineLoop *CurLoop) { argument
326 if (!CurLoop->getLoopPredecessor())
329 for (MachineLoop *L = CurLoop->getParentLoop(); L; L = L->getParentLoop())
373 CurLoop = Worklist.pop_back_val();
379 if (PreRegAlloc && !LoopIsOuterMostWithPredecessor(CurLoop)) {
380 Worklist.append(CurLoop->begin(), CurLoop
[all...]
H A DPHIElimination.cpp554 const MachineLoop *CurLoop = MLI ? MLI->getLoopFor(&MBB) : nullptr; local
555 bool IsLoopHeader = CurLoop && &MBB == CurLoop->getHeader();
572 if (IsLoopHeader && PreLoop == CurLoop && !SplitAllCriticalEdges)
601 if (!ShouldSplit && CurLoop != PreLoop) {
605 if (CurLoop) dbgs() << "CurLoop: " << *CurLoop;
610 // Split unless this edge is entering CurLoop from an outer loop.
611 ShouldSplit = PreLoop && !PreLoop->contains(CurLoop);
[all...]
H A DMachineTraceMetrics.cpp316 const MachineLoop *CurLoop = getLoopFor(MBB); local
318 if (CurLoop && MBB == CurLoop->getHeader())
344 const MachineLoop *CurLoop = getLoopFor(MBB); local
351 if (CurLoop && Succ == CurLoop->getHeader())
353 // Don't consider successors exiting CurLoop.
354 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
/external/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp351 const Loop *CurLoop) {
355 AssociatedLoop = CurLoop;
362 const Loop *CurLoop) {
367 AssociatedLoop = CurLoop;
372 const Loop *CurLoop) {
377 AssociatedLoop = CurLoop;
1029 const Loop *CurLoop,
1049 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) {
1082 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop);
1094 NewConstraint.setDistance(Delta, CurLoop);
349 setPoint(const SCEV *X, const SCEV *Y, const Loop *CurLoop) argument
359 setLine(const SCEV *AA, const SCEV *BB, const SCEV *CC, const Loop *CurLoop) argument
371 setDistance(const SCEV *D, const Loop *CurLoop) argument
1026 strongSIVtest(const SCEV *Coeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument
1165 weakCrossingSIVtest(const SCEV *Coeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint, const SCEV *&SplitIter) const argument
1387 exactSIVtest(const SCEV *SrcCoeff, const SCEV *DstCoeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument
1599 weakZeroSrcSIVtest(const SCEV *DstCoeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument
1710 weakZeroDstSIVtest(const SCEV *SrcCoeff, const SCEV *SrcConst, const SCEV *DstConst, const Loop *CurLoop, unsigned Level, FullDependence &Result, Constraint &NewConstraint) const argument
2072 const Loop *CurLoop = SrcAddRec->getLoop(); local
2094 const Loop *CurLoop = SrcAddRec->getLoop(); local
2104 const Loop *CurLoop = DstAddRec->getLoop(); local
2346 const Loop *CurLoop = AddRec->getLoop(); local
3025 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); local
3052 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); local
3126 const Loop *CurLoop = CurConstraint.getAssociatedLoop(); local
[all...]
H A DScalarEvolutionExpander.cpp687 const Loop *CurLoop = I->first; local
697 for (; I != E && I->first == CurLoop; ++I) {
714 for (++I; I != E && I->first == CurLoop; ++I)
/external/llvm/include/llvm/Analysis/
H A DLoopInfo.h98 for (const LoopT *CurLoop = ParentLoop; CurLoop;
99 CurLoop = CurLoop->ParentLoop)
/external/llvm/lib/TableGen/
H A DTGParser.cpp318 ForeachLoop &CurLoop = Loops[IterVals.size()]; local
319 ListInit *List = dyn_cast<ListInit>(CurLoop.ListValue);
328 IterVals.push_back(IterRecord(CurLoop.IterVar, ItemVal));

Completed in 162 milliseconds