169            std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
331   void greedyFind(std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I,
348                std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
354                 std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E);
356   void removeEdges(const std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges);
481     SUnit *SU, int SGID, std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges,  in linkSUnit()  argument
491     AddedCost += Group.link(*SU, MakePred, AddedEdges);  in linkSUnit()
499     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {  in addEdges()  argument
509   return IsBottomUp ? linkSUnit(SU, SGID, AddedEdges, SyncPipeline.rbegin(),  in addEdges()
511                     : linkSUnit(SU, SGID, AddedEdges, SyncPipeline.begin(),  in addEdges()
595     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in populateReadyList()  local
608       int TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in populateReadyList()
610       removeEdges(AddedEdges);  in populateReadyList()
658     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in solveExact()  local
676     AddedCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in solveExact()
694     removeEdges(AddedEdges);  in solveExact()
725     std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges, T I, T E) {  in greedyFind()  argument
740     std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in greedyFind()  local
758     TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in greedyFind()
765     removeEdges(AddedEdges);  in greedyFind()
772     addEdges(SyncPipeline, CurrSU.first, BestGroupID, AddedEdges);  in greedyFind()
784   std::vector<std::pair<SUnit *, SUnit *>> AddedEdges;  in solveGreedy()  local
789         ? greedyFind(AddedEdges, CurrSU.second.rbegin(), CurrSU.second.rend())  in solveGreedy()
790         : greedyFind(AddedEdges, CurrSU.second.begin(), CurrSU.second.end());  in solveGreedy()
794   removeEdges(AddedEdges);  in solveGreedy()
1493                      std::vector<std::pair<SUnit *, SUnit *>> &AddedEdges) {  in link()  argument
1509       AddedEdges.push_back(std::pair(A, B));  in link()