HomeSort by relevance Sort by last modified time
    Searched refs:PHINode (Results 1 - 25 of 131) sorted by null

1 2 3 4 5 6

  /external/llvm/lib/Transforms/Utils/
SSAUpdater.cpp 38 SSAUpdater::SSAUpdater(SmallVectorImpl<PHINode*> *NewPHI)
73 static bool IsEquivalentPHI(PHINode *PHI,
129 if (PHINode *SomePhi = dyn_cast<PHINode>(BB->begin())) {
167 if (isa<PHINode>(BB->begin())) {
170 PHINode *SomePHI;
172 (SomePHI = dyn_cast<PHINode>(It)); ++It) {
179 PHINode *InsertedPHI = PHINode::Create(ProtoType, PredValues.size(),
209 if (PHINode *UserPN = dyn_cast<PHINode>(User)
    [all...]
DemoteRegToStack.cpp 54 if (PHINode *PN = dyn_cast<PHINode>(U)) {
100 for (; isa<PHINode>(InsertPt); ++InsertPt)
111 AllocaInst* llvm::DemotePHIToStack(PHINode *P, Instruction *AllocaPoint) {
LCSSA.cpp 153 !isa<PHINode>(I->use_back())))
188 if (PHINode *PN = dyn_cast<PHINode>(U))
210 SmallVector<PHINode*, 16> AddedPHIs;
225 PHINode *PN = PHINode::Create(Inst->getType(),
258 if (PHINode *PN = dyn_cast<PHINode>(User))
261 if (isa<PHINode>(UserBB->begin()) &&
Local.cpp 323 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN) {
391 if (!isa<PHINode>(BB->begin()))
400 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) {
428 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
507 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
508 PHINode *PN = cast<PHINode>(I);
510 // If the incoming value from BB is again a PHINode i
    [all...]
BasicBlockUtils.cpp 68 if (!isa<PHINode>(BB->begin())) return;
77 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
102 PHINode *PN = dyn_cast<PHINode>(I); ++I)
107 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*()))
141 if (PHINode *PN = dyn_cast<PHINode>(BI)) {
150 if (isa<PHINode>(BB->front())
    [all...]
BreakCriticalEdges.cpp 134 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
139 if (const PHINode *VP = dyn_cast<PHINode>(V))
143 PHINode *NewPN = PHINode::Create(PN->getType(), Preds.size(), "split",
203 for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
207 PHINode *PN = cast<PHINode>(I);
257 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
    [all...]
InlineFunction.cpp 220 PHINode *phi = dyn_cast<PHINode>(i);
223 PHINode *splitPhi = PHINode::Create(phi->getType(), 2, phi->getName(),
232 PHINode *exnPhi = PHINode::Create(exn->getType(), 2, "", splitIP);
238 PHINode *selectorPhi = PHINode::Create(selector->getType(), 2, "", splitIP);
252 PHINode *InnerExceptionPHI;
253 PHINode *InnerSelectorPHI
    [all...]
LoopUnroll.cpp 50 if (PHINode *PN = dyn_cast<PHINode>(I)) {
224 std::vector<PHINode*> OrigPHINode;
225 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
226 OrigPHINode.push_back(cast<PHINode>(I));
256 PHINode *NewPHI = cast<PHINode>(VMap[OrigPHINode[i]]);
279 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) {
306 PHINode *PN = OrigPHINode[i]
    [all...]
CloneFunction.cpp 380 SmallVector<const PHINode*, 16> PHIToResolve;
401 if (PHINode *PN = dyn_cast<PHINode>(I)) {
404 for (; (PN = dyn_cast<PHINode>(I)); ++I, ++OldI)
405 PHIToResolve.push_back(cast<PHINode>(OldI));
417 const PHINode *OPN = PHIToResolve[phino];
427 PHINode *PN = cast<PHINode>(VMap[OPN]);
449 PHINode *PN = cast<PHINode>(NewBB->begin())
    [all...]
  /external/llvm/lib/VMCore/
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 97 if (isa<PHINode>(A) && isa<PHINode>(B))
  /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/include/llvm/Transforms/Utils/
Local.h 30 class PHINode;
71 bool RecursivelyDeleteDeadPHINode(PHINode *PN);
149 AllocaInst *DemotePHIToStack(PHINode *P, Instruction *AllocaPoint = 0);
SSAUpdater.h 21 class PHINode;
49 SmallVectorImpl<PHINode*> *InsertedPHIs;
54 explicit SSAUpdater(SmallVectorImpl<PHINode*> *InsertedPHIs = 0);
SimplifyIndVar.h 42 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM,
  /external/llvm/lib/Transforms/Scalar/
Sink.cpp 82 if (PHINode *PN = dyn_cast<PHINode>(UseInst)) {
85 unsigned Num = PHINode::getIncomingValueNumForOperand(I.getOperandNo());
170 if (isa<TerminatorInst>(Inst) || isa<PHINode>(Inst))
267 while (InsertPos != SuccToSinkTo->end() && isa<PHINode>(InsertPos))
CodeGenPrepare.cpp 196 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI))
223 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
227 if (User->getParent() != DestBB || !isa<PHINode>(User))
229 // If User is inside DestBB block and it is a PHINode then check
233 if (const PHINode *UPN = dyn_cast<PHINode>(User))
247 const PHINode *DestBBPN = dyn_cast<PHINode>(DestBB->begin());
252 if (const PHINode *BBPN = dyn_cast<PHINode>(BB->begin()))
    [all...]
IndVarSimplify.cpp 117 void HandleFloatingPointIV(Loop *L, PHINode *PH);
127 PHINode *IndVar, SCEVExpander &Rewriter);
202 PHINode *PHI = dyn_cast<PHINode>(User);
253 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
408 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
465 PHINode *PN = dyn_cast<PHINode>(I); ++I)
469 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i])
    [all...]
LoopRotation.cpp 93 for (I = OrigHeader->begin(); PHINode *PN = dyn_cast<PHINode>(I); ++I)
127 if (!isa<PHINode>(UserInst)) {
222 for (; PHINode *PN = dyn_cast<PHINode>(I); ++I)
274 PHINode *PN = dyn_cast<PHINode>(BI); ++BI)
Reg2Mem.cpp 53 if (I->getParent() != BB || isa<PHINode>(I))
116 if (isa<PHINode>(iib))
123 DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
TailRecursionElimination.cpp 95 SmallVector<PHINode*, 8> &ArgumentPHIs,
100 SmallVector<PHINode*, 8> &ArgumentPHIs,
104 SmallVector<PHINode*, 8> &ArgumentPHIs,
156 SmallVector<PHINode*, 8> ArgumentPHIs;
203 PHINode *PN = ArgumentPHIs[i];
413 SmallVector<PHINode*, 8> &ArgumentPHIs,
500 PHINode *PN = PHINode::Create(I->getType(), 2,
532 PHINode *AccPN =
533 PHINode::Create(AccumulatorRecursionEliminationInitVal->getType()
    [all...]
  /external/llvm/include/llvm/Analysis/
SparsePropagation.h 28 class PHINode;
77 virtual bool IsSpecialCasedPHI(PHINode *PN) {
199 void visitPHINode(PHINode &I);
ScalarEvolutionExpander.h 109 PHINode *getOrInsertCanonicalInductionVariable(const Loop *L, Type *Ty);
238 bool isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
240 bool isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
243 PHINode *getAddRecExprPHILiterally(const SCEVAddRecExpr *Normalized,
  /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);

Completed in 1589 milliseconds

1 2 3 4 5 6