Home
last modified time | relevance | path

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

1234

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp308 assert(TI->getNumSuccessors() > 1 && "expected more than one successor!"); in calcMetadataWeights()
318 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights()
322 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
332 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
352 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
361 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) { in calcMetadataWeights()
370 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
372 WeightSum = TI->getNumSuccessors(); in calcMetadataWeights()
377 for (unsigned I = 0, E = TI->getNumSuccessors(); I != E; ++I) in calcMetadataWeights()
828 assert(BB->getTerminator()->getNumSuccessors() > 1 && in calcEstimatedHeuristics()
[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 DFunctionPropertiesAnalysis.cpp32 FPI.BlocksReachedFromConditionalInstruction += BI->getNumSuccessors(); in getFunctionPropertiesInfo()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp53 if (VPB->getNumSuccessors() > 1) in verifyBlocksInRegion()
101 assert(!Exit->getNumSuccessors() && "Region exit has successors."); in verifyRegion()
H A DVPlanHCFGBuilder.cpp255 assert((PreheaderBB->getTerminator()->getNumSuccessors() == 1) && in buildPlainCFG()
284 unsigned NumSuccs = TI->getNumSuccessors(); in buildPlainCFG()
H A DVPlanTransforms.cpp29 if (Base->getNumPredecessors() == 0 || Base->getNumSuccessors() == 0) in VPInstructionsToVPRecipes()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DSparsePropagation.h289 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()
H A DCFGPrinter.h237 if (TI->getNumSuccessors() == 1)
242 if (OpNo >= TI->getNumSuccessors())
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp218 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitKnownCriticalEdge()
363 for (unsigned Succ = 0, E = IBI->getNumSuccessors(); Succ != E; ++Succ) in SplitIndirectBrCriticalEdges()
388 EdgeProbabilities.reserve(Target->getTerminator()->getNumSuccessors()); in SplitIndirectBrCriticalEdges()
389 for (unsigned I = 0, E = Target->getTerminator()->getNumSuccessors(); in SplitIndirectBrCriticalEdges()
H A DSCCPSolver.cpp558 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
582 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
614 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
627 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
634 for (unsigned i = 0; i < IBR->getNumSuccessors(); ++i) { in getFeasibleSuccessors()
650 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1511 if (IBR->getNumSuccessors() < 1) in resolvedUndefsIn()
H A DFunctionComparator.cpp902 assert(TermL->getNumSuccessors() == TermR->getNumSuccessors()); in compare()
903 for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) { in compare()
969 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in functionHash()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp1007 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in getBestDestForJumpOnUndef()
1067 if (IB->getNumSuccessors() == 0) return false; in processBlock()
1101 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1102 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in processBlock()
1460 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in simplifyPartiallyRedundantLoad()
1491 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in simplifyPartiallyRedundantLoad()
1721 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1983 if (TI->isExceptionalTerminator() || TI->getNumSuccessors() != 1 || in maybeMergeBasicBlockIntoOnlyPred()
2296 for (unsigned i = 0, e = PredPredTerm->getNumSuccessors(); i != e; ++i) in threadThroughTwoBasicBlocks()
2419 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in threadEdge()
[all …]
H A DSink.cpp182 if (BB.getTerminator()->getNumSuccessors() <= 1) return false; in ProcessBlock()
H A DSpeculativeExecution.cpp174 if (BI->getNumSuccessors() != 2) in runOnBasicBlock()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h130 if (int successors = TI->getNumSuccessors()) { in buildEdges()
159 if (TargetTI && !TargetTI->getNumSuccessors()) { in buildEdges()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DInstructions.h2988 unsigned getNumSuccessors() const { return 0; }
3112 unsigned getNumSuccessors() const { return 1+isConditional(); }
3115 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
3120 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
3307 assert(SuccessorIndex < SI->getNumSuccessors() &&
3490 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3492 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
3496 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
3662 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3864 unsigned getNumSuccessors() const { return 2; }
[all …]
H A DCFG.h156 return Idx >= 0 && (Idx == 0 || Idx <= (int)Inst->getNumSuccessors()); in index_is_valid()
187 Idx = Inst->getNumSuccessors(); in SuccIterator()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/IR/
H A DStructuralHash.cpp52 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in update()
H A DInstruction.cpp736 unsigned Instruction::getNumSuccessors() const { in getNumSuccessors() function in Instruction
740 return static_cast<const CLASS *>(this)->getNumSuccessors(); in getNumSuccessors()
773 for (unsigned Idx = 0, NumSuccessors = Instruction::getNumSuccessors(); in replaceSuccessorWith()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h234 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
250 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-reduce/deltas/
H A DReduceBasicBlocks.cpp36 if (ChunkSucessors.size() == Term->getNumSuccessors()) in replaceBranchTerminator()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h44 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp90 if (PredBB->getTerminator()->getNumSuccessors() > 1) in replaceConstantExprOp()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp111 if (IBr->getNumSuccessors() == 0) { in runOnFunction()

1234