| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 128 bool ProcessBranchOnPHI(PHINode *PN);
368 if (PHINode *PN = dyn_cast<PHINode>(I)) {
369 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
370 Value *InVal = PN->getIncomingValue(i);
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)));
473 PHINode *PN = dyn_cast<PHINode>(Cmp->getOperand(0));
474 if (PN && PN->getParent() == BB)
[all...] |
| TailRecursionElimination.cpp | 203 PHINode *PN = ArgumentPHIs[i];
206 if (Value *PNV = SimplifyInstruction(PN)) {
207 PN->replaceAllUsesWith(PNV);
208 PN->eraseFromParent();
500 PHINode *PN = PHINode::Create(I->getType(), 2,
502 I->replaceAllUsesWith(PN); // Everyone use the PHI node now!
503 PN->addIncoming(I, NewEntry);
504 ArgumentPHIs.push_back(PN);
|
| ScalarReplAggregates.cpp | [all...] |
| LoopUnswitch.cpp | [all...] |
| SCCP.cpp | 439 PHINode *PN;
441 (PN = dyn_cast<PHINode>(I)); ++I)
442 visitPHINode(*PN);
658 void SCCPSolver::visitPHINode(PHINode &PN) {
659 // If this PN returns a struct, just mark the result overdefined.
661 if (PN.getType()->isStructTy())
662 return markAnythingOverdefined(&PN);
664 if (getValueState(&PN).isOverdefined())
669 if (PN.getNumIncomingValues() > 64)
670 return markOverdefined(&PN);
[all...] |
| Sink.cpp | 85 if (PHINode *PN = dyn_cast<PHINode>(UseInst)) {
89 UseBlock = PN->getIncomingBlock(Num);
|
| /external/llvm/lib/CodeGen/ |
| DwarfEHPrepare.cpp | 154 PHINode *PN = PHINode::Create(Type::getInt8PtrTy(Ctx), ResumesSize,
166 PN->addIncoming(ExnObj, Parent);
172 CallInst *CI = CallInst::Create(RewindFunction, PN, "", UnwindBB);
|
| SjLjEHPrepare.cpp | 325 PHINode *PN = cast<PHINode>(U);
326 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
327 if (PN->getIncomingValue(i) == Inst)
328 MarkBlocksLiveIn(PN->getIncomingBlock(i), LiveBBs);
364 PN = UnwindBlock->begin(); isa<PHINode>(PN); ++PN)
365 PHIsToDemote.insert(cast<PHINode>(PN));
|
| UnreachableBlockElim.cpp | 80 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
81 PN->replaceAllUsesWith(Constant::getNullValue(PN->getType()));
|
| /external/llvm/include/llvm/CodeGen/ |
| FunctionLoweringInfo.h | 189 void InvalidatePHILiveOutRegInfo(const PHINode *PN) {
191 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN);
|
| /external/llvm/lib/Transforms/Utils/ |
| ValueMapper.cpp | 174 if (PHINode *PN = dyn_cast<PHINode>(I)) {
175 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
176 Value *V = MapValue(PN->getIncomingBlock(i), VMap, Flags);
179 PN->setIncomingBlock(i, cast<BasicBlock>(V));
|
| LowerInvoke.cpp | 213 while (PHINode *PN = dyn_cast<PHINode>(II->getUnwindDest()->begin())) {
214 PN->replaceAllUsesWith(PN->getIncomingValue(0));
215 PN->eraseFromParent();
365 PHINode *PN = cast<PHINode>(U);
366 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
367 if (PN->getIncomingValue(i) == Inst)
368 MarkBlocksLiveIn(PN->getIncomingBlock(i), LiveBBs);
|
| PromoteMemoryToRegister.cpp | 593 PHINode *PN = I->second;
596 if (Value *V = SimplifyInstruction(PN, 0, 0, &DT)) {
597 if (AST && PN->getType()->isPointerTy())
598 AST->deleteValue(PN);
599 PN->replaceAllUsesWith(V);
600 PN->eraseFromParent();
[all...] |
| /external/llvm/lib/Analysis/ |
| BasicAliasAnalysis.cpp | 509 AliasResult aliasPHI(const PHINode *PN, uint64_t PNSize,
584 if (const PHINode *PN = dyn_cast<PHINode>(V)) {
586 if (PN->getNumIncomingValues() > MaxLookup) {
590 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
591 Worklist.push_back(PN->getIncomingValue(i));
[all...] |
| DominanceFrontier.cpp | 29 const DomTreeNode *PN)
30 : currentBB(B), parentBB(P), Node(N), parentNode(PN) {}
|
| LoopInfo.cpp | 159 PHINode *PN = cast<PHINode>(I);
161 dyn_cast<ConstantInt>(PN->getIncomingValueForBlock(Incoming)))
164 dyn_cast<Instruction>(PN->getIncomingValueForBlock(Backedge)))
166 Inc->getOperand(0) == PN)
169 return PN;
|
| ScalarEvolution.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombine.h | 186 Instruction *SliceUpIllegalIntegerPHI(PHINode &PN);
187 Instruction *visitPHINode(PHINode &PN);
347 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN);
348 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN);
349 Instruction *FoldPHIArgGEPIntoPHI(PHINode &PN);
350 Instruction *FoldPHIArgLoadIntoPHI(PHINode &PN);
|
| InstructionCombining.cpp | 602 PHINode *PN = cast<PHINode>(I.getOperand(0));
603 unsigned NumPHIValues = PN->getNumIncomingValues();
610 if (!PN->hasOneUse()) {
612 for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end();
628 Value *InVal = PN->getIncomingValue(i);
635 NonConstBB = PN->getIncomingBlock(i);
660 PHINode *NewPN = PHINode::Create(I.getType(), PN->getNumIncomingValues());
661 InsertNewInstBefore(NewPN, *PN);
662 NewPN->takeName(PN);
[all...] |
| InstCombineShifts.cpp | 172 PHINode *PN = cast<PHINode>(I);
173 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
174 if (!CanEvaluateShifted(PN->getIncomingValue(i), NumBits, isLeftShift,IC))
301 PHINode *PN = cast<PHINode>(I);
302 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
303 PN->setIncomingValue(i, GetShiftedValue(PN->getIncomingValue(i),
305 return PN;
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| GlobalOpt.cpp | 263 } else if (const PHINode *PN = dyn_cast<PHINode>(I)) {
266 if (PHIUsers.insert(PN)) // Not already visited.
[all...] |
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXUtilities.cpp | 385 } else if (const PHINode *PN = dyn_cast<PHINode>(V)) {
388 processed.insert(PN);
390 for (unsigned i = 0; i != PN->getNumIncomingValues(); ++i) {
391 const Value *pv = PN->getIncomingValue(i);
397 return PN;
401 return PN;
|
| /external/llvm/lib/VMCore/ |
| Verifier.cpp | 262 void visitPHINode(PHINode &PN);
734 PHINode *PN;
735 for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
737 Assert1(PN->getNumIncomingValues() != 0,
739 "the PHI should be removed!", PN);
740 Assert1(PN->getNumIncomingValues() == Preds.size(),
742 "parent basic block!", PN);
746 Values.reserve(PN->getNumIncomingValues());
747 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
748 Values.push_back(std::make_pair(PN->getIncomingBlock(i)
[all...] |
| Value.cpp | 462 PHINode *PN = dyn_cast<PHINode>(this);
463 if (PN && PN->getParent() == CurBB)
464 return PN->getIncomingValueForBlock(PredBB);
|
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 77 virtual bool IsSpecialCasedPHI(PHINode *PN) {
|
