Home
last modified time | relevance | path

Searched defs:PN (Results 1 – 25 of 147) sorted by relevance

123456

/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp43 void InstCombinerImpl::PHIArgMergedDebugLoc(Instruction *Inst, PHINode &PN) { in PHIArgMergedDebugLoc()
106 bool InstCombinerImpl::foldIntegerTypedPHI(PHINode &PN) { in foldIntegerTypedPHI()
307 Instruction *InstCombinerImpl::foldPHIArgIntToPtrToPHI(PHINode &PN) { in foldPHIArgIntToPtrToPHI()
331 InstCombinerImpl::foldPHIArgInsertValueInstructionIntoPHI(PHINode &PN) { in foldPHIArgInsertValueInstructionIntoPHI()
371 InstCombinerImpl::foldPHIArgExtractValueInstructionIntoPHI(PHINode &PN) { in foldPHIArgExtractValueInstructionIntoPHI()
407 Instruction *InstCombinerImpl::foldPHIArgBinOpIntoPHI(PHINode &PN) { in foldPHIArgBinOpIntoPHI()
502 Instruction *InstCombinerImpl::foldPHIArgGEPIntoPHI(PHINode &PN) { in foldPHIArgGEPIntoPHI()
665 Instruction *InstCombinerImpl::foldPHIArgLoadIntoPHI(PHINode &PN) { in foldPHIArgLoadIntoPHI()
863 Instruction *InstCombinerImpl::foldPHIArgOpIntoPHI(PHINode &PN) { in foldPHIArgOpIntoPHI()
977 static bool isDeadPHICycle(PHINode *PN, in isDeadPHICycle()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DPhiValues.cpp125 const PhiValues::ValueSet &PhiValues::getValuesForPhi(const PHINode *PN) { in getValuesForPhi()
146 if (const PHINode *PN = dyn_cast<PHINode>(V)) in invalidateValue() local
167 for (const PHINode &PN : BB.phis()) { in print() local
200 for (const PHINode &PN : BB.phis()) in run() local
H A DLoopNestAnalysis.cpp339 return any_of(ExitBlock.phis(), [](const PHINode &PN) { in checkLoopsStructure()
350 all_of(BB.phis(), [&](const PHINode &PN) { in checkLoopsStructure()
H A DDDGPrinter.cpp116 for (auto *PN : PNodes) { in getVerboseNodeLabel() local
H A DLoopUnrollAnalyzer.cpp206 bool UnrolledInstAnalyzer::visitPHINode(PHINode &PN) { in visitPHINode()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DDominators.cpp124 if (auto *PN = dyn_cast<PHINode>(UserInst)) in dominates() local
253 PHINode *PN = dyn_cast<PHINode>(UserInst); in dominates() local
283 if (PHINode *PN = dyn_cast<PHINode>(UserInst)) in dominates() local
329 if (PHINode *PN = dyn_cast<PHINode>(I)) isReachableFromEntry() local
[all...]
H A DSafepointIRVerifier.cpp83 bool hasLiveIncomingEdge(const PHINode *PN, const BasicBlock *InBB) const { in hasLiveIncomingEdge() argument
350 if (const auto *PN = dyn_cast<PHINode>(V)) { in getBaseType() local
469 bool hasLiveIncomingEdge(const PHINode *PN, const BasicBlock *InBB) const { in hasLiveIncomingEdge() argument
665 if (const PHINode *PN = dyn_cast<PHINode>(&I)) { in removeValidUnrelocatedDefs() local
801 if (const PHINode *PN = dyn_cast<PHINode>(&I)) { in verifyInstruction() local
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DProvenanceAnalysis.cpp146 if (const PHINode *PN = dyn_cast<PHINode>(A)) in relatedCheck() local
148 if (const PHINode *PN = dyn_cast<PHINode>(B)) in relatedCheck() local
H A DObjCARC.h74 void getEquivalentPHIs(PHINodeTy &PN, VectorTy &PHIList) { in getEquivalentPHIs()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSSAUpdaterBulk.cpp154 PHINode *PN = B.CreatePHI(R.Ty, 0, R.Name); in RewriteAllUses() local
162 for (auto *PN : InsertedPHIsForVar) { in RewriteAllUses() local
H A DLCSSA.cpp121 if (auto *PN = dyn_cast<PHINode>(User)) in formLCSSAForInstructions() local
162 PHINode *PN = PHINode::Create(I->getType(), PredCache.size(ExitBB), in formLCSSAForInstructions() local
221 if (auto *PN = dyn_cast<PHINode>(User)) in formLCSSAForInstructions() local
H A DLoopSimplify.cpp177 PHINode *PN = cast<PHINode>(I); in findPHIToPartitionLoops() local
248 PHINode *PN = findPHIToPartitionLoops(L, DT, AC); in separateNestedLoop() local
400 PHINode *PN = cast<PHINode>(I); in insertUniqueBackedgeBlock() local
596 PHINode *PN; in simplifyOneLoop() local
H A DUnifyFunctionExitNodes.cpp86 PHINode *PN = nullptr; unifyReturnBlocks() local
H A DDemoteRegToStack.cpp68 if (PHINode *PN = dyn_cast<PHINode>(U)) { in DemoteRegToStack() local
H A DScalarEvolutionExpander.cpp674 bool SCEVExpander::isNormalAddRecExprPHI(PHINode *PN, Instruction *IncV, in isNormalAddRecExprPHI()
838 bool SCEVExpander::isExpandedAddRecExprPHI(PHINode *PN, Instruction *IncV, in isExpandedAddRecExprPHI()
852 Value *SCEVExpander::expandIVInc(PHINode *PN, Value *StepV, const Loop *L, in expandIVInc()
1073 PHINode *PN = in getAddRecExprPHILiterally() local
1135 PHINode *PN = getAddRecExprPHILiterally(Normalized, L, TruncTy, InvertStep); in expandAddRecExprLiterally() local
1221 if (PHINode *PN = L->getCanonicalInductionVariable()) in visitAddRecExpr() local
1654 if (PHINode *PN = dyn_cast<PHINode>(OrigInc)) in replaceCongruentIVInc() local
1699 auto SimplifyPHINode = [&](PHINode *PN) -> Value * { in replaceCongruentIVs()
H A DLowerSwitch.cpp121 PHINode *PN = cast<PHINode>(&I); in FixPhis() local
200 PHINode *PN = cast<PHINode>(&I); in NewLeafBlock() local
208 PHINode *PN = cast<PHINode>(I); in NewLeafBlock() local
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DSparsePropagation.h78 virtual bool IsSpecialCasedPHI(PHINode *PN) { return false; } in IsSpecialCasedPHI()
399 void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::visitPHINode(PHINode &PN) { in visitPHINode()
454 if (PHINode *PN = dyn_cast<PHINode>(&I)) in visitInst() local
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp381 PHINode *PN = cast<PHINode>(D->front()); in findValueToReuse() local
514 PHINode *PN = dyn_cast<PHINode>(Op); in findValueInBlock() local
603 PHINode *PN = dyn_cast<PHINode>(I); in findDepChainFromPHI() local
650 auto *PN = cast<PHINode>(I); findLoopCarriedDeps() local
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DBasicBlock.h473 PHINodeT *PN; variable
475 phi_iterator_impl(PHINodeT *PN) : PN(PN) {} in phi_iterator_impl()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DWinEHPrepare.cpp870 auto *PN = dyn_cast<PHINode>(&I); in demotePHIsOnFunclets() local
883 for (auto *PN : PHINodes) { in demotePHIsOnFunclets() local
986 auto UpdatePHIOnClonedBlock = [&](PHINode *PN, bool IsForOldBlock) { in cloneCommonBlocks()
1228 AllocaInst *WinEHPrepareImpl::insertPHILoads(PHINode *PN, Function &F) { in insertPHILoads()
1278 PHINode *PN = dyn_cast<PHINode>(InVal); in insertPHIStores() local
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Interpreter/
H A DInterpreter.h134 void visitPHINode(PHINode &PN) { in visitPHINode()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLICM.cpp726 bool canHoistPHI(PHINode *PN) { in canHoistPHI()
973 if (PHINode *PN = dyn_cast<PHINode>(&I)) { in hoistRegion() local
1345 static bool isTriviallyReplaceablePHI(const PHINode &PN, const Instruction &I) { in isTriviallyReplaceablePHI()
1392 if (const PHINode *PN = dyn_cast<PHINode>(UI)) { in isNotUsedOrFoldableInLoop() local
1427 Instruction &I, BasicBlock &ExitBlock, PHINode &PN, const LoopInfo *LI, in cloneInstructionInExitBlock()
1543 static bool canSplitPredecessors(PHINode *PN, LoopSafetyInfo *SafetyInfo) { in canSplitPredecessors()
1560 static void splitPredecessorsOfLoopExit(PHINode *PN, DominatorTree *DT, in splitPredecessorsOfLoopExit()
1656 PHINode *PN = cast<PHINode>(User); in sink() local
1720 PHINode *PN = cast<PHINode>(User); in sink() local
1838 PHINode *PN = PHINode::Create(I->getType(), PredCache.size(BB), in maybeInsertLCSSAPHI() local
H A DLoopDeletion.cpp265 auto GetSoleInputOnFirstIteration = [&](PHINode & PN)->Value * { in canProveExitOnFirstIteration()
318 for (auto &PN : BB->phis()) { in canProveExitOnFirstIteration() local
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86PartialReduction.cpp445 if (auto *PN = dyn_cast<PHINode>(V)) { in collectLeaves() local
468 PHINode *PN = nullptr; in collectLeaves() local
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DFunctionLoweringInfo.cpp279 for (const PHINode &PN : BB.phis()) { in set() local
438 void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) { in ComputePHILiveOutRegInfo()

123456