/external/llvm/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 124 if (TI->getNumSuccessors() == 0) { 142 if (UnreachableEdges.size() == TI->getNumSuccessors()) 147 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) 184 if (TI->getNumSuccessors() == 1) 194 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); 198 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) 206 Weights.reserve(TI->getNumSuccessors()); 217 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); 225 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { 246 if (TI->getNumSuccessors() [all...] |
H A D | SparsePropagation.cpp | 124 Succs.resize(TI.getNumSuccessors()); 125 if (TI.getNumSuccessors() == 0) return; 184 Succs.assign(TI.getNumSuccessors(), true); 195 Succs.assign(TI.getNumSuccessors(), true); 211 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
H A D | CFG.cpp | 76 unsigned e = Term->getNumSuccessors(); 90 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); 91 if (TI->getNumSuccessors() == 1) return false;
|
H A D | CaptureTracking.cpp | 99 !BB->getTerminator()->getNumSuccessors())
|
H A D | DivergenceAnalysis.cpp | 248 if (TI->getNumSuccessors() > 1)
|
H A D | LoopInfo.cpp | 272 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { 306 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 150 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 167 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | MergedLoadStoreMotion.cpp | 215 if (BB->getTerminator()->getNumSuccessors() != 2) 223 Succ0->getTerminator()->getNumSuccessors() != 1) 226 Succ1->getTerminator()->getNumSuccessors() != 1)
|
H A D | SpeculativeExecution.cpp | 132 if (BI->getNumSuccessors() != 2)
|
H A D | JumpThreading.cpp | 683 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { 720 if (!TI->isExceptional() && TI->getNumSuccessors() == 1 && 748 if (IB->getNumSuccessors() == 0) return false; 774 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { 1027 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { 1058 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && 1160 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); 1265 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i) 1577 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)
|
H A D | Sink.cpp | 122 if (BB.getTerminator()->getNumSuccessors() <= 1) return false;
|
H A D | LoopInterchange.cpp | 654 unsigned num = outerLoopHeaderBI->getNumSuccessors(); 741 unsigned Num = BI->getNumSuccessors(); 1197 unsigned NumSucc = OuterLoopPredecessorBI->getNumSuccessors(); 1203 NumSucc = OuterLoopHeaderBI->getNumSuccessors(); 1224 NumSucc = InnerLoopLatchPredecessorBI->getNumSuccessors();
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineRegionInfo.h | 45 static unsigned getNumSuccessors(MachineBasicBlock *BB) { function in struct:llvm::RegionTraits
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | PGOInstrumentation.cpp | 261 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) { 290 if (TI->getNumSuccessors() <= 1) 629 if (TI->getNumSuccessors() < 2)
|
H A D | CFGMST.h | 106 if (int successors = TI->getNumSuccessors()) {
|
H A D | GCOVProfiling.cpp | 523 if (int successors = TI->getNumSuccessors()) { 592 Edges += TI->getNumSuccessors(); 610 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); 732 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
|
/external/llvm/include/llvm/IR/ |
H A D | Instructions.h | 2791 unsigned getNumSuccessors() const { return 0; } function in class:llvm::ReturnInst 2879 unsigned getNumSuccessors() const { return 1+isConditional(); } function in class:llvm::BranchInst 2882 assert(i < getNumSuccessors() && "Successor # out of range for Branch!"); 2887 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!"); 2981 assert(SuccessorIndex < SI->getNumSuccessors() && 3195 unsigned getNumSuccessors() const { return getNumOperands()/2; } function in class:llvm::SwitchInst 3197 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!"); 3201 assert(idx < getNumSuccessors() && "Successor # out of range for switch!"); 3297 unsigned getNumSuccessors() const { return getNumOperands()-1; } 3722 unsigned getNumSuccessors() cons 3805 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::ResumeInst 3969 unsigned getNumSuccessors() const { return getNumOperands() - 1; } function in class:llvm::InvokeInst::CatchSwitchInst 4134 unsigned getNumSuccessors() const { return 1; } function in class:llvm::InvokeInst::CatchReturnInst 4215 unsigned getNumSuccessors() const { return hasUnwindDest() ? 1 : 0; } function in class:llvm::InvokeInst::CleanupReturnInst 4277 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::UnreachableInst [all...] |
/external/clang/lib/CodeGen/ |
H A D | CGLoopInfo.cpp | 238 for (unsigned i = 0, ie = TI->getNumSuccessors(); i < ie; ++i)
|
/external/llvm/lib/IR/ |
H A D | Dominators.cpp | 45 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
|
H A D | Instructions.cpp | 606 return getNumSuccessors(); 718 return getNumSuccessors(); 757 return getNumSuccessors(); 815 return getNumSuccessors(); 854 assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!"); 858 return getNumSuccessors(); 861 assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!"); 941 return getNumSuccessors(); 1000 return getNumSuccessors(); 1098 return getNumSuccessors(); [all...] |
/external/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 140 if (PredBB->getTerminator()->getNumSuccessors() > 1)
|
/external/llvm/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 187 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
|
H A D | BasicBlockUtils.cpp | 260 assert(BB->getTerminator()->getNumSuccessors() == 1 && 271 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) 272 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
/external/llvm/include/llvm/Analysis/ |
H A D | RegionInfo.h | 92 static unsigned getNumSuccessors(BasicBlock *BB) { function in struct:llvm::RegionTraits 93 return BB->getTerminator()->getNumSuccessors();
|
/external/llvm/unittests/IR/ |
H A D | IRBuilderTest.cpp | 90 EXPECT_EQ(2u, TI->getNumSuccessors()); 99 EXPECT_EQ(2u, TI->getNumSuccessors());
|