HomeSort by: relevance | last modified time | path
    Searched refs:LAR (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
LoopVersioningLICM.h 20 LoopStandardAnalysisResults &LAR, LPMUpdater &U);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopPassManager.cpp 204 LoopStandardAnalysisResults LAR = {AM.getResult<AAManager>(F),
241 PI.pushBeforeNonSkippedPassCallback([&LAR, &LI](StringRef PassID, Any IR) {
252 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) &&
279 PassPA = Pass->run(*L, LAM, LAR, Updater);
290 // Note that we don't LAR.SE.verify() because that can change observed SE
293 LAR.DT.verify();
295 LAR.LI.verify(LAR.DT);
296 if (LAR.MSSA && VerifyMemorySSA)
297 LAR.MSSA->verifyMemorySSA()
    [all...]
LoopVersioningLICM.cpp 667 LoopStandardAnalysisResults &LAR,
669 AliasAnalysis *AA = &LAR.AA;
670 ScalarEvolution *SE = &LAR.SE;
671 DominatorTree *DT = &LAR.DT;
672 LoopInfo *LI = &LAR.LI;
677 return AM.getResult<LoopAccessAnalysis>(*L, LAR);
  /src/usr.bin/make/unit-tests/
varmod.mk 32 # example, ${VAR:LAR=ALUE} and ${VAR:L:AR=ALUE} behave the same.
244 .if ${VAR:LAR=ALUE} != "VALUE"
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorizationLegality.cpp 865 const OptimizationRemarkAnalysis *LAR = LAI->getReport();
866 if (LAR) {
869 "loop not vectorized: ", *LAR);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 10519 const auto *LAR = cast<SCEVAddRecExpr>(Less);
10522 if (LAR->getLoop() != MAR->getLoop())
10527 if (!LAR->isAffine() || !MAR->isAffine())
10530 if (LAR->getStepRecurrence(*this) != MAR->getStepRecurrence(*this))
10533 Less = LAR->getStart();
10844 const SCEVAddRecExpr *LAR = dyn_cast<SCEVAddRecExpr>(LHS);
10845 if (!LAR)
10850 if (LAR->getLoop() != RAR->getLoop())
10852 if (!LAR->isAffine() || !RAR->isAffine())
10855 if (LAR->getStepRecurrence(SE) != RAR->getStepRecurrence(SE)
    [all...]

Completed in 23 milliseconds