| /external/clang/lib/CodeGen/ |
| CodeGenFunction.cpp | 227 llvm::PHINode *PN = cast<llvm::PHINode>(IndirectBranch->getAddress());
228 if (PN->getNumIncomingValues() == 0) {
229 PN->replaceAllUsesWith(llvm::UndefValue::get(PN->getType()));
230 PN->eraseFromParent();
[all...] |
| /external/grub/stage2/ |
| iso9660.h | 164 struct PN {
167 } pn; member in union:rock_ridge::__anon8240
|
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 657 PHINode *PN = Builder.CreatePHI(Type::getDoubleTy(getGlobalContext()), 2,
660 PN->addIncoming(ThenV, ThenBB);
661 PN->addIncoming(ElseV, ElseBB);
662 return PN;
|
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| toy.cpp | 753 PHINode *PN = Builder.CreatePHI(Type::getDoubleTy(getGlobalContext()), 2,
756 PN->addIncoming(ThenV, ThenBB);
757 PN->addIncoming(ElseV, ElseBB);
758 return PN;
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | [all...] |
| ValueTracking.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCasts.cpp | 422 PHINode *PN = cast<PHINode>(I);
423 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
424 if (!CanEvaluateTruncated(PN->getIncomingValue(i), Ty))
730 PHINode *PN = cast<PHINode>(I);
731 if (!CanEvaluateZExtd(PN->getIncomingValue(0), Ty, BitsToClear))
733 for (unsigned i = 1, e = PN->getNumIncomingValues(); i != e; ++i)
734 if (!CanEvaluateZExtd(PN->getIncomingValue(i), Ty, Tmp) ||
[all...] |
| InstructionCombining.cpp | 623 PHINode *PN = cast<PHINode>(I.getOperand(0));
624 unsigned NumPHIValues = PN->getNumIncomingValues();
631 if (!PN->hasOneUse()) {
633 for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end();
649 Value *InVal = PN->getIncomingValue(i);
656 NonConstBB = PN->getIncomingBlock(i);
681 PHINode *NewPN = PHINode::Create(I.getType(), PN->getNumIncomingValues());
682 InsertNewInstBefore(NewPN, *PN);
683 NewPN->takeName(PN);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 317 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
318 for (Value::const_use_iterator UI = PN->use_begin(), E = PN->use_end();
359 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
360 const Value *V1 = PN->getIncomingValueForBlock(Pred);
361 const Value *V2 = PN->getIncomingValueForBlock(BB);
405 PHINode *PN;
407 (PN = dyn_cast<PHINode>(BBI)); ++BBI) {
409 Value *InVal = PN->removeIncomingValue(BB, false);
417 PN->addIncoming(InValPhi->getIncomingValue(i)
[all...] |
| IndVarSimplify.cpp | 241 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
242 unsigned IncomingEdge = L->contains(PN->getIncomingBlock(0));
247 dyn_cast<ConstantFP>(PN->getIncomingValue(IncomingEdge));
253 // Check IV increment. Reject this PN if increment operation is not
256 dyn_cast<BinaryOperator>(PN->getIncomingValue(BackEdge));
263 if (IncValueVal == 0 || Incr->getOperand(0) != PN ||
267 // Check Incr uses. One user is PN and the other user is an exit condition
393 IntegerType *Int32Ty = Type::getInt32Ty(PN->getContext());
396 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
[all...] |
| JumpThreading.cpp | 128 bool ProcessBranchOnPHI(PHINode *PN);
377 if (PHINode *PN = dyn_cast<PHINode>(I)) {
378 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
379 Value *InVal = PN->getIncomingValue(i);
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)));
482 PHINode *PN = dyn_cast<PHINode>(Cmp->getOperand(0));
483 if (PN && PN->getParent() == BB)
[all...] |
| LoopUnswitch.cpp | [all...] |
| SCCP.cpp | 432 PHINode *PN;
434 (PN = dyn_cast<PHINode>(I)); ++I)
435 visitPHINode(*PN);
651 void SCCPSolver::visitPHINode(PHINode &PN) {
652 // If this PN returns a struct, just mark the result overdefined.
654 if (PN.getType()->isStructTy())
655 return markAnythingOverdefined(&PN);
657 if (getValueState(&PN).isOverdefined())
662 if (PN.getNumIncomingValues() > 64)
663 return markOverdefined(&PN);
[all...] |
| ScalarReplAggregates.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 601 PHINode *PN = I->second;
604 if (Value *V = SimplifyInstruction(PN, 0, 0, &DT)) {
605 if (AST && PN->getType()->isPointerTy())
606 AST->deleteValue(PN);
607 PN->replaceAllUsesWith(V);
608 PN->eraseFromParent();
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| BitcodeWriter.cpp | [all...] |
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| BitcodeWriter.cpp | [all...] |
| /frameworks/compile/slang/BitWriter_3_2/ |
| BitcodeWriter.cpp | [all...] |
| /external/llvm/lib/Bitcode/Writer/ |
| BitcodeWriter.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 316 PHINode *PN = dyn_cast<PHINode>(BB->begin());
317 if (PN == 0) continue;
324 for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I)
325 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
326 ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i));
332 BasicBlock *Pred = PN->getIncomingBlock(i);
[all...] |
| /external/llvm/lib/IR/ |
| Verifier.cpp | 266 void visitPHINode(PHINode &PN);
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | [all...] |
| /external/llvm/lib/Transforms/IPO/ |
| GlobalOpt.cpp | 268 } else if (const PHINode *PN = dyn_cast<PHINode>(I)) {
271 if (PHIUsers.insert(PN)) // Not already visited.
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | [all...] |
| /frameworks/compile/libbcc/bcinfo/BitReader_3_0/ |
| BitcodeReader.cpp | 210 PHINode *PN = cast<PHINode>(II);
211 int Idx = PN->getBasicBlockIndex(Invoke->getParent());
213 PN->setIncomingBlock(Idx, NewBB);
[all...] |
