Lines Matching full:succs
114 N->Succs.push_back(P);
135 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(),
136 EE = N->Succs.end(); II != EE; ++II)
139 N->Succs.erase(II);
142 assert(FoundSucc && "Mismatching preds / succs lists!");
174 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
175 E = SU->Succs.end(); I != E; ++I) {
264 for (SUnit::const_succ_iterator I = Cur->Succs.begin(),
265 E = Cur->Succs.end(); I != E; ++I) {
298 dbgs() << " # succs left : " << NumSuccsLeft << "\n";
325 if (Succs.size() != 0) {
327 for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end();
445 unsigned Degree = SU->Succs.size();
451 assert(SU->Succs.empty() && "SUnit should have no successors");
525 for (int I = SU->Succs.size()-1; I >= 0; --I) {
526 int s = SU->Succs[I].getSUnit()->NodeNum;
533 WorkList.push_back(SU->Succs[I].getSUnit());
