Re: RFC: Memory SSA. A redesign of the virtual operand scheme.

2006-03-09 Thread Daniel Berlin
On Wed, 2006-03-08 at 15:05 -0500, Andrew Pinski wrote: > I notice in your PDF, you have: > Since alias analysis results are often conservative, may-alias sets my > contain tens > and enve hundreds of symbols. > > Is there a reason why not tune the aliasing anaysis to return more liberal > resul

Re: RFC: Memory SSA. A redesign of the virtual operand scheme.

2006-03-08 Thread Andrew Pinski
> > On 03/08/06 15:05, Andrew Pinski wrote: > > > Is there a reason why not tune the aliasing anaysis to return more liberal > > results > > instead of changing the representation? > > > Yes, as I tried to explain on IRC, alias analysis is an undecidable > problem. It is impossible in general

Re: RFC: Memory SSA. A redesign of the virtual operand scheme.

2006-03-08 Thread Diego Novillo
On 03/08/06 15:05, Andrew Pinski wrote: > Is there a reason why not tune the aliasing anaysis to return more liberal > results > instead of changing the representation? > Yes, as I tried to explain on IRC, alias analysis is an undecidable problem. It is impossible in general to compute an exact

Re: RFC: Memory SSA. A redesign of the virtual operand scheme.

2006-03-08 Thread Andrew Pinski
I notice in your PDF, you have: Since alias analysis results are often conservative, may-alias sets my contain tens and enve hundreds of symbols. Is there a reason why not tune the aliasing anaysis to return more liberal results instead of changing the representation? >From looking at Tramp3D,

RFC: Memory SSA. A redesign of the virtual operand scheme.

2006-02-24 Thread Diego Novillo
Our current representation of memory operations in the IL is fairly heavy and source of lots of painful memory and compile time problems. I have been thinking on and off about the problem for a few months and recently I found a few days to really sit down and look at the problem. I think I may h