842   for (auto &SU : SUnits) {  in addLoopCarriedDependences()
939   for (SUnit &I : SUnits) {  in updatePhiDependences()
1021   for (SUnit &I : SUnits) {  in changeDependences()
1630 static void swapAntiDependences(std::vector<SUnit> &SUnits) {  in swapAntiDependences()  argument
1632   for (SUnit &SU : SUnits) {  in swapAntiDependences()
1654   BitVector Added(SUnits.size());  in createAdjacencyStructure()
1656   for (int i = 0, e = SUnits.size(); i != e; ++i) {  in createAdjacencyStructure()
1659     for (auto &SI : SUnits[i].Succs) {  in createAdjacencyStructure()
1685     for (auto &PI : SUnits[i].Preds) {  in createAdjacencyStructure()
1686       if (!SUnits[i].getInstr()->mayStore() ||  in createAdjacencyStructure()
1687           !DAG->isLoopCarriedDep(&SUnits[i], PI, false))  in createAdjacencyStructure()
1710   SUnit *SV = &SUnits[V];  in circuit()
1765   swapAntiDependences(SUnits);  in findCircuits()
1767   Circuits Cir(SUnits, Topo);  in findCircuits()
1770   for (int i = 0, e = SUnits.size(); i != e; ++i) {  in findCircuits()
1776   swapAntiDependences(SUnits);  in findCircuits()
1798   for (SUnit &SU : DAG->SUnits) {  in apply()
1875   ScheduleInfo.resize(SUnits.size());  in computeNodeFunctions()
1879       const SUnit &SU = SUnits[I];  in computeNodeFunctions()
1889     SUnit *SU = &SUnits[I];  in computeNodeFunctions()
1909     SUnit *SU = &SUnits[I];  in computeNodeFunctions()
1932     for (unsigned i = 0; i < SUnits.size(); i++) {  in computeNodeFunctions()
1934       dbgs() << "\t   ASAP = " << getASAP(&SUnits[i]) << "\n";  in computeNodeFunctions()
1935       dbgs() << "\t   ALAP = " << getALAP(&SUnits[i]) << "\n";  in computeNodeFunctions()
1936       dbgs() << "\t   MOV  = " << getMOV(&SUnits[i]) << "\n";  in computeNodeFunctions()
1937       dbgs() << "\t   D    = " << getDepth(&SUnits[i]) << "\n";  in computeNodeFunctions()
1938       dbgs() << "\t   H    = " << getHeight(&SUnits[i]) << "\n";  in computeNodeFunctions()
1939       dbgs() << "\t   ZLD  = " << getZeroLatencyDepth(&SUnits[i]) << "\n";  in computeNodeFunctions()
1940       dbgs() << "\t   ZLH  = " << getZeroLatencyHeight(&SUnits[i]) << "\n";  in computeNodeFunctions()
2083     std::vector<SUnit *> SUnits(NS.begin(), NS.end());  in registerPressureFilter()  local
2084     llvm::sort(SUnits, [](const SUnit *A, const SUnit *B) {  in registerPressureFilter()
2088     for (auto &SU : SUnits) {  in registerPressureFilter()
2213   for (SUnit &SU : SUnits) {  in groupRemainingNodes()
3173   for (auto &SU : SSD->SUnits)  in computeUnpipelineableNodes()
3200   for (SUnit &SU : SSD->SUnits) {  in normalizeNonPipelinedInstructions()
3238   for (SUnit &SU : SSD->SUnits) {  in isValidSchedule()
3443   for (const SUnit &SU : SSD->SUnits)  in finalizeSchedule()
3647   for (SUnit &SU : DAG->SUnits)  in calculateResMIIDFA()
3652   for (SUnit &SU : DAG->SUnits)  in calculateResMIIDFA()
3713   for (SUnit &SU : DAG->SUnits) {  in calculateResMII()