Home
last modified time | relevance | path

Searched refs:getNumSuccessors (Results 1 – 25 of 99) sorted by relevance

1234

/external/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp117 if (TI->getNumSuccessors() == 0) { in calcUnreachableHeuristics()
140 if (UnreachableEdges.size() == TI->getNumSuccessors()) in calcUnreachableHeuristics()
145 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) in calcUnreachableHeuristics()
184 if (TI->getNumSuccessors() == 1) in calcMetadataWeights()
194 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights()
198 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
206 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
217 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
225 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { in calcMetadataWeights()
231 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
[all …]
DSparsePropagation.cpp124 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
125 if (TI.getNumSuccessors() == 0) return; in getFeasibleSuccessors()
184 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
195 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
211 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
DCFG.cpp76 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
90 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
91 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
/external/swiftshader/third_party/LLVM/lib/Analysis/
DBranchProbabilityInfo.cpp97 if (TI->getNumSuccessors() > 1) in isReturningBlock()
101 if (TI->getNumSuccessors() == 0) in isReturningBlock()
116 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); in getMaxWeightFor()
148 if (TI->getNumSuccessors() == 1) in calcMetadataWeights()
159 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
167 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
175 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
176 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
185 if (BB->getTerminator()->getNumSuccessors() == 1) in calcReturnHeuristics()
260 uint32_t numSuccs = BB->getTerminator()->getNumSuccessors(); in calcLoopBranchHeuristics()
DSparsePropagation.cpp123 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
124 if (TI.getNumSuccessors() == 0) return; in getFeasibleSuccessors()
183 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
194 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
210 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
DProfileInfoLoaderPass.cpp167 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
188 if (TI->getNumSuccessors() == 0) { in runOnModule()
191 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
DOptimalEdgeProfiling.cpp99 if (BB->getTerminator()->getNumSuccessors() == 0) { in runOnModule()
103 NumEdges += BB->getTerminator()->getNumSuccessors(); in runOnModule()
172 if (TI->getNumSuccessors() == 0) { in runOnModule()
182 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
196 if (TI->getNumSuccessors() == 1) { in runOnModule()
DEdgeProfiling.cpp73 NumEdges += BB->getTerminator()->getNumSuccessors(); in runOnModule()
95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
102 if (TI->getNumSuccessors() == 1) { in runOnModule()
DGCOVProfiling.cpp384 if (int successors = TI->getNumSuccessors()) { in emitGCNO()
439 Edges += TI->getNumSuccessors(); in emitProfileArcs()
457 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs()
545 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable()
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
DBreakCriticalEdges.cpp72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) in runOnFunction()
73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in runOnFunction()
93 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
94 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
224 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
DBasicBlockUtils.cpp43 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) in DeleteDeadBlock()
245 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
278 assert(BB->getTerminator()->getNumSuccessors() == 1 && in SplitEdge()
DLocal.cpp114 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i) { in ConstantFoldTerminator()
151 for (unsigned i = 0, e = SI->getNumSuccessors(); i != e; ++i) { in ConstantFoldTerminator()
168 if (SI->getNumSuccessors() == 2) { in ConstantFoldTerminator()
/external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/
DBasicBlockUtils.h128 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
145 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/swiftshader/third_party/LLVM/unittests/VMCore/
DInstructionsTest.cpp57 EXPECT_EQ(1U, b0->getNumSuccessors()); in TEST()
75 EXPECT_EQ(2U, b1->getNumSuccessors()); in TEST()
/external/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h142 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
158 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
DJumpThreading.cpp600 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
636 if (SinglePred->getTerminator()->getNumSuccessors() == 1 && in ProcessBlock()
692 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
899 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
932 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1022 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); in FindMostPopularDest()
1126 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i) in ProcessThreadableEdges()
1433 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
DSCCP.cpp556 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
585 if (TI.getNumSuccessors() < 2) { in getFeasibleSuccessors()
595 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
606 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
649 if (SI->getNumSuccessors() < 2) in isEdgeFeasible()
659 for (unsigned i = 1, E = SI->getNumSuccessors(); i != E; ++i) in isEdgeFeasible()
1657 if (SI->getNumSuccessors() < 2) // no cases in ResolvedUndefsIn()
1955 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { in runOnModule()
2038 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i) in runOnModule()
/external/swiftshader/third_party/LLVM/include/llvm/
DInstructions.h2275 unsigned getNumSuccessors() const { return 0; }
2358 unsigned getNumSuccessors() const { return 1+isConditional(); }
2361 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
2366 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
2511 unsigned getNumSuccessors() const { return getNumOperands()/2; }
2513 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
2517 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
2524 assert(idx < getNumSuccessors() && "Successor # out of range!");
2531 assert(idx < getNumSuccessors() && "Successor # out of range!");
2626 unsigned getNumSuccessors() const { return getNumOperands()-1; }
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/Support/
DCFG.h104 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors(); in index_is_valid()
116 idx = Term->getNumSuccessors(); in SuccIterator()
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp679 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
716 if (!TI->isExceptional() && TI->getNumSuccessors() == 1 && in ProcessBlock()
747 if (IB->getNumSuccessors() == 0) return false; in ProcessBlock()
773 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
1027 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
1056 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1157 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); in FindMostPopularDest()
1572 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
DLoopInterchange.cpp652 unsigned num = outerLoopHeaderBI->getNumSuccessors(); in tightlyNested()
739 unsigned Num = BI->getNumSuccessors(); in getLoopLatchExitBlock()
1171 unsigned NumSucc = OuterLoopPredecessorBI->getNumSuccessors(); in adjustLoopBranches()
1177 NumSucc = OuterLoopHeaderBI->getNumSuccessors(); in adjustLoopBranches()
1198 NumSucc = InnerLoopLatchPredecessorBI->getNumSuccessors(); in adjustLoopBranches()
DSpeculativeExecution.cpp168 if (BI->getNumSuccessors() != 2) in runOnBasicBlock()
/external/llvm/include/llvm/IR/
DInstructions.h2850 unsigned getNumSuccessors() const { return 0; }
2938 unsigned getNumSuccessors() const { return 1+isConditional(); }
2941 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
2946 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
3040 assert(SuccessorIndex < SI->getNumSuccessors() &&
3254 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3256 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
3260 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
3356 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3823 unsigned getNumSuccessors() const { return 2; }
[all …]
/external/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h45 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp537 if (int successors = TI->getNumSuccessors()) { in emitProfileNotes()
604 Edges += TI->getNumSuccessors(); in emitProfileArcs()
622 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs()
741 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable()

1234