Searched refs:isRecursivelyLCSSAForm (Results 1 – 10 of 10) sorted by relevance
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPassManager.cpp | 62 assert(L.isRecursivelyLCSSAForm(AR.DT, AR.LI) && in run()
|
| H A D | IndVarSimplify.cpp | 566 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in rewriteLoopExitValues() 2624 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run() 2751 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run()
|
| H A D | SimpleLoopUnswitch.cpp | 2226 assert(ChildL->isRecursivelyLCSSAForm(DT, LI) && in unswitchNontrivialInvariants() 2775 assert(L.isRecursivelyLCSSAForm(DT, LI) && in unswitchLoop()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 328 assert(NewOuter->isRecursivelyLCSSAForm(*DT, *LI) && in separateNestedLoop() 689 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in simplifyLoop() 781 *LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT, *LI); }); in runOnFunction()
|
| H A D | LCSSA.cpp | 402 return L->isRecursivelyLCSSAForm(*DT, *LI); in verifyAnalysis()
|
| H A D | LoopUnrollAndJam.cpp | 571 assert(OutestLoop->isRecursivelyLCSSAForm(*DT, *LI)); in UnrollAndJamLoop()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/Scalar/ |
| H A D | LoopPassManager.h | 345 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) &&
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | LoopPass.cpp | 267 assert(CurrentLoop->isRecursivelyLCSSAForm(*DT, *LI)); in runOnFunction()
|
| H A D | LoopInfo.cpp | 184 bool Loop::isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const { in isRecursivelyLCSSAForm() function in Loop
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | LoopInfo.h | 529 bool isRecursivelyLCSSAForm(DominatorTree &DT, const LoopInfo &LI) const;
|