Lines Matching defs:AddedEdges

168            std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
326   void greedyFind(std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I,
343                std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
346   /// added in \p AddedEdges
349                 std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E);
350   /// Remove the edges passed via \p AddedEdges
351   void removeEdges(const std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
476     SUnit *SU, int SGID, std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges,
486     AddedCost += Group.link(*SU, MakePred, AddedEdges);
494     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {
504   return IsBottomUp ? linkSUnit(SU, SGID, AddedEdges, SyncPipeline.rbegin(),
506                     : linkSUnit(SU, SGID, AddedEdges, SyncPipeline.begin(),
590     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
603       int TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
605       removeEdges(AddedEdges);
653     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
671     AddedCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
689     removeEdges(AddedEdges);
720     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E) {
735     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
753     TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
760     removeEdges(AddedEdges);
767     addEdges(SyncPipeline, CurrSU.first, BestGroupID, AddedEdges);
779   std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;
784         ? greedyFind(AddedEdges, CurrSU.second.rbegin(), CurrSU.second.rend())
785         : greedyFind(AddedEdges, CurrSU.second.begin(), CurrSU.second.end());
789   removeEdges(AddedEdges);
2449                      std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {
2465       AddedEdges.emplace_back(A, B);