591     int CandSGID = *I;  in populateReadyList()  local
592     SchedGroup *Match = llvm::find_if(SyncPipeline, [CandSGID](SchedGroup &SG) {  in populateReadyList()
593       return SG.getSGID() == CandSGID;  in populateReadyList()
603       int TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in populateReadyList()
651     int CandSGID = I->first;  in solveExact()  local
657       if (SG.getSGID() == CandSGID)  in solveExact()
668                       << (int)Match->getMask() << "and ID " << CandSGID  in solveExact()
671     AddedCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in solveExact()
736     int CandSGID = *I;  in greedyFind()  local
737     SchedGroup *Match = llvm::find_if(SyncPipeline, [CandSGID](SchedGroup &SG) {  in greedyFind()
738       return SG.getSGID() == CandSGID;  in greedyFind()
742     LLVM_DEBUG(dbgs() << "Trying SGID # " << CandSGID << " with Mask "  in greedyFind()
746       LLVM_DEBUG(dbgs() << "SGID # " << CandSGID << " is full\n");  in greedyFind()
750       LLVM_DEBUG(dbgs() << "SGID # " << CandSGID << " has conflicting rule\n");  in greedyFind()
753     TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);  in greedyFind()
758       BestGroupID = CandSGID;  in greedyFind()