This is the mail archive of the
mailing list for the GCC project.
- From: Alex Turjan <aturjan at yahoo dot com>
- To: Vladimir Makarov <vmakarov at redhat dot com>
- Cc: gcc at gcc dot gnu dot org
- Date: Wed, 6 May 2009 05:27:22 -0700 (PDT)
- Subject: scheduling question
- Reply-to: aturjan at yahoo dot com
During scheduling Im confronted with the fact that an instruction is moved
from the ready list to queued with the cost 2, while according to my
expectations the insn should have been moved to queued with cost 1.
Did anybody experience similar problem?
In case an insn is ready but can bot be schedled in the current
cycle, is it correct (i.e. the generated code is correct) to move the insn
to the queue list with cost 1 ?; no matter what it the value >=1
returned by state_transition.
It seams to me that moving from the ready to queue list with cost >=1 is
an optimization for compilation time.