Searched refs:PHINode (Results 1 - 25 of 180) sorted by relevance

12345678

/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DSSAUpdater.cpp38 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 *UserP
[all...]
H A DBreakCriticalEdges.cpp93 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 *P
[all...]
H A DLCSSA.cpp81 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 *P
[all...]
H A DDemoteRegToStack.cpp58 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)
H A DUnifyFunctionExitNodes.cpp93 PHINode *PN = nullptr;
98 PN = PHINode::Create(F.getReturnType(), ReturningBlocks.size(),
H A DBasicBlockUtils.cpp70 if (!isa<PHINode>(BB->begin())) return;
72 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
95 PHINode *PN = dyn_cast<PHINode>(I); ++I)
100 if (PHINode *PN = dyn_cast_or_null<PHINode>(PHIs[i].operator Value*()))
137 if (PHINode *PN = dyn_cast<PHINode>(BI)) {
146 if (isa<PHINode>(B
[all...]
H A DBypassSlowDivision.cpp39 PHINode *Quotient;
40 PHINode *Remainder;
42 DivPhiNodes(PHINode *InQuotient, PHINode *InRemainder)
137 PHINode *QuoPhi = SuccessorBuilder.CreatePHI(I->getType(), 2);
140 PHINode *RemPhi = SuccessorBuilder.CreatePHI(I->getType(), 2);
H A DSimplifyCFG.cpp115 typedef SmallVector<std::pair<PHINode *, Constant *>, 4> SwitchCaseResultsTy;
181 isa<PHINode>(BBI); ++BBI) {
182 PHINode *PN = cast<PHINode>(BBI);
197 SmallVectorImpl<PHINode*> &PhiNodes) {
220 isa<PHINode>(BBI); ++BBI) {
221 PHINode *PN = cast<PHINode>(BBI);
236 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
238 PHINode *P
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/PowerPC/
H A DPPCBoolRetToInt.cpp82 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 operand
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp25 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
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Utils/
H A DSimplifyIndVar.h29 class PHINode;
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
H A DSSAUpdater.h27 class PHINode;
55 SmallVectorImpl<PHINode*> *InsertedPHIs;
60 explicit SSAUpdater(SmallVectorImpl<PHINode*> *InsertedPHIs = nullptr);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.h34 class PHINode;
59 bool relatedPHI(const PHINode *A, const Value *B);
H A DProvenanceAnalysis.cpp48 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))
/freebsd-11.0-release/contrib/llvm/lib/IR/
H A DBasicBlock.cpp167 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 *P
[all...]
H A DDominators.cpp98 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))
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp302 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 *UserIn
[all...]
H A DIndVarSimplify.cpp129 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 *P
[all...]
H A DReg2Mem.cpp53 if (UI->getParent() != BB || isa<PHINode>(UI))
115 if (isa<PHINode>(iib))
122 DemotePHIToStack(cast<PHINode>(*ilb), AllocaInsertionPoint);
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Scalar/
H A DSROA.h91 SetVector<PHINode *, SmallVector<PHINode *, 2>> SpeculatablePHIs;
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DStackProtector.h30 class PHINode;
76 SmallPtrSet<const PHINode *, 16> VisitedPHIs;
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/
H A DSIAnnotateControlFlow.cpp78 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
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DScalarEvolutionExpander.h70 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,
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp96 PHINode* OldPhi = dyn_cast<PHINode>(I);
99 PHINode *retPhi = PHINode::Create(OldPhi->getType(), 2, "", Ins);
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DIVUsers.cpp133 if (!isa<PHINode>(I) && !isSafeToSpeculativelyExecute(I))
163 if (isa<PHINode>(User) && Processed.count(User))
170 if (PHINode *PHI = dyn_cast<PHINode>(User)) {
172 unsigned ValNo = PHINode::getIncomingValueNumForOperand(OperandNo);
186 if (isa<PHINode>(User) || Processed.count(User) ||
278 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I)

Completed in 173 milliseconds

12345678