108   for (SDep &PredDep : Preds) {  in addPred()
111     if (!Required && PredDep.getSUnit() == D.getSUnit())  in addPred()
113     if (PredDep.overlaps(D)) {  in addPred()
116       if (PredDep.getLatency() < D.getLatency()) {  in addPred()
117         SUnit *PredSU = PredDep.getSUnit();  in addPred()
119         SDep ForwardD = PredDep;  in addPred()
127         PredDep.setLatency(D.getLatency());  in addPred()
240     for (SDep &PredDep : SU->Preds) {  in setHeightDirty()
241       SUnit *PredSU = PredDep.getSUnit();  in setHeightDirty()
273     for (const SDep &PredDep : Cur->Preds) {  in ComputeDepth()  local
274       SUnit *PredSU = PredDep.getSUnit();  in ComputeDepth()
277                                 PredSU->Depth + PredDep.getLatency());  in ComputeDepth()
503     for (const SDep &PredDep : SU->Preds) {  in InitDAGTopologicalSorting()  local
504       SUnit *SU = PredDep.getSUnit();  in InitDAGTopologicalSorting()
711   for (const SDep &PredDep : TargetSU->Preds)  in WillCreateCycle()  local
712     if (PredDep.isAssignedRegDep() &&  in WillCreateCycle()
713         IsReachable(SU, PredDep.getSUnit()))  in WillCreateCycle()