diff options
| author | Richard Sandiford <richard.sandiford@linaro.org> | 2011-10-11 08:17:26 +0000 |
|---|---|---|
| committer | Richard Sandiford <rsandifo@gcc.gnu.org> | 2011-10-11 08:17:26 +0000 |
| commit | 3e6aef7c25738081eb41591b0ec9426bd648533d (patch) | |
| tree | 749d0a945628c51c9953f21ffab4f03fbce90182 | |
| parent | 6637388fdc4b4c82c906966024f9012fc0c71df5 (diff) | |
| download | gcc-3e6aef7c25738081eb41591b0ec9426bd648533d.zip gcc-3e6aef7c25738081eb41591b0ec9426bd648533d.tar.gz gcc-3e6aef7c25738081eb41591b0ec9426bd648533d.tar.bz2 | |
modulo-sched.c: Fix comment typo.
gcc/
* modulo-sched.c: Fix comment typo. Mention the possibility
of using scheduling windows of II+1 cycles.
From-SVN: r179788
| -rw-r--r-- | gcc/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/modulo-sched.c | 8 |
2 files changed, 11 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 957d661..bd97d6d 100644 --- 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 --- 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 |