Searched refs:TargetSU (Results 1 - 3 of 3) sorted by relevance

/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp600 /// WillCreateCycle - Returns true if adding an edge to TargetSU from SU will
601 /// create a cycle. If so, it is not safe to call AddPred(TargetSU, SU).
602 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {
603 // Is SU reachable from TargetSU via successor edges?
604 if (IsReachable(SU, TargetSU))
607 I = TargetSU->Preds.begin(), E = TargetSU->Preds.end(); I != E; ++I)
614 /// IsReachable - Checks if SU is reachable from TargetSU.
616 const SUnit *TargetSU) {
617 // If insertion of the edge SU->TargetSU woul
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h726 /// IsReachable - Checks if SU is reachable from TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU
731 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU);
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp184 /// IsReachable - Checks if SU is reachable from TargetSU.
185 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { argument
186 return Topo.IsReachable(SU, TargetSU);
189 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
191 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { argument
192 return Topo.WillCreateCycle(SU, TargetSU);

Completed in 340 milliseconds