Home
last modified time | relevance | path

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

1234

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp381 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcMetadataWeights()
391 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights()
413 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()
[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/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/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.h281 if (TI->getNumSuccessors() == 1)
284 if (OpNo >= TI->getNumSuccessors())
H A DRegionInfo.h99 static unsigned getNumSuccessors(BasicBlock *BB) {
100 return BB->getTerminator()->getNumSuccessors();
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp212 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitKnownCriticalEdge()
376 EdgeProbabilities.reserve(Target->getTerminator()->getNumSuccessors()); in SplitIndirectBrCriticalEdges()
377 for (unsigned I = 0, E = Target->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
H A DDemoteRegToStack.cpp55 for (unsigned i = 0; i < CBI->getNumSuccessors(); i++) { in DemoteRegToStack()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp190 if (VPB->getNumSuccessors() > 1 || in verifyBlock()
273 if (Exiting->getNumSuccessors() != 0) { in verifyRegion()
H A DVPlanCFG.h46 while (Current && Current->getNumSuccessors() == 0) in getBlockWithSuccs()
85 ParentWithSuccs ? ParentWithSuccs->getNumSuccessors() : 0; in end()
H A DVPlanTransforms.cpp196 if (EntryBB->getNumSuccessors() != 2) in getPredicatedThenBlock()
204 if (Succ0->getNumSuccessors() + Succ1->getNumSuccessors() != 1) in getPredicatedThenBlock()
376 if (VPBB->getNumSuccessors() == 0 && !VPBB->getParent()) in mergeBlocksIntoPredecessors()
380 if (!PredVPBB || PredVPBB->getNumSuccessors() != 1) in mergeBlocksIntoPredecessors()
722 assert(Region->getNumSuccessors() == 1 && in GetReplicateRegion()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVMergeRegionExitTargets.cpp115 for (size_t i = 0; i < BI->getNumSuccessors(); i++) { in replaceBranchTargets()
123 for (size_t i = 0; i < SI->getNumSuccessors(); i++) { in replaceBranchTargets()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstructions.h2885 unsigned getNumSuccessors() const { return 0; }
3001 unsigned getNumSuccessors() const { return 1+isConditional(); }
3004 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
3009 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
3189 assert(SuccessorIndex < SI->getNumSuccessors() &&
3369 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3371 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
3375 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
3529 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3689 unsigned getNumSuccessors() const { return 2; }
[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/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/contrib/llvm-project/llvm/lib/IR/
H A DStructuralHash.cpp
H A DProfDataUtils.cpp158 if (ProfileData && getNumBranchWeights(*ProfileData) == I.getNumSuccessors()) in getValidBranchWeightMDNode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp925 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in getBestDestForJumpOnUndef()
985 if (IB->getNumSuccessors() == 0) return false; in processBlock()
1019 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1020 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in processBlock()
1378 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in simplifyPartiallyRedundantLoad()
1407 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in simplifyPartiallyRedundantLoad()
1634 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1895 if (TI->isSpecialTerminator() || TI->getNumSuccessors() != 1 || in maybeMergeBasicBlockIntoOnlyPred()
2303 for (unsigned i = 0, e = PredPredTerm->getNumSuccessors(); i != e; ++i) in threadThroughTwoBasicBlocks()
2433 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in threadEdge()
[all …]
H A DSpeculativeExecution.cpp174 if (BI->getNumSuccessors() != 2) in runOnBasicBlock()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp231 for (unsigned i = 0; i < Terminator->getNumSuccessors(); ++i) { in findPathsToMatch()
259 for (unsigned i = 0; i < Terminator->getNumSuccessors(); ++i) { in findExitNodes()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h44 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/freebsd/contrib/llvm-project/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp89 if (PredBB->getTerminator()->getNumSuccessors() > 1) in replaceConstantExprOp()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DCallBrPrepare.cpp132 for (unsigned i = 1, e = CBR->getNumSuccessors(); i != e; ++i) in SplitCriticalEdges()
H A DIndirectBrExpandPass.cpp115 if (IBr->getNumSuccessors() == 0) { in runImpl()

1234