Home
last modified time | relevance | path

Searched refs:BBLoop (Results 1 – 3 of 3) sorted by relevance

/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/BPF/
H A DBPFCheckAndAdjustIR.cpp353 Loop *BBLoop = LI.getLoopFor(BB); in sinkMinMax() local
355 return LI.getLoopFor(I->getParent()) != BBLoop; in sinkMinMax()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp837 if (Loop *BBLoop = LI->getLoopFor(BB)) { in ehAwareSplitEdge() local
851 if (LI->getLoopFor(P) != BBLoop) { in ehAwareSplitEdge()
920 if (Loop *BBLoop = LI->getLoopFor(BB)) { in ehAwareSplitEdge() local
924 if (BBLoop == SuccLoop) { in ehAwareSplitEdge()
927 } else if (BBLoop->contains(SuccLoop)) { in ehAwareSplitEdge()
929 BBLoop->addBasicBlockToLoop(NewBB, *LI); in ehAwareSplitEdge()
930 } else if (SuccLoop->contains(BBLoop)) { in ehAwareSplitEdge()
947 if (!BBLoop->contains(Succ)) { in ehAwareSplitEdge()
948 assert(!BBLoop->contains(NewBB) && in ehAwareSplitEdge()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopInfo.cpp707 Loop *getNearestLoop(BasicBlock *BB, Loop *BBLoop);
801 Loop *UnloopUpdater::getNearestLoop(BasicBlock *BB, Loop *BBLoop) { in getNearestLoop() argument
805 Loop *NearLoop = BBLoop; in getNearestLoop()
860 return BBLoop; in getNearestLoop()