/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | FunctionLoweringInfo.cpp | 52 if (isa<PHINode>(I)) return true; 55 if (cast<Instruction>(U)->getParent() != BB || isa<PHINode>(U)) 250 const PHINode *PN = dyn_cast<PHINode>(I); ++I) { 401 void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) {
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | LoopInfo.h | 55 class PHINode; 390 PHINode *getCanonicalInductionVariable() const; 717 auto *UBB = isa<PHINode>(UI) ? cast<PHINode>(UI)->getIncomingBlock(U) 729 if (isa<PHINode>(Inst))
|
H A D | ScalarEvolution.h | 510 DenseMap<PHINode*, Constant*> ConstantEvolutionLoopExitValue; 565 const SCEV *createNodeForPHI(PHINode *PN); 568 const SCEV *createAddRecFromPHI(PHINode *PN); 571 const SCEV *createNodeFromSelectLikePHI(PHINode *PN); 730 Constant *getConstantEvolutionLoopExitValue(PHINode *PN, const APInt& BEs,
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | BasicAliasAnalysis.cpp | 512 if (const PHINode *PN = dyn_cast<PHINode>(V)) { 1191 AliasResult BasicAAResult::aliasPHI(const PHINode *PN, uint64_t PNSize, 1202 if (const PHINode *PN2 = dyn_cast<PHINode>(V2)) 1242 if (isa<PHINode>(PV1)) 1409 if (isa<PHINode>(V2) && !isa<PHINode>(V1)) { 1414 if (const PHINode *PN = dyn_cast<PHINode>(V [all...] |
H A D | InstructionSimplify.cpp | 104 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { 456 PHINode *PI; 457 if (isa<PHINode>(LHS)) { 458 PI = cast<PHINode>(LHS); 463 assert(isa<PHINode>(RHS) && "No PHI instruction operand!"); 464 PI = cast<PHINode>(RHS); 499 if (!isa<PHINode>(LHS)) { 503 assert(isa<PHINode>(LHS) && "Not comparing with a phi instruction!"); 504 PHINode *PI = cast<PHINode>(LH [all...] |
H A D | ScalarEvolution.cpp | 3604 if (!isa<PHINode>(I) || 3683 const SCEV *ScalarEvolution::createAddRecFromPHI(PHINode *PN) { 3901 static bool BrPHIToSelect(DominatorTree &DT, BranchInst *BI, PHINode *Merge, 3931 const SCEV *ScalarEvolution::createNodeFromSelectLikePHI(PHINode *PN) { 3968 const SCEV *ScalarEvolution::createNodeForPHI(PHINode *PN) { 4779 return createNodeForPHI(cast<PHINode>(U)); 4931 PHINode *PN = dyn_cast<PHINode>(I); ++I) 4959 isa<PHINode>(L->getHeader()->begin())) { 4990 if (!isa<PHINode>( [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopUnswitch.cpp | 895 if (!LoopExitBB || isa<PHINode>(LoopExitBB->begin())) 938 if (!LoopExitBB || isa<PHINode>(LoopExitBB->begin())) 1055 PHINode *PN = dyn_cast<PHINode>(I); ++I) { 1063 PHINode *PN = PHINode::Create(LPad->getType(), 0, "", 1251 PHINode *PN = dyn_cast<PHINode>(II); ++II) 1317 while (PHINode *PN = dyn_cast<PHINode>(Suc [all...] |
H A D | LoopRerollPass.cpp | 179 assert(isa<PHINode>(P) && "First reduction instruction must be a PHI"); 470 if (!isa<PHINode>(I)) 496 // (the initial PHINode has already been added). If successful, the object is 514 if (!(isa<PHINode>(Instructions.back()) || 545 if (!isa<PHINode>(I)) 585 if (PHINode *PN = dyn_cast<PHINode>(User)) { 658 PHINode *PN = dyn_cast<PHINode>(UU); 1130 // Note: This is specifically guarded by a check on isa<PHINode>, [all...] |
H A D | CorrelatedValuePropagation.cpp | 44 bool processPHI(PHINode *P); 104 bool CorrelatedValuePropagation::processPHI(PHINode *P) { 377 BBChanged |= processPHI(cast<PHINode>(II));
|
H A D | ConstantHoisting.cpp | 226 if (!isa<PHINode>(Inst) && !Inst->isEHPad()) 232 if (Idx != ~0U && isa<PHINode>(Inst)) 233 return cast<PHINode>(Inst)->getIncomingBlock(Idx)->getTerminator(); 446 if (auto PHI = dyn_cast<PHINode>(Inst)) {
|
H A D | LoopInstSimplify.cpp | 146 if (IsSubloopHeader && !isa<PHINode>(I))
|
H A D | LoopStrengthReduce.cpp | 733 PHINode *PN = dyn_cast<PHINode>(I); ++I) { 1128 if (const PHINode *PN = dyn_cast<PHINode>(UserInst)) { 1776 void RewriteForPHI(PHINode *PN, const LSRFixup &LF, 1842 PHINode *PH = dyn_cast<PHINode>(ShadowUse->getOperand(0)); 1889 /* Add new PHINode. */ 1890 PHINode *NewPH = PHINode [all...] |
H A D | ScalarReplAggregates.cpp | 107 SmallPtrSet<PHINode*, 8> CheckedPHIs; 1182 static bool isSafePHIToSpeculate(PHINode *PN) { 1285 if (PHINode *PN = dyn_cast<PHINode>(U)) { 1363 PHINode *PN = cast<PHINode>(InstsToRewrite[i]); 1370 PHINode *NewPN = PHINode::Create(LoadTy, PN->getNumIncomingValues(), 1652 } else if (isa<PHINode>(User) || isa<SelectInst>(User)) { 1674 if (PHINode *P [all...] |
H A D | PlaceSafepoints.cpp | 530 assert(!isa<PHINode>(ret->begin())); 718 assert(CS.isCall() || !isa<PHINode>(cast<Instruction>(GCResult)->getParent()->begin())); 931 assert(!isa<PHINode>(NormalDest->begin()));
|
H A D | LoopLoadElimination.cpp | 381 PHINode *PHI = PHINode::Create(Initial->getType(), 2, "store_forwarded",
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 348 typedef SmallVector<PHINode*, 4> PhiVector; 362 PHINode *createInductionVariable(Loop *L, Value *Start, Value *End, 387 /// Vectorize a single PHINode in a block. This method handles the induction 535 PHINode *Induction; 537 PHINode *OldInduction; 1198 typedef DenseMap<PHINode *, RecurrenceDescriptor> ReductionList; 1202 typedef MapVector<PHINode*, InductionDescriptor> InductionList; 1210 PHINode *getInduction() { return Induction; } 1225 bool isReductionVariable(PHINode *PN) { return Reductions.count(PN); } 1369 PHINode *Inductio [all...] |
H A D | SLPVectorizer.cpp | 1120 PHINode *PH = dyn_cast<PHINode>(VL0); 1126 cast<PHINode>(VL[j])->getIncomingValueForBlock(PH->getIncomingBlock(i))); 1142 Operands.push_back(cast<PHINode>(VL[j])->getIncomingValueForBlock( 2193 PHINode *PH = dyn_cast<PHINode>(VL0); 2196 PHINode *NewPhi = Builder.CreatePHI(VecTy, PH->getNumIncomingValues()); 2214 Operands.push_back(cast<PHINode>(V)->getIncomingValueForBlock(IBB)); 2590 if (PHINode *PH = dyn_cast<PHINode>(Use [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineVectorOps.cpp | 68 Instruction *InstCombiner::scalarizePHI(ExtractElementInst &EI, PHINode *PN) { 90 PHINode *scalarPHI = cast<PHINode>(InsertNewInstWith( 91 PHINode::Create(EI.getType(), PN->getNumIncomingValues(), ""), *PN)); 117 if (pos && !isa<PHINode>(pos)) { 177 if (PHINode *PN = dyn_cast<PHINode>(EI.getOperand(0))) { 384 BasicBlock *InsertionBlock = (ExtVecOpInst && !isa<PHINode>(ExtVecOpInst)) 407 if (ExtVecOpInst && !isa<PHINode>(ExtVecOpInst))
|
H A D | InstCombineLoadStoreAlloca.cpp | 606 if (PHINode *PN = dyn_cast<PHINode>(P)) { 1004 isa<PHINode>(A) || 1245 PHINode *PN = PHINode::Create(MergedVal->getType(), 2, "storemerge");
|
H A D | InstCombineShifts.cpp | 177 PHINode *PN = cast<PHINode>(I); 310 PHINode *PN = cast<PHINode>(I); 365 if (isa<PHINode>(Op0))
|
H A D | InstCombineCasts.cpp | 211 PHINode *OPN = cast<PHINode>(I); 212 PHINode *NPN = PHINode::Create(Ty, OPN->getNumIncomingValues()); 308 if (isa<PHINode>(Src)) { 419 PHINode *PN = cast<PHINode>(I); 815 PHINode *PN = cast<PHINode>(I); 1104 PHINode *P [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/PowerPC/ |
H A D | PPCLoopPreIncPrep.cpp | 332 PHINode *NewPHI = PHINode::Create(I8PtrTy, HeaderLoopPredCount, 395 else if (isa<PHINode>(PtrIP))
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | StackProtector.cpp | 170 } else if (const PHINode *PN = dyn_cast<PHINode>(U)) {
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64PromoteConstant.cpp | 336 if (PHINode *PhiInst = dyn_cast<PHINode>(User))
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | DataFlowSanitizer.cpp | 294 std::vector<std::pair<PHINode *, PHINode *> > PHIFixups; 344 void visitPHINode(PHINode &PN); 833 for (std::vector<std::pair<PHINode *, PHINode *> >::iterator 855 while (isa<PHINode>(Pos) || isa<AllocaInst>(Pos)) 1009 PHINode *Phi = PHINode::Create(DFS.ShadowTy, 2, "", &Tail->front()); 1156 PHINode *Shadow = PHINode [all...] |