Re: [PATCH][6/n] tree LIM TLC

2013-03-12 Thread Steven Bosscher
On Tue, Mar 12, 2013 at 4:33 PM, Richard Biener wrote: > On Tue, 12 Mar 2013, Steven Bosscher wrote: >> I suppose this renders my LIM patch obsolete. > > Not really - it's still > > tree loop invariant motion: 588.31 (78%) usr > > so limiting the O(n^2) dependence testing is a good thing. But I

Re: [PATCH][6/n] tree LIM TLC

2013-03-12 Thread Richard Biener
On Tue, 12 Mar 2013, Steven Bosscher wrote: > On Tue, Mar 12, 2013 at 4:25 PM, Richard Biener wrote: > > > > (Un-?)surprisingly the most effective compile-time reduction for > > the testcase in PR39326 is to employ ao_ref caching for > > alias oracle queries and caching of expanded affine-combinat

Re: [PATCH][6/n] tree LIM TLC

2013-03-12 Thread Steven Bosscher
On Tue, Mar 12, 2013 at 4:25 PM, Richard Biener wrote: > > (Un-?)surprisingly the most effective compile-time reduction for > the testcase in PR39326 is to employ ao_ref caching for > alias oracle queries and caching of expanded affine-combinations > for affine disambiguations. > > This reduces com

[PATCH][6/n] tree LIM TLC

2013-03-12 Thread Richard Biener
(Un-?)surprisingly the most effective compile-time reduction for the testcase in PR39326 is to employ ao_ref caching for alias oracle queries and caching of expanded affine-combinations for affine disambiguations. This reduces compile-time to a manageable amount in the first place for me (so I'm