Lines Matching refs:Succs
739 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
850 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1030 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1110 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1150 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1488 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
2132 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
2194 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2248 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2719 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end();
2860 for (SUnit::const_succ_iterator II = PredSU->Succs.begin(),
2861 EE = PredSU->Succs.end(); II != EE; ++II) {
2882 for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {
2883 SDep Edge = PredSU->Succs[i];
2929 for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),
2930 E = DUSU->Succs.end(); I != E; ++I) {
2944 while (SuccSU->Succs.size() == 1 &&
2948 SuccSU = SuccSU->Succs.front().getSUnit();