Searched refs:ExitingBB (Results 1 – 10 of 10) sorted by relevance
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | IndVarSimplify.cpp | 1079 if (ExitingBB == L->getLoopLatch()) { in linearFunctionTestReplace() 1407 if (LI->getLoopFor(ExitingBB) != L) in optimizeLoopExits() 1458 for (BasicBlock *ExitingBB : ExitingBlocks) { in optimizeLoopExits() 1505 foldExit(L, ExitingBB, true, DeadInsts); in optimizeLoopExits() 1527 foldExit(L, ExitingBB, false, DeadInsts); in optimizeLoopExits() 1537 foldExit(L, ExitingBB, false, DeadInsts); in optimizeLoopExits() 1581 auto BadExit = [&](BasicBlock *ExitingBB) { in predicateLoopExits() argument 1585 if (LI->getLoopFor(ExitingBB) != L) in predicateLoopExits() 1688 for (BasicBlock *ExitingBB : ExitingBlocks) { in predicateLoopExits() 1819 if (LI->getLoopFor(ExitingBB) != L) in run() [all …]
|
| H A D | LoopPredication.cpp | 1011 for (BasicBlock *ExitingBB : ExitingBlocks) { in getMinAnalyzeableBackedgeTakenCount() 1012 const SCEV *ExitCount = SE.getExitCount(L, ExitingBB); in getMinAnalyzeableBackedgeTakenCount() 1015 assert(DT.dominates(ExitingBB, L->getLoopLatch()) && in getMinAnalyzeableBackedgeTakenCount() 1077 for (auto *ExitingBB : ExitingBlocks) { in predicateLoopExits() local 1078 if (LI->getLoopFor(ExitingBB) != L) in predicateLoopExits() 1120 for (BasicBlock *ExitingBB : ExitingBlocks) { in predicateLoopExits() 1124 if (LI->getLoopFor(ExitingBB) != L) in predicateLoopExits() 1128 auto *BI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); in predicateLoopExits() 1136 const SCEV *ExitCount = SE->getExitCount(L, ExitingBB); in predicateLoopExits() 1142 const bool ExitIfTrue = !L->contains(*succ_begin(ExitingBB)); in predicateLoopExits() [all …]
|
| H A D | LoopBoundSplit.cpp | 195 BasicBlock *ExitingBB = L.getExitingBlock(); in canSplitLoopBound() local 197 if (!ExitingBB) in canSplitLoopBound() 200 BranchInst *ExitingBI = dyn_cast<BranchInst>(ExitingBB->getTerminator()); in canSplitLoopBound()
|
| H A D | LoopUnrollPass.cpp | 629 BasicBlock *ExitingBB, *ExitBB; in analyzeLoopUnrollCost() local 630 std::tie(ExitingBB, ExitBB) = ExitWorklist.pop_back_val(); in analyzeLoopUnrollCost() 637 Value *Op = PN->getIncomingValueForBlock(ExitingBB); in analyzeLoopUnrollCost()
|
| H A D | SimpleLoopUnswitch.cpp | 179 static bool areLoopExitPHIsLoopInvariant(Loop &L, BasicBlock &ExitingBB, in areLoopExitPHIsLoopInvariant() argument 189 if (!L.isLoopInvariant(PN->getIncomingValueForBlock(&ExitingBB))) in areLoopExitPHIsLoopInvariant()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineBlockPlacement.cpp | 2158 MachineBasicBlock *ExitingBB = nullptr; in findBestLoopExit() local 2177 MachineBasicBlock *OldExitingBB = ExitingBB; in findBestLoopExit() 2218 if (!ExitingBB || SuccLoopDepth > BestExitLoopDepth || in findBestLoopExit() 2223 ExitingBB = MBB; in findBestLoopExit() 2229 ExitingBB = OldExitingBB; in findBestLoopExit() 2235 if (!ExitingBB) { in findBestLoopExit() 2249 !BlocksExitingToOuterLoop.count(ExitingBB)) in findBestLoopExit() 2255 return ExitingBB; in findBestLoopExit() 2301 if (!ExitingBB) in rotateLoop() 2308 if (Bottom == ExitingBB) in rotateLoop() [all …]
|
| H A D | ModuloSchedule.cpp | 1746 MachineBasicBlock *ExitingBB = CreateLCSSAExitingBlock(); in peelPrologAndEpilogs() local 1747 EliminateDeadPhis(ExitingBB, MRI, LIS, /*KeepSingleSrcPhi=*/true); in peelPrologAndEpilogs() 1839 EliminateDeadPhis(ExitingBB, MRI, LIS); in peelPrologAndEpilogs()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopSimplify.cpp | 626 for (auto *ExitingBB : ExitingBlocks) in simplifyOneLoop() local 627 for (auto *SuccBB : successors(ExitingBB)) { in simplifyOneLoop()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 6635 auto *ExitingBB = L->getExitingBlock(); in isAddRecNeverPoison() local 6637 if (!ExitingBB || !LatchBB || ExitingBB != LatchBB) in isAddRecNeverPoison() 7194 for (auto *ExitingBB : ExitingBlocks) { in getSmallConstantTripMultiple() local 7195 unsigned Multiple = getSmallConstantTripMultiple(L, ExitingBB); in getSmallConstantTripMultiple() 13883 for (BasicBlock *ExitingBB : ExitingBlocks) { in computeSymbolicMaxBackedgeTakenCount() 13884 const SCEV *ExitCount = getExitCount(L, ExitingBB); in computeSymbolicMaxBackedgeTakenCount() 13886 ExitCount = getExitCount(L, ExitingBB, in computeSymbolicMaxBackedgeTakenCount() 13889 assert(DT.dominates(ExitingBB, L->getLoopLatch()) && in computeSymbolicMaxBackedgeTakenCount()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 1761 BasicBlock *ExitingBB,
|