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);
349                 std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E);
351   void removeEdges(const std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
476     SUnit *SU, int SGID, std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges,  in linkSUnit()  argument
486     AddedCost += Group.link(*SU, MakePred, AddedEdges);  in linkSUnit()
494     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {  in addEdges()  argument
504   return IsBottomUp ? linkSUnit(SU, SGID, AddedEdges, SyncPipeline.rbegin(),  in addEdges()
506                     : linkSUnit(SU, SGID, AddedEdges, SyncPipeline.begin(),  in addEdges()
590     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in populateReadyList()  local
603       int TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in populateReadyList()
605       removeEdges(AddedEdges);  in populateReadyList()
653     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in solveExact()  local
671     AddedCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in solveExact()
689     removeEdges(AddedEdges);  in solveExact()
720     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E) {  in greedyFind()  argument
735     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in greedyFind()  local
753     TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in greedyFind()
760     removeEdges(AddedEdges);  in greedyFind()
767     addEdges(SyncPipeline, CurrSU.first, BestGroupID, AddedEdges);  in greedyFind()
779   std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in solveGreedy()  local
784         ? greedyFind(AddedEdges, CurrSU.second.rbegin(), CurrSU.second.rend())  in solveGreedy()
785         : greedyFind(AddedEdges, CurrSU.second.begin(), CurrSU.second.end());  in solveGreedy()
789   removeEdges(AddedEdges);  in solveGreedy()
2449                      std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {  in link()  argument
2465       AddedEdges.emplace_back(A, B);  in link()