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()
383                                          InsertionPoints &InsertPts) {  in isDominated()  argument
389   for (auto &IPI : InsertPts) {  in isDominated()
409                                          InsertionPoints &InsertPts) {  in tryAndMerge()  argument
417   for (InsertionPoints::iterator IPI = InsertPts.begin(),  in tryAndMerge()
418                                  EndIPI = InsertPts.end();  in tryAndMerge()
428       appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);  in tryAndMerge()
452     appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);  in tryAndMerge()
459     Instruction *User, unsigned OpNo, InsertionPoints &InsertPts) {  in computeInsertionPoint()  argument
470   if (isDominated(InsertionPoint, User, OpNo, InsertPts))  in computeInsertionPoint()
474   if (tryAndMerge(InsertionPoint, User, OpNo, InsertPts))  in computeInsertionPoint()
480   InsertPts[InsertionPoint].emplace_back(User, OpNo);  in computeInsertionPoint()
501                                                InsertionPoints &InsertPts) {  in insertDefinitions()  argument
506   assert(!InsertPts.empty() && "Empty uses does not need a definition");  in insertDefinitions()
508   for (const auto &IPI : InsertPts) {  in insertDefinitions()
544     InsertionPoints InsertPts;  in promoteConstants()  local
546       computeInsertionPoint(U->User, U->Op, InsertPts);  in promoteConstants()
551     insertDefinitions(F, *Promotion.GV, InsertPts);  in promoteConstants()