Lines Matching refs:getNumSuccessors

954   for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {  in GetBestDestForJumpOnUndef()
991     if (!TI->isExceptionalTerminator() && TI->getNumSuccessors() == 1 &&  in ProcessBlock()
1055     if (IB->getNumSuccessors() == 0) return false;  in ProcessBlock()
1083     Updates.reserve(BBTerm->getNumSuccessors());  in ProcessBlock()
1084     for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {  in ProcessBlock()
1418       OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) {  in SimplifyPartiallyRedundantLoad()
1447     assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 &&  in SimplifyPartiallyRedundantLoad()
1556       assert(i != TI->getNumSuccessors() && "Didn't find any successor!");  in FindMostPopularDest()
1663       Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1);  in ProcessThreadableEdges()
2012   for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)  in ThreadEdge()
2121   assert(TI->getNumSuccessors() > 1 && "not a split");  in doesBlockHaveProfileData()
2133   return WeightsNode->getNumOperands() == TI->getNumSuccessors() + 1;  in doesBlockHaveProfileData()
2593     Updates.reserve((2 * SplitBB->getTerminator()->getNumSuccessors()) + 3);  in TryToUnfoldSelectInCurrBB()
2663   assert(BI->getNumSuccessors() == 2 && "Wrong number of successors?");  in ThreadGuard()