Searched refs:isRecursivelyLCSSAForm (Results 1 – 12 of 12) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 342 assert(NewOuter->isRecursivelyLCSSAForm(*DT, *LI) && in separateNestedLoop()
708 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in simplifyLoop()
815 *LI, [&](Loop *L) { return L->isRecursivelyLCSSAForm(*DT, *LI); }); in runOnFunction()
|
| H A D | LCSSA.cpp | 388 assert(SubLoop->isRecursivelyLCSSAForm(DT, *LI) && "Subloop not in LCSSA!"); in formLCSSAImpl()
503 return L->isRecursivelyLCSSAForm(*DT, *LI); in verifyAnalysis()
|
| H A D | LoopUnrollAndJam.cpp | 615 assert(OutestLoop->isRecursivelyLCSSAForm(*DT, *LI)); in UnrollAndJamLoop()
|
| H A D | LoopUtils.cpp | 1562 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in rewriteLoopExitValues()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopIdiomVectorize.cpp | 876 if (!VectorLoop->isRecursivelyLCSSAForm(*DT, *LI)) in expandFindMismatch()
878 if (!ScalarLoop->isRecursivelyLCSSAForm(*DT, *LI)) in expandFindMismatch()
987 if (!CurLoop->getParentLoop()->isRecursivelyLCSSAForm(*DT, *LI)) in transformByteCompare()
1380 if (!OuterLoop->isRecursivelyLCSSAForm(*DT, *LI)) in expandFindFirstByte()
1415 if (!CurLoop->getParentLoop()->isRecursivelyLCSSAForm(*DT, *LI)) in transformFindFirstByte()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopPass.cpp | 246 assert(CurrentLoop->isRecursivelyLCSSAForm(*DT, *LI)); in runOnFunction()
|
| H A D | LoopInfo.cpp | 470 bool Loop::isRecursivelyLCSSAForm(const DominatorTree &DT, const LoopInfo &LI, in isRecursivelyLCSSAForm() function in Loop
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPassManager.cpp | 278 assert(L->isRecursivelyLCSSAForm(LAR.DT, LI) && in run()
|
| H A D | IndVarSimplify.cpp | 1879 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run()
2032 assert(L->isRecursivelyLCSSAForm(*DT, *LI) && in run()
|
| H A D | SimpleLoopUnswitch.cpp | 2596 assert(ChildL->isRecursivelyLCSSAForm(DT, LI) && in unswitchNontrivialInvariants()
3599 assert(L.isRecursivelyLCSSAForm(DT, LI) && in unswitchLoop()
|
| H A D | LoopStrengthReduce.cpp | 7075 if (L->isRecursivelyLCSSAForm(DT, LI) && L->getExitBlock()) { in ReduceLoopStrength()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LoopInfo.h | 320 bool isRecursivelyLCSSAForm(const DominatorTree &DT, const LoopInfo &LI,
|