Searched refs:getNumSuccessors (Results 1 - 25 of 52) sorted by relevance

123

/external/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp118 return UINT32_MAX / BB->getTerminator()->getNumSuccessors();
128 if (TI->getNumSuccessors() == 0) {
146 if (UnreachableEdges.size() == TI->getNumSuccessors())
151 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
178 if (TI->getNumSuccessors() == 1)
189 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1)
197 Weights.reserve(TI->getNumSuccessors());
205 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
206 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
222 if (TI->getNumSuccessors()
[all...]
H A DSparsePropagation.cpp124 Succs.resize(TI.getNumSuccessors());
125 if (TI.getNumSuccessors() == 0) return;
184 Succs.assign(TI.getNumSuccessors(), true);
195 Succs.assign(TI.getNumSuccessors(), true);
211 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
H A DCFG.cpp75 unsigned e = Term->getNumSuccessors();
89 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
90 if (TI->getNumSuccessors() == 1) return false;
H A DLoopInfo.cpp247 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
281 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
H A DRegionInfo.cpp400 unsigned NumSuccessors = exit->getTerminator()->getNumSuccessors();
413 if (exit->getTerminator()->getNumSuccessors() == 1)
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h110 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
127 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI))
73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
197 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
H A DAddDiscriminators.cpp181 for (unsigned I = 0; I < Last->getNumSuccessors(); ++I) {
H A DLoopUnroll.cpp77 if (OnlyPred->getTerminator()->getNumSuccessors() != 1)
/external/clang/lib/CodeGen/
H A DCGLoopInfo.cpp102 for (unsigned i = 0, ie = TI->getNumSuccessors(); i < ie; ++i)
/external/llvm/include/llvm/IR/
H A DCFG.h119 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors();
148 idx = Term->getNumSuccessors();
H A DInstructions.h2416 unsigned getNumSuccessors() const { return 0; } function in class:llvm::ReturnInst
2499 unsigned getNumSuccessors() const { return 1+isConditional(); } function in class:llvm::BranchInst
2502 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
2507 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
2599 assert(SuccessorIndex < SI->getNumSuccessors() &&
2816 unsigned getNumSuccessors() const { return getNumOperands()/2; } function in class:llvm::SwitchInst
2818 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
2822 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
2916 unsigned getNumSuccessors() const { return getNumOperands()-1; }
3160 unsigned getNumSuccessors() cons
3241 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::ResumeInst
3285 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::UnreachableInst
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp630 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {
666 if (SinglePred->getTerminator()->getNumSuccessors() == 1 &&
699 if (IB->getNumSuccessors() == 0) return false;
724 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {
948 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) {
980 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 &&
1073 assert(i != TI->getNumSuccessors() && "Didn't find any successor!");
1177 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i)
1482 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)
H A DSink.cpp124 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false;
H A DDeadStoreElimination.cpp635 if (BB.getTerminator()->getNumSuccessors() == 0)
649 if (PredTI->getNumSuccessors() != 1)
H A DSampleProfile.cpp926 if (TI->getNumSuccessors() == 1)
935 for (unsigned I = 0; I < TI->getNumSuccessors(); ++I) {
H A DSCCP.cpp519 Succs.resize(TI.getNumSuccessors());
558 Succs.assign(TI.getNumSuccessors(), true);
569 Succs.assign(TI.getNumSuccessors(), true);
1789 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
1873 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i)
H A DLoopRotation.cpp427 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
/external/llvm/unittests/IR/
H A DIRBuilderTest.cpp88 EXPECT_EQ(2u, TI->getNumSuccessors());
97 EXPECT_EQ(2u, TI->getNumSuccessors());
/external/llvm/lib/IR/
H A DBasicBlock.cpp347 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
H A DDominators.cpp44 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
/external/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp139 if (PredBB->getTerminator()->getNumSuccessors() > 1)
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp515 if (int successors = TI->getNumSuccessors()) {
588 Edges += TI->getNumSuccessors();
606 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
727 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
/external/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp1041 assert(TermL->getNumSuccessors() == TermR->getNumSuccessors());
1042 for (unsigned i = 0, e = TermL->getNumSuccessors(); i != e; ++i) {
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp314 FirstLI->getParent()->getTerminator()->getNumSuccessors() != 1)
342 LI->getParent()->getTerminator()->getNumSuccessors() != 1)

Completed in 449 milliseconds

123