This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: alias and pointers analysis
- From: "Diego Novillo" <dnovillo at google dot com>
- To: "Fran Baena" <franbaena at gmail dot com>
- Cc: "J.C. Pizarro" <jcpiza at gmail dot com>, gcc at gcc dot gnu dot org
- Date: Tue, 13 Nov 2007 13:54:59 -0500
- Subject: Re: alias and pointers analysis
- References: <998d0e4a0710252218r4a0ce3c4q52c85207c463f776@mail.gmail.com> <b798aad50710260535r29f63d2cj12da3c402ff92d66@mail.gmail.com> <7ed133d10711131038qdf660c1tcccc5f6cf28b0d84@mail.gmail.com>
On Nov 13, 2007 1:38 PM, Fran Baena <franbaena@gmail.com> wrote:
> 1. Convert the function into GIMPLE form. Implemented in gimplify.c
> and c-simplify.c.
> 2. Find variable references in the code. Implemented in tree-dfa.c.
> 3. Build a control-flow graph (CFG). Implemented in tree-cfg.c.
> This implementation uses the same basic_block structure used by the
> RTL optimizers. This allows us to share most of the existing CFG code.
> 4. Rewrite the tree in SSA form. Implemented in tree-ssa.c.
> [....]
>
> But i still doubt about the process, in some ways:
>
> * Is the step #2 related to the alias analysis?
Yes, though this documentation is fairly old. Finding referenced
variables is needed to determine what symbols are of interest.
> That is hold with the
> def-use chains, and SMT / NMT structures. And, make any sense doing
> these step before the SSA variable versioning? If positive answer,
> why?
Sorry, I don't understand this question.
Diego.