HomeSort by: relevance | last modified time | path
    Searched refs:TargetSU (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAG.cpp 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)
725 const SUnit *TargetSU) {
727 // If insertion of the edge SU->TargetSU would create a cycl
    [all...]
MachinePipeliner.cpp 1209 SUnit *TargetSU = D.getSUnit();
1215 TargetSU->addPred(Dep);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ScheduleDAGInstrs.h 271 /// IsReachable - Checks if SU is reachable from TargetSU.
272 bool IsReachable(SUnit *SU, SUnit *TargetSU) {
273 return Topo.IsReachable(SU, TargetSU);
ScheduleDAG.h 740 /// subtree of StartSU and in the predecessor subtree of TargetSU.
741 /// StartSU and TargetSU are not in the array.
742 /// Success is false if TargetSU is not in the successor subtree of
744 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
747 /// Checks if \p SU is reachable from \p TargetSU.
748 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
750 /// Returns true if addPred(TargetSU, SU) creates a cycle.
751 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 211 /// IsReachable - Checks if SU is reachable from TargetSU.
212 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) {
213 return Topo.IsReachable(SU, TargetSU);
216 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
218 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
219 return Topo.WillCreateCycle(SU, TargetSU);

Completed in 31 milliseconds