HomeSort by: relevance | last modified time | path
    Searched refs:getLoop (Results 1 - 25 of 33) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolutionNormalization.cpp 54 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap);
93 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap);
100 return Loops.count(AR->getLoop());
114 return Loops.count(AR->getLoop());
BranchProbabilityInfo.cpp 255 return (DstBlock.getLoop() &&
256 !DstBlock.getLoop()->contains(SrcBlock.getLoop())) ||
275 ((DstBlock.getLoop() &&
276 DstBlock.getLoop()->getHeader() == DstBlock.getBlock()) ||
283 if (LB.getLoop()) {
284 auto *Header = LB.getLoop()->getHeader();
294 if (LB.getLoop()) {
295 LB.getLoop()->getExitBlocks(Exits);
835 if (LoopBB.getLoop())
    [all...]
ScalarEvolutionDivision.cpp 142 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(),
144 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(),
IVUsers.cpp 66 if (AR->getLoop() == L)
257 auto *L = AR->getLoop();
397 if (AR->getLoop() == L)
LoopCacheAnalysis.cpp 86 assert(AR->getLoop() && "AR should have a loop");
375 AccessFnAR->getLoop(),
439 return (AR != nullptr) ? AR->getLoop() != &L
449 assert(AR->getLoop() && "AR should have a loop");
DependenceAnalysis.cpp 896 const SCEV *UB = SE->getBackedgeTakenCount(AddRec->getLoop());
907 Loops.set(mapSrcLoop(AddRec->getLoop()));
909 Loops.set(mapDstLoop(AddRec->getLoop()));
1028 const SCEV *BECount = SE->getBackedgeTakenCount(AddRec->getLoop());
2153 const Loop *CurLoop = SrcAddRec->getLoop();
2154 assert(CurLoop == DstAddRec->getLoop() &&
2175 const Loop *CurLoop = SrcAddRec->getLoop();
2185 const Loop *CurLoop = DstAddRec->getLoop();
2228 SrcLoop = SrcAddRec->getLoop();
2231 DstLoop = DstAddRec->getLoop();
    [all...]
ScalarEvolution.cpp 297 AR->getLoop()->getHeader()->printAsOperand(OS, /*PrintType=*/false);
746 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();
1252 return getAddRecExpr(Operands, AddRec->getLoop(), SCEV::FlagAnyWrap);
1370 const Loop *L = AR->getLoop();
1620 const Loop *L = AR->getLoop();
1960 const Loop *L = AR->getLoop();
2140 return getAddRecExpr(Ops, AR->getLoop(), SCEV::FlagNW);
2616 const Loop *AddRecLoop = AddRec->getLoop();
2668 cast<SCEVAddRecExpr>(Ops[OtherIdx])->getLoop()->getHeader()
    [all...]
LoopUnrollAnalyzer.cpp 44 if (!AR || AR->getLoop() != L)
IVDescriptors.cpp 1075 const Loop *L = AR->getLoop();
1202 if (AR->getLoop() != TheLoop) {
1211 Phi->getIncomingValueForBlock(AR->getLoop()->getLoopPreheader());
1213 BasicBlock *Latch = AR->getLoop()->getLoopLatch();
Loads.cpp 294 if (!AddRec || AddRec->getLoop() != L || !AddRec->isAffine())
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
BranchProbabilityInfo.h 303 Loop *getLoop() const { return LD.first; }
306 bool belongsToLoop() const { return getLoop() || getSccNum() != -1; }
308 return (LB.getLoop() && getLoop() == LB.getLoop()) ||
LoopNestAnalysis.h 92 Loop *getLoop(unsigned Index) const {
IVUsers.h 124 Loop *getLoop() const { return L; }
LoopIterator.h 120 Loop *getLoop() const { return L; }
ScalarEvolutionExpressions.h 363 const Loop *getLoop() const { return L; }
373 getLoop(), FlagAnyWrap);
796 : SE.getAddRecExpr(Operands, Expr->getLoop(),
897 const Loop *L = Expr->getLoop();
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ModuloSchedule.h 118 MachineLoop *getLoop() const { return Loop; }
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
MVETailPredication.cpp 323 if (AddExpr->getLoop() != L) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCLoopInstrFormPrep.cpp 368 if (!LARSCEV || LARSCEV->getLoop() != L)
503 assert(BasePtrSCEV->getLoop() == L && "AddRec for the wrong loop?");
848 if (!LARSCEV || LARSCEV->getLoop() != L)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
ScalarEvolutionExpander.cpp 347 S = SE.getAddRecExpr(Start, Step, A->getLoop(),
400 A->getLoop(),
680 L = AR->getLoop();
926 A->getLoop(),
1392 const Loop *L = S->getLoop();
1411 Normalized->getLoop(),
1430 Start, Step, Normalized->getLoop(),
1559 const Loop *L = S->getLoop();
1575 Value *V = expand(SE.getAddRecExpr(NewOps, S->getLoop(),
2489 SE.getPredicatedBackedgeTakenCount(AR->getLoop(), Pred)
    [all...]
SimplifyIndVar.cpp 862 if (AR && AR->getLoop() == L)
1395 if (!AddRec || AddRec->getLoop() != L)
1436 if (!AddRec || AddRec->getLoop() != L)
1624 if (!AddRecOp1 || AddRecOp1->getLoop() != L)
1891 if (!AddRec || AddRec->getLoop() != L)
LoopPeel.cpp 231 if (!LeftAR->isAffine() || LeftAR->getLoop() != &L)
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ModuloSchedule.cpp 67 BB = Schedule.getLoop()->getTopBlock();
1984 KernelRewriter KR(*Schedule.getLoop(), Schedule);
1989 BB = Schedule.getLoop()->getTopBlock();
1990 Preheader = Schedule.getLoop()->getLoopPreheader();
2001 BB = Schedule.getLoop()->getTopBlock();
2002 Preheader = Schedule.getLoop()->getLoopPreheader();
2027 KernelRewriter KR(*Schedule.getLoop(), Schedule);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 429 AR->getLoop(), SCEV::FlagAnyWrap),
492 if (SAR && SAR->getLoop() == &L)
500 (cast<SCEVAddRecExpr>(S)->getLoop() == &L);
528 if (!SAR || SAR->getLoop() != &L) {
531 (cast<SCEVAddRecExpr>(S)->getLoop() == &L);
714 return SE.getAddRecExpr(Start, Step, AR->getLoop(), SCEV::FlagAnyWrap);
774 S = SE.getAddRecExpr(NewOps, AR->getLoop(),
800 S = SE.getAddRecExpr(NewOps, AR->getLoop(),
911 for (PHINode &PN : AR->getLoop()->getHeader()->phis()) {
1246 if (AR->getLoop() != L)
    [all...]
LoopIdiomRecognize.cpp 508 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine())
567 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine())
846 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine())
849 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine())
911 if (!Ev || Ev->getLoop() != CurLoop || !Ev->isAffine())
LoopFuse.cpp 1034 const Loop *ExprL = Expr->getLoop();
1097 return !DT.dominates(L0Header, AddRec->getLoop()->getHeader()) &&
1098 !DT.dominates(AddRec->getLoop()->getHeader(), L0Header);

Completed in 73 milliseconds

1 2