Lines Matching defs:CurrSU

566   SUToCandSGsPair CurrSU = PipelineInstrs[CurrSyncGroupIdx][CurrConflInstNo];
568   assert(CurrSU.second.size() >= 1);
584       int TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
598   assert(ReadyList.size() == CurrSU.second.size());
611   SUToCandSGsPair CurrSU = PipelineInstrs[CurrSyncGroupIdx][CurrConflInstNo];
612   LLVM_DEBUG(dbgs() << "Fitting SU(" << CurrSU.first->NodeNum
618   IsBottomUp ? populateReadyList(ReadyList, CurrSU.second.rbegin(),
619                                  CurrSU.second.rend())
620              : populateReadyList(ReadyList, CurrSU.second.begin(),
621                                  CurrSU.second.end());
645     if (!Match->allowedByRules(CurrSU.first, SyncPipeline))
651     Match->add(*CurrSU.first);
652     AddedCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
683   LLVM_DEBUG(dbgs() << "NOT Assigned (" << CurrSU.first->NodeNum << ")\n");
702   SUToCandSGsPair CurrSU = PipelineInstrs[CurrSyncGroupIdx][CurrConflInstNo];
708   LLVM_DEBUG(dbgs() << "Fitting SU(" << CurrSU.first->NodeNum
730     if (!Match->allowedByRules(CurrSU.first, SyncPipeline)) {
734     TempCost = addEdges(SyncPipeline, CurrSU.first, CandSGID, AddedEdges);
747     BestGroup->add(*CurrSU.first);
748     addEdges(SyncPipeline, CurrSU.first, BestGroupID, AddedEdges);
763     SUToCandSGsPair CurrSU = PipelineInstrs[CurrSyncGroupIdx][CurrConflInstNo];
765         ? greedyFind(AddedEdges, CurrSU.second.rbegin(), CurrSU.second.rend())
766         : greedyFind(AddedEdges, CurrSU.second.begin(), CurrSU.second.end());