Home
last modified time | relevance | path

Searched refs:isRecursivelyLCSSAForm (Results 1 – 10 of 10) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp343 assert(SubLoop->isRecursivelyLCSSAForm(DT, *LI) && "Subloop not in LCSSA!"); in formLCSSA()
445 return L->isRecursivelyLCSSAForm(*DT, *LI); in verifyAnalysis()
H A DLoopSimplify.cpp351 assert(NewOuter->isRecursivelyLCSSAForm(*DT, *LI) && in separateNestedLoop()
730 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in simplifyLoop()
834 *LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT, *LI); }); in runOnFunction()
H A DLoopUnrollAndJam.cpp620 assert(OutestLoop->isRecursivelyLCSSAForm(*DT, *LI)); in UnrollAndJamLoop()
H A DLoopUtils.cpp1240 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in rewriteLoopExitValues()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopPassManager.cpp252 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) && in run()
H A DIndVarSimplify.cpp1726 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run()
1894 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run()
H A DSimpleLoopUnswitch.cpp2407 assert(ChildL->isRecursivelyLCSSAForm(DT, LI) && in unswitchNontrivialInvariants()
3000 assert(L.isRecursivelyLCSSAForm(DT, LI) && in unswitchLoop()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopPass.cpp248 assert(CurrentLoop->isRecursivelyLCSSAForm(*DT, *LI)); in runOnFunction()
H A DLoopInfo.cpp468 bool Loop::isRecursivelyLCSSAForm(const DominatorTree &DT, in isRecursivelyLCSSAForm() function in Loop
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopInfo.h802 bool isRecursivelyLCSSAForm(const DominatorTree &DT,