Searched refs:getNumIncomingValues (Results 1 - 25 of 68) sorted by relevance

123

/external/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp45 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
84 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
92 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
101 for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) {
148 for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) {
221 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();
[all...]
/external/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp56 for (unsigned i = 0, e = A->getNumIncomingValues(); i != e; ++i)
65 for (unsigned i = 0, e = A->getNumIncomingValues(); i != e; ++i) {
H A DObjCARCContract.cpp583 for (unsigned i = 0, e = PHI->getNumIncomingValues(); i != e; ++i)
/external/llvm/lib/Transforms/Utils/
H A DDemoteRegToStack.cpp69 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
126 for (unsigned i = 0, e = P->getNumIncomingValues(); i < e; ++i) {
H A DSSAUpdater.cpp67 unsigned PHINumValues = PHI->getNumIncomingValues();
101 for (unsigned i = 0, e = SomePhi->getNumIncomingValues(); i != e; ++i) {
228 : PHI(P), idx(PHI->getNumIncomingValues()) {}
294 if (PHI && PHI->getNumIncomingValues() == 0)
H A DBasicBlockUtils.cpp139 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
402 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
423 for (int64_t i = PN->getNumIncomingValues() - 1; i >= 0; --i)
445 for (int64_t i = PN->getNumIncomingValues() - 1; i >= 0; --i) {
788 if (SomePHI->getNumIncomingValues() != 2)
H A DCloneFunction.cpp552 unsigned NumPreds = OPN->getNumIncomingValues();
585 if (NumPreds != PN->getNumIncomingValues()) {
586 assert(NumPreds < PN->getNumIncomingValues());
594 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
615 if (PN->getNumIncomingValues() == 0) {
H A DCodeExtractor.cpp199 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
236 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
254 for (unsigned i = 0; i != PN->getNumIncomingValues(); ++i) {
741 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
755 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
H A DBreakCriticalEdges.cpp216 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
H A DLoopSimplify.cpp227 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
274 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
414 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
437 for (unsigned i = 0, e = PN->getNumIncomingValues()-1; i != e; ++i)
H A DPromoteMemoryToRegister.cpp730 if (SomePHI->getNumIncomingValues() == getNumPreds(BB))
743 for (unsigned i = 0, e = SomePHI->getNumIncomingValues(); i != e; ++i) {
758 unsigned NumBadPreds = SomePHI->getNumIncomingValues();
761 SomePHI->getNumIncomingValues() == NumBadPreds) {
H A DLocal.cpp577 for (unsigned PI = 0, PE = PN->getNumIncomingValues(); PI != PE; ++PI) {
591 for (unsigned PI = 0, PE = PN->getNumIncomingValues(); PI != PE; ++PI) {
652 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
668 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
711 for (unsigned i = 0, e = OldValPN->getNumIncomingValues(); i != e; ++i) {
H A DLCSSA.cpp128 PN->getNumIncomingValues() - 1)));
H A DValueMapper.cpp362 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
/external/llvm/lib/Target/R600/
H A DSIAnnotateControlFlow.cpp174 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
218 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
233 for (unsigned i = 0, e = Phi->getNumIncomingValues(); i != e; ++i) {
/external/llvm/lib/Analysis/
H A DSparsePropagation.cpp250 if (PN.getNumIncomingValues() > 64) {
258 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) {
H A DScalarEvolutionNormalization.cpp53 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
H A DBasicAliasAnalysis.cpp636 if (PN->getNumIncomingValues() > MaxLookup) {
640 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1322 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1341 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
H A DMemoryBuiltins.cpp737 PHINode *SizePHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
738 PHINode *OffsetPHI = Builder.CreatePHI(IntTy, PHI.getNumIncomingValues());
744 for (unsigned i = 0, e = PHI.getNumIncomingValues(); i != e; ++i) {
/external/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp137 for (int I = 0, E = PN->getNumIncomingValues(); I < E; ++I)
/external/llvm/lib/Transforms/Scalar/
H A DLICM.cpp494 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
522 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
556 PHINode::Create(OInst->getType(), PN.getNumIncomingValues(),
558 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
H A DCorrelatedValuePropagation.cpp100 for (unsigned i = 0, e = P->getNumIncomingValues(); i < e; ++i) {
H A DJumpThreading.cpp398 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
508 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1240 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1338 cast<PHINode>(BB->front()).getNumIncomingValues()) {
1694 for (unsigned I = 0, E = CondLHS->getNumIncomingValues(); I != E; ++I) {
H A DInductiveRangeCheckElimination.cpp625 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
1134 for (unsigned i = 0, e = PN->getNumIncomingValues(); i < e; ++i)
1154 for (unsigned i = 0, e = PN->getNumIncomingValues(); i < e; ++i)
/external/llvm/lib/IR/
H A DBasicBlock.cpp283 unsigned max_idx = APN->getNumIncomingValues();

Completed in 188 milliseconds

123