| /external/llvm/lib/Transforms/Instrumentation/ |
| EdgeProfiling.cpp | 73 NumEdges += BB->getTerminator()->getNumSuccessors();
95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
102 if (TI->getNumSuccessors() == 1) {
|
| OptimalEdgeProfiling.cpp | 99 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) {
|
| GCOVProfiling.cpp | 391 if (int successors = TI->getNumSuccessors()) {
441 Edges += TI->getNumSuccessors();
459 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
553 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 102 return UINT32_MAX / BB->getTerminator()->getNumSuccessors();
112 if (TI->getNumSuccessors() == 0) {
130 if (UnreachableEdges.size() == TI->getNumSuccessors())
135 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
162 if (TI->getNumSuccessors() == 1)
173 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1)
181 Weights.reserve(TI->getNumSuccessors());
189 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
190 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
| SparsePropagation.cpp | 123 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)
|
| ProfileDataLoaderPass.cpp | 120 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
141 unsigned NumSuccessors = TI->getNumSuccessors();
|
| ProfileInfoLoaderPass.cpp | 167 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) {
|
| PathProfileVerifier.cpp | 95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e;
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 130 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
147 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
|
| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI))
73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
93 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
94 if (TI->getNumSuccessors() == 1) return false;
230 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) {
|
| BasicBlockUtils.cpp | 43 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i)
245 unsigned e = Term->getNumSuccessors();
277 assert(BB->getTerminator()->getNumSuccessors() == 1 &&
|
| LoopUnroll.cpp | 71 if (OnlyPred->getTerminator()->getNumSuccessors() != 1)
|
| /external/llvm/unittests/VMCore/ |
| IRBuilderTest.cpp | 84 EXPECT_EQ(2u, TI->getNumSuccessors());
93 EXPECT_EQ(2u, TI->getNumSuccessors());
|
| InstructionsTest.cpp | 62 EXPECT_EQ(1U, b0->getNumSuccessors());
80 EXPECT_EQ(2U, b1->getNumSuccessors());
|
| /external/llvm/include/llvm/Support/ |
| CFG.h | 110 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors();
122 idx = Term->getNumSuccessors();
|
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 605 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {
641 if (SinglePred->getTerminator()->getNumSuccessors() == 1 &&
674 if (IB->getNumSuccessors() == 0) return false;
699 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {
[all...] |
| Sink.cpp | 121 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false;
|
| DeadStoreElimination.cpp | 592 if (BB.getTerminator()->getNumSuccessors() == 0)
606 if (PredTI->getNumSuccessors() != 1)
|
| SCCP.cpp | 524 Succs.resize(TI.getNumSuccessors());
563 Succs.assign(TI.getNumSuccessors(), true);
574 Succs.assign(TI.getNumSuccessors(), true);
[all...] |
| LoopRotation.cpp | 375 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
| /external/llvm/lib/VMCore/ |
| BasicBlock.cpp | 343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
|
| Dominators.cpp | 45 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
|
| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 108 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
|
| /external/llvm/include/llvm/ |
| Instructions.h | [all...] |
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 523 assert(F1TI->getNumSuccessors() == F2TI->getNumSuccessors());
524 for (unsigned i = 0, e = F1TI->getNumSuccessors(); i != e; ++i) {
|
