On Fri, Nov 22, 2019 at 3:19 PM Richard Biener
wrote:
>
> On November 22, 2019 6:51:38 AM GMT+01:00, Li Jia He
> wrote:
> >
> >
> >On 2019/11/21 8:10 PM, Richard Biener wrote:
> >> On Thu, Nov 21, 2019 at 10:22 AM Li Jia He
> >wrote:
> >>>
> >>> Hi,
> >>>
> >>> I found for the follow code:
> >>
On November 22, 2019 6:51:38 AM GMT+01:00, Li Jia He
wrote:
>
>
>On 2019/11/21 8:10 PM, Richard Biener wrote:
>> On Thu, Nov 21, 2019 at 10:22 AM Li Jia He
>wrote:
>>>
>>> Hi,
>>>
>>> I found for the follow code:
>>>
>>> #define N 256
>>> int a[N][N][N], b[N][N][N];
>>> int d[N][N], c[N][N];
>>>
On 2019/11/21 8:10 PM, Richard Biener wrote:
On Thu, Nov 21, 2019 at 10:22 AM Li Jia He wrote:
Hi,
I found for the follow code:
#define N 256
int a[N][N][N], b[N][N][N];
int d[N][N], c[N][N];
void __attribute__((noinline))
double_reduc (int n)
{
for (int k = 0; k < n; k++)
{
> > > > Whereas the most recent reported results (10.0.0 20191118) show
> > > > only 2
> > > unexpected failures and no unexpected successes in the gcc summary.
> > >
> > > Which results are you looking at?
> > > Two failures sounds very low, it's probably not running the guality
> > > tests which
On Thu, 21 Nov 2019 at 21:30, Andrew Dean wrote:
>
> > > Whereas the most recent reported results (10.0.0 20191118) show only 2
> > unexpected failures and no unexpected successes in the gcc summary.
> >
> > Which results are you looking at?
> > Two failures sounds very low, it's probably not runn
> > Whereas the most recent reported results (10.0.0 20191118) show only 2
> unexpected failures and no unexpected successes in the gcc summary.
>
> Which results are you looking at?
> Two failures sounds very low, it's probably not running the guality tests
> which
> usually fail.
>
I searched
On Thu, 21 Nov 2019 at 19:11, Andrew Dean via gcc wrote:
>
> I'm curious what other people are doing, because I'm never able to match the
> results that get reported to the test-results list. I created a brand new
> virtual machine running Ubuntu 18.04 (x86_64), installed the prereqs as
> liste
On 21/11/2019 16:40, Joseph Myers wrote:
> On Tue, 19 Nov 2019, Eric S. Raymond wrote:
>
>> Richard Earnshaw (lists) :
>> > Nope, that was from running the go version from yesterday. This one, to
>> > be precise: 1ab3c514c6cd5e1a5d6b68a8224df299751ca637
>> >
>> > This pass used to be very fast
I'm curious what other people are doing, because I'm never able to match the
results that get reported to the test-results list. I created a brand new
virtual machine running Ubuntu 18.04 (x86_64), installed the prereqs as listed
here: https://gcc.gnu.org/install/prerequisites.html, created the
Richard Earnshaw (lists) :
> > But then I get errors:
> >
> > *** Unknown syntax: relax
> >
>
> Change that to
>
> set relax
Oops. He's right. It used to be a command, but that changed recently
as art of a redesign of log levels and options.
--
http://www.catb.org/~esr/";>Er
Joseph Myers :
> I see the changelogs issue is fixed (I can run a conversion past that
> point on a system with 128GB memory, with mergeinfo processing being very
> slow as described by Richard). But then I get errors:
>
> *** Unknown syntax: relax
Missing "relax" command probably means your r
On 21/11/2019 16:40, Joseph Myers wrote:
On Tue, 19 Nov 2019, Eric S. Raymond wrote:
Richard Earnshaw (lists) :
Nope, that was from running the go version from yesterday. This one, to
be precise: 1ab3c514c6cd5e1a5d6b68a8224df299751ca637
This pass used to be very fast a couple of weeks back,
On Tue, 19 Nov 2019, Eric S. Raymond wrote:
> Richard Earnshaw (lists) :
> > Nope, that was from running the go version from yesterday. This one, to
> > be precise: 1ab3c514c6cd5e1a5d6b68a8224df299751ca637
> >
> > This pass used to be very fast a couple of weeks back, but something
> > went in
On 11/20/19 4:14 PM, David Taylor wrote:
Sorry for not responding sooner.
Thanks Martin.
Like Joel we have a third party solution to instrumentation. Part of
my objection to the third party solution is freedom. There are
customizations we would like, but not having source we're at the mercy
o
On Thu, Nov 21, 2019 at 10:22 AM Li Jia He wrote:
>
> Hi,
>
> I found for the follow code:
>
> #define N 256
> int a[N][N][N], b[N][N][N];
> int d[N][N], c[N][N];
> void __attribute__((noinline))
> double_reduc (int n)
> {
>for (int k = 0; k < n; k++)
>{
> for (int l = 0; l < n; l++)
Hi,
I found for the follow code:
#define N 256
int a[N][N][N], b[N][N][N];
int d[N][N], c[N][N];
void __attribute__((noinline))
double_reduc (int n)
{
for (int k = 0; k < n; k++)
{
for (int l = 0; l < n; l++)
{
c[k][l] = 0;
for (int m = 0; m < n; m++)
c[k][
16 matches
Mail list logo
