When looking for anti-dependences on the critical path, don't bother

examining non-anti-dependence edges.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60496 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/CodeGen/PostRASchedulerList.cpp b/lib/CodeGen/PostRASchedulerList.cpp
index bd9783281cc27292067352f9b38a6cf95844ac31..73caea96b2e31e8d656ec2ef797b0029a013d68f 100644 (file)
--- a/lib/CodeGen/PostRASchedulerList.cpp
+++ b/lib/CodeGen/PostRASchedulerList.cpp
@@ -195,6 +195,10 @@ bool SchedulePostRATDList::BreakAntiDependencies() {
     SDep *Edge = CriticalPath[SU->NodeNum];
     SUnit *NextSU = Edge->Dep;
     unsigned AntiDepReg = Edge->Reg;
+    // Only consider anti-dependence edges.
+    if (!Edge->isAntiDep)
+      continue;
+    assert(AntiDepReg != 0 && "Anti-dependence on reg0?");
     // Don't break anti-dependencies on non-allocatable registers.
     if (!AllocatableSet.test(AntiDepReg))
       continue;