but i don`t understand even if you propagate the alias analysis from the tree optimizers, the space won1t be saved, you still need many space to save the info. is it not as expansive as the alias analysis based on the RTL representation? what has it saved?thank you.
Qo. Zou > On Monday 04 April 2005 10:09, zouq wrote: >> i can`t find it in current gcc version. >> pleas do me the favor to tell me about it. > > I can only guess that you probably mean the Debray alias analysis > proposed at the GCC summit in 2003. Follow this link for the paper: > "http://gcc.fyxm.net/summit/2003/Alias analysis for intermediate code.pdf" > > That code was never included because this analysis is *very* expensive, > and it should be possible to propagate even better alias analysis info > down from the tree optimizers to RTL. > > Gr. > Steven' >
