Lines Matching defs:AddedEdges

167            std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
308   void greedyFind(std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I,
325                std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
328   /// added in \p AddedEdges
331                 std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E);
332   /// Remove the edges passed via \p AddedEdges
333   void removeEdges(const std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
457     SUnit *SU, int SGID, std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges,
467     AddedCost += Group.link(*SU, MakePred, AddedEdges);
475     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {
485   return IsBottomUp ? linkSUnit(SU, SGID, AddedEdges, SyncPipeline.rbegin(),
487                     : linkSUnit(SU, SGID, AddedEdges, SyncPipeline.begin(),
571     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
584       int TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
586       removeEdges(AddedEdges);
634     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
652     AddedCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
670     removeEdges(AddedEdges);
701     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E) {
716     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
734     TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
741     removeEdges(AddedEdges);
748     addEdges(SyncPipeline, CurrSU.first, BestGroupID, AddedEdges);
760   std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
765         ? greedyFind(AddedEdges, CurrSU.second.rbegin(), CurrSU.second.rend())
766         : greedyFind(AddedEdges, CurrSU.second.begin(), CurrSU.second.end());
770   removeEdges(AddedEdges);
2466                      std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {
2482       AddedEdges.emplace_back(A, B);