| /external/llvm/include/llvm/Transforms/Utils/ |
| SimplifyIndVar.h | 28 class PHINode;
42 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM,
|
| SSAUpdater.h | 26 class PHINode;
54 SmallVectorImpl<PHINode*> *InsertedPHIs;
59 explicit SSAUpdater(SmallVectorImpl<PHINode*> *InsertedPHIs = 0);
|
| /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(),
181 if (PHINode *UserPN = dyn_cast<PHINode>(User)
[all...] |
| Local.cpp | 376 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN,
451 if (!isa<PHINode>(BB->begin()))
460 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) {
482 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
554 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
555 PHINode *PN = cast<PHINode>(I);
557 // If the incoming value from BB is again a PHINode i
[all...] |
| LCSSA.cpp | 157 !isa<PHINode>(I->use_back())))
198 if (PHINode *PN = dyn_cast<PHINode>(U))
220 SmallVector<PHINode*, 16> AddedPHIs;
235 PHINode *PN = PHINode::Create(Inst->getType(),
268 if (PHINode *PN = dyn_cast<PHINode>(User))
271 if (isa<PHINode>(UserBB->begin()) &&
|
| BreakCriticalEdges.cpp | 102 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
108 if (const PHINode *VP = dyn_cast<PHINode>(V))
113 PHINode *NewPN =
114 PHINode::Create(PN->getType(), Preds.size(), "split",
177 for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
181 PHINode *PN = cast<PHINode>(I);
231 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
[all...] |
| DemoteRegToStack.cpp | 45 if (PHINode *PN = dyn_cast<PHINode>(U)) {
100 for (; isa<PHINode>(InsertPt) || isa<LandingPadInst>(InsertPt); ++InsertPt)
110 AllocaInst *llvm::DemotePHIToStack(PHINode *P, Instruction *AllocaPoint) {
140 for (; isa<PHINode>(InsertPt) || isa<LandingPadInst>(InsertPt); ++InsertPt)
|
| LoopUnroll.cpp | 50 if (PHINode *PN = dyn_cast<PHINode>(I)) {
250 std::vector<PHINode*> OrigPHINode;
251 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
252 OrigPHINode.push_back(cast<PHINode>(I));
282 PHINode *NewPHI = cast<PHINode>(VMap[OrigPHINode[i]]);
305 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) {
332 PHINode *PN = OrigPHINode[i]
[all...] |
| BasicBlockUtils.cpp | 69 if (!isa<PHINode>(BB->begin())) return;
78 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
103 PHINode *PN = dyn_cast<PHINode>(I); ++I)
108 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*()))
142 if (PHINode *PN = dyn_cast<PHINode>(BI)) {
151 if (isa<PHINode>(BB->front())
[all...] |
| BypassSlowDivision.cpp | 38 PHINode *Quotient;
39 PHINode *Remainder;
41 DivPhiNodes(PHINode *InQuotient, PHINode *InRemainder)
141 PHINode *QuoPhi = SuccessorBuilder.CreatePHI(Instr->getType(), 2);
144 PHINode *RemPhi = SuccessorBuilder.CreatePHI(Instr->getType(), 2);
|
| CloneFunction.cpp | 268 if (!isa<PHINode>(NewInst)) {
398 SmallVector<const PHINode*, 16> PHIToResolve;
411 if (const PHINode *PN = dyn_cast<PHINode>(I))
425 const PHINode *OPN = PHIToResolve[phino];
435 PHINode *PN = cast<PHINode>(VMap[OPN]);
457 PHINode *PN = cast<PHINode>(NewBB->begin());
475 for (; (PN = dyn_cast<PHINode>(I)); ++I)
[all...] |
| SimplifyCFG.cpp | 133 isa<PHINode>(BBI); ++BBI) {
134 PHINode *PN = cast<PHINode>(BBI);
151 SmallVectorImpl<PHINode*> &PhiNodes) {
174 isa<PHINode>(BBI); ++BBI) {
175 PHINode *PN = cast<PHINode>(BBI);
190 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
192 PHINode *PN;
194 (PN = dyn_cast<PHINode>(I)); ++I
[all...] |
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 133 // which is not a PHINode. If we have an invalid basic
136 while (isa<PHINode>(i)) ++i;
143 // which is not a PHINode. If we have an invalid basic
146 while (isa<PHINode>(i) || isa<DbgInfoIntrinsic>(i)) ++i;
152 // which is not a PHINode. If we have an invalid basic
157 if (isa<PHINode>(i) || isa<DbgInfoIntrinsic>(i))
223 PHINode *APN = dyn_cast<PHINode>(&front());
250 while (PHINode *PN = dyn_cast<PHINode>(&front()))
[all...] |
| Dominators.cpp | 120 if (isa<InvokeInst>(Def) || isa<PHINode>(User))
222 PHINode *PN = dyn_cast<PHINode>(UserInst);
246 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
278 if (isa<PHINode>(UserInst))
297 if (PHINode *PN = dyn_cast<PHINode>(I))
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 24 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
81 PHINode *NewLHS = 0, *NewRHS = 0;
83 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
91 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
130 Instruction *InstCombiner::FoldPHIArgGEPIntoPHI(PHINode &PN) {
201 SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size());
207 PHINode *NewPN = PHINode::Create(FirstOp->getType(), e,
225 if (PHINode *OpPhi = OperandPhis[op])
287 Instruction *InstCombiner::FoldPHIArgLoadIntoPHI(PHINode &PN)
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.h | 33 class PHINode;
58 bool relatedPHI(const PHINode *A, const Value *B);
|
| ProvenanceAnalysis.cpp | 47 bool ProvenanceAnalysis::relatedPHI(const PHINode *A,
52 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/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 74 bool isElse(PHINode *Phi);
76 void eraseIfUnused(PHINode *Phi);
167 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
185 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) {
206 if (PHINode *Phi = dyn_cast<PHINode>(Cond)) {
263 PHINode *Broken = PHINode::Create(Int64, 0, "", &Target->front());
313 PHINode *Phi = dyn_cast<PHINode>(Term->getCondition())
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpander.h | 70 std::set<AssertingVH<PHINode> > ChainedPhis;
121 PHINode *getOrInsertCanonicalInductionVariable(const Loop *L, Type *Ty);
188 void setChainedPhi(PHINode *PN) { ChainedPhis.insert(PN); }
257 bool isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
259 bool isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
262 PHINode *getAddRecExprPHILiterally(const SCEVAddRecExpr *Normalized,
266 Value *expandIVInc(PHINode *PN, Value *StepV, const Loop *L,
|
| SparsePropagation.h | 28 class PHINode;
77 virtual bool IsSpecialCasedPHI(PHINode *PN) {
199 void visitPHINode(PHINode &I);
|
| /external/llvm/lib/Transforms/Scalar/ |
| IndVarSimplify.cpp | 105 void HandleFloatingPointIV(Loop *L, PHINode *PH);
113 PHINode *IndVar, SCEVExpander &Rewriter);
192 PHINode *PHI = dyn_cast<PHINode>(User);
241 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
396 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
448 PHINode *PN = dyn_cast<PHINode>(I); ++I)
452 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i])
[all...] |
| Reg2Mem.cpp | 53 if (I->getParent() != BB || isa<PHINode>(I))
116 if (isa<PHINode>(iib))
123 DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
|
| /external/llvm/examples/BrainF/ |
| BrainF.h | 73 void readloop(PHINode *phi, BasicBlock *oldbb,
|
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 95 PHINode* OldPhi = dyn_cast<PHINode>(I);
98 PHINode* retPhi = PHINode::Create(OldPhi->getType(), 2, "", Ins);
|
| /external/llvm/lib/Analysis/ |
| IVUsers.cpp | 127 if (!isa<PHINode>(I) && !isSafeToSpeculativelyExecute(I, TD))
153 if (isa<PHINode>(User) && Processed.count(User))
160 if (PHINode *PHI = dyn_cast<PHINode>(User)) {
162 unsigned ValNo = PHINode::getIncomingValueNumForOperand(OperandNo);
176 if (isa<PHINode>(User) || Processed.count(User) ||
243 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I)
|
