Lines Matching refs:PredDep
109 for (SDep &PredDep : Preds) { in addPred()
112 if (!Required && PredDep.getSUnit() == D.getSUnit()) in addPred()
114 if (PredDep.overlaps(D)) { in addPred()
117 if (PredDep.getLatency() < D.getLatency()) { in addPred()
118 SUnit *PredSU = PredDep.getSUnit(); in addPred()
120 SDep ForwardD = PredDep; in addPred()
128 PredDep.setLatency(D.getLatency()); in addPred()
239 for (SDep &PredDep : SU->Preds) { in setHeightDirty()
240 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty()
272 for (const SDep &PredDep : Cur->Preds) { in ComputeDepth() local
273 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth()
276 PredSU->Depth + PredDep.getLatency()); in ComputeDepth()
500 for (const SDep &PredDep : SU->Preds) { in InitDAGTopologicalSorting() local
501 SUnit *SU = PredDep.getSUnit(); in InitDAGTopologicalSorting()
708 for (const SDep &PredDep : TargetSU->Preds) in WillCreateCycle() local
709 if (PredDep.isAssignedRegDep() && in WillCreateCycle()
710 IsReachable(SU, PredDep.getSUnit())) in WillCreateCycle()