Lines Matching refs:Succs
741 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
852 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1032 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1112 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1152 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1490 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
2126 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
2188 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2190 if (I->isCtrl()) continue; // ignore chain succs
2242 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2713 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end();
2854 for (SUnit::const_succ_iterator II = PredSU->Succs.begin(),
2855 EE = PredSU->Succs.end(); II != EE; ++II) {
2876 for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {
2877 SDep Edge = PredSU->Succs[i];
2923 for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),
2924 E = DUSU->Succs.end(); I != E; ++I) {
2938 while (SuccSU->Succs.size() == 1 &&
2942 SuccSU = SuccSU->Succs.front().getSUnit();
