[tree-ssa] PATCH to expose calculation of VLA ARRAY_REFs

Pop Sébastian pop@gauvain.u-strasbg.fr
Wed Mar 5 22:36:00 GMT 2003


On Wed, Mar 05, 2003 at 04:59:40PM -0500, Jason Merrill wrote:
> On Wed, 5 Mar 2003 22:48:15 +0100, Pop Sébastian <pop@gauvain.u-strasbg.fr> wrote:
> 
> > why not simplify_array_ref_to_plus all the ARRAY_REFs?
> 
> Because currently alias set calculations work better with the ARRAY_REF
> form; with an ARRAY_REF it's clear that it references a particular
> subobject of the array.  I'm not sure that this is a reason to keep it in
> the long term, though.  Other thoughts?
> 

It's simpler to deal with a program that contains only pointer arithmetic in 
the dependence test that will be based on the ind var framework I work on:
  http://polaris.cs.uiuc.edu/~pengwu/research/papers/phd-thesis.ps.gz

I think that the information gathered during the monotonic evolution pass will 
make the points-to analysis more precise since we'll get a closed form of the
access function.

The ME dataflow algorithm can be run before points-to analysis, the dependence 
analysis will run just after the points-to analysis.



More information about the Gcc-patches mailing list