/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 404 bool llvm::RecursivelyDeleteDeadPHINode(PHINode *PN, 525 if (!isa<PHINode>(BB->begin())) 534 while (PHINode *PN = dyn_cast<PHINode>(PhiIt)) { 556 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) { 625 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { 626 PHINode *PN = cast<PHINode>(I); 628 // If the incoming value from BB is again a PHINode i [all...] |
H A D | LoopUnrollRuntime.cpp | 78 PHINode *PN = dyn_cast<PHINode>(BBI); ++BBI) { 82 PHINode *NewPN = PHINode::Create(PN->getType(), 2, PN->getName()+".unr", 191 PHINode *NewIdx = PHINode::Create(NewIter->getType(), 2, "prol.iter", 208 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) { 209 PHINode *NewPHI = cast<PHINode>(VMap[&*I]);
|
H A D | LoopUnroll.cpp | 58 if (PHINode *PN = dyn_cast<PHINode>(I)) { 291 std::vector<PHINode*> OrigPHINode; 292 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I) { 293 OrigPHINode.push_back(cast<PHINode>(I)); 353 PHINode *NewPHI = cast<PHINode>(VMap[OrigPHINode[i]]); 374 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { 401 PHINode *P [all...] |
H A D | LoopVersioning.cpp | 125 PHINode *PN; 129 for (auto I = PHIBlock->begin(); (PN = dyn_cast<PHINode>(I)); ++I) { 137 PN = PHINode::Create(Inst->getType(), 2, Inst->getName() + ".lver",
|
H A D | CodeExtractor.cpp | 193 PHINode *PN = dyn_cast<PHINode>(Header->begin()); 233 PHINode *PN = cast<PHINode>(OldPred->begin()); 244 for (AfterPHIs = OldPred->begin(); isa<PHINode>(AfterPHIs); ++AfterPHIs) { 245 PHINode *PN = cast<PHINode>(AfterPHIs); 248 PHINode *NewPN = PHINode::Create(PN->getType(), 1 + NumPredsFromRegion, 411 PHINode * [all...] |
H A D | CloneFunction.cpp | 327 if (!isa<PHINode>(NewInst)) { 476 SmallVector<const PHINode*, 16> PHIToResolve; 490 if (const PHINode *PN = dyn_cast<PHINode>(I)) { 491 if (isa<PHINode>(VMap[PN])) 510 const PHINode *OPN = PHIToResolve[phino]; 520 PHINode *PN = cast<PHINode>(VMap[OPN]); 542 PHINode *PN = cast<PHINode>(NewB [all...] |
H A D | GlobalStatus.cpp | 51 SmallPtrSetImpl<const PHINode *> &PhiUsers) { 137 } else if (const PHINode *PN = dyn_cast<PHINode>(I)) { 180 SmallPtrSet<const PHINode *, 16> PhiUsers;
|
H A D | SimplifyIndVar.cpp | 68 void simplifyUsers(PHINode *CurrIV, IVVisitor *V = nullptr); 185 } else if (isa<PHINode>(IVOperand) && 204 for (Value *Incoming : cast<PHINode>(IVOperand)->incoming_values()) { 330 if (isa<PHINode>(UseInst)) 447 if (PHINode *PHI = dyn_cast<PHINode>(UseInst)) 525 void SimplifyIndvar::simplifyUsers(PHINode *CurrIV, IVVisitor *V) { 597 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, 610 for (BasicBlock::iterator I = L->getHeader()->begin(); isa<PHINode>(I); ++I) { 611 Changed |= simplifyUsersOfIV(cast<PHINode>( [all...] |
H A D | FlattenCFG.cpp | 125 PHINode *PHI = dyn_cast<PHINode>(BB->begin()); 181 if (isa<PHINode>(CI) || !isSafeToSpeculativelyExecute(CI)) 263 PHI = dyn_cast<PHINode>(PS2->begin()); 428 if (isa<PHINode>(CI) || CI->mayHaveSideEffects() ||
|
H A D | LowerSwitch.cpp | 173 PHINode *PN = cast<PHINode>(I); 343 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) { 344 PHINode* PN = cast<PHINode>(I); 508 for (BasicBlock::iterator I = Default->begin(); isa<PHINode>(I); ++I) { 509 PHINode *PN = cast<PHINode>(I);
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 28 class PHINode; 77 virtual bool IsSpecialCasedPHI(PHINode *PN) { return false; } 195 void visitPHINode(PHINode &I);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | TailRecursionElimination.cpp | 110 SmallVectorImpl<PHINode *> &ArgumentPHIs, 115 SmallVectorImpl<PHINode *> &ArgumentPHIs, 119 SmallVectorImpl<PHINode *> &ArgumentPHIs, 396 SmallVector<PHINode*, 8> ArgumentPHIs; 428 for (PHINode *PN : ArgumentPHIs) { 618 SmallVectorImpl<PHINode *> &ArgumentPHIs, 708 PHINode *PN = PHINode::Create(I->getType(), 2, 740 PHINode *AccPN = PHINode [all...] |
H A D | JumpThreading.cpp | 160 bool ProcessBranchOnPHI(PHINode *PN); 451 if (PHINode *PN = dyn_cast<PHINode>(I)) { 552 PHINode *PN = dyn_cast<PHINode>(Cmp->getOperand(0)); 874 if (PHINode *PN = dyn_cast<PHINode>(CondInst)) 1075 PHINode *PN = PHINode::Create(LI->getType(), std::distance(PB, PE), "", 1282 bool JumpThreading::ProcessBranchOnPHI(PHINode *P [all...] |
H A D | InductiveRangeCheckElimination.cpp | 509 std::vector<PHINode *> PHIValuesAtPseudoExit; 510 PHINode *IndVarEnd; 529 // set of a `PHINode' -- replaces instances of `Block' in the `PHINode's 531 static void replacePHIBlock(PHINode *PN, BasicBlock *Block, 563 // for each PHINode in the loop header on taking the pseudo exit. 630 void LoopConstrainer::replacePHIBlock(PHINode *PN, BasicBlock *Block, 963 if (!isa<PHINode>(&I)) 966 PHINode *PN = cast<PHINode>( [all...] |
H A D | LoopDeletion.cpp | 94 while (PHINode *P = dyn_cast<PHINode>(BI)) { 200 while (PHINode *P = dyn_cast<PHINode>(BI)) {
|
H A D | SimplifyCFGPass.cpp | 77 (!isa<PHINode>(I) || I != BB.begin() || Ret->getNumOperands() == 0 || 103 PHINode *RetBlockPHI = dyn_cast<PHINode>(RetBlock->begin()); 107 RetBlockPHI = PHINode::Create(Ret->getOperand(0)->getType(),
|
H A D | Sink.cpp | 86 if (PHINode *PN = dyn_cast<PHINode>(UseInst)) { 89 unsigned Num = PHINode::getIncomingValueNumForOperand(U.getOperandNo()); 172 if (isa<TerminatorInst>(Inst) || isa<PHINode>(Inst) || Inst->isEHPad() ||
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Utils/ |
H A D | LoopUtils.h | 169 static bool AddReductionVar(PHINode *Phi, RecurrenceKind Kind, Loop *TheLoop, 175 static bool isReductionPHI(PHINode *Phi, Loop *TheLoop, 206 static Instruction *lookThroughAnd(PHINode *Phi, Type *&RT, 284 static bool isInductionPHI(PHINode *Phi, ScalarEvolution *SE,
|
H A D | Local.h | 36 class PHINode; 85 bool RecursivelyDeleteDeadPHINode(PHINode *PN, 168 AllocaInst *DemotePHIToStack(PHINode *P, Instruction *AllocaPoint = nullptr);
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | SparsePropagation.cpp | 110 for (BasicBlock::iterator I = Dest->begin(); isa<PHINode>(I); ++I) 111 visitPHINode(*cast<PHINode>(I)); 230 void SparseSolver::visitPHINode(PHINode &PN) { 231 // The lattice function may store more information on a PHINode than could be 280 if (PHINode *PN = dyn_cast<PHINode>(&I))
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | SjLjEHPrepare.cpp | 288 !isa<PHINode>(Inst->user_back())) 301 if (UI->getParent() != BB || isa<PHINode>(UI)) 312 if (!isa<PHINode>(U)) { 316 PHINode *PN = cast<PHINode>(U); 353 SmallPtrSet<PHINode *, 8> PHIsToDemote; 354 for (BasicBlock::iterator PN = UnwindBlock->begin(); isa<PHINode>(PN); ++PN) 355 PHIsToDemote.insert(cast<PHINode>(PN)); 360 for (PHINode *PN : PHIsToDemote)
|
/freebsd-11.0-release/contrib/llvm/lib/IR/ |
H A D | Instruction.cpp | 354 if (const PHINode *thisPHI = dyn_cast<PHINode>(this)) { 355 const PHINode *otherPHI = cast<PHINode>(I); 398 const PHINode *PN = dyn_cast<PHINode>(I);
|
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 213 void ComputePHILiveOutRegInfo(const PHINode*); 217 void InvalidatePHILiveOutRegInfo(const PHINode *PN) {
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 313 Instruction *SliceUpIllegalIntegerPHI(PHINode &PN); 314 Instruction *visitPHINode(PHINode &PN); 391 Instruction *scalarizePHI(ExtractElementInst &EI, PHINode *PN); 545 Instruction *FoldPHIArgOpIntoPHI(PHINode &PN); 546 Instruction *FoldPHIArgBinOpIntoPHI(PHINode &PN); 547 Instruction *FoldPHIArgGEPIntoPHI(PHINode &PN); 548 Instruction *FoldPHIArgLoadIntoPHI(PHINode &PN); 549 Instruction *FoldPHIArgZextsIntoPHI(PHINode &PN);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/NVPTX/ |
H A D | NVPTXLowerAggrCopies.cpp | 84 PHINode *LoopIndex = LoopBuilder.CreatePHI(TypeOfCopyLen, 0); 172 PHINode *LoopPhi = LoopBuilder.CreatePHI(TypeOfCopyLen, 0); 191 PHINode *FwdCopyPhi = FwdLoopBuilder.CreatePHI(TypeOfCopyLen, 0, "index_ptr"); 225 PHINode *LoopIndex = LoopBuilder.CreatePHI(CopyLen->getType(), 0);
|