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

123

/external/llvm/lib/Transforms/Instrumentation/
H A DEdgeProfiling.cpp73 NumEdges += BB->getTerminator()->getNumSuccessors();
95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
102 if (TI->getNumSuccessors() == 1) {
H A DOptimalEdgeProfiling.cpp99 if (BB->getTerminator()->getNumSuccessors() == 0) {
103 NumEdges += BB->getTerminator()->getNumSuccessors();
172 if (TI->getNumSuccessors() == 0) {
182 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
196 if (TI->getNumSuccessors() == 1) {
H A DGCOVProfiling.cpp449 if (int successors = TI->getNumSuccessors()) {
502 Edges += TI->getNumSuccessors();
520 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
641 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
/external/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp116 return UINT32_MAX / BB->getTerminator()->getNumSuccessors();
126 if (TI->getNumSuccessors() == 0) {
144 if (UnreachableEdges.size() == TI->getNumSuccessors())
149 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
176 if (TI->getNumSuccessors() == 1)
187 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1)
195 Weights.reserve(TI->getNumSuccessors());
203 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
204 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
220 if (TI->getNumSuccessors()
[all...]
H A DSparsePropagation.cpp123 Succs.resize(TI.getNumSuccessors());
124 if (TI.getNumSuccessors() == 0) return;
183 Succs.assign(TI.getNumSuccessors(), true);
194 Succs.assign(TI.getNumSuccessors(), true);
210 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
H A DProfileDataLoaderPass.cpp120 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
141 unsigned NumSuccessors = TI->getNumSuccessors();
H A DCFG.cpp76 unsigned e = Term->getNumSuccessors();
90 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
91 if (TI->getNumSuccessors() == 1) return false;
H A DProfileInfoLoaderPass.cpp167 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
188 if (TI->getNumSuccessors() == 0) {
191 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
H A DPathProfileVerifier.cpp94 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e;
H A DLoopInfo.cpp253 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
287 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h109 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
126 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
/external/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp73 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI))
74 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
198 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
/external/llvm/unittests/IR/
H A DIRBuilderTest.cpp87 EXPECT_EQ(2u, TI->getNumSuccessors());
96 EXPECT_EQ(2u, TI->getNumSuccessors());
H A DInstructionsTest.cpp62 EXPECT_EQ(1U, b0->getNumSuccessors());
80 EXPECT_EQ(2U, b1->getNumSuccessors());
/external/llvm/include/llvm/Support/
H A DCFG.h113 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors();
126 idx = Term->getNumSuccessors();
/external/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp616 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {
652 if (SinglePred->getTerminator()->getNumSuccessors() == 1 &&
685 if (IB->getNumSuccessors() == 0) return false;
710 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {
929 OneUnavailablePred->getTerminator()->getNumSuccessors() == 1) {
961 assert(UnavailablePred->getTerminator()->getNumSuccessors() == 1 &&
1054 assert(i != TI->getNumSuccessors() && "Didn't find any successor!");
1158 for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i)
1464 for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)
H A DSink.cpp121 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false;
H A DDeadStoreElimination.cpp633 if (BB.getTerminator()->getNumSuccessors() == 0)
647 if (PredTI->getNumSuccessors() != 1)
H A DSCCP.cpp517 Succs.resize(TI.getNumSuccessors());
556 Succs.assign(TI.getNumSuccessors(), true);
567 Succs.assign(TI.getNumSuccessors(), true);
1785 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
1868 for (unsigned i = 1, e = TI->getNumSuccessors(); i != e; ++i)
H A DLoopRotation.cpp402 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
/external/llvm/lib/IR/
H A DBasicBlock.cpp343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
H A DDominators.cpp45 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
/external/llvm/tools/llvm-prof/
H A Dllvm-prof.cpp108 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
/external/llvm/include/llvm/IR/
H A DInstructions.h2330 unsigned getNumSuccessors() const { return 0; } function in class:llvm::ReturnInst
2412 unsigned getNumSuccessors() const { return 1+isConditional(); } function in class:llvm::BranchInst
2415 assert(i < getNumSuccessors() && "Successor # out of range for Branch!");
2420 assert(idx < getNumSuccessors() && "Successor # out of range for Branch!");
2645 unsigned getNumSuccessors() const { return getNumOperands()/2; } function in class:llvm::SwitchInst
2647 assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!");
2651 assert(idx < getNumSuccessors() && "Successor # out of range for switch!");
2703 assert(SuccessorIndex < SI->getNumSuccessors() &&
2928 unsigned getNumSuccessors() const { return getNumOperands()-1; } function in class:llvm::IndirectBrInst
3152 unsigned getNumSuccessors() cons
3233 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::ResumeInst
3277 unsigned getNumSuccessors() const { return 0; } function in class:llvm::InvokeInst::UnreachableInst
[all...]
/external/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp529 assert(F1TI->getNumSuccessors() == F2TI->getNumSuccessors());
530 for (unsigned i = 0, e = F1TI->getNumSuccessors(); i != e; ++i) {

Completed in 1546 milliseconds

123