From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 16900 invoked by alias); 1 May 2004 00:11:45 -0000 Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org Received: (qmail 16889 invoked by uid 48); 1 May 2004 00:11:44 -0000 Date: Sat, 01 May 2004 00:11:00 -0000 Message-ID: <20040501001144.16888.qmail@sources.redhat.com> From: "pinskia at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20040430234603.15239.l_belev@yahoo.com> References: <20040430234603.15239.l_belev@yahoo.com> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug middle-end/15239] suboptimal mult-by-const expansion cost limit X-Bugzilla-Reason: CC X-SW-Source: 2004-05/txt/msg00003.txt.bz2 List-Id: ------- Additional Comments From pinskia at gcc dot gnu dot org 2004-05-01 00:11 ------- This should be controlled by the target instead of the normal limit because on something like powerpc multiply by an internment is only 6x (well it depends on the processor really) slower so adding too many adds will just slow it down. -- What |Removed |Added ---------------------------------------------------------------------------- Severity|normal |enhancement Status|UNCONFIRMED |NEW Component|c |middle-end Ever Confirmed| |1 Keywords| |pessimizes-code Last reconfirmed|0000-00-00 00:00:00 |2004-05-01 00:11:43 date| | http://gcc.gnu.org/bugzilla/show_bug.cgi?id=15239