Clarification: this and my first post assume familiarity with choose_multiplier.
lgup=ceiling(log2(divisor))
Currently choose_multiplier initializes mlow, mhigh at post_shift=lgup;
initially 2^n<=mlow=mhigh then we need post_shift=lgup and we need
to use an extra bit for the multiplier, signified
I have no idea what order messages are in now because I wasn't CCed into
this (so was it before?) but it may not be much money. It depends how
long you need it for.
Presumably someone's mentioned swapspace too...
Anyway do let me know, I don't check the mailing lists as often as I'd
like and
Hi Everyone ,
We have the below case ,where store marge pass doing the invalid
optimization (thats our observations on powerpc ) ,i.e
C case :
typedef unsigned int UINT32;
typedef union
{
UINT32 regVal;
struct
{
UINT32 mask:1;
UINT32 a:1;
UINT32 :6;
Cc'ed Kyrill.
-- Forwarded message -
From: Umesh Kalappa
Date: Wed, Jul 11, 2018, 7:37 PM
Subject: GCC 8.1 :Store Merge pass issue (-fstore-merging).
To:
Hi Everyone ,
We have the below case ,where store marge pass doing the invalid
optimization (thats our observations on pow
On Wed, Jul 11, 2018 at 09:48:07PM +0530, Umesh Kalappa wrote:
> Cc'ed Kyrill.
Mailing list is not the right medium to report bugs.
I've filed http://gcc.gnu.org/PR86492 for you, but please next time use
bugzilla.
Jakub
Thank you Jakub and my bad sure next time.
Umesh
On Wed, Jul 11, 2018, 10:17 PM Jakub Jelinek wrote:
> On Wed, Jul 11, 2018 at 09:48:07PM +0530, Umesh Kalappa wrote:
> > Cc'ed Kyrill.
>
> Mailing list is not the right medium to report bugs.
> I've filed http://gcc.gnu.org/PR86492 for you, but p
Snapshot gcc-6-20180711 is now available on
ftp://gcc.gnu.org/pub/gcc/snapshots/6-20180711/
and on various mirrors, see http://gcc.gnu.org/mirrors.html for details.
This snapshot has been generated from the GCC 6 SVN branch
with the following options: svn://gcc.gnu.org/svn/gcc/branches/gcc-6
For the case below, the code generated by “gcc -O3” is very ugly.
char g_d[1024], g_s1[1024], g_s2[1024];
void test_loop(void)
{
char *d = g_d, *s1 = g_s1, *s2 = g_s2;
for( int y = 0; y < 128; y++ )
{
for( int x = 0; x < 16; x++ )
d[x] = s1[x] + s2[x];
Hi,
this is a heads-up that configuring with --enable-maintainer-mode
currently breaks bootstrap; see
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=86450
for details.
Running configure with --enable-maintainer-mode --disable-werror
allows bootstrap to proceed until the underlying issue is fixed
