Lines Matching refs:InsertPts
138 bool isDominated(Instruction *NewPt, Use &Use, InsertionPoints &InsertPts);
152 bool tryAndMerge(Instruction *NewPt, Use &Use, InsertionPoints &InsertPts);
188 InsertionPoints &InsertPts) { in appendAndTransferDominatedUses() argument
197 InsertPts[NewPt] = std::move(OldUses); in appendAndTransferDominatedUses()
199 InsertPts.erase(OldInstr); in appendAndTransferDominatedUses()
343 InsertionPoints &InsertPts) { in isDominated() argument
350 for (auto &IPI : InsertPts) { in isDominated()
369 InsertionPoints &InsertPts) { in tryAndMerge() argument
377 for (InsertionPoints::iterator IPI = InsertPts.begin(), in tryAndMerge()
378 EndIPI = InsertPts.end(); in tryAndMerge()
388 appendAndTransferDominatedUses(NewPt, Use, IPI, InsertPts); in tryAndMerge()
412 appendAndTransferDominatedUses(NewPt, Use, IPI, InsertPts); in tryAndMerge()
444 InsertionPoints &InsertPts = in computeInsertionPoints() local
446 if (isDominated(InsertionPoint, Use, InsertPts)) in computeInsertionPoints()
450 if (tryAndMerge(InsertionPoint, Use, InsertPts)) in computeInsertionPoints()
456 InsertPts[InsertionPoint].push_back(&Use); in computeInsertionPoints()
468 const InsertionPoints &InsertPts = FctToInstPtsIt.second; in insertDefinitions() local
474 assert(!InsertPts.empty() && "Empty uses does not need a definition"); in insertDefinitions()
490 for (const auto &IPI : InsertPts) { in insertDefinitions()