Lines Matching full:succs
623 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
689 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
868 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
946 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
986 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1272 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
1336 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2018 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
2080 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2082 if (I->isCtrl()) continue; // ignore chain succs
2134 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2735 for (SUnit::const_succ_iterator II = PredSU->Succs.begin(),
2736 EE = PredSU->Succs.end(); II != EE; ++II) {
2757 for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {
2758 SDep Edge = PredSU->Succs[i];
2804 for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),
2805 E = DUSU->Succs.end(); I != E; ++I) {
2819 while (SuccSU->Succs.size() == 1 &&
2823 SuccSU = SuccSU->Succs.front().getSUnit();
2862 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
