Home
last modified time | relevance | path

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

1234567

/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/
DDeferredDominanceTest.cpp82 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 4u); in TEST()
85 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
139 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u); in TEST()
142 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u); in TEST()
152 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u); in TEST()
155 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
213 EXPECT_EQ(NewEntry->getTerminator()->getNumSuccessors(), 1u); in TEST()
216 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u); in TEST()
297 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u); in TEST()
300 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
[all …]
DDomTreeUpdaterTest.cpp91 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u); in TEST()
99 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
194 EXPECT_EQ(NewEntry->getTerminator()->getNumSuccessors(), 1u); in TEST()
197 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u); in TEST()
271 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 4u); in TEST()
274 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
367 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u); in TEST()
370 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
401 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
404 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u); in TEST()
[all …]
/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-7.0/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp139 if (TI->getNumSuccessors() == 0) { in updatePostDominatedByUnreachable()
171 if (TI->getNumSuccessors() == 0) in updatePostDominatedByColdCall()
207 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcUnreachableHeuristics()
250 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcMetadataWeights()
259 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights()
263 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
273 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
288 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
297 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { in calcMetadataWeights()
306 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
[all …]
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/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()
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Transforms/Vectorize/
DVPlanHCFGTest.cpp47 EXPECT_EQ(1u, Entry->getNumSuccessors()); in TEST_F()
53 EXPECT_EQ(2u, VecBB->getNumSuccessors()); in TEST_F()
129 EXPECT_EQ(1u, Entry->getNumSuccessors()); in TEST_F()
134 EXPECT_EQ(2u, VecBB->getNumSuccessors()); in TEST_F()
/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()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Vectorize/
DVPlanVerifier.cpp52 if (VPB->getNumSuccessors() > 1) in verifyBlocksInRegion()
104 assert(!Exit->getNumSuccessors() && "Region exit has successors."); in verifyRegion()
DVPlanHCFGBuilder.cpp250 assert((PreheaderBB->getTerminator()->getNumSuccessors() == 1) && in buildPlainCFG()
273 unsigned NumSuccs = TI->getNumSuccessors(); in buildPlainCFG()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DSparsePropagation.h290 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
291 if (TI.getNumSuccessors() == 0) in getFeasibleSuccessors()
354 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
366 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
380 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
/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-7.0/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h148 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
164 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp950 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
987 if (!TI->isExceptional() && TI->getNumSuccessors() == 1 && in ProcessBlock()
1051 if (IB->getNumSuccessors() == 0) return false; in ProcessBlock()
1079 Updates.reserve(BBTerm->getNumSuccessors()); in ProcessBlock()
1080 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
1411 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
1440 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1549 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); in FindMostPopularDest()
1656 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in ProcessThreadableEdges()
2005 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/
DBreakCriticalEdges.cpp187 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
346 for (unsigned Succ = 0, E = IBI->getNumSuccessors(); Succ != E; ++Succ) in SplitIndirectBrCriticalEdges()
371 for (unsigned I = 0, E = BodyBlock->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
/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()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/
DCFGMST.h126 if (int successors = TI->getNumSuccessors()) { in buildEdges()
153 if (TargetTI && !TargetTI->getNumSuccessors()) { in buildEdges()

1234567