Lines Matching defs:TargetSU

601                                                          const SUnit &TargetSU,
605   int UpperBound = Node2Index[TargetSU.NodeNum];
651   // Starting from TargetSU, visit all predecessors up
654   WorkList.push_back(&TargetSU);
706 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {
708   // Is SU reachable from TargetSU via successor edges?
709   if (IsReachable(SU, TargetSU))
711   for (const SDep &PredDep : TargetSU->Preds)
727                                              const SUnit *TargetSU) {
728   assert(TargetSU != nullptr && "Invalid target SUnit");
731   // If insertion of the edge SU->TargetSU would create a cycle
732   // then there is a path from TargetSU to SU.
734   LowerBound = Node2Index[TargetSU->NodeNum];
737   // Is Ord(TargetSU) < Ord(SU) ?
740     // There may be a path from TargetSU to SU. Check for it.
741     DFS(TargetSU, UpperBound, HasLoop);