Lines Matching refs:InsertPts
166 InsertionPoints &InsertPts);
182 InsertionPoints &InsertPts);
192 InsertionPoints &InsertPts);
198 InsertionPoints &InsertPts);
210 InsertionPoints &InsertPts) { in appendAndTransferDominatedUses() argument
219 InsertPts[NewPt] = std::move(OldUses); in appendAndTransferDominatedUses()
221 InsertPts.erase(OldInstr); in appendAndTransferDominatedUses()
369 InsertionPoints &InsertPts) { in isDominated() argument
375 for (auto &IPI : InsertPts) { in isDominated()
395 InsertionPoints &InsertPts) { in tryAndMerge() argument
403 for (InsertionPoints::iterator IPI = InsertPts.begin(), in tryAndMerge()
404 EndIPI = InsertPts.end(); in tryAndMerge()
414 appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts); in tryAndMerge()
438 appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts); in tryAndMerge()
445 Instruction *User, unsigned OpNo, InsertionPoints &InsertPts) { in computeInsertionPoint() argument
456 if (isDominated(InsertionPoint, User, OpNo, InsertPts)) in computeInsertionPoint()
460 if (tryAndMerge(InsertionPoint, User, OpNo, InsertPts)) in computeInsertionPoint()
466 InsertPts[InsertionPoint].emplace_back(User, OpNo); in computeInsertionPoint()
487 InsertionPoints &InsertPts) { in insertDefinitions() argument
492 assert(!InsertPts.empty() && "Empty uses does not need a definition"); in insertDefinitions()
494 for (const auto &IPI : InsertPts) { in insertDefinitions()
529 InsertionPoints InsertPts; in promoteConstants() local
531 computeInsertionPoint(U->User, U->Op, InsertPts); in promoteConstants()
536 insertDefinitions(F, *Promotion.GV, InsertPts); in promoteConstants()