Lines Matching full:succs
720 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
827 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1010 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1088 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1128 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1456 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
2100 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
2162 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2164 if (I->isCtrl()) continue; // ignore chain succs
2216 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2686 for (SUnit::const_succ_iterator SI = SU->Succs.begin(), SE = SU->Succs.end();
2827 for (SUnit::const_succ_iterator II = PredSU->Succs.begin(),
2828 EE = PredSU->Succs.end(); II != EE; ++II) {
2849 for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {
2850 SDep Edge = PredSU->Succs[i];
2896 for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),
2897 E = DUSU->Succs.end(); I != E; ++I) {
2911 while (SuccSU->Succs.size() == 1 &&
2915 SuccSU = SuccSU->Succs.front().getSUnit();
