236     std::vector<SUnit> &SUnits;  member in __anone7df25700111::SwingSchedulerDAG::Circuits
246         : SUnits(SUs), Stack(), Blocked(SUs.size()), B(SUs.size()),  in Circuits()
252       B.assign(SUnits.size(), SmallPtrSet<SUnit *, 4>());  in reset()
265         Topo(SUnits, &ExitSU) {}  in SwingSchedulerDAG()
827     for (unsigned su = 0, e = SUnits.size(); su != e; ++su)  in schedule()
828       SUnits[su].dumpAll(this);  in schedule()
998   for (auto &SU : SUnits) {  in addLoopCarriedDependences()
1080   for (SUnit &I : SUnits) {  in updatePhiDependences()
1162   for (SUnit &I : SUnits) {  in changeDependences()
1371 static void swapAntiDependences(std::vector<SUnit> &SUnits) {  in swapAntiDependences()  argument
1373   for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {  in swapAntiDependences()
1374     SUnit *SU = &SUnits[i];  in swapAntiDependences()
1401   BitVector Added(SUnits.size());  in createAdjacencyStructure()
1402   for (int i = 0, e = SUnits.size(); i != e; ++i) {  in createAdjacencyStructure()
1405     for (auto &SI : SUnits[i].Succs) {  in createAdjacencyStructure()
1419     for (auto &PI : SUnits[i].Preds) {  in createAdjacencyStructure()
1420       if (!SUnits[i].getInstr()->mayStore() ||  in createAdjacencyStructure()
1421           !DAG->isLoopCarriedOrder(&SUnits[i], PI, false))  in createAdjacencyStructure()
1438   SUnit *SV = &SUnits[V];  in circuit()
1493   swapAntiDependences(SUnits);  in findCircuits()
1495   Circuits Cir(SUnits);  in findCircuits()
1498   for (int i = 0, e = SUnits.size(); i != e; ++i) {  in findCircuits()
1504   swapAntiDependences(SUnits);  in findCircuits()
1524   ScheduleInfo.resize(SUnits.size());  in computeNodeFunctions()
1530       SUnit *SU = &SUnits[*I];  in computeNodeFunctions()
1541     SUnit *SU = &SUnits[*I];  in computeNodeFunctions()
1560     SUnit *SU = &SUnits[*I];  in computeNodeFunctions()
1579     for (unsigned i = 0; i < SUnits.size(); i++) {  in computeNodeFunctions()
1581       dbgs() << "\t   ASAP = " << getASAP(&SUnits[i]) << "\n";  in computeNodeFunctions()
1582       dbgs() << "\t   ALAP = " << getALAP(&SUnits[i]) << "\n";  in computeNodeFunctions()
1583       dbgs() << "\t   MOV  = " << getMOV(&SUnits[i]) << "\n";  in computeNodeFunctions()
1584       dbgs() << "\t   D    = " << getDepth(&SUnits[i]) << "\n";  in computeNodeFunctions()
1585       dbgs() << "\t   H    = " << getHeight(&SUnits[i]) << "\n";  in computeNodeFunctions()
1741     std::vector<SUnit *> SUnits(NS.begin(), NS.end());  in registerPressureFilter()  local
1742     std::sort(SUnits.begin(), SUnits.end(), [](const SUnit *A, const SUnit *B) {  in registerPressureFilter()
1746     for (auto &SU : SUnits) {  in registerPressureFilter()
1811   for (auto &SU : SUnits)  in checkNodeSets()
1873   for (unsigned i = 0; i < SUnits.size(); ++i) {  in groupRemainingNodes()
1874     SUnit *SU = &SUnits[i];  in groupRemainingNodes()
3823   for (int i = 0, e = SSD->SUnits.size(); i < e; ++i) {  in isValidSchedule()
3824     SUnit &SU = SSD->SUnits[i];  in isValidSchedule()
3896   for (int i = 0, e = SSD->SUnits.size(); i != e; ++i) {  in finalizeSchedule()
3897     SUnit *SU = &SSD->SUnits[i];  in finalizeSchedule()