/external/llvm/lib/Transforms/Utils/ |
D | DemoteRegToStack.cpp | 56 Value *&V = Loads[PN->getIncomingBlock(i)]; in DemoteRegToStack() 60 PN->getIncomingBlock(i)->getTerminator()); in DemoteRegToStack() 119 assert(II->getParent() != P->getIncomingBlock(i) && in DemotePHIToStack() 123 P->getIncomingBlock(i)->getTerminator()); in DemotePHIToStack()
|
D | SSAUpdater.cpp | 81 if (ValueMapping[PHI->getIncomingBlock(i)] != in IsEquivalentPHI() 131 BasicBlock *PredBB = SomePhi->getIncomingBlock(i); in GetValueInMiddleOfBlock() 213 V = GetValueAtEndOfBlock(UserPN->getIncomingBlock(U)); in RewriteUse() 234 V = GetValueAtEndOfBlock(UserPN->getIncomingBlock(U)); in RewriteUseAfterInsertions() 270 BasicBlock *getIncomingBlock() { return PHI->getIncomingBlock(idx); } in getIncomingBlock() function in llvm::SSAUpdaterTraits::PHI_iterator 287 Preds->push_back(SomePhi->getIncomingBlock(PI)); in FindPredecessorBlocks()
|
D | CodeExtractor.cpp | 198 if (Blocks.count(PN->getIncomingBlock(i))) in severSplitPHINodes() 235 if (Blocks.count(PN->getIncomingBlock(i))) { in severSplitPHINodes() 236 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); in severSplitPHINodes() 253 if (Blocks.count(PN->getIncomingBlock(i))) { in severSplitPHINodes() 254 NewPN->addIncoming(PN->getIncomingValue(i), PN->getIncomingBlock(i)); in severSplitPHINodes() 411 return P->getIncomingBlock(UI); in FindPhiPredForUseInBlock() 744 if (!Blocks.count(PN->getIncomingBlock(i))) in extractCodeRegion() 758 if (Blocks.count(PN->getIncomingBlock(i))) { in extractCodeRegion() 759 if (ProcessedPreds.insert(PN->getIncomingBlock(i)).second) in extractCodeRegion()
|
D | LoopSimplify.cpp | 477 L->contains(PN->getIncomingBlock(i))) in FindPHIToPartitionLoops() 558 !L->contains(PN->getIncomingBlock(i))) { in SeparateNestedLoop() 560 if (isa<IndirectBrInst>(PN->getIncomingBlock(i)->getTerminator())) in SeparateNestedLoop() 562 OuterLoopPreds.push_back(PN->getIncomingBlock(i)); in SeparateNestedLoop() 698 BasicBlock *IBB = PN->getIncomingBlock(i); in InsertUniqueBackedgeBlock() 717 PN->setIncomingBlock(0, PN->getIncomingBlock(PreheaderIdx)); in InsertUniqueBackedgeBlock()
|
D | BreakCriticalEdges.cpp | 220 if (PN->getIncomingBlock(BBIdx) != TIBB) in SplitCriticalEdge() 265 if (PN->getIncomingBlock(i) != NewBB) in SplitCriticalEdge() 266 OtherPreds.push_back(PN->getIncomingBlock(i)); in SplitCriticalEdge()
|
D | LCSSA.cpp | 189 UserBB = PN->getIncomingBlock(UI); in ProcessInstruction() 259 UserBB = PN->getIncomingBlock(*UsesToRewrite[i]); in ProcessInstruction()
|
D | Local.cpp | 521 BasicBlock *IBB = PN->getIncomingBlock(PI); in CanPropagatePredecessorsForPHIs() 537 BasicBlock *IBB = PN->getIncomingBlock(PI); in CanPropagatePredecessorsForPHIs() 586 if (PN->getIncomingBlock(UI) != BB) in TryToSimplifyUncondBranchFromEmptyBlock() 621 OldValPN->getIncomingBlock(i)); in TryToSimplifyUncondBranchFromEmptyBlock()
|
D | SimplifyCFG.cpp | 197 BasicBlock *Pred1 = SomePHI->getIncomingBlock(0); in GetIfCondition() 198 BasicBlock *Pred2 = SomePHI->getIncomingBlock(1); in GetIfCondition() 1150 if (PN->getIncomingBlock(i) == BB1 || PN->getIncomingBlock(i) == BB2) in HoistThenElseCodeToIf() 1367 BasicBlock *PredBB = PN->getIncomingBlock(i); in FoldCondBranchOnPHI() 1503 BasicBlock *IfBlock1 = PN->getIncomingBlock(0); in FoldTwoEntryPHINode() 1504 BasicBlock *IfBlock2 = PN->getIncomingBlock(1); in FoldTwoEntryPHINode() 1552 Value *TrueVal = PN->getIncomingValue(PN->getIncomingBlock(0) == IfFalse); in FoldTwoEntryPHINode() 1553 Value *FalseVal = PN->getIncomingValue(PN->getIncomingBlock(0) == IfTrue); in FoldTwoEntryPHINode() 3502 TerminatorInst *T = PHI->getIncomingBlock(i)->getTerminator(); in removeUndefIntroducingPredecessor() 3505 BB->removePredecessor(PHI->getIncomingBlock(i)); in removeUndefIntroducingPredecessor()
|
D | CloneFunction.cpp | 434 Value *V = VMap[PN->getIncomingBlock(pred)]; in CloneAndPruneFunctionInto() 466 ++PredCount[PN->getIncomingBlock(i)]; in CloneAndPruneFunctionInto()
|
D | ValueMapper.cpp | 176 Value *V = MapValue(PN->getIncomingBlock(i), VMap, Flags); in RemapInstruction()
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombinePHI.cpp | 85 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0)); in FoldPHIArgBinOpIntoPHI() 93 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0)); in FoldPHIArgBinOpIntoPHI() 104 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i)); in FoldPHIArgBinOpIntoPHI() 108 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i)); in FoldPHIArgBinOpIntoPHI() 211 NewPN->addIncoming(FirstOp, PN.getIncomingBlock(0)); in FoldPHIArgGEPIntoPHI() 222 BasicBlock *InBB = PN.getIncomingBlock(i); in FoldPHIArgGEPIntoPHI() 306 if (FirstLI->getParent() != PN.getIncomingBlock(0) || in FoldPHIArgLoadIntoPHI() 326 LI->getParent() != PN.getIncomingBlock(i) || in FoldPHIArgLoadIntoPHI() 353 NewPN->addIncoming(InVal, PN.getIncomingBlock(0)); in FoldPHIArgLoadIntoPHI() 360 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i)); in FoldPHIArgLoadIntoPHI() [all …]
|
D | InstructionCombining.cpp | 635 NonConstBB = PN->getIncomingBlock(i); in FoldOpIntoPhi() 677 BasicBlock *ThisBB = PN->getIncomingBlock(i); in FoldOpIntoPhi() 700 NewPN->addIncoming(InV, PN->getIncomingBlock(i)); in FoldOpIntoPhi() 711 NewPN->addIncoming(InV, PN->getIncomingBlock(i)); in FoldOpIntoPhi() 723 NewPN->addIncoming(InV, PN->getIncomingBlock(i)); in FoldOpIntoPhi() 2035 UserParent = PN->getIncomingBlock(I->use_begin().getUse()); in DoOneIteration()
|
/external/llvm/lib/VMCore/ |
D | Dominators.cpp | 224 PN->getIncomingBlock(U) == BBE.getStart()) in dominates() 231 UseBB = PN->getIncomingBlock(U); in dominates() 247 UseBB = PN->getIncomingBlock(U); in dominates() 298 return isReachableFromEntry(PN->getIncomingBlock(U)); in isReachableFromEntry()
|
D | Instruction.cpp | 232 if (thisPHI->getIncomingBlock(i) != otherPHI->getIncomingBlock(i)) in isIdenticalToWhenDefined() 322 if (PN->getIncomingBlock(UI) != BB) in isUsedOutsideOfBlock()
|
D | BasicBlock.cpp | 241 BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred); in removePredecessor()
|
/external/llvm/lib/Transforms/Scalar/ |
D | CodeGenPrepare.cpp | 319 Insn->getParent() != UPN->getIncomingBlock(I)) in CanMergeBlocks() 337 BBPreds.insert(BBPN->getIncomingBlock(i)); in CanMergeBlocks() 344 BasicBlock *Pred = DestBBPN->getIncomingBlock(i); in CanMergeBlocks() 406 InValPhi->getIncomingBlock(i)); in EliminateMostlyEmptyBlock() 412 PN->addIncoming(InVal, BBPN->getIncomingBlock(i)); in EliminateMostlyEmptyBlock() 489 UserBB = PN->getIncomingBlock(UI); in OptimizeNoopCopyExpression() 742 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) && in DupRetToEnableTailCallOpts()
|
D | JumpThreading.cpp | 372 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i))); in ComputeValueKnownInPredecessors() 375 PN->getIncomingBlock(i), BB); in ComputeValueKnownInPredecessors() 377 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i))); in ComputeValueKnownInPredecessors() 478 BasicBlock *PredBB = PN->getIncomingBlock(i); in ComputeValueKnownInPredecessors() 1175 BasicBlock *PredBB = PN->getIncomingBlock(i); in ProcessBranchOnPHI() 1418 if (UserPN->getIncomingBlock(UI) == BB) in ThreadEdge() 1572 if (UserPN->getIncomingBlock(UI) == BB) in DuplicateCondBranchOnPHIIntoPred()
|
D | IndVarSimplify.cpp | 201 BasicBlock *InsertBB = PHI->getIncomingBlock(i); in getInsertPointForUses() 244 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0)); in HandleFloatingPointIV() 400 PN->getIncomingBlock(IncomingEdge)); in HandleFloatingPointIV() 405 NewPHI->addIncoming(NewAdd, PN->getIncomingBlock(BackEdge)); in HandleFloatingPointIV() 525 if (LI->getLoopFor(PN->getIncomingBlock(i)) != L) in RewriteLoopExitValues() 1648 UseBB = P->getIncomingBlock(i); in SinkUnusedInvariants()
|
D | Sink.cpp | 89 UseBlock = PN->getIncomingBlock(Num); in AllUsesDominatedByBlock()
|
D | CorrelatedValuePropagation.cpp | 101 P->getIncomingBlock(i), in processPHI()
|
/external/llvm/lib/Analysis/ |
D | MemoryBuiltins.cpp | 723 Builder.SetInsertPoint(PHI.getIncomingBlock(i)->getFirstInsertionPt()); in visitPHINode() 733 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i)); in visitPHINode() 734 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i)); in visitPHINode()
|
D | ScalarEvolutionNormalization.cpp | 55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i))) in IVUseShouldUsePostIncValue()
|
D | IVUsers.cpp | 163 UseBB = PHI->getIncomingBlock(ValNo); in AddUsersImpl()
|
D | SparsePropagation.cpp | 259 if (!isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent(), true)) in visitPHINode()
|
/external/llvm/lib/CodeGen/ |
D | MachineSSAUpdater.cpp | 274 MachineBasicBlock *getIncomingBlock() { in getIncomingBlock() function in llvm::SSAUpdaterTraits::PHI_iterator
|