Searched refs:ExitingBlock (Results 1 - 6 of 6) sorted by relevance

/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp629 BasicBlock *ExitingBlock = ExitingBlocks[i]; local
630 if (!ExitingBlock->getSinglePredecessor()) continue;
631 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
634 if (!CI || CI->getParent() != ExitingBlock) continue;
640 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) {
672 << ExitingBlock->getName() << "\n");
681 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock));
683 LI->removeBlock(ExitingBlock);
685 DomTreeNode *Node = DT->getNode(ExitingBlock);
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonHardwareLoops.cpp388 MachineBasicBlock *ExitingBlock = getExitingBlock(L); local
389 if (!Header || !Preheader || !Latch || !ExitingBlock)
437 bool NotAnalyzed = TII->AnalyzeBranch(*ExitingBlock, TB, FB, Cond, false);
556 MachineBasicBlock *ExitingBlock = getExitingBlock(L);
557 if (!ExitingBlock)
584 bool NotAnalyzed = TII->AnalyzeBranch(*ExitingBlock, TB, FB, Cond, false);
593 if (ExitingBlock != Latch && (TB == Latch || FB == Latch)) {
1181 MachineBasicBlock *ExitingBlock = getExitingBlock(L); local
1183 if (ExitingBlock != L->getLoopLatch()) {
1187 if (TII->AnalyzeBranch(*ExitingBlock, T
1570 MachineBasicBlock *ExitingBlock = getExitingBlock(L); local
1819 MachineBasicBlock *ExitingBlock = getExitingBlock(L); local
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DScalarEvolution.h432 AssertingVH<BasicBlock> ExitingBlock; member in struct:llvm::ScalarEvolution::ExitNotTakenInfo
436 ExitNotTakenInfo() : ExitingBlock(nullptr), ExactNotTaken(nullptr) {}
476 return ExitNotTaken.ExitingBlock || !isa<SCEVCouldNotCompute>(Max);
489 const SCEV *getExact(BasicBlock *ExitingBlock, ScalarEvolution *SE) const;
602 ExitLimit computeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
993 /// "trip count" assumes that control exits via ExitingBlock. More
994 /// precisely, it is the number of times that control may reach ExitingBlock
998 unsigned getSmallConstantTripCount(Loop *L, BasicBlock *ExitingBlock);
1013 /// via ExitingBlock.
1014 unsigned getSmallConstantTripMultiple(Loop *L, BasicBlock *ExitingBlock);
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopUnrollPass.cpp786 BasicBlock *ExitingBlock = L->getLoopLatch(); local
787 if (!ExitingBlock || !L->isLoopExiting(ExitingBlock))
788 ExitingBlock = L->getExitingBlock();
789 if (ExitingBlock) {
790 TripCount = SE->getSmallConstantTripCount(L, ExitingBlock);
791 TripMultiple = SE->getSmallConstantTripMultiple(L, ExitingBlock);
H A DLoopStrengthReduce.cpp2091 for (BasicBlock *ExitingBlock : ExitingBlocks) {
2098 BranchInst *TermBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
2122 if (!DT.dominates(ExitingBlock, LatchBlock))
2127 if (LatchBlock != ExitingBlock)
2132 !DT.properlyDominates(UI->getUser()->getParent(), ExitingBlock)) {
2187 ExitingBlock->getInstList().insert(TermBr->getIterator(), Cond);
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DScalarEvolution.cpp4816 /// This "trip count" assumes that control exits via ExitingBlock. More
4817 /// precisely, it is the number of times that control may reach ExitingBlock
4822 BasicBlock *ExitingBlock) {
4823 assert(ExitingBlock && "Must pass a non-null exiting block!");
4824 assert(L->isLoopExiting(ExitingBlock) &&
4827 dyn_cast<SCEVConstant>(getExitCount(L, ExitingBlock));
4860 /// that control exits the loop via ExitingBlock.
4863 BasicBlock *ExitingBlock) {
4864 assert(ExitingBlock && "Must pass a non-null exiting block!");
4865 assert(L->isLoopExiting(ExitingBlock)
[all...]

Completed in 89 milliseconds