74 LLVM_DUMP_METHOD void SDep::dump(const TargetRegisterInfo *TRI) const {  in dump()
106 bool SUnit::addPred(const SDep &D, bool Required) {  in addPred()
108   for (SDep &PredDep : Preds) {  in addPred()
119         SDep ForwardD = PredDep;  in addPred()
121         for (SDep &SuccDep : PredSU->Succs) {  in addPred()
133   SDep P = D;  in addPred()
137   if (D.getKind() == SDep::Data) {  in addPred()
174 void SUnit::removePred(const SDep &D) {  in removePred()
176   SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D);  in removePred()
180   SDep P = D;  in removePred()
183   SmallVectorImpl<SDep>::iterator Succ = llvm::find(N->Succs, P);  in removePred()
186   if (P.getKind() == SDep::Data) {  in removePred()
225     for (SDep &SuccDep : SU->Succs) {  in setDepthDirty()
240     for (SDep &PredDep : SU->Preds) {  in setHeightDirty()
273     for (const SDep &PredDep : Cur->Preds) {  in ComputeDepth()
304     for (const SDep &SuccDep : Cur->Succs) {  in ComputeHeight()
334     if (I->getKind() == SDep::Data && I->getSUnit()->getDepth() > MaxDepth) {  in biasCriticalPath()
371     for (const SDep &Dep : SU.Preds) {  in dumpNodeAll()
381     for (const SDep &Dep : SU.Succs) {  in dumpNodeAll()
503     for (const SDep &PredDep : SU->Preds) {  in InitDAGTopologicalSorting()
518     for (const SDep &PD : SU.Preds) {  in InitDAGTopologicalSorting()
583     for (const SDep &SuccDep : llvm::reverse(SU->Succs)) {  in DFS()
624     for (const SDep &SD : llvm::reverse(SU->Succs)) {  in GetSubGraph()
658     for (const SDep &SD : llvm::reverse(SU->Preds)) {  in GetSubGraph()
711   for (const SDep &PredDep : TargetSU->Preds)  in WillCreateCycle()