HomeSort by relevance Sort by last modified time
    Searched refs:TargetSU (Results 1 - 15 of 15) sorted by null

  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 599 /// WillCreateCycle - Returns true if adding an edge to TargetSU from SU will
600 /// create a cycle. If so, it is not safe to call AddPred(TargetSU, SU).
601 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *TargetSU, SUnit *SU) {
602 // Is SU reachable from TargetSU via successor edges?
603 if (IsReachable(SU, TargetSU))
606 I = TargetSU->Preds.begin(), E = TargetSU->Preds.end(); I != E; ++I)
613 /// IsReachable - Checks if SU is reachable from TargetSU.
615 const SUnit *TargetSU) {
616 // If insertion of the edge SU->TargetSU would create a cycl
    [all...]
MachinePipeliner.cpp     [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
ScheduleDAG.cpp 568 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
570 bool ScheduleDAGTopologicalSort::WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
571 if (IsReachable(TargetSU, SU))
576 IsReachable(TargetSU, I->getSUnit()))
581 /// IsReachable - Checks if SU is reachable from TargetSU.
583 const SUnit *TargetSU) {
584 // If insertion of the edge SU->TargetSU would create a cycle
585 // then there is a path from TargetSU to SU.
587 LowerBound = Node2Index[TargetSU->NodeNum];
590 // Is Ord(TargetSU) < Ord(SU)
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 719 /// subtree of StartSU and in the predecessor subtree of TargetSU.
720 /// StartSU and TargetSU are not in the array.
721 /// Success is false if TargetSU is not in the successor subtree of
723 std::vector<int> GetSubGraph(const SUnit &StartSU, const SUnit &TargetSU,
726 /// Checks if \p SU is reachable from \p TargetSU.
727 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
729 /// Returns true if addPred(TargetSU, SU) creates a cycle.
730 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
ScheduleDAG.h 694 /// IsReachable - Checks if SU is reachable from TargetSU.
695 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
697 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU
699 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU);
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 740 /// IsReachable - Checks if SU is reachable from TargetSU.
741 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
743 /// WillCreateCycle - Return true if addPred(TargetSU, SU) creates a cycle.
744 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 185 /// IsReachable - Checks if SU is reachable from TargetSU.
186 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) {
187 return Topo.IsReachable(SU, TargetSU);
190 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
192 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
193 return Topo.WillCreateCycle(SU, TargetSU);
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 189 /// IsReachable - Checks if SU is reachable from TargetSU.
190 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) {
191 return Topo.IsReachable(SU, TargetSU);
194 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
196 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
197 return Topo.WillCreateCycle(SU, TargetSU);
    [all...]

Completed in 1400 milliseconds