/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | UnifyFunctionExitNodes.cpp | 95 PHINode *PN = nullptr; local
|
H A D | BreakCriticalEdges.cpp | 184 PHINode *PN = cast<PHINode>(I); local 328 PHINode *PN local [all...] |
H A D | LCSSA.cpp | 155 PHINode *PN = PHINode::Create(I->getType(), PredCache.size(ExitBB), local [all...] |
H A D | LoopVersioning.cpp | 129 PHINode *PN; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARC.h | 86 void getEquivalentPHIs(PHINodeTy &PN, VectorTy &PHIList) { argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopUnrollAnalyzer.cpp | 206 bool UnrolledInstAnalyzer::visitPHINode(PHINode &PN) { argument
|
H A D | PhiValues.cpp | 126 const PhiValues::ValueSet &PhiValues::getValuesForPhi(const PHINode *PN) { argument [all...] |
/freebsd-11-stable/lib/msun/ld128/ |
H A D | e_powl.c | 119 static const long double PN[] = variable
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Interpreter/ |
H A D | Interpreter.h | 135 void visitPHINode(PHINode &PN) { argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | DominanceFrontierImpl.h | 39 DFCalculateWorkObject(BlockT *B, BlockT *P, const DomTreeNodeT *N, const DomTreeNodeT *PN) argument
|
H A D | SparsePropagation.h | 76 virtual bool IsSpecialCasedPHI(PHINode *PN) { return false; } argument 397 void SparseSolver<LatticeKey, LatticeVal, KeyInfo>::visitPHINode(PHINode &PN) { argument [all...] |
H A D | ScalarEvolutionExpander.h | 300 void setChainedPhi(PHINode *PN) { ChainedPhis.insert(PN); } argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUUnifyDivergentExitNodes.cpp | 164 PHINode *PN = nullptr; local
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | DwarfEHPrepare.cpp | 235 PHINode *PN = PHINode::Create(Type::getInt8PtrTy(Ctx), ResumesLeft, local
|
H A D | StackProtector.cpp | 202 const auto *PN = cast<PHINode>(I); local
|
H A D | SjLjEHPrepare.cpp | 299 PHINode *PN = cast<PHINode>(U); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | Dominators.cpp | 234 PHINode *PN = dyn_cast<PHINode>(UserInst); local [all...] |
H A D | BasicBlock.cpp | 362 PHINode *PN; local 445 PHINode *PN = dyn_cast<PHINode>(II); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | FunctionLoweringInfo.h | 258 void InvalidatePHILiveOutRegInfo(const PHINode *PN) { argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | BasicBlock.h | 297 PHINodeT *PN; member in class:llvm::final::phi_iterator_impl 299 phi_iterator_impl(PHINodeT *PN) : PN(PN) {} argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | SpeculateAroundPHIs.cpp | 49 isSafeToSpeculatePHIUsers(PHINode &PN, DominatorTree &DT, argument 202 isSafeAndProfitableToSpeculateAroundPHI( PHINode &PN, SmallDenseMap<PHINode *, int, 16> &CostSavingsMap, SmallPtrSetImpl<Instruction *> &PotentialSpecSet, SmallPtrSetImpl<Instruction *> &UnsafeSet, DominatorTree &DT, TargetTransformInfo &TTI) argument [all...] |
H A D | GVNSink.cpp | 237 ModelledPHI(const PHINode *PN) { argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonVectorLoopCarriedReuse.cpp | 460 PHINode *PN = cast<PHINode>(D->front()); local 596 PHINode *PN = dyn_cast<PHINode>(Op); local 685 PHINode *PN local 732 auto *PN = cast<PHINode>(I); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | FunctionLoweringInfo.cpp | 418 void FunctionLoweringInfo::ComputePHILiveOutRegInfo(const PHINode *PN) { argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/ |
H A D | LoopVectorizationLegality.h | 266 bool isReductionVariable(PHINode *PN) { return Reductions.count(PN); } argument
|