| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 470 assert(!TheLoop->isInnermost() && "We are not vectorizing an outer loop."); in canVectorizeOuterLoop()
1202 assert((UseVPlanNativePath || Lp->isInnermost()) && in canVectorizeLoopCFG()
1288 if (!TheLoop->isInnermost()) { in canVectorize()
1305 assert(TheLoop->isInnermost() && "Inner loop expected."); in canVectorize()
|
| H A D | LoopVectorize.cpp | 2119 assert(!OuterLp->isInnermost() && "This is not an outer loop"); in isExplicitVecOuterLoop()
2152 if (L.isInnermost() || VPlanBuildStressTest || in collectSupportedLoops()
7391 if (!OrigLoop->isInnermost()) { in planInVPlanNativePath()
7430 assert(OrigLoop->isInnermost() && "Inner loop expected."); in plan()
8548 assert(OrigLoop->isInnermost() && "Inner loop expected."); in buildVPlansWithVPRecipes()
9057 assert(!OrigLoop->isInnermost()); in buildVPlan()
10040 assert((EnableVPlanNativePath || L->isInnermost()) && in processLoop()
10102 if (!L->isInnermost()) in processLoop()
10106 assert(L->isInnermost() && "Inner loop expected."); in processLoop()
|
| /llvm-project-15.0.7/polly/include/polly/CodeGen/ |
| H A D | IslAst.h | 134 static bool isInnermost(const isl::ast_node &Node);
|
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64FalkorHWPFFix.cpp | 149 if (!L.isInnermost()) in runOnLoop()
833 if (L->isInnermost()) in runOnMachineFunction()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopDistribute.cpp | 665 assert(L->isInnermost() && "Only process inner loops."); in processLoop()
983 if (L->isInnermost()) in runImpl()
|
| H A D | LoopDataPrefetch.cpp | 278 if (!L->isInnermost()) in runOnLoop()
|
| H A D | LoopBoundSplit.cpp | 186 if (!L.isInnermost()) in canSplitLoopBound()
|
| H A D | LoopLoadElimination.cpp | 626 if (L->isInnermost()) in eliminateLoadsAcrossLoops()
|
| H A D | LoopFuse.cpp | 1497 while (!FC1.L->isInnermost()) { in performFusion()
1789 while (!FC1.L->isInnermost()) { in fuseGuardedLoops()
|
| H A D | LoopUnrollPass.cpp | 360 if (!L->isInnermost()) in analyzeLoopUnrollCost()
|
| H A D | LoopInterchange.cpp | 1254 while (!NewOuter->isInnermost()) in restructureLoops()
|
| H A D | SimpleLoopUnswitch.cpp | 1300 if (OrigRootL.isInnermost()) in cloneLoopNest()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LoopVersioning.cpp | 269 if (L->isInnermost()) in runImpl()
|
| H A D | LoopPeel.cpp | 372 if (!PP.AllowLoopNestsPeeling && !L->isInnermost()) in computePeelCount()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | SelectOptimize.cpp | 283 if (L && L->isInnermost()) in optimizeSelectsBase()
301 if (!L->isInnermost()) in optimizeSelectsInnerLoops()
|
| /llvm-project-15.0.7/polly/lib/CodeGen/ |
| H A D | IslAst.cpp | 572 bool IslAstInfo::isInnermost(const isl::ast_node &Node) { in isInnermost() function in IslAstInfo
610 if (!PollyParallelForce && isInnermost(Node)) in isExecutedInParallel()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | LoopNestAnalysis.cpp | 112 assert(!OuterLoop.isInnermost() && "Outer loop should have subloops"); in analyzeLoopNestForPerfectNest()
|
| H A D | LoopInfo.cpp | 780 while (!Unloop.isInnermost()) { in updateSubloopParents()
900 while (!Unloop->isInnermost()) in erase()
|
| H A D | LoopAccessAnalysis.cpp | 2079 if (!TheLoop->isInnermost()) { in canAnalyzeLoop()
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonTargetTransformInfo.cpp | 76 if (L && L->isInnermost() && canPeel(L) && in getPeelingPreferences()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LoopInfo.h | 181 bool isInnermost() const { return getSubLoops().empty(); } in isInnermost() function
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUTargetTransformInfo.cpp | 257 if (L->isInnermost() && BB->size() < UnrollMaxBlockToAnalyze) in getUnrollingPreferences()
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 1281 if (!L->isInnermost()) in runOnLoop()
|
| /llvm-project-15.0.7/llvm/unittests/Transforms/Scalar/ |
| H A D | LoopPassManagerTest.cpp | 1396 assert(L.isInnermost() && "Can only delete leaf loops with this routine!"); in TEST_F()
|
| /llvm-project-15.0.7/flang/lib/Lower/ |
| H A D | Bridge.cpp | 1150 bool isInnermost = &info == &incrementLoopNestInfo.back(); in genFIR() local
1153 info.bodyBlock = isInnermost ? bodyBlock : createNextBeginBlock(); in genFIR()
|