| /external/llvm/lib/Transforms/Utils/ |
| DemoteRegToStack.cpp | 67 Value *&V = Loads[PN->getIncomingBlock(i)];
71 PN->getIncomingBlock(i)->getTerminator());
131 assert(II->getParent() != P->getIncomingBlock(i) &&
135 P->getIncomingBlock(i)->getTerminator());
|
| SSAUpdater.cpp | 81 if (ValueMapping[PHI->getIncomingBlock(i)] !=
131 BasicBlock *PredBB = SomePhi->getIncomingBlock(i);
210 V = GetValueAtEndOfBlock(UserPN->getIncomingBlock(U));
226 V = GetValueAtEndOfBlock(UserPN->getIncomingBlock(U));
251 BasicBlock *getIncomingBlock() { return PHI->getIncomingBlock(idx); }
284 Preds->push_back(SomePhi->getIncomingBlock(PI));
|
| LoopSimplify.cpp | 470 L->contains(PN->getIncomingBlock(i)))
542 !L->contains(PN->getIncomingBlock(i))) {
544 if (isa<IndirectBrInst>(PN->getIncomingBlock(i)->getTerminator()))
547 OuterLoopPreds.push_back(PN->getIncomingBlock(i));
681 BasicBlock *IBB = PN->getIncomingBlock(i);
700 PN->setIncomingBlock(0, PN->getIncomingBlock(PreheaderIdx));
|
| BreakCriticalEdges.cpp | 214 if (PN->getIncomingBlock(BBIdx) != TIBB)
259 if (PN->getIncomingBlock(i) != NewBB)
260 OtherPreds.push_back(PN->getIncomingBlock(i));
|
| CodeExtractor.cpp | 118 if (BlocksToExtract.count(PN->getIncomingBlock(i)))
155 if (BlocksToExtract.count(PN->getIncomingBlock(i))) {
156 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
173 if (BlocksToExtract.count(PN->getIncomingBlock(i))) {
174 NewPN->addIncoming(PN->getIncomingValue(i), PN->getIncomingBlock(i));
365 return P->getIncomingBlock(UI);
720 if (!BlocksToExtract.count(PN->getIncomingBlock(i)))
734 if (BlocksToExtract.count(PN->getIncomingBlock(i))) {
735 if (ProcessedPreds.insert(PN->getIncomingBlock(i)).second)
|
| LCSSA.cpp | 189 UserBB = PN->getIncomingBlock(UI);
259 UserBB = PN->getIncomingBlock(*UsesToRewrite[i]);
|
| ValueMapper.cpp | 176 Value *V = MapValue(PN->getIncomingBlock(i), VMap, Flags);
|
| SimplifyCFG.cpp | 136 BasicBlock *Pred1 = SomePHI->getIncomingBlock(0);
137 BasicBlock *Pred2 = SomePHI->getIncomingBlock(1);
[all...] |
| CloneFunction.cpp | 429 Value *V = VMap[PN->getIncomingBlock(pred)];
461 ++PredCount[PN->getIncomingBlock(i)];
|
| LoopUnroll.cpp | 52 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i));
|
| /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 | 626 NonConstBB = PN->getIncomingBlock(i);
668 BasicBlock *ThisBB = PN->getIncomingBlock(i);
691 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
702 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
714 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
[all...] |
| /external/llvm/lib/VMCore/ |
| BasicBlock.cpp | 241 BasicBlock *Other = APN->getIncomingBlock(APN->getIncomingBlock(0) == Pred);
|
| Instruction.cpp | 307 if (PN->getIncomingBlock(UI) != BB)
|
| /external/llvm/lib/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 237 Insn->getParent() != UPN->getIncomingBlock(I))
255 BBPreds.insert(BBPN->getIncomingBlock(i));
262 BasicBlock *Pred = DestBBPN->getIncomingBlock(i);
324 InValPhi->getIncomingBlock(i));
330 PN->addIncoming(InVal, BBPN->getIncomingBlock(i));
407 UserBB = PN->getIncomingBlock(UI);
640 if (CI && CI->hasOneUse() && CI->getParent() == PN->getIncomingBlock(I) &&
[all...] |
| Sink.cpp | 86 UseBlock = PN->getIncomingBlock(Num);
|
| JumpThreading.cpp | 367 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i)));
370 PN->getIncomingBlock(i), BB);
372 Result.push_back(std::make_pair(KC, PN->getIncomingBlock(i)));
473 BasicBlock *PredBB = PN->getIncomingBlock(i);
[all...] |
| CorrelatedValuePropagation.cpp | 99 P->getIncomingBlock(i),
|
| IndVarSimplify.cpp | 211 BasicBlock *InsertBB = PHI->getIncomingBlock(i);
254 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
410 PN->getIncomingBlock(IncomingEdge));
415 NewPHI->addIncoming(NewAdd, PN->getIncomingBlock(BackEdge));
540 if (LI->getLoopFor(PN->getIncomingBlock(i)) != L)
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 182 bool P0InLoop = contains(IV->getIncomingBlock(0));
184 BasicBlock *BackedgeBlock = IV->getIncomingBlock(!P0InLoop);
275 UserBB = P->getIncomingBlock(UI);
|
| ScalarEvolutionNormalization.cpp | 55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
|
| SparsePropagation.cpp | 259 if (!isEdgeFeasible(PN.getIncomingBlock(i), PN.getParent(), true))
|
| BasicAliasAnalysis.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| MachineSSAUpdater.cpp | 263 MachineBasicBlock *getIncomingBlock() {
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 401 BBInfo *PredInfo = BBMap[I.getIncomingBlock()];
|
