| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 44 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
83 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
91 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
100 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
147 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
220 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
318 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
349 PN.getNumIncomingValues(),
356 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
378 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i
[all...] |
| InstCombineCasts.cpp | 208 PHINode *NPN = PHINode::Create(Ty, OPN->getNumIncomingValues());
209 for (unsigned i = 0, e = OPN->getNumIncomingValues(); i != e; ++i) {
416 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
732 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i)
[all...] |
| InstCombineShifts.cpp | 173 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
301 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
|
| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 65 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
129 for (unsigned i = 0, e = P->getNumIncomingValues(); i < e; ++i) {
|
| SSAUpdater.cpp | 75 unsigned PHINumValues = PHI->getNumIncomingValues();
130 for (unsigned i = 0, e = SomePhi->getNumIncomingValues(); i != e; ++i) {
245 : PHI(P), idx(PHI->getNumIncomingValues()) {}
283 for (unsigned PI = 0, E = SomePhi->getNumIncomingValues(); PI != E; ++PI)
328 if (PHI && PHI->getNumIncomingValues() == 0)
|
| CloneFunction.cpp | 418 unsigned NumPreds = OPN->getNumIncomingValues();
451 if (NumPreds != PN->getNumIncomingValues()) {
452 assert(NumPreds < PN->getNumIncomingValues());
460 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
481 if (PN->getNumIncomingValues() == 0) {
|
| LoopSimplify.cpp | 468 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
540 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
680 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
703 for (unsigned i = 0, e = PN->getNumIncomingValues()-1; i != e; ++i)
|
| CodeExtractor.cpp | 117 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
154 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
172 for (unsigned i = 0; i != PN->getNumIncomingValues(); ++i) {
719 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
733 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
|
| LCSSA.cpp | 240 PN->getOperandNumForIncomingValue(PN->getNumIncomingValues()-1)));
|
| PromoteMemoryToRegister.cpp | 624 if (SomePHI->getNumIncomingValues() == getNumPreds(BB))
637 for (unsigned i = 0, e = SomePHI->getNumIncomingValues(); i != e; ++i) {
653 unsigned NumBadPreds = SomePHI->getNumIncomingValues();
656 SomePHI->getNumIncomingValues() == NumBadPreds) {
[all...] |
| ValueMapper.cpp | 175 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
|
| BreakCriticalEdges.cpp | 258 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
|
| LoopUnroll.cpp | 51 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
|
| SimplifyCFG.cpp | 134 assert(SomePHI->getNumIncomingValues() == 2 &&
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 234 for (unsigned I = 0, E = UPN->getNumIncomingValues(); I != E; ++I) {
254 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
261 for (unsigned i = 0, e = DestBBPN->getNumIncomingValues(); i != e; ++i) {
322 for (unsigned i = 0, e = InValPhi->getNumIncomingValues(); i != e; ++i)
329 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
637 for (unsigned I = 0, E = PN->getNumIncomingValues(); I != E; ++I) {
745 for (unsigned i = 0, e = P->getNumIncomingValues(); i != e; ++i)
[all...] |
| CorrelatedValuePropagation.cpp | 94 for (unsigned i = 0, e = P->getNumIncomingValues(); i < e; ++i) {
|
| JumpThreading.cpp | 364 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
472 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
[all...] |
| SCCP.cpp | 723 if (PN.getNumIncomingValues() > 64)
733 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
[all...] |
| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 249 if (PN.getNumIncomingValues() > 64) {
257 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
|
| BasicAliasAnalysis.cpp | 612 if (PN->getNumIncomingValues() > MaxLookup) {
616 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
[all...] |
| ScalarEvolutionNormalization.cpp | 53 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
|
| ValueTracking.cpp | 594 if (P->getNumIncomingValues() == 2) {
640 if (P->getNumIncomingValues() == 0)
652 for (unsigned i = 0, e = P->getNumIncomingValues(); i != e; ++i) {
[all...] |
| /external/llvm/lib/VMCore/ |
| BasicBlock.cpp | 238 unsigned max_idx = APN->getNumIncomingValues();
|
| Verifier.cpp | 742 Assert1(PN->getNumIncomingValues() != 0,
745 Assert1(PN->getNumIncomingValues() == Preds.size(),
751 Values.reserve(PN->getNumIncomingValues());
752 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionAttrs.cpp | 295 for (int i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
|
