| /external/llvm/lib/Transforms/Utils/ |
| SSAUpdater.cpp | 38 SSAUpdater::SSAUpdater(SmallVectorImpl<PHINode*> *NewPHI)
65 static bool IsEquivalentPHI(PHINode *PHI,
100 if (PHINode *SomePhi = dyn_cast<PHINode>(BB->begin())) {
138 if (isa<PHINode>(BB->begin())) {
141 PHINode *SomePHI;
143 (SomePHI = dyn_cast<PHINode>(It)); ++It) {
150 PHINode *InsertedPHI = PHINode::Create(ProtoType, PredValues.size(),
182 if (PHINode *UserPN = dyn_cast<PHINode>(User)
[all...] |
| BreakCriticalEdges.cpp | 93 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
99 if (const PHINode *VP = dyn_cast<PHINode>(V))
104 PHINode *NewPN = PHINode::Create(
166 for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
170 PHINode *PN = cast<PHINode>(I);
213 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
[all...] |
| LCSSA.cpp | 81 if (PHINode *PN = dyn_cast<PHINode>(User))
104 SmallVector<PHINode *, 16> AddedPHIs;
105 SmallVector<PHINode *, 8> PostProcessPHIs;
120 PHINode *PN = PHINode::Create(Inst.getType(), PredCache.size(ExitBB),
163 if (PHINode *PN = dyn_cast<PHINode>(User))
166 if (isa<PHINode>(UserBB->begin()) && isExitBlock(UserBB, ExitBlocks)) {
198 for (PHINode *PN : AddedPHIs
[all...] |
| DemoteRegToStack.cpp | 58 if (PHINode *PN = dyn_cast<PHINode>(U)) {
93 for (; isa<PHINode>(InsertPt) || InsertPt->isEHPad(); ++InsertPt)
107 AllocaInst *llvm::DemotePHIToStack(PHINode *P, Instruction *AllocaPoint) {
137 for (; isa<PHINode>(InsertPt) || InsertPt->isEHPad(); ++InsertPt)
|
| Local.cpp | 403 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN,
524 if (!isa<PHINode>(BB->begin()))
533 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) {
555 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
624 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
625 PHINode *PN = cast<PHINode>(I);
627 // If the incoming value from BB is again a PHINode i
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCBoolRetToInt.cpp | 82 if (PHINode *P = dyn_cast<PHINode>(V)) {
86 PHINode *Q =
87 PHINode::Create(Int32Ty, P->getNumIncomingValues(), P->getName(), P);
102 typedef SmallPtrSet<const PHINode *, 8> PHINodeSet;
104 // A PHINode is Promotable if:
106 // 2. All of its uses are ReturnInt, CallInst, PHINode, or DbgInfoIntrinsic
109 // CallInst or PHINode AND
110 // 4. All of its PHINode uses are Promotable AND
111 // 5. All of its PHINode operands are Promotabl
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 25 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
82 PHINode *NewLHS = nullptr, *NewRHS = nullptr;
84 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
92 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
131 Instruction *InstCombiner::FoldPHIArgGEPIntoPHI(PHINode &PN) {
202 SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size());
208 PHINode *NewPN = PHINode::Create(FirstOp->getType(), e,
226 if (PHINode *OpPhi = OperandPhis[op])
286 Instruction *InstCombiner::FoldPHIArgLoadIntoPHI(PHINode &PN)
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyIndVar.h | 29 class PHINode;
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
|
| SSAUpdater.h | 27 class PHINode;
55 SmallVectorImpl<PHINode*> *InsertedPHIs;
60 explicit SSAUpdater(SmallVectorImpl<PHINode*> *InsertedPHIs = nullptr);
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.h | 34 class PHINode;
59 bool relatedPHI(const PHINode *A, const Value *B);
|
| ProvenanceAnalysis.cpp | 48 bool ProvenanceAnalysis::relatedPHI(const PHINode *A,
54 if (const PHINode *PNB = dyn_cast<PHINode>(B))
150 if (const PHINode *PN = dyn_cast<PHINode>(A))
152 if (const PHINode *PN = dyn_cast<PHINode>(B))
|
| /external/llvm/unittests/Transforms/Utils/ |
| Local.cpp | 29 PHINode *phi = builder.CreatePHI(Type::getInt32Ty(C), 2);
75 AssertingVH<PHINode> P1 = B.CreatePHI(Type::getInt32Ty(C), 2);
78 PHINode *P2 = B.CreatePHI(Type::getInt32Ty(C), 2);
81 AssertingVH<PHINode> P3 = B.CreatePHI(Type::getInt32Ty(C), 2);
85 PHINode *P4 = B.CreatePHI(Type::getInt32Ty(C), 2);
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 167 if (!isa<PHINode>(I))
174 if (!isa<PHINode>(I) && !isa<DbgInfoIntrinsic>(I))
181 if (isa<PHINode>(I) || isa<DbgInfoIntrinsic>(I))
273 PHINode *APN = dyn_cast<PHINode>(&front());
300 while (PHINode *PN = dyn_cast<PHINode>(&front())) {
320 PHINode *PN;
321 for (iterator II = begin(); (PN = dyn_cast<PHINode>(II)); ) {
388 PHINode *PN
[all...] |
| Dominators.cpp | 98 if (isa<InvokeInst>(Def) || isa<PHINode>(User))
201 PHINode *PN = dyn_cast<PHINode>(UserInst);
224 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
256 if (isa<PHINode>(UserInst))
275 if (PHINode *PN = dyn_cast<PHINode>(I))
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInterchange.cpp | 302 static PHINode *getInductionVariable(Loop *L, ScalarEvolution *SE) {
303 PHINode *InnerIndexVar = L->getCanonicalInductionVariable();
308 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I) {
309 PHINode *PhiVar = cast<PHINode>(I);
343 bool isLoopStructureUnderstood(PHINode *InnerInductionVar);
355 SmallVector<PHINode *, 8> &Inductions,
356 SmallVector<PHINode *, 8> &Reductions);
544 if (isa<PHINode>(LoopNestExit->begin())) {
605 PHINode *UserIns = dyn_cast<PHINode>(U)
[all...] |
| IndVarSimplify.cpp | 129 void handleFloatingPointIV(Loop *L, PHINode *PH);
138 PHINode *IndVar, SCEVExpander &Rewriter);
220 PHINode *PHI = dyn_cast<PHINode>(User);
280 void IndVarSimplify::handleFloatingPointIV(Loop *L, PHINode *PN) {
433 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
485 PHINode *PN = dyn_cast<PHINode>(I); ++I)
489 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i])
[all...] |
| Reg2Mem.cpp | 53 if (UI->getParent() != BB || isa<PHINode>(UI))
115 if (isa<PHINode>(iib))
122 DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
|
| /external/llvm/include/llvm/CodeGen/ |
| StackProtector.h | 30 class PHINode;
76 SmallPtrSet<const PHINode *, 16> VisitedPHIs;
|
| /external/llvm/include/llvm/Transforms/Scalar/ |
| SROA.h | 91 SetVector<PHINode *, SmallVector<PHINode *, 2>> SpeculatablePHIs;
|
| /external/llvm/unittests/IR/ |
| UserTest.cpp | 72 PHINode &P = cast<PHINode>(ExitBB.front());
|
| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 78 bool isElse(PHINode *Phi);
80 void eraseIfUnused(PHINode *Phi);
86 Value *handleLoopCondition(Value *Cond, PHINode *Broken, llvm::Loop *L);
172 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
190 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) {
210 Value *SIAnnotateControlFlow::handleLoopCondition(Value *Cond, PHINode *Broken,
218 PHINode *Phi = nullptr;
219 if ((Phi = dyn_cast<PHINode>(Cond)) && L->contains(Phi)) {
222 PHINode *NewPhi = PHINode::Create(Int64, 0, "", &Parent->front())
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 70 std::set<AssertingVH<PHINode> > ChainedPhis;
134 PHINode *getOrInsertCanonicalInductionVariable(const Loop *L, Type *Ty);
215 void setChainedPhi(PHINode *PN) { ChainedPhis.insert(PN); }
296 bool isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
298 bool isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
301 PHINode *getAddRecExprPHILiterally(const SCEVAddRecExpr *Normalized,
307 Value *expandIVInc(PHINode *PN, Value *StepV, const Loop *L,
|
| SparsePropagation.h | 28 class PHINode;
77 virtual bool IsSpecialCasedPHI(PHINode *PN) { return false; }
195 void visitPHINode(PHINode &I);
|
| /external/llvm/examples/BrainF/ |
| BrainF.h | 73 void readloop(PHINode *phi, BasicBlock *oldbb,
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 96 PHINode* OldPhi = dyn_cast<PHINode>(I);
99 PHINode *retPhi = PHINode::Create(OldPhi->getType(), 2, "", Ins);
|
