HomeSort by relevance Sort by last modified time
    Searched refs:getNumIncomingValues (Results 1 - 25 of 52) sorted by null

1 2 3

  /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 207 PHINode *NPN = PHINode::Create(Ty, OPN->getNumIncomingValues());
208 for (unsigned i = 0, e = OPN->getNumIncomingValues(); i != e; ++i) {
414 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
726 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i)
    [all...]
InstCombineShifts.cpp 173 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
302 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
    [all...]
  /external/llvm/lib/Transforms/Utils/
DemoteRegToStack.cpp 54 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
117 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 423 unsigned NumPreds = OPN->getNumIncomingValues();
456 if (NumPreds != PN->getNumIncomingValues()) {
457 assert(NumPreds < PN->getNumIncomingValues());
465 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
486 if (PN->getNumIncomingValues() == 0) {
LoopSimplify.cpp 475 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
556 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
697 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
720 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) {
720 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
734 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
LCSSA.cpp 240 PN->getOperandNumForIncomingValue(PN->getNumIncomingValues()-1)));
PromoteMemoryToRegister.cpp 627 if (SomePHI->getNumIncomingValues() == getNumPreds(BB))
640 for (unsigned i = 0, e = SomePHI->getNumIncomingValues(); i != e; ++i) {
656 unsigned NumBadPreds = SomePHI->getNumIncomingValues();
659 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)
Local.cpp 509 for (unsigned PI = 0, PE = PN->getNumIncomingValues(); PI != PE; ++PI) {
522 for (unsigned PI = 0, PE = PN->getNumIncomingValues(); PI != PE; ++PI) {
603 for (unsigned i = 0, e = OldValPN->getNumIncomingValues(); i != e; ++i)
    [all...]
LoopUnroll.cpp 51 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
  /external/llvm/lib/Transforms/Scalar/
CodeGenPrepare.cpp 260 for (unsigned I = 0, E = UPN->getNumIncomingValues(); I != E; ++I) {
280 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
287 for (unsigned i = 0, e = DestBBPN->getNumIncomingValues(); i != e; ++i) {
348 for (unsigned i = 0, e = InValPhi->getNumIncomingValues(); i != e; ++i)
355 for (unsigned i = 0, e = BBPN->getNumIncomingValues(); i != e; ++i)
672 for (unsigned I = 0, E = PN->getNumIncomingValues(); I != E; ++I) {
780 for (unsigned i = 0, e = P->getNumIncomingValues(); i != e; ++i)
    [all...]
CorrelatedValuePropagation.cpp 96 for (unsigned i = 0, e = P->getNumIncomingValues(); i < e; ++i) {
JumpThreading.cpp 369 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
477 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 613 if (PN->getNumIncomingValues() > MaxLookup) {
617 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 648 if (P->getNumIncomingValues() == 2) {
690 if (P->getNumIncomingValues() == 0)
702 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 735 Assert1(PN->getNumIncomingValues() != 0,
738 Assert1(PN->getNumIncomingValues() == Preds.size(),
744 Values.reserve(PN->getNumIncomingValues());
745 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
FunctionLoweringInfo.cpp 321 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i) {
  /external/llvm/lib/CodeGen/
SjLjEHPrepare.cpp 341 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)

Completed in 259 milliseconds

1 2 3