Update a comment to reflect the current code.

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

diff --git a/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp b/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
index 40191d2c749a0c8f8d1863ddc1d75968d79202ee..c2c91108a547c995df84a28e2a3ecacb2982afbb 100644 (file)
--- a/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
+++ b/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
@@ -119,9 +119,8 @@ void ScheduleDAGList::ReleaseSucc(SUnit *SU, SUnit *SuccSU, bool isChain) {
   }
 #endif
   
-  // Compute how many cycles it will be before this actually becomes
-  // available.  This is the max of the start time of all predecessors plus
-  // their latencies.
+  // Compute the cycle when this SUnit actually becomes available.  This
+  // is the max of the start time of all predecessors plus their latencies.
   // If this is a token edge, we don't need to wait for the latency of the
   // preceeding instruction (e.g. a long-latency load) unless there is also
   // some other data dependence.