Home
last modified time | relevance | path

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

12345

/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DDomTreeUpdaterTest.cpp91 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 3u); in TEST()
99 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 2u); 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()
488 EXPECT_EQ(BB0->getTerminator()->getNumSuccessors(), 4u); in TEST()
[all …]
/llvm-project-15.0.7/mlir/lib/IR/
H A DBlock.cpp236 unsigned Block::getNumSuccessors() { in getNumSuccessors() function in Block
237 return empty() ? 0 : back().getNumSuccessors(); in getNumSuccessors()
241 assert(i < getNumSuccessors()); in getSuccessor()
325 if ((count = term->getNumSuccessors())) in SuccessorRange()
330 if ((count = term->getNumSuccessors())) in SuccessorRange()
H A DOperation.cpp481 assert(index < getNumSuccessors()); in setSuccessor()
567 successors.reserve(getNumSuccessors()); in clone()
926 if (op->getNumSuccessors() != 0) { in verifyZeroSuccessors()
928 << op->getNumSuccessors(); in verifyZeroSuccessors()
934 if (op->getNumSuccessors() != 1) { in verifyOneSuccessor()
936 << op->getNumSuccessors(); in verifyOneSuccessor()
942 if (op->getNumSuccessors() != numSuccessors) { in verifyNSuccessors()
945 << op->getNumSuccessors(); in verifyNSuccessors()
951 if (op->getNumSuccessors() < numSuccessors) { in verifyAtLeastNSuccessors()
954 << op->getNumSuccessors(); in verifyAtLeastNSuccessors()
/llvm-project-15.0.7/llvm/unittests/Transforms/Vectorize/
H A DVPlanHCFGTest.cpp47 EXPECT_EQ(1u, Entry->getNumSuccessors()); in TEST_F()
54 EXPECT_EQ(0u, VecBB->getNumSuccessors()); in TEST_F()
175 EXPECT_EQ(1u, Entry->getNumSuccessors()); in TEST_F()
182 EXPECT_EQ(0u, VecBB->getNumSuccessors()); in TEST_F()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp394 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
404 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
432 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) { in calcMetadataWeights()
441 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
443 WeightSum = TI->getNumSuccessors(); in calcMetadataWeights()
448 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
887 assert(BB->getTerminator()->getNumSuccessors() > 1 && in calcEstimatedHeuristics()
1144 assert(Src->getTerminator()->getNumSuccessors() == Probs.size()); in setEdgeProbability()
1172 unsigned NumSuccessors = Src->getTerminator()->getNumSuccessors(); in copyEdgeProbabilities()
1173 assert(NumSuccessors == Dst->getTerminator()->getNumSuccessors()); in copyEdgeProbabilities()
[all …]
H A DCFG.cpp83 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()
/llvm-project-15.0.7/llvm/unittests/Transforms/Utils/
H A DBasicBlockUtilsTest.cpp472 ASSERT_EQ(2u, SplitBB->getTerminator()->getNumSuccessors()); in TEST()
478 ASSERT_EQ(2u, BB0->getTerminator()->getNumSuccessors()); in TEST()
514 ASSERT_EQ(2u, SplitBB->getTerminator()->getNumSuccessors()); in TEST()
521 ASSERT_EQ(2u, BB0->getTerminator()->getNumSuccessors()); in TEST()
525 ASSERT_EQ(1u, BB2->getTerminator()->getNumSuccessors()); in TEST()
526 ASSERT_EQ(1u, BB2Clone->getTerminator()->getNumSuccessors()); in TEST()
H A DLoopUtilsTest.cpp92 EXPECT_EQ(BI->getNumSuccessors(), (unsigned)1); in TEST()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp54 if (VPB->getNumSuccessors() > 1 || (VPBB && VPBB->isExiting())) in verifyBlocksInRegion()
104 assert(!Exiting->getNumSuccessors() && in verifyRegion()
279 if (Region->getExiting()->getNumSuccessors() != 0) { in verifyPlanIsValid()
H A DVPlanTransforms.cpp198 if (EntryBB->getNumSuccessors() != 2) in getPredicatedThenBlock()
206 if (Succ0->getNumSuccessors() + Succ1->getNumSuccessors() != 1) in getPredicatedThenBlock()
H A DVPlanHCFGBuilder.cpp268 assert((ThePreheaderBB->getTerminator()->getNumSuccessors() == 1) && in buildPlainCFG()
296 unsigned NumSuccs = TI->getNumSuccessors(); in buildPlainCFG()
/llvm-project-15.0.7/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h61 size_t getNumSuccessors() const { in getNumSuccessors() function
182 assert(!getNumSuccessors() && "Cannot add instructions to this group!"); in addInstruction()
301 return !Group.isExecuted() && Group.getNumSuccessors(); in hasDependentUsers()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DSparsePropagation.h291 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
292 if (TI.getNumSuccessors() == 0) in getFeasibleSuccessors()
351 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
363 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
377 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
H A DCFGPrinter.h237 if (TI->getNumSuccessors() == 1)
242 if (OpNo >= TI->getNumSuccessors())
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp212 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitKnownCriticalEdge()
351 for (unsigned Succ = 0, E = IBI->getNumSuccessors(); Succ != E; ++Succ) in SplitIndirectBrCriticalEdges()
379 EdgeProbabilities.reserve(Target->getTerminator()->getNumSuccessors()); in SplitIndirectBrCriticalEdges()
380 for (unsigned I = 0, E = Target->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
H A DSCCPSolver.cpp599 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
623 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
655 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
668 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
675 for (unsigned i = 0; i < IBR->getNumSuccessors(); ++i) { in getFeasibleSuccessors()
691 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
/llvm-project-15.0.7/mlir/lib/Dialect/Func/Transforms/
H A DFuncConversions.cpp68 for (int succIdx = 0, succEnd = op->getBlock()->getNumSuccessors(); in matchAndRewrite()
123 for (int p = 0, e = op->getBlock()->getNumSuccessors(); p < e; ++p) { in isLegalForBranchOpInterfaceTypeConversionPattern()
/llvm-project-15.0.7/mlir/lib/Analysis/DataFlow/
H A DDeadCodeAnalysis.cpp176 return !op->getNumSuccessors() && in isRegionOrCallableReturn()
183 if (op->getNumRegions() || op->getNumSuccessors() || in initializeRecursively()
265 if (op->getNumSuccessors()) { in visit()
/llvm-project-15.0.7/llvm/lib/IR/
H A DStructuralHash.cpp52 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in update()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp999 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in getBestDestForJumpOnUndef()
1059 if (IB->getNumSuccessors() == 0) return false; in processBlock()
1093 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1094 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in processBlock()
1448 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in simplifyPartiallyRedundantLoad()
1477 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in simplifyPartiallyRedundantLoad()
1704 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1964 if (TI->isExceptionalTerminator() || TI->getNumSuccessors() != 1 || in maybeMergeBasicBlockIntoOnlyPred()
2403 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in threadEdge()
2474 assert(TI->getNumSuccessors() > 1 && "not a split"); in doesBlockHaveProfileData()
[all …]
/llvm-project-15.0.7/mlir/lib/Dialect/LLVMIR/Transforms/
H A DLegalizeForExport.cpp30 for (int i = 0, e = terminator->getNumSuccessors(); i < e; ++i) { in ensureDistinctSuccessors()
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h130 if (int successors = TI->getNumSuccessors()) { in buildEdges()
159 if (TargetTI && !TargetTI->getNumSuccessors()) { in buildEdges()
/llvm-project-15.0.7/mlir/test/lib/IR/
H A DTestPrintNesting.cpp65 << block.getNumSuccessors() in printBlock()
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DInstructions.h3066 unsigned getNumSuccessors() const { return 0; }
3190 unsigned getNumSuccessors() const { return 1+isConditional(); }
3385 assert(SuccessorIndex < SI->getNumSuccessors() &&
3564 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3938 unsigned getNumSuccessors() const { return 2; }
4161 assert(i < getNumSuccessors() + 1 &&
4249 unsigned getNumSuccessors() const { return 0; }
4430 assert(Idx < getNumSuccessors() &&
4435 assert(Idx < getNumSuccessors() &&
4592 unsigned getNumSuccessors() const { return 1; }
[all …]
H A DCFG.h155 return Idx >= 0 && (Idx == 0 || Idx <= (int)Inst->getNumSuccessors()); in index_is_valid()
186 Idx = Inst->getNumSuccessors(); in SuccIterator()

12345