Searched refs:PHINode (Results 51 - 75 of 180) sorted by relevance

12345678

/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLICM.cpp98 CloneInstructionInExitBlock(Instruction &I, BasicBlock &ExitBlock, PHINode &PN,
526 /// Returns true if a PHINode is a trivially replaceable with an
531 static bool isTriviallyReplacablePHI(const PHINode &PN, const Instruction &I) {
548 if (const PHINode *PN = dyn_cast<PHINode>(UI)) {
589 CloneInstructionInExitBlock(Instruction &I, BasicBlock &ExitBlock, PHINode &PN,
638 PHINode *OpPN =
639 PHINode::Create(OInst->getType(), PN.getNumIncomingValues(),
684 PHINode *PN = cast<PHINode>(Use
[all...]
H A DMergedLoadStoreMotion.cpp149 PHINode *getPHIOperand(BasicBlock *BB, StoreInst *S0, StoreInst *S1);
439 PHINode *MergedLoadStoreMotion::getPHIOperand(BasicBlock *BB, StoreInst *S0,
442 PHINode *NewPN = nullptr;
446 NewPN = PHINode::Create(Opd1->getType(), 2, Opd2->getName() + ".sink",
487 PHINode *NewPN = getPHIOperand(BB, S0, S1);
H A DLoopRotation.cpp58 for (I = OrigHeader->begin(); PHINode *PN = dyn_cast<PHINode>(I); ++I)
92 if (!isa<PHINode>(UserInst)) {
211 for (; PHINode *PN = dyn_cast<PHINode>(I); ++I)
267 PHINode *PN = dyn_cast<PHINode>(BI); ++BI)
H A DRewriteStatepointsForGC.cpp397 assert((isa<SelectInst>(I) || isa<PHINode>(I)) &&
515 assert((isa<SelectInst>(I) || isa<PHINode>(I)) &&
548 if (!isa<PHINode>(V) && !isa<SelectInst>(V) &&
718 return isa<PHINode>(BDV) || isa<SelectInst>(BDV) ||
751 if (PHINode *Phi = dyn_cast<PHINode>(Current)) {
812 } else if (PHINode *Phi = dyn_cast<PHINode>(BDV)) {
884 if (isa<PHINode>(I)) {
889 return PHINode
[all...]
H A DLoopIdiomRecognize.cpp143 PHINode *CntPhi, Value *Var);
831 Instruction *&CntInst, PHINode *&CntPhi,
838 PHINode *PhiX, *CountPhi;
882 PhiX = dyn_cast<PHINode>(VarX1);
903 PHINode *Phi = dyn_cast<PHINode>(Inst->getOperand(0));
986 PHINode *CntPhi;
1010 PHINode *CntPhi, Value *Var) {
1087 PHINode *TcPhi = PHINode
[all...]
H A DStructurizeCFG.cpp42 typedef MapVector<PHINode *, BBValueVector> PhiMap;
562 I != E && isa<PHINode>(*I);) {
564 PHINode &Phi = cast<PHINode>(*I++);
575 I != E && isa<PHINode>(*I);) {
577 PHINode &Phi = cast<PHINode>(*I++);
600 PHINode *Phi = PI->first;
897 } else if (PHINode *UserPN = dyn_cast<PHINode>(Use
[all...]
H A DPartiallyInlineLibCalls.cpp133 PHINode *Phi = Builder.CreatePHI(Call->getType(), 2);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp206 static PHINode *findPHIToPartitionLoops(Loop *L, DominatorTree *DT,
209 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ) {
210 PHINode *PN = cast<PHINode>(I);
260 PHINode *PN = findPHIToPartitionLoops(L, DT, AC);
393 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) {
394 PHINode *PN = cast<PHINode>(I);
395 PHINode *NewPN = PHINode
[all...]
H A DPromoteMemoryToRegister.cpp243 DenseMap<std::pair<unsigned, unsigned>, PHINode *> NewPhiNodes;
247 DenseMap<PHINode *, unsigned> PhiToAllocaMap;
689 for (DenseMap<std::pair<unsigned, unsigned>, PHINode *>::iterator
693 PHINode *PN = I->second;
715 for (DenseMap<std::pair<unsigned, unsigned>, PHINode *>::iterator
721 PHINode *SomePHI = I->second;
759 while ((SomePHI = dyn_cast<PHINode>(BBI++)) &&
852 PHINode *&PN = NewPhiNodes[std::make_pair(BBNumbers[BB], AllocaNo)];
860 PN = PHINode::Create(Allocas[AllocaNo]->getAllocatedType(), getNumPreds(BB),
883 if (PHINode *AP
[all...]
H A DIntegerDivision.cpp306 PHINode *Carry_1 = Builder.CreatePHI(DivTy, 2);
307 PHINode *SR_3 = Builder.CreatePHI(DivTy, 2);
308 PHINode *R_1 = Builder.CreatePHI(DivTy, 2);
309 PHINode *Q_2 = Builder.CreatePHI(DivTy, 2);
331 PHINode *Carry_2 = Builder.CreatePHI(DivTy, 2);
332 PHINode *Q_3 = Builder.CreatePHI(DivTy, 2);
341 PHINode *Q_5 = Builder.CreatePHI(DivTy, 2);
H A DLoopUtils.cpp70 RecurrenceDescriptor::lookThroughAnd(PHINode *Phi, Type *&RT,
155 bool RecurrenceDescriptor::AddReductionVar(PHINode *Phi, RecurrenceKind Kind,
240 bool IsAPhi = isa<PHINode>(Cur);
313 if (isa<PHINode>(UI))
317 } else if (!isa<PHINode>(UI) &&
466 bool RecurrenceDescriptor::isReductionPHI(PHINode *Phi, Loop *TheLoop,
660 bool InductionDescriptor::isInductionPHI(PHINode *Phi, ScalarEvolution *SE,
H A DInlineFunction.cpp73 PHINode *InnerEHValuesPHI; ///< PHI for EH values from landingpad insts.
85 for (; isa<PHINode>(I); ++I) {
87 PHINode *PHI = cast<PHINode>(I);
121 PHINode *phi = cast<PHINode>(I);
145 PHINode *OuterPHI = cast<PHINode>(I);
146 PHINode *InnerPHI = PHINode
[all...]
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DWinEHPrepare.cpp70 void insertPHIStores(PHINode *OriginalPHI, AllocaInst *SpillSlot);
74 AllocaInst *insertPHILoads(PHINode *PN, Function &F);
678 SmallVector<PHINode *, 16> PHINodes;
685 auto *PN = dyn_cast<PHINode>(I);
805 auto UpdatePHIOnClonedBlock = [&](PHINode *PN, bool IsForOldBlock) {
838 auto *OldPN = dyn_cast<PHINode>(&OldI);
844 auto *NewPN = dyn_cast<PHINode>(&NewI);
858 auto *SuccPN = dyn_cast<PHINode>(&SuccI);
1020 assert((DisableDemotion || !(BB.isEHPad() && isa<PHINode>(BB.begin()))) &&
1060 AllocaInst *WinEHPrepare::insertPHILoads(PHINode *P
[all...]
H A DCodeGenPrepare.cpp382 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI))
409 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) {
412 if (UI->getParent() != DestBB || !isa<PHINode>(UI))
414 // If User is inside DestBB block and it is a PHINode then check
418 if (const PHINode *UPN = dyn_cast<PHINode>(UI))
432 const PHINode *DestBBPN = dyn_cast<PHINode>(DestBB->begin());
437 if (const PHINode *BBP
[all...]
H A DDwarfEHPrepare.cpp232 PHINode *PN = PHINode::Create(Type::getInt8PtrTy(Ctx), ResumesLeft,
H A DUnreachableBlockElim.cpp77 while (PHINode *PN = dyn_cast<PHINode>(BB->begin())) {
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DScalarEvolutionExpander.cpp95 while (isa<PHINode>(IP))
825 bool SCEVExpander::isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV,
827 if (IncV->getNumOperands() == 0 || isa<PHINode>(IncV) ||
919 if (isa<PHINode>(InsertPos) ||
949 bool SCEVExpander::isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV,
963 Value *SCEVExpander::expandIVInc(PHINode *PN, Value *StepV, const Loop *L,
993 Instruction *Pos, PHINode *LoopPhi) {
1069 PHINode *
1081 PHINode *AddRecPhiMatch = nullptr;
1093 auto *PN = dyn_cast<PHINode>(
[all...]
H A DLoopInfo.cpp142 PHINode *Loop::getCanonicalInductionVariable() const {
162 for (BasicBlock::iterator I = H->begin(); isa<PHINode>(I); ++I) {
163 PHINode *PN = cast<PHINode>(I);
192 if (PHINode *P = dyn_cast<PHINode>(UI))
H A DPHITransAddr.cpp26 if (isa<PHINode>(Inst) ||
136 assert(!isa<PHINode>(I) && "Error, removing something that isn't an input");
171 if (PHINode *PN = dyn_cast<PHINode>(Inst))
H A DDivergenceAnalysis.cpp147 for (auto I = IPostDom->begin(); isa<PHINode>(I); ++I) {
148 // A PHINode is uniform if it returns the same value no matter which path is
150 if (!cast<PHINode>(I)->hasConstantValue() && DV.insert(&*I).second)
H A DScalarEvolutionNormalization.cpp47 PHINode *PN = dyn_cast<PHINode>(User);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/
H A DGlobalOpt.cpp620 SmallPtrSetImpl<const PHINode*> &PHIs) {
643 } else if (const PHINode *PN = dyn_cast<PHINode>(U)) {
665 SmallPtrSet<const PHINode*, 8> PHIs;
775 assert((isa<PHINode>(GlobalUser) || isa<SelectInst>(GlobalUser) ||
959 SmallPtrSetImpl<const PHINode*> &PHIs) {
980 if (const PHINode *PN = dyn_cast<PHINode>(Inst)) {
1015 } else if (PHINode *PN = dyn_cast<PHINode>(
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DObjCARCContract.cpp573 if (PHINode *PHI = dyn_cast<PHINode>(U.getUser())) {
575 unsigned ValNo = PHINode::getIncomingValueNumForOperand(OperandNo);
588 PHINode::getOperandNumForIncomingValue(i)) == &*UI)
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DMemoryBuiltins.h187 SizeOffsetType visitPHINode(PHINode&);
250 SizeOffsetEvalType visitPHINode(PHINode &PHI);
/freebsd-11.0-release/contrib/llvm/lib/Target/XCore/
H A DXCoreLowerThreadLocal.cpp136 if (PHINode *PN = dyn_cast<PHINode>(WU)) {

Completed in 312 milliseconds

12345678