gcc/

	* modulo-sched.c: Fix comment typo.  Mention the possibility
	of using scheduling windows of II+1 cycles.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@179788 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 957d661..bd97d6d 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2011-10-11  Richard Sandiford  <richard.sandiford@linaro.org>
+
+       * modulo-sched.c: Fix comment typo.  Mention the possibility
+       of using scheduling windows of II+1 cycles.
+
 2011-10-11  Tristan Gingold  <gingold@adacore.com>
 
        * doc/invoke.texi (C Dialect Options): Document

diff --git a/gcc/modulo-sched.c b/gcc/modulo-sched.c
index d12f53b..f2fd445 100644 (file)
--- a/gcc/modulo-sched.c
+++ b/gcc/modulo-sched.c
@@ -545,7 +545,7 @@ set_columns_for_ps (partial_schedule_ptr ps)
    The move is part of a chain that satisfies register dependencies
    between a producing ddg node and various consuming ddg nodes.
    If some of these dependencies have a distance of 1 (meaning that
-   the use is upward-exposoed) then DISTANCE1_USES is nonnull and
+   the use is upward-exposed) then DISTANCE1_USES is nonnull and
    contains the set of uses with distance-1 dependencies.
    DISTANCE1_USES is null otherwise.
 
@@ -1810,7 +1810,11 @@ sms_schedule (void)
    41. endif
    42. compute epilogue & prologue
    43. finish - succeeded to schedule
-*/
+
+   ??? The algorithm restricts the scheduling window to II cycles.
+   In rare cases, it may be better to allow windows of II+1 cycles.
+   The window would then start and end on the same row, but with
+   different "must precede" and "must follow" requirements.  */
 
 /* A limit on the number of cycles that resource conflicts can span.  ??? Should
    be provided by DFA, and be dependent on the type of insn scheduled.  Currently