Lines Matching refs:TargetSU
599 const SUnit &TargetSU,
603 int UpperBound = Node2Index[TargetSU.NodeNum];
649 // Starting from TargetSU, visit all predecessors up
652 WorkList.push_back(&TargetSU);
704 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {
706 // Is SU reachable from TargetSU via successor edges?
707 if (IsReachable(SU, TargetSU))
709 for (const SDep &PredDep : TargetSU->Preds)
717 const SUnit *TargetSU) {
719 // If insertion of the edge SU->TargetSU would create a cycle
720 // then there is a path from TargetSU to SU.
722 LowerBound = Node2Index[TargetSU->NodeNum];
725 // Is Ord(TargetSU) < Ord(SU) ?
728 // There may be a path from TargetSU to SU. Check for it.
729 DFS(TargetSU, UpperBound, HasLoop);