Searched refs:Phis (Results 1 - 4 of 4) sorted by relevance
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | RDFLiveness.cpp | 428 NodeList Phis; local 433 Phis.insert(Phis.end(), Ps.begin(), Ps.end()); 442 for (NodeAddr<PhiNode*> PhiA : Phis) { 743 NodeList Phis = BA.Addr->members_if(DFG.IsCode<NodeAttrs::Phi>, DFG); local 744 for (NodeAddr<PhiNode*> PA : Phis) { 792 } // for P : Phis
|
H A D | ModuloSchedule.cpp | 362 /// Generate Phis for the specific block in the generated pipelined code. 363 /// This function looks at the Phis from the original code to guide the 364 /// creation of new Phis. 411 // Adjust the number of Phis needed depending on the number of prologs left, 413 // Phis cannot exceed the number of prolog stages. Each stage can 559 // We define the Phis after creating the new pipelined code, so 600 /// Generate Phis for the specified block in the generated pipelined code. 601 /// These are new Phis needed because the definition is scheduled after the 647 // The number of Phis can't exceed the number of prolog stages. The 719 // We can, and want to, remove Phis her 1258 DenseMap<std::pair<unsigned, unsigned>, Register> Phis; member in class:__anon4606::KernelRewriter [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolutionExpander.cpp | 1953 SmallVector<PHINode*, 8> Phis; local 1955 Phis.push_back(&PN); 1958 llvm::sort(Phis, [](Value *LHS, Value *RHS) { 1970 for (PHINode *Phi : Phis) { 2002 TTI->isTruncateFree(Phi->getType(), Phis.back()->getType())) { 2006 SE.getTruncateExpr(SE.getSCEV(Phi), Phis.back()->getType());
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonBitSimplify.cpp | 3108 std::vector<PhiInfo> Phis; 3128 Phis.push_back(PhiInfo(I, *C.LB)); 3132 dbgs() << "Phis: {"; 3133 for (auto &I : Phis) { 3142 if (Phis.empty()) 3245 if (llvm::find_if(Phis, LoopInpEq) == Phis.end()) 3270 auto F = llvm::find_if(Phis, LoopInpEq); 3271 if (F == Phis.end())
|
Completed in 96 milliseconds