Home
last modified time | relevance | path

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

123

/external/llvm/lib/Analysis/
DBranchProbabilityInfo.cpp119 return UINT32_MAX / BB->getTerminator()->getNumSuccessors(); in getMaxWeightFor()
129 if (TI->getNumSuccessors() == 0) { in calcUnreachableHeuristics()
147 if (UnreachableEdges.size() == TI->getNumSuccessors()) in calcUnreachableHeuristics()
152 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) in calcUnreachableHeuristics()
179 if (TI->getNumSuccessors() == 1) in calcMetadataWeights()
190 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1) in calcMetadataWeights()
198 Weights.reserve(TI->getNumSuccessors()); in calcMetadataWeights()
207 assert(Weights.size() == TI->getNumSuccessors() && "Checked above"); in calcMetadataWeights()
208 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in calcMetadataWeights()
224 if (TI->getNumSuccessors() == 0) in calcColdCallHeuristics()
[all …]
DSparsePropagation.cpp124 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
125 if (TI.getNumSuccessors() == 0) return; in getFeasibleSuccessors()
184 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
195 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
211 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in isEdgeFeasible()
DCFG.cpp75 unsigned e = Term->getNumSuccessors(); in GetSuccessorNumber()
89 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge()
90 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge()
DLoopInfo.cpp245 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { in getLoopID()
279 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { in setLoopID()
DDivergenceAnalysis.cpp280 if (TI->getNumSuccessors() > 1) in propagate()
/external/llvm/include/llvm/Transforms/Utils/
DBasicBlockUtils.h162 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
179 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/llvm/lib/Transforms/Scalar/
DJumpThreading.cpp636 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) { in GetBestDestForJumpOnUndef()
672 if (SinglePred->getTerminator()->getNumSuccessors() == 1 && in ProcessBlock()
700 if (IB->getNumSuccessors() == 0) return false; in ProcessBlock()
726 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) { in ProcessBlock()
970 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) { in SimplifyPartiallyRedundantLoad()
1002 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 && in SimplifyPartiallyRedundantLoad()
1104 assert(i != TI->getNumSuccessors() && "Didn't find any successor!"); in FindMostPopularDest()
1209 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i) in ProcessThreadableEdges()
1514 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i) in ThreadEdge()
DMergedLoadStoreMotion.cpp212 if (BB->getTerminator()->getNumSuccessors() != 2) in isDiamondHead()
220 Succ0->getTerminator()->getNumSuccessors() != 1) in isDiamondHead()
223 Succ1->getTerminator()->getNumSuccessors() != 1) in isDiamondHead()
DLoopInterchange.cpp612 unsigned num = outerLoopHeaderBI->getNumSuccessors(); in tightlyNested()
1061 unsigned NumSucc = OuterLoopPredecessorBI->getNumSuccessors(); in adjustLoopBranches()
1067 NumSucc = OuterLoopHeaderBI->getNumSuccessors(); in adjustLoopBranches()
1084 NumSucc = InnerLoopLatchPredecessorBI->getNumSuccessors(); in adjustLoopBranches()
DSampleProfile.cpp602 if (TI->getNumSuccessors() == 1) in propagateWeights()
611 for (unsigned I = 0; I < TI->getNumSuccessors(); ++I) { in propagateWeights()
DSink.cpp122 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false; in ProcessBlock()
DSCCP.cpp520 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors()
559 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
570 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors()
1794 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.cpp621 if (BB.getTerminator()->getNumSuccessors() == 0) in runOnBasicBlock()
635 if (PredTI->getNumSuccessors() != 1) in FindUnconditionalPreds()
/external/llvm/lib/Transforms/Utils/
DAddDiscriminators.cpp181 for (unsigned I = 0; I < Last->getNumSuccessors(); ++I) { in runOnFunction()
DBasicBlockUtils.cpp44 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) in DeleteDeadBlock()
256 assert(BB->getTerminator()->getNumSuccessors() == 1 && in SplitEdge()
267 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) in SplitAllCriticalEdges()
268 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) in SplitAllCriticalEdges()
DBreakCriticalEdges.cpp188 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge()
/external/clang/lib/CodeGen/
DCGLoopInfo.cpp100 for (unsigned i = 0, ie = TI->getNumSuccessors(); i < ie; ++i) in InsertHelper()
/external/llvm/include/llvm/IR/
DCFG.h129 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors(); in index_is_valid()
160 idx = Term->getNumSuccessors(); in SuccIterator()
DInstructions.h2489 unsigned getNumSuccessors() const { return 0; }
2572 unsigned getNumSuccessors() const { return 1+isConditional(); }
2575 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
2580 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
2672 assert(SuccessorIndex < SI->getNumSuccessors() &&
2889 unsigned getNumSuccessors() const { return getNumOperands()/2; }
2891 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
2895 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
2989 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3246 unsigned getNumSuccessors() const { return 2; }
[all …]
/external/llvm/unittests/IR/
DIRBuilderTest.cpp90 EXPECT_EQ(2u, TI->getNumSuccessors()); in TEST_F()
99 EXPECT_EQ(2u, TI->getNumSuccessors()); in TEST_F()
/external/llvm/include/llvm/CodeGen/
DMachineRegionInfo.h45 static unsigned getNumSuccessors(MachineBasicBlock *BB) {
/external/llvm/lib/Transforms/Instrumentation/
DGCOVProfiling.cpp517 if (int successors = TI->getNumSuccessors()) { in emitProfileNotes()
586 Edges += TI->getNumSuccessors(); in emitProfileArcs()
604 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs()
726 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in buildEdgeLookupTable()
/external/llvm/include/llvm/Analysis/
DRegionInfo.h92 static unsigned getNumSuccessors(BasicBlock *BB) {
93 return BB->getTerminator()->getNumSuccessors();
/external/llvm/lib/IR/
DDominators.cpp45 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) { in isSingleEdge()
/external/llvm/lib/Target/XCore/
DXCoreLowerThreadLocal.cpp140 if (PredBB->getTerminator()->getNumSuccessors() > 1) in replaceConstantExprOp()

123