740   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in ScheduleNodeBottomUp()
851   for (auto &Succ : SU->Succs) {  in UnscheduleNodeBottomUp()
865         for (auto &Succ2 : SU->Succs) {  in UnscheduleNodeBottomUp()
1039     for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in CopyAndMoveSuccessors()
1119   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in CopyAndMoveSuccessors()
1159   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in InsertCopiesAndMoveSuccs()
1506     assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");  in ListScheduleBottomUp()
2142     if (PredSU->NumSuccsLeft != PredSU->Succs.size())  in unscheduledNode()
2204   for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in closestSucc()
2258   for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in hasOnlyLiveOutUses()
2729   for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end();  in canClobberReachingPhysRegUse()
2870     for (SUnit::const_succ_iterator II = PredSU->Succs.begin(),  in PrescheduleNodesWithMultipleUses()
2871          EE = PredSU->Succs.end(); II != EE; ++II) {  in PrescheduleNodesWithMultipleUses()
2892     for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {  in PrescheduleNodesWithMultipleUses()
2893       SDep Edge = PredSU->Succs[i];  in PrescheduleNodesWithMultipleUses()
2939       for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),  in AddPseudoTwoAddrDeps()
2940            E = DUSU->Succs.end(); I != E; ++I) {  in AddPseudoTwoAddrDeps()
2954         while (SuccSU->Succs.size() == 1 &&  in AddPseudoTwoAddrDeps()
2958           SuccSU = SuccSU->Succs.front().getSUnit();  in AddPseudoTwoAddrDeps()