155                    InsertionPoints &InsertPts);
171                    InsertionPoints &InsertPts);
181                              InsertionPoints &InsertPts);
187                          InsertionPoints &InsertPts);
199                                              InsertionPoints &InsertPts) {  in appendAndTransferDominatedUses()  argument
208     InsertPts[NewPt] = std::move(OldUses);  in appendAndTransferDominatedUses()
210     InsertPts.erase(OldInstr);  in appendAndTransferDominatedUses()
361                                          InsertionPoints &InsertPts) {  in isDominated()  argument
368   for (auto &IPI : InsertPts) {  in isDominated()
388                                          InsertionPoints &InsertPts) {  in tryAndMerge()  argument
396   for (InsertionPoints::iterator IPI = InsertPts.begin(),  in tryAndMerge()
397                                  EndIPI = InsertPts.end();  in tryAndMerge()
407       appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);  in tryAndMerge()
431     appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);  in tryAndMerge()
438     Instruction *User, unsigned OpNo, InsertionPoints &InsertPts) {  in computeInsertionPoint()  argument
449   if (isDominated(InsertionPoint, User, OpNo, InsertPts))  in computeInsertionPoint()
453   if (tryAndMerge(InsertionPoint, User, OpNo, InsertPts))  in computeInsertionPoint()
459   InsertPts[InsertionPoint].emplace_back(User, OpNo);  in computeInsertionPoint()
480                                                InsertionPoints &InsertPts) {  in insertDefinitions()  argument
485   assert(!InsertPts.empty() && "Empty uses does not need a definition");  in insertDefinitions()
487   for (const auto &IPI : InsertPts) {  in insertDefinitions()
522     InsertionPoints InsertPts;  in promoteConstants()  local
524       computeInsertionPoint(U->User, U->Op, InsertPts);  in promoteConstants()
529     insertDefinitions(F, *Promotion.GV, InsertPts);  in promoteConstants()