| /external/llvm-project/llvm/unittests/Analysis/ |
| D | DomTreeUpdaterTest.cpp | 91 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()
369 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u); in TEST()
372 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
403 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); in TEST()
406 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 1u); in TEST()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | BranchProbabilityInfo.cpp | 117 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 …]
|
| D | SparsePropagation.cpp | 124 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()
|
| D | CFG.cpp | 76 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/llvm-project/llvm/lib/Analysis/ |
| D | BranchProbabilityInfo.cpp | 330 if (TI->getNumSuccessors() == 0) { in computePostDominatedByUnreachable()
395 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcUnreachableHeuristics()
413 BB->getTerminator()->getNumSuccessors(), BranchProbability::getUnknown()); in calcUnreachableHeuristics()
442 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcMetadataWeights()
452 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights()
456 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
466 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
481 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
490 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) { in calcMetadataWeights()
499 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
[all …]
|
| D | CFG.cpp | 83 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
97 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
104 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | BranchProbabilityInfo.cpp | 171 if (TI->getNumSuccessors() == 0) { in computePostDominatedByUnreachable()
236 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcUnreachableHeuristics()
279 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcMetadataWeights()
288 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights()
292 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
302 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
317 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
326 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { in calcMetadataWeights()
335 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
337 WeightSum = TI->getNumSuccessors(); in calcMetadataWeights()
[all …]
|
| D | CFG.cpp | 76 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
90 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
97 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
|
| /external/llvm-project/mlir/lib/IR/ |
| D | Block.cpp | 222 unsigned Block::getNumSuccessors() { in getNumSuccessors() function in Block
223 return empty() ? 0 : back().getNumSuccessors(); in getNumSuccessors()
227 assert(i < getNumSuccessors()); in getSuccessor()
309 if ((count = term->getNumSuccessors())) in SuccessorRange()
314 if ((count = term->getNumSuccessors())) in SuccessorRange()
|
| D | Operation.cpp | 569 assert(index < getNumSuccessors()); in setSuccessor()
617 successors.reserve(getNumSuccessors()); in cloneWithoutRegions()
969 if (op->getNumSuccessors() != 0) { in verifyZeroSuccessor()
971 << op->getNumSuccessors(); in verifyZeroSuccessor()
977 if (op->getNumSuccessors() != 1) { in verifyOneSuccessor()
979 << op->getNumSuccessors(); in verifyOneSuccessor()
985 if (op->getNumSuccessors() != numSuccessors) { in verifyNSuccessors()
988 << op->getNumSuccessors(); in verifyNSuccessors()
994 if (op->getNumSuccessors() < numSuccessors) { in verifyAtLeastNSuccessors()
997 << op->getNumSuccessors(); in verifyAtLeastNSuccessors()
|
| /external/llvm-project/llvm/unittests/Transforms/Vectorize/ |
| D | VPlanHCFGTest.cpp | 47 EXPECT_EQ(1u, Entry->getNumSuccessors()); in TEST_F()
53 EXPECT_EQ(2u, VecBB->getNumSuccessors()); in TEST_F()
169 EXPECT_EQ(1u, Entry->getNumSuccessors()); in TEST_F()
174 EXPECT_EQ(2u, VecBB->getNumSuccessors()); in TEST_F()
|
| /external/llvm-project/llvm/lib/Transforms/Vectorize/ |
| D | VPlanVerifier.cpp | 53 if (VPB->getNumSuccessors() > 1) in verifyBlocksInRegion()
101 assert(!Exit->getNumSuccessors() && "Region exit has successors."); in verifyRegion()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/ |
| D | VPlanVerifier.cpp | 52 if (VPB->getNumSuccessors() > 1) in verifyBlocksInRegion()
104 assert(!Exit->getNumSuccessors() && "Region exit has successors."); in verifyRegion()
|
| /external/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
| D | LSUnit.h | 61 size_t getNumSuccessors() const { in getNumSuccessors() function
177 assert(!getNumSuccessors() && "Cannot add instructions to this group!"); in addInstruction()
296 return !Group.isExecuted() && Group.getNumSuccessors(); in hasDependentUsers()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/HardwareUnits/ |
| D | LSUnit.h | 61 unsigned getNumSuccessors() const { return Succ.size(); } in getNumSuccessors() function
156 assert(!getNumSuccessors() && "Cannot add instructions to this group!"); in addInstruction()
275 return !Group.isExecuted() && Group.getNumSuccessors(); in hasDependentUsers()
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| D | SparsePropagation.h | 289 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
290 if (TI.getNumSuccessors() == 0) in getFeasibleSuccessors()
349 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
361 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
375 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | SparsePropagation.h | 289 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
290 if (TI.getNumSuccessors() == 0) in getFeasibleSuccessors()
349 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
361 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
375 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
|
| /external/llvm-project/llvm/lib/Transforms/Utils/ |
| D | BreakCriticalEdges.cpp | 238 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
383 for (unsigned Succ = 0, E = IBI->getNumSuccessors(); Succ != E; ++Succ) in SplitIndirectBrCriticalEdges()
408 EdgeProbabilities.reserve(Target->getTerminator()->getNumSuccessors()); in SplitIndirectBrCriticalEdges()
409 for (unsigned I = 0, E = Target->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 142 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
158 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 195 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
211 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | JumpThreading.cpp | 970 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
1030 if (IB->getNumSuccessors() == 0) return false; in ProcessBlock()
1058 Updates.reserve(BBTerm->getNumSuccessors()); in ProcessBlock()
1059 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
1398 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
1429 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1537 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); in FindMostPopularDest()
1641 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in ProcessThreadableEdges()
1889 if (TI->isExceptionalTerminator() || TI->getNumSuccessors() != 1 || in MaybeMergeBasicBlockIntoOnlyPred()
2116 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
[all …]
|
| /external/llvm-project/mlir/lib/Dialect/LLVMIR/Transforms/ |
| D | LegalizeForExport.cpp | 23 for (int i = 0, e = terminator->getNumSuccessors(); i < e; ++i) { in ensureDistinctSuccessors()
|
| /external/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 218 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
234 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | BreakCriticalEdges.cpp | 201 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
369 for (unsigned Succ = 0, E = IBI->getNumSuccessors(); Succ != E; ++Succ) in SplitIndirectBrCriticalEdges()
394 for (unsigned I = 0, E = BodyBlock->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
|
| /external/llvm-project/llvm/lib/IR/ |
| D | StructuralHash.cpp | 52 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in update()
|