76         for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(),  in addPred()
77                EE = PredSU->Succs.end(); II != EE; ++II) {  in addPred()
108   N->Succs.push_back(P);  in addPred()
129       for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(),  in removePred()
130              EE = N->Succs.end(); II != EE; ++II)  in removePred()
133           N->Succs.erase(II);  in removePred()
169     for (SUnit::const_succ_iterator I = SU->Succs.begin(),  in setDepthDirty()
170          E = SU->Succs.end(); I != E; ++I) {  in setDepthDirty()
259     for (SUnit::const_succ_iterator I = Cur->Succs.begin(),  in ComputeHeight()
260          E = Cur->Succs.end(); I != E; ++I) {  in ComputeHeight()
320   if (Succs.size() != 0) {  in dumpAll()
322     for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end();  in dumpAll()
435     unsigned Degree = SU->Succs.size();  in InitDAGTopologicalSorting()
441       assert(SU->Succs.empty() && "SUnit should have no successors");  in InitDAGTopologicalSorting()
515     for (int I = SU->Succs.size()-1; I >= 0; --I) {  in DFS()
516       int s = SU->Succs[I].getSUnit()->NodeNum;  in DFS()
523         WorkList.push_back(SU->Succs[I].getSUnit());  in DFS()