Home
last modified time | relevance | path

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

12

/external/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp89 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); in getMaxWeightFor()
99 if (TI->getNumSuccessors() == 0) { in calcUnreachableHeuristics()
117 if (UnreachableEdges.size() == TI->getNumSuccessors()) in calcUnreachableHeuristics()
122 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) in calcUnreachableHeuristics()
148 if (TI->getNumSuccessors() == 1) in calcMetadataWeights()
159 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
167 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
175 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
176 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
DSparsePropagation.cpp123 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
124 if (TI.getNumSuccessors() == 0) return; in getFeasibleSuccessors()
183 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
194 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
210 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
DProfileInfoLoaderPass.cpp167 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
188 if (TI->getNumSuccessors() == 0) { in runOnModule()
191 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
DPathProfileVerifier.cpp95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; in runOnModule()
DRegionInfo.cpp382 unsigned NumSuccessors = exit->getTerminator()->getNumSuccessors(); in getExpandedRegion()
395 if (exit->getTerminator()->getNumSuccessors() == 1) in getExpandedRegion()
DInlineCost.cpp962 for (unsigned TIdx = 0, TSize = TI->getNumSuccessors(); TIdx != TSize; ++TIdx) in analyzeCall()
969 if (SingleBB && TI->getNumSuccessors() > 1) { in analyzeCall()
/external/llvm/lib/Transforms/Instrumentation/
DOptimalEdgeProfiling.cpp99 if (BB->getTerminator()->getNumSuccessors() == 0) { in runOnModule()
103 NumEdges += BB->getTerminator()->getNumSuccessors(); in runOnModule()
172 if (TI->getNumSuccessors() == 0) { in runOnModule()
182 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
196 if (TI->getNumSuccessors() == 1) { in runOnModule()
DEdgeProfiling.cpp73 NumEdges += BB->getTerminator()->getNumSuccessors(); in runOnModule()
95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in runOnModule()
102 if (TI->getNumSuccessors() == 1) { in runOnModule()
DGCOVProfiling.cpp391 if (int successors = TI->getNumSuccessors()) { in emitGCNO()
440 Edges += TI->getNumSuccessors(); in emitProfileArcs()
458 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs()
546 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable()
/external/llvm/lib/Transforms/Utils/
DBreakCriticalEdges.cpp72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) in runOnFunction()
73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in runOnFunction()
93 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
94 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
224 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
DBasicBlockUtils.cpp43 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) in DeleteDeadBlock()
245 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
277 assert(BB->getTerminator()->getNumSuccessors() == 1 && in SplitEdge()
DCodeExtractor.cpp232 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in findInputsOutputs()
482 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in emitCallAndSwitchStatement()
/external/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h128 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
145 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp605 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
641 if (SinglePred->getTerminator()->getNumSuccessors() == 1 && in ProcessBlock()
697 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
912 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
944 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1037 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); in FindMostPopularDest()
1141 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i) in ProcessThreadableEdges()
1447 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
DSink.cpp120 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false; in ProcessBlock()
DSCCP.cpp524 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
563 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
574 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1795 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { in runOnModule()
1878 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i) in runOnModule()
DDeadStoreElimination.cpp615 if (BB.getTerminator()->getNumSuccessors() == 0) in runOnBasicBlock()
629 if (PredTI->getNumSuccessors() != 1) in FindUnconditionalPreds()
DLoopRotation.cpp376 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in rotateLoop()
/external/llvm/unittests/VMCore/
DInstructionsTest.cpp62 EXPECT_EQ(1U, b0->getNumSuccessors()); in TEST()
80 EXPECT_EQ(2U, b1->getNumSuccessors()); in TEST()
/external/llvm/include/llvm/Support/
DCFG.h110 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors(); in index_is_valid()
122 idx = Term->getNumSuccessors(); in SuccIterator()
/external/llvm/include/llvm/
DInstructions.h2311 unsigned getNumSuccessors() const { return 0; }
2394 unsigned getNumSuccessors() const { return 1+isConditional(); }
2397 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
2402 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
2495 assert(SuccessorIndex < SI->getNumSuccessors() &&
2697 unsigned getNumSuccessors() const { return getNumOperands()/2; }
2699 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
2703 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
2798 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3012 unsigned getNumSuccessors() const { return 2; }
[all …]
/external/llvm/lib/Transforms/IPO/
DMergeFunctions.cpp523 assert(F1TI->getNumSuccessors() == F2TI->getNumSuccessors()); in compare()
524 for (unsigned i = 0, e = F1TI->getNumSuccessors(); i != e; ++i) { in compare()
/external/llvm/lib/VMCore/
DBasicBlock.cpp343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { in replaceSuccessorsPhiUsesWith()
/external/llvm/tools/llvm-prof/
Dllvm-prof.cpp108 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { in emitBasicBlockEndAnnot()
/external/llvm/lib/Transforms/InstCombine/
DInstCombinePHI.cpp314 FirstLI->getParent()->getTerminator()->getNumSuccessors() != 1) in FoldPHIArgLoadIntoPHI()
342 LI->getParent()->getTerminator()->getNumSuccessors() != 1) in FoldPHIArgLoadIntoPHI()

12