Searched defs:ExitingBlock (Results 1 - 3 of 3) sorted by relevance

/external/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp640 BasicBlock *ExitingBlock = ExitingBlocks[i]; local
641 if (!ExitingBlock->getSinglePredecessor()) continue;
642 BranchInst *BI = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
645 if (!CI || CI->getParent() != ExitingBlock) continue;
651 for (BasicBlock::iterator I = ExitingBlock->begin(); &*I != BI; ) {
682 << ExitingBlock->getName() << "\n");
691 assert(pred_begin(ExitingBlock) == pred_end(ExitingBlock));
693 LI->removeBlock(ExitingBlock);
695 DomTreeNode *Node = DT->getNode(ExitingBlock);
[all...]
/external/llvm/include/llvm/Analysis/
H A DScalarEvolution.h290 AssertingVH<BasicBlock> ExitingBlock; member in struct:llvm::ScalarEvolution::ExitNotTakenInfo
294 ExitNotTakenInfo() : ExitingBlock(nullptr), ExactNotTaken(nullptr) {}
335 return ExitNotTaken.ExitingBlock || !isa<SCEVCouldNotCompute>(Max);
348 const SCEV *getExact(BasicBlock *ExitingBlock, ScalarEvolution *SE) const;
452 ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
755 /// ExitingBlock. More precisely, it is the number of times that control may
756 /// reach ExitingBlock before taking the branch. For loops with multiple
759 unsigned getSmallConstantTripCount(Loop *L, BasicBlock *ExitingBlock);
766 /// this assumes that control exits the loop via ExitingBlock.
767 unsigned getSmallConstantTripMultiple(Loop *L, BasicBlock *ExitingBlock);
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp2113 BasicBlock *ExitingBlock = ExitingBlocks[i]; local
2120 BranchInst *TermBr = dyn_cast<BranchInst>(ExitingBlock->getTerminator());
2144 if (!DT.dominates(ExitingBlock, LatchBlock))
2149 if (LatchBlock != ExitingBlock)
2154 !DT.properlyDominates(UI->getUser()->getParent(), ExitingBlock)) {
2207 ExitingBlock->getInstList().insert(TermBr, Cond);

Completed in 371 milliseconds