Lines Matching defs:InsertPts
161 /// \param InsertPts existing insertion points
162 /// \pre NewPt and all instruction in InsertPts belong to the same function
163 /// \return true if one of the insertion point in InsertPts dominates NewPt,
166 InsertionPoints &InsertPts);
175 /// \param InsertPts existing insertion points
176 /// \pre NewPt and all instruction in InsertPts belong to the same function
178 /// \return true if it exists an insertion point in InsertPts that could
182 InsertionPoints &InsertPts);
190 /// \param[out] InsertPts output storage of the analysis
192 InsertionPoints &InsertPts);
198 InsertionPoints &InsertPts);
205 /// Transfer the list of dominated uses of IPI to NewPt in InsertPts.
206 /// Append Use to this list and delete the entry of IPI in InsertPts.
210 InsertionPoints &InsertPts) {
219 InsertPts[NewPt] = std::move(OldUses);
221 InsertPts.erase(OldInstr);
383 InsertionPoints &InsertPts) {
389 for (auto &IPI : InsertPts) {
409 InsertionPoints &InsertPts) {
417 for (InsertionPoints::iterator IPI = InsertPts.begin(),
418 EndIPI = InsertPts.end();
428 appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);
452 appendAndTransferDominatedUses(NewPt, User, OpNo, IPI, InsertPts);
459 Instruction *User, unsigned OpNo, InsertionPoints &InsertPts) {
470 if (isDominated(InsertionPoint, User, OpNo, InsertPts))
474 if (tryAndMerge(InsertionPoint, User, OpNo, InsertPts))
480 InsertPts[InsertionPoint].emplace_back(User, OpNo);
501 InsertionPoints &InsertPts) {
506 assert(!InsertPts.empty() && "Empty uses does not need a definition");
508 for (const auto &IPI : InsertPts) {
544 InsertionPoints InsertPts;
546 computeInsertionPoint(U->User, U->Op, InsertPts);
551 insertDefinitions(F, *Promotion.GV, InsertPts);