Home
last modified time | relevance | path

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

123

/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp139 if (TI->getNumSuccessors() == 0) { in updatePostDominatedByUnreachable()
171 if (TI->getNumSuccessors() == 0) in updatePostDominatedByColdCall()
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()
308 WeightSum = TI->getNumSuccessors(); in calcMetadataWeights()
313 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
336 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
[all …]
H A DCFG.cpp76 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
91 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
92 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
H A DCaptureTracking.cpp100 !BB->getTerminator()->getNumSuccessors()) in isSafeToPrune()
H A DSyncDependenceAnalysis.cpp360 if (Term.getNumSuccessors() < 1) { in join_blocks()
H A DDivergenceAnalysis.cpp112 if (Term.getNumSuccessors() <= 1) in updateTerminator()
/freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp52 if (VPB->getNumSuccessors() > 1) in verifyBlocksInRegion()
104 assert(!Exit->getNumSuccessors() && "Region exit has successors."); in verifyRegion()
H A DVPlanHCFGBuilder.cpp250 assert((PreheaderBB->getTerminator()->getNumSuccessors() == 1) && in buildPlainCFG()
273 unsigned NumSuccs = TI->getNumSuccessors(); in buildPlainCFG()
H A DVPlanHCFGTransforms.cpp41 if (Base->getNumPredecessors() == 0 || Base->getNumSuccessors() == 0) in VPInstructionsToVPRecipes()
/freebsd-12.1/contrib/llvm/include/llvm/Analysis/
H A 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()
H A DCFGPrinter.h154 if (TI->getNumSuccessors() == 1)
H A DRegionInfo.h101 static unsigned getNumSuccessors(BasicBlock *BB) {
102 return BB->getTerminator()->getNumSuccessors();
/freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h159 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
175 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp188 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
352 for (unsigned Succ = 0, E = IBI->getNumSuccessors(); Succ != E; ++Succ) in SplitIndirectBrCriticalEdges()
377 for (unsigned I = 0, E = BodyBlock->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
H A DFunctionComparator.cpp871 assert(TermL->getNumSuccessors() == TermR->getNumSuccessors()); in compare()
872 for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) { in compare()
940 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in functionHash()
H A DBasicBlockUtils.cpp302 assert(BB->getTerminator()->getNumSuccessors() == 1 && in SplitEdge()
313 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) in SplitAllCriticalEdges()
314 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in SplitAllCriticalEdges()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp954 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
991 if (!TI->isExceptionalTerminator() && TI->getNumSuccessors() == 1 && in ProcessBlock()
1055 if (IB->getNumSuccessors() == 0) return false; in ProcessBlock()
1083 Updates.reserve(BBTerm->getNumSuccessors()); in ProcessBlock()
1084 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
1418 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
1447 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1663 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in ProcessThreadableEdges()
2012 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
2121 assert(TI->getNumSuccessors() > 1 && "not a split"); in doesBlockHaveProfileData()
[all …]
H A DSCCP.cpp661 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
685 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
700 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
717 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
724 for (unsigned i = 0; i < IBR->getNumSuccessors(); ++i) { in getFeasibleSuccessors()
1653 if (IBR->getNumSuccessors() < 1) in ResolvedUndefsIn()
H A DSpeculativeExecution.cpp173 if (BI->getNumSuccessors() != 2) in runOnBasicBlock()
H A DSink.cpp202 if (BB.getTerminator()->getNumSuccessors() <= 1) return false; in ProcessBlock()
/freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h126 if (int successors = TI->getNumSuccessors()) { in buildEdges()
153 if (TargetTI && !TargetTI->getNumSuccessors()) { in buildEdges()
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DInstructions.h2932 unsigned getNumSuccessors() const { return 0; }
3056 unsigned getNumSuccessors() const { return 1+isConditional(); }
3251 assert(SuccessorIndex < SI->getNumSuccessors() &&
3434 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3561 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3815 unsigned getNumSuccessors() const { return 2; }
3888 unsigned getNumSuccessors() const { return 0; }
4065 assert(Idx < getNumSuccessors() &&
4070 assert(Idx < getNumSuccessors() &&
4227 unsigned getNumSuccessors() const { return 1; }
[all …]
H A DCFG.h154 return Idx >= 0 && (Idx == 0 || Idx <= (int)Inst->getNumSuccessors()); in index_is_valid()
185 Idx = Inst->getNumSuccessors(); in SuccIterator()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp98 if (IBr->getNumSuccessors() == 0) { in runOnFunction()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h45 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/freebsd-12.1/contrib/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp140 if (PredBB->getTerminator()->getNumSuccessors() > 1) in replaceConstantExprOp()

123