| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 56 Value *&V = Loads[PN->getIncomingBlock(i)];
60 PN->getIncomingBlock(i)->getTerminator());
119 assert(II->getParent() != P->getIncomingBlock(i) &&
123 P->getIncomingBlock(i)->getTerminator());
|
| SSAUpdater.cpp | 81 if (ValueMapping[PHI->getIncomingBlock(i)] !=
131 BasicBlock *PredBB = SomePhi->getIncomingBlock(i);
213 V = GetValueAtEndOfBlock(UserPN->getIncomingBlock(U));
234 V = GetValueAtEndOfBlock(UserPN->getIncomingBlock(U));
270 BasicBlock *getIncomingBlock() { return PHI->getIncomingBlock(idx); }
287 Preds->push_back(SomePhi->getIncomingBlock(PI));
|
| LoopSimplify.cpp | 477 L->contains(PN->getIncomingBlock(i)))
558 !L->contains(PN->getIncomingBlock(i))) {
560 if (isa<IndirectBrInst>(PN->getIncomingBlock(i)->getTerminator()))
562 OuterLoopPreds.push_back(PN->getIncomingBlock(i));
698 BasicBlock *IBB = PN->getIncomingBlock(i);
717 PN->setIncomingBlock(0, PN->getIncomingBlock(PreheaderIdx));
|
| BreakCriticalEdges.cpp | 220 if (PN->getIncomingBlock(BBIdx) != TIBB)
265 if (PN->getIncomingBlock(i) != NewBB)
266 OtherPreds.push_back(PN->getIncomingBlock(i));
|
| CodeExtractor.cpp | 198 if (Blocks.count(PN->getIncomingBlock(i)))
235 if (Blocks.count(PN->getIncomingBlock(i))) {
236 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
253 if (Blocks.count(PN->getIncomingBlock(i))) {
254 NewPN->addIncoming(PN->getIncomingValue(i), PN->getIncomingBlock(i));
411 return P->getIncomingBlock(UI);
744 if (!Blocks.count(PN->getIncomingBlock(i)))
758 if (Blocks.count(PN->getIncomingBlock(i))) {
759 if (ProcessedPreds.insert(PN->getIncomingBlock(i)).second)
|
| LCSSA.cpp | 189 UserBB = PN->getIncomingBlock(UI);
259 UserBB = PN->getIncomingBlock(*UsesToRewrite[i]);
|
| Local.cpp | 521 BasicBlock *IBB = PN->getIncomingBlock(PI);
537 BasicBlock *IBB = PN->getIncomingBlock(PI);
586 if (PN->getIncomingBlock(UI) != BB)
621 OldValPN->getIncomingBlock(i));
[all...] |
| ValueMapper.cpp | 176 Value *V = MapValue(PN->getIncomingBlock(i), VMap, Flags);
|
| CloneFunction.cpp | 434 Value *V = VMap[PN->getIncomingBlock(pred)];
466 ++PredCount[PN->getIncomingBlock(i)];
|
| SimplifyCFG.cpp | 197 BasicBlock *Pred1 = SomePHI->getIncomingBlock(0);
198 BasicBlock *Pred2 = SomePHI->getIncomingBlock(1);
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 85 NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0));
93 NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0));
104 NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i));
108 NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i));
211 NewPN->addIncoming(FirstOp, PN.getIncomingBlock(0));
222 BasicBlock *InBB = PN.getIncomingBlock(i);
306 if (FirstLI->getParent() != PN.getIncomingBlock(0) ||
326 LI->getParent() != PN.getIncomingBlock(i) ||
353 NewPN->addIncoming(InVal, PN.getIncomingBlock(0));
360 NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i))
[all...] |
| InstructionCombining.cpp | 635 NonConstBB = PN->getIncomingBlock(i);
677 BasicBlock *ThisBB = PN->getIncomingBlock(i);
700 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
711 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
723 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
[all...] |
| /external/llvm/lib/VMCore/ |
| Dominators.cpp | 224 PN->getIncomingBlock(U) == BBE.getStart())
231 UseBB = PN->getIncomingBlock(U);
247 UseBB = PN->getIncomingBlock(U);
298 return isReachableFromEntry(PN->getIncomingBlock(U));
|
| BasicBlock.cpp | 241 BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred);
|
| Instruction.cpp | 232 if (thisPHI->getIncomingBlock(i) != otherPHI->getIncomingBlock(i))
322 if (PN->getIncomingBlock(UI) != BB)
|
| /external/llvm/lib/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 319 Insn->getParent() != UPN->getIncomingBlock(I))
337 BBPreds.insert(BBPN->getIncomingBlock(i));
344 BasicBlock *Pred = DestBBPN->getIncomingBlock(i);
406 InValPhi->getIncomingBlock(i));
412 PN->addIncoming(InVal, BBPN->getIncomingBlock(i));
489 UserBB = PN->getIncomingBlock(UI);
742 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) &&
[all...] |
| CorrelatedValuePropagation.cpp | 101 P->getIncomingBlock(i),
|
| Sink.cpp | 89 UseBlock = PN->getIncomingBlock(Num);
|
| JumpThreading.cpp | 372 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i)));
375 PN->getIncomingBlock(i), BB);
377 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i)));
478 BasicBlock *PredBB = PN->getIncomingBlock(i);
[all...] |
| IndVarSimplify.cpp | 201 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
244 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
400 PN->getIncomingBlock(IncomingEdge));
405 NewPHI->addIncoming(NewAdd, PN->getIncomingBlock(BackEdge));
525 if (LI->getLoopFor(PN->getIncomingBlock(i)) != L)
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionNormalization.cpp | 55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
|
| IVUsers.cpp | 163 UseBB = PHI->getIncomingBlock(ValNo);
|
| SparsePropagation.cpp | 259 if (!isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent(), true))
|
| MemoryBuiltins.cpp | 723 Builder.SetInsertPoint(PHI.getIncomingBlock(i)->getFirstInsertionPt());
733 SizePHI->addIncoming(EdgeData.first, PHI.getIncomingBlock(i));
734 OffsetPHI->addIncoming(EdgeData.second, PHI.getIncomingBlock(i));
|
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 274 MachineBasicBlock *getIncomingBlock() {
|
