121         for (SDep &SuccDep : PredSU->Succs) {  in addPred()
166   N->Succs.push_back(P);  in addPred()
183   SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P);  in removePred()
184   assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");  in removePred()
210   N->Succs.erase(Succ);  in removePred()
225     for (SDep &SuccDep : SU->Succs) {  in setDepthDirty()
304     for (const SDep &SuccDep : Cur->Succs) {  in ComputeHeight()
379   if (SU.Succs.size() > 0) {  in dumpNodeAll()
381     for (const SDep &Dep : SU.Succs) {  in dumpNodeAll()
485     unsigned Degree = SU.Succs.size();  in InitDAGTopologicalSorting()
491       assert(SU.Succs.empty() && "SUnit should have no successors");  in InitDAGTopologicalSorting()
583     for (const SDep &SuccDep : llvm::reverse(SU->Succs)) {  in DFS()
624     for (const SDep &SD : llvm::reverse(SU->Succs)) {  in GetSubGraph()