80         for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(),  in addPred()
81                EE = PredSU->Succs.end(); II != EE; ++II) {  in addPred()
122   N->Succs.push_back(P);  in addPred()
142       SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),  in removePred()
143                                                        N->Succs.end(), P);  in removePred()
144       assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");  in removePred()
145       N->Succs.erase(Succ);  in removePred()
185     for (SUnit::const_succ_iterator I = SU->Succs.begin(),  in setDepthDirty()
186          E = SU->Succs.end(); I != E; ++I) {  in setDepthDirty()
275     for (SUnit::const_succ_iterator I = Cur->Succs.begin(),  in ComputeHeight()
276          E = Cur->Succs.end(); I != E; ++I) {  in ComputeHeight()
355   if (Succs.size() != 0) {  in dumpAll()
357     for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end();  in dumpAll()
473     unsigned Degree = SU->Succs.size();  in InitDAGTopologicalSorting()
479       assert(SU->Succs.empty() && "SUnit should have no successors");  in InitDAGTopologicalSorting()
554     for (int I = SU->Succs.size()-1; I >= 0; --I) {  in DFS()
555       unsigned s = SU->Succs[I].getSUnit()->NodeNum;  in DFS()
565         WorkList.push_back(SU->Succs[I].getSUnit());  in DFS()