| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 57 Value *&V = Loads[PN->getIncomingBlock(i)];
61 PN->getIncomingBlock(i)->getTerminator());
129 assert(II->getParent() != P->getIncomingBlock(i) &&
133 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 | 484 L->contains(PN->getIncomingBlock(i)))
565 !L->contains(PN->getIncomingBlock(i))) {
567 if (isa<IndirectBrInst>(PN->getIncomingBlock(i)->getTerminator()))
569 OuterLoopPreds.push_back(PN->getIncomingBlock(i));
705 BasicBlock *IBB = PN->getIncomingBlock(i);
724 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 | 199 if (Blocks.count(PN->getIncomingBlock(i)))
236 if (Blocks.count(PN->getIncomingBlock(i))) {
237 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
254 if (Blocks.count(PN->getIncomingBlock(i))) {
255 NewPN->addIncoming(PN->getIncomingValue(i), PN->getIncomingBlock(i));
412 return P->getIncomingBlock(UI);
745 if (!Blocks.count(PN->getIncomingBlock(i)))
759 if (Blocks.count(PN->getIncomingBlock(i))) {
760 if (ProcessedPreds.insert(PN->getIncomingBlock(i)).second)
|
| LCSSA.cpp | 199 UserBB = PN->getIncomingBlock(UI);
269 UserBB = PN->getIncomingBlock(*UsesToRewrite[i]);
|
| Local.cpp | 556 BasicBlock *IBB = PN->getIncomingBlock(PI);
572 BasicBlock *IBB = PN->getIncomingBlock(PI);
621 if (PN->getIncomingBlock(UI) != BB)
656 OldValPN->getIncomingBlock(i));
[all...] |
| ValueMapper.cpp | 191 Value *V = MapValue(PN->getIncomingBlock(i), VMap, Flags);
|
| CloneFunction.cpp | 436 Value *V = VMap[PN->getIncomingBlock(pred)];
468 ++PredCount[PN->getIncomingBlock(i)];
|
| /external/llvm/lib/IR/ |
| 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 | 322 if (thisPHI->getIncomingBlock(i) != otherPHI->getIncomingBlock(i))
412 if (PN->getIncomingBlock(UI) != BB)
|
| /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...] |
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 102 Value *V = LVI->getConstantOnEdge(Incoming, P->getIncomingBlock(i), BB);
116 P->getIncomingBlock(i), BB) !=
|
| Sink.cpp | 89 UseBlock = PN->getIncomingBlock(Num);
|
| CodeGenPrepare.cpp | 331 Insn->getParent() != UPN->getIncomingBlock(I))
349 BBPreds.insert(BBPN->getIncomingBlock(i));
356 BasicBlock *Pred = DestBBPN->getIncomingBlock(i);
418 InValPhi->getIncomingBlock(i));
424 PN->addIncoming(InVal, BBPN->getIncomingBlock(i));
501 UserBB = PN->getIncomingBlock(UI);
761 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) &&
[all...] |
| JumpThreading.cpp | 381 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i)));
384 PN->getIncomingBlock(i), BB);
386 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i)));
487 BasicBlock *PredBB = PN->getIncomingBlock(i);
[all...] |
| IndVarSimplify.cpp | 201 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
242 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
398 PN->getIncomingBlock(IncomingEdge));
403 NewPHI->addIncoming(NewAdd, PN->getIncomingBlock(BackEdge));
523 if (LI->getLoopFor(PN->getIncomingBlock(i)) != L)
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 56 PNB->getIncomingValueForBlock(A->getIncomingBlock(i))))
|
| ObjCARCContract.cpp | 489 BasicBlock *BB = PHI->getIncomingBlock(ValNo);
497 if (PHI->getIncomingBlock(i) == BB) {
|
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 168 if (Phi->getIncomingBlock(i) == IDom) {
225 BasicBlock *From = Phi->getIncomingBlock(i);
|
| /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))
|
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 273 MachineBasicBlock *getIncomingBlock() {
|
