Lines Matching refs:Succs
740 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
851 for (auto &Succ : SU->Succs) {
865 for (auto &Succ2 : SU->Succs) {
1039 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1119 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1159 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1506 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
2142 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
2204 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2206 if (I->isCtrl()) continue; // ignore chain succs
2258 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2729 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end();
2870 for (SUnit::const_succ_iterator II = PredSU->Succs.begin(),
2871 EE = PredSU->Succs.end(); II != EE; ++II) {
2892 for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {
2893 SDep Edge = PredSU->Succs[i];
2939 for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),
2940 E = DUSU->Succs.end(); I != E; ++I) {
2954 while (SuccSU->Succs.size() == 1 &&
2958 SuccSU = SuccSU->Succs.front().getSUnit();
