This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: Incorrect bitfield aliasing with Tree SSA
- From: Eric Botcazou <ebotcazou at libertysurf dot fr>
- To: "Daniel Berlin" <dberlin at dberlin dot org>
- Cc: gcc-patches at gcc dot gnu dot org, "Adam Nemet" <anemet at caviumnetworks dot com>, "Richard Kenner" <kenner at vlsi1 dot ultra dot nyu dot edu>
- Date: Tue, 19 Jun 2007 13:20:06 +0200
- Subject: Re: Incorrect bitfield aliasing with Tree SSA
- References: <18034.48960.772642.116034@localhost.localdomain> <200706181415.02680.ebotcazou@libertysurf.fr> <4aca3dc20706180719u6303d7bcka2e1d4182480b8e8@mail.gmail.com>
> > OK. Can the "proper" restriction be lifted somehow? I don't understand
> > why it is crucial.
>
> Because we need to know which alias sets can be pointed to by a
> pointer to a containing structure?
Why do we need this exactly? Do you mean that s.i and p->i and treated
differently at the tree level when it comes to computing the alias set?
--
Eric Botcazou