https://gcc.gnu.org/bugzilla/show_bug.cgi?id=34452
Eric Gallager changed:
What|Removed |Added
CC||egallager at gcc dot gnu.org
--- Comment #1 from pinskia at gcc dot gnu dot org 2007-12-13 10:31 ---
This is related to the patch which Honza posted over a year ago:
http://gcc.gnu.org/ml/gcc-patches/2006-01/msg00267.html
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=34452
--- Comment #2 from tege-gcc at swox dot com 2007-12-13 10:52 ---
It does make sense to bluff somewhat about the costs of the few 3
operand instructions that we have:
lea
mul const, regx, regy
Exactly what cost to assign is not obvious. I think the nominal
cost - epsilon is
--- Comment #3 from rask at gcc dot gnu dot org 2007-12-13 22:01 ---
In reply to comment #2 from Torbjorn Granlund:
Another fix would perhaps be to teach synth_mult to understand that
it's generating code for a 2.5 operand machine (one that can only
do a x= b, not a = b x c, for some
--- Comment #4 from aldot at gcc dot gnu dot org 2007-12-13 22:06 ---
Is this realted to PR30354 and/or PR28417 ?
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=34452
