On Fri, 8 Feb 2013, Richard Biener wrote:
> On Fri, 1 Feb 2013, Richard Biener wrote:
>
> > On Fri, 1 Feb 2013, Jakub Jelinek wrote:
> >
> > > On Fri, Feb 01, 2013 at 10:00:00AM +0100, Richard Biener wrote:
> > > >
> > > > This reduces compile-time of the testcase in PR56113 (with n = 4)
>
On Fri, Feb 08, 2013 at 08:56:42PM +0100, Steven Bosscher wrote:
> On Fri, Feb 8, 2013 at 12:25 PM, Richard Biener wrote:
> >> Steven - can you reproduce your failures (and on which target?)
> >
> > Ping.
>
> I had ASAN failures on ppc64 but I cannot reproduce them anymore.
ASAN on ppc64 is stil
On Fri, Feb 8, 2013 at 12:25 PM, Richard Biener wrote:
>> Steven - can you reproduce your failures (and on which target?)
>
> Ping.
I had ASAN failures on ppc64 but I cannot reproduce them anymore.
Ciao!
Steven
On Fri, 1 Feb 2013, Richard Biener wrote:
> On Fri, 1 Feb 2013, Jakub Jelinek wrote:
>
> > On Fri, Feb 01, 2013 at 10:00:00AM +0100, Richard Biener wrote:
> > >
> > > This reduces compile-time of the testcase in PR56113 (with n = 4)
> > > from 575s to 353s. It does so by reducing the quadra
On Fri, 1 Feb 2013, Jakub Jelinek wrote:
> On Fri, Feb 01, 2013 at 10:00:00AM +0100, Richard Biener wrote:
> >
> > This reduces compile-time of the testcase in PR56113 (with n = 4)
> > from 575s to 353s. It does so by reducing the quadratic algorithm
> > to impose an order on visiting domina
On Fri, Feb 01, 2013 at 10:00:00AM +0100, Richard Biener wrote:
>
> This reduces compile-time of the testcase in PR56113 (with n = 4)
> from 575s to 353s. It does so by reducing the quadratic algorithm
> to impose an order on visiting dominator sons during a domwalk.
>
> Steven raises the is
This reduces compile-time of the testcase in PR56113 (with n = 4)
from 575s to 353s. It does so by reducing the quadratic algorithm
to impose an order on visiting dominator sons during a domwalk.
Steven raises the issue that there exist domwalk users that modify
the CFG during the walk and t
