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

1 2 3 4 5 6 7 8

  /external/llvm/include/llvm/Transforms/Utils/
SimplifyIndVar.h 29 class PHINode;
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM,
SSAUpdater.h 26 class PHINode;
54 SmallVectorImpl<PHINode*> *InsertedPHIs;
59 explicit SSAUpdater(SmallVectorImpl<PHINode*> *InsertedPHIs = nullptr);
  /external/llvm/lib/Transforms/Utils/
SSAUpdater.cpp 37 SSAUpdater::SSAUpdater(SmallVectorImpl<PHINode*> *NewPHI)
64 static bool IsEquivalentPHI(PHINode *PHI,
99 if (PHINode *SomePhi = dyn_cast<PHINode>(BB->begin())) {
137 if (isa<PHINode>(BB->begin())) {
140 PHINode *SomePHI;
142 (SomePHI = dyn_cast<PHINode>(It)); ++It) {
149 PHINode *InsertedPHI = PHINode::Create(ProtoType, PredValues.size(),
180 if (PHINode *UserPN = dyn_cast<PHINode>(User)
    [all...]
BreakCriticalEdges.cpp 101 PHINode *PN = dyn_cast<PHINode>(I); ++I) {
107 if (const PHINode *VP = dyn_cast<PHINode>(V))
112 PHINode *NewPN =
113 PHINode::Create(PN->getType(), Preds.size(), "split",
176 for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
180 PHINode *PN = cast<PHINode>(I);
231 if (PHINode *PN = dyn_cast<PHINode>(DestBB->begin()))
    [all...]
LCSSA.cpp 72 if (PHINode *PN = dyn_cast<PHINode>(User))
96 SmallVector<PHINode *, 16> AddedPHIs;
114 PHINode *PN = PHINode::Create(Inst.getType(), PredCache.GetNumPreds(ExitBB),
145 if (PHINode *PN = dyn_cast<PHINode>(User))
148 if (isa<PHINode>(UserBB->begin()) && isExitBlock(UserBB, ExitBlocks)) {
212 !isa<PHINode>(I->user_back())))
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)
Local.cpp 377 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN,
452 if (!isa<PHINode>(BB->begin()))
461 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) {
483 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
551 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
552 PHINode *PN = cast<PHINode>(I);
554 // If the incoming value from BB is again a PHINode i
    [all...]
LoopUnroll.cpp 56 if (PHINode *PN = dyn_cast<PHINode>(I)) {
273 std::vector<PHINode*> OrigPHINode;
274 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
275 OrigPHINode.push_back(cast<PHINode>(I));
305 PHINode *NewPHI = cast<PHINode>(VMap[OrigPHINode[i]]);
328 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) {
355 PHINode *PN = OrigPHINode[i]
    [all...]
GlobalStatus.cpp 48 SmallPtrSet<const PHINode *, 16> &PhiUsers) {
130 } else if (const PHINode *PN = dyn_cast<PHINode>(I)) {
173 SmallPtrSet<const PHINode *, 16> PhiUsers;
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...]
  /external/llvm/lib/IR/
BasicBlock.cpp 137 // which is not a PHINode. If we have an invalid basic
140 while (isa<PHINode>(i)) ++i;
147 // which is not a PHINode. If we have an invalid basic
150 while (isa<PHINode>(i) || isa<DbgInfoIntrinsic>(i)) ++i;
156 // which is not a PHINode. If we have an invalid basic
161 if (isa<PHINode>(i) || isa<DbgInfoIntrinsic>(i))
227 PHINode *APN = dyn_cast<PHINode>(&front());
254 while (PHINode *PN = dyn_cast<PHINode>(&front()))
    [all...]
Dominators.cpp 101 if (isa<InvokeInst>(Def) || isa<PHINode>(User))
202 PHINode *PN = dyn_cast<PHINode>(UserInst);
225 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
257 if (isa<PHINode>(UserInst))
276 if (PHINode *PN = dyn_cast<PHINode>(I))
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 26 Instruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) {
83 PHINode *NewLHS = nullptr, *NewRHS = nullptr;
85 NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(),
93 NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(),
132 Instruction *InstCombiner::FoldPHIArgGEPIntoPHI(PHINode &PN) {
203 SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size());
209 PHINode *NewPN = PHINode::Create(FirstOp->getType(), e,
227 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))
149 if (const PHINode *PN = dyn_cast<PHINode>(A))
151 if (const PHINode *PN = dyn_cast<PHINode>(B))
  /external/llvm/lib/Target/R600/
SIAnnotateControlFlow.cpp 75 bool isElse(PHINode *Phi);
77 void eraseIfUnused(PHINode *Phi);
83 Value *handleLoopCondition(Value *Cond, PHINode *Broken);
168 bool SIAnnotateControlFlow::isElse(PHINode *Phi) {
186 void SIAnnotateControlFlow::eraseIfUnused(PHINode *Phi) {
206 Value *SIAnnotateControlFlow::handleLoopCondition(Value *Cond, PHINode *Broken) {
207 if (PHINode *Phi = dyn_cast<PHINode>(Cond)) {
209 PHINode *NewPhi = PHINode::Create(Int64, 0, "", &Parent->front())
    [all...]
  /external/llvm/include/llvm/CodeGen/
StackProtector.h 30 class PHINode;
76 SmallPtrSet<const PHINode *, 16> VisitedPHIs;
  /external/llvm/unittests/IR/
UserTest.cpp 72 PHINode &P = cast<PHINode>(ExitBB.front());
  /external/llvm/lib/Transforms/Scalar/
IndVarSimplify.cpp 109 void HandleFloatingPointIV(Loop *L, PHINode *PH);
117 PHINode *IndVar, SCEVExpander &Rewriter);
196 PHINode *PHI = dyn_cast<PHINode>(User);
245 void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PN) {
400 PHINode *NewPHI = PHINode::Create(Int32Ty, 2, PN->getName()+".int", PN);
452 PHINode *PN = dyn_cast<PHINode>(I); ++I)
456 if (PHINode *PN = dyn_cast_or_null<PHINode>(&*PHIs[i])
    [all...]
Reg2Mem.cpp 53 if (UI->getParent() != BB || isa<PHINode>(UI))
116 if (isa<PHINode>(iib))
123 DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
SimplifyCFGPass.cpp 95 (!isa<PHINode>(I) || I != BB.begin() ||
122 PHINode *RetBlockPHI = dyn_cast<PHINode>(RetBlock->begin());
126 RetBlockPHI = PHINode::Create(Ret->getOperand(0)->getType(),
  /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); }
255 bool isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
257 bool isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, const Loop *L);
260 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/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);

Completed in 1176 milliseconds

1 2 3 4 5 6 7 8