reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

Declarations

include/llvm/IR/Instruction.h
  669   unsigned getNumSuccessors() const;

References

include/llvm/Analysis/CFGPrinter.h
  153     if (TI->getNumSuccessors() == 1)
include/llvm/Analysis/RegionInfo.h
  101     return BB->getTerminator()->getNumSuccessors();
include/llvm/Analysis/SparsePropagation.h
  289   Succs.resize(TI.getNumSuccessors());
  290   if (TI.getNumSuccessors() == 0)
  349     Succs.assign(TI.getNumSuccessors(), true);
  361     Succs.assign(TI.getNumSuccessors(), true);
  375   for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
include/llvm/IR/CFG.h
  153     return Idx >= 0 && (Idx == 0 || Idx <= (int)Inst->getNumSuccessors());
  184       Idx = Inst->getNumSuccessors();
include/llvm/Transforms/Utils/BasicBlockUtils.h
  191   for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
  207     assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
lib/Analysis/BranchProbabilityInfo.cpp
  145   if (TI->getNumSuccessors() == 0) {
  177   if (TI->getNumSuccessors() == 0)
  213   assert(TI->getNumSuccessors() > 1 && "expected more than one successor!");
  256   assert(TI->getNumSuccessors() > 1 && "expected more than one successor!");
  265   assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors");
  269   if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1)
  279   Weights.reserve(TI->getNumSuccessors());
  294   assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
  303     for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
  312     for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
  314     WeightSum = TI->getNumSuccessors();
  319   for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
  342   for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
  359   assert(TI->getNumSuccessors() > 1 && "expected more than one successor!");
  986     if (BB->getTerminator()->getNumSuccessors() < 2)
lib/Analysis/CFG.cpp
   76   unsigned e = Term->getNumSuccessors();
   90   assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
   97   if (TI->getNumSuccessors() == 1) return false;
lib/Analysis/CaptureTracking.cpp
  115             !BB->getTerminator()->getNumSuccessors())
lib/Analysis/DivergenceAnalysis.cpp
  111   if (Term.getNumSuccessors() <= 1)
lib/Analysis/InlineCost.cpp
 1888     for (unsigned TIdx = 0, TSize = TI->getNumSuccessors(); TIdx != TSize;
 1896     if (SingleBB && TI->getNumSuccessors() > 1) {
lib/Analysis/LegacyDivergenceAnalysis.cpp
  273       if (I->isTerminator() && I->getNumSuccessors() > 1)
lib/Analysis/MustExecute.cpp
  480   if (PP->getNumSuccessors() == 0) {
  487   if (PP->getNumSuccessors() == 1) {
lib/Analysis/SyncDependenceAnalysis.cpp
  360   if (Term.getNumSuccessors() < 1) {
lib/CodeGen/SelectionDAG/FastISel.cpp
 2259   for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp
 9934   for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) {
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp
  375         if (Pred->getTerminator()->getNumSuccessors() == 1)
lib/IR/BasicBlock.cpp
  397   assert(Term->getNumSuccessors() > 0);
lib/IR/Core.cpp
 2888   return unwrap<Instruction>(Term)->getNumSuccessors();
lib/IR/Dominators.cpp
   45   for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
lib/IR/Instruction.cpp
  681   for (unsigned Idx = 0, NumSuccessors = Instruction::getNumSuccessors();
lib/Target/PowerPC/PPCISelDAGToDAG.cpp
  524   if (BBTerm->getNumSuccessors() != 2) return PPC::BR_NO_HINT;
lib/Target/XCore/XCoreLowerThreadLocal.cpp
  139               if (PredBB->getTerminator()->getNumSuccessors() > 1)
lib/Transforms/Coroutines/CoroElide.cpp
  159     if (TI->getNumSuccessors() == 0 && !TI->isExceptionalTerminator() &&
lib/Transforms/IPO/SampleProfile.cpp
 1457     if (TI->getNumSuccessors() == 1)
 1470     for (unsigned I = 0; I < TI->getNumSuccessors(); ++I) {
lib/Transforms/InstCombine/InstCombinePHI.cpp
  558       FirstLI->getParent()->getTerminator()->getNumSuccessors() != 1)
  586         LI->getParent()->getTerminator()->getNumSuccessors() != 1)
lib/Transforms/Instrumentation/CFGMST.h
  125       if (int successors = TI->getNumSuccessors()) {
  152           if (TargetTI && !TargetTI->getNumSuccessors()) {
lib/Transforms/Instrumentation/GCOVProfiling.cpp
  721         if (int successors = TI->getNumSuccessors()) {
lib/Transforms/Instrumentation/PGOInstrumentation.cpp
  616     for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) {
  774   if (TI->getNumSuccessors() <= 1)
 1294     if (TI->getNumSuccessors() < 2)
lib/Transforms/ObjCARC/ObjCARCOpts.cpp
  957         else if (PN->getIncomingBlock(i)->getTerminator()->getNumSuccessors() !=
lib/Transforms/Scalar/DeadStoreElimination.cpp
  646     if (PredTI->getNumSuccessors() != 1)
 1307   if (BB.getTerminator()->getNumSuccessors() == 0)
lib/Transforms/Scalar/GVN.cpp
 1072     if (TmpBB->getTerminator()->getNumSuccessors() != 1)
 1107     if (Pred->getTerminator()->getNumSuccessors() != 1) {
lib/Transforms/Scalar/GVNHoist.cpp
  580     if (TI->getNumSuccessors() > (unsigned)size(C))
lib/Transforms/Scalar/GVNSink.cpp
  779     if ((*I)->getTerminator()->getNumSuccessors() != 1)
lib/Transforms/Scalar/JumpThreading.cpp
  970   for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {
 1007     if (!TI->isExceptionalTerminator() && TI->getNumSuccessors() == 1 &&
 1099     Updates.reserve(BBTerm->getNumSuccessors());
 1100     for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {
 1439       OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) {
 1470     assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 &&
 1578       assert(i != TI->getNumSuccessors() && "Didn't find any successor!");
 1682       Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1);
 2037   for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)
 2146   assert(TI->getNumSuccessors() > 1 && "not a split");
 2158   return WeightsNode->getNumOperands() == TI->getNumSuccessors() + 1;
 2618     Updates.reserve((2 * SplitBB->getTerminator()->getNumSuccessors()) + 3);
lib/Transforms/Scalar/LoopPredication.cpp
  921   assert(LatchTerm->getNumSuccessors() == 2 &&
lib/Transforms/Scalar/LoopStrengthReduce.cpp
 5318       if (e != 1 && BB->getTerminator()->getNumSuccessors() > 1 &&
lib/Transforms/Scalar/LoopUnswitch.cpp
 1314     assert(NewExit->getTerminator()->getNumSuccessors() == 1 &&
lib/Transforms/Scalar/NewGVN.cpp
 2531     for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
lib/Transforms/Scalar/PlaceSafepoints.cpp
  550         for (unsigned i = 0; i < Term->getNumSuccessors(); i++) {
lib/Transforms/Scalar/SCCP.cpp
  668   Succs.resize(TI.getNumSuccessors());
  692     Succs.assign(TI.getNumSuccessors(), true);
  707         Succs.assign(TI.getNumSuccessors(), true);
  724         Succs.assign(TI.getNumSuccessors(), true);
  747     Succs.assign(TI.getNumSuccessors(), true);
lib/Transforms/Scalar/SROA.cpp
 1247     if (TI->getNumSuccessors() == 1)
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp
 1031     assert(ClonedExitBB->getTerminator()->getNumSuccessors() == 1 &&
lib/Transforms/Scalar/Sink.cpp
  201   if (BB.getTerminator()->getNumSuccessors() <= 1) return false;
lib/Transforms/Utils/BasicBlockUtils.cpp
  383   assert(BB->getTerminator()->getNumSuccessors() == 1 &&
  394     if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI))
  395       for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
lib/Transforms/Utils/BreakCriticalEdges.cpp
  200     for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
  393       for (unsigned I = 0, E = BodyBlock->getTerminator()->getNumSuccessors();
lib/Transforms/Utils/CodeExtractor.cpp
 1193     for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
 1349   SmallVector<unsigned, 8> BranchWeights(TI->getNumSuccessors(), 0);
 1355   for (unsigned i = 0, e = TI->getNumSuccessors(); i < e; ++i) {
lib/Transforms/Utils/FunctionComparator.cpp
  872     assert(TermL->getNumSuccessors() == TermR->getNumSuccessors());
  872     assert(TermL->getNumSuccessors() == TermR->getNumSuccessors());
  873     for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) {
  941     for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) {
lib/Transforms/Utils/Local.cpp
 1910     Updates.reserve(BB->getTerminator()->getNumSuccessors());
lib/Transforms/Utils/LoopUnrollAndJam.cpp
   75     for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
lib/Transforms/Utils/SimplifyCFG.cpp
 2278     for (unsigned i = 0, e = PredBBTI->getNumSuccessors(); i != e; ++i)
 4692       if (I.getNumSuccessors() != 1 || I.isExceptionalTerminator())
 5923       if (Succ0TI->getNumSuccessors() == 1 &&
 5932     if (Succ1TI->getNumSuccessors() == 1 &&
lib/Transforms/Vectorize/VPlanHCFGBuilder.cpp
  253   assert((PreheaderBB->getTerminator()->getNumSuccessors() == 1) &&
  276     unsigned NumSuccs = TI->getNumSuccessors();
tools/bugpoint/CrashDebugger.cpp
  465       if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) {
tools/llvm-reduce/deltas/ReduceBasicBlocks.cpp
   36   if (ChunkSucessors.size() == Term->getNumSuccessors())
tools/polly/lib/Analysis/ScopBuilder.cpp
  571   if (TI->getNumSuccessors() == 1) {
  940     assert(RN->isSubRegion() || TI->getNumSuccessors() == ConditionSets.size());
 1035     unsigned NumSuccs = RN->isSubRegion() ? 1 : TI->getNumSuccessors();
tools/polly/lib/Analysis/ScopDetection.cpp
 1743     unsigned NSucc = TInst->getNumSuccessors();
unittests/Analysis/DomTreeUpdaterTest.cpp
   91   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u);
   99   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u);
  194   EXPECT_EQ(NewEntry->getTerminator()->getNumSuccessors(), 1u);
  197   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
  271   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 4u);
  274   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u);
  369   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u);
  372   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u);
  403   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u);
  406   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
  488   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 4u);
  491   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u);
  572   EXPECT_EQ(NewEntry->getTerminator()->getNumSuccessors(), 1u);
  575   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
  655   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 5u);
  663   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 4u);
  758   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
  761   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
  778   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
  791   EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u);
unittests/IR/DominatorTreeTest.cpp
  304         assert(TI->getNumSuccessors() == 3 && "Switch has three successors");
unittests/IR/IRBuilderTest.cpp
  335   EXPECT_EQ(2u, TI->getNumSuccessors());
  344   EXPECT_EQ(2u, TI->getNumSuccessors());