Home
last modified time | relevance | path

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

1234

/openbsd-src/gnu/llvm/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 DFunctionPropertiesAnalysis.cpp30 Ret += BI->getNumSuccessors(); in getNrBlocksFromCond()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp53 if (VPB->getNumSuccessors() > 1 || (VPBB && VPBB->isExiting())) in verifyBlocksInRegion()
103 assert(!Exiting->getNumSuccessors() && in verifyRegion()
305 if (Region->getExiting()->getNumSuccessors() != 0) { in verifyPlanIsValid()
H A DVPlanTransforms.cpp210 if (EntryBB->getNumSuccessors() != 2) in getPredicatedThenBlock()
218 if (Succ0->getNumSuccessors() + Succ1->getNumSuccessors() != 1) in getPredicatedThenBlock()
321 if (PredVPBB && PredVPBB->getNumSuccessors() == 1) in mergeBlocksIntoPredecessors()
H A DVPlanCFG.h45 while (Current && Current->getNumSuccessors() == 0) in getBlockWithSuccs()
84 ParentWithSuccs ? ParentWithSuccs->getNumSuccessors() : 0; in end()
H A DVPlanHCFGBuilder.cpp268 assert((ThePreheaderBB->getTerminator()->getNumSuccessors() == 1) && in buildPlainCFG()
296 unsigned NumSuccs = TI->getNumSuccessors(); in buildPlainCFG()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/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.h253 if (TI->getNumSuccessors() == 1)
258 if (OpNo >= TI->getNumSuccessors())
/openbsd-src/gnu/llvm/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 DFunctionComparator.cpp917 assert(TermL->getNumSuccessors() == TermR->getNumSuccessors()); in compare()
918 for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) { in compare()
984 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in functionHash()
H A DSCCPSolver.cpp869 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
893 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
925 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
938 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
945 for (unsigned i = 0; i < IBR->getNumSuccessors(); ++i) { in getFeasibleSuccessors()
961 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
/openbsd-src/gnu/llvm/llvm/lib/IR/
H A DStructuralHash.cpp51 for (unsigned i = 0, e = Term->getNumSuccessors(); i != e; ++i) { in update()
H A DProfDataUtils.cpp117 if (ProfileData && ProfileData->getNumOperands() == 1 + I.getNumSuccessors()) in getValidBranchWeightMDNode()
H A DInstruction.cpp823 unsigned Instruction::getNumSuccessors() const { in getNumSuccessors() function in Instruction
827 return static_cast<const CLASS *>(this)->getNumSuccessors(); in getNumSuccessors()
860 for (unsigned Idx = 0, NumSuccessors = Instruction::getNumSuccessors(); in replaceSuccessorWith()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h130 if (int successors = TI->getNumSuccessors()) { in buildEdges()
159 if (TargetTI && !TargetTI->getNumSuccessors()) { in buildEdges()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp1022 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in getBestDestForJumpOnUndef()
1082 if (IB->getNumSuccessors() == 0) return false; in processBlock()
1116 Updates.reserve(BBTerm->getNumSuccessors()); in processBlock()
1117 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in processBlock()
1471 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in simplifyPartiallyRedundantLoad()
1500 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in simplifyPartiallyRedundantLoad()
1727 Updates.reserve(BB->getTerminator()->getNumSuccessors() - 1); in processThreadableEdges()
1987 if (TI->isExceptionalTerminator() || TI->getNumSuccessors() != 1 || in maybeMergeBasicBlockIntoOnlyPred()
2330 for (unsigned i = 0, e = PredPredTerm->getNumSuccessors(); i != e; ++i) in threadThroughTwoBasicBlocks()
2453 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in threadEdge()
[all …]
H A DSpeculativeExecution.cpp174 if (BI->getNumSuccessors() != 2) in runOnBasicBlock()
/openbsd-src/gnu/llvm/llvm/include/llvm/IR/
H A DInstructions.h3106 unsigned getNumSuccessors() const { return 0; }
3230 unsigned getNumSuccessors() const { return 1+isConditional(); }
3233 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
3238 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
3425 assert(SuccessorIndex < SI->getNumSuccessors() &&
3604 unsigned getNumSuccessors() const { return getNumOperands()/2; }
3606 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
3610 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
3774 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3976 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()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineRegionInfo.h44 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/openbsd-src/gnu/llvm/llvm/tools/llvm-reduce/deltas/
H A DReduceBasicBlocks.cpp45 if (ChunkSuccessors.size() == Term->getNumSuccessors()) in replaceBranchTerminator()
/openbsd-src/gnu/llvm/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp89 if (PredBB->getTerminator()->getNumSuccessors() > 1) in replaceConstantExprOp()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp108 if (IBr->getNumSuccessors() == 0) { in runOnFunction()

1234