This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug c/15239] suboptimal mult-by-const expansion cost limit
- From: "jsm at polyomino dot org dot uk" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 1 May 2004 00:07:42 -0000
- Subject: [Bug c/15239] suboptimal mult-by-const expansion cost limit
- References: <20040430234603.15239.l_belev@yahoo.com>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Additional Comments From jsm at polyomino dot org dot uk 2004-05-01 00:07 -------
Subject: Re: New: suboptimal mult-by-const expansion cost limit
On Fri, 30 Apr 2004, l_belev at yahoo dot com wrote:
> The problem is that the limiting of the cost with the cost of 12 adds (the
> second line) is arbitrary and for some architectures (like pentium4) where
And therefore at least it should be made runtime controllable with
--param, even if the default stays fixed at 12, so that it is easier to
test the effects of varying it (on code size and performance benchmarks).
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=15239