Searched refs:SUs (Results 1 – 6 of 6) sorted by relevance
173 Circuits(std::vector<SUnit> &SUs, ScheduleDAGTopologicalSort &Topo) in Circuits() argument174 : SUnits(SUs), Blocked(SUs.size()), B(SUs.size()), AdjK(SUs.size()) { in Circuits()175 Node2Idx = new std::vector<int>(SUs.size()); in Circuits()
210 void addChainDependencies(SUnit *SU, SUList &SUs, unsigned Latency) { in addChainDependencies() argument211 for (SUnit *Entry : SUs) in addChainDependencies()
4 ; Verify that, the macro-fusion creates the necessary dependencies between SUs and
1319 std::vector<SUnit*> SUs = Block->getScheduledUnits(); in scheduleInsideBlocks() local1321 for (SUnit* SU : SUs) { in scheduleInsideBlocks()1350 std::vector<SUnit*> SUs = Block->getScheduledUnits(); in scheduleInsideBlocks() local1351 Block->schedule((*SUs.begin())->getInstr(), (*SUs.rbegin())->getInstr()); in scheduleInsideBlocks()1744 std::vector<SUnit*> SUs = Block->getScheduledUnits(); in scheduleVariant() local1746 for (SUnit* SU : SUs) in scheduleVariant()1747 Res.SUs.push_back(SU->NodeNum); in scheduleVariant()1975 ScheduledSUnits = Best.SUs; in schedule()
406 std::vector<unsigned> SUs; member
754 SmallVector<SUnit *, 4> &SUs = PendingLoads[V]; in addLoopCarriedDependences() local755 SUs.push_back(&SU); in addLoopCarriedDependences()