Searched refs:isRecursivelyLCSSAForm (Results 1 – 13 of 13) sorted by relevance
| /llvm-project-15.0.7/llvm/unittests/Transforms/Utils/ |
| H A D | UnrollLoopTest.cpp | 71 bool PreserveLCSSA = L->isRecursivelyLCSSAForm(DT,LI); in TEST()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LCSSA.cpp | 343 assert(SubLoop->isRecursivelyLCSSAForm(DT, *LI) && "Subloop not in LCSSA!"); in formLCSSA() 446 return L->isRecursivelyLCSSAForm(*DT, *LI); in verifyAnalysis()
|
| H A D | LoopSimplify.cpp | 345 assert(NewOuter->isRecursivelyLCSSAForm(*DT, *LI) && in separateNestedLoop() 724 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in simplifyLoop() 825 *LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT, *LI); }); in runOnFunction()
|
| H A D | LoopUnrollAndJam.cpp | 618 assert(OutestLoop->isRecursivelyLCSSAForm(*DT, *LI)); in UnrollAndJamLoop()
|
| H A D | LoopUtils.cpp | 1267 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in rewriteLoopExitValues()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | LoopPass.cpp | 245 assert(CurrentLoop->isRecursivelyLCSSAForm(*DT, *LI)); in runOnFunction()
|
| H A D | LoopInfo.cpp | 465 bool Loop::isRecursivelyLCSSAForm(const DominatorTree &DT, const LoopInfo &LI, in isRecursivelyLCSSAForm() function in Loop
|
| /llvm-project-15.0.7/llvm/unittests/Analysis/ |
| H A D | LoopInfoTest.cpp | 1641 OuterLoop->isRecursivelyLCSSAForm(DT, LI, /*IgnoreTokens*/ true)); in TEST() 1643 OuterLoop->isRecursivelyLCSSAForm(DT, LI, /*IgnoreTokens*/ false)); in TEST() 1645 InnerLoop->isRecursivelyLCSSAForm(DT, LI, /*IgnoreTokens*/ true)); in TEST() 1647 InnerLoop->isRecursivelyLCSSAForm(DT, LI, /*IgnoreTokens*/ false)); in TEST()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPassManager.cpp | 270 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) && in run()
|
| H A D | IndVarSimplify.cpp | 1890 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run() 2061 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run()
|
| H A D | SimpleLoopUnswitch.cpp | 2457 assert(ChildL->isRecursivelyLCSSAForm(DT, LI) && in unswitchNontrivialInvariants() 3048 assert(L.isRecursivelyLCSSAForm(DT, LI) && in unswitchLoop()
|
| H A D | LoopStrengthReduce.cpp | 6620 if (L->isRecursivelyLCSSAForm(DT, LI) && L->getExitBlock()) { in ReduceLoopStrength()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LoopInfo.h | 824 bool isRecursivelyLCSSAForm(const DominatorTree &DT, const LoopInfo &LI,
|