From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 12495 invoked by alias); 9 Nov 2007 12:30:47 -0000 Received: (qmail 12195 invoked by uid 48); 9 Nov 2007 12:30:37 -0000 Date: Fri, 09 Nov 2007 12:30:00 -0000 Message-ID: <20071109123037.12194.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug tree-optimization/34027] [4.3 regression] -Os code size nearly doubled In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "jakub at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2007-11/txt/msg00779.txt.bz2 ------- Comment #4 from jakub at gcc dot gnu dot org 2007-11-09 12:30 ------- So then shouldn't this bug be about: unsigned long long foo (unsigned long long ns) { return ns % 1000000000L; } unsigned long long bar (unsigned long long ns) { return ns - (ns / 1000000000L) * 1000000000L; } not compiling the same code at -Os? On x86_64 with -O2 it actually produces identical code with the subtraction, supposedly that's faster. Guess even (ns / 1000000000L) * 1000000000L should be folded into ns - (ns % 1000000000L). -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=34027