Home
last modified time | relevance | path

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

1234

/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp413 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
422 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) { in calcMetadataWeights()
431 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
433 WeightSum = TI->getNumSuccessors(); in calcMetadataWeights()
438 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
877 assert(BB->getTerminator()->getNumSuccessors() > 1 && in calcEstimatedHeuristics()
1134 assert(Src->getTerminator()->getNumSuccessors() == Probs.size()); in setEdgeProbability()
1162 unsigned NumSuccessors = Src->getTerminator()->getNumSuccessors(); in copyEdgeProbabilities()
1163 assert(NumSuccessors == Dst->getTerminator()->getNumSuccessors()); in copyEdgeProbabilities()
1179 assert(Src->getTerminator()->getNumSuccessors() == 2); in swapSuccEdgesProbabilities()
[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()
H A DMustExecute.cpp641 if (PP->getNumSuccessors() == 0) { in getMustBeExecutedNextInstruction()
648 if (PP->getNumSuccessors() == 1) { in getMustBeExecutedNextInstruction()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp54 if (VPB->getNumSuccessors() > 1 || (VPBB && VPBB->isExiting())) in verifyBlocksInRegion()
104 assert(!Exiting->getNumSuccessors() && in verifyRegion()
284 if (Region->getExiting()->getNumSuccessors() != 0) { in verifyPlanIsValid()
H A DVPlanCFG.h46 while (Current && Current->getNumSuccessors() == 0) in getBlockWithSuccs()
85 ParentWithSuccs ? ParentWithSuccs->getNumSuccessors() : 0; in end()
H A DVPlanTransforms.cpp194 if (EntryBB->getNumSuccessors() != 2) in getPredicatedThenBlock()
202 if (Succ0->getNumSuccessors() + Succ1->getNumSuccessors() != 1) in getPredicatedThenBlock()
377 if (PredVPBB && PredVPBB->getNumSuccessors() == 1) in mergeBlocksIntoPredecessors()
611 assert(Region->getNumSuccessors() == 1 && in GetReplicateRegion()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DLSUnit.h58 size_t getNumSuccessors() const { in getNumSuccessors() function
179 assert(!getNumSuccessors() && "Cannot add instructions to this group!"); in addInstruction()
298 return !Group.isExecuted() && Group.getNumSuccessors(); in hasDependentUsers()
/freebsd-14.2/contrib/llvm-project/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.h285 if (TI->getNumSuccessors() == 1)
288 if (OpNo >= TI->getNumSuccessors())
H A DRegionInfo.h99 static unsigned getNumSuccessors(BasicBlock *BB) {
100 return BB->getTerminator()->getNumSuccessors();
/freebsd-14.2/contrib/llvm-project/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.cpp1022 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
1047 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1083 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1097 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1104 for (unsigned i = 0; i < IBR->getNumSuccessors(); ++i) { in getFeasibleSuccessors()
H A DFunctionComparator.cpp1003 assert(TermL->getNumSuccessors() == TermR->getNumSuccessors()); in compare()
1004 for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) { in compare()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DCFGMST.h144 if (int successors = TI->getNumSuccessors()) { in buildEdges()
174 if (TargetTI && !TargetTI->getNumSuccessors()) { in buildEdges()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstructions.h3120 unsigned getNumSuccessors() const { return 0; }
3244 unsigned getNumSuccessors() const { return 1+isConditional(); }
3439 assert(SuccessorIndex < SI->getNumSuccessors() &&
3618 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3990 unsigned getNumSuccessors() const { return 2; }
4211 assert(i < getNumSuccessors() + 1 &&
4297 unsigned getNumSuccessors() const { return 0; }
4478 assert(Idx < getNumSuccessors() &&
4483 assert(Idx < getNumSuccessors() &&
4641 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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp936 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in getBestDestForJumpOnUndef()
996 if (IB->getNumSuccessors() == 0) return false; in processBlock()
1030 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1031 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in processBlock()
1389 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in simplifyPartiallyRedundantLoad()
1418 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in simplifyPartiallyRedundantLoad()
1646 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1906 if (TI->isSpecialTerminator() || TI->getNumSuccessors() != 1 || in maybeMergeBasicBlockIntoOnlyPred()
2441 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in threadEdge()
2515 if (!TI || TI->getNumSuccessors() < 2) in doesBlockHaveProfileData()
[all …]
H A DSpeculativeExecution.cpp174 if (BI->getNumSuccessors() != 2) in runOnBasicBlock()
H A DDFAJumpThreading.cpp738 if (Switch->getNumSuccessors() <= 1) in isLegalAndProfitableToTransform()
817 APInt(32, Switch->getNumSuccessors()).ceilLogBase2(); in isLegalAndProfitableToTransform()
1099 for (unsigned Idx = 0; Idx < PrevTerm->getNumSuccessors(); Idx++) { in updatePredecessor()
/freebsd-14.2/contrib/llvm-project/llvm/lib/IR/
H A DProfDataUtils.cpp98 if (ProfileData && ProfileData->getNumOperands() == 1 + I.getNumSuccessors()) in getValidBranchWeightMDNode()
H A DInstruction.cpp1118 unsigned Instruction::getNumSuccessors() const { in getNumSuccessors() function in Instruction
1122 return static_cast<const CLASS *>(this)->getNumSuccessors(); in getNumSuccessors()
1155 for (unsigned Idx = 0, NumSuccessors = Instruction::getNumSuccessors(); in replaceSuccessorWith()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h44 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp89 if (PredBB->getTerminator()->getNumSuccessors() > 1) in replaceConstantExprOp()
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DCallBrPrepare.cpp130 for (unsigned i = 1, e = CBR->getNumSuccessors(); i != e; ++i) in SplitCriticalEdges()
H A DIndirectBrExpandPass.cpp115 if (IBr->getNumSuccessors() == 0) { in runImpl()

1234