This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Fw: Store scheduling with DFA scheduler
- From: Ayal Zaks <ZAKS at il dot ibm dot com>
- To: Vladimir Makarov <vmakarov at redhat dot com>
- Cc: Jon Beniston <jon at beniston dot com>, gcc at gcc dot gnu dot org
- Date: Sun, 1 May 2005 11:58:39 +0300
- Subject: Fw: Store scheduling with DFA scheduler
As you noted, when the scheduler decides between stores and adds it always
prefers the adds (first at t = 5), due to its critical path heuristic. In
Jon's example, stores seem "costly" as one cannot issue a load or store
immediately following a store. Perhaps the scheduler could take the
(resource-related) "cost" of candidates into consideration (in addition to
their latency-related critical path) when making such decisions. Still
heuristically speaking, of-course.
Ayal.