/external/llvm/lib/Analysis/ |
H A D | BranchProbabilityInfo.cpp | 118 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); 128 if (TI->getNumSuccessors() == 0) { 146 if (UnreachableEdges.size() == TI->getNumSuccessors()) 151 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) 178 if (TI->getNumSuccessors() == 1) 189 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) 197 Weights.reserve(TI->getNumSuccessors()); 205 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); 206 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 222 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 | 75 unsigned e = Term->getNumSuccessors(); 89 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); 90 if (TI->getNumSuccessors() == 1) return false;
|
H A D | LoopInfo.cpp | 247 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { 281 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
|
H A D | RegionInfo.cpp | 400 unsigned NumSuccessors = exit->getTerminator()->getNumSuccessors(); 413 if (exit->getTerminator()->getNumSuccessors() == 1)
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 110 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 127 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
|
/external/llvm/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) 73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 197 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
|
H A D | AddDiscriminators.cpp | 181 for (unsigned I = 0; I < Last->getNumSuccessors(); ++I) {
|
H A D | LoopUnroll.cpp | 77 if (OnlyPred->getTerminator()->getNumSuccessors() != 1)
|
/external/clang/lib/CodeGen/ |
H A D | CGLoopInfo.cpp | 102 for (unsigned i = 0, ie = TI->getNumSuccessors(); i < ie; ++i)
|
/external/llvm/include/llvm/IR/ |
H A D | CFG.h | 119 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors(); 148 idx = Term->getNumSuccessors();
|
H A D | Instructions.h | 2416 unsigned getNumSuccessors() const { return 0; } function in class:llvm::ReturnInst 2499 unsigned getNumSuccessors() const { return 1+isConditional(); } function in class:llvm::BranchInst 2502 assert(i < getNumSuccessors() && "Successor # out of range for Branch!"); 2507 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!"); 2599 assert(SuccessorIndex < SI->getNumSuccessors() && 2816 unsigned getNumSuccessors() const { return getNumOperands()/2; } function in class:llvm::SwitchInst 2818 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!"); 2822 assert(idx < getNumSuccessors() && "Successor # out of range for switch!"); 2916 unsigned getNumSuccessors() const { return getNumOperands()-1; } 3160 unsigned getNumSuccessors() cons 3241 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::ResumeInst 3285 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::UnreachableInst [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 630 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { 666 if (SinglePred->getTerminator()->getNumSuccessors() == 1 && 699 if (IB->getNumSuccessors() == 0) return false; 724 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { 948 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { 980 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && 1073 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); 1177 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i) 1482 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)
|
H A D | Sink.cpp | 124 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false;
|
H A D | DeadStoreElimination.cpp | 635 if (BB.getTerminator()->getNumSuccessors() == 0) 649 if (PredTI->getNumSuccessors() != 1)
|
H A D | SampleProfile.cpp | 926 if (TI->getNumSuccessors() == 1) 935 for (unsigned I = 0; I < TI->getNumSuccessors(); ++I) {
|
H A D | SCCP.cpp | 519 Succs.resize(TI.getNumSuccessors()); 558 Succs.assign(TI.getNumSuccessors(), true); 569 Succs.assign(TI.getNumSuccessors(), true); 1789 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { 1873 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i)
|
H A D | LoopRotation.cpp | 427 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
/external/llvm/unittests/IR/ |
H A D | IRBuilderTest.cpp | 88 EXPECT_EQ(2u, TI->getNumSuccessors()); 97 EXPECT_EQ(2u, TI->getNumSuccessors());
|
/external/llvm/lib/IR/ |
H A D | BasicBlock.cpp | 347 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
|
H A D | Dominators.cpp | 44 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 139 if (PredBB->getTerminator()->getNumSuccessors() > 1)
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 515 if (int successors = TI->getNumSuccessors()) { 588 Edges += TI->getNumSuccessors(); 606 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); 727 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
|
/external/llvm/lib/Transforms/IPO/ |
H A D | MergeFunctions.cpp | 1041 assert(TermL->getNumSuccessors() == TermR->getNumSuccessors()); 1042 for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) {
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombinePHI.cpp | 314 FirstLI->getParent()->getTerminator()->getNumSuccessors() != 1) 342 LI->getParent()->getTerminator()->getNumSuccessors() != 1)
|