| /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 | 384 if (int successors = TI->getNumSuccessors()) {
439 Edges += TI->getNumSuccessors();
457 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
545 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 95 if (TI->getNumSuccessors() > 1)
99 if (TI->getNumSuccessors() == 0)
114 return UINT32_MAX / BB->getTerminator()->getNumSuccessors();
145 if (TI->getNumSuccessors() == 1)
156 if (WeightsNode->getNumOperands() != TI->getNumSuccessors() + 1)
164 Weights.reserve(TI->getNumSuccessors());
172 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
173 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
182 if (BB->getTerminator()->getNumSuccessors() == 1)
257 uint32_t numSuccs = BB->getTerminator()->getNumSuccessors();
[all...] |
| 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)
|
| 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;
|
| RegionInfo.cpp | 384 unsigned NumSuccessors = exit->getTerminator()->getNumSuccessors();
397 if (exit->getTerminator()->getNumSuccessors() == 1)
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 128 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
145 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;
224 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();
278 assert(BB->getTerminator()->getNumSuccessors() == 1 &&
|
| LowerSwitch.cpp | 240 for (unsigned i = 1; i < SI->getNumSuccessors(); ++i)
|
| Local.cpp | 114 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i) {
151 for (unsigned i = 0, e = SI->getNumSuccessors(); i != e; ++i) {
168 if (SI->getNumSuccessors() == 2) {
[all...] |
| LoopUnroll.cpp | 71 if (OnlyPred->getTerminator()->getNumSuccessors() != 1)
|
| /external/llvm/unittests/VMCore/ |
| InstructionsTest.cpp | 57 EXPECT_EQ(1U, b0->getNumSuccessors());
75 EXPECT_EQ(2U, b1->getNumSuccessors());
|
| /external/llvm/include/llvm/Support/ |
| CFG.h | 104 return idx >= 0 && (unsigned) idx < Term->getNumSuccessors();
116 idx = Term->getNumSuccessors();
|
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 119 if (BB.getTerminator()->getNumSuccessors() <= 1 || BB.empty()) return false;
|
| JumpThreading.cpp | 600 for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {
636 if (SinglePred->getTerminator()->getNumSuccessors() == 1 &&
692 for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {
[all...] |
| SCCP.cpp | 556 Succs.resize(TI.getNumSuccessors());
585 if (TI.getNumSuccessors() < 2) {
595 Succs.assign(TI.getNumSuccessors(), true);
606 Succs.assign(TI.getNumSuccessors(), true);
649 if (SI->getNumSuccessors() < 2)
659 for (unsigned i = 1, E = SI->getNumSuccessors(); i != E; ++i)
[all...] |
| LoopRotation.cpp | 272 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
|
| LoopUnswitch.cpp | 382 for (unsigned i = 1, e = SI->getNumSuccessors(); i != e; ++i)
649 assert(NewExit->getTerminator()->getNumSuccessors() == 1 &&
[all...] |
| /external/llvm/include/llvm/ |
| Instructions.h | [all...] |
| /external/llvm/lib/VMCore/ |
| BasicBlock.cpp | 343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
|
| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 108 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
|
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 523 assert(F1TI->getNumSuccessors() == F2TI->getNumSuccessors());
524 for (unsigned i = 0, e = F1TI->getNumSuccessors(); i != e; ++i) {
|
